Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于DAC5686的线性调频信号产生方法研究

研究了基于DAC5686的线性调频信号产生方法。分析了线性调频信号及其产生原理,研究了DAC5686工作原理,设计了信号产生电路,给出了线性调频信号的实现实例．结果表明,该方法可以灵活地产生所需线性调频信号,从而满足某型地空导弹制导雷达中频接收机性能测试的需要．与传统的线性调频信号产生方法相比,该方法降低了系统设计难度,缩短了开发周期,提高了设计的可靠性,具有较高的实用价值,对于其它场合频线性调频信号的产生也具有一定的借鉴意义．     

基于循环移位和异或运算的对合线性变换研究

在对称密码算法的设计中,为达到良好的扩散作用,设计者一般均选择分支数较大的线性变换.基于循环移位和异或运算的线性变换由于其实现效率较高,已经在很多密码算法中被采用,比如分组密码SMS4、HIGHT,Hash函数SHA -2、MD6等.此外,如果线性变换是对合的,还为解密带来了方便.研究了基于循环移位和异或运算设计的对合线性变换,给出了这类线性变换的计数公式,指出它们的分支数上界为4,并讨论了循环移位的参数与分支数之间的关系,从而为基于这类运算设计的线性变换提供了理论依据.     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于垂直线列阵的深海被动目标定深误差

首先研究了在深海环境下,采用三阵元垂直线列阵水声探测系统进行被动目标定深的基本原理。然后分别从随机误差、阵元配置偏差和相干多途水声信道干扰的角度,对被动目标定深的误差源进行了理论分析,并推导了相关公式。通过仿真实验,总结出各误差源对被动目标定深精度影响的规律,为进一步开展被动目标定深研究、提高被动目标定深精度奠定了基础。     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

机动目标一维距离像RAT法线性化补偿

研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题.