一种最短向量已知格的生成方法

提出了最短向量已知格的概念。通过对循环格的分析，得到了循环格是最短向量已知格的两个定理。为了得到随机性更好的最短向量已知格，提出了伪循环格的概念，并且给出了伪循环格是最短向量已知格的充分条件。相关的定理都是构造性的，通过简单的算法就可以快速生成最短向量已知格。格基进行随机化的一般性算法。     

Uniform performance-adaptive renewal policies for linear systems

The model for a linear system with renewal capability presented by Ratner and Luenberger [1] is investigated. An algorithm is given for determining a region over which immediate renewal is the optimal policy. The optimal feedback gains are given for system operation with immediate renewal. A scalar example illustrates the utilization of the algorithm.     

Performability of systems based on renewal process models

A system of N statistically identical machines is modeled using renewal theory through a unique architecture and state space. The model is very useful in evaluating flexible manufacturing systems (FMS) in particular. Each machine consists of multiple part types that are subject to individual failure. A multiple stage repair process composed of integrable sojourn time distributions requires access to spare parts to repair down machines. A performability measure is used to gauge system effectiveness for this partially degradable system, and an example is given     

Quadratic control of stochastic hybrid systems with renewal transitions

We study the quadratic control of a class of stochastic hybrid systems with linear continuous dynamics for which the lengths of time that the system stays in each mode are independent random variables with given probability distribution functions. We derive a condition for finding the optimal feedback policy that minimizes a discounted infinite horizon cost. We show that the optimal cost is the solution to a set of differential equations with unknown boundary conditions. Furthermore, we provide a recursive algorithm for computing the optimal cost and the optimal feedback policy. The applicability of our result is illustrated through a numerical example, motivated by stochastic gene regulation in biology.     

Stability of networked control systems with asynchronous renewal links: An impulsive systems approach

We consider networked control systems in which sensors, actuators, and controller transmit through asynchronous communication links, each introducing independent and identically distributed intervals between transmissions. We model these scenarios through impulsive systems with several reset maps triggered by independent renewal processes, i.e., the intervals between jumps associated with a given reset map are identically distributed and independent of the other jump intervals. For linear dynamic and reset maps, we establish that mean exponential stability is equivalent to the spectral radius of an integral operator being less than one. We also prove that the origin of a non-linear impulsive system is (locally) stable with probability one if its local linearization about the zero equilibrium is mean exponentially stable, which justifies the importance of studying the linear case. The applicability of the results is illustrated through an example using a linearized model of a batch-reactor.     

Transfer function representation of cyclic consensus systems

This paper presents explicit forms of transfer functions for a class of cyclic consensus systems with different kinds of network topologies; directed, undirected and different numbers of reference agents. Each agent of consensus systems is assumed to satisfy a scalar integrator dynamics which is driven by a common consensus protocol and an independent exogenous input. It is shown that every single-input single-output (SISO) transfer function between the exogenous input of one agent and the state of another generally different agent, is always minimum phase. In addition, the poles and zeros, system degrees and relative degrees of those SISO transfer functions are specified. These results are interpreted in relation to the controllability and closed loop performance of a networked system with one leader agent. Furthermore, our transfer function representations are applied to an investigation of stability margins for a closed loop cyclic consensus system.     

Fiber laser-based temperature sensor systems using uniform wavelength-matched Bragg grating reflectors

A detailed investigation has been carried out into the output characteristics of a fiber laser forming, as it does the basis of an optical sensor system, in terms of its wavelength, signal intensity and linewidth, and the output spectrum when each individual fiber Bragg grating, acting as the reflectors of the laser system, has been allowed to respond to temperature in a wavelength-matched normal Bragg grating-based laser configuration. An analytical model has been created reflecting the relationship between the grating bandwidth and the temperature under each operational condition and the results obtained have significant implication for the optimum design of this type of fiber laser-based sensors. Additionally, experiments were performed to investigate the output characteristics of a fiber laser-based sensor when used for temperature measurement.     

Waiting-time approximations for multiple-server polling systems

We consider multiple-server polling systems, in which each of the servers visits the queues according to its own cyclic schedule. Such systems appear to completely defy the derivation of exact waiting-time results, which motivates the search for accurate approximations. In the present paper, we derive waiting-time approximations for asymmetric systems with the exhaustive and gated service discipline. The approximations are tested for a wide range of parameter combinations.     

Modeling and control of high-throughput screening systems

In previous work it has been shown how a max-plus algebraic model can be derived for cyclically operated high-throughput screening systems and how such a model can be used to design a controller to handle unexpected deviations from the predetermined cyclic operation during run-time. In this paper, this approach is extended by modeling the system in a general dioid algebraic setting. Then a feedback controller can be computed using residuation theory. The resulting control strategy is optimal in the sense of the just-in-time criterion, which is very common in scheduling practice.     

