Mo3O5(OH)(2)(AsO4)2: A new solid with a structure related to beta VOPO4

Mo3O5(OH)(2)(AsO4)(2) was prepared at 100 degrees C from an aqueous solution of MoO3 containing arsenic and nitric acids. It crystallises in the monoclinic system, a = 13.024(1)Angstrom, b = 7.2974 (2) Angstrom, c = 13.281(1) Angstrom, beta = 121.124(8)degrees, Z = 4, space group C2/c. The structure was determined by Rietveld refinement from X-ray powder diffraction data. The three-dimensional structure is built up from MoO6 and MoO5OH octahedra and AsO4 tetrahedra sharing corners. The octahedra share two opposite vertices forming zigzag chains that run parallel to [10(1) over bar]. Each AsO4 tetrahedron is connected to four octahedra, two of which belong to the same chain, thus linking three chains. The resulting covalent framework is similar to that of beta VOPO4 in which one tetrahedral P site for every three is empty. The two protons are likely to be bonded to two (out of four) unshared oxygen atoms surrounding this empty site. All the Mo atoms are strongly off-centred in the octahedra; and the off-centring is disordered. The disorder is discussed in terms of Mo shifts perturbed by a disordered hydrogen bonding scheme.

Robust controller for an autonomous small refrigeration unit

The authors describe the constructional features of a controller for operating an autonomous refrigeration unit powered by a field of photovoltaic panels and backed up by a generator set. The controller enables three voltage levels of operation of an inverter to meet the start, run and off cycle conditions of the refrigerator compressor. The algorithm considers several input and output parameters and status signals from each subsystem of the unit to deduce a control strategy. Such units find application for storage of vaccines and life-saving medicines requiring uninterrupted refrigeration, in medical shops, rural health centres, veterinary laboratories etc.

Localized data gathering paradigms for small and marginal farm lands in Semi-Arid region – Issues and Concerns

In this work we explore the application of wireless sensor technologies for the benefit of small and marginal farmers in semi-arid regions. The focus in this paper is to discuss the merits and demerits of data gathering & relay paradigms that collect localized data over a wide area. The data gathered includes soil moisture, temperature, pressure, rain data and humidity. The challenge to technology intervention comes mainly due to two reasons: (a) Farmers in general are interested in crop yield specific to their piece of land. This is because soil texture can vary rapidly over small regions. (b) Due to a high run-off, the soil moisture retention can vary from region to region depending on the topology of the farm. Both these reasons alter the needs drastically. Additionally, small and marginal farms can be sandwiched between rich farm lands. The village has very little access to grid power. Power cuts can extend up to 12 hours in a day and upto 3 or 4 days during some months in the year. In this paper, we discuss 3 technology paradigms for data relaying. These include Wi-Fi (Wireless Fidelity), GPRS (General Packet Radio Service) and DTN (Delay and Disruption Tolerant Network) technologies. We detail the merits and demerits of each of these solutions and provide our final recommendations. The project site is a village called Chennakesavapura in the state of Karnataka, India.

Dynamic path profile aided recompilation in a JAVA just-in-time compiler

Just-in-Time (JIT) compilers for Java can be augmented by making use of runtime profile information to produce better quality code and hence achieve higher performance. In a JIT compilation environment, the profile information obtained can be readily exploited in the same run to aid recompilation and optimization of frequently executed (hot) methods. This paper discusses a low overhead path profiling scheme for dynamically profiling AT produced native code. The profile information is used in recompilation during a subsequent invocation of the hot method. During recompilation tree regions along the hot paths are enlarged and instruction scheduling at the superblock level is performed. We have used the open source LaTTe AT compiler framework for our implementation. Our results on a SPARC platform for SPEC JVM98 benchmarks indicate that (i) there is a significant reduction in the number of tree regions along the hot paths, and (ii) profile aided recompilation in LaTTe achieves performance comparable to that of adaptive LaTTe in spite of retranslation and profiling overheads.

Enzymatic synthesis of flavors in supercritical carbon dioxide

