Search

In recent years, imbalanced utilization of medical resources is widely concerned within the tiered Chinese hospital system. Reverse referral, as a measure of promoting patient flows from upper level hospitals (ULHs) to lower level hospitals (LLHs), has demonstrated its advantages on alleviating ULH workload and balancing resource utilization between ULHs and LLHs. Nevertheless, it remains unclear on how to control the reverse referral decision process at the operational level. In this paper, we consider an ULH-dominant setting at which the LLH must accept patient referrals from the ULH whenever it has available beds. We focus our attention on an easy-to-implement threshold policy for the ULH to make the reverse referral decision. To investigate, we first formulate an analytically tractable queueing model for a simplified reverse referral process. We then investigate a more general patient flow control model, for which we analyze the patient population dynamics with a Markov chain process, and apply the concept of state-dependent Markovian arrival process to generate an infinitesimal generator of the system. We use RG factorization to compute the system performance measures. We next formulate a threshold optimization problem with the objective of maximizing the ULH profit. Simulation experiments are performed, which conclude that the threshold control policy is insensitive to the service time distribution. Finally, we report real-world inspired numerical studies, from which we generate insights into effective adjustment of the control threshold in response to the system parameters and discuss potential hindrance from the LLH incorrectly informing its real-time resource availability to the ULH. Our work is the first that applies systems engineering to the real-time reverse referral decision problem in China. It provides the novel perspective of resource balancing to patient flow control studies in the care transition management literature. Note to Practitioners—It is recognized, in almost all countries with insufficient health care delivery infrastructure, that the care coordination is a key strategy to improve the effectiveness, safety, and efficiency of the health care system. Through communicating/sharing knowledge, multiple care organizations work together to create a proactive care plan for the patients to meet their needs and preferences, especially dealing with transitions of care. With the promotion of population care management, practitioners throughout the world have increasingly acknowledged the importance of patient flow streamlining, resource alignment within each population, and linking to community care resources from acute care facilities. However, applying care coordination in everyday routines of a medical practice can be overwhelming, even when it is obvious that the changes will improve patient care and provide efficiency. In this paper, we investigate an easy-to-implement patient flow control policy in making reverse referral decisions for patients receiving postdischarge care. We expect to improve provider’s profit with improved operational management. Through our analyses, we want to stress the importance of applying systems engineering and mathematical modeling to study care coordination and interorganization patient flow control. We also want to advocate knowledge sharing and accountability establishment, as a well-functioned partnership between hospitals at different tiers may very much rely on them. [ABSTRACT FROM AUTHOR]

In sponsored content and service markets, the content and service providers are able to subsidize their target mobile users through directly paying the mobile network operator to lower the price of the data/service access charged by the network operator to the mobile users. The sponsoring mechanism leads to a surge in mobile data and service demand, which in return compensates for the sponsoring cost and benefits the content/service providers. In this paper, we study the interactions among the three parties in the market, namely, the mobile users, the content/service providers, and the network operator, as a two-level game with multiple Stackelberg (i.e., leader) players. Our study is featured by the consideration of global network effects owning to consumers’ grouping. Since the mobile users may have bounded rationality, we model the service-selection process among them as an evolutionary-population follower sub-game. Meanwhile, we model the pricing-then-sponsoring process between the content/service providers and the network operator as a non-cooperative equilibrium searching problem. By investigating the structure of the proposed game, we reveal a few important properties regarding the equilibrium existence and propose a distributed, projection-based algorithm for iterative equilibrium searching. Simulation results validate the convergence of the proposed algorithm and demonstrate how sponsoring helps improve both the providers’ profits and the users’ experience. [ABSTRACT FROM AUTHOR]

In the last 20 years, evolutionary algorithms (EAs) have shown to be an effective method to solve multiobjective optimization problems (MOPs). Due to their population-based nature, multiobjective EAs (MOEAs) are able to generate a set of tradeoff solutions (called nondominated solutions) in a single algorithmic execution instead of having to perform a series of independent executions, as normally done with mathematical programming techniques. Additionally, MOEAs can be successfully applied to problems with difficult features such as multifrontality, discontinuity and disjoint feasible regions, among others. On the other hand, coevolutionary algorithms (CAs) are extensions of traditional EAs which have become subject of numerous studies in the last few years, particularly for dealing with large-scale global optimization problems. CAs have also been applied to the solution of MOPs, motivating the development of new algorithmic and analytical formulations that have advanced the state-of-the-art in CAs research, while simultaneously opening a new research path within MOEAs. This paper presents a critical review of the most representative coevolutionary MOEAs (CMOEAs) that have been reported in the specialized literature. This survey includes a taxonomy of approaches together with a brief description of their main features. In the final part of this paper, we also identify what we believe to be promising areas of future research in the field of CMOEAs. [ABSTRACT FROM AUTHOR]

Due to the worldwide ongoing pressure to massively exploit the Sub-6 GHz spectrum for the deployment of independently-operated and heterogeneous networks, innovative solutions for network coexistence are deeply required. Hence, in this paper, we design a self-organizing strategy with the aim of minimizing the coexistence interference among heterogeneous networks sharing the Sub-6 GHz spectrum. The design is performed under the constraints of promoting selfless network utilization and avoiding any direct communication among the heterogeneous networks. For this, we develop an analytical framework, grounded on the nest-site selection behavior observed in honeybee swarms, to model the coexistence problem among multiple heterogeneous networks. Specifically, first, different heterogeneous networks are mapped into differentpopulationsand the allocation of a Sub-6 GHz band to a network is mapped into the populationcommitment. Then, theevolutionof the commitment process is described through a multi-dimensional differential system. We analytically study the stability of such a system at the equilibrium, and we derive the conditions that assure the optimal allocation of the available Sub-6 GHz bands among the different heterogeneous networks. Finally, the proposed strategy is validated through an extensive performance evaluation. [ABSTRACT FROM AUTHOR]

Real-world optimization problems are usually multimodal which require optimization algorithms to keep a balance between exploration and exploitation. Therefore, multimodal optimization is one of the main opportunities as well as one of the main challenges for evolutionary algorithms. In this paper, a loser-out tournament-based fireworks algorithm (LoTFWA) is proposed for solving multimodal optimization problems. The search manner of the conventional fireworks algorithm (FWA) is based on the cooperation of several fireworks. While in the LoTFWA, we propose competition as a new manner of interaction, in which the fireworks are compared with each other not only according to their current status but also according to their progress rate. If the fitness of a certain firework cannot catch up with the best one with its current progress rate, it is considered a loser in the competition. The losers will be eliminated and reinitialized because it is vain to continue their search processes. Reinitializing these fireworks would greatly reduce the probability of being trapped in local minima for the algorithm. Experimental results show that the proposed algorithm is very powerful in optimizing multimodal functions. It not only outperforms previous versions of the FWA, but also outperforms several famous evolutionary algorithms. [ABSTRACT FROM AUTHOR]

