Effect of surface treatment on segregation of impurities in haematite

Surface segregation of various impurities such as Mg, Si, Ca, Al and Cr were determined for the haematite phase (Fe₂O₃) annealed in two different gas compositions involving (1) air at 1173 K, and (2) a gas mixture containing sulphur at 773 K. The objective of work was to establish the effect of the gas-phase composition on segregation of lattice defects. The near-surface segregation profiles of the impurities were determined by secondary ion mass spectrometry. The depth profile analysis was made by sputtering using an Ar⁺ primary beam of energy 30 keV. The surface charge was neutralized by an electron gun. It was found that annealing Fe₂O₃ under a gas phase containing sulphur resulted in the formation of an Fe(SO₄)₃ surface layer. It was observed that the two surface treatment procedures applied (both with and without sulphur) result in Mg enrichment in the near-surface region of Fe₂O₃. Si and Ca exhibit an enrichment and impoverishment after the surface treatments 1 and 2, respectively. Finally, the near-surface layer is impoverished in Cr and Al after both types of surface treatment. Experimental results are discussed in terms of segregation driving forces of the respective elements and the possible effect of sulphur on the gas-solid heterogeneous kinetics.     

Hot-carrier reliability of 20V MOS transistors in 0.13 μm CMOS technology

This paper presents results of reliability investigation of 20 V N-Drift MOS transistor in 0.13 μm CMOS technology. Due to high performances required for CMOS applications, adding high voltage devices becomes a big challenge to guarantee the reliability criteria. In this context, new reliability approaches are needed. Safe Operating Area are defined for switch, V_ds limited and V_gs limited applications in order to improve circuit designs. For V_ds limited applications, deep doping dose effects in drift area are investigated in correlation to lifetime evaluations based on device parameter shifts under hot carrier stressing. To further determine the amount and locations of hot carriers injections, accurate 2D technological and electrical simulations are performed and permit to select the best compromise between performance and reliability for N-Drift MOS transistor.     

Results of testing a centrifugal bubble singlet-oxygen generator

The results of parametric tests of a centrifugal bubble singlet-oxygen generator based on the reaction of chlorine with an alkaline hydrogen peroxide solution have been given. The utilization of chlorine grows with bubble-layer height, whereas the relative content of O₂(¹Δ) remains constant. Growth in centrifugal acceleration leads to a more efficient utilization of chlorine. A specific oxygen output of more than 1 mmole·cm⁻²·sec⁻¹ from the bubble layer for a degree of chlorine utilization of ∼95% and a singlet-oxygen yield of more than 50% has been attained. It has been shown that a centrifugal bubble singlet-oxygen generator is an efficient energy source for an oxygen-iodine laser. __________ Translated from Inzhenerno-Fizicheskii Zhurnal, Vol. 80, No. 3, pp. 121–128, May–June, 2007.     

Fast numerically stable computation of orthogonal Fourier?Mellin moments

An efficient algorithm for the computation of the orthogonal Fourier-Mellin moments (OFMMs) is presented. The proposed method computes the fractional parts of the orthogonal polynomials, which consist of fractional terms, recursively, by eliminating the number of factorial calculations. The recursive computation of the fractional terms makes the overall computation of the OFMMs a very fast procedure in comparison with the conventional direct method. Actually, the computational complexity of the proposed method is linear O(p) in multiplications, with p being the moment order, while the corresponding complexity of the direct method is O(p²). Moreover, this recursive algorithm has better numerical behaviour, as it arrives at an overflow situation much later than the original one and does not introduce any finite precision errors. These are the two major advantages of the algorithm introduced in the current work, establishing the computation of the OFMMs to a very high order as a quite easy and achievable task. Appropriate simulations on images of different sizes justify the superiority of the proposed algorithm over the conventional algorithm currently used     

Optimum power-saving method for power MOSFET width of DC/DC converters

An optimum power metal-oxide-semiconductor field effect transistor (MOSFET) width technique is proposed for enhancing the efficiency characteristics of switching DC-DC converters. By implementing a one-cycle buck DC-DC converter, it is demonstrated that the dynamic power MOSFET width controlling technique has a much improved power reduction whether the load current is light or heavy. The maximum efficiency of the buck converter is ~92% with a 3% efficiency improvement for the heavy load condition. The efficiency is further improved by ~16% for the light load condition as a result of the power reduction from the large power MOSFET transistors. Also proposed is a new error-correction loop circuit to enable a better load regulation than that of previous designs. Compared with the adaptive gate driver voltage technique, the optimum power MOSFET width can achieve a significant improvement in power saving. It is also superior to the low-voltage-swing MOSFET gate drive technique for switching DC-DC converters     

Inference of message sequence charts

Software designers draw message sequence charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? If so, can we automatically synthesize concurrent state machines realizing the given MSCs? If, on the other hand, other unspecified and possibly unwanted scenarios are "implied" by their MSCs, can the software designer be automatically warned and provided the implied MSCs? In this paper, we provide a framework in which all these questions are answered positively. We first describe the formal framework within which one can derive implied MSCs and then provide polynomial-time algorithms for implication, realizability, and synthesis.     

Itemset trees for targeted association querying

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.