Polynomial based scheme (PBS) for establishing Authentic Associations in Wireless Mesh Networks

The varying degree of mobility of Mesh Clients has provided much more flexibility in Wireless Mesh Networks, and establishing an Authentic Association among entities is a non-trivial problem. In this paper, we introduce a Polynomial Based scheme which provides pair-wise connectivity, low communication, marginal storage overhead and high scalability while making on the fly Authentic Association feasible. The proposed scheme is also observed to be resilient against both traffic analysis and node capture attacks.     

Fairness of Transitions in Diagnosability of Discrete Event Systems

Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle. Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions. Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the time complexities of other DES diagnosability analysis methods reported in the literature.     

Genetic algorithms based robust frequency estimation of sinusoidal signals with stationary errors

In this paper, we consider the fundamental problem of frequency estimation of multiple sinusoidal signals with stationary errors. We propose genetic algorithm and outlier-insensitive criterion function based technique for the frequency estimation problem. In the simulation studies and real life data analysis, it is observed that the proposed genetic algorithm based robust frequency estimators are able to resolve frequencies of the sinusoidal model with high degree of accuracy. Among the proposed methods, the genetic algorithm based least squares estimator, in the no-outlier scenario, provides efficient estimates, in the sense that their mean square errors attain the corresponding Cramér-Rao lower bounds. In the presence of outliers, the proposed robust methods perform quite well and seem to have a fairly high breakdown point with respect to level of outlier contamination. The proposed methods significantly do not depend on the initial guess values required for other iterative frequency estimation methods.     

Effect of geometry on droplet formation in the squeezing regime in a microfluidic T-junction

In the surface tension-dominated microchannel T-junction, droplets can be formed as a result of the mixing of two dissimilar, immiscible fluids. This article presents results for very low Capillary numbers and different flow rates of the continuous and dispersed phases. Through three-dimensional lattice Boltzmann-based simulations, the mechanism of the formation of “plugs” in the squeezing regime has been examined and the size of the droplets quantified. Results for Re_\textc << 1 Re_{\text{c}} \ll 1 show the dependence of flow rates of the two fluids on the length of the droplets formed, which is compared with existing experimental data. It is shown that the size of plugs formed decreases as the Capillary number increases in the squeezing regime. This article clearly shows that the geometry effect, i.e., the widths of the two channels and the depth of the assembly, plays an important role in the determination of the length of the plugs, a fact that was ignored in earlier experimental correlations.     

A dynamic attribute-based data filtering and recovery scheme for web information processing

Web data being transmitted over a network channel on the Internet with excessive amount of data causes data processing problems, which include selectively choosing useful information to be retained for various data applications. In this paper, we present an approach for filtering less-informative attribute data from a source Website. A scheme for filtering attributes, instead of tuples (records), from a Website becomes imperative, since filtering a complete tuple would lead to filtering some informative, as well as less-informative, attribute data in the tuple. Since filtered data at the source Website may be of interest to the user at the destination Website, we design a data recovery approach that maintains the minimal amount of information for data recovery purpose while imposing minimal overhead for data recovery at the source Website. Our data filtering and recovery approach (1) handles a wide range of Web data in different application domains (such as weather, stock exchanges, Internet traffic, etc.), (2) is dynamic in nature, since each filtering scheme adjusts the amount of data to be filtered as needed, and (3) is adaptive, which is appealing in an ever-changing Internet environment.     

Express Virtual Channels with Capacitively Driven Global Links

Networks on chip must deliver high bandwidth at low latencies while keeping within a tight power envelope. Using express virtual channels for flow control improves energy-delay throughput by letting packets bypass intermediate routers, but EVCs have key limitations. Nochi (NoC with hybrid interconnect) overcomes these limitations by transporting data payloads and control information on separate planes, optimized for bandwidth and latency respectively.     

Differential regulation of redox proteins and chaperones in HbEβ-thalassemia erythrocyte proteome

