坦克稳定器和电气故障诊断系统

现役59式坦克稳定器和电气系统,由于研制时测试性设计不周,在使用中一旦发生故障,如何迅速排除,在部队一直是个老大难问题.使用本故障诊断系统,能够指导维修人员快速找到发生故障的部件或外部电路;可以在显示器上用颜色作相应变化的电路图,一步步演示出故障压缩过程,直至最后找出故障部位.本文将介绍该系统的功能、技术方案、技术关键及使用特点.     

一种鲁棒的场地球类视频中的球门探测方法

在场地球类视频中,球门常常会伴随着精彩片段而出现。因此,球门探测是体育视频的基础,同时也是视频高层语义概念探测的研究热点。目前,利用机器学习方法进行视频中的对象探测是非常有前途的研究领域。基于此,提出一种基于模糊决策树的球门探测算法,用来探测场地球类视频中球门帧的出现,为了提高分类准确性,在模糊决策树训练的过程中加入了平衡处理。实验结果表明,与基于阈值和决策树的算法相比,该算法可以得到更好的分类结果(F-measure>95%),并且我们可以从所建立的树中推导出模糊规则来解释分类模型。     

On fair designs of cross-chain exchange for cryptocurrencies via Monte Carlo simulation

Cryptocurrency is one of the earliest and the most successful applications of blockchain, and it utilizes the distributed ledger, which is a commonly used technique in blockchain, to make a decentralized transaction within the blockchain of a cryptocurrency. However, how to make a decentralized transaction of cryptocurrencies between parties on different blockchains, that is, the cross-chain exchange, is not well-studied. In this paper, we develop a new method to make cross-chain exchanges based on the classical atomic swap. We first study the optionality embedded into the atomic swap and propose to add a premium into the atomic swap, and then design a new procedure with the premium to guarantee the fairness of the cross-chain exchange. We also provide an algorithm based on the least-squares Monte Carlo method to estimate the premium and analyze the convergence of the algorithm. Moreover, we study the cross-chain exchange with margin trading. We propose an adapted exchange procedure to make a fair cross-chain exchange and an algorithm to estimate the fair premium under the margin trading. Numerical experiments are provided to show the effectiveness of the algorithms.     

基于Bayes小子样二项分布单元可靠性评定的仿真方法

对于小子样二项分布单元可靠度下限评定,经典方法有很大局限性,文中介绍了Bayes方法。并在其基础上提出基于Bayes方法的Monte Carlo仿真方法,示例证明,该方法有很好的应用前途。     

舰船拖带安全评估的故障树方法

提出了一种从故障树分析的角度进行舰船拖带安全评估的方法。采用专家评估和模糊集理论相结合的原理得到故障树中基本事件发生的模糊概率,然后进行故障树定性和定量分析。该方法能合理和有效地预测作业系统的安全性及其薄弱环节。以断缆事件分析为例,对该安全评估方法做了概要阐述。     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

互联网中文搜索引擎存在的问题与发展趋势探析

搜索引擎是互联网信息检索技术的核心,中文搜索引擎与国外相比存在着搜索引擎覆盖率低、查准率不高、检索精度差、更新速度慢、无法控制网络信息的动态变化、对信息内容难于控制和管理等问题。对此,提出了中文搜索引擎从单一查询工具向综合化、全功能服务发展;分类主题一体化,检索语言向自然语言发展;查询智能化,向多国化和多语种化发展;搜索引擎集成化、网络资源著录标准化及利用智能代理技术的信息检索等对策。     

基于树分解/合并策略的QoS多播路由方法

针对多约束QoS多播路由的NP-Complete特性,提出一种可控的多播树分解与合并策略,使多播树的生成在兼顾低费用的同时具有多样性,有效克服多播路由优化的局部极值问题。基于该策略设计蚁群算法,分解蚂蚁种群为与多播目标点相对应的蚂蚁子群,引入基于“死点”惩罚和多播树奖惩的信息素更新机制,提高了算法的收敛速度。仿真实验表明,该方法能有效地解决QoS多播路由问题,且随着网络规模的增大保持了良好的性能。