Some light-traffic and heavy-traffic results for the <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/<Emphasis Type="Italic">n</Emphasis>/0 queue using the <Emphasis Type="Italic">GM Heuristic</Emphasis>

In this paper we carry out both light-traffic and heavy-traffic analyses for the calculation of steady-state loss probabilities in the general multi-server queuing loss system, the GI/G/n/0 queue. The analysis makes use of a heuristic approach called the GM Heuristic, for which a detailed analysis in normal traffic has previously been published. Sufficient conditions are given for the GM Heuristic to be asymptotically exact in light traffic. The heuristic is also shown to be asymptotically exact in heavy-traffic when the number of servers n tends to infinity. These results are illustrated numerically using two-phase Coxian distributions for both the inter-arrival time and service time.     

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.     

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.     

An Augmented Lagrangian Method for <Emphasis Type="Italic">TV</Emphasis><Subscript><Emphasis Type="Italic">g</Emphasis></Subscript>+<Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-norm Minimization

In this paper, the minimization of a weighted total variation regularization term (denoted TV _g ) with L ¹ norm as the data fidelity term is addressed using the Uzawa block relaxation method. The unconstrained minimization problem is transformed into a saddle-point problem by introducing a suitable auxiliary unknown. Applying a Uzawa block relaxation method to the corresponding augmented Lagrangian functional, we obtain a new numerical algorithm in which the main unknown is computed using Chambolle projection algorithm. The auxiliary unknown is computed explicitly. Numerical experiments show the availability of our algorithm for salt and pepper noise removal or shape retrieval and also its robustness against the choice of the penalty parameter. This last property is useful to attain the convergence in a reduced number of iterations leading to efficient numerical schemes. The specific role of the function g in TV _g is also investigated and we highlight the fact that an appropriate choice leads to a significant improvement of the denoising results. Using this property, we propose a whole algorithm for salt and pepper noise removal (denoted UBR-EDGE) that is able to handle high noise levels at a low computational cost. Shape retrieval and geometric filtering are also investigated by taking into account the geometric properties of the model.     

Three-dimensional analysis of Marangoni flow and radial segregation in Ge<Subscript><Emphasis Type="Italic">x</Emphasis></Subscript>Si<Subscript>1-<Emphasis Type="Italic">x</Emphasis></Subscript> melt with Czochralski configuration

In order to examine the flow field and the radial segregation of silicon (Si) in a Ge _x Si_1-x melt with an idealized Czochralski (Cz) configuration, we conducted a series of unsteady three-dimensional (3-D) numerical simulations under zero-gravity conditions. The effect of convection driven by surface tension on the free surface of the melt was included in the model, by considering thermal, as well as solutal Marangoni convection. The concentration and flow fields at several stages during crystal growth are presented for several temperature differences, driving the Marangoni convection. The simulation results indicate that the flow and concentration fields are axisymmetric for Ma _T < 625 and become oscillatory and 3-D for higher values. It was found that the maximum Si concentration difference at the growth interface decreases as thermal Marangoni number increases due to higher flow velocities in the vicinity of the interface. However, temporal fluctuations of Si concentration at the interface increase at higher thermal Marangoni numbers. The effects of aspect ratio (A _r) were also considered in the model. It was found that the aspect ratio of the melt in the crucible has a prominent influence on the flow pattern in the melt which, in turn, effects the Si concentration at the growth interface.     

A Simple Fractionally Integrated Model with a Time-varying Long Memory Parameter <Emphasis Type="Italic">d</Emphasis><Subscript><Emphasis Type="Italic">t</Emphasis></Subscript>

This paper generalizes the standard long memory modeling by assuming that the long memory parameter d is stochastic and time-varying: we introduce a STAR process on this parameter characterized by a logistic function. We propose an estimation method of this model. Some simulation experiments are conducted. The empirical results suggest that this new model offers an interesting alternative competing framework to describe the persistent dynamics in modeling some financial series.      

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.     

Particle swarm optimization-based fixed-structure <Emphasis Type="Italic">ℋ</Emphasis><Subscript>∞</Subscript> control design

In this paper, a new robust fixed-structure ℋ _∞ controller design based on the Particle Swarm Optimization (PSO) technique is proposed. The optimization-based structured synthesis problem is formulated and solved by a constrained PSO algorithm. In the proposed approach, the ℋ _∞ controller’s structure is selectable. PI and PID controller structures are especially adopted. The case study of an electrical DC drive benchmark is adopted to illustrate the efficiency and viability of the proposed control approach. A comparison to another similar evolutionary algorithm, such as Genetic Algorithm Optimization (GAO), shows the superiority of the PSO-based method to solve the formulated optimization problem. Simulations and experimental results show the advantages of simple structure, lower order and robustness of the proposed controller.     

