Search

Neural architecture search (NAS), which automatically designs the architectures of deep neural networks, has achieved breakthrough success over many applications in the past few years. Among different classes of NAS methods, evolutionary computation-based NAS (ENAS) methods have recently gained much attention. Unfortunately, the development of ENAS is hindered by unfair comparison between different ENAS algorithms due to different training conditions and high computational cost caused by expensive performance evaluation. This article develops a platform named BenchENAS, in short for benchmarking evolutionary NAS, to address these issues. BenchENAS makes it easy to achieve fair comparisons between different algorithms by keeping them under the same settings. To accelerate the performance evaluation in a common lab environment, BenchENAS designs a novel and generic efficient evaluation method for the population characteristics of evolutionary computation. This method has greatly improved the efficiency of the evaluation. Furthermore, BenchENAS is easy to install and highly configurable and modular, which brings benefits in good usability and easy extensibility. This article conducts efficient comparison experiments on eight ENAS algorithms with high GPU utilization on this platform. The experiments validate that the fair comparison issue does exist in the current ENAS algorithms, and BenchENAS can alleviate this issue. A Website has been built to promote BenchENAS at https://benchenas.com , where interested researchers can obtain the source code and document of BenchENAS for free. [ABSTRACT FROM AUTHOR]

Conventional multiobjective optimization algorithms (MOEAs) with or without preferences are successful in solving multi- and many-objective optimization problems. However, a strong hypothesis underlying their performance is that MOEAs are able to find a representative solution set to cover the entire Pareto-optimal front (PF) and decision makers are able to conveniently and precisely articulate their preference, which is not always easy to fulfill in practice. Accordingly, it is suggested that representative solutions in the naturally interesting regions of the PF rather than the whole PF should be targeted. A large body of research has been proposed to search or identify the knees or knee regions over the past decades. Therefore, this article aims to provide a comprehensive survey of the research on knee-oriented optimization. We start with a discussion of the importance and basic concepts of the knees, followed by a summary of knee-oriented benchmarks and indicators. After that, knee-oriented frameworks and techniques, and real-world applications are presented. Finally, potential challenges are pointed out and a few promising future lines of research are suggested. The survey offers a new perspective to develop MOEAs for solving multi- and many-objective optimization problems. [ABSTRACT FROM AUTHOR]

Distributed population dynamics offer a game-theoretical framework for distributed decision making. As such, the application of these methods to the control of networked systems has been widely studied in the literature. The theoretical analyses available in the literature have only considered continuous-time formulations of distributed population dynamics. However, given that modern computers can only process information in a discrete-time fashion, the practical implementation of distributed population dynamics-based methods is inevitably discrete. In consequence, it is paramount to extend the available theory to a more implementable discrete-time approach. For that reason, in this article, we provide a discrete-time analysis of a general class of distributed population dynamics, and we derive sufficient conditions on the discretization time to ensure the asymptotic stability of the discretized dynamics. To illustrate the relevance and performance of the proposed methods, we apply the developed theory to distributed optimization and control problems, including a real multirobot platform, which consider noncomplete communication networks and coupled constraints. [ABSTRACT FROM AUTHOR]

The widespread existence of uncertainty makes power system control and decision-making face various risks, especially the interconnection of modern large-scale power systems, which makes its influence range more extensive. In smart grid, the renewable energy prediction and uncertainty analysis methods represented by wind power generation have attracted extensive attention. In this study, an adaptive parameter selection method based on Kullback−Leibler divergence is designed to fully extract the potential information of data. The grey wolf optimization based on reverse learning is used for prediction optimization, identifying historical data, processing dynamic information, and improving the accuracy of the model. In interval prediction, an interval prediction method combining empirical error, quantile statistics, and Markov Chain Monte Carlo is creatively proposed to generate a large number of independent error cases, and form a series of interval predictions with given confidence according to the quantile of random simulation results. Taking wind speed forecasting as an example, it is verified that the method proposed in this article has good performance. Using interval analysis to quantify the volatility and randomness can provide new ideas for load forecasting in power system and renewable energy output forecasting. [ABSTRACT FROM AUTHOR]

RRAM-based in-memory computing (IMC) effectively accelerates deep neural networks (DNNs). Furthermore, model compression techniques, such as quantization and pruning, are necessary to improve algorithm mapping and hardware performance. However, in the presence of RRAM device variations, low-precision and sparse DNNs suffer from severe post-mapping accuracy loss. To address this, in this work, we investigate a new metric, model stability, from the loss landscape to help shed light on accuracy loss under variations and model compression, which guides an algorithmic solution to maximize model stability and mitigate accuracy loss. Based on statistical data from a CMOS/RRAM 1T1R test chip at 65nm, we characterize wafer-level RRAM variations and develop a cross-layer benchmark tool that incorporates quantization, pruning, device variations, model stability, and IMC architecture parameters to assess post-mapping accuracy and hardware performance. Leveraging this tool, we show that a loss-landscape-based DNN model selection for stability effectively tolerates device variations and achieves a post-mapping accuracy higher than that with 50% lower RRAM variations. Moreover, we quantitatively interpret why model pruning increases the sensitivity to variations, while a lower-precision model has better tolerance to variations. Finally, we propose a novel variation-aware training method to improve model stability, in which there exists the most stable model for the best post-mapping accuracy of compressed DNNs. Experimental evaluation of the method shows up to 19%, 21%, and 11% post-mapping accuracy improvement for our 65nm RRAM device, across various precision and sparsity, on CIFAR-10, CIFAR-100, and SVHN datasets, respectively. [ABSTRACT FROM AUTHOR]

