Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems

This paper proposes an algorithm for joint data detection and tracking of the dominant singular mode of a time varying channel at the transmitter and receiver of a time division duplex multiple input multiple output beamforming system. The method proposed is a modified expectation maximization algorithm which utilizes an initial estimate to track the dominant modes of the channel at the transmitter and the receiver blindly; and simultaneously detects the un known data. Furthermore, the estimates are constrained to be within a confidence interval of the previous estimate in order to improve the tracking performance and mitigate the effect of error propagation. Monte-Carlo simulation results of the symbol error rate and the mean square inner product between the estimated and the true singular vector are plotted to show the performance benefits offered by the proposed method compared to existing techniques.

Load Profiling in Distributed Real-Time Systems

Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-profiling strategy that allows the nodes of a distributed system to be unequally loaded. Using load profiling, the system attempts to distribute the load amongst its nodes so as to maximize the chances of finding a node that would satisfy the computational needs of incoming real-time tasks. To that end, we describe and evaluate a distributed load-profiling protocol for dynamically scheduling time-constrained tasks in a loosely-coupled distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success, while attempting to maintain an overall load profile for the system. Nodes in the system inform each other about their state using a combination of multicasting and gossiping. The performance of the proposed protocol is evaluated via simulation, and is contrasted to other dynamic scheduling protocols for real-time distributed systems. Based on our findings, we argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems.

A simulator of real-time systems specified in et-lotos

info:eu-repo/semantics/published

Microscopic models for dielectric relaxation in disordered systems

It is shown how the Debye rotational diffusion model of dielectric relaxation of polar molecules (which may be described in microscopic fashion as the diffusion limit of a discrete time random walk on the surface of the unit sphere) may be extended to yield the empirical Havriliak-Negami (HN) equation of anomalous dielectric relaxation from a microscopic model based on a kinetic equation just as in the Debye model. This kinetic equation is obtained by means of a generalization of the noninertial Fokker-Planck equation of conventional Brownian motion (generally known as the Smoluchowski equation) to fractional kinetics governed by the HN relaxation mechanism. For the simple case of noninteracting dipoles it may be solved by Fourier transform techniques to yield the Green function and the complex dielectric susceptibility corresponding to the HN anomalous relaxation mechanism.

Service offloading in adaptive real-time systems

Smartphones and other internet enabled devices are now common on our everyday life, thus unsurprisingly a current trend is to adapt desktop PC applications to execute on them. However, since most of these applications have quality of service (QoS) requirements, their execution on resource-constrained mobile devices presents several challenges. One solution to support more stringent applications is to offload some of the applications’ services to surrogate devices nearby. Therefore, in this paper, we propose an adaptable offloading mechanism which takes into account the QoS requirements of the application being executed (particularly its real-time requirements), whilst allowing offloading services to several surrogate nodes. We also present how the proposed computing model can be implemented in an Android environment

Coordinated runtime adaptations in cooperative open real-time systems

This paper proposes an one-step decentralised coordination model based on an effective feedback mechanism to reduce the complexity of the needed interactions among interdependent nodes of a cooperative distributed system until a collective adaptation behaviour is determined. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The reduced complexity and overhead of the proposed decentralised coordination model are validated through extensive evaluations.

Capacity sharing and stealing in dynamic server-based real-time systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.

Data Security in Fault Tolerant Hard Real Time Systems- Use of Time Dependant Multiple Random Cipher Code

The present research problem is to study the existing encryption methods and to develop a new technique which is performance wise superior to other existing techniques and at the same time can be very well incorporated in the communication channels of Fault Tolerant Hard Real time systems along with existing Error Checking / Error Correcting codes, so that the intention of eaves dropping can be defeated. There are many encryption methods available now. Each method has got it's own merits and demerits. Similarly, many crypt analysis techniques which adversaries use are also available.

On the localization of water-soluble porphyrins in micellar systems evaluated by static and time-resolved frequency-domain fluorescence techniques

Fluorescence quenching of meso-tetrakis-4-sulfonatophenyl (TPPS4) and meso-tetrakis-4-N-methylpyridil (TMPyP) porphyrins is studied in aqueous solution and upon addition of micelles of sodium dodecylsulfate (SDS), cetyltrimethylammonium chloride (CTAC), N-hexadecyl-N,N-dimethyl-3-ammonio-1-propanesulfonate (HPS) and t-octylphenoxypolyethoxyethanol (Triton X-100). Potassium iodide (KI) was used as quencher. Steady-state Stern-Volmer plots were best fitted by a quadratic equation, including dynamic (K-D) and static (K-s) quenching. Ks was significantly smaller than K-D. Frequency-domain fluorescence lifetimes allowed estimating bimolecular quenching constants, k(q). At 25 degrees C, in aqueous solution, TMPyP shows k(q), values a factor of 2-3 higher than the diffusional limit. TPPS4 shows collisional quenching with pH dependent k(q) values. For TMPyP quenching results are consistent with reported binding constants: a significant reduction of quenching takes place for SDS, a moderate reduction is observed for H PS and almost no change is seen for Triton X-100. Similar data were obtained at 50 C. For CTAC-TPPS4 system an enhancement of quenching was observed as compared to pure buffer. This is probably associated to accumulation of iodide at the cationic micellar interface. The attraction between CTAC headgroups and 1(-), and repulsion between SDS and 1(-), enhances and reduces the fluorescence quenching, respectively, of porphyrins located at the micellar interface. The small quenching of TPPS4 in Triton X-100 is consistent with strong binding as reported in the literature. (C) 2008 Elsevier B.V. All rights reserved.

Motion control and real-time systems: an approach to trajectory rebuilding in non-deterministic networks

Motion control is a sub-field of automation, in which the position and/or velocity of machines are controlled using some type of device. In motion control the position, velocity, force, pressure, etc., profiles are designed in such a way that the different mechanical parts work as an harmonious whole in which a perfect synchronization must be achieved. The real-time exchange of information in the distributed system that is nowadays an industrial plant plays an important role in order to achieve always better performance, better effectiveness and better safety. The network for connecting field devices such as sensors, actuators, field controllers such as PLCs, regulators, drive controller etc., and man-machine interfaces is commonly called fieldbus. Since the motion transmission is now task of the communication system, and not more of kinematic chains as in the past, the communication protocol must assure that the desired profiles, and their properties, are correctly transmitted to the axes then reproduced or else the synchronization among the different parts is lost with all the resulting consequences. In this thesis, the problem of trajectory reconstruction in the case of an event-triggered communication system is faced. The most important feature that a real-time communication system must have is the preservation of the following temporal and spatial properties: absolute temporal consistency, relative temporal consistency, spatial consistency. Starting from the basic system composed by one master and one slave and passing through systems made up by many slaves and one master or many masters and one slave, the problems in the profile reconstruction and temporal properties preservation, and subsequently the synchronization of different profiles in network adopting an event-triggered communication system, have been shown. These networks are characterized by the fact that a common knowledge of the global time is not available. Therefore they are non-deterministic networks. Each topology is analyzed and the proposed solution based on phase-locked loops adopted for the basic master-slave case has been improved to face with the other configurations.