Kinetics of martensitic phase decomposition in the Cu-10wt.%Al alloy with Ag additions

The study of the kinetics of martensitic phase decomposition in the Cu-10wt.%Al alloy with Ag additions showed that the presence of Ag retarded the eutectoid decomposition reaction and enhanced martensite stabilization. This stabilization effect was attributed to Ag atoms redistribution as structure defects, increase in the numbers of Cu-Al pairs due to Ag-Al interaction and the Al atoms redistribution around one Cu atom at the sub-lattice of the martensitic crystal. © 2008 Trans Tech Publications.

Use of genetic decompositions to scaffold the development of a structurally sequenced curriculum for mathematics acceleration

The authors have collaboratively used a graphical language to describe their shared knowledge of a small domain of mathematics, which has in turn scaffolded their re-development of a related curriculum for mathematics acceleration. This collaborative use of the graphical language is reported as a simple descriptive case study. This leads to an evaluation of the graphical language’s usefulness as a tool to support the articulation of the structure of mathematics knowledge. In turn, implications are drawn for how the graphical language may be utilised as the detail of the curriculum is further elaborated and communicated to teachers.

Binary decompositions and acyclic schemes

It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.

Microstructural study of rapidly solidified titanium eutectoid alloysstar, open

Rapid solidification of Ti-7.3wt.%Cu (near-eutectoid composition), Ti-36.2wt.%Ni and Ti-34.3wt.% Ni-5.8wt.%Si alloys has been carried out by electron beam melting and splat quenching on a water-cooled rotating copper disc. The product obtained was in the form of thin ribbons 60–100 μm thick. Transmission electron microscopy studies of Ti---Cu alloy splats showed that the microstructure consisted of a mixture of martensite and a lamellar eutectoid product. The formation of the intermetallic compound Ti2Cu involved a diffusionless ω transformation and spinodal clustering. In the case of Ti---Ni alloy the as-quenched microstructure is complex, consisting of α, transformed β and intermetallic phases. This could have arisen possibly as a result of local variation in cooling rates. Rapid solidification of Ti---Ni---Si alloy resulted in partial quenching of an amorphous phase. The amorphous phase was seen to be extremely hard (a Vickers hardness of about 800 HV).

Aspects of atomic decompositions and Bergman projections

The concept of an atomic decomposition was introduced by Coifman and Rochberg (1980) for weighted Bergman spaces on the unit disk. By the Riemann mapping theorem, functions in every simply connected domain in the complex plane have an atomic decomposition. However, a decomposition resulting from a conformal mapping of the unit disk tends to be very implicit and often lacks a clear connection to the geometry of the domain that it has been mapped into. The lattice of points, where the atoms of the decomposition are evaluated, usually follows the geometry of the original domain, but after mapping the domain into another this connection is easily lost and the layout of points becomes seemingly random. In the first article we construct an atomic decomposition directly on a weighted Bergman space on a class of regulated, simply connected domains. The construction uses the geometric properties of the regulated domain, but does not explicitly involve any conformal Riemann map from the unit disk. It is known that the Bergman projection is not bounded on the space L-infinity of bounded measurable functions. Taskinen (2004) introduced the locally convex spaces LV-infinity consisting of measurable and HV-infinity of analytic functions on the unit disk with the latter being a closed subspace of the former. They have the property that the Bergman projection is continuous from LV-infinity onto HV-infinity and, in some sense, the space HV-infinity is the smallest possible substitute to the space H-infinity of analytic functions. In the second article we extend the above result to a smoothly bounded strictly pseudoconvex domain. Here the related reproducing kernels are usually not known explicitly, and thus the proof of continuity of the Bergman projection is based on generalised Forelli-Rudin estimates instead of integral representations. The minimality of the space LV-infinity is shown by using peaking functions first constructed by Bell (1981). Taskinen (2003) showed that on the unit disk the space HV-infinity admits an atomic decomposition. This result is generalised in the third article by constructing an atomic decomposition for the space HV-infinity on a smoothly bounded strictly pseudoconvex domain. In this case every function can be presented as a linear combination of atoms such that the coefficient sequence belongs to a suitable Köthe co-echelon space.

On the decomposition of ? phase in some rapidly quenched titanium-eutectoid alloys

The decomposition of the beta phase in rapidly quenched Ti-2.8 at. pet Co, Ti-5.4 at. pet Ni, Ti-4.5 at. pet, and 5.5 at. pet Cu alloys has been investigated by electron microscopy. During rapid quenching, two competitive phase transformations, namely martensitic and eutectoid transformation, have occurred, and the region of eutectoid transformation is extended due to the high cooling rates involved. The beta phase decomposed into nonlamellar eutectoid product (bainite) having a globular morphology in Ti-2.8 pet Co and Ti-4.5 pet Cu (hypoeutectoid) alloys. In the near-eutectoid Ti-5.5 pet Cu alloy, the decomposition occurred by a lamellar (pearlite) type, whereas in Ti-5.4 pct Ni (hypereutectoid), both morphologies were observed. The interfaces between the proeutectoid alpha and the intermetallic compound in the nonlamellar type as well as between the proeutectoid alpha and the pearlite were often found to be partially coherent. These findings are in agreement with the Lee and Aaronson model proposed recently for the evolution of bainite and pearlite structures during the solid-state transformations of some titanium-eutectoid alloys. The evolution of the Ti2Cu phase during rapid quenching involved the formation of a metastable phase closely related to an ''omega-type'' phase before the equilibrium phase formed. Further, the lamellar intermetallic compound Ti2Cu was found to evolve by a sympathetic nucleation process. Evidence is established for the sympathetic nucleation of the proeutectoid alpha crystals formed during rapid quenching.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

Thermal conductivity of beta-FeSi2/Si endogenous composites formed by the eutectoid decomposition of alpha-Fe2Si5

Thermoelectric properties of semiconducting beta-FeSi2 containing a homogeneous distribution of Si secondary phase have been studied. The synthesis was carried out using arc melting followed by the densification by uniaxial hot pressing. Endogenous beta-FeSi2/Si composites were produced by the eutectoid decomposition of high-temperature alpha-Fe2Si5 phase. The aging heat treatments have been carried out at various temperatures below the equilibrium eutectoid temperature for various durations in order to tune the size of the eutectoid product. Thermal properties of the samples were studied in the temperature range of 100-350 A degrees C. The microstructural investigations support the fact that the finest microstructure generated through the eutectoid decomposition of the alpha-Fe2Si5 metastable phase is responsible of the phonon scattering. The results suggest an opportunity to produce bulk iron silicide alloys with reduced thermal conductivity in order to enhance its thermoelectric performance.

More on Identification on Detailed Wage Decompositions

Revised: 2006-05.-- Published as an article in: The Review of Economics and Statistics, 2004, vol. 86, issue 4, pp. 1034-1036.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

THERMAL DECOMPOSITIONS OF SOME BIOINORGANIC COMPLEXES OF EUROPIUM

Thermogravimetric and derivative thermogravimetric investigations for three kinds of bioinorganic complexes of europium with N-acetyl-DL-alanine, N-acetyl-DL-valine and DL-alanyl-DL-alanine have been performed. It was found that the water molecules in these solid state complexes are not directly coordinated to the europium ion and that there may be three or four steps in the thermal decomposition process of these complexes after dehydration. The possible thermal decomposition reactions of these bioinorganic complexes have been suggested and discussed.