A mathematical modeling for description of oscillation suppression by deep brain stimulation (DBS) is explored in this paper. High-frequency DBS introduced to the basal ganglia network can suppress pathological neural oscillations that occur in the Parkinsonian state. However, selecting appropriate stimulation parameters remains a challenging issue due to the limited understanding of the underlying mechanisms of the Parkinsonian state and its control. In this paper, we use a describing function analysis to provide an intuitive way to select the optimal stimulation parameters based on a biologically plausible computational model of the Parkinsonian neural network. By the stability analysis using the describing function method, effective DBS parameter regions for inhibiting the pathological oscillations can be predicted. Additionally, it is also found that a novel sinusoidal-shaped DBS may become an alternative stimulation pattern and expends less energy, but with a different mechanism. This paper provides new insight into the possible mechanisms underlying DBS and a prediction of optimal DBS parameter settings, and even suggests how to select novel DBS wave patterns for the treatment of movement disorders, such as Parkinson’s disease. [ABSTRACT FROM AUTHOR]

This paper studies the related problems of prediction, covariance estimation, and principal component analysis for the spiked covariance model with heteroscedastic noise. We consider an estimator of the principal components based on whitening the noise, and we derive optimal singular value and eigenvalue shrinkers for use with these estimated principal components. Underlying these methods are new asymptotic results for the high-dimensional spiked model with heteroscedastic noise, and consistent estimators for the relevant population parameters. We extend previous analysis on out-of-sample prediction to the setting of predictors with whitening. We demonstrate certain advantages of noise whitening. Specifically, we show that in a certain asymptotic regime, optimal singular value shrinkage with whitening converges to the best linear predictor, whereas without whitening it converges to a suboptimal linear predictor. We prove that for generic signals, whitening improves estimation of the principal components, and increases a natural signal-to-noise ratio of the observations. We also show that for rank one signals, our estimated principal components achieve the asymptotic minimax rate. [ABSTRACT FROM AUTHOR]

The explosive deployment of the Internet of Things (IoT) brings a massive number of light-weight and energy-limited IoT devices, challenging stable wireless access. Energy-efficient, Frame Slotted Aloha (FSA) recently emerged as a promising MAC protocol for large-scale IoT systems such as Machine to Machine (M2M) and Radio Frequency Identification (RFID). Yet the stability of FSA and how to stabilize it, despite of its fundamental importance on the effective operation in practical systems, have not been systematically addressed. In order to bridge this gap, we devote this paper to designing stable FSA-based access protocol (SFP) to stabilize IoT systems. We first design an additive active node population estimation scheme and use the estimate to set frame size and participation probability for throughput optimization. We then carry out theoretical analysis demonstrating the stability of SFP in the sense of geometric ergodicity of Markov chain derived from dynamics of the active node population and its estimate. Our central theoretical result is a set of closed-form conditions on the stability of SFP. We further conduct extensive simulations whose results confirm our theoretical analysis and demonstrate the effectiveness of SFP. [ABSTRACT FROM AUTHOR]

Along with the rapid growth of the elderly population, the hospital quality and the safety of patients have become one of the priority concerns in the past few decades. The majority of injuries in the elderly result from bed -falls since the bed is a major part in his daily life. A single fall can cause severe physical and emotional injuries. Therefore, bed-falls have become a very active area of research in order to minimize their serious consequences. Mainly, there are two research tracks: bed-fall detection and bed-fall prediction. Both of them handle the fall issues with several sensing techniques and analysis models. In fact, there is a lack of reviews on bed-fall related technologies. Therefore, a generic classification of bed-fall related technologies including fall detection and prediction systems based on their sensor apparatus is proposed in this paper. Data processing techniques have been also highlighted. The objective of this work is to provide researchers in this field a good standpoint regarding bed-fall related systems. [ABSTRACT FROM AUTHOR]

As an important research topic of machine learning, multiclass classification has wide applications ranging from computer vision to bioinformatics. A variety of multiclass classification algorithms with promising performance have been proposed. Among them, the decomposition-based algorithms have shown their competitiveness, since they transform the original problem into several easily solved binary classification sub-problems. Unlike existing decomposition-based algorithms which tackle each sub-problem independently, this paper suggests an evolutionary multitasking method, named EMT-MC, for multiclass classification, where the concept of multitasking is introduced to achieve the multiclass classifier with better quality. To be specific, in EMT-MC, each binary classification sub-problem is firstly viewed as a task. Then, during the evolution, the tasks with low performance (termed "ill-solved" tasks) are aided by some well-selected "assisting" tasks by using the evolutionary multitasking learning. This not only ensures that the useful information in "assisting" tasks can be transferred into those "ill-solved" tasks, but also helps them to achieve classifiers with higher accuracy. Numerical experiments on different multiclass classification datasets demonstrate the superiority of the proposed method over the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes and implements an asynchronous distributed IoT-enabled customer characterization framework to classify customers’ load consumption behaviors in electric distribution networks. More specifically, the proposed framework enables robust distributed clustering of customers’ electricity consumption habits in a highly scalable and interoperable framework. The proposed clustering method eliminates the need for hefty synchronization efforts typical to other distributed clustering algorithms. The theoretical foundations of designing the proposed framework are introduced. The orchestration of the application layers integrated in the proposed framework is demonstrated in an experimental implementation on a real-time network adopting a data-centric databus architecture. The results of the experimental implementation on IoT development boards demonstrate that the proposed framework can characterize customer categories with a 95% accuracy compared to classical centralized $k$ -means clustering, while ensuring seamless and interoperable peer-to-peer information exchange. This proved to be highly scalable and applicable to the real-world. [ABSTRACT FROM AUTHOR]