We study the problem of estimating the total number of searches (volume) of queries in a specific domain, which were submitted to a search engine in a given time period. Our statistical model assumes that the distribution of searches follows a Zipf’s law, and that the observed sample volumes are biased accordingly to three possible scenarios. These assumptions are consistent with empirical data, with keyword research practices, and with approximate algorithms used to take counts of query frequencies. A few estimators of the parameters of the distribution are devised and experimented, based on the nature of the empirical/simulated data. For continuous data, we recommend using nonlinear least square regression (NLS) on the top-volume queries, where the bound on the volume is obtained from the well-known Clauset, Shalizi and Newman (CSN) estimation of power-law parameters. For binned data, we propose using a Chi-square minimization approach restricted to the top-volume queries, where the bound is obtained by the binned version of the CSN method. Estimations are then derived for the total number of queries and for the total volume of the population, including statistical error bounds. We apply the methods on the domain of recipes and cooking queries searched in Italian in 2017. The observed volumes of sample queries are collected from Google Trends (continuous data) and SearchVolume (binned data). The estimated total number of queries and total volume are computed for the two cases, and the results are compared and discussed. [ABSTRACT FROM AUTHOR]

Triangle count is a critical parameter in mining relationships among people in social networks. However, directly publishing the findings obtained from triangle counts may bring potential privacy concern, which raises great challenges and opportunities for privacy-preserving triangle counting. In this paper, we choose to use differential privacy to protect triangle counting for large scale graphs. To reduce the large sensitivity caused in large graphs, we propose a novel graph projection method that can be used to obtain an upper bound for sensitivity in different distributions. In particular, we publish the triangle counts satisfying the node-differential privacy with two kinds of histograms: the triangle count distribution and the cumulative distribution. Moreover, we extend the research on privacy preserving triangle counting to one of its applications, the local clustering coefficient. Experimental results show that the cumulative distribution can fit the real statistical information better, and our proposed mechanism has achieved better accuracy for triangle counts while maintaining the requirement of differential privacy. [ABSTRACT FROM AUTHOR]

This article proposes an adaptive human pilot model that is able to mimic the crossover model in the presence of uncertainties. The proposed structure is based on the model reference adaptive control, and the adaptive laws are obtained using the Lyapunov–Krasovskii stability criteria. The model can be employed for human-in-the-loop stability and performance analyses incorporating different types of controllers and plant types. For validation purposes, an experimental setup is employed to collect data and a statistical analysis is conducted to measure the predictive power of the pilot model. [ABSTRACT FROM AUTHOR]

To fight against infectious diseases (e.g., SARS, COVID-19, Ebola, etc.), government agencies, technology companies and health institutes have launched various contact tracing approaches to identify and notify the people exposed to infection sources. However, existing tracing approaches can lead to severe privacy and security concerns, thereby preventing their secure and widespread use among communities. To tackle these problems, this paper proposes CoAvoid, an edge-based, privacy-preserved contact tracing system that features good dependability and usability. CoAvoid leverages the Google/Apple Exposure Notification (GAEN) API to achieve decent device compatibility and operating efficiency. It utilizes Bluetooth Low Energy (BLE) to detect close contact with other people and leverages GPS with fine-grained matching algorithms to verify user information. In addition, to enhance privacy protection, CoAvoid applies fuzzification and obfuscation measures to shelter sensitive data, making both servers and users agnostic to information of both low and high-risk populations. The evaluation demonstrates good efficacy and security of CoAvoid. Compared with four state-of-the-art contact tracing applications, CoAvoid can reduce the size of upload data by at least 90% and reduce the verification time by 92%. More importantly, CoAvoid can preserve user privacy and resist replay and wormhole attacks in all analysis scenarios. [ABSTRACT FROM AUTHOR]

Extracted driving behavior of human driven vehicles can benefit the development of various applications like trajectory prediction or planning, abnormal driving detection, driving behavior classification, traffic simulation modeling, etc. In this paper, we focus on modeling human driving behavior in order to find simplifications for trajectory planning. Using a time-discrete kinematic bicycle model with the vehicle’s acceleration and steering rate as inputs, we model the human driven trajectories of an urban intersection drone dataset for different input sampling times. While most planning algorithms are using input sampling times below 0.33s, we are able to model 98.2% of the human driven trajectories of the investigated dataset with a sampling time of 0.6s. Using longer input sampling times can result in smoother trajectories and longer planning horizons, and thus more efficient trajectories. In a next step, we analyze the correlations between the input of our model and the current state/last input. Such a priori knowledge could simplify common planning algorithms like model predictive control or tree-search based planners by limiting the action space of the ego-vehicle. We propose nonlinear transformations for steering rate and steering angle to represent correlations between speed, acceleration, steering angle and steering rate. In the transformed space the statistics are very well modeled by multivariate Gaussian distributions. Using a multivariate Gaussian, a fast usable behavior model is extracted which is independent of the environment. [ABSTRACT FROM AUTHOR]

The Building Security in Maturity Model survey has been tracking software security activity adoption in 211 companies over 12 years. This article explores how organizations should adapt to the latest security challenges. [ABSTRACT FROM AUTHOR]

A cornerstone of clinical medicine is intervening on a continuous exposure, such as titrating the dosage of a pharmaceutical or controlling a laboratory result. In clinical trials, continuous exposures are dichotomized into narrow ranges, excluding large portions of the realistic treatment scenarios. The existing computational methods for estimating the effect of continuous exposure rely on a set of strict assumptions. We introduce new methods that are more robust towards violations of these assumptions. Our methods are based on the key observation that changes of exposure in the clinical setting are often achieved gradually, so effect estimates must be “locally” robust in narrower exposure ranges. We compared our methods with several existing methods on three simulated studies with increasing complexity. We also applied the methods to data from 14 k sepsis patients at M Health Fairview to estimate the effect of antibiotic administration latency on prolonged hospital stay. The proposed methods achieve good performance in all simulation studies. When the assumptions were violated, the proposed methods had estimation errors of one half to one fifth of the state-of-the-art methods. Applying our methods to the sepsis cohort resulted in effect estimates consistent with clinical knowledge. [ABSTRACT FROM AUTHOR]

