具有x|x|非线性的蔡氏电路

研究以x｜x｜非线性函数取代折线非线性v_i特性后的蔡氏电路. 重点讨论非线性函数x｜x｜对于产生混沌振荡的作用, 并用Shil’nikov方法给予严格的证明. 用计算机模拟对电路中发生的分岔过程进行了分析, 并对在实验室实现这种非线性函数的实际蔡氏电路设计作了描述.     

基于现场总线的N+ M 容错控制系统研究

以机器人化遥控铲掘机为例,论述了基于现场总线的N M热切换容错控制系统的体系结构、热切换、容错策略等问题。与传统方法相比,该方法具有结构简单、可靠性高、柔性好等特点,是提高系统可靠性的一种全新的切实可行的途径,对工程实际应用具有一定的现实意义。     

Asymptotic Analysis of an Retrial Queueing System M|M|1 with Collisions and Impatient Calls

We consider a single-line RQ-system with collisions with Poisson arrival process; the servicing time and time delay of calls on the orbit have exponential distribution laws. Each call in orbit has the “impatience” property, that is, it can leave the system after a random time. The problem is to find the stationary distribution of the number of calls on the orbit in the system under consideration. We construct Kolmogorov equations for the distribution of state probabilities in the system in steady-state mode. To find the final probabilities, we propose a numerical algorithm and an asymptotic analysis method under the assumption of a long delay and high patience of calls in orbit. We show that the number of calls in orbit is asymptotically normal. Based on this numerical analysis, we determine the range of applicability of our asymptotic results.     

P_4|fix|C_(max)问题的最优规则调度算法

多处理机任务调度问题P4|fix|Cmax(m≥=)是典型的强NP难问题,由于其在并行环境中的实际意义而受到越来越多的关注.但在一般情形下,寻求该问题的较为理想的近似算法是极其困难的,通常从较少处理机数的系统着手研究.对于m=4的情形,文中研究了P4|fix|Cmax的规则调度算法,通过引入组调度技术,给出了该问题的一个线性时间的4/3-近似算法,并证明了该算法是4-处理机系统中的最优规则调度算法.     

Control of M|M|1|N queue parameters under constraints

An optimal control of the MM1N queue is considered on the basis of the minimum criterion for the expected service time if constraints on the average number of rejected demands and average energy expenditure are present. Two variants of an input flow are studied: with the separation of demands according to priorities and without such a separation. A dual optimization method and a Lagrange multiplier rule are used to synthesize a constrained optimal control. Two iteration procedures, the effectiveness of which is analyzed on the basis of the numerical simulation results, are presented in order to solve numerically a dual problem.     

无线传感器网络中基于Top-|K|查询分布式数据重构方法

针对分簇结构或多Sink节点的无线传感器网络应用场景,提出了一种基于Top-|K|查询的分布式数据重构方法.该方法包括分布式迭代硬阈值算法和基于双阈值的分布式Top-|K|查询算法两个部分.其中,管理节点和成员节点同时运行分布式迭代硬阈值算法,以分布式方式实现迭代硬阈值计算.同时,管理节点和成员节点运行基于双阈值的分布式Top-|K|查询算法,以分布式方式实现前一算法中查询绝对值最大的前K项元素和操作.实验结果表明,该方法的数据重构性能与现有方法无明显差异,同时能够有效地减少管理节点和成员节点之间的交互次数,并且降低网络中传输的数据量.     

基于M2M平台的J2ME应用程序的研究与设计

M2M平台综合了电信和信息技术,能够使业务流程自动化,集成公司IT系统的资’产,并创造增值服务。这项平台能够在广泛的应用和解决方案环境中运行,如自动读取停车表、安全设施、自动扶梯控制、车队管理、自动售货机和电动设备等都是其大显身手的应用环境。本文从其概念及应用出发,提出了其与J2ME移动应用相结合的实现策略、实际系统开发设计方案与影响其发展与应用的因素。     

Direct martingale arguments for stability: The M|G|1 case

A direct martingale argument is given for studying stability properties of the simple M|G|1 queueing system. The technique is of independent interest and can be used elsewhere.     

A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking

The stationary probability distribution of a two-phase queueing system with a finite or an infinite buffer for the first phase and a finite buffer for the second phase is derived. The input flow of the system is a batch Markov arrival process. Both phases have single-servers. The service time distribution is arbitrary for the first phase and of phase-type for the second phase. If the buffer of the second phase is full at the instant of completion of service at the first phase, the first server is blocked until the buffer is freed.     

基于Cortex-M3的M2M监控终端

在对物联网在工业监控领域的应用研究后,针对目前工业监控终端体积大、容量小、功能简单等问题,设计并实现了一种微型化、大容量、强实时、多参数的M2M监控终端。该终端设计了基本的监控模块,且针对不同的应用环境预设了可配和选择模块,使适用范围更广。实现了网络动态配置接口,提高了终端的通用性。并借鉴传统数据采集模式,设计一种数据采集和数据传输优化方案,并对优化算法进行探讨,经应用结果分析,对系统开销、数据传输等指标有显著的改进。     

实时集群系统设计与性能分析