Robust <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> DOF control for uncertain T-S fuzzy neutral systems

This paper investigates the problem of robust H _∞ dynamic output-feedback (DOF) control for a class of uncertain T-S fuzzy neutral systems with linear fractional parametric uncertainties. The aim is to design a full-order fuzzy DOF controller that ensures asymptotic stability of the closed-loop system and guarantees a prescribed H ^∞ performance level on disturbance attenuation for all admissible uncertainties. Based on the Lyapunov-Krasoviskii functional and the Barbalat lemma, delay-dependent sufficient conditions for the solvability of this problem are presented in terms of LMIs. Finally, a simulation example is provided to demonstrate the effectiveness and applicability of the proposed method.     

Nonblocking <Emphasis Type="Italic">k</Emphasis>-Compare-Single-Swap

The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based on single-location operations such as compare-and-swap (CAS), and general-purpose multilocation transactional memory implementations. While the former are sometimes efficient, they are invariably hard to extend and generalize. The latter are flexible and general, but costly. This paper aims at a middle ground: reasonably efficient multilocation operations that are general enough to reduce the design difficulties of algorithms based on CAS alone. We present an obstruction-free implementation of an atomic k -location-compare single-location-swap (KCSS) operation. KCSS allows for simple nonblocking manipulation of linked data structures by overcoming the key algorithmic difficulty in their design: making sure that while a pointer is being manipulated, neighboring parts of the data structure remain unchanged. Our algorithm is efficient in the common uncontended case: A successful k-location KCSS operation requires only two CAS operations, two stores, and 2k noncached loads when there is no contention. We therefore believe our results lend themselves to efficient and flexible nonblocking manipulation of list-based data structures in today’s architectures. A preliminary version of this paper appeared in the Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 314–323, San Diego, California, USA, 2003.     

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">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.     

3D virtual mosaics: <Emphasis Type="Italic">Opus Palladium</Emphasis> and <Emphasis Type="Italic">mixed</Emphasis> styles

One of the oldest art forms, mosaics are built by careful selection and placement of small pieces called tiles. Although 2D mosaics have attracted attention in computer graphics research, 3D virtual mosaic sculptures are less common. In this work, we present a method to simulate mosaic sculptures using tiles with irregular shapes, a method known by mosaicists as Opus Palladium, or simply “crazy paving,” due to the inherent freedom of mixing the tiles. In order to add expressiveness and emphasize some features, artists distribute the tiles following a high-level design over the shape. We use Voronoi polygons to represent the tiles computed from a distribution of points on the surface of the 3D object. We also address the simulation of mixed mosaics, where both irregular and squared-shape tiles are used on the same object. Previous works on such surface mosaics have used only square-shaped tiles, with fixed or variable size. Special mosaic-like effects are obtained with the help from texture maps, which control the high-level design of the tile distribution.     

Retrial Queueing System <Emphasis Type="Italic">M</Emphasis> / <Emphasis Type="Italic">M</Emphasis> / 1 / 0 with Combined Service Discipline

The paper considers retrial queueing system M /M /1/ 0 with combined service discipline, namely, a customer from the orbit is serviced in its turn, but in case of a free channel an arrival from the original flow is serviced immediately. The author obtains the expressions for state probabilities as well as ergodicity conditions. The system is compared with the Lakatos-type system.     

Robust <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> fuzzy control for discrete-time nonlinear systems

This paper studies the problem of robust H _∞ control for discrete-time nonlinear systems presented as Takagi—Sugeno’s fuzzy models. The generalized non-parallel distributed compensation (non-PDC) law and non-quadratic Lyapunov function is constructed by the proposed homogeneouspolynomially basis-dependent matrix function (HPB-MF for abbreviation). Based on the generalized non-PDC law and non-quadratic Lyapunov function, some linear matrix inequalities (LMIs) are obtained by exploiting the possible combinations of the basis functions. These LMIs ensure the asymptotic stability of the closed-loop system and guarantee a norm bound constraint on disturbance attenuation. In addition, it is shown that the LMIs become less conservative as the degree of HPB-MF increases. The merit of the methods presented in this paper lies in their less conservatism than other methods, as shown by a numerical example borrowed from the literature.