Experimental demonstration of superdirectivity and superscattering phenomena is among the long-standing challenges in electromagnetic theory. Efficient computational algorithms can contribute to this endeavor by suggesting new designs bypassing commonly accepted limitations. Here, we demonstrate a rectangular wire bundle superscatterer designed using a stochastic optimization algorithm. The structure encompassing wires of different lengths demonstrates superior scattering capabilities, bypassing the single channel dipole limit by an order of magnitude. The subwavelength wire bundle supports several resonant higher-order multipoles, which constructively contribute to the scattering, as we demonstrate experimentally. A new generation of genetically designed superscatterers may be used in a range of wireless applications, including point-to-point communications, smart beacons, and radar targets. [ABSTRACT FROM AUTHOR]

This article addresses the dynamic vehicle routing problem (DVRP). DVRP is a challenging variation of the classic vehicle routing problem in which some customers are not known in advance. The objective is to incorporate new customers into the schedule as they become known while still attempting to minimize the cost of serving all customers without violating the problem constraints. This work proposes an effective population-based approach that integrates various algorithmic components to address DVRP. The approach combines a local search algorithm with various evolutionary operators (crossover and mutation) in an adaptive manner. To promote diversity, the proposed approach utilizes a population of solutions and uses a quality-and-diversity strategy to retain only promising solutions. The well-known 21 DVRP benchmark instances are utilized to test the performance of the proposed approach. An experimental comparison is carried out to assess the contribution of the integrated components. Results demonstrate that the integrated components significantly improve search performance. It is also shown that the proposed approach produces new best results for several instances when compared with the best methods reported in the literature. Note to Practitioners—This work deals with dynamic vehicle routing problems (DVRPs). In DVRP, only limited information is available at the start, and new information is revealed over time. It proposes an effective hybrid approach to tackle this problem. The proposed approach combines evolutionary operators and a local search approach in an adaptive manner to exploit the benefits of each algorithmic component. The proposed approach produces several new best-known solutions. The experimental results demonstrate that the proposed approach is very effective in dealing with DVRP and can help decision-makers in designing best-routing solutions. [ABSTRACT FROM AUTHOR]

This article takes a step to provide humanoid robots with adaptive morphology abilities. We present a systematic approach for enabling robotic covers to morph their shape, with an overall size fitting the anthropometric dimensions of a humanoid robot. More precisely, we present a cover concept consisting of two main components: a skeleton, which is a repetition of a basic element called node, and a soft membrane, which encloses the cover and deforms with its motion. This article focuses on the cover skeleton and addresses the challenging problems of node design, system modeling, motor positioning, and control design of the morphing system. The cover modeling focuses on kinematics, and a systematic approach for defining the system kinematic constraints is presented. Then, we apply genetic algorithms to find the motor locations so that the morphing cover is fully actuated. Finally, we present control algorithms that allow the cover to morph into a time-varying shape. The entire approach is validated by performing kinematic simulations with four different covers of square dimensions and having $3\times 3$ , $4\times 8$ , $8\times 8$ , and $20\times 20$ nodes, respectively. For each cover, we apply the genetic algorithms to choose the motor locations and perform simulations for tracking a desired shape. The simulation results show that the presented approach ensures the covers to track a desired shape with good tracking performances. [ABSTRACT FROM AUTHOR]

We study generalization under labeled shift for categorical and general normed label spaces. We propose a series of methods to estimate the importance weights from labeled source to unlabeled target domain and provide confidence bounds for these estimators. We deploy these estimators and provide generalization bounds in the unlabeled target domain. [ABSTRACT FROM AUTHOR]

The foundational assumption of machine learning is that the data under consideration is separable into classes; while intuitively reasonable, separability constraints have proven remarkably difficult to formulate mathematically. We believe this problem is rooted in the mismatch between existing statistical techniques and commonly encountered data; object representations are typically high dimensional but statistical techniques tend to treat high dimensions a degenerate case. To address this problem, we develop a dedicated statistical framework for machine learning in high dimensions. The framework derives from the observation that object relations form a natural hierarchy; this leads us to model objects as instances of a high dimensional, hierarchal generative processes. Using a distance based statistical technique, also developed in this paper, we show that in such generative processes, instances of each process in the hierarchy, are almost-always encapsulated by a distinctive-shell that excludes almost-all other instances. The result is shell theory, a statistical machine learning framework in which separability constraints (distinctive-shells) are formally derived from the assumed generative process. [ABSTRACT FROM AUTHOR]

An effective electromagnetic interference (EMI) source reconstruction method based on dynamic differential evolution (DDE) is proposed in this article. In this method, an unknown EMI source is represented by an equivalent dipole array by using the scanned phaseless magnetic near fields. Different from the conventional differential evolution (CDE) method, DDE individually updates every equivalent dipole instead of the whole dipole array for each iteration. It converges faster and takes less computing time than CDE. The equivalent dipole model reconstructed by DDE can thereafter predict the near field and 3-m far field efficiently. The results of numerical and measurement examples have verified the effectiveness and robustness of the proposed method. [ABSTRACT FROM AUTHOR]

Uncertainties in power system studies are typically managed by Monte Carlo methods or by applying some worst case assumptions. As the number ofuncertainties increases, there is a need for methods that can estimate statistical parameters from a limited number of calculations. This paper utilizes a method called the Unscented Transform together with Cornish-Fisher expansion to estimate the 2%-value of switching overvoltages using only about one tenth the number of calculations as a Monte Carlo method, with similar accuracy. The uncertainties considered are the energizing instants of the three phases. The method is illustrated through EMT simulations in PSCAD and it is shown to provide a good approximation of the 2%-value in most of the studied cases. [ABSTRACT FROM AUTHOR]

