Estimation of a Local Lipschitz Constant of the <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>-Entropy

A method for estimating a Lipschitz constant of the entropy operator of the Boltzmann type is suggested. Examples of the use of the obtained estimates in problems for restoring images by projections are given.__________Translated from Avtomatika i Telemekhanika, No. 7, 2005, pp. 54–65.Original Russian Text Copyright © 2005 by Popkov, Rublev.This work was supported by the Program “Branch of Information Technologies and Computer Systems” and the Russian Foundation for Basic Research, project no. 02-01-00198a.     

Extensions of fuzzy hyperideals in <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-semigroups

The object of the present paper is the investigation and study of (fuzzy) hyperideals in H _v - semigroups. Regular equivalence relations play in H _v - semigroup theory a role analogous to congruences in semigroup theory, so we introduce fuzzy regular equivalence relations on H _v -semigroups and then we study fuzzy Rees regular relations on H _v -semigroups. Using this ideas, we establish a relation between fuzzy hyperideal of an H _v -semigroup H and fuzzy hyperideal of a quotient H _v -semigroup of H. Some characterizations of them are then shown.      

The Stationary Characteristics of the <Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">MSP</Emphasis>/1/<Emphasis Type="Italic">r</Emphasis> Queueing System

A single-server queueing system with recurrent input flow and Markov service process is considered. Both the cases of finite and infinite buffers are investigated. The analysis of this system is based on the method of embedded Markov chain. The main stationary characteristics of system performance are derived.     

<Emphasis Type="Italic">Wissensmanagement</Emphasis>

In dieser Arbeit wird anhand von zwei konkreten Beispielen erl?utert, was Wissensmanagement (WM) ist und warum WM eine so wichtige Rolle in der Zukunft spielen wird. Dies gilt freilich nur, wenn es sich bei WM um mehr handelt als die Verwendung von Informationssystemen oder verteilten Datenbanken für anspruchsvolle Aufgaben.     

Interrelation of the Cyclic and Weight Structure of Codes over <Emphasis Type="Italic">GF</Emphasis>(<Emphasis Type="Italic">q</Emphasis>) and Proportionality Classes

To determine the weight structure of cyclic codes, we establish an interrelation of the cyclic structure of a code and classes of proportional elements.__________Translated from Problemy Peredachi Informatsii, No. 2, 2005, pp. 68–71.Original Russian Text Copyright © 2005 by Mullayeva.     

Electrical properties and crystallization behavior of Sb<Subscript><Emphasis Type="Italic">x</Emphasis></Subscript>Se<Subscript>100−<Emphasis Type="Italic">x</Emphasis></Subscript> thin films

The structural transformation and transformation kinetics of Sb _x Se_100−x films (60 ≤ x ≤ 70) were studied to investigate the feasibility of applying Sb _x Se_100−x alloys in phase-change nonvolatile memories. The temperature-dependent van der Pauw measurements, Hall measurements, X-ray diffraction and a static tester were used to investigate the electrical properties and crystallization behavior of the Sb _x Se_100−x films. The sheet resistance difference between amorphous and crystalline state was higher than 10⁴ Ω per square According to Hall measurement, Sb _x Se_100−x films have p-type conduction and the Hall mobility and carrier concentration increases with the increase in Sb content. The crystalline structure of the metastable phase of Sb _x Se_100−x alloys, which plays a major roll in fast crystallization, is similar to that of Sb₂Te (rhombohedral structure). The transition temperature, sheet resistance and activation energy for transformation decrease as the amount of Sb increases in the Sb _x Se_100−x film. Applying the Kissinger method, the activation energies for crystallization were in the range from 1.90 ± 0.15 to 4.16 ± 0.28 eV. The desired crystallization speed can be obtained by a systematic change of the composition owing to the variation of the activation barrier with stoichiometry.     

Parallel <Emphasis Type="Italic">LL</Emphasis> parsing

A deterministic parallel LL parsing algorithm is presented. The algorithm is based on a transformation from a parsing problem to parallel reduction. First, a nondeterministic version of a parallel LL parser is introduced. Then, it is transformed into the deterministic version—the LLP parser. The deterministic LLP(q,k) parser uses two kinds of information to select the next operation — a lookahead string of length up to k symbols and a lookback string of length up to q symbols. Deterministic parsing is available for LLP grammars, a subclass of LL grammars. Since the presented deterministic and nondeterministic parallel parsers are both based on parallel reduction, they are suitable for most parallel architectures.     

<Emphasis Type="Italic">Post-PC-Ära</Emphasis>

Ohne Zusammenfassung     

From word to sentence: a pregroup analysis of the object pronoun <Emphasis Type="Italic">who</Emphasis>(<Emphasis Type="Italic">m</Emphasis>)

