Nanotechnology based electrical control and navigation system for worm guidance using electric field gradient

Microsystem Technologies - The objective of this research paper is to find the way to guide the worms in an electric field gradient for a specific time period. Research has been done to guide the...     

Formalizing a hierarchical file system

An abstract file system is defined here as a partial function from (absolute) paths to data. Such a file system determines the set of valid paths. It allows the file system to be read and written at a valid path, and it allows the system to be modified by the Unix operations for creation, removal, and moving of files and directories. We present abstract definitions (axioms) for these operations. This specification is refined towards a pointer implementation. The challenge is to have a natural abstraction function from the implementation to the specification, to define operations on the concrete store that behave exactly in the same way as the corresponding functions on the abstract store, and to prove these facts. To mitigate the problems attached to partial functions, we do this in two steps: first a refinement towards a pointer implementation with total functions, followed by one that allows partial functions. These two refinements are proved correct by means of a number of invariants. Indeed, the insights gained consist, on the one hand, of the invariants of the pointer implementation that are needed for the refinement functions, and on the other hand of the precise enabling conditions of the operations on the different levels of abstraction. Each of the three specification levels is enriched with a permission system for reading, writing, or executing, and the refinement relations between these permission systems are explored. Files and directories are distinguished from the outset, but this rarely affects our part of the specifications. All results have been verified with the proof assistant PVS, in particular, that the invariants are preserved by the operations, and that, where the invariants hold, the operations commute with the refinement functions.     

Analyzing readers behavior in downloading articles from IEEE digital library: a study of two selected journals in the field of education

Scientometrics - In this study, we investigate the downloads behavior of readers for two well-known IEEE journals in the field of education, i.e., IEEE Transactions on Learning Technologies (TLT)...     

Beyond network simulators: Fostering novel distributed applications and protocols through extendible design

Simulation has been of paramount importance to the development of novel Internet protocols. Such an approach typically focuses on one of three domains: wireless and other link-layer technologies, routing protocols, and transport-layer mechanisms and protocols. Existing techniques can tackle well simulation at layers 2, 3 and 4 of the TCP/IP architecture, but are not flexible enough to appropriately deal with application-layer protocols. These require simulators that support the modeling of networks and components with different levels of abstraction. Simmcast is an object-oriented framework that focuses on the necessary flexibility for application-layer protocol research. A simulation can be developed by the simple extension of building blocks that closely resemble components of a real network such as hosts, links and routers. The internal complexity of these components, however, is hidden from the user, so he/she can focus on the implementation of the desired protocol characteristics. This paper describes the flexible simulation architecture proposed and instantiated through Simmcast, and draws lessons from our experience in designing, implementing and deploying it. We also present framework instances used to evaluate application-layer protocols, exemplifying how different kinds of simulations can be developed with Simmcast.     

Estimation of Desired Motion Intention and compliance control for upper limb assist exoskeleton

International Journal of Control, Automation and Systems - In this paper, we have addressed two issues for upper limb assist exoskeleton. 1) Estimation of Desired Motion Intention (DMI); 2) Robust...     

Model-based design verification for embedded systems through SVOCL: an OCL extension for SystemVerilog

Model Based System Engineering (MBSE) is a renowned approach in the context of embedded systems development. It is frequently used to deal with the structural and behavioral aspects of system design. However, the verification of system design is generally performed in isolation. It is particularly true in the context of assertion based verification. Consequently, there is a huge gap between system design and its verification that seriously effects the productivity and time-to market objectives. Therefore, in this research, we target to reduce this gap by exploiting the features of MBSE and SystemVerilog assertions (SVA’s). This article introduces a novel MBSE approach to model the design verification aspects of embedded systems, along with the system design (structural and behavioral aspects). We propose SystemVerilog in Object Constraint Language (SVOCL), an OCL temporal extension for SystemVerilog, to represent the design verification requirements by means of SVA’s. As a part of research, SVOCL transformation engine has been developed to generate SVA’s code in order to automate the design verification of embedded systems. The application of SVOCL has been validated through four case studies.     

Asymptotic stability, ℓ2 gain,boundness analysis,and control synthesis for switched systems: a switching frequency approach

In this paper, several concepts of switching frequency are introduced to analyze the properties and performance of switched systems in infinite as well as finite‐time intervals. The observation is very motivating that different system properties and performances depend on different switching frequencies. Sufficient conditions ensuring asymptotic stability, ?₂ gain performance, and state boundness are derived on the basis of the notions of switching frequency, respectively. Then, on the basis of the analysis results, the control synthesis problems are addressed. LMI‐based design algorithms are proposed to meet different control synthesis requirements. Numerical design examples are provided to demonstrate our results. Copyright © 2011 John Wiley & Sons, Ltd.     

Analysis of optimized signal processing algorithms for smart antenna system

By the exponential increase in cellular communication area, the user demands and with their side problems also tend to increase. Several techniques such as cell splitting, frequency reuse, diversity and so on have already been applied to overcome these problems. In all these procedures, smart antenna is one of the best techniques used to boost capacities, enlarge bandwidth, raise the SIR ratios, minimize the effects of fading and improve MIMO communications. An ordinary antenna array which can turn up into a smart antenna array is due to the signal processing algorithms, which consists of angle of arrival (AOA) estimations and Beamforming. In this paper, I will discuss and analyse about the MUSIC algorithm for AOA estimation and least mean squares algorithm for Beamforming.