A new interpretation of the historical records of observing Venus in daytime with naked eye: Focusing on the meteorological factors in the astronomical observation records

Observing Venus during the daytime is challenging. However, observational data of Venus during the daytime can be found in history books from East Asian countries such as Korea, China and Japan. In this study, we are focused on data from Korean history book, and using records left in the Joseon wangjo sillok, one of the Korean history books from the Joseon dynasty (CE 1392–1910), tries to prove whether the reported observations were actual observation data. We collected these 4663 records from the Joseon wangjo sillok to determine whether they were actual observations, and to confirm the scientific validity of the records. When we looked at the distribution of observations on a yearly basis, we noticed that there were more observations in the fall and winter, while there were only limited numbers of observations in the spring. This difference in distribution suggests that observations were strongly affected by atmospheric conditions due to the weather. From the 4663 data collected, we found a cycle of about 1.6?years. The cycle of about 1.6?years is assumed to be related to the conjunction cycle of Venus. And, we found a cycle of about 1.0?years. The cycle of about 1.0?years is assumed to reflect the indirect effects of the Asian dust phenomenon. Our research result verified the record as actual observational data. In addition, this result verified that meteorological factors were involved in the recorded astronomical observation data. We think that our data can be helpful to climate studies on the natural sources of key climate-affecting aerosols.     

应用聚类分析对关联规则进行分组

关联规则是要从大量的数据中找到数据之间的规律，但有时所产生的规律十分繁多，从而形成新的知识管理问题。针对该问题本文提出了一个新的算法，该算法利用系统聚类分析方法对规则进行分组，从而可更好地帮助用户解所发现的规律，该方法的距离（RatioD）是基于关联规则本身，因此，可对规则进行高效地分组。实验结果表明，该算法是有效的。     

太阳微波爆发频谱事件

国家天文台1.0-2.0GHz,2.6-3.8GHz太阳射电频谱仪从1994年1月和1996年9月投入观测至2000年4月10日记录到太阳射电爆发分别为297个和316个，取得了高质量的高时间分辨率，高频率分辨率的动态谱资料，为研究耀斑各种尺度的时间及空间演化过程提供了丰富的信息，1998年4月15日的共同事件在时间和频率上显示了丰富的幅度和结构的变化。     

Online scheduling of distributed Earth observation satellite system under rigid communication constraints

This paper focused on online scheduling of distributed Earth observation satellite system in a dynamic environment. The objective was to maximize the total profit of the overall system by efficiently coordinating the different satellites with stochastic arrival of urgent tasks, subject to rigid communication and observation time window constraints. We formulated this problem as a single-task, single-robot, time-extended assignment problem with intra-schedule dependency using the multi-robot task assignment taxonomy and formulated the sub-problem after releasing urgent tasks in a mixed-integer linear programming model. We first described the online scheduling algorithm for a single satellite, then we proposed the modified consensus-based bundle algorithm (m-CBBA) and modified asynchronous consensus-based bundle algorithm (m-ACBBA) with synchronous and asynchronous communication, respectively. Compared with initial versions of CBBA and ACBBA, the modified versions added the communication loop prediction phases to efficiently utilize scarce communication opportunities and reduce the communication requirements. Additionally, we introduce two contract net protocol (CNP)-based algorithms for comparison, respectively SingleItem-CNP-based (SI-CNP) algorithm and Batch-CNP-based (BA-CNP) algorithm. Computational experiments indicated that both the total profit and percentage of scheduled urgent tasks achieved by the m-ACBBA and m-CBBA algorithms were much higher than those achieved by both SI-CNP and BA-CNP. Additionally, the number of communications needed by either m-ACBBA or m-CBBA algorithm was lower than that by SI-CNP. When the communication cost in the system is high, the m-CBBA algorithm is preferred because it balances the profit and the required number of communications. When the communication cost is low, the m-ACBBA algorithm is preferred because it achieves high total profit and high percentage of scheduled urgent tasks.     

评估云层对观测设备威胁等级的光电测量系统