Floating Content (FC) is a paradigm for localized infrastructure-less content dissemination, that aims at sharing information among nodes within a restricted geographical area by relying only on opportunistic content exchanges. FC provides the basis for the probabilistic spatial storage of shared information in a completely decentralized fashion, usually without support from dedicated infrastructure. One of the key open issues in FC is the characterization of its performance limits as functions of the system parameters, accounting for its reliance on volatile wireless exchanges and on limited user resources. This paper takes a first step towards tackling this issue, by elaborating a model for the storage capacity of FC, i.e., for the maximum amount of information that can be stored through the FC paradigm. The storage capacity of FC, and of similar probabilistic content dissemination systems, is evaluated with a powerful information theoretical approach, based on a mean field model of opportunistic information exchange. In addition, an extremely simple explicit approximate expression for storage capacity is derived. The numerical results generated by our analytical models are compared to the predictions of realistic simulations under different setups, proving the accuracy of our analytical approaches, and characterizing the properties of the FC storage capacity. [ABSTRACT FROM AUTHOR]

Understanding intra-urban human mobility patterns and their potential driving forces are vital to city planning and commercial site selection. In this paper, we first investigate the functions of urban regions and how different region types dynamically influence people’s trip decisions. Furthermore, we characterize urban circadian rhythms by time-vary inter-regional transition probabilities between these regions with different functions, and integrate them into intervening opportunity model to predict human mobility. Public transportation card data in Shanghai are used to demonstrate the effectiveness of the model in terms of station passenger flows, travel time and trip flux. By taking regional function into consideration, the proposed model significantly improved the prediction accuracy. Quantitative analysis ulteriorly indicates that trip intentions and regional features are critical elements in trip flux prediction, especially in the afternoon and evening when people have an abundance of opportunities to travel by their own volition. When the function of a certain region changes, our model is able to make reasonable predictions accordingly. The results indicate the importance of considering individual travel motivation and regional function in modeling human mobility. The proposed model could serve as a guide for popularity and trip flux prediction in urban planning and reconstruction. [ABSTRACT FROM AUTHOR]

Biocomputing systems based on engineered bacteria can lead to novel tools for environmental monitoring and detection of metabolic diseases. In this paper, we propose a Bacterial Molecular Computing on a Chip (BMCoC) using microfluidic and electrochemical sensing technologies. The computing can be flexibly integrated into the chip, but we focus on engineered bacterial AND Boolean logic gate and ON-OFF switch sensors that produces secondary signals to change the pH and dissolved oxygen concentrations. We present a prototype with experimental results that shows the electrochemical sensors can detect small pH and dissolved oxygen concentration changes created by the engineered bacterial populations’ molecular signals. Additionally, we present a theoretical model analysis of the BMCoC computation reliability when subjected to unwanted effects, i.e., molecular signal delays and noise, and electrochemical sensors threshold settings that are based on either standard or blind detectors. Our numerical analysis found that the variations in the production delay and the molecular output signal concentration can impact on the computation reliability for the AND logic gate and ON-OFF switch. The molecular communications of synthetic engineered cells for logic gates integrated with sensing systems can lead to a new breed of biochips that can be used for numerous diagnostic applications. [ABSTRACT FROM AUTHOR]

Decomposition-based multiobjective evolutionary algorithms (MOEAs) have been studied a lot and have been widely and successfully used in practice. However, there are no related theoretical studies on this kind of MOEAs. In this paper, we theoretically analyze the MOEAs based on decomposition. First, we analyze the runtime complexity with two basic simple instances. In both cases the Pareto front have one-to-one map to the decomposed subproblems or not. Second, we analyze the runtime complexity on two difficult instances with bad neighborhood relations in fitness space or decision space. Our studies show that: 1) in certain cases, polynomial-sized evenly distributed weight parameters-based decomposition cannot map each point in a polynomial sized Pareto front to a subproblem; 2) an ideal serialized algorithm can be very efficient on some simple instances; 3) the standard MOEA based on decomposition can benefit a runtime cut of a constant fraction from its neighborhood coevolution scheme; and 4) the standard MOEA based on decomposition performs well on difficult instances because both the Pareto domination-based and the scalar subproblem-based search schemes are combined in a proper way. [ABSTRACT FROM AUTHOR]

Over the last 25 years, the multiple sequence alignment (MSA) problem has attracted the attention of biologists because it is one of the major techniques used in several areas of computational biology, such as homology searches, genomic annotation, protein structure prediction, gene regulation networks, or functional genomics. This problem implicates the alignment of more than two biological sequences, and is considered as a nondeterministic polynomial time optimization problem. In this paper, we find a number of different approaches for dealing with this biological sequence alignment problem. Basically, we distinguish six main groups: 1) exact methods; 2) progressive methods; 3) consistency-based methods; 4) iterative methods; 5) evolutionary algorithms; and 6) structure-based methods. In this paper, we propose the use of evolutionary computation and multiobjective optimization for solving this bioinformatics problem. A multiobjective version of a memetic metaheuristic is presented: hybrid multiobjective metaheuristics for MSA. In order to prove the effectiveness of the new proposal, we use three structure-based benchmarks created by using empirical data as input. The results obtained by our method are compared with well-known methods published in this paper, concluding that the new approach presents remarkable accuracy when dealing with sets of sequences with a low sequence similarity, the most frequent ones in real world. [ABSTRACT FROM AUTHOR]

The design of evolutionary algorithms has typically been focused on efficiently solving a single optimization problem at a time. Despite the implicit parallelism of population-based search, no attempt has yet been made to multitask, i.e., to solve multiple optimization problems simultaneously using a single population of evolving individuals. Accordingly, this paper introduces evolutionary multitasking as a new paradigm in the field of optimization and evolutionary computation. We first formalize the concept of evolutionary multitasking and then propose an algorithm to handle such problems. The methodology is inspired by biocultural models of multifactorial inheritance, which explain the transmission of complex developmental traits to offspring through the interactions of genetic and cultural factors. Furthermore, we develop a cross-domain optimization platform that allows one to solve diverse problems concurrently. The numerical experiments reveal several potential advantages of implicit genetic transfer in a multitasking environment. Most notably, we discover that the creation and transfer of refined genetic material can often lead to accelerated convergence for a variety of complex optimization functions. [ABSTRACT FROM PUBLISHER]

The cyclic bending reliability of screen-printed silver traces on a plastic substrate is studied in this paper. The trace populations under study were printed, with different widths (250, 500, 1000, and 2000 \mu \textm ) and thicknesses (12, 24, and 36 \mu \textm ), on a 125- \mu \textm -thick polyethylene terephthalate film and subjected to dynamic loading by a bending tester. The reliability of each test component was monitored in situ with a four-point resistance measurement, with a 20% increase in resistance as a failure criterion. The most reliable cross-sectional geometry was found to be the trace population having a thickness of 12 \mu \textm and a width of 250 \mu \textm with the characteristic lifetime of 1555 bending cycles. The statistical analysis proved that the long-term reliability of the studied components can be enhanced by decreasing their thickness and thus reducing the mechanical strain on the trace surface. In addition, decreasing the trace width improved the reliability due to the flattening of the trace during the manufacturing process. The failure analysis did not indicate notable changes in the trace geometry after the cyclic bending test, and the cause of failure was deduced to be deterioration of the conductor’s internal structure. [ABSTRACT FROM AUTHOR]

