A password based authentication scheme for wireless multimedia systems

In this digital era, where Internet of Things (IoT) is increasing day by day, use of resource constrained devices is also increasing. Indeed, the features such as low cost, less maintenance, more adaptive to hostile environment, etc. make the wireless multimedia devices to be the best choice as the resource constrained devices. For the security, the end user device requires to establish the session key with the server before transferring the data. Mobile is one of the device having more and more usage as wireless multimedia device in recent years. In 2013, Li et al. proposed an efficient scheme for the wireless mobile communications and claimed it to be secure against various attacks. Recently, Shen et al. claimed that the scheme of Li et al. is still vulnerable to the privileged insider attack, the stolen verifier attack and finally proposed a scheme to withstand the mentioned and other attacks. However, in this paper we claim that the scheme of Shen et al. is still susceptible to the user anonymity, the session specific temporary information attack and the replay attack. In addition, Shen et al.’s scheme requires more time due to many operations. Further, we propose an efficient scheme that is secure against various known attacks and due to reduced time complexity our scheme is a preferred choice for the wireless mobile networks and hence for wireless multimedia systems.     

Dataflow Architectures for GALS

In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on the channels. KPN provides a semantic model of computation, where a computation can be expressed as a set of asynchronously communicating processes. However, the unbounded FIFO based asynchrony is not realizable in practice and hence requires refinement in real hardware. In this work, we start with KPN as the model of computation for GALS, and discuss how different GALS architectures can be realized. We borrow some ideas from existing dataflow architectures for our GALS designs.     

Constructing malware normalizers using term rewriting

A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-propagating malware in order to create variation in the distributed programs. Program normalization is a way to remove variety introduced by mutation engines, and can thus simplify the problem of detecting variant strains. This paper introduces the “normalizer construction problem” (NCP), and formalizes a restricted form of the problem called “NCP=”, which assumes a model of the engine is already known in the form of a term rewriting system. It is shown that even this restricted version of the problem is undecidable. A procedure is provided that can, in certain cases, automatically solve NCP= from the model of the engine. This procedure is analyzed in conjunction with term rewriting theory to create a list of distinct classes of normalizer construction problems. These classes yield a list of possible attack vectors. Three strategies are defined for approximate solutions of NCP=, and an analysis is provided of the risks they entail. A case study using the virus suggests the approximations may be effective in practice for countering mutated malware. R. Mathur is presently at McAfee AVERT Labs.     

From template to image: reconstructing fingerprints from minutiae points

Most fingerprint-based biometric systems store the minutiae template of a user in the database. It has been traditionally assumed that the minutiae template of a user does not reveal any information about the original fingerprint. In this paper, we challenge this notion and show that three levels of information about the parent fingerprint can be elicited from the minutiae template alone, viz., 1) the orientation field information, 2) the class or type information, and 3) the friction ridge structure. The orientation estimation algorithm determines the direction of local ridges using the evidence of minutiae triplets. The estimated orientation field, along with the given minutiae distribution, is then used to predict the class of the fingerprint. Finally, the ridge structure of the parent fingerprint is generated using streamlines that are based on the estimated orientation field. Line integral convolution is used to impart texture to the ensuing ridges, resulting in a ridge map resembling the parent fingerprint. The salient feature of this noniterative method to generate ridges is its ability to preserve the minutiae at specified locations in the reconstructed ridge map. Experiments using a commercial fingerprint matcher suggest that the reconstructed ridge structure bears close resemblance to the parent fingerprint     

Electrical transport in copper chromite catalyst

