Queuing Models for Estimating Aircraft Fleet Availability

The availability of a small fleet of aircraft in a flying-base, repair-depot combination is modeled and studied. First, a deterministic flow model relates parameters of interest and represents the state-of-the art in the planning of such systems. Second, a cyclic queue model shows the effect of the principal uncertainties in operation and repair and shows the consequent decrease in the availability of aircraft at the flying-base. Several options such as increasing fleet size, investments in additional repair facilities, or building reliability and maintainability into the individual aircraft during its life-cycle are open for increasing the availability. A life-cycle cost criterion brings out some of these features. Numerical results confirm Rose's prediction that there exists a minimal cost combination of end products and repair-depot capability to achieve a prescribed operational availability.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Cationic Amino Acid Transporters and Salmonella Typhimurium ArgT Collectively Regulate Arginine Availability towards Intracellular Salmonella Growth

Cationic amino acid transporters (mCAT1 and mCAT2B) regulate the arginine availability in macrophages. How in the infected cell a pathogen can alter the arginine metabolism of the host remains to be understood. We reveal here a novel mechanism by which Salmonella exploit mCAT1 and mCAT2B to acquire host arginine towards its own intracellular growth within antigen presenting cells. We demonstrate that Salmonella infected bone marrow derived macrophages and dendritic cells show enhanced arginine uptake and increased expression of mCAT1 and mCAT2B. We show that the mCAT1 transporter is in close proximity to Salmonella containing vacuole (SCV) specifically by live intracellular Salmonella in order to access the macrophage cytosolic arginine pool. Further, Lysosome associated membrane protein 1, a marker of SCV, also was found to colocalize with mCAT1 in the Salmonella infected cell. The intra vacuolar Salmonella then acquire the host arginine via its own arginine transporter, ArgT for growth. The argT knockout strain was unable to acquire host arginine and was attenuated in growth in both macrophages and in mice model of infection. Together, these data reveal survival strategies by which virulent Salmonella adapt to the harsh conditions prevailing in the infected host cells.

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing

