SearcharxivSearch

arXiv subjects

A. Unnikrishnan

Publications and source records attributed to A. Unnikrishnan.

3 recordsLinked to original sources

Intermediate Field Spin(on) Dynamics in $\alpha$-RuCl$_3$

We present comprehensive inelastic neutron spectroscopic maps of the magnetic field-induced disordered phase of the Kitaev quantum spin liquid candidate material $\alpha$-RuCl$_3$. For fields along both in-plane high-symmetry directions we observe that the spin excitation spectrum at and above a magnetic field of 8~T is gapped. Excitation modes then sharpen for increasing field but are consistently broader than experimental resolution even at 13.5~T. The out-of-plane dispersion diminishes in the 7-10~T regime, signifying enhanced two-dimensional behavior as the in-plane liquid correlations are established. In this regime, excitations are very broad and largely flat for all accessible energy-momenta, which is kinematically at odds with a magnon-decay picture. By contrast, a continuum of fractionalized excitations naturally yields a broad continuum response, which crucially may be accompanied by sharper modes of bound states of fractionalized excitations. Their damping by the continuum accounts for the observed spectral broadening and field dependence. Our results provide strong evidence for the existence of fractionalized excitations in $\alpha$-RuCl$_3$ in a magnetic field.

cond-mat.str-el

Gray Level Co-Occurrence Matrices: Generalisation and Some New Features

Gray Level Co-occurrence Matrices (GLCM) are one of the earliest techniques used for image texture analysis. In this paper we defined a new feature called trace extracted from the GLCM and its implications in texture analysis are discussed in the context of Content Based Image Retrieval (CBIR). The theoretical extension of GLCM to n-dimensional gray scale images are also discussed. The results indicate that trace features outperform Haralick features when applied to CBIR.

cs.CV

A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment process

cs.NI