Multi-level graph layout on the GPU

This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet Service Provider) networks is presented.     

A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

This paper presents a bicriterion analysis of time/cost trade-offs for the single-machine scheduling problem where both job processing times and release dates are controllable by the allocation of a continuously nonrenewable resource. Using the bicriterion approach, we distinguish between our sequencing criterion, namely the makespan, and the cost criterion, the total resource consumed, in order to construct an efficient time/cost frontier. Although the computational complexity of the problem of constructing this frontier remains an open question, we show that the optimal job sequence is independent of the total resource being used; thereby we were able to reduce the problem to a sequencing one. We suggest an exact dynamic programming algorithm for solving small to medium sizes of the problem, while for large-scale problems we present some heuristic algorithms that turned out to be very efficient. Five different special cases that are solvable by using polynomial time algorithms are also presented.     

Scheduling unit length jobs on parallel machines with lookahead information

This paper studies two closely related online-list scheduling problems of a set of n jobs with unit processing times on a set of m multipurpose machines. It is assumed that there are k different job types, where each job type can be processed on a unique subset of machines. In the classical definition of online-list scheduling, the scheduler has all the information about the next job to be scheduled in the list while there is uncertainty about all the other jobs in the list not yet scheduled. We extend this classical definition to include lookahead abilities, i.e., at each decision point, in addition to the information about the next job in the list, the scheduler has all the information about the next h jobs beyond the current one in the list. We show that for the problem of minimizing the makespan there exists an optimal (1-competitive) algorithm for the online problem when there are two job types. That is, the online algorithm gives the same minimal makespan as the optimal offline algorithm for any instance of the problem. Furthermore, we show that for more than two job types no such online algorithm exists. We also develop several dynamic programming algorithms to solve a stochastic version of the problem, where the probability distribution of the job types is known and the objective is to minimize the expected makespan.     

Two-machine flow-shop scheduling with rejection

We study a scheduling problem with rejection on a set of two machines in a flow-shop scheduling system. We evaluate the quality of a solution by two criteria: the first is the makespan and the second is the total rejection cost. We show that the problem of minimizing the makespan plus total rejection cost is NP-hard and for its solution we provide two different approximation algorithms, a pseudo-polynomial time optimization algorithm and a fully polynomial time approximation scheme (FPTAS). We also study the problem of finding the entire set of Pareto-optimal points (this problem is NP-hard due to the NP-hardness of the same problem variation on a single machine [20]). We show that this problem can be solved in pseudo-polynomial time. Moreover, we show how we can provide an FPTAS that, given that there exists a Pareto optimal schedule with a total rejection cost of at most R and a makespan of at most K, finds a solution with a total rejection cost of at most (1+?)R and a makespan value of at most (1+?)K. This is done by defining a set of auxiliary problems and providing an FPTAS algorithm to each one of them.     

Image-based animation of facial expressions

We present a novel technique for creating realistic facial animations given a small number of real images and a few parameters for the in-between images. This scheme can also be used for reconstructing facial movies where the parameters can be automatically extracted from the images. The in-between images are produced without ever generating a three-dimensional model of the face. Since facial motion due to expressions are not well defined mathematically our approach is based on utilizing image patterns in facial motion. These patterns were revealed by an empirical study which analyzed and compared image motion patterns in facial expressions. The major contribution of this work is showing how parameterized “ideal” motion templates can generate facial movies for different people and different expressions, where the parameters are extracted automatically from the image sequence. To test the quality of the algorithm, image sequences (one of which was taken from a TV news broadcast) were reconstructed, yielding movies hardly distinguishable from the originals. Published online: 2 October 2002 Correspondence to: A. Tal Work has been supported in part by the Israeli Ministry of Industry and Trade, The MOST Consortium     

Multi-scale analysis of intrinsic soil factors from SAR-based mapping of drying rates

Intrinsic soil factors affect and are affected by the spatial variation of soil properties. Therefore, intrinsic soil factors may both characterize and serve as an indicator for soil taxonomy. Difficulties in inferring intrinsic soil properties hamper attempts to assess their variability, on both local and regional/broad scales. Radar remote sensing might facilitate a breakthrough in this field, due to its sensitivity to the soil water content. In this research, a raster Geographic Information System (GIS) methodology is developed for combining multi-temporal ERS-2 SAR and Landsat TM data, which allows the estimation of drying rate patterns in bare soil surfaces. The drying rates provide further indication about intrinsic soil properties. The multi-scale behaviour of soil-drying rates is described using the richness-area curves and characteristic curves are determined to four soil formations typical to a climatic gradient between Mediterranean and semi-arid environments in Israel. To the best of our knowledge, this is one of the first attempts to document the effect of intrinsic soil factors on the soil system at the regional scale. The results achieved here demonstrate the connection between drying rates, richness-area variation and soil hydraulic conductivity of the four soil formations.     

DNA unwinding in the CYC1 and DED1 yeast promoters

The superiority of intensive versus standard chemotherapy for aggressive (I: intermediate; H: high grade) NHL is still debated; increased antitumor activity may be counterbalanced by increased toxicity. We have designed a first-line five-drug regimen (vincristine, idarubicin, cyclophosphamide, etoposide and deflazacort), with the aim of potentiating the CHOP protocol without losing tolerability and ease of administration. Seventy-one patients (33% aged > or = 65) entered the study. CR was obtained in 66.7% of patients (I: 74%; H: 56%), PR in 19.7%: overall response rate was 86.4%. Six patients were resistant, two died during treatment. With a median follow up of two years, relapse has occurred in 14 patients (8 I, 6 H). At 3 years, overall survival was projected to be 62.5% (I 73.5%; H 31.4%), disease free survival 66% (I 71%, H 56.3%). No organ toxicity occurred. Myelosuppression was moderate, with a nadir on the 14th day. Febrile episodes occurred in 16% of courses, dose delay in 19% of courses; dose reduction in 3% of patients. No patient required hospitalization. G-CSF was only occasionally used. This regimen has shown a potent antitumor effect with an excellent tolerance, even in elderly patients.