An alternative approach to selective sea water oxidation for hydrogen production

Sea water electrolysis is one of the promising ways to produce hydrogen since it is available in plentiful supply on the earth. However, in sea water electrolysis toxic chlorine evolution is the preferred reaction over oxygen evolution at the anode. In this work, research has been focused on the development of electrode materials with a high selectivity for oxygen evolution over chlorine evolution. Selective oxidation in sea water electrolysis has been demonstrated by using a cation-selective polymer. We have used a perm-selective membrane (Nafion®), which electrostatically repels chloride ions (Cl−) to the electrode surface and thereby enhances oxygen evolution at the anode. The efficiency and behaviour of the electrode have been characterized by means of anode current efficiency and polarization studies. The surface morphology of the electrode has been characterized by using a scanning electron microscope (SEM). The results suggest that nearly 100% oxygen evolution efficiency could be achieved when using an IrO2/Ti electrode surface-modified by a perm-selective polymer.

Production of 2-phenethyl alcohol and 2-phenyllactic acid in Candida species

2-Phenethyl alcohol (2-PEA) and 2-phenyllactic acid (2-PLA) were isolated from the culture filtrates of Candida species grown in media containing peptone or phenylalanine as nitrogen source. These compounds were characterized by comparing their UV, IR, and NMR spectral properties with authentic samples. Candida species differed markedly in their production of 2-PEA and 2-PLA. Experiments using [14C]-phenylalanine indicated that both 2-PEA and 2-PLA are synthesised from L-phenylalanine. A pathway for the biosynthesis of 2-PEA from L-phenylalanine has been proposed.

Production of cast aluminium-graphite particle composites using a pellet method

Copper- and nickel-coated graphite particles can be successfully introduced into aluminium-base alloy melts as pellets to produce cast aluminium-graphite particle composites. The pellets were made by pressing mixtures of nickel- or copper-coated graphite particles and aluminium powders together at pressures varying between 2 and 20 kg mm–2. These pellets were dispersed in aluminium alloy melts by plunging and holding them in the melts using a refractory coated mild steel cone, until the pellets disintegrated and the powders were dispersed. The optimum pressure for the preparation of pellets was 2 to 5 kg mm–2 and the optimum size and percentage of aluminium powder were 400 to 1000mgrm and 35 wt% respectively. Under optimum conditions the recovery of the graphite particles in the castings was as high as 96%, these particles being pushed into the last freezing interdendritic regions. The tensile strength and the hardness of the graphite aluminium alloys made using the pellet method are comparable to those of similar composites made using gas injection or the vortex method. The pellet method however has the advantage of greater reproducibility and flexibility. Dispersion of graphite particles in the matrix of cast aluminium alloys using the pellet method increases their resistance to wear.

Entanglement production due to quench dynamics of an anisotropic XY chain in a transverse field

We compute concurrence and negativity as measures of two-spin entanglement generated by a power-law quench (characterized by a rate tau(-1) and an exponent alpha) which takes an anisotropic XY chain in a transverse field through a quantum critical point (QCP). We show that only spins separated by an even number of lattice spacings get entangled in such a process. Moreover, there is a critical rate of quench, tau(-1)(c), above which no two-spin entanglement is generated; the entire entanglement is multipartite. The ratio of the entanglements between consecutive even neighbors can be tuned by changing the quench rate. We also show that for large tau, the concurrence (negativity) scales as root alpha/tau(alpha/tau), and we relate this scaling behavior to defect production by the quench through a QCP.

An NAD(P)(+)-dependent secondary-alcohol dehydrogenase of Alcaligenes eutrophus: Purification, characterization and its application for the production of chiral alcohols

A soil micro-organism identified as Alcaligenes eutrophus capable of utilizing nerolidol, a sesquiterpene alcohol as the sole source of carbon, contains an inducible NAD(P)(+)-linked secondary-alcohol dehydrogenase (SADH), The enzyme was purified 252-fold from crude cell-free extract by a combination of salt precipitation, ion-exchange and affinity-matrix chromatography, Native and SDS/PAGE PAGE of the purified enzyme showed a single protein band and the enzyme appears to be a homotetramer having an apparent molecular mass of 139 kDa comprising four identical subunits of 38.5 kDa, The isoelectric point (pi) of SADH was determined to be 6.2, Depending on pH of the reaction media, the enzyme carried out both oxidation and reductions of various terpenoids and steroids, At pH 5.5, the enzyme catalysed the stereospecific reduction of prochiral ketones to optically active (S)-alcohols and the oxidation reaction was predominated over the former at pH 9.5, NADP(+) and NADPH were respectively preferred over NAD(+) and NADH for oxidation and reduction reactions, The K-m values for testosterone, NADP(+) and NAD(+) were 11.8, 55.6, and 122 mu M respectively, Neither enzyme was significantly inhibited by metal-binding agents, but some thiol-blocking compounds inhibited it, SADH tolerates moderate concentrations of water-miscible organic solvents such as ethanol, methanol, acetone and dioxan, Some of the properties of this enzyme were found to be significantly different from those thus far described.