Disasters and the resulting emergencies are increasingly presenting situations where tele-communications infrastructure (e.g., functioning base stations) is often compromised, leading to diminished network capacity. In these situations, providing trapped populations in isolated areas with network access to be able to communicate with rescue and recovery personnel or volunteer teams is critical. Further, when network capacity is diminished, it is essential that mobile network users be alerted to “comply” and not overload the network with non-essential bandwidth-intensive traffic unrelated to the emergency unfolding. While the current evolution of the Integrated Public Alert and Warning System (IPAWS) is able to generate and disseminate such emergency alerts, there has been no analysis or evaluation of the effectiveness of such alerts as well as the design of mechanisms that can ensure such compliance to prevent network outage. In this work, we present a framework for Cognitive Public Alerts to Wireless Subscribers (CPAWS) that is able to predict and prevent mobile network overload/outage during emergencies using a mix of behavioral studies and machine learning tools that consider real-time monitoring information of the environmental status, network situation, and user compliance. Specifically, we study the efficacy of wireless emergency alerts (WEAs) in terms of saving network bandwidth by using surveys on Amazon MTurk to test the effectiveness of seven designed WEAs on reducing users' non-essential traffic across 12 designated cell phone applications. Additionally, we design complementary access and alert control strategies to ensure that the network load remains below the diminished available capacity during emergencies. CPAWS is also backward-compatible since it extends IPAWS by adding a feedback loop for real-time monitoring and control. [ABSTRACT FROM AUTHOR]

Causal classification concerns the estimation of the net effect of a treatment on an outcome of interest at the instance level, i.e., of the individual treatment effect (ITE). For binary treatment and outcome variables, causal classification models produce ITE estimates that essentially allow one to rank instances from a large positive effect to a large negative effect. Often, as in uplift modeling (UM), one is merely interested in this ranking, rather than in the ITE estimates themselves. In this regard, we investigate the potential of learning to rank (L2R) techniques to learn a ranking of the instances directly. We propose a unified formalization of different binary causal classification performance measures from the UM literature and explore how these can be integrated into the L2R framework. Additionally, we introduce a new metric for UM with L2R called the promoted cumulative gain (PCG). We employ the L2R technique LambdaMART to optimize the ranking according to PCG and show improved results over the use of standard L2R metrics and equal to improved results when compared with state-of-the-art UM. Finally, we show how L2R techniques can be used to specifically optimize for the top- $k$ k fraction of the ranking in a UM context, however, these results do not generalize to the test set. [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]

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]

In many cities, subways are expanding with new or extended lines being built and put into operations. The prediction of future travel demand in subway with the planned expansion is of significant importance because such information is crucial for new line planning and new network operations. In this study, we identify the determinant features from potential influential factors of passenger travel demand and develop a two-step model for predicting passenger travel demand in expanding subways. The proposed model is tested in an actual subway with a new line being put into operations, and achieves higher prediction accuracy than the benchmark models. [ABSTRACT FROM AUTHOR]

Agent-based microsimulation has become the standard to analyze intelligent transportation systems, using disaggregate travel demand data for entire populations, data that are not typically readily available. Population synthesis approaches are thus needed. We present Composite Travel Generative Adversarial Network (CTGAN), a novel deep generative model to estimate the underlying joint distribution of a population, that is capable of reconstructing composite synthetic agents having tabular (e.g. age and sex) as well as sequential mobility data (e.g. trip trajectory and sequence). The CTGAN model is compared with other recently proposed methods such as the Variational Autoencoders (VAE) method, which has shown success in high dimensional tabular population synthesis. We evaluate the performance of the synthesized outputs based on distribution similarity, multi-variate correlations and spatio-temporal metrics. The results show the consistent and accurate generation of synthetic populations and their tabular and spatially sequential attributes, generated over varying spatial scales and dimensions. [ABSTRACT FROM AUTHOR]

Nonverbal vocalizations from non- and minimally speaking individuals who speak fewer than 20 words (mv* individuals) convey important communicative and affective information. While nonverbal vocalizations that occur amidst typical speech and infant vocalizations have been studied extensively in the literature, there is limited prior work on vocalizations by mv* individuals. Our work is among the first studies of the communicative and affective information expressed in nonverbal vocalizations by mv* children and adults. We collected labeled vocalizations in real-world settings with eight mv* communicators, with communicative and affective labels provided in-the-moment by a close family member. Using evaluation strategies suitable for messy, real-world data, we show that nonverbal vocalizations can be classified by function (with 4- and 5-way classifications) with F1 scores above chance for all participants. We analyze labeling and data collection practices for each participating family, and discuss the classification results in the context of our novel real-world data collection protocol. The presented work includes results from the largest classification experiments with nonverbal vocalizations from mv* communicators to date. [ABSTRACT FROM AUTHOR]

A novel differential evolution optimization method named K-means-based multigroup differential evolution (KMGDE) framework is proposed for multiple-input–multiple-output (MIMO) antenna design. The KMGDE algorithm divides the population into three groups using the K-means clustering method in each iteration. Different mutation strategies are assigned for each group according to its average fitness value. The groups are then combined for crossover operation with an adaptive crossover rate value to balance local search and global search. The fitness function considering the characteristics of the MIMO antenna is proposed to speed up optimization. The performance of the proposed method is evaluated and compared with six state-of-the-art optimization algorithms using an MIMO antenna example. The optimization results and the experimental results show that the proposed KMGDE algorithm has a faster convergence than state-of-the-art optimization algorithms, which significantly improves the efficiency of MIMO antenna design. [ABSTRACT FROM AUTHOR]

This article surveys the interdisciplinary research of neuroscience, network science, and dynamic systems, with emphasis on the emergence of brain-inspired intelligence. To replicate brain intelligence, a practical way is to reconstruct cortical networks with dynamic activities that nourish the brain functions, instead of using only artificial computing networks. The survey provides a complex network and spatiotemporal dynamics (abbr. network dynamics) perspective for understanding the brain and cortical networks and, furthermore, develops integrated approaches of neuroscience and network dynamics toward building brain-inspired intelligence with learning and resilience functions. Presented are fundamental concepts and principles of complex networks, neuroscience, and hybrid dynamic systems, as well as relevant studies about the brain and intelligence. Other promising research directions, such as brain science, data science, quantum information science, and machine behavior are also briefly discussed toward future applications. [ABSTRACT FROM AUTHOR]