Convergence performance and parametric sensitivity are two issues that tend to be neglected when extending differential evolution (DE) to multiobjective optimization (MO). To fill this research gap, we develop two novel mutation operators and a new parameter adaptation mechanism. A multiobjective DE variant is obtained through integration of the proposed strategies. The main innovation of this paper is the simultaneous use of individuals across generations from an objective-based perspective. Good convergence–diversity tradeoff and satisfactory exploration–exploitation balance are achieved via the hybrid cross-generation mutation operation. Furthermore, the cross-generation adaptation mechanism enables the individuals to self-adapt their associated parameters not only optimization-stage-wise but also objective-space-wise. Empirical results indicate the statistical superiority of the proposed algorithm over several state-of-the-art evolutionary algorithms in handling MO problems. [ABSTRACT FROM PUBLISHER]

Distribution feeder reconfiguration (DFR) is a precious operation strategy that can improve the system from different aspects including total cost, reliability, and power quality. Nevertheless, the high complexity of the new smart grids has resulted in much uncertainty in the DFR problem that necessities the use of a sufficient stochastic framework to deal with them. In this way, this paper proposes a new stochastic framework based on cloud theory to account the uncertainties associated with multiobjective DFR problem from the reliability point of view. Cloud theory is constructed based on fuzzy theory and probability idea. In comparison with the Monte Carlo simulation method, cloud models can give more information on the uncertainties associated with the problem. This special aspect of cloud models makes it possible to integrate the fuzziness and randomness of qualitative concepts through the cloud drops and then transforms them to the quantitative model. In order to solve the proposed problem, a fast and powerful optimization technique is required. To deal with this issue, a new optimization algorithm designated as \theta -bat algorithm is proposed in this paper. The feasibility and satisfying performance of the proposed method are examined on the 32-bus and 69-bus IEEE distribution test system. [ABSTRACT FROM PUBLISHER]

Most existing research adopts a “flat” view of radio frequency identification (RFID) systems to perform various functions of collecting tag IDs, estimating the number of tags, detecting the missing tags, etc. However, in practice, tags are often attached to objects of different groups, which may represent different product types in a warehouse, different book categories in a library, etc. As we move from a flat view to an organized group view, there arise many interesting problems. One of them, called multigroup threshold-based classification, is the focus of this paper. It is to determine whether the number of objects in each group is above or below a prescribed threshold value. Solving this problem is important for inventory tracking applications. If the number of groups is very large, it will be inefficient to measure the groups one at a time. The best existing solution for multigroup threshold-based classification is based on generic group testing, whose design is however geared toward detecting a small number of populous groups. Its performance degrades quickly when the number of groups above the threshold becomes large. In this paper, we propose a new classification protocol based on tag sampling and logical bitmaps. It achieves high efficiency by measuring all groups in a mixed fashion. In the meantime, we show that the new method is able to perform threshold-based classification with an accuracy that can be preset to any desirable level, allowing tradeoff between time efficiency and accuracy. [ABSTRACT FROM AUTHOR]

Many-objective optimization has posed a great challenge to the classical Pareto dominance-based multiobjective evolutionary algorithms (MOEAs). In this paper, an evolutionary algorithm based on a new dominance relation is proposed for many-objective optimization. The proposed evolutionary algorithm aims to enhance the convergence of the recently suggested nondominated sorting genetic algorithm III by exploiting the fitness evaluation scheme in the MOEA based on decomposition, but still inherit the strength of the former in diversity maintenance. In the proposed algorithm, the nondominated sorting scheme based on the introduced new dominance relation is employed to rank solutions in the environmental selection phase, ensuring both convergence and diversity. The proposed algorithm is evaluated on a number of well-known benchmark problems having 3–15 objectives and compared against eight state-of-the-art algorithms. The extensive experimental results show that the proposed algorithm can work well on almost all the test functions considered in this paper, and it is compared favorably with the other many-objective optimizers. Additionally, a parametric study is provided to investigate the influence of a key parameter in the proposed algorithm. [ABSTRACT FROM PUBLISHER]

Online social networks have become increasingly popular. One of the interesting applications is the friend locator, in which the application server informs a user through a mobile device if some of his/her listed friends are close enough in terms of geographical locations. However, in such services, it is challenging to protect the privacy of the individual users. Previous solutions for the friend locator do not guarantee a high level of privacy and do not maintain efficiency. In this paper, we propose a dual-resolution system structure to guarantee both strong privacy and efficiency. Additionally, we use the polygon decomposition method to achieve both accuracy and flexibility. To be more specific, in the coarse resolution level, each regular mobile user uploads his/her encrypted coarse location information to a central server periodically for comparisons. If a regular mobile user is found to be in the same grid block as an active mobile user, then the friend locator procedure with a higher resolution level will be conducted. Finally, through numerical analysis and simulations, we show that the proposed system design and algorithm can achieve high privacy, efficiency, accuracy, and flexibility. [ABSTRACT FROM PUBLISHER]

Artificial gene regulatory networks (GRNs) are biologically inspired dynamical systems used to control various kinds of agents, from the cells in developmental models to embodied robot swarms. Most recent work uses a genetic algorithm (GA) or an evolution strategy in order to optimize the network for a specific task. However, the empirical performances of these algorithms are unsatisfactory. This paper presents an algorithm that primarily exploits a network distance metric, which allows genetic similarity to be used for speciation and variation of GRNs. This algorithm, inspired by the successful neuroevolution of augmenting topologies algorithm’s use in evolving neural networks and compositional pattern-producing networks, is based on a specific initialization method, a crossover operator based on gene alignment, and speciation based upon GRN structures. We demonstrate the effectiveness of this new algorithm by comparing our approach both to a standard GA and to evolutionary programming on four different experiments from three distinct problem domains, where the proposed algorithm excels on all experiments. [ABSTRACT FROM AUTHOR]