In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with `estimated optimal solution' for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.

Land availability and biomass production potential in India

In this paper we have assessed the availability of land and the potential for biomass production in India to meet various demands for biomass, including modern bioenergy. This is estimated by considering the various demands on land and its suitability. The biomass production potential of energy plantations is assessed for different agroecological zones. The total woody biomass production is estimated to be 321 Mt, based on biomass productivity in the range 2 to 17 t/ha/yr for the different agro-ecological zones and considering the conservative estimate of 43 Mha land availability for biomass production. A surplus of 231 Mt of biomass (after meeting the increased demand for fuelwood and timber by the year 2010) is estimated to be available for energy, which has an electricity generation potential of 231 TWh. As a first step, only the feasible physical potential of biomass production is assessed, along with an analysis of barriers. The potential costs and benefits of biomass production strategy are not analysed. (C) 1999 Elsevier Science Ltd. All rights reserved.

Queuing Network Models for Aircraft Availability and Spares Management

Interactions of major activities involved in airfleet operations, maintenance, and logistics are investigated in the framework of closed queuing networks with finite number of customers. The system is viewed at three levels, namely: operations at the flying-base, maintenance at the repair-depot, and logistics for subsystems and their interactions in achieving the system objectives. Several performance measures (eg, availability of aircraft at the flying-base, mean number of aircraft on ground at different stages of repair, use of repair facilities, and mean time an aircraft spends in various stages of repair) can easily be computed in this framework. At the subsystem level the quantities of interest are the unavailability (probability of stockout) of a spare and the duration of its unavailability. The repair-depot capability is affected by the unavailability of a spare which in turn, adversely affects the availability of aircraft at the flying-base level. Examples illustrate the utility of the proposed models.

Toward Real-Time Availability of 3D Temperature Maps Created with Temporally Constrained Reconstruction

PurposeTo extend the previously developed temporally constrained reconstruction (TCR) algorithm to allow for real-time availability of three-dimensional (3D) temperature maps capable of monitoring MR-guided high intensity focused ultrasound applications. MethodsA real-time TCR (RT-TCR) algorithm is developed that only uses current and previously acquired undersampled k-space data from a 3D segmented EPI pulse sequence, with the image reconstruction done in a graphics processing unit implementation to overcome computation burden. Simulated and experimental data sets of HIFU heating are used to evaluate the performance of the RT-TCR algorithm. ResultsThe simulation studies demonstrate that the RT-TCR algorithm has subsecond reconstruction time and can accurately measure HIFU-induced temperature rises of 20 degrees C in 15 s for 3D volumes of 16 slices (RMSE = 0.1 degrees C), 24 slices (RMSE = 0.2 degrees C), and 32 slices (RMSE = 0.3 degrees C). Experimental results in ex vivo porcine muscle demonstrate that the RT-TCR approach can reconstruct temperature maps with 192 x 162 x 66 mm 3D volume coverage, 1.5 x 1.5 x 3.0 mm resolution, and 1.2-s scan time with an accuracy of 0.5 degrees C. ConclusionThe RT-TCR algorithm offers an approach to obtaining large coverage 3D temperature maps in real-time for monitoring MR-guided high intensity focused ultrasound treatments. Magn Reson Med 71:1394-1404, 2014. (c) 2013 Wiley Periodicals, Inc.

The influence of reduced oxygen availability on gene expression in laboratory (H37Rv) and clinical strains (S7 and S10) of Mycobacterium tuberculosis

Mycobacterium tuberculosis has the ability to persist within the host in a dormant stage. One important condition believed to contribute to dormancy is reduced access to oxygen known as hypoxia. However, the response of M. tuberculosis to such hypoxia condition is not fully characterized. Virtually all dormant models against tuberculosis tested in animals used laboratory strain H37Rv or Erdman strain. But major outbreaks of tuberculosis (TB) occur with the strains that have widely different genotypes and phenotypes compared to H37Rv. In this study, we used a custom oligonucleotide microarray to determine the overall transcriptional response of laboratory strain (H37Rv) and most prevalent clinical strains (S7 and S10) of M. tuberculosis from South India to hypoxia. Analysis of microarray results revealed that a total of 1161 genes were differentially regulated (>= 1.5 fold change) in H37Rv, among them 659 genes upregulated and 502 genes down regulated. Microarray data of clinical isolates showed that a total of 790 genes were differentially regulated in S7 among which 453 genes were upregulated and 337 down regulated. Interestingly, numerous genes were also differentially regulated in S10 (total 2805 genes) of which 1463 genes upregulated and 1342 genes down regulated during reduced oxygen condition (Wayne's model). One hundred and thirty-four genes were found common and upregulated among all three strains (H37Rv, S7, and S10) and can be targeted for drug/vaccine development against TB. (C) 2015 Published by Elsevier B.V.

Flexible implementation of power system corrective topology control

This paper proposes a novel decision making framework for optimal transmission switching satisfying the AC feasibility, stability and circuit breaker (CB) reliability requirements needed for practical implementation. The proposed framework can be employed as a corrective tool in day to day operation planning scenarios in response to potential contingencies. The switching options are determined using an efficient heuristic algorithm based on DC optimal power flow, and are presented in a multi-branch tree structure. Then, the AC feasibility and stability checks are conducted and the CB condition monitoring data are employed to perform a CB reliability and line availability assessment. Ultimately, the operator will be offered multiple AC feasible and stable switching options with associated benefits. The operator can use this information, other operating conditions not explicitly considered in the optimization, and his/her own experience to implement the best and most reliable switching action(s). The effectiveness of the proposed approach is validated on the IEEE-118 bus test system. (C) 2015 Elsevier B.V. All rights reserved.

Load Balancing with Availability Checker and Load Reporters (LB-ACLRs) for improved Performance in Distributed Systems

Distributed system has quite a lot of servers to attain increased availability of service and for fault tolerance. Balancing the load among these servers is an important task to achieve better performance. There are various hardware and software based load balancing solutions available. However there is always an overhead on Servers and the Load Balancer while communicating with each other and sharing their availability and the current load status information. Load balancer is always busy in listening to clients' request and redirecting them. It also needs to collect the servers' availability status frequently, to keep itself up-to-date. Servers are busy in not only providing service to clients but also sharing their current load information with load balancing algorithms. In this paper we have proposed and discussed the concept and system model for software based load balancer along with Availability-Checker and Load Reporters (LB-ACLRs) which reduces the overhead on server and the load balancer. We have also described the architectural components with their roles and responsibilities. We have presented a detailed analysis to show how our proposed Availability Checker significantly increases the performance of the system.