Rapid quenching and glass formation in chalcogenide glasses: Preparation and properties of Ge-As-Te glasses over an extended composition ranges

In Ge-As-Te system, the glass forming region determined by normal melt quenching method has two regions (GFR I and GFR II) separated by few compositions gap. With a simple laboratory built twin roller apparatus, we have succeeded in preparing Ge7.5AsxTe92.5-x glasses over extended composition ranges. A distinct change in T-g is observed at x = 40, exactly at which the separation of the glass forming regions occur indicating the changes in the connectivity and the rigidity of the structural network. The maximum observed in glass transition (T-g) at x = 55 corresponding to the average coordination number (Z(av)) = 2.70 is an evidence for the shift of the rigidity percolation threshold (RPT) from Z(av) = 2.40 as predicted by the recent theories. The glass forming tendency (K-gl) and Delta T (=T-c-T-g) is low for the glasses in the GFR I and high for the glasses in the GFR II.

Formation of an unusual copper(II) complex from the degradation of a novel tricopper(II) carbohydrazone complex

An unusual copper(II) complex [Cu(L-1a)(2)Cl-2] CH3OH center dot H2O center dot H3O+Cl- (1a) was isolated from a solution of a novel tricopper(II) complex [Cu-3(HL1)Cl-2]Cl-3 center dot 2H(2)O (1) in methanol. where L-1a is 3-(2-pyridyl)triazolo [1,5-a]-pyridine, and characterized with single crystal X-ray diffraction study. The tricopper(II) complex of potential ligand 1,5-bis(di-2-pyridyl ketone) carbohydrazone (H2L1) was synthesized and physicochemically characterized, while the formation of the complex la was followed by time-dependant monitoring of the UV-visible spectra. which reveals degradation of ligand backbone as intensity loss of bands corresponding to O -> Cu(II) charge transfer.

Topological close packed mu phase formation and the determination of diffusion parameters in the Co-Mo system

The study on the formation and growth of topological close packed (TCP) compounds is important to understand the performance of turbine blades in jet engine applications. These deleterious phases grow mainly by diffusion process in the superalloy substrate. Significant volume change was found because of growth of the p phase in Co-Mo system. Growth kinetics of this phase and different diffusion parameters, like interdiffusion, intrinsic and tracer diffusion coefficients are calculated. Further the activation energy, which provides an idea about the mechanism, is determined. Moreover, the interdiffusion coefficient in Co(Mo) solid solution and impurity diffusion coefficient of Mo in Co are determined.

Racemization at proline residues during peptide bond formation : A study of diastereomeric mixtures of synthetic alamethicin fragments by 270 MHz 1H NMR

The stepwise synthesis of amino terminal pentapeptide of alamethicin, Z-Aib-Pro-Aib-Ala-Aib-OMe, by the dicyclohexylcarbodiimide mediated couplings leads to extensive racemization at the Ala and Pro residues. Racemization is largely suppressed by the use of additives like N-hydroxysuccinimide and 1-hydroxybenzotriazole. The presence of diastereomeric peptides may be detected by the observation of additional methyl ester and benzylic methylene signals in the 270 MHz 1H NMR spectra. Unambiguous spectral assignment of the signals to the diastereomers has been carried out by the synthesis and NMR studies of the D-Ala tetra and pentapeptides. The racemization at Pro is of particular relevance in view of the reported lack of inversion at C-terminal Pro on carboxyl activation.

A Bayesian incentive compatible mechanism for decentralized supply chain formation

In this paper we consider a decentralized supply chain formation problem for linear multi-echelon supply chains when the managers of the individual echelons are autonomous, rational, and intelligent. At each echelon, there is a choice of service providers and the specific problem we solve is that of determining a cost-optimal mix of service providers so as to achieve a desired level of end-to-end delivery performance. The problem can be broken up into two sub-problems following a mechanism design approach: (1) Design of an incentive compatible mechanism to elicit the true cost functions from the echelon managers; (2) Formulation and solution of an appropriate optimization problem using the true cost information. In this paper we propose a novel Bayesian incentive compatible mechanism for eliciting the true cost functions. This improves upon existing solutions in the literature which are all based on the classical Vickrey-Clarke-Groves mechanisms, requiring significant incentives to be paid to the echelon managers for achieving dominant strategy incentive compatibility. The proposed solution, which we call SCF-BIC (Supply Chain Formation with Bayesian Incentive Compatibility), significantly reduces the cost of supply chain formation. We illustrate the efficacy of the proposed methodology using the example of a three echelon manufacturing supply chain.

A Shapley value analysis to coordinate the formation of procurement

In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Recent research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.

Memory-efficient spatial prediction image compression scheme

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

Urban satellite image classification using biologically inspired techniques