Constrained multiobjective optimization problems (CMOPs) involve both conflicting objective functions and various constraints. Due to the presence of constraints, CMOPs’ Pareto-optimal solutions are very likely lying on constraint boundaries. The experience from the constrained single-objective optimization has shown that to quickly obtain such an optimal solution, the search should surround the boundary of the feasible region from both the feasible and infeasible sides. In this article, we extend this idea to cope with CMOPs and, accordingly, we propose a novel constrained multiobjective evolutionary algorithm with bidirectional coevolution, called BiCo. BiCo maintains two populations, that is: 1) the main population and 2) the archive population. To update the main population, the constraint-domination principle is equipped with an NSGA-II variant to move the population into the feasible region and then to guide the population toward the Pareto front (PF) from the feasible side of the search space. While for updating the archive population, a nondominated sorting procedure and an angle-based selection scheme are conducted in sequence to drive the population toward the PF within the infeasible region while maintaining good diversity. As a result, BiCo can get close to the PF from two complementary directions. In addition, to coordinate the interaction between the main and archive populations, in BiCo, a restricted mating selection mechanism is developed to choose appropriate mating parents. Comprehensive experiments have been conducted on three sets of CMOP benchmark functions and six real-world CMOPs. The experimental results suggest that BiCo can obtain quite competitive performance in comparison to eight state-of-the-art-constrained multiobjective evolutionary optimizers. [ABSTRACT FROM AUTHOR]

Evolutionary multitask learning has achieved great success due to its ability to handle multiple tasks simultaneously. However, it is rarely used in the hyperheuristic domain, which aims at generating a heuristic for a class of problems rather than solving one specific problem. The existing multitask hyperheuristic studies only focus on heuristic selection, which is not applicable to heuristic generation. To fill the gap, we propose a novel multitask generative hyperheuristic approach based on genetic programming (GP) in this article. Specifically, we introduce the idea in evolutionary multitask learning to GP hyperheuristics with a suitable evolutionary framework and individual selection pressure. In addition, an origin-based offspring reservation strategy is developed to maintain the quality of individuals for each task. To verify the effectiveness of the proposed approach, comprehensive empirical studies have been conducted on the homogeneous and heterogeneous multitask dynamic flexible job shop scheduling. The results show that the proposed algorithm can significantly improve the quality of scheduling heuristics for each task in all the examined scenarios. In addition, the evolved scheduling heuristics verify the mutual help among the tasks in a multitask scenario. [ABSTRACT FROM AUTHOR]

In offline data-driven multiobjective optimization, no new data are available during the optimization process. Approximation models, also known as surrogates, are built using the provided offline data. A multiobjective evolutionary algorithm can be utilized to find solutions by using these surrogates. The accuracy of the approximated solutions depends on the surrogates and approximations typically involve uncertainties. In this article, we propose probabilistic selection approaches that utilize the uncertainty information of the Kriging models (as surrogates) to improve the solution process in offline data-driven multiobjective optimization. These approaches are designed for decomposition-based multiobjective evolutionary algorithms and can, thus, handle a large number of objectives. The proposed approaches were tested on distance-based visualizable test problems and the DTLZ suite. The proposed approaches produced solutions with a greater hypervolume, and a lower root mean squared error compared to generic approaches and a transfer learning approach that do not use uncertainty information. [ABSTRACT FROM AUTHOR]

Handling nonlinear constraints in continuous optimization is challenging, and finding a feasible solution is usually a difficult task. In the past few decades, various techniques have been developed to deal with linear and nonlinear constraints. However, reaching feasible solutions has been a challenging task for most of these methods. In this article, we adopt the framework of estimation of distribution algorithms (EDAs) and propose a new algorithm (EDA++) equipped with some mechanisms to deal with nonlinear constraints. These mechanisms are associated with different stages of the EDA, including seeding, learning, and mapping. It is shown that, besides increasing the quality of the solutions in terms of objective values, the feasibility of the final solutions is guaranteed if an initial population of feasible solutions is seeded to the algorithm. The EDA with the proposed mechanisms is applied to two suites of benchmark problems for constrained continuous optimization and its performance is compared with some state-of-the-art algorithms and constraint-handling methods. Conducted experiments confirm the speed, robustness, and efficiency of the proposed algorithm in tackling various problems with linear and nonlinear constraints. [ABSTRACT FROM AUTHOR]

Quality-diversity (QD) algorithms evolve behaviorally diverse and high-performing solutions. To illuminate the elite solutions for a space of behaviors, QD algorithms require the definition of a suitable behavior space. If the behavior space is high-dimensional, a suitable dimensionality reduction technique is required to maintain a limited number of behavioral niches. While current methodologies for automated behavior spaces focus on changing the geometry of the behavior space or on unsupervised learning of its key features, there remains a need for customizing behavioral diversity to a particular meta-objective specified by the end user. In the newly emerging framework of QD Meta-Evolution, or QD-Meta for short, one evolves a population of QD algorithms, each with different algorithmic and representational characteristics, to optimize the algorithms and their resulting archives to a user-defined meta-objective. Despite promising results compared to traditional QD algorithms, QD-Meta has yet to be compared to state-of-the-art behavior space automation methods, such as centroidal voronoi tessellations multidimensional archive of phenotypic elites (CVT-MAP-Elites) and autonomous robots realizing their abilities (AURORAs). This article performs an empirical study of QD-Meta on function optimization and multilegged robot locomotion benchmarks. Results demonstrate that QD-Meta archives provide improved average performance and faster adaptation to a priori unknown changes to the environment when compared to CVT-MAP-Elites and AURORA. A qualitative analysis shows how the resulting archives are tailored to the meta-objectives provided by the end user. [ABSTRACT FROM AUTHOR]

