An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Engineering egress data considering pedestrians with reduced mobility

To quantify the evacuation process, evacuation practitioners use engineering egress data describing the occupant movement characteristics. These data are typically based to young and fit populations. However, the movement abilities of occupants who might be involved in evacuations are becoming more variable—with the building populations of today typically including increasing numbers of individuals: with impairments or who are otherwise elderly or generally less mobile. Thus, there will be an increasing proportion of building occupants with reduced ability to egress. For safe evacuation, there is therefore a need to provide valid engineering egress data considering pedestrians with disabilities. Gwynne and Boyce recently compiled a series of data sets related to the evacuation process to support practitioner activities in the chapter Engineering Data in the SFPE Handbook of Fire Protection Engineering. This paper supplements these data sets by providing information on and presenting data obtained from additional research related to the premovement and horizontal movement of participants with physical‐, cognitive‐, or age‐related disabilities. The aim is to provide an overview of currently available data sets related to, and key factors affecting the egress performance of, mixed ability populations which could be used to guide fire safety engineering decisions in the context of building design.     

无失效数据机载多余度EWIS可靠性研究

针对高可靠度机载多余度EWIS各组成部分寿命服从指数分布但参数未知的情况，提出采用无失效数据可靠度分析方法评估EWIS的可靠度水平。通过Monte-Carlo仿真方法对连接形式为“先并联、后串联”EWIS各组成部分寿命进行抽样，利用“最小最大值”方法获得系统寿命的抽样值，用概率纸检验法初步判断EWIS寿命是否服从威布尔分布，再用Pearson拟合优度检验法判断EWIS寿命是否服从威布尔分布。结合无故障飞行时间的样本值与EWIS寿命服从威布尔分布的假设，采用无失效数据分析方法评估EWIS的可靠度水平。研究方法对机载多余度EWIS无失效数据可靠度分析有一定的贡献。     

Stream-Based Data Sampling Mechanism for Process Object

Process object is the instance of process. Vertexes and edges are in the graph of process object. There are different types of the object itself and the associations between object. For the large-scale data, there are many changes reflected. Recently, how to find appropriate real-time data for process object becomes a hot research topic. Data sampling is a kind of finding c hanges o f p rocess o bjects. There i s r equirements f or s ampling to be adaptive to underlying distribution of data stream. In this paper, we have proposed a adaptive data sampling mechanism to find a ppropriate d ata t o m odeling. F irst o f all, we use concept drift to make the partition of the life cycle of process object. Then, entity community detection is proposed to find changes. Finally, we propose stream-based real-time optimization of data sampling. Contributions of this paper are concept drift, community detection, and stream-based real-time computing. Experiments show the effectiveness and feasibility of our proposed adaptive data sampling mechanism for process object.     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.     

Combating Biofilm Associated Infection In Vivo: Integration of Quorum Sensing Inhibition and Photodynamic Treatment based on Multidrug Delivered Hollow Carbon Nitride Sphere

Recently, quorum sensing (QS) inhibitors (QSIs) have been combined with antibiotics to enhance antibiofilm efficacy in vitro and in vivo. However, targeting QS signals alone is not enough to prevent bacterial infections. Drug resistance and recurrence of biofilms makes it difficult to eradicate. Herein, photodynamic therapy (PDT) is selected to unite QSIs and antibiotics. A synergistically antibiofilm system, which combines QSIs, antibiotics, and PDT based on hollow carbon nitride spheres (HCNSs) is envisaged. First, HCNS provides the multidrug delivering ability, enabling QSIs and antibiotics to be released in sequence. Subsequently, multistage releases sensitize bacteria effectively, potentiating the chemotherapeutic effects of the antibiotics. Finally, the integration of QSIs and PDT not only minimizes the possibility of drug resistance, but also overcomes the problem of limited mass and extension of PDT. Even after 48 h of incubation, the bacterial biofilm is obviously inhibited. And its biofilm disperse efficiency exceeds 48% (compared with QSI‐potentiated chemotherapy group) and 40% (compared with PDT group). Besides, the inhibition of the QS system influences phenotypes related to virulence factor production and surface hydrophobicity, which weaken biofilm invasion and formation. Eventually, this system is applied to disperse bacterial biofilm in vivo. Overall, PDT and QS modulation are devoted to eradicate drug resistance and recurrence of the biofilm.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.