Integer Linear Programming (ILP) based summarization methods have been widely adopted recently because of their state-of-the-art performance. This paper proposes two new modifications in this framework for update summarization. Our key idea is to use discriminative models with a set of features to measure both the salience and the novelty of words and sentences. First, these features are used i...

Previous simulators for shared-memory architectures have imposed a large tradeoff between simulation accuracy and speed. Most such simulators model simple processors that do not exploit common instruction-level parallelism (ILP) features, consequently exhibiting large errors when used to model current systems. A few newer simulators model current ILP processors in detail, but we find them to be...

Nowadays, development of processors which support concurrent multi-thread execution is becoming a trend. Most of these processors are aimed at exploiting instruction level parallelism (ILP). But many researchers feel that the limits of ILP exploitation are rapidly being reached. In addition, exploiting more ILP makes the circuitry of processor very complicated. We are taking another simpler app...

The aim of process discovery is to discover a process model based on business process execution data, recorded in an event log. One of several existing process discovery techniques is the ILP-based process discovery algorithm. The algorithm is able to unravel complex process structures and provides formal guarantees w.r.t. the model discovered, e.g., the algorithm guarantees that a discovered m...

In our previous work we have introduced EDA-ILP, an Inductive Logic Programming (ILP) system based on Estimation Distribution Algorithm (EDA). EDA-ILP showed to be superior when compared to GA-ILP, a variation of EDA-ILP created replacing the EDA by a “conventional” Genetic Algorithm. Additionally, EDA-ILP proved to be very competitive when compared to the state of the art ILP system Aleph. Thi...

In this paper, we present details of the participation of PKUTM in the Guided Summarization and AESOP tracks at TAC 2011. For the Guided Summarization task, we develop two extractive summarization systems based on manifold ranking and Integer Linear Programming (ILP) respectively. In our first system, we score the sentences by linearly combining manifold ranking scores and scores based on other...

The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present an expressive entity-mention model that performs coreference resolution at an entity level. The model adopts the Inductive Logic Programming (ILP) algorithm, which provides a relational way to organize different knowle...

Availability, defined as the fraction of time a network service is operative, is a key network service parameter. Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability. In this article, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a ...

We study the problem of traffic grooming in wavelength-division-multiplexing (WDM) rings with dynamic traffic. We consider both unidirectional and bi-directional rings. In our dynamic traffic model, traffic is represented by a set of different traffic requirements that the network needs to satisfy, but at different times. Our objective is to minimize the required number of electronic add/drop m...