Physical Sciences and Mathematics Commons^™

A Maximal Chain Approach For Scheduling Tasks In A Multiprocessor Systems, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we …

Bcl2 Translocation Defines A Unique Tumor Subset Within The Germinal Center B-Cell-Like Diffuse Large B-Cell Lymphoma, Javeed Iqbal, Warren G. Sanger, Andreas Rosenwald, Diane L. Pickering, Barbara Dave, Sandeep Dave, Li Xiao, Kahai Cao, Qiuming Zhu, Simon Sherman, Christine P. Hans, Dennis D. Weisenburger, Timothy C. Greiner, Randy D. Gascoyne, German Ott, H. Konrad Müller-Hermelink, Jan Delabie, Rita M. Braziel, Elaine S. Jaffe, Elias Campo, James C. Lynch, Joseph M. Conners, Julie M. Vose, James O. Armitage, Thomas M. Grogan, Louis M. Staudt, Wing C. Chan

Computer Science Faculty Publications

Gene expression profiling of diffuse large B-cell lymphoma (DLBCL) has revealed prognostically important subgroups: germinal center B-cell-like (GCB) DLBCL, activated B cell-like (ABC) DLBCL, and primary mediastinal large B-cell lymphoma. The t(14;18)(q32;q21) has been reported previously to define a unique subset within the GCB-DLBCL. We evaluated for the translocation in 141 cases of DLBCL that were successfully gene expression profiled. Using a dual-probe fluorescence in situ hybridization assay, we detected the t(14;18) in 17% of DLBCLs and in 34% of the GCB subgroup which contained the vast majority of positive cases. In addition, 12 t(14;18)-positive cases detected by polymerase chain …

Algorithmic Fusion Of Gene Expression Profiling For Diffuse Large B-Cell Lymphoma Outcome Prediction, Qiuming Zhu, Hongmei Cui, Kahai Cao, Wing C. Chan

Computer Science Faculty Publications

Many different methods and techniques have been investigated for the processing and analysis of microarray gene expression profiling datasets. It is noted that the accuracy and reliability of the results are often dependent on the measurement approaches applied, and no single measurement so far is guaranteed to generate a satisfactory result. In this paper, an algorithmic fusion approach is presented for extracting genes that are predictive to clinical outcomes (survival-fatal) of diffuse large B-cell lymphoma on a set of microarray data for gene expression profiling. The approach integrates a set of measurements from different aspects in terms of the discrepancy …

Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SAT-based decision procedure for …

When Are Behaviour Networks Well-Behaved?, Bernhard Nebel, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. This problem is addressed by a number of action-selection mechanisms. Behaviour networks as proposed by Maes are one such mechanism, which is quite popular. In general, it seems not possible to predict when behaviour networks are well-behaved. However, they perform quite well in the robotic soccer context. In this paper, we analyse the reason for this success by identifying conditions that make behaviour networks goal converging, i.e., force them to reach the goals …

Automatic Compilation Of Protocol Insecurity Problems Into Logic Programming, Alessandro Armondo, Luca Compagna, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the construction of model-checkers for security protocols based on state-of-the-art solvers for logic programs. We have assessed the effectiveness of the approach by running the proposed reduction against a selection of insecurity problems drawn from the Clark & Jacob library of security protocols: by running state-of-the-art solvers against the resulting logic programming problems most of the (known) attacks on the considered protocols are found in a few seconds.

Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [6, 5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called “loop formulas”. Nevertheless, their solver ASSAT¹ has some disadvantages: it can work …

A Sat-Based Polynomial Space Algorithm For Answer Set Programming, Enrico Giunchiglia, Marco Maratea, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems.

In this paper we present a SAT-Based decision procedure for …