Evaluating the similarity of different measured variables is a fundamental task of statistics, and a key part of many bioinformatics algorithms. Here we propose a Bayesian scheme for estimating the correlation between different entities' measurements based on high-throughput sequencing data. These entities could be different genes or miRNAs whose expression is measured by RNA-seq, different tra...

This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used ...

Prior knowledge in the form of multiple polyhedral sets, each belonging to one of two categories, is introduced into a reformulation of a linear support vector machine classifier. The resulting formulation leads to a linear program that can be solved efficiently. Real world examples, from DNA sequencing and breast cancer prognosis, demonstrate the effectiveness of the proposed method. Numerical...

Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...

In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.

Technological advances in experimental and computational molecular biology have revolutionized the whole fields of biology and medicine. Large-scale sequencing, expression and localization data have provided us with a great opportunity to study biology at the system level. I will introduce some outstanding problems in genome expression and regulation network in which better modern statistical a...

We propose a predictive-reactive approach for the single machine problem. It constructs a set of schedules following a partial order and, every time a decision should be taken, uses the temporal flexibility and the flexibility in job sequencing introduced to provide the decision-maker a set of alternatives, compatible with the modeled constraints.

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ord...

The Turing machine models an old-fashioned computer, that does not interact with the user or other computers, and only batch processing. Therefore, we came up a Reactive Machine have these shortcomings. In Machine, transitions labels to give notion of interactivity. resulting process graph, use bisimilarity instead language equivalence. Subsequently, considered classical theorems notions from a...

This article surveys research on the single surface mount device (SMD) placement machine optimisation problem. We classify the optimisation problem into five sub-problems: feeder setup, component placement sequencing, nozzle optimisation, component retrieval plan and motion control; and analyse issues relevant to each of these. One of the aims of this article is to provide guidance to other res...