Purpose: In (hemoglobin, Hb) HbEβ‐thalassemia, HbE (β‐26 Glu→Lys) interacts with β‐thalassemia to produce clinical manifestation of varying severity. This is the first proteomic effort to study changes in protein levels of erythrocytes isolated from HbEβ‐thalassemic patients compared to normal. Experimental design: We have used 2‐DE and MALDI‐MS/MS‐based techniques to investigate the differential proteome profiling of membrane and Hb‐depleted fraction of cytosolic proteins of erythrocytes isolated from the peripheral blood samples of HbEβ‐thalassemia patients and normal volunteers. Results: Our study showed that redox regulators such as peroxiredoxin 2, Cu‐Zn superoxide dismutase and thioredoxin and chaperones such as α‐hemoglobin stabilizing protein and HSP‐70 were upregulated in HbEβ‐thalassemia. We have also observed larger amounts of membrane associated globin chains and indications of disruption of spectrin‐based junctional complex in the membrane skeleton of HbEβ‐thalassemic erythrocytes upon detection of low molecular weight fragments of β‐spectrin and decrease in β‐actin and dematin content. Conclusion and clinical relevance: We have observed interesting changes in the proteomic levels of redox regulators and chaperons in the thalassemic hemolysates and have observed strong correlation or association of the extent of such proteomic changes with HbE levels. This could be important in understanding the role of HbE in disease progression and pathophysiology.     

Perceptron training algorithms designed using discrete-time control Liapunov functions

Perceptrons, proposed in the seminal paper McCulloch–Pitts of 1943, have remained of interest to neural network community because of their simplicity and usefulness in classifying linearly separable data and can be viewed as implementing iterative procedures for “solving” linear inequalities. Gradient descent and conjugate gradient methods, normally used for linear equalities, can be used to solve linear inequalities by simple modifications that have been proposed in the literature but not been analyzed completely. This paper applies a recently proposed control-inspired approach to the design of iterative steepest descent and conjugate gradient algorithms for perceptron training in batch mode, by regarding certain parameters of the training/algorithm as controls and then using a control Liapunov technique to choose appropriate values of these parameters.     

ILP-assisted de novo drug design

The accurate and early detection of epileptic seizures in continuous electroencephalographic (EEG) data has a growing role in the management of patients with epilepsy. Early detection allows for therapy to be delivered at the start of seizures and for caregivers to be notified promptly about potentially debilitating events. The challenge to detecting epileptic seizures, however, is that seizure morphologies exhibit considerable inter-patient and intra-patient variability. While recent work has looked at addressing the issue of variations across different patients (inter-patient variability) and described patient-specific methodologies for seizure detection, there are no examples of systems that can simultaneously address the challenges of inter-patient and intra-patient variations in seizure morphology. In our study, we address this complete goal and describe a multi-task learning approach that trains a classifier to perform well across many kinds of seizures rather than potentially overfitting to the most common seizure types. Our approach increases the generalizability of seizure detection systems and improves the tradeoff between latency and sensitivity versus false positive rates. When compared against the standard approach on the CHB–MIT multi-channel scalp EEG data, our proposed method improved discrimination between seizure and non-seizure EEG for almost 83 % of the patients while reducing false positives on nearly 70 % of the patients studied.     

An improved timestamp-based remote user authentication scheme

To protect the remote server from various malicious attacks, many authentication schemes have been proposed. Some schemes have to maintain a password verification table in the remote server for checking the legitimacy of the login users. To overcome potential risks of verification tables, researchers proposed remote user authentication schemes using smartcard, in which the remote server only keeps a secret key for computing the user’s passwords and does not need any verification table for verifying legal user. In 2003 Shen, Lin, and Hwang proposed a timestamp-based password authentication scheme using smartcards in which the remote server does not need to store the passwords or verification table for user authentication. Unfortunately, this scheme is vulnerable to some deadly attacks. In this paper, we analyze few attacks and finally propose an improved timestamp-based remote user authentication scheme. The modified scheme is more efficient and secure than original scheme.