Spatial–Temporal Fusion Based Path Planning for Source Seeking in Wireless Sensor Network

International Journal of Wireless Information Networks - Source seeking problem has been faced in many fields, especially in search and rescue applications. We proposed a virtual structure-based...     

快速近似计算Shapley值的归因解释方法

Shapley值归因解释方法虽然能更准确量化解释结果, 但过高的计算复杂度严重影响了该方法的实用性. 本文引入KD树重新整理待解释模型的预测数据, 通过在KD树上插入虚节点, 使之满足TreeSHAP算法的使用条件, 在此基础上提出了KDSHAP方法. 该方法解除了TreeSHAP算法仅能解释树结构模型的限制, 将该算法计算Shapley值的高效性放宽到对所有的黑盒模型的解释中, 同时保证了计算准确度. 通过实验对比分析, KDSHAP方法的可靠性, 以及在解释高维输入模型时的适用性.     

Dynamic voltage scaling based energy-minimized partial task offloading in fog networks

Wireless Networks - With the dynamic voltage scaling (DVS) technology, the terminal node (TN) can dynamically adjust its computational speed, thus providing a new way to save energy during task...     

Graph-Theoretic Method on Topology Identification of Stochastic Multi-weighted Complex Networks with Time-Varying Delayed Coupling Based on Adaptive Synchronization

Neural Processing Letters - This paper is concerned with topology identification of stochastic multi-weighted complex networks based on adaptive synchronization. Different from previous work,...     

Rapid anti-solvent vapor-assisted synthesis of CsPbBr3/Cs4PbBr6 microcrystals with high brightness and stability of green light emission

Journal of Materials Science - The CsPbBr3/Cs4PbBr6 perovskite composite material has received wide attention due to its good stability and photoelectric properties, and it is promising to appear...     

GM-CSF及CBS在肝损伤中的研究进展

肝损伤(liver injury)是指基因遗传或外部原因诱发的肝脏功能异常性疾病.临床表现为食欲不振、乏力、恶心、黄疸、疲乏等,严重者将出现肝功能衰竭,致死风险极高.在交通肇事、暴力犯罪及意外事件中,肝由于体积大、位置固定、质地脆弱、血运丰富等原因,往往是最容易发生损伤的器官之一,肝损伤后的死亡率可高达10.5％～25％[1].随着时间的变化,肝损伤的程度、病理改变、GM-CSF等相关细胞因子及CBS等相关酶的表达水平也会进一步变化.肝损伤后,由于肝内部环境稳态的破坏,器官的状态、结构、各种蛋白的转录水平、蛋白及细胞因子的表达变化水平也会发生一定程度的改变.因此定性定量地分析这些变化,找到时间相关性强的特异性指标,对于指导法医学的实践具有重要的作用.因此在法医学鉴定中,通过肝脏损伤及病变程度的改变,明确肝损伤病变与死亡时间的关系有利于判断事件或案件性质,并有助于进一步对责任方的认定.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

仿真虚拟实训中心建设在药学高等职业教育中的应用

在当前信息技术快速发展的社会,虚拟仿真实训开始在高等职业教育教学中广泛应用,使用虚拟仿真实训技术能够有效的解决当前高等职业教育实践教学中存在的一些突出问题,能对传统的教育教学模式进行有效的补充。本文以仿真虚拟实训中心建设为切入点,就其建设及其在高等职业教育药学专业中的应用进行分析,以期使虚拟仿真实训中心在提高实践教学效果方面发挥重要作用。