This article is the second part of a two-part survey series on large-scale global optimization. The first part covered two major algorithmic approaches to large-scale optimization, namely, decomposition methods and hybridization methods, such as memetic algorithms and local search. In this part, we focus on sampling and variation operators, approximation and surrogate modeling, initialization methods, and parallelization. We also cover a range of problem areas in relation to large-scale global optimization, such as multiobjective optimization, constraint handling, overlapping components, the component imbalance issue and benchmarks, and applications. The article also includes a discussion on pitfalls and challenges of the current research and identifies several potential areas of future research. [ABSTRACT FROM AUTHOR]

Multiobjective evolutionary algorithms (EAs) based on decomposition are becoming successful and popular. Particularly, a conical area EA (CAEA) was developed to heighten the convergence and population diversity of decomposition-based algorithms for bi-objective optimization by employing a cone decomposition approach. The global Pareto optimality of cone decomposition was proved. It means that the optimum of every conical subproblem of the cone decomposition approach is Pareto optimal in the entire bi-objective space in the presence of a continuous frontier segment within its associated subregion. In this article, based on the global Pareto optimality, we further reveal that the cone decomposition approach also has a desired ability of $\mu $ -distribution convergence for bi-objective optimization. We first prove by the monotonicity and additivity of the Lebesgue measure and the squeeze theorem for limits that the hypervolume of the optimal solutions of all $\mu $ subproblems of the cone decomposition approach is infinitely close to that of the optimal $\mu $ -distribution for large enough $\mu $ in the presence of a continuous frontier. Meanwhile, the original CAEA is further improved to better approximate the optimal solutions of conical subproblems. The experimental results on bi-objective benchmark problems show that the improved CAEA achieves higher qualities of frontiers and better $\mu $ -distribution convergence in the terms of hypervolume error compared with six other popular multiobjective algorithms. [ABSTRACT FROM AUTHOR]

We present techniques for improving the efficiency of ND-trees in the solution of the dynamic nondominance problem, i.e., for building and maintaining a Pareto archive. We propose algorithms for (re)building a tree from a set of nondominated points, either as a space-partitioned ND-tree or by a clustering approach. Numerical experiments confirm that rebuilding the tree at intervals, combined with modified strategies for updating the lower and upper bounds in each node and for computing the distances of points to subtrees in between the rebuilds, can lead to significant speedups over using plain ND-tree-based updates throughout, in particular for higher dimensions. [ABSTRACT FROM AUTHOR]

Matrix operation is easy to be paralleled by hardware, and the memristor network can realize a parallel matrix computing model with in-memory computing. This article proposes a matrix-friendly genetic algorithm (MGA), in which the population is represented by a matrix and the evolution of population is realized by matrix operations. Compared with the performance of a baseline genetic algorithm (GA) on solving the maximum value of the binary function, MGA can converge better and faster. In addition, MGA is more efficient because of its parallelism on matrix operations, and MGA runs 2.5 times faster than the baseline GA when using the NumPy library. Considering the advantages of the memristor in matrix operations, memristor circuits are designed for the deployment of MGA. This deployment method realizes the parallelization and in-memory computing (memristor is both memory and computing unit) of MGA. In order to verify the effectiveness of this deployment, a feature selection experiment of logistic regression (LR) on Sonar datasets is completed. LR with MGA-based feature selection uses 46 fewer features and achieves 11.9% higher accuracy. [ABSTRACT FROM AUTHOR]

We introduce an evolutionary algorithm called recombinator- $k$ -means for optimizing the highly nonconvex kmeans problem. Its defining feature is that its crossover step involves all the members of the current generation, stochastically recombining them with a repurposed variant of the $k$ -means++ seeding algorithm. The recombination also uses a reweighting mechanism that realizes a progressively sharper stochastic selection policy and ensures that the population eventually coalesces into a single solution. We compare this scheme with a state-of-the-art alternative, a more standard genetic algorithm with deterministic pairwise-nearest-neighbor crossover and an elitist selection policy, of which we also provide an augmented and efficient implementation. Extensive tests on large and challenging datasets (both synthetic and real word) show that for fixed population sizes recombinator- $k$ -means is generally superior in terms of the optimization objective, at the cost of a more expensive crossover step. When adjusting the population sizes of the two algorithms to match their running times, we find that for short times the (augmented) pairwise-nearest-neighbor method is always superior, while at longer times recombinator- $k$ -means will match it and, on the most difficult examples, take over. We conclude that the reweighted whole-population recombination is more costly but generally better at escaping local minima. Moreover, it is algorithmically simpler and more general (it could be applied even to $k$ -medians or $k$ -medoids, for example). Our implementations are publicly available at https://github.com/carlobaldassi/RecombinatorKMeans.jl. [ABSTRACT FROM AUTHOR]

Dynamic multiobjective optimization problems (DMOPs) aim to optimize multiple (often conflicting) objectives that are changing over time. Recently, there are a number of promising algorithms proposed based on transfer learning methods to solve DMOPs. However, it is very challenging to reduce the negative effect in transfer learning and find more effective transferred solutions. To fill this research gap, this article proposes a clustering-based transfer (CBT) learning method to solve DMOPs. When the environment changes, two novel operations (clustering-based selection (CBS) and CBT) are used to guide knowledge transfer. Specifically, CBS aims to find a population with nondominated solutions and dominated solutions as the training data for the new environment. Then, CBT further collects the previous Pareto-optimal solutions and some noise solutions as the training data for the previous environment. Two training data sets from different environments are, respectively, divided into multiple clusters and transfer learning is conducted on two similar clusters with high probability to reduce the negative effect, which can train an accurate prediction model to identify the promising solutions for the new environment. Empirical studies have been conducted on 14 benchmark DMOPs and one real-life path planning problem of unmanned air/ground vehicles, which validate the effectiveness of our proposed method. Especially, our method can significantly reduce negative transfer on 12 out of 14 cases when compared with direct transfer learning. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms (EAs) possess strong problem-solving abilities and have been applied in a wide range of applications. However, they still suffer from a high computational burden and poor generalization ability. To overcome the limitations, numerous studies consider conducting knowledge extraction across distinct optimization task domains. Among these research strands, one representative tributary is evolutionary multitask optimization (EMTO) that aims to resolve multiple optimization tasks simultaneously. The underlying attribute of implicit parallelism for EAs can well incorporate with the framework of EMTO, giving rise to the ascending EMTO studies. This review is intended to present a detailed exposition on the research in the EMTO area. We reveal the core components for designing the EMTO algorithms. Subsequently, we organize the works lying in the fusions between EMTO and traditional EAs. By analyzing the associations for diverse strategies in different branches of EMTO, this review uncovers the research trends and the potentially important directions, with additional interesting real-world applications mentioned. [ABSTRACT FROM AUTHOR]

