Chute Losses Aren't Accidents! Most Injuries can be Avoided. Here's How to Rate the Performance of Your Chute and Crew

The conclusion of the article reads "good handling during processing and re-implanting could mean the difference between a going operation and financial disaster. But it's up to you to make certain your crew understands and follows proper chute practices. When they do, it will mean more money in your pocket."

Low Level Jet stream of Asian Summer Monsoon and its Variability

The main objective of the of present study are to study the intraseasonal variability of LLJ and its relation with convective heating of the atmosphere, to establish whether LLJ splits into two branches over the Arabian sea as widely believed, the role of horizonatal wind shear of LLJ in the episodes of intense rainfall events observed over the west coast of India, to perform atmospheric modeling work to test whether small (meso) scale vortices form during intense rainfall events along the west coast; and to study the relation between LLJ and monsoon depression genesis. The results of a study on the evolution of Low Level Jetstream (LLJ) prior to the formation of monsoon depressions are presented. A synoptic model of the temporal evolution of monsoon depression has been produced. There is a systematic temporal evolution of the field of deep convection strength and position of the LLJ axis leading to the genesis of monsoon depression. One of the significant outcomes of the present thesis is that the LLJ plays an important role in the intraseasonal and the interannual variability of Indian monsoon activity. Convection and rainfall are dependent mainly on the cyclonic vorticity in the boundary layer associated with LLJ. Monsoon depression genesis and the episodes of very heavy rainfall along the west coast of India are closely related to the cyclonic shear of the LLJ in the boundary layer and the associated deep convection. Case studies by a mesoscale numerical model (MM5) have shown that the heavy rainfall episodes along the west coast of India are associated with generation of mesoscale cyclonic vortices in the boundary layer.

OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE

In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability and with probability 1− leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability (< 1) and with probability 1 − leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.

On Queues with Interruptions and Repeat or Resumption of Service

This thesis entitled' On Queues with Interruptions and Repeat or Resumption of Service' introduces several new concepts into queues with service interruption. It is divided into Seven chapters including an introductory chapter. The following are keywords that we use in this thesis: Phase type (PH) distribution, Markovian Arrival Process (MAP), Geometric Distribution, Service Interruption, First in First out (FIFO), threshold random variable and Super threshold random variable. In the second chapter we introduce a new concept called the 'threshold random variable' which competes with interruption time to decide whether to repeat or resume the interrupted service after removal of interruptions. This notion generalizes the work reported so far in queues with service interruptions. In chapter 3 we introduce the concept of what is called 'Super threshold clock' (a random variable) which keeps track of the total interruption time of a customer during his service except when it is realized before completion of interruption in some cases to be discussed in this thesis and in other cases it exactly measures the duration of all interruptions put together. The Super threshold clock is OIl whenever the service is interrupted and is deactivated when service is rendered. Throughout this thesis the first in first out service discipline is followed except for priority queues.

Development of Innovative Low Cost Larviculture Technologies of the Giant Fresh Water Prawn,Macrobrachium Rosenbergii(De Man)

School of Industrial Fisheries, Cochin University of Science and Technology

Safe Distributed Coordination of Heterogeneous Robots through Dynamic Simple Temporal Networks

Research on autonomous intelligent systems has focused on how robots can robustly carry out missions in uncertain and harsh environments with very little or no human intervention. Robotic execution languages such as RAPs, ESL, and TDL improve robustness by managing functionally redundant procedures for achieving goals. The model-based programming approach extends this by guaranteeing correctness of execution through pre-planning of non-deterministic timed threads of activities. Executing model-based programs effectively on distributed autonomous platforms requires distributing this pre-planning process. This thesis presents a distributed planner for modelbased programs whose planning and execution is distributed among agents with widely varying levels of processor power and memory resources. We make two key contributions. First, we reformulate a model-based program, which describes cooperative activities, into a hierarchical dynamic simple temporal network. This enables efficient distributed coordination of robots and supports deployment on heterogeneous robots. Second, we introduce a distributed temporal planner, called DTP, which solves hierarchical dynamic simple temporal networks with the assistance of the distributed Bellman-Ford shortest path algorithm. The implementation of DTP has been demonstrated successfully on a wide range of randomly generated examples and on a pursuer-evader challenge problem in simulation.

Group 21 Slartibartfast - Group Resource

Informative website about Anonymous/LulzSec and Denial of Service attacks

The distributed nature of pattern generalization

Resumen tomado de la publicaci??n

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

Distributed mining of molecular fragments

In real world applications sequential algorithms of data mining and data exploration are often unsuitable for datasets with enormous size, high-dimensionality and complex data structure. Grid computing promises unprecedented opportunities for unlimited computing and storage resources. In this context there is the necessity to develop high performance distributed data mining algorithms. However, the computational complexity of the problem and the large amount of data to be explored often make the design of large scale applications particularly challenging. In this paper we present the first distributed formulation of a frequent subgraph mining algorithm for discriminative fragments of molecular compounds. Two distributed approaches have been developed and compared on the well known National Cancer Institute’s HIV-screening dataset. We present experimental results on a small-scale computing environment.

The relationships of age and length of service with job satisfaction: an examination of hotel employees in Thailand

Earlier studies suggest age is positively associated with job satisfaction, while others use length of service, or tenure, as a predictor of job satisfaction levels. This article examines whether age and tenure are individual determinants of satisfaction, or whether there is an interaction between the two. The results indicate that employee age is not significantly associated with overall job satisfaction level, but that tenure is. There is also significant relationship between tenure and facets of satisfaction (job, pay and fringe benefits), but the effect of tenure on satisfaction is significantly modified by age.

The effect of carrier substrate, dose rate and time of application on biocontrol efficacy of fungal antagonists against Armillaria root rot of strawberry plants.

In a glasshouse experiment using potted strawberry plants (cv. Cambridge Favourite) as hosts, the effect of selected fungal antagonists grown on 25 or 50 g of mushroom compost containing autoclaved mycelia of Agaricus bisporus, or wheat bran was evaluated against Armillaria mellea. Another glasshouse experiment tested the effect of application time of the antagonists in relation to inoculations with the pathogen. A significant interaction was found between the antagonists, substrates and dose rates. All the plants treated with Chaetomium olivaceum isolate Co on 50 g wheat bran survived until the end of the experiment which lasted 482 days, while none of them survived when this antagonist was added to the roots of the plants on 25 g wheat bran or 25 or 50 g mushroom compost. Dactylium dendroides isolate SP had a similar effect, although with a lower host survival rate of 33.3%. Trichoderma hamatum isolate Tham 1 and T. harzianum isolate Th23 protected 33.3% of the plants when added on 50 g and none when added on 25 g of either substrate, while 66.7% of the plants treated with T. harzianum isolate Th2 on 25 g, or T viride isolate TO on 50 g wheat bran, survived. Application of the antagonists on mushroom compost initially resulted in development of more leaves and healthier plants, but this effect was not sustained. Eventually, plants treated with the antagonists on wheat bran had significantly more leaves and higher health scores. The plants treated with isolate Th2 and inoculated with Armillaria at the same time had a survival rate of 66.7% for the duration of the experiment (475 days), while none of them survived that long when the antagonist and pathogen were applied with an interval of 85 days in either sequence. C. olivaceum isolate Co showed a protective effect only, as 66.7% of the plants survived when they were treated with the antagonist 85 days before inoculation with the pathogen, while none of them survived when the antagonist and pathogen were applied together or the infection preceded protection.