Phased-Mission Analysis for Evaluating the Effectiveness of Aerospace Computing-Systems

Effectiveness evaluation of aerospace fault-tolerant computing systems used in a phased-mission environment is rather tricky and difficult because of the interaction of its several degraded performance levels with the multiple objectives of the mission and the use environment. Part I uses an approach based on multiobjective phased-mission analysis to evaluate the effectiveness of a distributed avionics architecture used in a transport aircraft. Part II views the computing system as a multistate s-coherent structure. Lower bounds on the probabilities of accomplishing various levels of performance are evaluated.

Magnetic Properties of Iron Particles Embedded in Multiwall Carbon Nanotubes

Iron nanoparticles are embedded in multiwall carbon nanotubes by the chemical vapor deposition, where benzene and ferrocene are taken as precursor materials. Varying quantity of iron particles are embedded in these tubes by taking different amount of ferrocene. These particles exhibit a magnetic moment up to 98 emu/g and an enhanced coercivity in the range of 500-2000 Oe. Negative magnetoresistance similar to 10% is observed in the presence of magnetic field up to 11 T applied at various temperatures in the range of 1.3 K-300 K. It is argued that the enhanced coercivity is due to the shape anisotropy. The negative magnetoresistance is believed to be due to the weak localization and spin dependent scattering of electrons by the ferromagnetic particles. In addition we also observe a dependence of the magnetoresistance on the direction of applied field and this is correlated with the shape anisotropy of the Fe particles.

Ant colony optimization for reporting cell planning in mobile computing using selective paging strategy

Location management problem that arise in mobile computing networks is addressed. One method used in location management is to designate sonic of the cells in the network as "reporting cells". The other cells in the network are "non-reporting cells". Finding an optimal set of reporting cells (or reporting cell configuration) for a given network. is a difficult combinatorial optimization problem. In fact this is shown to be an NP-complete problem. in an earlier study. In this paper, we use the selective paging strategy and use an ant colony optimization method to obtain the best/optimal set of reporting cells for a given a network.

Optimal iterative schemes for computing the Moore-Penrose matrix inverse

Among the iterative schemes for computing the Moore — Penrose inverse of a woll-conditioned matrix, only those which have an order of convergence three or two are computationally efficient. A Fortran programme for these schemes is provided.

Self-image (autoidolon) techniques for the realisation of optical computing type operations

Abstract is not available.

Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses

A rank-augmnented LU-algorithm is suggested for computing a generalized inverse of a matrix. Initially suitable diagonal corrections are introduced in (the symmetrized form of) the given matrix to facilitate decomposition; a backward-correction scheme then yields a desired generalized inverse.

Computing magnetic anisotropy constants of single molecule magnets

We present here a theoretical approach to compute the molecular magnetic anisotropy parameters, D (M) and E (M) for single molecule magnets in any given spin eigenstate of exchange spin Hamiltonian. We first describe a hybrid constant M (S) valence bond (VB) technique of solving spin Hamiltonians employing full spatial and spin symmetry adaptation and we illustrate this technique by solving the exchange Hamiltonian of the Cu6Fe8 system. Treating the anisotropy Hamiltonian as perturbation, we compute the D (M)and E(M) values for various eigenstates of the exchange Hamiltonian. Since, the dipolar contribution to the magnetic anisotropy is negligibly small, we calculate the molecular anisotropy from the single-ion anisotropies of the metal centers. We have studied the variation of D (M) and E(M) by rotating the single-ion anisotropies in the case of Mn12Ac and Fe-8 SMMs in ground and few low-lying excited states of the exchange Hamiltonian. In both the systems, we find that the molecular anisotropy changes drastically when the single-ion anisotropies are rotated. While in Mn12Ac SMM D (M) values depend strongly on the spin of the eigenstate, it is almost independent of the spin of the eigenstate in Fe-8 SMM. We also find that the D (M)value is almost insensitive to the orientation of the anisotropy of the core Mn(IV) ions. The dependence of D (M) on the energy gap between the ground and the excited states in both the systems has also been studied by using different sets of exchange constants.

COMPASS – A tool for evaluation of compression strategies for embedded processors

A major concern of embedded system architects is the design for low power. We address one aspect of the problem in this paper, namely the effect of executable code compression. There are two benefits of code compression – firstly, a reduction in the memory footprint of embedded software, and secondly, potential reduction in memory bus traffic and power consumption. Since decompression has to be performed at run time it is achieved by hardware. We describe a tool called COMPASS which can evaluate a range of strategies for any given set of benchmarks and display compression ratios. Also, given an execution trace, it can compute the effect on bus toggles, and cache misses for a range of compression strategies. The tool is interactive and allows the user to vary a set of parameters, and observe their effect on performance. We describe an implementation of the tool and demonstrate its effectiveness. To the best of our knowledge this is the first tool proposed for such a purpose.

Computing TCP Throughput in a UMTS Network