Modern engines feature a considerable number of adjustable control parameters. With this increasing number of degrees of freedom (DoFs) for engines and the consequent considerable calibration effort required to optimize engine performance, traditional manual engine calibration or optimization methods are reaching their limits. An automated and efficient engine optimization approach is desired. In this paper, interdisciplinary research on a multiobjective evolutionary algorithm (MOEA)-based global optimization approach is developed for a homogeneous charge compression ignition (HCCI) engine. The performance of the HCCI engine optimizer is demonstrated by the cosimulation between an HCCI engine Simulink model and a Strength Pareto Evolutionary Algorithm 2 (SPEA2)-based multiobjective optimizer Java code. The HCCI engine model is developed by Simulink and validated with different engine speeds (1500–2250 r/min) and indicated mean effective pressures (IMEPs) (3–4.5 bar). The model can simulate the HCCI engine's indicated specific fuel consumption (ISFC) and indicated specific hydrocarbon (ISHC) emissions with good accuracy. The introduced MOEA optimization is an approach to efficiently optimize the engine ISFC and ISHC simultaneously by adjusting the settings of the engine's actuators automatically through the SPEA2. In this paper, the settings of the HCCI engine's actuators are intake valve opening (IVO) timing, exhaust valve closing (EVC) timing, and relative air-to-fuel ratio $\lambda$. The cosimulation study and experimental validation results show that the MOEA engine optimizer can find the optimal HCCI engine actuators' settings with satisfactory accuracy and a much lower time consumption than usual. [ABSTRACT FROM PUBLISHER]

Pareto dominance-based multiobjective optimization has been successfully applied to constrained evolutionary optimization during the last two decades. However, as another famous multiobjective optimization framework, decomposition-based multiobjective optimization has not received sufficient attention from constrained evolutionary optimization. In this paper, we make use of decomposition-based multiobjective optimization to solve constrained optimization problems (COPs). In our method, first of all, a COP is transformed into a biobjective optimization problem (BOP). Afterward, the transformed BOP is decomposed into a number of scalar optimization subproblems. After generating an offspring for each subproblem by differential evolution, the weighted sum method is utilized for selection. In addition, to make decomposition-based multiobjective optimization suit the characteristics of constrained evolutionary optimization, weight vectors are elaborately adjusted. Moreover, for some extremely complicated COPs, a restart strategy is introduced to help the population jump out of a local optimum in the infeasible region. Extensive experiments on three sets of benchmark test functions, namely, 24 test functions from IEEE CEC2006, 36 test functions from IEEE CEC2010, and 56 test functions from IEEE CEC2017, have demonstrated that the proposed method shows better or at least competitive performance against other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

This paper discusses the genetic diversity of real-coded populations processed by an evolutionary algorithm (EA). Diversity is expressed as a variance or a covariance matrix of individuals contained in the population, in one- or multi-dimensional cases, respectively. We focus on the exploration stage of the optimization, therefore, the fitness function is modeled as noise. We prove that the expected value of genetic diversity achieves a level proportional to the mutation covariance matrix. The proportionality coefficient depends solely on the EA parameters. Formulas are derived to predict the diversity for fitness proportionate, tournament, and truncation selection, with and without arithmetic crossover and with Gaussian mutation. Experimental validation of the multidimensional case shows that prediction accuracy is satisfactory in a broad spectrum of settings of EA parameters. [ABSTRACT FROM AUTHOR]

Recent years have witnessed the world-wide emergence of mega-metropolises with incredibly huge populations. Understanding residents mobility patterns, or urban dynamics, thus becomes crucial for building modern smart cities. In this paper, we propose a Neighbor-Regularized and context-aware Non-negative Tensor Factorization model (NR-cNTF) to discover interpretable urban dynamics from urban heterogeneous data. Different from many existing studies concerned with prediction tasks via tensor completion, NR-cNTF focuses on gaining urban managerial insights from spatial, temporal, and spatio-temporal patterns. This is enabled by high-quality Tucker factorizations regularized by both POI-based urban contexts and geographically neighboring relations. NR-cNTF is also capable of unveiling long-term evolutions of urban dynamics via a pipeline initialization approach. We apply NR-cNTF to a real-life data set containing rich taxi GPS trajectories and POI records of Beijing. The results indicate: 1) NR-cNTF accurately captures four kinds of city rhythms and seventeen spatial communities; 2) the rapid development of Beijing, epitomized by the CBD area, indeed intensifies the job-housing imbalance; 3) the southern areas with recent government investments have shown more healthy development tendency. Finally, NR-cNTF is compared with some baselines on traffic prediction, which further justifies the importance of urban contexts awareness and neighboring regulations. [ABSTRACT FROM AUTHOR]

Genetic programming (GP) is a powerful evolutionary algorithm that has been widely used for solving many real-world optimization problems. However, traditional GP can only solve a single task in one independent run, which is inefficient in cases where multiple tasks need to be solved at the same time. Recently, multifactorial optimization (MFO) has been proposed as a new evolutionary paradigm toward evolutionary multitasking. It intends to conduct evolutionary search on multiple tasks in one independent run. To enable multitasking GP, in this paper, we propose a novel multifactorial GP (MFGP) algorithm. To the best of our knowledge, this is the first attempt in the literature to conduct multitasking GP using a single population. The proposed MFGP consists of a novel scalable chromosome encoding scheme which is capable of representing multiple solutions simultaneously, and new evolutionary mechanisms for MFO based on self-learning gene expression programming. Further, comprehensive experimental studies are conducted on multitask scenarios consisting of commonly used GP benchmark problems and real world applications. The obtained empirical results confirmed the efficacy of the proposed MFGP. [ABSTRACT FROM AUTHOR]

In recent years, electric vehicle charging stations (EVCSs) have been deployed very fast, which offer a platform for the energy coordination between electric vehicles (EVs) and the electricity distribution system (DS). This paper presents an energy management method for the operation of EVCSs and DS while considering their interaction. In this method, we first use a quality-of-service constrained decision model for EVCSs, which is formulated based on the network calculus theory. Then, the DS aims to maximize its utility by scheduling charging plans for EVCSs. Afterwards, a game based on the supply function equilibrium (SFE) model is adopted to analyze the energy interaction, in which each EVCS is regarded as the leader, and the DS as the follower. In this way, an optimization problem with equilibrium constraints is established. Moreover, a hybrid optimization algorithm based on differential evolution and interior point method is used to obtain the equilibrium solution of the SFE game. Finally, simulation studies verify the effectiveness of proposed interactive energy management method. [ABSTRACT FROM AUTHOR]