We explore a computational algebraic approach to grammar via pregroups, that is, partially ordered monoids in which each element has both a left and a right adjoint. Grammatical judgements are formed with the help of calculations on types. These are elements of the free pregroup generated by a partially ordered set of basic types, which are assigned to words, here of English. We concentrate on the object pronoun who(m).     

<Emphasis Type="Italic">O</Emphasis>(log*<Emphasis Type="Italic">n</Emphasis>) algorithms on a Sum-CRCW PRAM

We present work- and cost-optimal O(log*n) algorithms for prefix sums and linear integer sorting on a Sum-CRCW PRAM.     

<Emphasis Type="Italic">Ontologie(n)</Emphasis>

Ontologie ist ein überlieferter Begriff aus der Philosophie und steht dort für die Lehre vom Sein – genauer: von den M?glichkeiten und Bedingungen des Seienden –, ist also eng verwandt mit der Erkenntnistheorie, die sich mit den M?glichkeiten und Grenzen menschlichen Wahrnehmens und Erkennens auseinander setzt. Vorschl?ge an Prof. Dr. Frank <puppe@informatik.uni-wuerzburg.de> oder Dieter Steinbauer <dieter.steinbauer@schufa.de> Alle „Aktuellen Schlagw?rter” seit 1988 finden Sie unter www.ai-wuerzburg.de/as     

Torsion classes of <Emphasis Type="Italic">MV</Emphasis>-algebras

 Torsion classes of MV-algebras are defined as radical classes which are closed with respect to homomorphisms; in this paper we investigate their relations to radical classes of lattice ordered groups and to varieties of MV-algebras. Supported by Grant VEGA 1/9056/02.     

Multidimensional reverse <Emphasis Type="Italic">k</Emphasis>NN search

Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least one of the following deficiencies: they (i) do not support arbitrary values of k, (ii) cannot deal efficiently with database updates, (iii) are applicable only to 2D data but not to higher dimensionality, and (iv) retrieve only approximate results. Motivated by these shortcomings, we develop algorithms for exact RkNN processing with arbitrary values of k on dynamic, multidimensional datasets. Our methods utilize a conventional data-partitioning index on the dataset and do not require any pre-computation. As a second step, we extend the proposed techniques to continuous RkNN search, which returns the RkNN results for every point on a line segment. We evaluate the effectiveness of our algorithms with extensive experiments using both real and synthetic datasets.     

Design of Digital State <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript>-Controllers of the MIMO Systems with Prescribed Precision

For the linear MIMO plants subject to polyharmonic perturbations, a method of designing digital state controllers was developed with regard for the requirements on limitedness of the control actions in the stable state as well as on limitedness of the controlled variables. A notion of radius of the stable state of a closed-loop system was introduced, and the problem of using the full state vector to design a discrete controller providing the desired radius was formulated. Its necessary and sufficient solvability conditions were obtained using the procedure of H _∞-optimization by selecting the weight matrices of the discrete Lur’e-Riccati equation.__________Translated from Avtomatika i Telemekhanika, No. 8, 2005, pp. 46–51.Original Russian Text Copyright © 2005 by Chestnov.     

Image Compression and Reconstruction Using pi<Subscript><Emphasis Type="Italic">t</Emphasis></Subscript>-Sigma Neural Networks

A high-order feedforward neural architecture, called pi _t -sigma (π _t σ) neural network, is proposed for lossy digital image compression and reconstruction problems. The π _t σ network architecture is composed of an input layer, a single hidden layer, and an output layer. The hidden layer is composed of classical additive neurons, whereas the output layer is composed of translated multiplicative neurons (π _t -neurons). A two-stage learning algorithm is proposed to adjust the parameters of the π _t σ network: first, a genetic algorithm (GA) is used to avoid premature convergence to poor local minima; in the second stage, a conjugate gradient method is used to fine-tune the solution found by GA. Experiments using the Standard Image Database and infrared satellite images show that the proposed π _t σ network performs better than classical multilayer perceptron, improving the reconstruction precision (measured by the mean squared error) in about 56%, on average.     

Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an <Emphasis Type="Italic">O</Emphasis>(<Emphasis Type="Italic">n</Emphasis><Superscript>2</Superscript>\sqrt{τ}/{\log <Emphasis Type="Italic">n</Emphasis>}) Algorithm

Much research has been devoted to system-level diagnosis—SLD. Two issues have been addressed. The first of these is diagnosability, i.e., provide necessary and sufficient conditions for a system of n units to be diagnosable provided that the number of faulty units does not exceed τ . The second is the design of fault identification algorithms, assuming that the system being considered is diagnosable. This paper focuses on the second of these concerns, discussing several algorithms of which the most efficient runs in O(n ^2.5 ) . By considering a logical framework, this paper investigates the process of fault identification and proposes a fault identification algorithm which runs in O( n ² \sqrt τ / \sqrt log n ) , τ < n/2 . Received January 10, 2000; revised August 3, 2000.