We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separate queues at the base station (node B). Also due to fragmentation of the TCP packets into Protocol Data Units (PDU) and link layer retransmissions of PDUs there can be significant delays at the queue of the node B. In such a scenario the existing models of TCP may not be sufficient. Thus, we provide a new approximate TCP model and also obtain new closed-form expressions of mean window size. Using these we obtain the throughput of a TCP connection which matches with simulations quite well.

Embedded PZT wafer sensors for structural health monitoring

Recent advances in structural integrity evaluation have led to the development. of PZT wafer sensors (PWAS) which can be embedded or surface mounted for both acoustic emission (AE) and ultrasonic (UT) modes, which forms an integrated approach for Structural Health Monitoring (SHM) of aerospace structures. For the fabrication of PWAS wafers, soft PZT formulation (SP-5H Grade containing dopants like BA, SM, CA, ZN, Y and HF) were used. The piezoelectric charge constant (d(33)) was measured by a d(33) meter. As a first step towards the final objective of developing Health monitoring methods with embedded PWAS, experiments were conducted on aluminum and composite plates of finite dimensions using PWAS sensors. The AE source was simulated by breaking 0.5mm pencil lead on the surface of a thin plate. Experiments were also conducted with surface mounted PZT films and conventional AE sensors in order to establish the sensitivity of PWAS. A comparison of results of theoretical and experimental work shows good agreement.

Size-dependent magnetic properties of iron carbide nanoparticles embedded in a carbon matrix

Here we report on the magnetic properties of iron carbide nanoparticles embedded in a carbon matrix. Granular distributions of nanoparticles in an inert matrix, of potential use in various applications, were prepared by pyrolysis of organic precursors using the thermally assisted chemical vapour deposition method. By varying the precursor concentration and preparation temperature, compositions with varying iron concentration and nanoparticle sizes were made. Powder x-ray diffraction, transmission electron microscopy and Mossbauer spectroscopy studies revealed the nanocrystalline iron carbide (Fe3C) presence in the partially graphitized matrix. The dependence of the magnetic properties on the particle size and temperature (10 K < T < 300 K) were studied using superconducting quantum interference device magnetometry. Based on the affect of surrounding carbon spins, the observed magnetic behaviour of the nanoparticle compositions, such as the temperature dependence of magnetization and coercivity, can be explained.

Influence lines for bending under a ring load of a free shell, a shell embedded in a soft medium and a shell containing a soft core

Theoretical expressions for stresses and displacements have been derived for bending under a ring load of a free shell, a shell embedded in a soft medium, and a shell containing a soft core. Numerical work has been done for typical cases with an Elliot 803 Digital Computer and influence lines are drawn therefrom.

Exploring energy-performance trade-offs for heterogeneous interconnect clustered VLIW processors

Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by improving clock speed, reducing energy consumption of the logic, and making the design simpler, it introduces extra overheads by way of inter-cluster communication. This communication happens over long global wires which leads to delay in execution and significantly high energy consumption.In this paper, we propose a new instruction scheduling algorithm that exploits scheduling slacks of instructions and communication slacks of data values together to achieve better energy-performance trade-offs for clustered architectures with heterogeneous interconnect. Our instruction scheduling algorithm achieves 35% and 40% reduction in communication energy, whereas the overall energy-delay product improves by 4.5% and 6.5% respectively for 2 cluster and 4 cluster machines with marginal increase (1.6% and 1.1%) in execution time. Our test bed uses the Trimaran compiler infrastructure.

Framework for enabling highly available distributed applications for utility computing

The move towards IT outsourcing is the first step towards an environment where compute infrastructure is treated as a service. In utility computing this IT service has to honor Service Level Agreements (SLA) in order to meet the desired Quality of Service (QoS) guarantees. Such an environment requires reliable services in order to maximize the utilization of the resources and to decrease the Total Cost of Ownership (TCO). Such reliability cannot come at the cost of resource duplication, since it increases the TCO of the data center and hence the cost per compute unit. We, in this paper, look into aspects of projecting impact of hardware failures on the SLAs and techniques required to take proactive recovery steps in case of a predicted failure. By maintaining health vectors of all hardware and system resources, we predict the failure probability of resources based on observed hardware errors/failure events, at runtime. This inturn influences an availability aware middleware to take proactive action (even before the application is affected in case the system and the application have low recoverability). The proposed framework has been prototyped on a system running HP-UX. Our offline analysis of the prediction system on hardware error logs indicate no more than 10% false positives. This work to the best of our knowledge is the first of its kind to perform an end-to-end analysis of the impact of a hardware fault on application SLAs, in a live system.

Computing complete test graphs for hierarchical systems

Conformance testing focuses on checking whether an implementation. under test (IUT) behaves according to its specification. Typically, testers are interested it? performing targeted tests that exercise certain features of the IUT This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed. or deviated front the test purpose. In [8] Jeron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper; we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.