Fast retraining of SDM

The functioning of Kanerva’s Sparse Distributed Memory is examined under conditions of changes in data that are to be written at an address. To improve the efficiency of retraining, a modification of the Kanerva writing procedure is proposed. Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 40–49, July–August, 1999.     

Methods of minimization of the interface problems between application programs of corporate business processes in the year-2000 project

The paper deals with methods of minimizing the number of program bridges between application software systems in corporate business processes of the year-2000 project. Algorithms are proposed for selecting strategies of modification of software systems and their grouped minimum of interface bridges. Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 47–58, September–October, 1999.     

Performance Analysis for Brandt’s Conclusive Entangling Probe

The Fuchs–Peres–Brandt (FPB) probe realizes the most powerful individual attack on Bennett-Brassard 1984 quantum key distribution by means of a single controlled-NOT gate in which Alice’s transmitted qubit becomes the control-qubit input, Bob’s received qubit is the control-qubit output, and Eve supplies the target-qubit input and measures the target-qubit output. The FPB probe uses the minimum-error-probability projective measurement for discriminating between the target-qubit output states that are perfectly correlated with Bob’s sifted bit value when that bit is correctly received. This paper analyzes a recently proposed modification of the FPB attack in which Eve’s projective measurement is replaced by a probability operator-valued measurement chosen to unambiguously discriminate between the same two target-qubit output states. PACS: 03.67.Dd, 03.67.Hk, 03.65.Ta.     

Solving polynomial nonlinear matrix equations by a linearization method

This paper deals with some modification of a matrix linearization method. The scheme proposed makes it possible to find tuples of solutions for systems of polynomial nonlinear equations defined on a commutative matrix ring. The matrix linearization method reduces an initial polynomial nonlinear problem to a linear one with respect to matrices of solutions. Then, the method of elimination of unknowns is used to obtain a generalized eigenvalue problem. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 60–69, May–June 2006.     

Convergence of a modified algorithm of fast probabilistic modeling

The convergence of fast probabilistic modeling algorithms (G-algorithms) is analyzed. A G-algorithm is modified based on a new probabilistic approach, used to reject points in the neighborhood of the current solution. A theoretically justified estimate of the rate of convergence, independent of the initial approximation, is obtained for this modification. A computational experiment is conducted to compare the performance of the modified G-algorithm with that of the classical one. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 173–179, January–February 2008.     

Control tribological and mechanical properties of MEMS surfaces. Part 1: critical review

 The problem of modification of rubbing surfaces in micrometer size microdevices (micro-electro-mechanical systems – MEMS) to control adhesion, friction and wear as well as mechanical properties is discussed. Several solutions are reviewed and examples of investigation results are given. Received: 30 June 1998 / Accepted: 14 December 1998     

An improved data hiding approach for polygon meshes

We present an improved technique for data hiding in polygonal meshes, which is based on the work of Bogomjakov et al. (Comput. Graph. Forum 27(2):637–642, 2008). Like their method, we use an arrangement on primitives relative to a reference ordering to embed a message. But instead of directly interpreting the index of a primitive in the reference ordering as the encoded/decoded bits, our method slightly modifies the mapping so that our modification doubles the chance of encoding an additional bit compared to Bogomjakov et al.’s (Comput. Graph. Forum 27(2):637–642, 2008). We illustrate the inefficiency in the original mapping of Bogomjakov et al. (Comput. Graph. Forum 27(2):637–642, 2008) with an intuitive representation using a binary tree.     

Pressure-driven diffusive gas flows in micro-channels: from the Knudsen to the continuum regimes

Despite the enormous scientific and technological importance of micro-channel gas flows, the understanding of these flows, by classical fluid mechanics, remains incomplete including the prediction of flow rates. In this paper, we revisit the problem of micro-channel compressible gas flows and show that the axial diffusion of mass engendered by the density (pressure) gradient becomes increasingly significant with increased Knudsen number compared to the pressure driven convection. The present theoretical treatment is based on a recently proposed modification (Durst et al. in Proceeding of the international symposium on turbulence, heat and mass transfer, Dubrovnik, 3–18 September, pp 25–29, 2006) of the Navier–Stokes equations that include the diffusion of mass caused by the density and temperature gradients. The theoretical predictions using the modified Navier–Stokes equations are found to be in good agreement with the available experimental data spanning the continuum, transition and free-molecular (Knudsen) flow regimes, without invoking the concept of Maxwellian wall-slip boundary condition. The simple theory also results in excellent agreement with the results of linearized Boltzmann equations and Direct Simulation Monte Carlo (DSMC) method. Finally, the theory explains the Knudsen minimum and suggests the design of future micro-channel flow experiments and their employment to complete the present days understanding of micro-channel flows.     