Estimates of system failure probability during the renewal time for a group of repairable systems

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 170–173, November–December, 1995.     

航空电子FC不同拓扑和服务类的实时性测试

在不同的消息流分布模式下,对光纤通道（FC）各种拓扑结构和服务类进行了性能测试,给出了各种传输情况下的消息延迟和吞吐量随负载的变化关系。通过分析得出结论：光纤通道的交换网络和服务类3分别较仲裁环和服务类2延迟小,最大吞吐量大;FC网络在均匀负载模式下,累积负载为网络最大吞吐量的50%以下时,消息传输具有确定性延迟上限。     

Stochastic bounds for queueing systems with limited service schedules

Motivated by the study of cyclic service queue processor schedules and token ring local area networks, upper and lower stochastic bounds for a GI/G/1 vacation model with limited service are developed. The limited service vacation model is compared with the Bernoulli schedule vacation model. For the case of Poisson arrivals and infinitely divisible vacation durations simple, closed-form expressions are given for upper and lower bounds of the first two moments of the waiting time. Some upper and lower bounds are also derived for cyclic queues with limited service. The quality of the bounds is illustrated through numerical examples.     

Modeling of thermodynamic properties of ABr-PrBr3 (A=Li-Cs ) systems

The thermodynamic properties of ABr-PrBr₃(A=Li-Cs) systems were assessed by the CALPHAD method. The liquid phase in the systems was described by the non-stoichiometric associate model. The entropies of mixing in the liquid were evaluated from experimental liquidus and enthalpy of mixing data. For the pseudobinary compounds A₃PrBr₆,APr₂Br₇, and A₂PrBr₅ (A=K,Rb) and Cs₃PrBr₆ and CsPr₂Br₇, the dependences of Gibbs energies of formation on temperature were calculated. The anomalies of sequences of thermodynamic properties in RbBr-PrBr₃ were observed and discussed. The nature of the liquid phase and precision of calculations of the Rb₂PrBr₅(s) compound were discussed.     

A survey of smart product-service systems: Key aspects,challenges and future perspectives

The rapid development of information and communication technologies (ICT) has enabled the prevailing digital transformation (i.e. digitalization), where physical products can be readily digitized in the virtual space and seamlessly interconnected. Meanwhile, industries are ever increasingly adopting service business models (i.e. servitization), so as to offer not only physical products but also services as a solution bundle to meet individual customer needs. Such convergence of both digitalization and servitization (i.e. digital servitization) has triggered an emerging IT-driven business paradigm, smart product-service systems (Smart PSS). As a novel paradigm coined in 2014, to the authors’ knowledge, only 2 conference papers have provided some literature review to date, and many issues remain uncovered or not comprehensively investigated. Aiming to fill this gap, this paper has conducted a systematic review of Smart PSS or related papers published ever since its first brought up to date (30/06/2019), and selected 97 representative items together with other 37 supplementary works to summarize the tendency towards Smart PSS, its business and technical aspects, current challenges, and future perspectives. From the survey, it is found that several hybrid concerns are the key challenges faced, and self-adaptiveness with sustainability, advanced IT infrastructure, human-centric perspectives, and circular lifecycle management are the core future perspectives to explore. It is hoped that this work can attract more open discussions and provide useful insights to both academics and industries in their exploration and implementation of Smart PSS.     

Approximate analysis of multiqueue systems with multiple cyclic servers

In this paper we consider an approximate model of a system of multiple queues served cyclically by a number of identical servers, which is an extension of the Kuehn model for the single server multiqueueing system. The arrival process of customers is Poissonian, walking and service times are general, servers work in the repeated mode, and they serve at most one customer per visit at a queue (node) in a cycle. Applications in the performance evaluation of the existent network of processors of the Brazilian switching system TRÓPICO are considered. The approximation is validated by means of computer simulations.     

Revisiting parallel cyclic reduction and parallel prefix-based algorithms for block tridiagonal systems of equations

Direct solvers based on prefix computation and cyclic reduction algorithms exploit the special structure of tridiagonal systems of equations to deliver better parallel performance compared to those designed for more general systems of equations. This performance advantage is even more pronounced for block tridiagonal systems. In this paper, we re-examine the performances of these two algorithms taking the effects of block size into account. Depending on the block size, the parameter space spanned by the number of block rows, size of the blocks and the processor count is shown to favor one or the other of the two algorithms. A critical block size that separates these two regions is shown to emerge and its dependence both on problem dependent parameters and on machine-specific constants is established. Empirical verification of these analytical findings is carried out on up to 2048 cores of a Cray XT4 system.