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

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

Development of Phospholipids Vesicular Nanocarrier for Topical Delivery of Tea Tree Oil in Management of Atopic Dermatitis Using BALB/c Mice Model

This work aims to develop and evaluate the efficacy of tea tree oil (TTO) ethosomal cream with improved deposition in skin layers for treatment of atopic dermatitis (AD). Ethosomes of TTO are developed using phosphatidylcholine (2% and 3% w/v) and ethanol (20%, 30%, and 40% w/v). Ethosomes are evaluated for percent entrapment efficiency (%EE), vesicle size, zeta potential, and in vitro drug diffusion. Ethosomal creams with optimized ethosomal dispersion are developed and evaluated for physicochemical parameters, thermal stability, ex vivo permeation, skin retention, and in vitro cytotoxicity using HaCat skin cell lines in comparison to conventional creams of TTO. In vivo investigations of optimized creams are performed using BALB/c mice model. The %EE, vesicle size, and zeta potential for optimized ethosomes are found to be 76.19 ± 3.26%, 333.6 nm, and –35.3 mV, respectively. Ethosomal creams showed higher deposition in the epidermis and dermis. The optimized creams are non-cytotoxic to HaCat cell lines. The creams significantly reduce the inflammatory response by decreasing the clinical score and infiltration of white blood cells, eosinophils, and IgE antibodies. Overall efficacy of ethosomal cream is higher than conventional cream. In conclusion, optimized ethosomal cream of TTO shows good efficacy for treatment of AD. Practical applications : The method used for the formulation of ethosomes is simple and can be easily scaled up on the industrial level. The loading of TTO within ethosomes can increase the efficiency by enhanced drug deposition in the epidermis and might also improve its stability against oxidative degradation. Topical ethosomal cream of TTO can improve patient compliance by avoidance of adverse effects linked with corticosteroids and could be a possible complementary or alternative therapy in management of AD.     

Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

基于边缘和局部熵融合的视觉安全性评估方法

针对基于局部熵进行加密图像视觉安全性评估存在块效应的局限性，引入图像的边缘特征，通过共有边缘来衡量加密图像与原始图像的边缘相似度，消除了块效应。由于局部熵对加密等级低的图像不敏感，边缘相似度对加密等级高的图像不敏感，将两个评估方法进行自适应融合，提出[SLEES]（Local Entropy and Edge Similarity，[SLEES]）指标。通过改变图像像素位置和图像像素值的加密方式处理图像和视频帧进行测试，实验结果表明，[SLEES]指标相比传统评估指标有更好的鲁棒性，评估范围更广。     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

“电网一张图”时空信息管理系统

文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。     

Learning Association Rules and Tracking the Changing Concepts on Webpages: An Effective Pornographic Websites Filtering Approach

We applied the decision tree algorithm to learn association rules between webpage’s category (pornographic or normal) and the critical features. Based on these rules, we proposed an efficient method of filtering pornographic webpages with the following major advantages: 1) a weighted window-based technique was proposed to estimate for the condition of concept drift for the keywords found recently in pornographic webpages; 2) checking only contexts of webpages without scanning pictures; 3) an incremental learning mechanism was designed to incrementally update the pornographic keyword database.     

Test sample allocation method for testability verification test

An extended failure mode effect and criticality analysis (FMECA)-based sample allocation method for testability verification is presented in this study to deal with the poor representativeness of test sample sets and the randomness of the testability evaluation results caused by unreasonable selection of failure samples. First, the fault propagation intensity is introduced as part of the extended information of FMECA, and the sample allocation impact factors of component units and failure modes are determined under this framework. Then, the failure mode similarity and impact factor support are defined, and the game decision method for weighing the relationship between similarity and support is proposed to obtain the weight of failure mode impact factor. Finally, a two-step allocation framework of test samples is formulated to realize the sample allocation of component units and failure modes. This method is applied to the testability verification test of a launch control system. Results show that this method can obtain more representative test samples compared with the traditional sample allocation method while effectively reducing randomness of single testability evaluation result.     

Hybrid self-inertia weight adaptive particle swarm optimisation with local search using C4.5 decision tree classifier for feature selection problems

ABSTRACT

Feature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets.