Die eemautische Syntax der Kommunikativen Grammatik auf EDV-ARla~en ZtueVeret~uduis der folgenden Darstelluugeu sei die Uater-scheiduug einer auBersprachlich orientierten Sema, tik yon eiaer innersprachlichen Semantik vorausgeschicktp ohne da~ der allge~eiue Problemkreis der Semaut~k er~rtert wird. AuBereprachlieh orieutierte Semautik $ubstituiert man in dem Satz: "Der J~ger fUttert den Hund" f...

This paper provides a necessary and sufficient condition for the existence of nonautarkic contract in a risk sharing model with two-sided lack of commitment. Verifying the condition takes just one Guassian elimination of a matrix.

This article is a supplement to our 2006 ICIP paper, “Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation” [1], which we assume the reader has read. We summarize the proof of the dead-end elimination theorem (due to Desmet et al. [2] and Goldstein [3]), briefly discuss the performance of our current implementation of DEE pairs, show the input images for which timings are referenc...

Traditionally, invariant assertions are used to verify the partial correctness of while loops with respect to pre/post specifications. In this paper we discuss a related but distinct concept, namely invariant relations, and show how invariant relations are a more potent tool in the analysis of while loops: whereas invariant assertions can only be used to prove partial correctness, invariant rel...

Top-down and bottom-up theorem proving approaches have each specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control and suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-d...

A modified spatially adaptive denoising algorithm for a single image corrupted by Gaussian noise is proposed in this paper. The proposed algorithm use local statistics of a selected window i.e. by defining local weighted mean, local weighted activity and local maximum. These local statistics are used to detect the noise in the image then a modified Gaussian filter is used for noise suppression....

Arc-consistency algorithms are widely used to simplify Constraint Satisfaction Problems. The new notion of a double-support check is presented to improve the average performance of arc-consistency algorithms. The improvement is that, where possible, consistencychecks are used to find supports for two values, one value in the domain of each variable, which were previously known to be unsupported...

Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on transition systems (see [18] for an excellent treatment). We are interested in an extension of boolean equation systems with data. This allows to formulate and prove a substantially wider range of properties on much larger and even infinite state systems. In previous works [11, 15] it has been outlined ho...

Background and Aims: Measles remains one of the leading causes of childhood morbidity and mortality in developing countries and is still a major public health concern in developed countries. Although live attenuated vaccine is used throughout the world, out breaks of disease still occur in many countries including Iran. Methods: The present study was performed to evaluate the immune status aga...

Preprocessing of CNF formulas is an invaluable technique when attempting to solve large formulas, such as those that model industrial verification problems. Unfortunately, the best combination of preprocessing techniques, which involve variable elimination combined with subsumption, is incompatible with incremental satisfiability. The reason is that soundness is lost if a variable is eliminated...