快速近似计算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.     

基于混合蚁群算法的异质车队低碳VRP研究

针对货运车辆在配送调度过程中产生大量碳排放的问题，建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队，两个节点之间有多条道路的柔性路径，以及车辆重量随卸货而减少的动态负载等因素，以碳排放量、行驶时间和行驶路程为优化目标，并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法，利用蚁群算法信息素强度更新方式保持群体记忆性，利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析，验证了算法和模型的有效性。     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

Airline planning and scheduling: Models and solution methodologies

The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research.     

一维—二维耦合的水库下游地区洪水演进数学模型及应用

针对水库下游地区河道洪水与漫堤洪水模拟需求,建立了一维—二维耦合的洪水演进数学模型。一维模型采用Pressimann格式离散求解,二维模型采用能够适应复杂几何形状和多种流态的Osher格式求解,一维—二维连接处采用堰流公式实现水流交互。应用该模型模拟白溪流域2015年"苏迪罗"台风实际洪水,可得到洪水在计算区域的演进过程和淹没情况。对比模拟结果与实际情况可知,该模型计算合理、准确,计算结果可为防汛部门防洪预案制定、防汛调度决策提供技术支撑。     

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.     

HSDN‐GRA: A hybrid software‐defined networking‐based geographic routing protocol with multi‐agent approach

We propose in this paper a Hybrid Software‐Defined Networking‐based Geographical Routing Protocol (HSDN‐GRA) with a clustering approach. It takes into account three different criteria to select the best relay to send data: (1) the contact duration between vehicles, (2) the available load of each vehicle, (3) and the log of encountered communication errors embedded in each cluster head. The multi‐criteria strategy allows the selection of the most reliable vehicles by avoiding communication problems and ensuring connection availability. Once the hybrid control plane has found out the next eligible neighbor, the data plane will be in charge of dividing and sending data. To validate our approach, HSDN‐GRA has been modeled and implemented in JADE, a multi‐agent platform, to be compared to other multi‐agent based protocols. Simulation results show that HSDN‐GRA achieves good performance with respect to the average routing overhead, the packet drop rate, and the throughput.     

Integrated multi-factory production and distribution scheduling applying vehicle routing approach

This paper introduces a new integrated multi-factory production and distribution scheduling problem in supply chain management. This supply chain consists of a number of factories joined together in a network configuration. The factories produce intermediate or finished products and supply them to other factories or to end customers that are distributed in various geographical zones. The problem consists of finding a production schedule together with a vehicle routing solution simultaneously to minimise the sum of tardiness cost and transportation cost. A mixed-integer programming model is developed to tackle the small-sized problems using CPLEX, optimally. Due to the NP-hardness, to deal with medium- and large-sized instances, this paper develops a novel Improved Imperialist Competitive Algorithm (IICA) employing a local search based on simulated annealing algorithm. Performance of the proposed IICA is compared with the optimal solution and also with four variants of population-based metaheuristics: Imperialist Competitive Algorithm, Genetic Algorithm, Particle Swarm Optimisation (PSO), and Improved PSO. Based on the computational results, it is statistically shown that quality of the IICA’s solutions is the same as optimal ones solving small problems. It also outperforms other algorithms in finding near-optimal solutions dealing with medium and large instances in a reasonably short running time.