We submitted runs from two different systems for the update summary task at TAC 2008. One system used Roget’s Thesaurus to determine semantic relatedness for the purpose of summary construction. The other system employs a variety of heuristics, including an innovative use of the topic headline in the assessment of semantic similarity among sentences. Our submission to the opinion task used only...

Katsuno and Mendelzon suggested eight postulates for characterizing the semantics of update where the principle of minimal change is embedded [Katsuno and Mendelzon, 1991a]. In this paper we propose a new method for knowledge base update based on persistence. We examine the relations between the two di erent update semantics by investigating the satis ability of Katsuno and Mendelzon's update p...

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of n...

conclusions development of novel drugs and diagnostic tests has allowed us to better manage vl. although leishmaniasis is one of the oldest known parasitic infectious diseases, increasing prevalence of vl among specific populations, recent reports of disease reactivation and flare-up in clinically asymptomatic patients after the onset of immunosuppressive therapy, the risk of disease acquisitio...

anti-androgens are an assorted group of drugs and compounds that reduce the levels or activity of androgen hormones within the human body. disease states in which this is relevant include polycystic ovarian syndrome, hirsutism, acne, benign prostatic hyperplasia, and endocrine related cancers such as carcinoma of the prostate. we provide an overview and discussion of the use of anti-androgen me...

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

In the recent literature the issue of program change via updating rules (also known as revision rules) has been reduced to the issue of obtaining a new set of models, by means of the update rules, from each of the models of an initial program. Any program whose models are exactly the new set of models will count as an update of the original program. Following the classical approaches to theory ...

Inthispaperwemodelinfiniteprocesseswithfiniteconfigurationsasinfinitegames overfinitegraphs.W einvestigatethosegames,calledupdategames,inwhicheachconfigurationoccursan infinitenumberoftimesduring atwo-person play.W ealso presentan efficient polynomial-time algorithm (and partialcharacterization)fordeciding ifa graph isan update network.