Multilevel segmentation of Hippocampus images using global steered quantum inspired firefly algorithm

Applied Intelligence - Microscopic Image segmentation has a crucial role in detecting and diagnosing numerous critical diseases like Alzheimer’s disease, Kidney disease, Cancer, many...     

A revisit to non-maximally entangled mixed states: teleportation witness,noisy channel and discord

We constructed a class of non-maximally entangled mixed states (Adhikari et al. in Quantum Inf Comput 10:0398, 2010) and extensively studied their entanglement properties and also their usefulness as teleportation channels. In this article, we have revisited our constructed state and have studied it from three different perspectives. Since every entangled state is associated with a witness operator, we have found a suitable entanglement as well as teleportation witness operator for our non-maximally entangled mixed states. We considered the noisy channel’s effects on our constructed states to see how much it affects the states’ capacities as teleportation channels. For this purpose, we have mainly focussed on amplitude damping channel. A comparative study on concurrence and quantum discord of our constructed state of Adhikari et al. (2010) has also been carried out here.     

Reconstruction Based Recognition of Scenes with Multiple Repeated Components

This paper proposes an invariance based recognition scheme for scenes with multiple repeated components. The scheme considers three component subsets which characterize the scene completely. Each such three component subset is reconstructed using single image based information. We have developed a mathematical framework for the projective reconstruction based on relative affine structure of each such three component building block. This is extended to the case when each of the components is a quadric. A set of projective invariants of three quadrics has also been obtained by us. Although the reconstruction scheme is general and applicable to all multiple repeated components, it requires the computation of infinite homography. The infinite homography and hence the reconstruction scheme are only image computable with the given information in the case of translational repetition. We therefore develop a recognition strategy for the specific case of translationally repeated quadrics. As a recognition strategy for scenes with multiple translationally repeated quadric components, we propose to compute and store invariant values for each such three component subsets. Experiments on real data have shown the applicability of this approach for recognition of aerial images of power plants. The discriminatory power of the invariants and the stability of the recognition results have also been experimentally demonstrated.     

Reconstruction-based recognition of scenes with translationallyrepeated quadrics

This paper addresses the problem of invariant-based recognition of quadric configurations from a single image. These configurations consist of a pair of rigidly connected translationally repeated quadric surfaces. This problem is approached via a reconstruction framework. A new mathematical framework, using relative affine structure, on the lines of Luong and Vieville (1996), has been proposed. Using this mathematical framework, translationally repeated objects have been projectively reconstructed, from a single image, with four image point correspondences of the distinguished points on the object and its translate. This has been used to obtain a reconstruction of a pair of translationally repeated quadrics. We have proposed joint projective invariants of a pair of proper quadrics. For the purpose of recognition of quadric configurations, we compute these invariants for the pair of reconstructed quadrics. Experimental results on synthetic and real images, establish the discriminatory power and stability of the proposed invariant-based recognition strategy. As a specific example, we have applied this technique for discriminating images of monuments which are characterized by translationally repeated domes modeled as quadrics     

Numerical inversion of multidimensional Laplace transforms by the Laguerre method

Numerical transform inversion can be useful to solve stochastic models arising in the performance evaluation of telecommunications and computer systems. We contribute to this technique in this paper by extending our recently developed variant of the Laguerre method for numerically inverting Laplace transforms to multidimensional Laplace transforms. An important application of multidimensional inversion is to calculate time-dependent performance measures of stochastic systems. Key features of our new algorithm are: (1) an efficient FFT-based extension of our previously developed variant of the Fourierseries method to calculate the coefficients of the multidimensional Laguerre generating function, and (2) systematic methods for scaling to accelerate convergence of infinite series, using Wynn's ε-algorithm and exploiting geometric decay rates of Laguerre coefficients. These features greatly speed up the algorithm while controlling errors. We illustrate the effectiveness of our algorithm through numerical examples. For many problems, hundreds of function evaluations can be computed in just a few seconds.     

On a batch arrival Poisson queue with a random setup time and vacation period

The single server queue with vacation has been extended to include several types of extensions and generalisations, to which attention has been paid by several researchers (e.g. see Doshi, B. T., Single server queues with vacations — a servey. Queueing Systems, 1986, 1, 29–66; Takagi, H., Queueing Analysis: A Foundation of Performance evaluation, Vol. 1, Vacation and Priority systems, Part. 1. North Holland, Amsterdam, 1991; Medhi, J., Extensions and generalizations of the classical single server queueing system with Poisson input. J. Ass. Sci. Soc., 1994, 36, 35–41, etc.). The interest in such types of queues have been further enhanced in resent years because of their theoretical structures as well as their application in many real life situations such as computer, telecommunication, airline scheduling as well as production/inventory systems. This paper concerns the model building of such a production/inventory system, where machine undergoes extra operation (such as machine repair, preventive maintenance, gearing up machinery, etc.) before the processing of raw material is to be started. To be realistic, we also assume that raw materials arrive in batch. This production system can be formulated as an M^x/M/1 queues with a setup time. Further, from the utility point of view of idle time this model can also be formulated as a case of multiple vacation model, where vacation begins at the end of each busy period. Besides, the production/inventory systems, such a model is generally fitted to airline scheduling problems also. In this paper an attempt has been made to study the steady state behavior of such an M^x/M/1 queueing system with a view to provide some system performance measures, which lead to remarkable simplification when solving other similar types of queueing models.This paper deals with the steady state behaviour of a single server batch arrival Poisson queue with a random setup time and a vacation period. The service of the first customer in each busy period is preceded by a random setup period, on completion of which service starts. As soon as the system becomes empty the server goes on vacation for a random length of time. On return from vacation, if he finds customer(s) waiting, the server starts servicing the first customer in the queue. Otherwise it takes another vacation and so on. We study the steady state behaviour of the queue size distribution at random (stationary) point of time as well as at departure point of time and try to show that departure point queue size distribution can be decomposed into three independent random variables, one of which is the queue size of the standard M^x/M/1 queue. The interpretation of the other two random variables will also be provided. Further, we derive analytically explicit expressions for the system state (number of customers in the system) probabilities and provide their appropriate interpretations. Also, we derive some system performance measures. Finally, we develop a procedure to find mean waiting time of an arbitrary customer.     

Dielectric and impedance spectroscopy of barium orthovanadate ceramics

Barium orthovanadate (Ba₃V₂O₈), a derivative of perovskite family has been prepared using a mixed-oxide technique. The room temperature X-ray diffraction analysis has confirmed the formation of a single phase compound in trigonal crystal structure. The study of microstructure by scanning electron microscopy shows that the compound has well defined grains, distributed uniformly throughout the surface. The studies of dielectric parameters (ε_r and tan δ) of the compound as a function of temperature at three different frequencies (100, 500, 1,000 kHz) exhibit that they are almost temperature independent at low and medium temperature ranges. Detailed studies of impedance and related parameters exhibit that the electrical properties of the material are strongly dependent on temperature, and bear a good correlation with its microstructures. The bulk resistance, evaluated from complex impedance spectra, is found to be decreasing with rise in temperature. It shows that the material has negative temperature co-efficient of resistance similar to that of semiconductors. The same behaviour has also been observed in the study of I–V characteristics of the material. The complex electric modulus analysis indicates the possibility of hopping conduction mechanism in the system with non-exponential type of conductivity relaxation. The nature of variation of dc conductivity with temperature confirms the Arrhenius behavior of the material. The ac conductivity spectra show a typical signature of an ionic conducting system, and are found to obey Jonscher’s universal power law.