Dynamic multiobjective optimization problem (DMOP) denotes the multiobjective optimization problem which varies over time. As changes in DMOP may exist some patterns that are predictable, to solve DMOP, a number of research efforts have been made to develop evolutionary search with prediction approaches to estimate the changes of the problem. A common practice of existing prediction approaches is to predict the change of Pareto-optimal solutions (POS) based on the historical solutions obtained in the decision space. However, the change of a DMOP may occur in both decision and objective spaces. Prediction only in the decision space thus may not be able to give the proper estimation of the problem change. Taking this cue, in this article, we propose an evolutionary search with multiview prediction for solving DMOP. In contrast to existing prediction methods, the proposed approach conducts prediction from the views of both decision and objective spaces. To estimate dynamic changes in DMOP, a kernelized autoencoding model is derived to perform the multiview prediction in a reproducing kernel Hilbert space (RKHS), which holds a closed-form solution. To examine the performance of the proposed method, comprehensive empirical studies on the commonly used DMOP benchmarks, as well as a real-world case study on the movie recommendation problem, are presented. The obtained experimental results verified the efficacy of the proposed method for solving both benchmark and real-world DMOPs. [ABSTRACT FROM AUTHOR]

In addition to the search for feasible solutions, the utilization of informative infeasible solutions is important for solving constrained multiobjective optimization problems (CMOPs). However, most of the existing constrained multiobjective evolutionary algorithms (CMOEAs) cannot effectively explore and exploit those solutions and, therefore, exhibit poor performance when facing problems with large infeasible regions. To address the issue, this article proposes a novel method, called DD-CMOEA, which features dual stages (i.e., exploration and exploitation) and dual populations. Specifically, the two populations, called mainPop and auxPop, first individually evolve with and without considering the constraints, responsible for exploring feasible and infeasible solutions, respectively. Then, in the exploitation stage, mainPop provides information about the location of feasible regions, which facilitates auxPop to find and exploit surrounding infeasible solutions. The promising infeasible solutions obtained by auxPop in turn help mainPop converge better toward the Pareto-optimal front. Extensive experiments on three well-known test suites and a real-world case study fully demonstrate that DD-CMOEA is more competitive than five state-of-the-art CMOEAs. [ABSTRACT FROM AUTHOR]

This article presents a hybrid metaheuristic optimization algorithm that combines particle filter (PF) and particle swarm optimization (PSO) algorithms. The new PF–PSO algorithm consists of two steps: the first generates randomly the particle population;and the second zooms the search domain. An application of this algorithm to the optimal tuning of proportional-integral-fuzzy controllers for the position control of a family of integral-type servo systems is then presented as a second contribution. The reduction in PF–PSO algorithm's cost function allows for reduced energy consumption of the fuzzy control system. A comparison with other metaheuristic algorithms on canonical test functions and experimental results are presented at the end of this article. [ABSTRACT FROM AUTHOR]

Few-mode erbium-doped fiber amplifier (FM-EDFA) is a key device to achieve power compensation in long-haul mode division multiplexing (MDM) optical system. The gain characteristics of FM-EDFA are related to the number of modes and multiplexing mode selection. In this paper, the gain characteristics of four modes and six modes FM-EDFA with various mode combinations and different wavelengths are analyzed in single and dual-pump cases. The results show that when the azimuthal-dependent pump is selected, different degenerate mode (odd and even mode) multiplexing will arise DMG. In the replacement of different degenerate modes at the same modal order, the DMG of signal modes LP11o,s and LP21o,s is 1 dB (single-pump: LP01,p) while the DMG between signal modes LP11e,s and LP21e,s is 8 dB (dual-pump: LP01,p+LP11e,p). Compared with single-wavelength amplification, both the overall gain and the DMG decrease in the multi-wavelength case. The above conclusions can provide a theoretical basis for the selection of FM-EDFA in the wavelength division multiplexing (WDM)-MDM system. [ABSTRACT FROM AUTHOR]

E-learning is an evolutionary concept, not a revolutionary concept since it has been introduced and practiced in previous decades as well. The current research paper contributes to educational research based on the investigation of holistic perspectives of the ongoing online teaching activities during the lockdown period. The article is built on a literature review. The methodologies are described and the results are presented. There have been research on distant learning and digitalization, but mostly in terms of potential, obstacles, and student assessments, as well as their influence on education. There are no empirical research on the worldwide trend of how employees utilize e-learning resources to determine instructors’ interest in and attitudes about using them. This chasm is also regarded a new angle of empirical research that uses the Chi-square test of independence to find patterns. The present research aims to build a realistic instrument that can assess instructors’ attitudes about e-learning during COVID-19 with this purpose in mind.The paper consists of two parts: a literature review and statistical analysis. The research was conducted by means of a diagnostic opinion CAWI (Computer Assisted Web Interview) questionnaire and statistical analysis. This study was conducted among 342 teachers working in various universities located in the following countries: Poland, Pakistan, Iraq, USA, UK, Germany, and Austria. The questionnaire consisted of 20 questions. The researchers provided a detailed overview of e-learning practices during the pandemic and its future prospects from the teacher’s point of view. The goals of this article and the research problems are to learn about the worldwide trend of how employees utilize e-learning resources, to identify teachers’ interests in and attitudes towards using e-learning resources throughout the globe, and to recommend opportunities for workers to use e-learning resources around the world, which is a very important issue, especially in the era of globalization, society 5.0, and industry 4.0. The authors also proposed a Chi-square statistical analysis to check whether there exists a relationship between two variables based on which the hypotheses were formulated. The results of the study clearly show that the respondents approach to e-learning was very responsible because they realized that it was up to them to properly convey knowledge. The results of empirical research show that the digitalization of education is no longer a future trend, but today’s trend or even a university standard in the education improvement direction.

