When the Model Elimination (ME) procedure was rst proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970's implementation explicitly examined this lemma mechanism, with indiierent results. We repor...

As a potential explanation to measured inconsistencies between stated privacy concerns and actual disclosing behavior, denoted as the „privacy paradox“, scholars have proposed a systematic distinction between situational privacy considerations and pre-existing, superordinate factors that shape the decisive situation without being directly connected to the situation itself. Deploying an experime...

În această lucrare se prezintă o metodă eficientă de implementare a eliminării Gaussiene pentru o matrice de dimensiuni n·m (m≥n), folosind o arhitectură SIMD ce constă dintr-o matrice de n·m procesoare. Algoritmul descris constă în 2·n-1=O(n) iteraţii, oferind astfel o creştere de viteză optimă faţă de versiunea serială. O particularitate a algoritmului este că nu necesită realizarea operaţiei...

2 Discrete vector fields. 4 2.1 W-contractions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Algebraic discrete vector fields. . . . . . . . . . . . . . . . . . . . . 6 2.3 V-paths and admissible vector fields. . . . . . . . . . . . . . . . . . 7 2.4 Reductions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4.1 Definition. . . . . . . . . . . . . . . . . ...

Article history: Received 17 August 2009 Received in revised form 13 February 2010 Accepted 24 March 2010 Available online 27 March 2010

It is shown that the encoding/decoding problem for any asynchronous -user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2 1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of findi...

In this paper symbolic-computation methods are used to design simple, fixed-structure, robust controllers for nonlinear systems. Design specifications are reduced to logically quantified polynomial inequalities. The quantifier-elimination (QE) software package QEPCAD is used to eliminate quantifiers on state and plant parameters, to obtain regions of admissible controller parameters, and to gua...

We consider the problem of optimal decentralized controller synthesis. There are several classes of such problems for which effective solution methods are known, including the quadratically invariant one. In this paper, we use Gröbner bases and elimination theory to characterize all closed-loop maps achievable by forming a feedback loop with decentralized controllers. We show that this approach...