The electrical conductivity, σ, and thermoelectric power, S, of copper chromite (CuCr₂O₄) are reported in the temperature range 295 to 815 K. A break (T _B) in the slope of the plot of log σ against T ^?1 was observed around 556 K. Apart from this break, the curves are linear, and their slopes correspond to activation energies of 0.60 eV (T _B<556 K) and 1.22 eV (T _B>556 K). A break (T′ _B) in the slope of the -S against T ^?1 plot was also observed round 556 K. Apart from the break at this temperature, the S against T ^?1 curves are linear. At T′ _B>556, S can be expressed by the relation $$S = - \left[ {\left( {\frac{{0.65 eV}}{{{\text{2}}eT}}} \right) + (0.42) mV K^{ - {\text{1}}} } \right]$$ The mechanism involved in the electrical transport is the hopping of holes from Cr⁴⁺ centres to neighbouring Cr³⁺ ions. The typical hopping mobility of the holes is of the order of 10⁶ m² V^?1 sec^?1. The mobility activation energy of the holes in CuCr₂O₄ decreases with temperature due to the smoothing of the potential barriers between Cr⁴⁺ and Cr³⁺ sites.     

Thermopower ofAg_{2 + \delta } S across theα-β transitionacross theα-β transition

Thermopower data of S in both of itsα- andβ-phases are reported and the results are compared with the data on Se. Communication No. 129 from the Solid State and Structural Chemistry Unit.     

Extinction of light in Brewster polarizers: a shadowlike phenomenon

A Brewster polarizer in this study is any dielectric plane reflecting surface reflecting light at or near the Brewster angle of incidence. In this paper, we consider an interesting phenomenon observed when we use an extended source of light or a cone of light with its axis incident on the plane surface at the Brewster angle. The resulting reflected light is viewed (a) through an ordinary sheet polarizer and (b) after reflection from another Brewster polarizer. The extinction pattern of light by such a system is in the form of an elongated black shadow in (a) and a nearly circular shadow in (b), respectively. These shadows are explained on the basis and use of the familiar Fresnel equations at a plane interface between two dielectric media. Photographs of the shadows are also presented.     

RAPID ONLINE MONITORING OF A HETEROGENEOUS CATALYST BY A PULSED REACTOR COUPLED TO GC-MS

A rapid screening system for heterogeneous catalyst discovery has been developed by coupling an in-house designed and fabricated high temperature vapor phase pulse reactor on-line to a GC-MS. The incorporation of gas chromatography for separation of the products with the mass spectrometry system allowed simultaneous identification and determination of reaction products and substrate conversion. This system was employed to study the vapor phase catalytic hydride transfer reduction (CHTR) of nitrobenzene with methanol as hydrogen donor on an MgO catalyst as a model reaction. Structural information of all the by-products that were formed was useful to understand the reaction mechanism. The products obtained with the new screening technique were in good agreement with conventional bench scale experiments. The rapid online screening provided an efficient methodology for optimization of reaction conditions such as catalyst loading, reaction temperature, and mole ratios. Response Surface Methodology (RSM) was used to optimize the conversion of reactants and selectivity of products.     

Coupled dynamical system based arm–hand grasping model for learning fast adaptation strategies

Performing manipulation tasks interactively in real environments requires a high degree of accuracy and stability. At the same time, when one cannot assume a fully deterministic and static environment, one must endow the robot with the ability to react rapidly to sudden changes in the environment. These considerations make the task of reach and grasp difficult to deal with. We follow a Programming by Demonstration (PbD) approach to the problem and take inspiration from the way humans adapt their reach and grasp motions when perturbed. This is in sharp contrast to previous work in PbD that uses unperturbed motions for training the system and then applies perturbation solely during the testing phase. In this work, we record the kinematics of arm and fingers of human subjects during unperturbed and perturbed reach and grasp motions. In the perturbed demonstrations, the target’s location is changed suddenly after the onset of the motion. Data show a strong coupling between the hand transport and finger motions. We hypothesize that this coupling enables the subject to seamlessly and rapidly adapt the finger motion in coordination with the hand posture. To endow our robot with this competence, we develop a coupled dynamical system based controller, whereby two dynamical systems driving the hand and finger motions are coupled. This offers a compact encoding for reach-to-grasp motions that ensures fast adaptation with zero latency for re-planning. We show in simulation and on the real iCub robot that this coupling ensures smooth and “human-like” motions. We demonstrate the performance of our model under spatial, temporal and grasp type perturbations which show that reaching the target with coordinated hand–arm motion is necessary for the success of the task.