Distributed probabilistic inferencing in sensor networks using variational approximation

This paper considers the problem of distributed inferencing in a sensor network. It particularly explores the probabilistic inferencing problem in the context of a distributed Boltzmann machine-based framework for monitoring the network. The paper offers a variational mean-field approach to develop communication-efficient local algorithm for variational inferencing in distributed environments (VIDE). It compares the performance of the proposed approximate variational technique with respect to the exact and centralized techniques. It shows that the VIDE offers a much more communication-efficient solution at very little cost in terms of the accuracy. It also offers experimental results in order to substantiate the scalability of the proposed algorithm.     

An Architectural Framework for Accurate Characterization of Network Traffic

In networks carrying large volume of traffic, accurate traffic characterization is necessary for understanding the dynamics and patterns of network resource usage. Previous approaches to flow characterization are based on random sampling of the packets (e.g., Cisco's NetFlow) or inferring characteristics solely based on long lived flows (LLFs) or on lossy data structures (e.g., bloom filters, hash tables). However, none of these approaches takes into account the heavy-tailed nature of the Internet traffic and separates the estimation algorithm from the flow measurement architecture.In this paper, we propose an alternate approach to traffic characterization by closely linking the flow measurement architecture with the estimation algorithm. Our measurement framework stores complete information related to short lived flows (SLFs) while collecting partial information related to LLFs. For real-time separation of LLFs and SLFs, we propose a novel algorithm based on typical sequences from Information theory. The distribution (pdf) and sample space of the underlying traffic is estimated using the non-parametric Parzen window technique and likelihood function defined over the Coupon collector problem. We validate the accuracy and performance of our estimation technique using traffic traces from the internal LAN in our laboratory and from National Library for Applied Network Research (NLANR).     

Emotion Recognition From Facial Expressions and Its Control Using Fuzzy Logic

This paper presents a fuzzy relational approach to human emotion recognition from facial expressions and its control. The proposed scheme uses external stimulus to excite specific emotions in human subjects whose facial expressions are analyzed by segmenting and localizing the individual frames into regions of interest. Selected facial features such as eye opening, mouth opening, and the length of eyebrow constriction are extracted from the localized regions, fuzzified, and mapped onto an emotion space by employing Mamdani-type relational models. A scheme for the validation of the system parameters is also presented. This paper also provides a fuzzy scheme for controlling the transition of emotion dynamics toward a desired state. Experimental results and computer simulations indicate that the proposed scheme for emotion recognition and control is simple and robust, with good accuracy.     

Technique for measuring grating frequency

Experimentally the real and imaginary parts of the Fourier spectrum are separated and used to detect the nature of the object, i.e., whether the object is an odd or even function or a combination of both. A modified Twyman-Green setup is used for this purpose. This type of splitting of the object function into even and odd parts may become useful in different fields of image processing. As an application the same technique is used for accurate measurement of the grating frequency.     

A novel scheme to detect the best cloud service provider using logarithmic operational law in generalized spherical fuzzy environment

Knowledge and Information Systems - Generalized spherical fuzzy number (GSFN) is an extension of spherical fuzzy number (SFN) which deals the uncertainties involved in the real-life problems in...     

An Efficient Parallel Block Compressive Sensing Scheme for Medical Signals and Image Compression

Wireless Personal Communications - Compressive Sensing or Compressed sensing (CS) is a latest technique used for compression of medical signals and medical images which benefits both the speed and...     

A comparative study on the metaheuristic-based optimization of skew composite laminates

Engineering with Computers - Plate structures are the integral parts of any maritime engineering platform. With the recent focus on composite structures, the need for optimizing their design and...     

Self-consistent non-linear physics based predictive model for the computation of THz-signal attenuation in fog with varying visibility in tropical climatic zone

Microsystem Technologies - Absorptive and dispersive properties of atmospheric hydrometeors, affect the propagation of millimetre-wave and submillimeter wave signals. In adverse weather condition,...     

HSWOA: An ensemble of hunger games search and whale optimization algorithm for global optimization

The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.     

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...