Greedy Scheduling in Multihop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.

A strategy for scheduling tightly coupled parallel applications on clusters

Although various strategies have been developed for scheduling parallel applications with independent tasks, very little work exists for scheduling tightly coupled parallel applications on cluster environments. In this paper, we compare four different strategies based on performance models of tightly coupled parallel applications for scheduling the applications on clusters. In addition to algorithms based on existing popular optimization techniques, we also propose a new algorithm called Box Elimination that searches the space of performance model parameters to determine the best schedule of machines. By means of real and simulation experiments, we evaluated the algorithms on single cluster and multi-cluster setups. We show that our Box Elimination algorithm generates up to 80% more efficient schedule than other algorithms. We also show that the execution times of the schedules produced by our algorithm are more robust against the performance modeling errors.

Cross-Layer Scheduling with Infrequent Channel and Queue Measurements

The downlink scheduling problem in multi-queue multi-server systems under channel uncertainty is considered. Two policies that make allocations based on predicted channel states are proposed. The first is an extension of the well-known dynamic backpressure policy to the uncertain channel case. The second is a variant that improves delay performance under light loads. The stability region of the system is characterised and the first policy is argued to be throughput optimal. A recently proposed policy of Kar et al [1] has lesser complexity, but is shown to be throughput suboptimal. Further, simulations demonstrate better delay and backlog properties for both our policies at light loads.

Enhanced catharanthine and vindoline production in suspension cultures of Catharanthus roseus by ultraviolet-B light

Suspension cultures of Catharanthus roseus were used to evaluate ultraviolet-B (UV-B) treatment as an abiotic elicitor of secondary metabolites. A dispersed cell suspension culture from C. roseus leaves in late exponential phase and stationary phase were irradiated with UV-B for 5 min. The stationary phase cultures were more responsive to UV-B irradiation than late exponential phase cultures. Catharanthine and vindoline increased 3-fold and 12-fold, respectively, on treatment with a 5-min UV-B irradiation.

CD4+ alpha beta T cell and gamma delta T cell responses to Mycobacterium tuberculosis. Similarities and differences in Ag recognition, cytotoxic effector function, and cytokine production.

CD4+ and gamma delta T cells are activated readily by Mycobacterium tuberculosis. To examine their role in the human immune response to M. tuberculosis, CD4+ and gamma delta T cells from healthy tuberculin-positive donor were studied for patterns of Ag recognition, cytotoxicity, and cytokine production in response to M. tuberculosis-infected mononuclear phagocytes. Both T cell subsets responded to intact M. tuberculosis and its cytosolic Ags. However, CD4+ and gamma delta T cells differed in the range of cytosolic Ags recognized: reactivity to a wide m.w. range of Ags for CD4+ T cells, and a restricted pattern for gamma delta T cells, with dominance of Ags of 10 to 15 kDa. Both T cell subsets were equally cytotoxic for M. tuberculosis-infected monocytes. Furthermore, both CD4+ and gamma delta T cells produced large amounts of IFN-gamma: mean pg/ml of IFN-gamma in supernatants was 2458 +/- 213 for CD4+ and 2349 +/- 245 for gamma delta T cells. By filter-spot ELISA (ELISPOT), the frequency of IFN-gamma-secreting gamma delta T cells was one-half of that of CD4+ T cells in response to M. tuberculosis, suggesting that gamma delta T cells on a per cell basis were more efficient producers of IFN-gamma than CD4+ T cells. In contrast, CD4+ T cells produced more IL-2 than gamma delta T cells, which correlated with diminished T cell proliferation of gamma delta T cells compared with CD4+ T cells. These results indicate that CD4+ and gamma delta T cell subsets have similar effector functions (cytotoxicity, IFN-gamma production) in response to M. tuberculosis-infected macrophages, despite differences in the Ags recognized, IL-2 production, and efficiency of IFN-gamma production.

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

A solution framework for scheduling a BPM with non-identical job dimensions

A Batch Processing Machine (BPM) is one which processes a number of jobs simultaneously as a batch with common beginning and ending times. Also, a BPM, once started cannot be interrupted in between (Pre-emption not allowed). This research is motivated by a BPM in steel casting industry. There are three main stages in any steel casting industry viz., pre-casting stage, casting stage and post-casting stage. A quick overview of the entire process, is shown in Figure 1. There are two BPMs : (1) Melting furnace in the pre-casting stage and (2) Heat Treatment Furnace (HTF) in the post casting stage of steel casting manufacturing process. This study focuses on scheduling the latter, namely HTF. Heat-treatment operation is one of the most important stages of steel casting industries. It determines the final properties that enable components to perform under demanding service conditions such as large mechanical load, high temperature and anti-corrosive processing. In general, different types of castings have to undergo more than one type of heat-treatment operations, where the total heat-treatment processing times change. To have a better control, castings are primarily classified into a number of job-families based on the alloy type such as low-alloy castings and high alloy castings. For technical reasons such as type of alloy, temperature level and the expected combination of heat-treatment operations, the castings from different families can not be processed together in the same batch.

An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.