The IDIBELL Cancer Conference (ICC) on Metastasis and Angiogenesis was held in Barcelona, Spain, on May 26-27, 2011. The program content was developed by Dr. Manel Esteller, director of the Cancer Epigenetics and Biology Program (PEBC-IDIBELL), Dr. Oriol Casanovas and Dr. Francesc Viñals Canals of the Catalan Institute of Oncology (ICO-IDIBELL), and Dr. Danny R. Welch from the University of Kan...

In this paper, we propose an integrated approach for register-sensitive software pipelining. In this approach, the heuristics proposed in the stage scheduling method of Eichenberger and Davidson [4] are integrated with the iterative scheduling method to obtain schedules with high initiation rate and low register requirements. The performance of our integrated software pipelining method was anal...

facing the issues with structural complexity about which stakeholders have different views, has increasingly led to the use of soft systems methodology (ssm) in solving managerial problems. moreover, the flaws of this methodology in the stages of modeling and feasible, desirable changes, have provided the motivation for applying cognitive map (cm) and system dynamics in the ssm modeling. presen...

The scaling push-relabel method is an important theoretical development in the area of minimum-cost ow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the establish...

Broadcast encryption (BE) deals with secure transmission of a message to a group of receivers such that only an authorized subset of receivers can decrypt the message. The transmission cost of a BE system can be reduced considerably if a limited number of free riders can be tolerated in the system. In this paper, we study the problem of how to optimally place a given number of free riders in a ...

We present a bootstrapping method that uses strong syntactic heuristics to learn semantic lexicons. The three sources of information are appositives, compound nouns, and ISA clauses. We apply heuristics to these syntactic structures, embed them in a bootstrapping architecture, and combine them with co-training. Results on WSJ articles and a pharmaceutical corpus show that this method obtains hi...

Recently, a number of papers have shown that for many domains, using multiple heuristics in independent searches performs better than combining them into a single heuristic. Furthermore, using a large number of “weak” heuristics could potentially eliminate the need for the careful design of a few. The standard approach to distribute computation in these multi-heuristic searches is to rotate thr...

Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their eeectiveness. Since multi-processor scheduling is an NP-hard problem, no exact tractible algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been found for only a few simple DAGs. This...

We analyze several heuristics for graph planarization, i.e., deleting the minimum number of edges from a nonplanar graph to make it planar. The problem is NP-hard, although some heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively, with a selective edge addition method, an incr...