Fitness landscape analysis (FLA) is an important approach for studying how hard problems are for metaheuristic algorithms to solve. Static FLA focuses on extracting the properties of a problem and does not consider any information about the optimization algorithms; thus, it is not adequate for indicating whether a particular algorithm is suitable for solving a problem. By contrast, dynamic FLA considers the behavior of algorithms in combination with the properties of an optimization problem to determine the effectiveness of a given algorithm for solving that problem. However, previous dynamic FLA approaches are all individually based and lack statistical significance. In this paper, the concept of population evolvability is presented, as an extension of dynamic FLA, to quantify the effectiveness of population-based metaheuristic algorithms for solving a given problem. Specifically, two measures of population evolvability are defined that describe the probability that a population will obtain improved solutions to a problem and its ability to do so. Then, a combined measure is derived from these two measures to represent the overall population evolvability. Subsequently, the significance and validity of the proposed measures are investigated through analytical and experimental studies. Finally, the utility of the proposed measures is illustrated in an application of algorithm selection for black-box optimization problems. High accuracy in selecting the best algorithm is observed in a statistical analysis, with a low computational cost in terms of fitness evaluations. [ABSTRACT FROM AUTHOR]

Tchebycheff decomposition represents one of the most widely used decomposition approaches that can convert a multiobjective optimization problem into a set of scalar optimization subproblems. Nevertheless, the geometric properties of the subproblem objective functions in Tchebycheff decomposition have not been explicitly studied. This paper proposes a Tchebycheff decomposition with lp -norm constraint on direction vectors in which the subproblem objective functions are endowed with clear geometric property. Especially, the Tchebycheff decomposition with l2 -norm constraint on direction vectors is taken as an example to illustrate its advantage. A new unary R2 indicator is also introduced to approximate the hyper-volume metric and justify the efficiency of the proposed Tchebycheff decomposition. A resultant Tchebycheff decomposition-based multiobjective evolutionary algorithm (MOEA) with l2 -norm constraint and a new population update strategy is proposed to solve multiobjective optimization problems. The experimental results on both benchmark and real-world multiobjective optimization problems show that the proposed algorithm is capable of obtaining high quality solutions compared with other state-of-the-art MOEAs. [ABSTRACT FROM PUBLISHER]

This paper proposes backtracking search optimizer (BSO) for solving the reactive power dispatch (RPD) problem. The RPD problem is highly nonlinear, nonconvex optimization problem and is consisting of both continuous and discrete control variables. It aims to find the optimal settings of the generator voltages, tap positions of tap changing transformers, and the amount of reactive compensation that able to optimize the transmission power losses. BSO has simple structure and single control parameter. It has two new tuned mutation and crossover operators that control the amplitude of the search-direction matrix and search space boundaries. In this paper, five diversified generation strategies of mutation factor of BSO to solve the RPD. The proposed BSO strategies are applied to the IEEE standard 14-, 30-, 57-bus test systems, and a real power system at West Delta region system as a part of the unified Egyptian network. Simulation results show that the BSO strategy, which almost generates mutation factor concentrated on the mean value of the normal distribution (BSO 4) assigns multidirections through the search space and supports the diversity of populations. To show the effectiveness and superiority of proposed BSO, the obtained results are compared with different algorithms reported in the literature. [ABSTRACT FROM PUBLISHER]

Existing studies on dynamic multiobjective optimization (DMO) focus on problems with time-dependent objective functions, while the ones with a changing number of objectives have rarely been considered in the literature. Instead of changing the shape or position of the Pareto-optimal front/set (PF/PS) when having time-dependent objective functions, increasing or decreasing the number of objectives usually leads to the expansion or contraction of the dimension of the PF/PS manifold. Unfortunately, most existing dynamic handling techniques can hardly be adapted to this type of dynamics. In this paper, we report our attempt toward tackling the DMO problems with a changing number of objectives. We implement a dynamic two-archive evolutionary algorithm which maintains two co-evolving populations simultaneously. In particular, these two populations are complementary to each other: one concerns more about the convergence while the other concerns more about the diversity. The compositions of these two populations are adaptively reconstructed once the environment changes. In addition, these two populations interact with each other via a mating selection mechanism. Comprehensive experiments are conducted on various benchmark problems with a time-dependent number of objectives. Empirical results fully demonstrate the effectiveness of our proposed algorithm. [ABSTRACT FROM PUBLISHER]

In this paper, several studies on total ionizing dose effects on pinned photodiode CMOS images sensors are presented. More precisely, the evolution of a parasitic signal called random telegraph signal (RTS) is analyzed through several photodiode designs. It is shown that the population of pixels exhibiting this fluctuation depends on the design variants. This population also increases in a different way with the dose: the effects are not the same considering a low or high X-rays irradiation. Moreover, a statistical analysis is realized in order to better characterize the defects responsible for RTS. It turns out that an electric-field enhancement signature can appear in some specific cases. [ABSTRACT FROM PUBLISHER]

Flexible loads such as residential air-conditioners (ACs) can be directly controlled to provide demand-side regulation and balance services in electricity grids. Large aggregations of ACs offer a resource akin to that of a distributed energy storage system, which may be used to compensate fluctuations in the power output of local renewable energy generation. This paper formulates distributed and centralized model predictive control (MPC) strategies to balance fluctuations in solar power generation by directly controlling the aggregate demand of clusters of distributed residential ACs. The proposed receding-horizon control strategies rely on a new second-order linear time-varying model for the aggregate demand response of a population of heterogeneous ACs to changes in thermostat setpoints under varying ambient temperature. The performance of the proposed MPC strategies is analyzed in a numerical simulation study implementing AC demand tracking of 1-min fluctuations in actual photovoltaic capacity based on persistence and sky imager short-term solar forecasts. The results show that distributed and centralized MPC strategies achieve comparable performance, with better performance of persistence forecasts in a shorter prediction horizon, and better performance with sky imager forecasts on a longer prediction horizon. [ABSTRACT FROM PUBLISHER]

Pattern mining (PM) refers to the process of discovering patterns of interest to users from data. However, most studies have considered only one pattern, such as frequent pattern or high-utility pattern. With the continuous requirement of businesses in various industries, the single-objective PM methods are difficult to meet the increasingly diverse needs of users. In this paper, a multi-objective problem model for high quality pattern mining (HQPM) is proposed, where the objectives are support, occupancy, and utility. In order to solve the proposed three-objective problem efficiently, an improved multi-objective evolutionary algorithm for HQPM (MOEA-PM) is proposed. Two kinds of population initialization strategies are designed, which is used to ensure the population is effectively distributed in the feasible solution space. By taking the properties of the model into consideration, an auxiliary tool is proposed to accelerate the convergence of the algorithm. Experimental results on real-world datasets show that the proposed three-objective problem model with the MOEA-PM algorithm can discover patterns that are both frequently occurring and has a high utility in the transaction datasets, while at the same time being relatively complete. Compared with the state-of-the-art MOEA-based HQPM algorithms, MOEA-PM has better performance in terms of efficiency, quality, and convergence speed. [ABSTRACT FROM AUTHOR]

