Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...

Boolean satisfiability (SAT) as a canonical NP-complete decision problem is one of the most important problems in computer science. In practice, real-world SAT sentences are drawn from a distribution that may result in efficient algorithms for their solution. Such SAT instances are likely to have shared characteristics and substructures. This work approaches the exploration of a family of SAT s...

The interactions of seven isolates of peanut stunt cucumovirus (PSV) originating from North America, Europe and Africa, and two variants of PSV satellite RNA (sat RNA) were analysed. Electrophoretic and immunoblot analyses of the coat protein (CP) and Northern blot hybridization analyses of the viral RNAs showed that isolates PSV F352, 1339 and 1507 belonged to subgroup I, and isolates PSV W, S...

Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general SAT problem. In this paper, we consider one important variation, the Partial MAX-SAT problem. Unlike SAT, Partial MAX-SAT has certain constraints (clauses) tha...

SAT solvers technology is now mature enough to be part of the engineer toolbox side by side with Mixed Integer Programming and Constraint Programming tools. As of June 2008, two great pieces of software are using SAT technology to manage dependency like problems: the open source Linux distribution OpenSuse 11.0, released on June 19, 2008, integrates a custom SAT solver in their dependency manag...

PURPOSE To develop and demonstrate a method to involve professional users of assistive technology (AT) in the development process of customisable products. Employing the ideas of user participation and mass customisation, this research addresses the need for reduced product costs and optimised product flexibility. METHOD An adaptable six-question Delphi study was developed to establish consen...

Executive Summary: This study evaluated the relationship between academic outcomes and SAT scores. A descriptive analysis indicated that students with higher SAT scores tend on average to have better academic outcomes (retention, graduation, and cumulative GPA), although this relationship was weaker at the higher end of the SAT score spectrum (i.e. students with very high SAT scores do not nece...

The Social Attribution Task-Multiple Choice (SAT-MC) uses a 64-second video of geometric shapes set in motion to portray themes of social relatedness and intentions. Considered a test of "Theory of Mind," the SAT-MC assesses implicit social attribution formation while reducing verbal and basic cognitive demands required of other common measures. We present a comparability analysis of the SAT-MC...

Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this paper we first define a new resolution rule, called signed Max-SAT parallel resolution, and prove that it is sound and complete for signed Max-SAT. Second, we define a restriction and a generalization of the previous r...

Introduction: The present study aimed to suggest an unsupervised method for the segmentation of visceral adipose tissue (VAT) and subcutaneous adipose tissue (SAT) in axial magnetic resonance (MR) images of the abdomen. Materials and Methods: A self-organizing map (SOM) neural network was designed to segment the adipose tissue from other tissues in the MR images. The segmentation of SAT and VA...