RelaX (Reliable distributed applications support on UNIX) is a portable and extensible system software layer on top of UNIX-like operating system kernels supporting reliable distributed applications by a generalized transaction mechanism. The distributed transaction mechanism relieves each programmer of dealing explicitly with error recovery and concurrency control in every distributed applicat...

We apply results from linear programming to show that the relaxation of model checking over integers to reals is accurate i e yields a full test of temporal properties for a large class of concurrent systems We de ne abstractions similar to widening and narrowing that accelerate least and greatest xpoint computations in model checking over integers or reals We show that these abstractions are a...

We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We show that conjunctive query containment and validity are 2EXPTIMEcomplete w.r.t. a schema (DTD or Relax NG). Furthermore, we show that satisfiability for conjunctive queries w.r.t. a schema can be decided in NP. The problem is NP-hard already for queries using only one...

Currently, XML is a widely used language. In the context of computer science teaching, it is necessary to introduce students to this language and, especially, at its eco-system. We have developed a model to support the teaching of XML. We propose to represent an XML schema as a graph highlighting the structural characteristics of the valid documents. We present in this paper visual elements and...

Semideenite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relax-ations extend previous eigenvalue based models, and combine semidee-nite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semideenite relax-ations approximate the equipartition problem quite well.

1. Introduction I___-This paper describes ISIS-II*, a constraint-directed reasoning system for the scheduling of factory job-shops. ISIS-II takes a heuristic search approach to generating schedules. The key features of ISIS-II's approach is that it can represent and use a variety of different types of constraints to guide the search, and is able to selectively relax conflicting constraints.

Latar Belakang: Aktivitas kerja pemetik teh banyak melibatkan posisi berdiri yang memerlukan kontraksi pada otot tungkai bawah untuk mempertahankan tubuh. tersebut dilakukan hampir setiap hari sehingga dapat memicu timbulnya keluhan musculoskeletal berupa kondisi nyeri spasme gastrocnemius berdampak produktivitas teh. Tujuan: Mengetahui pengaruh kombinasi contract relax dan hold terhadap penuru...