Alterations in the human Gut Bacteriome (GB) can be associated with human health issues, such as type-2 diabetes and obesity. Both external and internal factors can drive changes in the composition and in interactions of the human GB, impacting negatively on the host cells. This paper focuses on the human GB metabolism and proposes a two-layer network system to investigate its dynamics. Furthermore, we develop an in-silico simulation model (virtual GB), allowing us to study the impact of the metabolite exchange through molecular communications in the human GB network system. Our results show that regulation of molecular inputs strongly affects bacterial population growth and creates an unbalanced network, as shown by shifts in the node weights based on the produced molecular signals. Additionally, we show that the metabolite molecular communication production is greatly affected when directly manipulating the composition of the human GB network in the virtual GB. These results indicate that our human GB interaction model can help to identify hidden behaviours of the human GB depending on molecular signal interactions. Moreover, the virtual GB can support the research and development of novel medical treatments based on the accurate control of bacterial population growth and exchange of metabolites. [ABSTRACT FROM AUTHOR]

Joint caching and recommendation has been recently proposed as a new paradigm for increasing the efficiency of mobile edge caching. Early findings demonstrate significant gains for the network performance. However, previous works evaluated the proposed schemes exclusively on simulation environments. Hence, it still remains uncertain whether the claimed benefits would change in real settings. In this paper, we propose a methodology that enables to evaluate joint network and recommendation schemes in real content services by only using publicly available information. We apply our methodology to the YouTube service, and conduct extensive measurements to investigate the potential performance gains. Our results show that significant gains can be achieved in practice; e.g., 8 to 10 times increase in the cache hit ratio from cache-aware recommendations. Finally, we build an experimental testbed and conduct experiments with real users; we make available our code and datasets to facilitate further research. To our best knowledge, this is the first realistic evaluation (over a real service, with real measurements and user experiments) of the joint caching and recommendations paradigm. Our findings provide experimental evidence for the feasibility and benefits of this paradigm, validate assumptions of previous works, and provide insights that can drive future research. [ABSTRACT FROM AUTHOR]

Advances in communications, storage and computational technology allow significant quantities of data to be collected and processed by distributed devices. Combining the information from these endpoints can realize significant societal benefit but presents challenges in protecting the privacy of individuals, especially important in an increasingly regulated world. Differential privacy (DP) is a technique that provides a rigorous and provable privacy guarantee for aggregation and release. The Shuffle Model for DP has been introduced to overcome challenges regarding the accuracy of local-DP algorithms and the privacy risks of central-DP. In this work we introduce a new protocol for vector aggregation in the context of the Shuffle Model. The aim of this paper is twofold; first, we provide a single message protocol for the summation of real vectors in the Shuffle Model, using advanced composition results. Secondly, we provide an improvement on the bound on the error achieved through using this protocol through the implementation of a Discrete Fourier Transform, thereby minimizing the initial error at the expense of the loss in accuracy through the transformation itself. This work will further the exploration of more sophisticated structures such as matrices and higher-dimensional tensors in this context, both of which are reliant on the functionality of the vector case. [ABSTRACT FROM AUTHOR]

Rhythmic oscillation is crucial for information transmission and neural communication among different brain areas. Stochastic resonance (SR) can evoke different patterns of neural oscillation. However, the characteristics of network resonance and underlying dynamical mechanisms are still unclear. In this paper, a biological model of cortical network is established and its dynamical response to external periodic stimulation is investigated. We explore the oscillatory resonance of excitatory and inhibitory populations in cortical network. It is found that the intrinsic parameters of neural populations determine the extent of resonant activity, indicating that the firing rate exhibits coherent oscillation when the frequency of external stimulation is close to intrinsic frequency of neural population. In addition, the nonlinear dynamics of cortical network in oscillatory resonance can be represented by helical manifolds in low-dimensional state space. The geometry of neural manifolds reveals the periodic dynamics and state transition in oscillatory resonance. Moreover, time delay in chemical synapses can induce multiple resonances, which appear intermittently at integer multiples of the period of input signal. The dynamical response of neural population achieves maximal periodically, due to the transition of network states induced by time delay. Furthermore, mean-field theory is applied to analyze theoretical dynamic of cortical networks with time delay and demonstrate the effective transmission of stimulation information via oscillatory resonance in the brain. Consequently, the obtained results contribute to the improvement of neuromodulation for neurological disease from the viewpoint of the neural basis. [ABSTRACT FROM AUTHOR]

Today’s Internet traffic has been dominated by video contents. To efficiently serve online videos for millions of users, it is essential to cache frequently requested videos on various devices such as edge servers, personal computers, etc. Existing caching algorithms are mainly designed by leveraging the information of past request records. However, it is insufficient to only use simple statistics of past request records, e.g., video popularity which ignores the occurrence time of past video request events and the discrepancies among individual devices. In this paper, we propose a radically different learning-based video caching algorithm for Internet devices, called PPVC (Point Process based Video Cache) which can take exact video request patterns into account. By utilizing Hawkes Process (HP), we are able to link the future video request rates of a device with three kinds of historical records, namely, historical requests for the same video launched by the device itself, historical requests for the same video from other devices with a similar request pattern, and historical requests for other similar videos from the same device. The video request patterns can be efficiently computed via Singular Value Decomposition (SVD). Parameters linking these historical events can be determined by maximizing the likelihood of historical events. To further reduce the computation load, we also propose an online version of PPVC, which can timely update cached videos with the incremental arrival of events. One nice property of PPVC is that it can adapt to the change of video popularity very fast and is also applicable to Internet devices at different levels, ranging from the high-level servers that serve a large population of users to the low-level user devices (e.g., personal computers). Finally, we conduct extensive simulations with real traces and the results show that PPVC can always achieve the best video caching performance in terms of the hit rate on all levels of Internet devices, and quickly adapt to the dynamics of video requests. [ABSTRACT FROM AUTHOR]

