主方差分析方法

该文提出一种对高维随机向量 X=( x1 ,x2 ,… ,xp)′p× 1 进行降维处理的实用方法 ,其基本思想是利用矩阵的扫描运算 ,构造 X的很少几个综合指标 (称为主方差变量 )以反映 X的统计特性。给出了该方法的理论依据和直观解释以及算法。特别指出 ,当变量 X多重相关性突出时 ,该文方法显著地优于主成分分析方法。     

基于MSE准则抑制SPR射频干扰的方法

针对冲激体制的超宽带表层穿透雷达在时域接收中存在的射频干扰的问题,分析了射频干扰的性质与特征,并在此基础上,以MSE为准则,提出了A Scan的波形平均算法和B Scan方位向的中值滤波算法,并对实测的表层穿透雷达数据进行了处理。结果表明这两种算法都能较好地抑制SPR的RFI,最后对这两种算法的性能进行了比较和评估。     

面向大规模网络的入侵检测与预警系统研究

开展面向大规模网络的入侵检测与预警系统的研究,对于提高我国网络系统的应急响应能力、缓解网络攻击所造成的危害、提高系统的反击能力等具有十分重要的意义。首先对国内外的研究现状进行综述;然后,提出了面向大规模网络的入侵检测与预警系统的体系结构与组成;最后,着重对与本系统研制相关的关键技术与难点进行论述。     

一种优质、低时延的 8kb/s 语音编码算法

介绍一种优质、低时延的8kb／s语音编码算法，重点描述了算法的构造，分析了算法的性能。本算法可用一片33MIPS的通用定点DSP芯片实现。对算法所作的编解码信噪比测试和非正式的听音测试表明，该算法具有优良的编解码语音质量。     

冲激信号SAR反向投影成像方法I、Q 实现

本文在分析冲激信号成像特点的基础上，说明了线阵模型是解释冲激信号ＳＡＲ成像过程的有效方法，给出了冲激信号ＳＡＲ反向投影（ＢＰ）方法，针对系统实现问题，提出了对Ｉ、Ｑ两路信号分别积累，求模的ＢＰＩＱ法，并以计算机仿真及与常规的ＢＰ作比较，最后给出了一些有用的结论。     

Bullwhip and reverse bullwhip effects under the rationing game

When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017     

Performance analysis of the cultural and creative industry: a network‐based approach

The cultural and creative industries (CCIs) in Taiwan have gradually contributed to the national economy under the impetus of government policies. We employ a two‐stage data envelopment analysis model with an additive efficiency decomposition approach to measure the profitability and marketability of 22 Taiwanese cultural and creative companies. Furthermore, we employ the network‐based ranking approach to identify benchmark inputs/outputs, and the strengths and weakness of each company. Our empirical results show that the profitability of the cultural and creative companies is better than their marketability. Companies in the industries of publishing, creative life, popular music, and cultural content averagely perform better than those in the other three types of CCIs in terms of profitability. Companies in the creative life industry are on average more efficient than those in the other five types of CCIs in terms of marketability. The profitability/marketability matrix of cultural and creative companies is also presented.     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

New results on a Ruckle problem in discrete games of ambush

This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001