基于ZigBee网络和超声定位的智能跟随小车

基于成熟的IEEE802.15.4协议和ZigBee无线模块,结合超声定位,设计了一种新颖的智能跟随系统。设计的核心为PIC18F4620单片机和MRF24J40MA无线收发模块,通过无线收发来完成节点间的识别与同步,同时以超声测距系统完成对被跟踪目标的定位,通过控制驱动电机动作实现对指定目标的定距离跟随。控制网络以子网的形式控制不同系统的分时定位跟随,同时管理各移动定位系统的入网和切换。样机测试结果表明系统达到了预期的跟随设计要求,具有一定的工程使用价值。     

Automatic kinetic model generation and selection based on concentration versus time curves

The goal of the paper is to automatize the construction and parameterization of kinetic reaction mechanisms that can describe a set of experimentally measured concentration versus time curves. Using the framework and theorems of formal reaction kinetics, first, we build a set of possible mechanisms with a given number of measured and unmeasured (real or fictitious) species and reaction steps that fulfill some chemically reasonable requirements. Then we fit all the corresponding mass-action kinetic models and offer the best one to the chemist to help explain the underlying chemical phenomenon or to use it for predictions. We demonstrate the use of the method via two simple examples: on an artificial, simulated set of data and on a small real-life data set. The method can also be used to do a kind of lumping to generate a model that can reproduce the simulation results of a detailed mechanism with less species and thereby can largely accelerate spatially inhomogeneous simulations.     

非强占优先权下的M/M/1排队

分析带有两个优先权的非强占M/M/1系统的性能,用补充变量法构造向量马尔可夫过程对此排队系统的状态转移方程进行分析,得到两类顾客在非强占优先权的队长联合分布的母函数,进一步讨论,得出了服务台被两类顾客占有和闲置的概率以及两类信元各自的平均队长.     

行和列和为常量的(0,1)-矩阵的计数

Let fs,t(m,n) be the number of (0,1) - matrices of size m x n such that each row has exactly s ones and each column has exactly t ones (sm = nt). How to determine fs,t(m,n)? As R. P. Stanley has observed (Enumerative CombinatoricsⅠ(1997), Example 1.1.3), the determination of fs,t(m, n) is an unsolved problem, except for very small s, t. In this paper the closed formulas for f2,2(n,n), f3,2(m,n), f4,2(m,n) are given. And recursion formulas and generating functions are discussed.     

Multi-variable special polynomials using an operator ordering method

Using an operator ordering method for some commutative superposition operators, we introduce two new multi-variable special polynomials and their generating functions, and present some new operator identities and integral formulas involving the two special polynomials. Instead of calculating complicated partial differential, we use the special polynomials and their generating functions to concisely address the normalization, photocount distributions and Wigner distributions of several quantum states that can be realized physically, the results of which provide real convenience for further investigating the properties and applications of these states.     

F_2+vF_2上的循环码

本文研究了环F_2+vF_2上的循环码.利用标准形生成元集刻画了环F_2+vF_2上的循环码的代数结构,证明了环F_2+vF_2上的每一个非零的循环码均有唯一的标准形生成元集,进而得到了每一个循环码均是由一个多项式生成的.     

尾年金分布的存在性和结构

本文主要是在年金分布的基础上, 推广、定义并研究了一类$r$尾年金分布的存在性和结构, 给出了这类分布的存在性条件, 证明了在一定条件下, $r$尾年金分布是年金分布与某一特殊$r$尾年金分布的混合.     

The credit risk+ model with general sector correlations

We consider an enhancement of the credit risk⁺ model to incorporate correlations between sectors. We model the sector default rates as linear combinations of a common set of independent variables that represent macro-economic variables or risk factors. We also derive the formula for exact VaR contributions at the obligor level.     

Examples of entropy generating sequence

We introduce the notion of entropy generating sequence for infinite words and define its dimension when it exists. We construct an entropy generating sequence for each symbolic example constructed by Cassaigne such that the dimension of the sequence is the same as its topological entropy dimension. Hence the complexity can be measured via the dimension of an entropy generating sequence. Moreover, we construct a weakly mixing example with subexponential growth rate.     

Waiting time problems for a sequence of discrete random variables

Let X ₁, X ₂,... be a sequence of nonnegative integer valued random variables.For each nonnegative integer i, we are given a positive integer k _i . For every i = 0, 1, 2,..., E _i denotes the event that a run of i of length k _i occurs in the sequence X ₁, X ₂,.... For the sequence X ₁, X ₂,..., the generalized pgf's of the distributions of the waiting times until the r-th occurrence among the events % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% WaaiWabeaacaWGfbWaaSbaaSqaaiaadMgaaeqaaaGccaGL7bGaayzF% aaWaa0baaSqaaiaadMgacqGH9aqpcaaIWaaabaGaeyOhIukaaaaa!43D8!\[\left\{ {E_i } \right\}_{i = 0}^\infty\]are obtained. Though our situations are general, the results are very simple. For the special cases that X's are i.i.d. and {0, 1}-valued, the corresponding results are consistent with previously published results.This research was partially supported by the ISM Cooperative Research Program (90-ISM-CRP-11) of the Institute of Statistical Mathematics.