Proving Arrow’s theorem by <Emphasis Type="SmallCaps">PROLOG</Emphasis>

This paper presented a simple PROLOG implementation for Arrow’s Social welfare function (SWF). Arrow (Social choice and individual values, Yale University Press, 1963) proved that any SWF which satisfies a set of conditions IIA, Pareto, and unrestricted domain should be dictatorial. The PROLOG program can prove the theorem for 3-alternative 2-agent case. With a minor modification it proves a version of the theorem without the Pareto condition by Wilson (Journal of Economic Theory, 5, 478–486, 1972).     

ε-Descending Support Vector Machines for Financial Time Series Forecasting

This paper proposes a modified version of support vector machines (SVMs), called ε-descending support vector machines (ε-DSVMs), to model non-stationary financial time series. The ε-DSVMs are obtained by incorporating the problem domain knowledge – non-stationarity of financial time series into SVMs. Unlike the standard SVMs which use a constant tube in all the training data points, the ε-DSVMs use an adaptive tube to deal with the structure changes in the data. The experiment shows that the ε-DSVMs generalize better than the standard SVMs in forecasting non-stationary financial time series. Another advantage of this modification is that the ε-DSVMs converge to fewer support vectors, resulting in a sparser representation of the solution. This revised version was published online in June 2006 with corrections to the Cover Date.     

Automatic generation of parallel programs for mimd computer systems

Conclusion The use of linear-time automatic algorithms for sequential program parallelization substantially expands the scope of MCS. Parallel implementation is justified from time considerations even when the application program is executed only a few times without modification (only once when the macrooperation system is introduced), i.e., for frequently reprogrammed jobs. Only linear-time parallel-branch algorithms ensure that the execution frequency of the application program that justifies parallel implementation is independent of the number of statements in the program and allow the size (computational complexity) of the macrooperations treated as parallelization units to be varied between wide limits both in the direction of greater aggregation and in the direction of refinement. At the same time, the linear-time parallel-program generation algorithms proposed in this paper produce programs of acceptable quality. Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 170–179, September–October, 1995.     

COID: A cluster–outlier iterative detection approach to multi-dimensional data analysis

Nowadays, most data mining algorithms focus on clustering methods alone. Also, there are a lot of approaches designed for outlier detection. We observe that, in many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat both clusters and outliers as concepts of the same importance in data analysis. In this paper, we present our continuous work on the cluster–outlier iterative detection algorithm (Shi in SubCOID: exploring cluster-outlier iterative detection approach to multi-dimensional data analysis in subspace. Auburn, pp. 132–135, 2008; Shi and Zhang in Towards exploring interactive relationship between clusters and outliers in multi-dimensional data analysis. IEEE Computer Society. Tokyo, pp. 518–519, 2005) to detect the clusters and outliers in another perspective for noisy data sets. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields, such as pattern recognition, data clustering, and signal processing. Experimental results demonstrate the advantages of our approach.     

Programmable reconfiguration of <Emphasis Type="Italic">Physarum</Emphasis> machines

Plasmodium of Physarum polycephalum is a large cell capable of solving graph-theoretic, optimization and computational geometry problems due to its unique foraging behavior. Also the plasmodium is a unique biological substrate that mimics universal storage modification machines, namely the Kolmogorov–Uspensky machine. In the plasmodium implementation of the storage modification machine data are represented by sources of nutrients and memory structure by protoplasmic tubes connecting the sources. In laboratory experiments and simulation we demonstrate how the plasmodium-based storage modification machine can be programmed. We show execution of the following operations with the active zone (where computation occurs): merge two active zones, multiply active zone, translate active zone from one data site to another, direct active zone. Results of the paper bear two-fold value: they provide a basis for programming unconventional devices based on biological substrates and also shed light on behavioral patterns of the plasmodium.     

