Preparation of β-SiAION from silica-alumina gel

Amorphous aluminosilicate gel powders have been subjected to carbothermal reduction and nitridation reaction at high temperature (1673 K). The influence of Al2O3 content in the gel powder on the nature and structure of the product phases has been examined. Between 5% and 9% Al2O3 in the gel powder, it is found that only β-SiAION is formed as the product of CTR/N reaction.

Microwave preparation and sintering of industrially important perovskite oxides: LaMO3 (M = Cr, Co, Ni)

Perovskite oxides LaMO3 (M = Cr, Co, Ni), have been successfully prepared using microwaves of 2.45 GHz. Microwave preparation is rapid, clean and energy efficient. Preparation of LaCrO3, LaCoO3 and LaNiO3 has been achieved in 3 min, 5 min and 10 min respectively. Direct reaction between component oxides is used for the preparation of LaCrO3 and LaCoO3, whereas nitrates are used as starting materials for LaNiO3 preparation. Products have been characterized using XRD, IR spectroscopy and SEM. Their dc electrical conductivity has also been studied and their fracture behaviour has been examined. All three microwave prepared oxide powders are of submicron size. These perovskite oxides have been sintered to very high densities using microwaves. Possible mechanisms of the microwave-material interaction both during preparation and during sintering have been discussed.

Trans -> Cis isomerization of trans-[(dPPM)(2)Ru(H)(L)][BF4] (L = P(OR)(3)) Complexes: Preparation of cis-[(dppm)(2)Ru(eta(2)-H-2)(L)][BF4](2)

A series of new dicationic dihydrogen complexes of ruthenium of the type cis-[(dppm)(2)Ru(eta(2)-H-2)(L)][BF4](2) (dppm = Ph2PCH2PPh2; L = P(OMe)(3), P(OEt)(3), PF((OPr)-Pr-i)(2)) have been prepared by protonating the precursor hydride complexes cis-[(dppm)(2)Ru(H)(L)][BF4] (L = P(OMe)(3), P(OEt)(3), P((OPr)-Pr-i)(3)) using HBF4.Et2O. The cis-[(dppm)(2)Ru(H)(L)][BF4] complexes were obtained from the trans hydrides via an isomerization reaction that is acid-accelerated. This isomerization reaction gives mixtures of cis and trans hydride complexes, the ratios of which depend on the cone angles of the phosphite ligands: the greater the cone angle, the greater is the amount of the cis isomer. The eta(2)-H-2 ligand in the dihydrogen complexes is labile, and the loss of H-2 was found to be reversible. The protonation reactions of the starting hydrides with trans PMe3 or PMe2Ph yield mixtures of the cis and the trans hydride complexes; further addition of the acid, however, give trans-[(dPPM)(2)Ru(BF4)Cl]. The roles of the bite angles of the dppm ligand as well as the steric and the electronic properties of the monodentate phosphorus ligands in this series of complexes are discussed. X-ray crystal structures of trans-[(dppm)(2)Ru(H)(P(OMe)(3))][BF4], cis-[(dppm)(2)Ru-(H)(P(OMe)(3))][BF4], and cis-[(dppm)(2)Ru(H)(P((OPr)-Pr-i)(3))][BF4] complexes have been determined.

Preparation of a ZrO2–Al2O3 nanocomposite by high-pressure sintering of spray-pyrolyzed powders

ZrO2–Al2O3 powders were synthesized by spray pyrolysis. These powders were sintered at 1 GPa in the temperature range of 700–1100 °C. The microstructural evolution and densification are reported in this paper. The application of 1 Gpa pressure lowers the crystallization temperature from ∼850 to <700 °C. Similarly, the transformation temperature under 1 GPa pressure for γ → α–Al2O3 reduces from ∼1100 to 700–800 °C range, and that for t → m ZrO2 reduces from ∼1050 to 700–800 °C range. It was possible to obtain highly dense nanocrystalline ZrO2–Al2O3 composite at temperatures as low as 700 °C. The effect of high pressure on nucleation and transformation of phases is discussed.

Wavelet Transform Codec for Fast Retrieval of Slices of 3D Objects

We propose a method to encode a 3D magnetic resonance image data and a decoder in such way that fast access to any 2D image is possible by decoding only the corresponding information from each subband image and thus provides minimum decoding time. This will be of immense use for medical community, because most of the PET and MRI data are volumetric data. Preprocessing is carried out at every level before wavelet transformation, to enable easier identification of coefficients from each subband image. Inclusion of special characters in the bit stream facilitates access to corresponding information from the encoded data. Results are taken by performing Daub4 along x (row), y (column) direction and Haar along z (slice) direction. Comparable results are achieved with the existing technique. In addition to that decoding time is reduced by 1.98 times. Arithmetic coding is used to encode corresponding information independently

Best Node Selection Through Distributed Fast Variable Power Multiple Access

In many wireless applications, it is highly desirable to have a fast mechanism to resolve or select the packet from the user with the highest priority. Furthermore, individual priorities are often known only locally at the users. In this paper we introduce an extremely fast, local-information-based multiple access algorithm that selects the best node in 1.8 to 2.1 slots,which is much lower than the 2.43 slot average achieved by the best algorithm known to date. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities into the receive power.It is inherently distributed and scales well with the number of users. We show that mapping onto a discrete set of receive power levels is optimal, and provide a complete characterization for it. The power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture,idle channel, or collision.

Stream-Close: Fast mining of Closed Frequent Itemsets in high speed data streams

With the emergence of large-volume and high-speed streaming data, the recent techniques for stream mining of CFIpsilas (closed frequent itemsets) will become inefficient. When concept drift occurs at a slow rate in high speed data streams, the rate of change of information across different sliding windows will be negligible. So, the user wonpsilat be devoid of change in information if we slide window by multiple transactions at a time. Therefore, we propose a novel approach for mining CFIpsilas cumulatively by making sliding width(ges1) over high speed data streams. However, it is nontrivial to mine CFIpsilas cumulatively over stream, because such growth may lead to the generation of exponential number of candidates for closure checking. In this study, we develop an efficient algorithm, stream-close, for mining CFIpsilas over stream by exploring some interesting properties. Our performance study reveals that stream-close achieves good scalability and has promising results.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].