用于厚屏蔽小探测器的蒙特卡罗模拟减方差方法研究

反应堆屏蔽计算中经常出现厚屏蔽、小探测器问题，常规蒙特卡罗方法难以有效解决。基于自动重要抽样（AIS）方法，本文提出了小探测器自动重要抽样(SDAIS)方法，并针对小探测器问题，优化了AIS方法的虚粒子赌分裂算法。该方法在自主开发的蒙特卡罗屏蔽程序MCShield上进行了实现。使用NUREG/CR-6115 PWR基准题验证该方法的正确性和计算效率。结果表明，SDAIS方法可有效地解决厚屏蔽小探测器问题，相比AIS方法及传统的重要性方法，计算效率提升1~2个量级。     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

基于查询的新闻多文档自动摘要技术研究

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。     

A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

Distributed learning consensus control based on neural networks for heterogeneous nonlinear multiagent systems

This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes.     

积极降压对脑小血管病防治策略的影响

2017年,美国心脏病学会和美国心脏协会提出将高血压诊断标准降为130/80 mm Hg (1 mm Hg=0. 133 kPa),这与其他指南有所不同。降压治疗的核心目标在于靶器官的保护,近年来降压治疗与脑小血管病预防的相关问题日益受到临床重视。目前研究结果表明,降压治疗对腔隙性卒中患者的二级预防以及白质病变进展的预防可能有一定积极意义,但确切的降压目标值并未确定。血压与临床结局可能呈现J型关系,血压过低或过高可能均有害,而取得最大获益的降压目标有待进一步探索。     

陶瓷及陶瓷基复合材料微缺陷的超声检测

为研究陶瓷及陶瓷基复合材料微缺陷的超声检测能力，针对一些人工缺陷试样进行了超声检测试验。试验主要采用了纵波垂直入射法和泄漏瑞利波法。通过试验结果，比较了两种方法的检测能力。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

小井距开发现河油田低渗油藏可行性研究

认为注采井网井距大,水驱控制程度差,采收率偏低是影响胜利油田现河低渗透油藏开发的关键,通过井间密度与水驱控制程度和采收率的关系等分析,提出了现河低渗透油藏开发的合理的井网密度。