Interfaces In Quasicrystalline Systems

Structural relations between quasicrystalline and related crystalline rational approximant phases have been of interest for some time now. Such relations are now being used to understand interface structures. Interfaces between structural motif - wise related, but dissimilarly periodic phases are expected to show a degree of lattice match in certain directions. Our earlier studies in the Al-Cu-Fe system using the HREM technique has shown this to be true. The structural difference leads to well defined structural ledges in the interface between the icosahedral Al-Cu-Fe phase and the monoclinic Al13Fe4 type phase. In the present paper we report our results on the HREM study of interfaces in Al-Cu-Fe and Al-Pd-Mn systems. The emphasis will be on heterophase interfaces between quasiperiodic and periodic phases, where the two are structurally related. An attempt will be made to correlate the results with calculated lattice projections of the two structures on the grain boundary plane.

An Effective Seamless Connectivity Scheme for Ubiquitous Applications

The idea of ubiquity and seamless connectivity in networks is gaining more importance in recent times because of the emergence of mobile devices with added capabilities like multiple interfaces and more processing abilities. The success of ubiquitous applications depends on how effectively the user is provided with seamless connectivity. In a ubiquitous application, seamless connectivity encompasses the smooth migration of a user between networks and providing him/her with context based information automatically at all times. In this work, we propose a seamless connectivity scheme in the true sense of ubiquitous networks by providing smooth migration to a user along with providing information based on his/her contexts automatically without re-registration with the foreign network. The scheme uses Ubi-SubSystems(USS) and Soft-Switches(SS) for maintaining the ubiquitous application resources and the users. The scheme has been tested by considering the ubiquitous touring system with several sets of tourist spots and users.

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

Executable Analysis using Abstract Interpretation with Circular Linear Progressions

We propose a new abstract domain for static analysis of executable code. Concrete states are abstracted using circular linear progressions (CLPs). CLPs model computations using a finite word length as is seen in any real life processor. The finite abstraction allows handling overflow scenarios in a natural and straight-forward manner. Abstract transfer functions have been defined for a wide range of operations which makes this domain easily applicable for analyzing code for a wide range of ISAs. CLPs combine the scalability of interval domains with the discreteness of linear congruence domains. We also present a novel, lightweight method to track linear equality relations between static objects that is used by the analysis to improve precision. The analysis is efficient, the total space and time overhead being quadratic in the number of static objects being tracked.

WCET Estimation for Executables in the Presence of Data Caches

This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation, which is used for the dual purposes of tracking address computations and cache behavior. A simultaneous numeric and pointer analysis using an abstraction for discrete sets of values computes safe approximations of access addresses which are then used to predict cache behavior using Must Analysis. A heuristic is also proposed which generates likely worst case estimates. It can be used in soft real time systems and also for reasoning about the tightness of the safe estimate. The analysis methods can handle programs with non-affine access patterns, for which conventional Presburger Arithmetic formulations or Cache Miss Equations do not apply. The precision of the estimates is user-controlled and can be traded off against analysis time. Executables are analyzed directly, which, apart from enhancing precision, renders the method language independent.

A near-singular, flexure jointed, moment sensitive Stewart platform based fore-torque sensor

A force-torque sensor capable of accurate measurement of the three components of externally applied forces and moments is required for force control in robotic applications involving assembly operations. The goal in this paper is to design a Stewart platform based force torque sensor at a near-singular configuration sensitive to externally applied moments. In such a configuration, we show an enhanced mechanical amplification of leg forces and thereby higher sensitivity for the applied external moments. In other directions, the sensitivity will be that of a normal load sensor determined by the sensitivity of the sensing element and the associated electronic amplification, and all the six components of the force and torque can be sensed. In a sensor application, the friction, backlash and other non-linearities at the passive spherical joints of the Stewart platform will affect the measurements in unpredictable ways. In this sensor, we use flexural hinges at the leg interfaces of the base and platform of the sensor. The design dimensions of the flexure joints in the sensor have been arrived at using FEA. The sensor has been fabricated, assembled and instrumented. It has been calibrated for low level loads and is found to show linearity and marked sensitivity to moments about the three orthogonal X, Y and Z axes. This sensor is compatible for usage as a wrist sensor for a robot under development at ISRO Satellite Centre.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters

Workstation clusters equipped with high performance interconnect having programmable network processors facilitate interesting opportunities to enhance the performance of parallel application run on them. In this paper, we propose schemes where certain application level processing in parallel database query execution is performed on the network processor. We evaluate the performance of TPC-H queries executing on a high end cluster where all tuple processing is done on the host processor, using a timed Petri net model, and find that tuple processing costs on the host processor dominate the execution time. These results are validated using a small cluster. We therefore propose 4 schemes where certain tuple processing activity is offloaded to the network processor. The first 2 schemes offload the tuple splitting activity - computation to identify the node on which to process the tuples, resulting in an execution time speedup of 1.09 relative to the base scheme, but with I/O bus becoming the bottleneck resource. In the 3rd scheme in addition to offloading tuple processing activity, the disk and network interface are combined to avoid the I/O bus bottleneck, which results in speedups up to 1.16, but with high host processor utilization. Our 4th scheme where the network processor also performs apart of join operation along with the host processor, gives a speedup of 1.47 along with balanced system resource utilizations. Further we observe that the proposed schemes perform equally well even in a scaled architecture i.e., when the number of processors is increased from 2 to 64

Instabilities of soft elastic microtubes filled with viscous fluids: Pearls, wrinkles, and sausage strings

A linear stability analysis is presented to study the self-organized instabilities of a highly compliant elastic cylindrical shell filled with a viscous liquid and submerged in another viscous medium. The prototype closely mimics many components of micro-or nanofluidic devices and biological processes such as the budding of a string of pearls inside cells and sausage-string formation of blood vessels. The cylindrical shell is considered to be a soft linear elastic solid with small storage modulus. When the destabilizing capillary force derived from the cross-sectional curvature overcomes the stabilizing elastic and in-plane capillary forces, the microtube can spontaneously self-organize into one of several possible configurations; namely, pearling, in which the viscous fluid in the core of the elastic shell breaks up into droplets; sausage strings, in which the outer interface of the mircrotube deforms more than the inner interface; and wrinkles, in which both interfaces of the thin-walled mircrotube deform in phase with small amplitudes. This study identifies the conditions for the existence of these modes and demonstrates that the ratios of the interfacial tensions at the interfaces, the viscosities, and the thickness of the microtube play crucial roles in the mode selection and the relative amplitudes of deformations at the two interfaces. The analysis also shows asymptotically that an elastic fiber submerged in a viscous liquid is unstable for Y = gamma/(G(e)R) > 6 and an elastic microchannel filled with a viscous liquid should rupture to form spherical cavities (pearling) for Y > 2, where gamma, G(e), and R are the surface tension, elastic shear modulus, and radius, respectively, of the fiber or microchannel.

SOS films and interfaces: chemical aspects

The possible chemical reactions that take place during the growth of single crystal films of silicon on sapphire (SOS) are analyzed thermodynamically. The temperature for the growth of good quality epitaxial films is dependent on the extent of water vapor present in the carrier gas. The higher the water vapor content the higher the temperature needed to grow SOS films. Due to the interaction of silicon with sapphire at elevated temperatures, SOS films are doped with aluminum. The extent of doping is dependent on the conditions of film growth. The doping by aluminum from the substrate increases with increasing growth temperatures and decreasing growth rates. The equilibrium concentrations of aluminum at the silicon-sapphire interface are calculated as a function of deposition temperature, assuming that SiO2 or Al6Si2O13 are the products of reaction. It is most likely that the product could be a solid solutio n of Al2O3 in SiO2. The total amount of aluminum released due to the interaction between silicon and sapphire will account only for the formation of not more than one monolayer of reaction product unless the films are annealed long enough at elevated temperatures. This value is in good agreement with the recently reported observations employing high resolution transmission electron microscopy.

Interference Alignment Algorithms for the K User Constant MIMO Interference Channel

This paper considers the degrees of freedom (DOF) for a K user multiple-input multiple-output (MIMO) M x N interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.