Commercially important flavor esters of isoamyl alcohol, catalyzed by crude hog pancreas lipase (HPL), were synthesized under solvent-free conditions and in supercritical carbon dioxide. The esters synthesized were isoamyl acetate, isoamyl propionate, isoamyl butyrate, and isoamyl octanoate. Very low yields (3-4%) of isoamyl acetate were obtained, but high yields for the other three esters were obtained under both supercritical and solvent-free conditions. The yields of esters of the even-carbon acids, isoamyl acetate, butyrate, and octanoate, increased with increasing chain length, whereas the yield of isoamyl propionate was higher than that of isoamyl butyrate. The optimum temperature of the reaction was higher under supercritical conditions (45 degreesC) than under solvent-free conditions (35-40 degreesC). The effects of other parameters such as alcohol concentration, water concentration, and enzyme loading were investigated. An increase in the water concentration decreased the conversion significantly in supercritical carbon dioxide but not under solvent-free conditions. The optimum ratio of alcohol to acid was dependent on the extent of inhibition by the acid. Although providing a higher apparent yield by being run in a highly concentrated medium, the overall conversion under solvent-free conditions was lower than that under supercritical conditions for similar enzyme concentrations, indicating that the synthesis of esters in supercritical carbon dioxide might be a viable option.

Icosahedral quasicrystalline and hexagonal approximant phases in the Al-Mn-Be alloy system

We report the formation of a primitive icosahedral quasicrystal with increased stability in Al Mn-Be alloys close to the compound Al15Mn13Be2, by melt spinning and injection casting. The crystal structure of this compound was unknown. We show that in as-cast as well as heat treated condition the intermetallic phase H1 has a hexagonal structure with lattice parameters a = 1.2295 run and c = 2.4634 nm. The space group is P6(3)/mmc In the injection-cast samples, the quasicrystal coexists with another closely related hexagonal phase H2 with a = 1.2295 nm and c = 1.2317 nm with a possible space group of P6/mmm. This phase exhibits specific orientation relationships with the icosahedral quasicrystal given by [0001](hex)//2f(QC) and [01 (1) over bar0](hex)//5f(QC) where 2f(QC) and 5f(QC) represent twofold and fivefold axes respectively. Electron diffraction patterns from both phases exhibit a close resemblance to the quasicrystalline phase. It is shown that the H1 phase is closely related to mu-Al4Mn with the same e parameter while the a parameter is reduced by tau. Following Kreiner and Franzen, it is postulated that both structures (H1 and H2) can be understood by a simple hexagonal packing of I13 clusters.

Photodissociation dynamics of CH2ICl at 222, 236, 266, 280, and-304 nm

Dynamics of I*(P-2(1/2)) formation from CH2ICl dissociation has-been investigated at five different ultraviolet excitation wavelengths, e.g., 222, 236, 266, 280, and similar to304 nm. The quantum yield of I*((2)p(1/2)) production, phi*, has been measured by monitoring nascent I(P-2(3/2)) and I* concentrations using a resonance enhanced multiphoton ionization detection scheme. The measured quantum yield as a function of excitation energy follows the same trend as that of methyl iodide except at 236 run. The photodissociation dynamics of CH2ICl also involves three upper states similar to methyl iodide, and a qualitative correlation diagram has been constructed to account for the observed quantum yield. From the difference in behavior at 236 nm, it appears that the crossing region between the two excited states ((3)Q(0) and (1)Q(1)) is located near the exit valley away from the Franck Condon excitation region. The B- and C-band transitions do not participate in the dynamics, and the perturbation of the methyl iodide states due to Cl-I interaction is relatively weak at the photolysis wavelengths employed in this investigation.

Characterization of the gene encoding the envelope fusion glycoprotein GP64 from Bombyx mori nucleopolyhedrovirus

We describe here the characterization of the gene gp64 encoding the envelope fusion protein GP64 (open reading frame) ORF 105 from Bombyx mori nucleopolyhedrovirus (BmNPV). gp64 was transcribed from the early to late stages of infection and the transcripts were seen from 6 to 72 h post infection (hpi). The early transcripts initiated from a consensus CAGT motif while the late transcripts arose from three conserved TAAG motifs, all of which were located in the near upstream region of the coding sequence. Both early and late transcripts terminated at a run of T residues following the second polyadenylation signal located 31 nt downstream of the translation termination codon. BmGP64 protein was detectable from 6 hpi and was present in larger quantities throughout the infection process from 12 hpi, in BmNPV-infected BmN cells. The persistent presence of GP64 in BmN cells differed from the protein expression pattern of GP64 in Autographa californica multinucleocapsid nucleopolyhedrovirus infection, where the protein levels decreased significantly by late times (48 hpi). BmGP64 was located in the membrane and cytoplasm of the infected host cells and as a component of the budded virions. The production of infectious budded virus and the fusion activity were reduced when glycosylation of GP64 was inhibited. (C) 2003 Elsevier Science B.V. All rights reserved.