设计和构建了一个高可用性冗余实时集群系统,讨论了系统并行计算的实现和冗余机组调度策略,建立了系统的M/M/N排队论模型,并依据此模型对系统进行了性能分析。经测试证明,系统具有较高的可用性和实时性,可作为周期性高强度多源浮点信息处理平台,用于军事指挥控制等实时性要求较高的领域。     

A counterexample on continuous coprime factors

In Georgiou and Smith (1992), the following question was raised: Consider a linear, shift-invariant system on L₂[0, ∞). Let the graph of the system have Fourier transform (MN)H² (i.e., the system has a transfer function P=N/M) where M, N are elements of C_A={f∈H^∞: f is continuous on the compactified right-half plane}. Is it possible to normalize M and N (i.e., to ensure |M|²+|N|²=1) in C_A? The author shows by example that this is not always possible     

A branch, bound, and remember algorithm for the 1|r i |∑t i scheduling problem

This paper presents a modified Branch and Bound (B&B) algorithm called, the Branch, Bound, and Remember (BB&R) algorithm, which uses the Distributed Best First Search (DBFS) exploration strategy for solving the 1|r _i |∑t _i scheduling problem, a single machine scheduling problem where the objective is to find a schedule with the minimum total tardiness. Memory-based dominance strategies are incorporated into the BB&R algorithm. In addition, a modified memory-based dynamic programming algorithm is also introduced to efficiently compute lower bounds for the 1|r _i |∑t _i scheduling problem. Computational results are reported, which shows that the BB&R algorithm with the DBFS exploration strategy outperforms the best known algorithms reported in the literature.     

基于请求包粒度的M:N型TCP switching协议

为了给一种新型Web Cluster系统提出一个优化的实现方案,该文描述了该集群系统的数据流处理过程,分析出其处理实质,即M条TCP连接与N条TCP连接之间动态的交叉衔接问题。为此该文提出了一种基于请求包粒度的M：N型TCP switching协议。详细描述了该协议的设计原理和实现过程。实验证明运行该协议的集群系统具有良好的可扩展性和服务性能。     

Optimal priorities in GI|Gn|1 queue

A polynomial-time algorithm based on reduction to a polyhedron minimization problem is proposed for minimizing a given function F(W₁,...,W_n) that depends on the mean waiting times in the Gl|G_n|l queue.Translated from Kibernetika, No. 2, pp. 80–85, March–April, 1991.     

Stochastic mixture of absolute and relative priorities in GI|HM2|1 queue

The generating function of the number of customers in a GI|HM₂|1 queue is derived for a service discipline which is a stochastic mixture of absolute and relative priorities.Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 75–84, July–August, 1991.     

Asymptotic Diffusion Analysis of $$MMPP|M|N$$ Queuing Systems with Feedback

Automation and Remote Control - We present the results of the study of an $$ N $$ -linear queuing system with feedback. The input flow is a Markov modulated Poisson process (MMPP). We use...     

An approximate transient analysis of the M(t)/M/1 queue

An approach, based on recent work by Stern [56], is described for obtaining the approximate transient behavior of both the M/M/1 and M(t)/M/1 queues, where the notation M(t) indicates an exponential arrival process with time-varying parameter λ(t). The basic technique employs an M/M/1K approximation to the M/M/1 queue to obtain a spectral representation of the time-dependent behavior for which the eigen values and eigenvectors are real.Following a general survey of transient analysis which has already been accomplished, Stern's M/M/1/K approximation technique is examined to determine how best to select a value for K which will yield both accurate and computationally efficient results. It is then shown how the approximation technique can be extended to analyze the M(t)/M/1 queue where we assume that the M(t) arrival process can be approximated by a discretely time-varying Poisson process.An approximate expression for the departure process of the M/M/1 queue is also proposed which implies that, for an M(t)/M/1 queue whose arrival process is discretely time-varying, the departure process can be approximated as discretely time-varying too (albeit with a different time-varying parameter).In all cases, the techniques and approximations are examined by comparison with exact analytic results, simulation or alternative discrete-time approaches.     

An adaptive reaching law of chattering-free discrete-time sliding mode control for systems with external disturbance

An adaptive reaching law of chattering-free discrete-time sliding mode control is proposed for the systems with external disturbance. An adaptive function is proposed in the reaching law which can increase reaching speed as sliding variable is far away from zero and avoid undesired chattering when sliding variable is close to origin. Moreover, a third-order backward difference of disturbance is added to obtain a narrower quasi-sliding mode band (QSMB). Both the closed-loop system performance and finite reaching steps to achieve the desired QSMB are theoretically analyzed. The simulation results verify the effectiveness of the proposed control strategy.     

基于相对熵的一种属性约简算法

知识约简是粗糙集理论研究的主要内容之一。在信息系统中引入了知识的相对熵的概念,证明了在知识相对约简过程中相对熵的变化趋势是递减的;利用相对熵的概念,定义了属性的相对重要性,提出了一种基于相对熵的新的属性约简启发式算法,该算法的时间复杂度为O(｜C｜3｜U｜2),通过例子分析,表明该算法是有效的。