The challenge of combining these candidates to design an ideal medicine against malaria (Table 5) is formidable. There are still many unknown factors, not the least of which is that only a limited number of new classes of molecules have reached clinical evaluation. It is clear that a single molecule can have more than one attribute: a molecule can for example meet the criteria of more than one ...

Given two points p and q and a finite number of simple polygons in a plane. The basic version of a touring-a-sequence-of-polygons problem (in brief: a touring polygons problem, TPP) is how to find a shortest path such that it starts at p, then it visits these polygons in the given order, and finally it ends at q. This paper describes approximate algorithms for different versions of touring poly...

Experimental data collected from different plate-type electrostatic precipitators used in a thermoelectric power plant has been analyzed. The following parameters were considered: the collection efficiency, average migration velocity of dust particles, velocity distribution of the gas in the input and output channels of precipitators. The average migration velocity of dust particles can be esti...

A corrugated magnetic reflector is realized by adding a bias field to a static magnetic mirror. This permits real-time manipulation of a cold-atom cloud on time scales down to 100 ms. We show that rotation of the bias field generates a traveling corrugation of adjustable depth and velocity. Momentum is transferred from the traveling wave to the atoms, resulting in a displacement of the cloud th...

The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeover-costs or setup times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are inserted into the model such as due-dates, the resulting problem is known as the Time Dependent Trav...

Abstract This paper presents wavelet based analysis for transmission line fault location. Faults in power transmission lines cause transients that travel at a speed close to the speed of light and propagate along the line as traveling waves (TWs). Traveling wave theory is utilized in capturing the travel time of the transients along the monitored lines between the fault point and the protective...

The Traveling Salesman Problem provides an opportunity to explore whether attempts to optimize an algorithm in fact succeed or fail. Attempted optimizations themselves have time penalties in their execution and those time penalties may be greater than the improvements provided to the algorithm. When approaching the Traveling Salesman Problem not as a graph traversal problem but as a backtrackin...

In this report, we aim to understand the key ideas and major techniques used in the assigned paper "Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems" by Sanjeev Arora. We also provide a review of related literature with an emphasis on the concurrent work by Joseph S. B. Mitchell. One presentation topic is selected from Arora’s paper and the oth...

The Traveling Purchaser Problem (TPP) looks for a tour visiting a subset of markets to satisfy a positive discrete demand for some products at minimum traveling and purchasing costs. The problem is known to be NP-hard in the strong sense, and finds application in different real contexts. Frequently, as a static problem, the TPP lacks of realism: different purchasers may compete for the same res...

Real-time rendering of a complete 3D scene with hatching strokes is an important direction in NPR field. In this paper, a comprehensive solution is presented to render complicate scenes with pen-and-ink style in real time. With the help of powerful programmable graphics hardware, our real-time system includes many features as hatching, continuous tones, silhouettes, and shadows. We build our ap...