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.     

Spacecraft formation reconfiguration with collision avoidance

In this paper we present a behavioral control solution for reconfiguration of a spacecraft formation using the Null-Space Based (NSB) concept. The solution is task based, and aims to reconfigure and maintain a rigid formation while avoiding collisions between spacecraft. A model of relative translation is derived, together with a passivity-based sliding surface controller which globally stabilizes the equilibrium point of the closed-loop system. The NSB control method is implemented by giving each task different priorities and then calculating desired velocity and a Jacobian matrix for each spacecraft and each task. The velocity vector for each task is then projected into the null-space for higher prioritized tasks to remove conflicting velocity components. Simulation results are presented, showing that each spacecraft moves into the predefined formation without breaking any rules for the higher priority tasks, and all collisions are avoided.     

Designing a Controller for a Multi-Train Multi-Track System

The use of formal methods for analyzing and synthesizing a controller for a multi-train multi-track railway system is discussed. The research was motivated by a case study involving the Bay Area Rapid Transit (BART) system. The overall goal is to design a train acceleration control function that enables trains to be safely placed but also increases system throughput. The use of a modeling language for specifying safety properties and a control function is illustrated. The program transformation methodology supported in the HATS system is employed to generate an efficient implementation from a high-level specification of a controller. This implementation can then be used to simulate the controller behavior, thus further enhancing confidence in the design. Properties of optimization transformations can be verified using an rewrite-rule based induction theorem prover Rewrite Rule Laboratory (RRL).     

Anonymization by Local Recoding in Data with Attribute Hierarchical Taxonomies

Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. Among a number of k-anonymisation schemes, local recoding methods are promising for minimising the distortion of a k-anonymity view. This paper addresses two major issues in local recoding k-anonymisation in attribute hierarchical taxonomies. Firstly, we define a proper distance metric to achieve local recoding generalisation with small distortion. Secondly, we propose a means to control the inconsistency of attribute domains in a generalised view by local recoding. We show experimentally that our proposed local recoding method based on the proposed distance metric produces higher quality k-anonymity tables in three quality measures than a global recoding anonymisation method, Incognito, and a multidimensional recoding anonymisation method, Multi. The proposed inconsistency handling method is able to balance distortion and consistency of a generalised view.     

Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal

Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficiency of the second phase which requires the minimization of a non-smooth objective functional. However, it was pointed out in (Chan et al. in Proc. ICIP 2005, pp. 125–128) that the non-smooth data-fitting term in the functional can be deleted since the restoration in the second phase is applied to noisy pixels only. In this paper, we study the analytic properties of the resulting new functional ℱ. We show that ℱ, which is defined in terms of edge-preserving potential functions φ _α , inherits many nice properties from φ _α , including the first and second order Lipschitz continuity, strong convexity, and positive definiteness of its Hessian. Moreover, we use these results to establish the convergence of optimization methods applied to ℱ. In particular, we prove the global convergence of some conjugate gradient-type methods and of a recently proposed low complexity quasi-Newton algorithm. Numerical experiments are given to illustrate the convergence and efficiency of the two methods.

One-dimensional and multi-dimensional substring selectivity estimation

With the increasing importance of XML, LDAP directories, and text-based information sources on the Internet, there is an ever-greater need to evaluate queries involving (sub)string matching. In many cases, matches need to be on multiple attributes/dimensions, with correlations between the multiple dimensions. Effective query optimization in this context requires good selectivity estimates. In this paper, we use pruned count-suffix trees (PSTs) as the basic data structure for substring selectivity estimation. For the 1-D problem, we present a novel technique called MO (Maximal Overlap). We then develop and analyze two 1-D estimation algorithms, MOC and MOLC, based on MO and a constraint-based characterization of all possible completions of a given PST. For the k-D problem, we first generalize PSTs to multiple dimensions and develop a space- and time-efficient probabilistic algorithm to construct k-D PSTs directly. We then show how to extend MO to multiple dimensions. Finally, we demonstrate, both analytically and experimentally, that MO is both practical and substantially superior to competing algorithms. Received April 28, 2000 / Accepted July 11, 2000     

Calculations of diffusion and diffusion-limited processes in Ni3Al using accelerated molecular dynamics

We present a systematic microscopic approach to diffusion and diffusion-limited processes in Ni₃Al. These processes have been identified as controlling the deformation of the material under specific circumstances. The embedded atom method calculations are done using kinetic Monte Carlo combined with the Dimer method of finding saddlepoints. We compute the tracer diffusivities as functions of composition and temperature. The comparison with available experiments is good. We find that at temperatures below about 1000 K, the diffusivity is a sharp function of composition, showing a pronounced dip on the Ni-rich side at 76 at.% Ni. This agrees well with experiment, except that the experiments show this structure setting in a temperatures below about 1300 K. We show that the structure arises from the composition dependence of both the vacancy formation energy and pre-exponential of the diffusivity. We also compute the mobility of an anti-phase boundary perpendicular to its plane, and conclude that vacancy-assistance is very plausible. We conclude that the kMC + Dimer method works well for these problems above 700 K but less effectively below, owing to the presence of short-range, low-energy hops that tend to localize the vacancy and lower the efficiency of the calculation.     

Self-determination and conflict in romantic relationships.

Four studies examined associations between E. L. Deci and R. M. Ryan's (1985, 2000) construct of autonomy, responses to relationship disagreements, and dissatisfaction after conflict. In Study 1, diary data showed that trait autonomy predicted relationship autonomy, which in turn predicted relative satisfaction after disagreements. In Study 2, trait autonomy predicted relationship autonomy, which was associated with less defensive and more understanding responses to conflict. Studies 3 and 4 examined whether one's partner's relationship autonomy uniquely predicted reported and observed behavior during conflict. Autonomous reasons for being in the relationship (of both self and partner) predicted both reported and observed responses to conflict and feelings of satisfaction. (PsycINFO Database Record (c) 2010 APA, all rights reserved)