In this paper the Kamat-Riley (K-R) event-based Monte Carlo simulation method was used for reliability analysis of longwall shearer machine. Shearer machine consists of six subsystems; water, haulage, electrical, hydraulic, cutting arms and cable systems in a series network configuration. A shearer in the Tabas coal mine was selected as case study and its all failure data were collected and use...

In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider a sub-optimal greedy heuristic algorithm termed the bound set covering machine (BSCM). Next, we propose the branch and bound set covering machine (BBSCM) and prove that it finds a classifier producing the smallest ge...

In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...

Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an in...

We introduce in this paper an interface for modeling botanical trees that we term a sketch-and-spray interface. In using the interface, a user would sketch out various types of strokes to construct the main structures of a tree. A user could use a branch stroke to draw a single branch, a leaf stroke to draw a single leaf or a stem of leaves, or a copy stroke to draw a whole branch together with...

Certain branch-and-bound algorithms for determining the chromatic number of a graph are proved usually to take a number of steps which grows faster than exponentially with the number of vertices in the graph. A similar result holds for the number of steps in certain proofs of lower bounds for chromatic numbers. Key words, graph, chromatic number, algorithm, proof