Crack formation due to annealing of Al2O3 films grown on Si(100) by MOCVD

We report crack formation in alumina films grown on Si(100), caused by annealing in a controlled oxidizing ambient. The films were grown in a low-pressure CVD reactor, using aluminium acetylacetonate as precursor. High purity argon and nitrous oxide were employed as carrier and oxidizing gas, respectively. The films were characterized by optical microscopy and SEM/EDAX. The proportion and chemical nature of the heteroatoms, namely C and H, incorporated into the films from the precursor, were characterized by XPS, and FTIR. As-deposited films do not exhibit any cracks, while post-deposition annealing results in cracks. Apart from the delamination of the films, annealing in nitrous oxide ambient leads to an unusual crack geometry, which we term the “railway-track”. These twin cracks are very straight and run parallel to each other for as much as several millimeters. Often, two such linear tracks meet at exactly 90°. Between some of these tracks lie bullet-like structures with very sharp tips, oriented in a specific direction. As cracks are generally activated by residual stress, both thermal and intrinsic, the origins of the stresses that generate these linear cracks are discussed. The redistribution of stress, arising from the removal of C and H during annealing, will also be discussed. An attempt has been made to correlate the formation of cracks with the crystal structure of the film.

Believe it or Not! Multicore CPUs can Match GPUs for FLOP-intensive Applications

In this work, we evaluate performance of a real-world image processing application that uses a cross-correlation algorithm to compare a given image with a reference one. The algorithm processes individual images represented as 2-dimensional matrices of single-precision floating-point values using O(n4) operations involving dot-products and additions. We implement this algorithm on a nVidia GTX 285 GPU using CUDA, and also parallelize it for the Intel Xeon (Nehalem) and IBM Power7 processors, using both manual and automatic techniques. Pthreads and OpenMP with SSE and VSX vector intrinsics are used for the manually parallelized version, while a state-of-the-art optimization framework based on the polyhedral model is used for automatic compiler parallelization and optimization. The performance of this algorithm on the nVidia GPU suffers from: (1) a smaller shared memory, (2) unaligned device memory access patterns, (3) expensive atomic operations, and (4) weaker single-thread performance. On commodity multi-core processors, the application dataset is small enough to fit in caches, and when parallelized using a combination of task and short-vector data parallelism (via SSE/VSX) or through fully automatic optimization from the compiler, the application matches or beats the performance of the GPU version. The primary reasons for better multi-core performance include larger and faster caches, higher clock frequency, higher on-chip memory bandwidth, and better compiler optimization and support for parallelization. The best performing versions on the Power7, Nehalem, and GTX 285 run in 1.02s, 1.82s, and 1.75s, respectively. These results conclusively demonstrate that, under certain conditions, it is possible for a FLOP-intensive structured application running on a multi-core processor to match or even beat the performance of an equivalent GPU version.

Present status of Gottigere Tank : Indicator of Decision maker’s apathy