This paper focuses on optimisation algorithms inspired by swarm intelligence for satellite image classification from high resolution satellite multi- spectral images. Amongst the multiple benefits and uses of remote sensing, one of the most important has been its use in solving the problem of land cover mapping. As the frontiers of space technology advance, the knowledge derived from the satellite data has also grown in sophistication. Image classification forms the core of the solution to the land cover mapping problem. No single classifier can prove to satisfactorily classify all the basic land cover classes of an urban region. In both supervised and unsupervised classification methods, the evolutionary algorithms are not exploited to their full potential. This work tackles the land map covering by Ant Colony Optimisation (ACO) and Particle Swarm Optimisation (PSO) which are arguably the most popular algorithms in this category. We present the results of classification techniques using swarm intelligence for the problem of land cover mapping for an urban region. The high resolution Quick-bird data has been used for the experiments.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Wavelet transform based error concealment approach for image denoising

Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.

Image reconstruction by inhomogeneous diffusion for positron emission tomography

In positron emission tomography (PET), image reconstruction is a demanding problem. Since, PET image reconstruction is an ill-posed inverse problem, new methodologies need to be developed. Although previous studies show that incorporation of spatial and median priors improves the image quality, the image artifacts such as over-smoothing and streaking are evident in the reconstructed image. In this work, we use a simple, yet powerful technique to tackle the PET image reconstruction problem. Proposed technique is based on the integration of Bayesian approach with that of finite impulse response (FIR) filter. A FIR filter is designed whose coefficients are determined based on the surface diffusion model. The resulting reconstructed image is iteratively filtered and fed back to obtain the new estimate. Experiments are performed on a simulated PET system. The results show that the proposed approach is better than recently proposed MRP algorithm in terms of image quality and normalized mean square error.

Formation and crystallization of hydrogen-induced amorphous SmFe2H3.6 alloy

On hydrogenation of the Laves phase SmFe2, an amorphous SmFe2H3.6 (a-SmFe2H3.6) alloy was formed between 400 K and 500 K. The amorphous nature of the alloy was confirmed by X-ray diffraction, transmission electron microscopy and thermal analysis. However, SmFe2 absorbed hydrogen in the crystal state below 350 K and decomposed into SmH2 and α-Fe above 550 K. The crystallization behaviour of a-SmFe2H3.6 was investigated by differential scanning calorimetry in combination with electron microscopy. Even after considerable hydrogen desorption (Image ) by an endothermic reaction on heating, the amorphous state was retained. Crystallization of a-SmFe2H3.6 took place in two stages. The first stage involved the precipitation of α-Fe in the amorphous matrix. The second stage involved the decomposition of the remaining amorphous phase into the equilibrium phases SmH2 and SmFe2.

One pot synthesis of polycyclic oxygen aromatics. Part III mechanism of formation

Reaction of 6-Image -butyl-1-bromomethyl-2-(2-tetrahydropyranyloxy)-naphthalene2c with tetrachlorocatechol (TCC) in acetone in presence of K2CO3 gave diastereomers 6c and 7c. A mechanism (Scheme-1) invoking the base induced cleavage of the pyranyl ether 2 to 1,2-naphthoquinone-1-methide 8 as the first step has been postulated. The cleavage of the pyranyl ether linkage in 2 to give dimers 4 and 5 of 1,2-naphthoquinone-1-methide has been demonstrated with different bases. 1,2-Naphthoquinone-1-methide 8, thus generated, undergoes Michael addition with TCC followed by elimination of chloride ions to give a diketone, which further undergoes aldolisation with acetone to give diastereomers 6 and 7. Michael reaction of 8, generated Image from pyranyl ethers 2a-c, with tetrabromocatechol (TBC) under similar-reaction conditions gave the expected monobromo compounds 6h, 6i, 6k, 7n, 7n and 7q. The last step in the proposed mechanism, Image ., aldolisation has also been demonstrated using different ketonic solvents. Thus, reaction of 2a-c with TCC/TBC in diethyl ketone/methyl ethyl ketone under similar reaction conditions gave the expected compounds 6 and 7.

A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that the architecture is latency tolerant and scalable. It is shown that a linear array of 128 uni-threaded processing elements sustains a throughput close to 0.4 million patches/sec.

Multiple UAV Coalitions for a Search and Prosecute Mission

Unmanned aerial vehicles (UAVs) have the potential to carry resources in support of search and prosecute operations. Often to completely prosecute a target, UAVs may have to simultaneously attack the target with various resources with different capacities. However, the UAVs are capable of carrying only limited resources in small quantities, hence, a group of UAVs (coalition) needs to be assigned that satisfies the target resource requirement. The assigned coalition must be such that it minimizes the target prosecution delay and the size of the coalition. The problem of forming coalitions is computationally intensive due to the combinatorial nature of the problem, but for real-time applications computationally cheap solutions are required. In this paper, we propose decentralized sub-optimal (polynomial time) and decentralized optimal coalition formation algorithms that generate coalitions for a single target with low computational complexity. We compare the performance of the proposed algorithms to that of a global optimal solution for which we need to solve a centralized combinatorial optimization problem. This problem is computationally intensive because the solution has to (a) provide a coalition for each target, (b) design a sequence in which targets need to be prosecuted, and (c) take into account reduction of UAV resources with usage. To solve this problem we use the Particle Swarm Optimization (PSO) technique. Through simulations, we study the performance of the proposed algorithms in terms of mission performance, complexity of the algorithms and the time taken to form the coalition. The simulation results show that the solution provided by the proposed algorithms is close to the global optimal solution and requires far less computational resources.