Adaptive GLR-, Rao- and Wald-based CFAR detectors for a subspace signal embedded in structured Gaussian interference

The problem of detecting a subspace signal embedded in subspace Gaussian interference and thermal noise is studied in this paper. In this problem, both the signal-independent and signal-dependent interferences are assumed to be present, therefore the overall interference subspace covers the signal subspace. The approach of this paper extends previous works involving either of those two kinds of interferences. A set of secondary data containing only interference plus noise is employed to estimate the interference covariance matrix and the noise power. Three new detectors are designed via the generalized likelihood ratio (GLR), Rao and Wald tests, respectively. Their probabilities of false alarms (PFAs) and detections are analytically derived. The PFAs show that the new detectors have the constant false alarm rate (CFAR) property against the interference and noise. Numerical results show that the new detectors outperform their counterparts for the studied problem. Furthermore, the new detectors are less sensitive to the secondary data size and to the mismatched subspace signal than some other detectors, such as the GLR detector (GLRD), the adaptive matched filter (AMF), the adaptive subspace detector (ASD), etc.     

钢管套筒灌浆连接轴向受拉性能模拟试验研究

为研究钢管套筒灌浆连接轴向受拉破坏过程及破坏机理，试验中设计了16组48个钢管套筒灌浆连接试件，试件采用钢板代替圆钢管，并进行静载试验。分析了灌浆料裂缝扩展过程、荷载-相对位移曲线，并对抗剪键高距比、灌浆料厚度、侧向力等因素对破坏过程及承载力的影响进行分析。结果表明：对于不设置抗剪键的套筒灌浆连接试件，斜裂缝随机产生，裂缝分布不均匀；对于设置抗剪键的套筒灌浆连接试件，裂缝首先出现在底部抗剪键位置处，与水平方向夹角约为30°，随后在中部和上部抗剪键位置处分别出现斜裂缝。由于每个抗剪键上荷载分担并不均匀，与抗剪键接触的灌浆料逐渐达到极限压应力，达到极限状态时，承载力全部由抗剪键间的机械咬合力承担，在连接承载力中，可忽略摩擦力和胶结力作用。随着抗剪键高距比h/s增大，各试件初始剪切刚度相差不大，承载力增大，但增幅逐渐减小，建议抗剪键高距比0.06g/s>0.3，同时需要满足灌浆料灌注的施工要求。     

仙游抽水蓄能电站尾水系统充排水试验

为检查工程质量,查找输水系统可能存在的问题并消除隐患,保障电站安全运行,福建仙游抽水蓄能电站在投产发电前,要对输水发电系统进行充水试验与放空排水试验,在试验过程中监测输水系统的应力、应变与渗漏水情况。本文以尾水系统为例,介绍了试验所应具备的工程条件、工作程序及技术要求、试验成果分析和存在问题处理等。试验表明,仙游抽水蓄能电站尾水系统设计合理,施工质量优良,结构可靠,可供同类工程参考与借鉴。     

TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

Model checking temporal knowledge and commitments in multi-agent systems using reduction

Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC⁺). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC⁺ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC⁺ model into an ARCTL model and CTLKC⁺ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC⁺ to another logic of action called GCTL¹, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up.     

Model repair — aligning process models to reality

Process mining techniques relate observed behavior (i.e., event logs) to modeled behavior (e.g., a BPMN model or a Petri net). Process models can be discovered from event logs and conformance checking techniques can be used to detect and diagnose differences between observed and modeled behavior. Existing process mining techniques can only uncover these differences, but the actual repair of the model is left to the user and is not supported. In this paper we investigate the problem of repairing a process model w.r.t. a log such that the resulting model can replay the log (i.e., conforms to it) and is as similar as possible to the original model. To solve the problem, we use an existing conformance checker that aligns the runs of the given process model to the traces in the log. Based on this information, we decompose the log into several sublogs of non-fitting subtraces. For each sublog, either a loop is discovered that can replay the sublog or a subprocess is derived that is then added to the original model at the appropriate location. The approach is implemented in the process mining toolkit ProM and has been validated on logs and models from several Dutch municipalities.     

青年医学工作者科普能力培养新模式

为了培养青年医师运用医学科普语言传播医学知识的能力，向社会提供更优质、可及的健康知识，改善医患关系，促进社会和谐；同时出于向社区、媒体推送一批优秀青年医学科普人才的考虑，本文在总结北京协和医院培养青年医务人员医学科普能力经验的基础上，尝试构建一套适合大型公立医院（尤其是教学医院）培养青年医务人员医学科普能力的新模式——“科普训练营”。本文旨在系统介绍该模式的产生背景、实践经验及初期效果，阐释实施后的重要意义，及实施过程中的挑战与应对策略。     

机载光电雷达它机试飞技术研究

机载光电雷达受平台及大气环境影响较大,而它机试飞能有效规避研制风险,是产品研制的必经阶段。本文介绍了机载光电雷达它机试飞试验系统组成、试验流程和数据处理等内容。经工程验证,实施过程满足任务需求,对其他光电系统的它机及本机试飞具有参考价值。     

The World robot summit disaster robotics category – achievements of the 2018 preliminary competition

The World Robot Summit is a robot Olympics and aims to be held in a different country every four years from 2020. The concept of the Plant Disaster Prevention challenge is daily inspections, checks, and emergency response in industrial plants, and in this competition, robots must carry out these types of missions in a mock-up plant. The concept of the Tunnel Disaster Response and Recovery challenge is emergency response to tunnel disasters, and is a simulation competition whereby teams compete to show their ability to deal with disasters, by collecting information and removing debris. The Standard Disaster Robotics challenge assesses, in the form of a contest, the standard performance levels of a robot that are necessary for disaster prevention and emergency response. The World Robot Summit Preliminary Competition was held at Tokyo Big Sight in October 2018, and 36 teams participated in the Disaster Robotics Category. UGVs and UAVs contended the merits of new technology for solving complex problems, using core technologies such as mobility, sensing, recognition, performing operations, human interface, autonomous intelligence etc., as well as system integration and implementation of strategies for completing missions, gaining high-level results.