Gottigere lake with a water spread area of about 14.98 ha is located in the Bellandur Lake catchment of the South Pennar River basin. In recent years, this lake catchment has been subjected to environmental stress mainly due to the rampant unplanned developmental activities in the catchment. The functional ability of the ecosystem is impaired due to structural changes in the ecosystem. This is evident from poor water quality, breeding of disease vectors, contamination of groundwater in the catchment, frequent flooding in the catchment due to topography alteration, decline in groundwater table, erosion in lake bed, etc. The development plans of the region (current as well as the proposed) ignore the integrated planning approaches considering all components of the ecosystem. Serious threats to the sustainability of the region due to lack of holistic approaches in aquatic resources management are land use changes (removal of vegetation cover, etc.), point and non-point sources of pollution impairing water quality, dumping of solid waste (building waste, etc.). Conservation of lake ecosystem is possible only when the physical and chemical integrity of its catchment is maintained. Alteration in the catchment either due to land use changes (leading to paved surface area from vegetation cover), alteration in topography, construction of roads in the immediate vicinity are detrimental to water yield in the catchment and hence, the sustenance of the lake. Open spaces in the form of lakes and parks aid as kidney and lung in an urban ecosystem, which maintain the health of the people residing in the locality. Identification of core buffer zones and conservation of buffer zones (500 to 1000 m from shore) is to be taken up on priority for conservation and sustainable management of Bangalore lakes. Bangalore is located over a ridge delineating four watersheds, viz. Hebbal, Koramangala, Challaghatta and Vrishabhavathi. Lakes and tanks are an integral part of natural drainage and help in retaining water during rainfall, which otherwise get drained off as flash floods. Each lake harvests rainwater from its catchment and surplus flows downstream spilling into the next lake in the chain. The topography of Bangalore has uniquely supported the creation of a large number of lakes. These lakes form chains, being a series of impoundments across streams. This emphasises the interconnectivity among Bangalore lakes, which has to be retained to prevent Bangalore from flooding or from water scarcity. The main source of replenishment of groundwater is the rainfall. The slope of the terrain allows most of the rainwater to flow as run-off. With the steep gradients available in the major valleys of Bangalore, the rainwater will flow out of the city within four to five hours. Only a small fraction of the rainwater infiltrates into the soil. The infiltration of water into the subsoil has declined with more and more buildings and paved road being constructed in the city. Thus the natural drainage of Bangalore is governed by flows from the central ridge to all lower contours and is connected with various tanks and ponds. There are no major rivers flowing in Bangalore and there is an urgent need to sustain these vital ecosystems through proper conservation and management measures. The proposed peripheral ring road connecting Hosur Road (NH 7) and Mysore Road (SH 17) at Gottigere lake falls within the buffer zone of the lake. This would alter the catchment integrity and hence water yield affecting flora, fauna and local people, and ultimately lead to the disappearance of Gottigere lake. Developmental activities in lake catchments, which has altered lake’s ecological integrity is in violation of the Indian Fisheries Act – 1857, the Indian Forest Act – 1927, Wildlife (Protection) Act – 1972, Water (Prevention and Control of Pollution) Act – 1974, Water (Prevention and Control of Pollution) Act – 1977, Forest (Conservation Act) – 1980, Environmental (Protection) Act – 1986, Wildlife (Protection) Amendment Act – 1991 and National Conservation Strategy and Policy Statement on Environment and Development – 1992. Considering 65% decline of waterbodies in Bangalore (during last three decades), decision makers should immediately take preventive measures to ensure that lake ecosystems are not affected. This report discusses the impacts due to the proposed infrastructure developmental activities in the vicinity of Gottigere tank.

Stochastic Algorithms for Discrete Parameter Simulation Optimization

We present two efficient discrete parameter simulation optimization (DPSO) algorithms for the long-run average cost objective. One of these algorithms uses the smoothed functional approximation (SFA) procedure, while the other is based on simultaneous perturbation stochastic approximation (SPSA). The use of SFA for DPSO had not been proposed previously in the literature. Further, both algorithms adopt an interesting technique of random projections that we present here for the first time. We give a proof of convergence of our algorithms. Next, we present detailed numerical experiments on a problem of admission control with dependent service times. We consider two different settings involving parameter sets that have moderate and large sizes, respectively. On the first setting, we also show performance comparisons with the well-studied optimal computing budget allocation (OCBA) algorithm and also the equal allocation algorithm. Note to Practitioners-Even though SPSA and SFA have been devised in the literature for continuous optimization problems, our results indicate that they can be powerful techniques even when they are adapted to discrete optimization settings. OCBA is widely recognized as one of the most powerful methods for discrete optimization when the parameter sets are of small or moderate size. On a setting involving a parameter set of size 100, we observe that when the computing budget is small, both SPSA and OCBA show similar performance and are better in comparison to SFA, however, as the computing budget is increased, SPSA and SFA show better performance than OCBA. Both our algorithms also show good performance when the parameter set has a size of 10(8). SFA is seen to show the best overall performance. Unlike most other DPSO algorithms in the literature, an advantage with our algorithms is that they are easily implementable regardless of the size of the parameter sets and show good performance in both scenarios.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

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.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

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. 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. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters

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