Many scientiic disciplines (e.g., biology, astrophysics, particle physics, earth sciences) are shifting from in vitro to in silico research as more physical processes and natural phenomena are simulated in a computer (in silico) instead of being observed (in vitro). In many of these virtual laboratories, the computations involved are very complex and long lived. Currently, users are required to...

This paper examines the applicability of fine-grained “pure” tree SIMD machines, which are amenable to highly efficient VLSI implementation, to image correlation which is a representative of low-level image windowbased operations. A particular massively parallel machine called NONVON is used for purposes of explication and performance evaluation. Several algorithms are presented for image shift...

Inadequate uptake of testing for human immunodeficiency virus (HIV) remains a primary bottleneck toward universal access to treatment and care, and is an obstacle to realizing the potential of new interventions for preventing HIV infection, including treatment for prevention and preexposure prophylaxis. HIV self-testing offers an approach to scaling up testing that could be high impact, low cos...

In the last decade, various approximation approaches, such as dispatching rules, shifting bottleneck heuristic and local search methods, are proposed for the job shop scheduling problem. As one of the local search methods, taboo search provides a promising alternative for the job shop scheduling problem; however, it has to be tailored each time with respect to parameters for every instance in o...

The bottleneck (BN) of a production system is a machine with the strongest effect on the system’s throughput. In this paper, a method for BN identification in serial lines with rework and Bernoulli machines is developed. In addition, the paper provides two system-theoretic results: First, it demonstrates that BNs may be shifting not only because of changes in machine and buffer parameters but a...

A learning stage of scheduling tends to produce knowledge about a benchmark of priority dispatching rules which allows a scheduler to improve the solution quality for a set of similar job-shop problems. Once trained on the sample job-shop problems (usually with small sizes), the adaptive algorithm solves a similar job-shop problem (with a moderate size or a large size) better than heuristics us...

Experiments in systems neuroscience can be seen as consisting of three steps: (1) selecting the signals we are interested in, (2) probing the system with carefully chosen stimuli, and (3) getting data out of the brain. Here I discuss how emerging techniques in molecular biology are starting to improve these three steps. To estimate its future impact on experimental neuroscience, I will stress t...

In this paper we improve large-scale disk-based model checking by shifting complex numerical operations to the graphic card, enjoying that during the last decade graphics processing units (GPUs) have become very powerful. For disk-based graph search, the delayed elimination of duplicates is the performance bottleneck as it amounts to sorting large state vector sets. We perform parallel processi...

The single machine total weighted tardiness problem (SMTWTP) is a well-known planning problem from operations research, engineering and computer science. It is characterized by the assignment of starting times for a given set of jobs on a single processor, minimizing the (weighted) tardy completion of the jobs with respect to given due dates. In this sense, the tardiness is given an economical ...

Modern life sciences are becoming increasingly data intensive, posing a significant challenge for most researchers and shifting the bottleneck of scientific discovery from data generation to data analysis. As a result, progress in genome research is increasingly impeded by bioinformatic hurdles. A new generation of powerful and easy-to-use genome analysis tools has been developed to address thi...