This paper applies the principles of distribution locational marginal pricing (DLMP) to unbalanced three-phase distribution networks. We first propose a linear model for AC optimal power flow derived through a series of approximation and reformulation techniques. Then a scenario-generation algorithm is proposed to properly model the uncertain parameters in the linear model. Through a proposed No U-Turn sampler (NUTS) based algorithm, probability density functions (PDFs) of DLMPs are calculated. These PDFs provide statistical information about the locational and temporal price risks. By means of applications to two IEEE unbalanced test networks, the numerical results show promising performance for the proposed linear model and the NUTS-based algorithm in creating PDFs of DLMPs. DLMP price densities will be increasingly useful as distribution system operators seek flexible, low risk solutions from embedded generators and aggregators of distributed energy resources. [ABSTRACT FROM AUTHOR]

Long-term electricity consumption forecasting has been a hot issue due to its importance in power systems planning. Recently, system dynamics (SD) have been considered a potential method for electricity consumption forecasting. However, traditional SD methods are failed in forecasting future power systems toward low-carbon, due to the complex influencing factors and the simple SD model structure. In this study, a novel method combining SD and the ImPACT equation is proposed to solve the above problem. First, a new influencing factor system including emerging factors is established to consider the development of future power system. Subsequently, the ImPACT equation is employed to decompose the electricity consumption into four subsystems. By doing this, the linkage between factors and electricity consumption can be better revealed, which helps to improve the forecasting accuracy. Next, models for quantifying the correlation between subsystems and factors are established using SD. Finally, the proposed method is verified by forecasting the power consumption of China in the future year 2030 to 2050. Furthermore, various scenarios are set to analyze the changing trend of future power consumption by different influencing factors. The results of this article can provide important basic information for power supply and power grid planning. [ABSTRACT FROM AUTHOR]

With the abundance of data, machine learning applications engaged increased attention in the last decade. An attractive approach to robustify the statistical analysis is to preprocess the data through clustering. This paper develops a low-complexity Riemannian optimization framework for solving optimization problems on the set of positive semidefinite stochastic matrices. The low-complexity feature of the proposed algorithms stems from the factorization of the optimization variable $\mathbf {X}=\mathbf {Y}\mathbf {Y}^{\mathrm{T}}$ X = Y Y T and deriving conditions on the number of columns of $\mathbf {Y}$ Y under which the factorization yields a satisfactory solution. The paper further investigates the embedded and quotient geometries of the resulting Riemannian manifolds. In particular, the paper explicitly derives the tangent space, Riemannian gradients and Hessians, and a retraction operator allowing the design of efficient first and second-order optimization methods for the graph-based clustering applications of interest. The numerical results reveal that the resulting algorithms present a clear complexity advantage as compared with state-of-the-art euclidean and Riemannian approaches for graph clustering applications. [ABSTRACT FROM AUTHOR]

Online atlasing, i.e., incrementing an atlas with new images as they are acquired, is key when performing studies on very large, or still being gathered, databases. Regular approaches to atlasing however do not focus on this aspect and impose a complete reconstruction of the atlas when adding images. We propose instead a diffeomorphic online atlasing method that allows gradual updates to an atlas. In this iterative centroid approach, we integrate new subjects in the atlas in an iterative manner, gradually moving the centroid of the images towards its final position. This leads to a computationally cheap approach since it only necessitates one additional registration per new subject added. We validate our approach on several experiments with three main goals: 1- to evaluate atlas image quality of the obtained atlases with sharpness and overlap measures, 2- to assess the deviation in terms of transformations with respect to a conventional atlasing method and 3- to compare its computational time with regular approaches of the literature. We demonstrate that the transformations divergence with respect to a state-of-the-art atlas construction method is small and reaches a plateau, that the two construction methods have the same ability to map subject homologous regions onto a common space and produce images of equivalent quality. The computational time of our approach is also drastically reduced for regular updates. Finally, we also present a direct extension of our method to update spatio-temporal atlases, especially useful for developmental studies. [ABSTRACT FROM AUTHOR]

Objective: The bifurcation of neuronal firing is one of important nonlinear phenomena in the nervous system and is characterized by a significant change in the rate or temporal pattern of neuronal firing on responding to a small disturbance from external inputs. Previous studies have reported firing bifurcations for individual neurons, not for a population of neurons. We hypothesized that the integrated firing of a neuronal population could also show a bifurcation behavior that should be important in certain situations such as deep brain stimulations. The hypothesis was verified by experiments of rat hippocampus in vivo. Methods: Stimulation sequences of paired-pulses with two different inter-pulse-intervals (IPIs) or with two different pulse intensities were applied on the alveus of hippocampal CA1 region in anaesthetized rats. The amplitude and area of antidromic population spike (APS) were used as indices to evaluate the differences in the responses of neuronal population to the different pulses in stimulations. Results: During sustained paired-pulse stimulations with a high mean pulse frequency such as ∼130 Hz, a small difference of only a few percent in the two IPIs or in the two intensities was able to generate a sequence of evoked APSs with a substantial bifurcation in their amplitudes and areas. Conclusion: Small differences in the excitatory inputs can cause nonlinearly enlarged differences in the induced firing of neuronal populations. Significance: The novel dynamics and bifurcation of neuronal responses to electrical stimulations provide important clues for developing new paradigms to extend neural stimulations to treat more diseases. [ABSTRACT FROM AUTHOR]