Z-pinches, formed by passing large currents through wires or gas puffs, are the most powerful and energetic laboratory sources of X-rays. As higher current generators become available, Z-pinches incorporate increasingly larger masses of plasma and are nearly always optically thick to some or most of the photons that they produce. Understanding and modeling the transport of this radiation is an important element in attaining an overall picture of the physics of Z-pinches and in optimizing their properties for applications. This paper focuses on the aspects of radiation transport that are most relevant to the Z-pinch environment. The topics covered include: theory of radiation transport and its strengths and limitations, sources of opacity in Z-pinches, requirements for local thermodynamic equilibrium in the presence of opacity, transition to the blackbody limit, and Z-pinch experiments that demonstrate the effects of radiation transport. [ABSTRACT FROM PUBLISHER]

Modern wind turbines vary greatly in their drive train configurations. With the variety of options available, it can be difficult to determine which type is most suitable for on and offshore applications. A large percentage of modern drive trains consist of either doubly fed induction generators with partially rated converters or permanent magnet generators with fully rated converters. These configurations are the focus of this empirical reliability comparison. The turbine population for this analysis contains over 1800 doubly fed induction generators, partially rated converter wind turbines, and 400 permanent magnet generator fully rated converter wind turbines. The turbines analyzed are identical except for their drive train configurations and are modern MW scale turbines making this population the largest and most modern encountered in the literature review. Results of the analysis include overall failure rates, failure rates per operational year, failure rates per failure mode, and failure rates per failure cost category for the two drive train configurations. These results contribute toward deciding on the most suitable turbine type for a particular site, as well as toward cost of energy comparisons for different drive train types. A comparison between failure rates from this analysis and failure rates from similar analyses is also shown in this paper. [ABSTRACT FROM AUTHOR]

Fast and effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Electrically powered systems in industrial settings require monitoring of emitted electromagnetic fields to determine the status of the equipment and ensure their safe operation. In situations such as these, wireless sensor nodes (WSNs) at fixed predetermined locations provide monitoring to ensure safety. A challenging algorithmic problem is determining the locations to place these WSNs while meeting several criteria: 1) to provide complete coverage of the domain; 2) to create a topology with problem-dependent node densities; and 3) to minimize the number of WSNs. This paper presents a novel approach, advancing front mesh generation with constrained Delaunay triangulation and smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine WSN locations for areas of high interest (hospitals, schools, and high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm provides significant reduction in the number of nodes, in some cases over 40%, compared with an advancing front mesh generation algorithm; maintains and improves optimal spacing between nodes; and produces simulation run times suitable for real-time applications. [ABSTRACT FROM PUBLISHER]

Energy storage systems (ESSs) play a significant role in performance improvement of future electric traction systems. This paper investigates an ESS based on supercapacitors for trams as a reliable technical solution with considerable energy saving potential. Operating the ESS onboard a tram brings the following benefits: reduction of peak power demands, decrease of power consumption, improvement of performance, and efficiency. Whereas the commonly used ESS power management (PM) has been dealing only with PM without vehicle position knowledge, the main emphasis of the presented research is put on position-based Takagi–Sugeno fuzzy (T-S fuzzy) PM for human-driven trams with an ESS. The tram position, located by, e.g., a Global Positioning System module, is used to predict future energy demands and power flows. This information is used in the preparation of the supercapacitor energy level and its power flow control. The optimal ESS power flow with respect to the tram position is a very complex problem. Therefore, soft computing techniques are used in this paper. The main part of the proposed ESS PM is the T-S fuzzy controller. The T-S fuzzy reduces problem dimensionality using expert knowledge represented by the rules. The output membership functions were optimized by differential evolution. The designed ESS PM was verified on real traffic data. [ABSTRACT FROM PUBLISHER]

Radio frequency identification (RFID) systems have been widely deployed for various applications such as object tracking, 3-D positioning, supply chain management, inventory control, and access control. This paper concerns the fundamental problem of estimating RFID tag population size, which is needed in many applications such as tag identification, warehouse monitoring, and privacy-sensitive RFID systems. In this paper, we propose a new scheme for estimating tag population size called Average Run-based Tag estimation (ART). The technique is based on the average run length of ones in the bit string received using the standardized framed slotted Aloha protocol. ART is significantly faster than prior schemes. For example, given a required confidence interval of 0.1% and a required reliability of 99.9%, ART is consistently 7 times faster than the fastest existing schemes (UPE and EZB) for any tag population size. Furthermore, ART's estimation time is provably independent of the tag population sizes. ART works with multiple readers with overlapping regions and can estimate sizes of arbitrarily large tag populations. ART is easy to deploy because it neither requires modification to tags nor to the communication protocol between tags and readers. ART only needs to be implemented on readers as a software module. [ABSTRACT FROM PUBLISHER]

Differential evolution has been shown to be an effective methodology for solving optimization problems over continuous space. In this paper, we propose an eigenvector-based crossover operator. The proposed operator utilizes eigenvectors of covariance matrix of individual solutions, which makes the crossover rotationally invariant. More specifically, the donor vectors during crossover are modified, by projecting each donor vector onto the eigenvector basis that provides an alternative coordinate system. The proposed operator can be applied to any crossover strategy with minimal changes. The experimental results show that the proposed operator significantly improves DE performance on a set of 54 test functions in CEC 2011, BBOB 2012, and CEC 2013 benchmark sets. [ABSTRACT FROM AUTHOR]

Backtracking search algorithm (BSA) is a novel evolutionary algorithm (EA) for solving real-valued numerical optimization problems. In this paper, an adaptive BSA (ABSA) is proposed to solve the optimization problem of an induction magnetometer (IM). In the adaptive algorithm, the probabilities of crossover and mutation are varied depending on the fitness values of the solutions to refine the convergence performance. The proposed ABSA will also be compared with basic BSA and other widely used EA algorithms. Simulation results show that ABSA is better able to solving the IM optimization problems. [ABSTRACT FROM AUTHOR]

Computational tools are needed to make data-driven disaster mitigation planning accessible to planners and policymakers without the need for programming or geographic information systems expertise. To address this problem, we have created modules to facilitate quantitative analyses pertinent to a variety of different disaster scenarios. These modules, which comprise the REsponse PLan ANalyzer framework, may be used to create tools for specific disaster scenarios that allow planners to harness large amounts of disparate data and execute computational models through a point-and-click interface. Bio-E, a user-friendly tool built using this framework, was designed to develop and analyze the feasibility of ad hoc clinics for treating populations following a biological emergency event. In this paper, the design and implementation of the RE-PLAN framework are described, and the functionality of the modules used in the Bio-E biological emergency mitigation tools are demonstrated. [ABSTRACT FROM AUTHOR]