采用大视场光学设计及非制冷红外焦平面阵列探测器采集天空背景,对图像进行伪彩处理、图像修复等操作,获得天空伪彩云层图像,并根据标定的空间角位置与像素间的函数关系,计算出云的分布位置信息;通过分析云层的浓厚程度、面积信息,判断其对观测设备的威胁程度。实验表明,该测量系统能以0.5 Hz的频率输出高度角15°以上天区的云图,云层的方位角定位精度为1.5°,仰角精度是0.9°,并可实时评估云层对观测设备的威胁程度。此系统可实现云层分布的测量定位,提高光电观测设备的使用效率。     

修正的概率数据互联算法

阐明了概率数据互联(PDA)算法能很好地解决密集环境下的目标跟踪问题,在该算法基础上,人们又提出了联合概率数据互联(JPDA)算法和一些基于 PDA 的修正算法。在概率数据互联算法中,有一个很重要的参数就是杂波数密度(或波门内虚假量测期望数)。然而在许多实际情况中,这个参数是很难获取的。针对这一问题,文中提出了一种修正的概率数据互联算法,该算法通过实时地调整这一参数来获得对目标较为准确的估计结果。最后,给出了算法的仿真分析。     

基于视觉注意机制的认知雷达数据关联算法

针对传统关联波门设计方法在应用于机动目标跟踪时容易引起失跟、以及概率数据关联算法不适于多交叉目标跟踪的问题,提出了一种基于人类视觉选择性注意机制和知觉客体的"特征整合"理论的认知雷达数据关联算法。算法以综合交互式多模型概率数据关联算法为基础,采取假设目标最大机动水平已知的"当前"统计模型和匀速运动模型作为模型集,通过实时交互使关联波门能够随目标机动动态调整,较好地兼顾了雷达计算耗时和跟踪成功率。在利用目标位置特征的基础上,进一步提取、整合目标运动特征,对关联波门交叉区域公共量测进行分类,使多交叉目标跟踪问题转化为多个单目标跟踪问题,优化了传统概率数据关联算法。仿真结果表明：与传统关联波门设计方法相比,算法跟踪失败率和计算耗时明显降低;而且在计算资源增加不大的情况下,杂波环境适应性也得到了显著增强。     

Introduction to the Payloads and the Initial Observation Results of Chang＇E-1

Chang'E-1,the orbiter circling the moon 200km above the moon surface,is the first Chinese Lunar exploration satellite.The satellite was successfully launched on 24th October 2007.There are 8 kinds of scientific payloads onboard,including the stereo camera,the laser altimeter,the Sagnac-based interferometer image spectrometer,the Gamma ray spectrometer,the X-ray spectrom-eter,the microwave radiometer,the high energy particle detector,the solar wind plasma detector and a supporting payload data management system.Chang'E-1 opened her eyes to look at the moon and took the first batch of lunar pictures after her stereo camera was switched on in 20th November 2007.Henceforth all the instruments are successfully switched on one by one.After a period of parameter adjustment and initial check out,all scientific instruments are now in their normal operating phase.In this paper,the payloads and the initial observation results are introduced.     

基于PTE的多雷达航迹融合算法

针对杂波背景下的多雷达航迹融合时局部估计误差互协方差矩阵未知的问题,提出基于目标存在概率（PTE）的航迹融合算法,提升了正确航迹率和跟踪精度。首先,通过综合概率数据关联得到单接收站的目标航迹估计集合和对应的目标存在概率。然后,在局部估计误差互协方差矩阵未知的条件下,基于PTE信息提出不带记忆的综合广义凸组合航迹融合算法。进而将前一帧的融合状态进行反馈,提出带记忆的综合广义凸组合航迹融合算法。仿真验证了所提算法的有效性。     

一种改进的隐私保护关联规则挖掘算法

部分隐藏的随机化回答方法是基于关联规则数据挖掘的隐私保护算法,针对该算法在重构频繁项集支持度上的指数级时间复杂度导致算法执行效率下降的不足,采用分治策略和集合运算方法对该算法进行改进,消除重构数据的指数级运算。改进算法降低了算法的时间复杂度并有效提高了执行效率。仿真实验与分析表明了改进算法的有效性。