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.

Spontaneous and reversible self-assembly of a polypeptide fragment of insulin-like growth factor binding protein-2 into fluorescent nanotubular structures

In this communication, we report the spontaneous and reversible in vitro self-assembly of a polypeptide fragment derived from the C-terminal domain of Insulin-like Growth Factor Binding Protein (IGFBP-2) into soluble nanotubular structures several micrometres long via a mechanism involving inter-molecular disulfide bonds and exhibiting enhanced fluorescence.

Surface cathepsin B protects cytotoxic lymphocytes from self-destruction after degranulation.

The granule exocytosis cytotoxicity pathway is the major molecular mechanism for cytotoxic T lymphocyte (CTL) and natural killer (NK) cytotoxicity, but the question of how these cytotoxic lymphocytes avoid self-destruction after secreting perforin has remained unresolved. We show that CTL and NK cells die within a few hours if they are triggered to degranulate in the presence of nontoxic thiol cathepsin protease inhibitors. The potent activity of the impermeant, highly cathepsin B-specific membrane inhibitors CA074 and NS-196 strongly implicates extracellular cathepsin B. CTL suicide in the presence of cathepsin inhibitors requires the granule exocytosis cytotoxicity pathway, as it is normal with CTLs from gld mice, but does not occur in CTLs from perforin knockout mice. Flow cytometry shows that CTLs express low to undetectable levels of cathepsin B on their surface before degranulation, with a substantial rapid increase after T cell receptor triggering. Surface cathepsin B eluted from live CTL after degranulation by calcium chelation is the single chain processed form of active cathepsin B. Degranulated CTLs are surface biotinylated by the cathepsin B-specific affinity reagent NS-196, which exclusively labels immunoreactive cathepsin B. These experiments support a model in which granule-derived surface cathepsin B provides self-protection for degranulating cytotoxic lymphocytes.

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.

High lithium storage in micrometre sized mesoporous spherical self-assembly of anatase titania nanospheres and carbon

Composite of anatase titania (TiO2) nanospheres and carbon grown and self-assembled into micron-sized mesoporous spheres via a solvothermal synthesis route are discussed here in the context of rechargeable lithium-ion battery. The morphology and carbon content and hence the electrochemical performance are observed to be significantly influenced by the synthesis parameters. Synthesis conditions resulting in a mesoporous arrangement of an optimized amount carbon and TiO2 exhibited the best lithium battery performance. The first discharge cycle capacity of carbon-titania mesoporous spheres (solvothermal reaction at 150 degrees C at 6 h, calcination at 500 degrees C under air, BET surface area 80 m(2)g(-1)) was 334 mAhg(-1) (approximately 1 Li) at current rate of 0.066 Ag-1. High storage capacity and good cyclability is attributed to the nanostructuring of TiO2 (mesoporosity) as well as due to formation of a percolation network of carbon around the TiO2 nanoparticles. The micron-sized mesoporous spheres of carbon-titania composite nanoparticles also show good rate cyclability in the range (0.066-6.67) Ag-1.

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 self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

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.

Evolutionary Significance of Self-acylation Property in Acyl Carrier Proteins

Acyl carrier protein is an integral component of many cellular metabolic processes. A number of studies have reported self-acylation behavior in acyl carrier proteins. Although AM exhibit high levels of similarity in their primary and tertiary structures, self-acylation behavior is restricted to only some ACPs that can be classified into two major families based on their function. The first family of ACPs is involved in polyketide biosynthesis, whereas the second family participates in fatty acid synthesis. Facilitated by the growing number of genome sequences available for analyses, large-scale phylogenetic studies were used in these studies to uncover as to how self-acylation behavior of acyl carrier proteins is linked with the evolution of metabolic pathways in organisms. These studies show that self-acylation behavior in acyl carrier proteins was lost during the course of evolution, with certain organisms and organelles viz. plastids, retaining it for specified functions. (C) 2009 IUBMB IUBMB Life, 61(8): 853-859, 2009

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.

Electrochemical Functionalization of a Gold Electrode with Redox-Active Self-Assembled Monolayer for Electroanalytical Application

The electrochemical functionalization of a Au electrode with a redox-active monolayer and the electroanalytical applications of the functionalized electrode are described. Reaction of the electrochemically derived o-quinone on the self-assembled monolayer (SAM) of 6-mercaptopurine (MPU) on a Au electrode gives a redox-active 4-(6-mercapto-purin-9-yl)benzene-1,2-diol (MPBD) self-assembly under optimized conditions. Electrochemical quartz crystal microbalance technique has been employed to follow the functionalization of the electrode in real time. Electrochemically derived o-quinone reacts at the N(9) position of the self-assembled MPU in neutral pH. Raman spectral measurement confirms the reaction of o-quinone on MPU self-assembly. MPBD shows a well-defined reversible redox response, characteristic of a surface-confined redox mediator at 0.21 V in neutral pH. The anodic peak potential (Epa) of MPBD shifts by −60 mV while changing the solution pH by 1 unit, indicating that the redox reaction involves two electrons and two protons. The surface coverage (Γ) of MPBD was 7.2 ± 0.3 × 10-12 mol/cm2. The apparent heterogeneous rate constant (ksapp) for MPBD was 268 ± 6 s-1. MPBD efficiently mediates the oxidation of nicotinamide adenine dinucleotide (NADH) and ascorbate (AA). A large decrease in the overpotential and significant increase in the peak current with respect to the unmodified electrode has been observed. Surface-confined MPBD has been successfully used for the amperometric sensing of NADH and AA in neutral pH at the nanomolar level.

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Microscopic Frictional Response of Sodium Oleate Self-Assembled on Steel

The article peruses the frictional response of an important metal working lubricant additive, sodium oleate. Frictional force microscopy is used to track the response of molecules self-assembled on a steel substrate of 3–4 nm roughness at 0% relative humidity. The friction-normal load characteristic emerges as bell-shaped, where the peak friction and normal load at peak friction are both sensitive to substrate roughness. The frictional response at loads lower than that associated with the peak friction is path reversible while at higher loads the loading and unloading paths are different. We suggest that a new low-friction interface material is created when the normal loads are high.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.