On the discontinuous Galerkin method for the simulation of compressible flow with wide range of Mach numbers

The paper is concerned with the numerical simulation of compressible flow with wide range of Mach numbers. We present a new technique which combines the discontinuous Galerkin space discretization, a semi-implicit time discretization and a special treatment of boundary conditions in inviscid convective terms. It is applicable to the solution of steady and unsteady compressible flow with high Mach numbers as well as low Mach number flow at incompressible limit without any modification of the Euler or Navier–Stokes equations.     

On implementing symmetry detection

Automatic symmetry detection has received a significant amount of interest, which has resulted in a large number of proposed methods. This paper reports on our experiences while implementing the approach of Puget (CP2005, LNCS, vol. 3709, pp. 475–489. Springer, 2005). In particular, it proposes a modification to the approach to deal with general expressions, discusses the insights gained, and gives the results of an experimental evaluation of the accuracy and efficiency of the approach.     

Properties of the DGS-Auction Algorithm

This paper investigates algorithmic properties and overall performance of the exact auction algorithm in Demange, Gale and Sotomayor (J. Polit. Economy 94: 863–872, 1986) or DGS for short. This task is achieved by interpreting DGS as a graph and by conducting a large number of computer simulations. The crucial step in DGS is when the auctioneer selects a so-called minimal overdemanded set of items because the specific selection may affect a number of performance measures such as the number of iterations and the ratio of elicited preferences. The computational results show that (i) DGS graphs are typically large even for relatively small numbers of bidders and items, (ii) DGS converges slowly and (iii) DGS performs well in terms of preference elicitation. The paper also demonstrates that the modification to DGS based on the Ford–Fulkerson algorithm outperforms all investigated rules for selecting a minimal overdemanded set of items in DGS both in terms of termination speed and preference elicitation.     

Remarks on some mixed finite element schemes for Reissner–Mindlin plate model

Two different stabilization procedures for mixed finite element schemes for Reissner–Mindlin plate problems are introduced. They are based on a suitable modification of the discrete shear energy like that introduced when a partial selective reduced integration technique is used. Some numerical results will be presented in order to show the performance of these schemes with respect to the locking phenomenon. The dependence of the approximate solution on the stabilizing parameter is also analyzed. Received: October 2001 / Accepted: March 2002     

Simulation and experimental characterization of electroosmotic flow in surface modified channels

Covalent surface modification techniques, in particular surface oxidation procedures, have been employed as a mean to modify polymer microfluidic channels for the purpose of modulating microflow. The focus of this work is to experimentally and computationally characterize electroosmotic flow (EOF) to understand the impact of surface modifications and buffer pH on sample mixing and dispersion. The experimental results are used to calibrate and validate the simulation model that solves the Navier–Stokes equation for fluid flow and Poisson equation to resolve external electric field. Experimental and simulated results are presented for hybrid microfluidic systems, consisting of both pristine polymer surfaces and chemically modified polymer surfaces. The results show that the selective surface modification induces hydrodynamic pressure gradient, leading to enhanced sample dispersion. The mass flow rate increases linearly with the level of oxidation. All channels (pristine, oxidized, and hybrid) showed an increasing EOF with increasing pH until the near neutral regime (7<pH<9), where the EOF leveled off at a maximum value—behavior that is typical of a microchannel with negative surface moieties populating its surface.     

A Hopfield neural network approach for power optimization of real-time operating systems

The RTOS (Real-Time Operating System) is a critical component in the SoC (System-on-a-Chip), which is the main body for consuming total system energy. Power optimization based on hardware–software partitioning of a RTOS (RTOS–Power partitioning) can significantly minimize the energy consumption of a SoC. This paper presents a new model for RTOS–Power partitioning, which helps in understanding the essence of the RTOS–Power partitioning techniques. A discrete Hopfield neural network approach for implementing the RTOS–Power partitioning is proposed, where a novel energy function, operating equation and coefficients of the neural network are redefined. Simulations are carried out with comparison to other optimization techniques. Experimental results demonstrate that the proposed method can achieve higher energy savings up to 60% at relatively low costs of less than 4k PLBs while increasing the performance compared to the purely software realized SoC–RTOS.