69 resultados para User interfaces
Resumo:
An attempt has been made to study the film-substrate interface by using a sensitive, non- conventional tool. Because of the prospective use of gate oxide in MOSFET devices, we have chosen to study alumina films grown on silicon. Film-substrate interface of alumina grown by MOCVD on Si(100) was studied systematically using spectroscopic ellipsometry in the range 1.5-5.0 eV, supported by cross-sectional SEM, and SIMS. The (ε1,ε2) versus energy data obtained for films grown at 600°C, 700°C, and 750°C were modeled to fit a substrate/interface/film “sandwich”. The experimental results reveal (as may be expected) that the nature of the substrate -film interface depends strongly on the growth temperature. The simulated (ε1,ε2) patterns are in excellent agreement with observed ellipsometric data. The MOCVD precursors results the presence of carbon in the films. Theoretical simulation was able to account for the ellipsometry data by invoking the presence of “free” carbon in the alumina films.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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
Resumo:
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.
Resumo:
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.
Resumo:
The tension-softening parameters for different concrete-concrete interfaces are determined using the bimaterial cracked hinge model. Beams of different sizes having a jointed interface between two different strengths of concrete are tested under three-point bending (TPB). The load versus crack mouth opening displacement (CMOD) results are used to obtain the stress-crack opening relation through an inverse analysis. In addition, the fracture energy, tensile strength, and modulus of elasticity are also computed from the inverse analysis. The fracture properties are used in the nonlinear fracture mechanics analysis of a concrete patch-repaired beam to determine its load-carrying capacity when repaired with concrete of different strengths.
Resumo:
Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.