Search

Multi-label probabilistic maps, a.k.a. probabilistic segmentations, parameterize a population of intimately co-existing anatomical shapes and are useful for various medical imaging applications, such as segmentation, anatomical atlases, shape analysis, and consensus generation. Existing methods to estimate probabilistic segmentations rely on ad hoc intermediate representations (e.g., average of Gaussian-smoothed label maps and smoothed signed distance maps) that do not necessarily conform to the underlying generative process. Generative modeling of such maps could help discover as well as aide in the statistical analysis of sub-groups in a population via clustering and mixture modeling techniques. In this paper, we propose an estimation of multi-label probabilistic maps and showcase their favorable performance for modeling anatomical shapes such as the left atrium of the human heart and brain structures. The proposed formulation relies on a constrained optimization in the natural parameter space of the exponential family form of categorical distributions. A smoothness prior provides generalizability in the model and helps achieve greater performance in modeling tasks for unseen samples. We demonstrate and compare the effectiveness of the proposed method for Bayesian image segmentation, multi-atlas segmentation, and shape-based clustering. [ABSTRACT FROM AUTHOR]

Large-scale optimization with high dimensionality and high computational cost becomes ubiquitous nowadays. To tackle such challenging problems efficiently, devising distributed evolutionary computation algorithms is imperative. To this end, this paper proposes a distributed swarm optimizer based on a special master–slave model. Specifically, in this distributed optimizer, the master is mainly responsible for communication with slaves, while each slave iterates a swarm to traverse the solution space. An asynchronous and adaptive communication strategy based on the request–response mechanism is especially devised to let the slaves communicate with the master efficiently. Particularly, the communication between the master and each slave is adaptively triggered during the iteration. To aid the slaves to search the space efficiently, an elite-guided learning strategy is especially designed via utilizing elite particles in the current swarm and historically best solutions found by different slaves to guide the update of particles. Together, this distributed optimizer asynchronously iterates multiple swarms to collaboratively seek the optimum in parallel. Extensive experiments on a widely used large-scale benchmark set substantiate that the distributed optimizer could: 1) achieve competitive effectiveness in terms of solution quality as compared to the state-of-the-art large-scale methods; 2) accelerate the execution of the algorithm in comparison with the sequential one and obtain almost linear speedup as the number of cores increases; and 3) preserve a good scalability to solve higher dimensional problems. [ABSTRACT FROM AUTHOR]

In many-objective optimization problems (MaOPs), forming sound tradeoffs between convergence and diversity for the environmental selection of evolutionary algorithms is a laborious task. In particular, strengthening the selection pressure of population toward the Pareto-optimal front becomes more challenging, since the proportion of nondominated solutions in the population scales up sharply with the increase of the number of objectives. To address these issues, this paper first defines the nondominated solutions exhibiting evident tendencies toward the Pareto-optimal front as prominent solutions, using the hyperplane formed by their neighboring solutions, to further distinguish among nondominated solutions. Then, a novel environmental selection strategy is proposed with two criteria in mind: 1) if the number of nondominated solutions is larger than the population size, all the prominent solutions are first identified to strengthen the selection pressure. Subsequently, a part of the other nondominated solutions are selected to balance convergence and diversity and 2) otherwise, all the nondominated solutions are selected; then a part of the dominated solutions are selected according to the predefined reference vectors. Moreover, based on the definition of prominent solutions and the new selection strategy, we propose a hyperplane assisted evolutionary algorithm, referred here as hpaEA, for solving MaOPs. To demonstrate the performance of hpaEA, extensive experiments are conducted to compare it with five state-of-the-art many-objective evolutionary algorithms on 36 many-objective benchmark instances. The experimental results show the superiority of hpaEA which significantly outperforms the compared algorithms on 20 out of 36 benchmark instances. [ABSTRACT FROM AUTHOR]

Copyright of Itobiad: Journal of the Human & Social Science Researches / İnsan ve Toplum Bilimleri Araştırmaları Dergisi is the property of Itobiad: Journal of the Human & Social Science Researches and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In offline data-driven optimization, only historical data is available for optimization, making it impossible to validate the obtained solutions during the optimization. To address these difficulties, this paper proposes an evolutionary algorithm assisted by two surrogates, one coarse model and one fine model. The coarse surrogate (CS) aims to guide the algorithm to quickly find a promising subregion in the search space, whereas the fine one focuses on leveraging good solutions according to the knowledge transferred from the CS. Since the obtained Pareto optimal solutions have not been validated using the real fitness function, a technique for generating the final optimal solutions is suggested. All achieved solutions during the whole optimization process are grouped into a number of clusters according to a set of reference vectors. Then, the solutions in each cluster are averaged and outputted as the final solution of that cluster. The proposed algorithm is compared with its three variants and two state-of-the-art offline data-driven multiobjective algorithms on eight benchmark problems to demonstrate its effectiveness. Finally, the proposed algorithm is successfully applied to an operational indices optimization problem in beneficiation processes. [ABSTRACT FROM AUTHOR]

Mobile monitoring for health and wellness is becoming more sophisticated and accurate, with an increased use of real-time personalization technologies that may improve the effectiveness of physical activity coaching systems. This study aimed to review real-time physical activity coaching applications that make use of personalization mechanisms. A scoping review, using the PRISMA-ScR checklist, was conducted on the literature published from July 2007 to July 2018. A data extraction tool was developed to analyze the systems on general characteristics, personalization, design foundations (behavior change and gamification) and evaluation methods. 28 papers describing 17 different mobile applications were included. The most used personalization concepts were Feedback (17/17), Goal Setting (15/17), User Targeting (9/17) and Inter-human Interaction (8/17), while the less commonly covered were Self-Learning (4/17), Context Awareness (3/17) and Adaptation (2/17). Few systems considered behavior change theories for design (6/17). A total of 42 instances of gamification-related elements were found across 15 systems, but only 6 explicitly mention its use. Most systems (15/17) were submitted to some type of evaluation. However, few assessed the effects of particular strategies or overall system effectiveness using randomized experimental designs (5/17). Although personalization is thought to improve user adherence in physical activity coaching applications, it is still far from reaching its full potential. We believe that future work should consider the theory and suggestions reported in prior work; leverage the needs of the target users for personalization; include behavior change foundations and explore gamification theory; and properly evaluate these systems. [ABSTRACT FROM AUTHOR]

Single-cell RNA-Sequencing (scRNA-Seq), an advanced sequencing technique, enables biomedical researchers to characterize cell-specific gene expression profiles. Although studies have adapted machine learning algorithms to cluster different cell populations for scRNA-Seq data, few existing methods have utilized machine learning techniques to investigate functional pathways in classifying heterogeneous cell populations. As genes often work interactively at the pathway level, studying the cellular heterogeneity based on pathways can facilitate the interpretation of biological functions of different cell populations. In this paper, we propose a pathway-based analytic framework using Random Forests (RF) to identify discriminative functional pathways related to cellular heterogeneity as well as to cluster cell populations for scRNA-Seq data. We further propose a novel method to construct gene-gene interactions (GGIs) networks using RF that illustrates important GGIs in differentiating cell populations. The co-occurrence of genes in different discriminative pathways and ‘cross-talk’ genes connecting those pathways are also illustrated in our networks. Our novel pathway-based framework clusters cell populations, prioritizes important pathways, highlights GGIs and pivotal genes bridging cross-talked pathways, and groups co-functional genes in networks. These features allow biomedical researchers to better understand the functional heterogeneity of different cell populations and to pinpoint important genes driving heterogeneous cellular functions. [ABSTRACT FROM AUTHOR]

In this paper, we show that stress-tests can be potentially used as power-noise viruses in denial-of-service (DoS) attacks by causing voltage emergencies that may lead to data corruptions and system crashes in multi-core processors. This attack targets processors whose operating voltage has been reduced in-the-field for improving energy efficiency. To protect such undervolted processors from this type of attacks, we present a run-time system for detecting and mitigating power-noise viruses. We present voltage noise data from power-noise viruses and benchmarks collected from an Arm multi-core processor, and we observe that the frequency of voltage emergencies dramatically increases during the execution of power-noise attacks. Based on this observation, we propose a regression model that allows for a run-time estimation of the severity of voltage emergencies by monitoring the frequency of voltage emergencies and the operating frequency of the processor. For mitigating the problem, during the execution of critical tasks requiring protection, our system periodically evaluates the severity of voltage emergencies and adapts the operating frequency of the processor in order to reduce the severity of the attack according to a predefined constraint. We demonstrate the efficiency of the proposed run-time protection system on an actual Arm multi-core processor using two power-noise viruses, and we explore trade-offs between protection latency, CPU utilization and power cost. The proposed software achieves with a very low CPU utilization overhead of less than 0.11% to detect and mitigate power-noise DoS attacks with a latency of 100 $\mu {\mathrm{ s}}$. [ABSTRACT FROM AUTHOR]

A circulant-permutation-based spatially-coupled (SC) code is constructed by partitioning the circulant permutation matrices (CPMs) in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting several SC codes, multi-dimensional SC (MD-SC) codes are constructed. In this paper, we present a systematic framework for constructing MD-SC codes with notably better cycle properties than their one-dimensional counterparts. In our framework, the multi-dimensional coupling is performed via an informed relocation of problematic CPMs. This work is general in the terms of the number of constituent SC codes that are connected together, the number of neighboring SC codes that each constituent SC code is connected to, and the length of the cycles whose populations we aim to reduce. Finally, we present a decoding algorithm that utilizes the structures of the MD-SC code to achieve lower decoding latency. Compared to the conventional SC codes, our MD-SC codes have a notably lower population of small cycles, and a dramatic BER improvement. The results of this work can be particularly beneficial in data storage systems, e.g., 2D magnetic recording and 3D Flash systems, as high-performance MD-SC codes are robust against various channel impairments and non-uniformity. [ABSTRACT FROM AUTHOR]

Recognizing representative living patterns in population is extremely valuable for urban planning and decision making. Thanks to the growing popularity of location-based applications and check-ins on social networking sites, Point of Interest (POI) of a location is quite often available in the trajectory data, which expresses user living semantics. However, adopting trajectory semantics for living pattern recognition is an open and challenging research problem due to three major technical challenges: effective feature representation, suitable granularity selection for habit unit, and reliable habit distance measurement. In this paper, we propose a representation learning based system named habit2vec to represent user trajectory semantics in vector space, which preserves the original user living habit information. We evaluated our proposed system on a large-scale real-world dataset provided by a popular social network operator including 123,803 users for 1.5 months in Beijing. The results justify the representation ability of our system in preserving user habit pattern, and demonstrate the effectiveness of clustering users with similar living patterns. [ABSTRACT FROM AUTHOR]

In this paper, we propagate the use of a set-based Newton method that enables computing a finite size approximation of the Pareto front (PF) of a given twice continuously differentiable bi-objective optimization problem (BOP). To this end, we first derive analytically the Hessian matrix of the hypervolume indicator, a widely used performance indicator for PF approximation sets. Based on this, we propose the hypervolume Newton method (HNM) for hypervolume maximization of a given set of candidate solutions. We first address unconstrained BOPs and focus further on first attempts for the treatment of inequality constrained problems. The resulting method may even converge quadratically to the optimal solution, however, this property is—as for all Newton methods—of local nature. We hence propose as a next step a hybrid of HNM and an evolutionary strategy in order to obtain a fast and reliable algorithm for the treatment of such problems. The strengths of both HNM and hybrid are tested on several benchmark problems and comparisons of the hybrid to state-of-the-art evolutionary algorithms for hypervolume maximization are presented. [ABSTRACT FROM AUTHOR]

Nonlinear equations system (NES) arises commonly in science and engineering. Repulsion techniques are considered to be the effective methods to locate different roots of NES. In general, the repulsive radius needs to be given by the user before the run. However, its optimal parameter setting is difficult and problem-dependent. To alleviate this drawback, in this paper, we first propose a dynamic repulsion technique, and then a general framework based on the dynamic repulsion technique and evolutionary algorithms (EAs) is presented to effectively solve NES. The major advantages of our framework are: 1) the repulsive radius is controlled dynamically during the evolutionary process; 2) multiple roots of NES can be simultaneously located in a single run; 3) the diversity of the population is preserved due to the population reinitialization; and 4) different repulsion techniques and different EAs can be readily integrated into this framework. To extensively evaluate the performance of our framework, we choose 42 problems with diverse features as the test suite. In addition, some representative differential evolution and particle swarm optimization variants are incorporated into the framework. Our method is also compared with other state-of-the-art methods. Experimental results indicate that the dynamic repulsion technique can improve the performance of the original repulsion technique with static repulsive radius. Moreover, the proposed method is able to yield better results compared with other methods. [ABSTRACT FROM AUTHOR]

Neighborhood information plays an important role in improving the performance of evolutionary computation in various optimization scenarios, particularly in the context of multimodal optimization. Several neighborhood concepts, i.e., index-based neighborhood, nearest neighborhood, and fuzzy neighborhood, have been studied and engaged in the design of niching methods. However, the use of these neighborhood concepts requires the specification of some problem-related parameters, which is difficult to determine without a prior knowledge. In this paper, we introduce a new neighborhood concept based on a geometrical construction called Voronoi diagram. The new concept offers two advantages at the expense of increasing the computational complexity to a higher level. It eliminates the need of additional parameters and it is more informative than the existing ones. The information provided by the Voronoi neighbors of an individual can be exploited to estimate the evolutionary state. Based on the information, we divide the population into three groups and assign each group a different reproduction strategy to support the exploration and exploitation of the search space. We show the use of the concept in the design of an effective evolutionary algorithm for multimodal optimization. The experiments have been conducted to investigate the performance of the algorithm. The results reveal that the proposed algorithm compare favorably with the state-of-the-art algorithms designed based on other types of neighborhood concepts. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) have shown remarkable performance in various real-world applications. Unfortunately, the promising performance of CNNs can be achieved only when their architectures are optimally constructed. The architectures of state-of-the-art CNNs are typically handcrafted with extensive expertise in both CNNs and the investigated data, which consequently hampers the widespread adoption of CNNs for less experienced users. Evolutionary deep learning (EDL) is able to automatically design the best CNN architectures without much expertise. However, the existing EDL algorithms generally evaluate the fitness of a new architecture by training from scratch, resulting in the prohibitive computational cost even operated on high-performance computers. In this paper, an end-to-end offline performance predictor based on the random forest is proposed to accelerate the fitness evaluation in EDL. The proposed performance predictor shows the promising performance in term of the classification accuracy and the consumed computational resources when compared with 18 state-of-the-art peer competitors by integrating into an existing EDL algorithm as a case study. The proposed performance predictor is also compared with the other two representatives of existing performance predictors. The experimental results show the proposed performance predictor not only significantly speeds up the fitness evaluations but also achieves the best prediction among the peer performance predictors. [ABSTRACT FROM AUTHOR]

A large number of prediction strategies are specific to a dynamic multiobjective optimization problem (DMOP) with only one type of the Pareto set (PS) change. However, a continuous DMOP with more than one type of the unknown PS change has been seldom investigated. We present a multimodel prediction approach (MMP) realized in the framework of evolutionary algorithms (EAs) to tackle the problem. In this paper, we first detect the type of the PS change, followed by the selection of an appropriate prediction model to provide an initial population for the subsequent evolution. To observe the influence of MMP on EAs, optimal solutions obtained by three classical dynamic multiobjective EAs with and without MMP are investigated. Furthermore, to investigate the performance of MMP, three state-of-the-art prediction strategies are compared on a large number of dynamic test instances under the same particle swarm optimizer. The experimental results demonstrate that the proposed approach outperforms its counterparts under comparison on most optimization problems. [ABSTRACT FROM AUTHOR]

This paper proposes a new prediction-based dynamic multiobjective optimization (PBDMO) method, which combines a new prediction-based reaction mechanism and a popular regularity model-based multiobjective estimation of distribution algorithm (RM-MEDA) for solving dynamic multiobjective optimization problems. Whenever a change is detected, PBDMO reacts effectively to it by generating three subpopulations based on different strategies. The first subpopulation is created by moving nondominated individuals using a simple linear prediction model with different step sizes. The second subpopulation consists of some individuals generated by a novel sampling strategy to improve population convergence as well as distribution. The third subpopulation comprises some individuals generated using a shrinking strategy based on the probability distribution of variables. These subpopulations are tailored to form a population for the new environment. The experimental results carried out on a variety of bi- and three-objective benchmark functions demonstrate that the proposed technique has competitive performance compared with some state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Cognitive radio-enabled vehicular nodes as unlicensed users can competitively and opportunistically access the radio spectrum provided by a licensed provider and simultaneously use a dedicated channel for vehicular communications. In such cognitive vehicular networks, channel access optimization plays a key role in making the most of the spectrum resources. In this paper, we present the competition among self-interest-driven vehicular nodes as an evolutionary game and study fundamental properties of the Nash equilibrium and the evolutionary stability. To deal with the inefficiency of the Nash equilibrium, we design a delayed pricing mechanism and propose a discretized replicator dynamics with this pricing mechanism. The strategy adaptation and the channel pricing can be performed in an asynchronous manner, such that vehicular users can obtain the knowledge of the channel prices prior to actually making access decisions. We prove that the Nash equilibrium of the proposed evolutionary dynamics is evolutionary stable and coincides with the social optimum. Besides, performance comparison is also carried out in different environments to demonstrate the effectiveness and advantages of our method over the distributed multi-agent reinforcement learning scheme in current literature in terms of the system convergence, stability and adaptability. [ABSTRACT FROM AUTHOR]

This paper analyzes Sim-Evolution, an educational simulator designed to help teachers presenting three basic principles of the theory of evolution by natural selection (TENS): the trait variation within a population, the heritability of trait variation, and the selective survival based on heritable traits. Sim-Evolution focuses on high school students, so its interface was designed to be joyful, helping to engage them. Although it was designed based on the concept of population genetics, knowing it is not a requirement for exploring TENS. Sim-Evolution models the population of a hypothetic bird species in two possible vegetations: forest or veld. Individuals of this bird species vary over two characteristics (color and beak type), with three possible phenotypes for each one. The user can choose individuals to form an initial population and monitor variation through successive generations. Birds breed independently of their phenotype, and natural selection (based on the fitness of each trait) was the only driven factor of population variation. Sim-Evolution was evaluated with high school students during a biology class. Students were able to describe and analyze the simulation process from a scientific perspective, observing the phenomenon associated with TENS. They correctly associated the bird's evolution with different survivor rates associated with the different traits and identified evolution by natural selection as a population and not an individual/organism process. Our proposal opens the possibility that TENS simulator does not obligatorily require users to be familiar with population genetics concepts, which is especially interestingly for high school pedagogical uses. [ABSTRACT FROM AUTHOR]

Automatic classification of electrocardiogram (ECG) signals is important for diagnosing heart arrhythmias. A big challenge in automatic ECG classification is the variation in the waveforms and characteristics of ECG signals among different patients. To address this issue, this paper proposes adapting a patient-independent deep neural network (DNN) using the information in the patient-dependent identity vectors (i-vectors). The adapted networks, namely i-vector adapted patient-specific DNNs (iAP-DNNs), are tuned toward the ECG characteristics of individual patients. For each patient, his/her ECG waveforms are compressed into an i-vector using a factor analysis model. Then, this i-vector is injected into the middle hidden layer of the patient-independent DNN. Stochastic gradient descent is then applied to fine-tune the whole network to form a patient-specific classifier. As a result, the adaptation makes use of not only the raw ECG waveforms from the specific patient but also the compact representation of his/her ECG characteristics through the i-vector. Analysis on the hidden-layer activations shows that by leveraging the information in the i-vectors, the iAP-DNNs are more capable of discriminating normal heartbeats against arrhythmic heartbeats than the networks that use the patient-specific ECG only for the adaptation. Experimental results based on the MIT-BIH database suggest that the iAP-DNNs perform better than existing patient-specific classifiers in terms of various performance measures. In particular, the sensitivity and specificity of the existing methods are all under the receiver operating characteristic curves of the iAP-DNNs. [ABSTRACT FROM AUTHOR]

Children with intellectual disabilities (ID), especially those who fail to communicate with normal speech, suffer from various limitations in their social functioning. They often rely on alternate methods to supplement or replace verbal communication. There is a rapidly growing number of augmentative and alternative communication (AAC) mobile applications available over recent years. However, the operation of these applications remains a challenge for users with ID since they may not have the sufficient cognitive proficiency to cope with the application interface. In this paper, we present the design, implementation, and evaluation of a Bluetooth low energy (BLE) based context-aware AAC system. Our system facilitates daily communication for nonverbal school children with moderate ID in order to address their learning and communication needs. We have piloted and evaluated our system at a special education school in Hong Kong. Our technical contribution is twofold. First, we introduce BLE technology to the AAC field and show its effectiveness on users with ID. Second, by converting conventionally standalone AAC software into a service system and empowering it with Internet of Things functionality, we open up many new opportunities brought by the system-of-systems (SoS) paradigm for the intellectually disabled population. [ABSTRACT FROM AUTHOR]

In metropolitan areas, drivers share their vehicles with people who commute daily via carpooling. In this paper, we first defined a multiobjective carpool service problem with time windows (MOCSPTW) by considering four optimized objectives; subsequently, we propose a coevolutionary algorithm for two solution sets, population and archive, using objective-wise local search and set-based simulated binary operation in order to address the MOCSPTW. In the evolution module of the proposed algorithm, three different methods, namely, objective-wise local search in an archive, set-based simulated binary operation in a population, and set-based simulated binary operation both in a population and in an archive, were used to generate the offspring. Meanwhile, the $\epsilon $ -domination and normal domination in the update module were adopted to control the convergence and diversity of the population and archive. In the experimental result, 48 sets of tests, including three moving patterns in a metropolitan area for the MOCSPTW, were prepared. The results of the quantitative comparison and objective visualization showed that the proposed algorithm can obtain superior Pareto-optimal solutions regarding convergence and diversity compared with a fast nondominated sorting genetic algorithm. [ABSTRACT FROM AUTHOR]

The goal of this paper is to increase the statistical power of crossing-fiber statistics in voxelwise analyses of diffusion-weighted magnetic resonance imaging (DW-MRI) data. In the proposed framework, a fiber orientation atlas and a model complexity atlas were used to fit the ball-and-sticks model to diffusion-weighted images of subjects in a prospective population-based cohort study. Reproducibility and sensitivity of the partial volume fractions in the ball-and-sticks model were analyzed using TBSS (tract-based spatial statistics) and compared to a reference framework. The reproducibility was investigated on two scans of 30 subjects acquired with an interval of approximately three weeks by studying the intraclass correlation coefficient (ICC). The sensitivity to true biological effects was evaluated by studying the regression with age on 500 subjects from 65 to 90 years old. Compared to the reference framework, the ICC improved significantly when using the proposed framework. Higher t-statistics indicated that regression coefficients with age could be determined more precisely with the proposed framework and more voxels correlated significantly with age. The application of a fiber orientation atlas and a model complexity atlas can significantly improve the reproducibility and sensitivity of crossing-fiber statistics in TBSS. [ABSTRACT FROM AUTHOR]

Two-echelon vehicle routing problem (2E-VRP) is a challenging problem that involves both the strategic and tactical planning decisions on both echelons. The satellite locations and the customer distribution affect the cost of different components on the second echelon, thus the possibilities of satellite-to-customer assignment complicates the problem. In this paper, we propose a graph-based fuzzy evolutionary algorithm for solving 2E-VRP. The proposed method integrates a graph-based fuzzy assignment scheme into an iteratively evolutionary learning process to minimize the total cost. To resolve the possibilities of the satellite-to-customer assignment, graph-based fuzzy operator is used to take advantage of population evolution and avoid excessive fitness evaluations of unpromising moves in different satellites. Each offspring is produced via graph-based fuzzy assignment procedure out of an assignment graph from parent individuals, and fuzzy local search procedure is used to further improve the offspring. The experimental results on the public test sets demonstrate the competitiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Scalability is a crucial aspect of designing efficient algorithms. Despite their prevalence, large-scale dynamic optimization problems are not well studied in the literature. This paper is concerned with designing benchmarks and frameworks for the study of large-scale dynamic optimization problems. We start by a formal analysis of the moving peaks benchmark (MPB) and show its nonseparable nature irrespective of its number of peaks. We then propose a composite MPB suite with exploitable modularity covering a wide range of scalable partially separable functions suitable for the study of large-scale dynamic optimization problems. The benchmark exhibits modularity, heterogeneity, and imbalance features to resemble real-world problems. To deal with the intricacies of large-scale dynamic optimization problems, we propose a decomposition-based coevolutionary framework which breaks a large-scale dynamic optimization problem into a set of lower-dimensional components. A novel aspect of the framework is its efficient bi-level resource allocation mechanism which controls the budget assignment to components and the populations responsible for tracking multiple moving optima. Based on a comprehensive empirical study on a wide range of large-scale dynamic optimization problems with up to 200-D, we show the crucial role of problem decomposition and resource allocation in dealing with these problems. The experimental results clearly show the superiority of the proposed framework over three other approaches in solving large-scale dynamic optimization problems. [ABSTRACT FROM AUTHOR]

The decomposition-based evolutionary algorithm has become an increasingly popular choice for posterior multiobjective optimization. Facing the challenges of an increasing number of objectives, many techniques have been developed which help to balance the convergence and diversity. Nevertheless, according to a recent study by Ishibuchi et al., due to the predefined search directions toward the ideal point, their performance strongly depends on the Pareto front (PF) shapes, especially the orientation of the PFs. To balance the convergence and diversity for decomposition-based methods and to alleviate their performance dependence on the orientation of the PFs, this paper develops an adversarial decomposition method for many-objective optimization, which leverages the complementary characteristics of different subproblem formulations within a single paradigm. More specifically, two populations are co-evolved by two subproblem formulations with different contours and adversarial search directions. To avoid allocating redundant computational resources to the same region of the PF, the two populations are matched into one-to-one solution pairs according to their working regions upon the PF. Each solution pair can at most contribute one principal mating parent during the mating selection process. When comparing nine state-of-the-art many-objective optimizers, we have witnessed the competitive performance of our proposed algorithm on 130 many-objective test problems with various characteristics, including regular and inverted PFs. [ABSTRACT FROM AUTHOR]

This paper proposes a new rule-based cooperative framework for multiobjective evolutionary fuzzy systems (FSs). Based on the framework, a multiobjective rule-based cooperative continuous ant-colony optimization (MO-RCCACO) algorithm is proposed to optimize all of the free parameters in FSs. Instead of optimization using a single colony of FSs (solutions), the MO-RCCACO consists of ${r}$ subcolonies of size ${N}$ cooperatively optimizing an FS that consists of ${r}$ rules, with a subcolony optimizing only a single fuzzy rule. In addition, an auxiliary colony is created to store all of the fuzzy rules in the best-so-far ${N}$ FSs to enhance the optimization ability of MO-RCCACO. The performance ranking of different fuzzy rules in the same subcolony is performed based on the multiobjective function values of their participating FSs by using Pareto nondominated sorting and the crowding distance. The MO-RCCACO is applied to find the Pareto-optimal fuzzy controllers (FCs) of a mobile robot for wall following with multiple control objectives. The optimization ability of the MO-RCCACO is verified through comparisons with various multiobjective population-based optimization algorithms in the robot wall-following control problem. Experimental results verify the effectiveness of the MO-RCCACO-based FCs for the boundary following control of a real robot. [ABSTRACT FROM AUTHOR]

Multipopulation is an effective optimization component often embedded into evolutionary algorithms to solve optimization problems. In this paper, a new multipopulation-based multiobjective genetic algorithm (MOGA) is proposed, which uses a unique cross-subpopulation migration process inspired by biological processes to share information between subpopulations. Then, a Markov model of the proposed multipopulation MOGA is derived, the first of its kind, which provides an exact mathematical model for each possible population occurring simultaneously with multiple objectives. Simulation results of two multiobjective test problems with multiple subpopulations justify the derived Markov model, and show that the proposed multipopulation method can improve the optimization ability of the MOGA. Also, the proposed multipopulation method is applied to other multiobjective evolutionary algorithms (MOEAs) for evaluating its performance against the IEEE Congress on Evolutionary Computation multiobjective benchmarks. The experimental results show that a single-population MOEA can be extended to a multipopulation version, while obtaining better optimization performance. [ABSTRACT FROM AUTHOR]

Molecular signatures of cancer, e.g., genes or microRNAs (miRNAs), have been recognized very important in predicting the occurrence of cancer. From gene-expression and miRNA-expression data, the challenge of identifying molecular signatures lies in the huge number of molecules compared to the small number of samples. To address this issue, in this paper, we propose a heuristic algorithm to identify molecular signatures, termed HAMS, for cancer diagnosis by modeling it as a multi-objective optimization problem. In the proposed HAMS, an elitist-guided individual update strategy is proposed to obtain a small number of molecular signatures, which are closely related with cancer and contain less redundant signatures. Experimental results demonstrate that the proposed HAMS achieves superior performance over seven state-of-the-art algorithms on both gene-expression and miRNA-expression datasets. We also validate the biological significance of the molecular signatures obtained by the proposed HAMS through biological analysis. [ABSTRACT FROM AUTHOR]

The intelligent devices in Internet of Things (IoT) not only provide services but also consider how to allocate heterogeneous resources and reduce resource consumption and service time as far as possible. This issue becomes crucial in the case of large-scale IoT environments. In order for the IoT service system to respond to multiple requests simultaneously and provide Pareto optimal decisions, we propose an immune-endocrine system inspired hierarchical coevolutionary multiobjective optimization algorithm (IE-HCMOA) in this paper. In IE-HCMOA, a multiobjective immune algorithm based on global ranking with vaccine is designed to choose superior antibodies. Meanwhile, we adopt clustering in top population to make the operations more directional and purposeful and realize self-adaptive searching. And we use the human forgetting memory mechanism to design two-level memory storage for the choice problem of solutions to achieve promising performance. In order to validate the practicability and effectiveness of IE-HCMOA, we apply it to the field of agricultural IoT service. The simulation results demonstrate that the proposed algorithm can obtain the best Pareto, the strongest exploration ability, and excellent performance than nondominated neighbor immune algorithms and NSGA-II. [ABSTRACT FROM AUTHOR]

This study describes a detailed analysis of museum visitors' decoding process as they used a visualization designed to support exploration of a large, complex dataset. Quantitative and qualitative analyses revealed that it took, on average, 43 seconds for visitors to decode enough of the visualization to see patterns and relationships in the underlying data represented, and 54 seconds to arrive at their first correct data interpretation. Furthermore, visitors decoded throughout and not only upon initial use of the visualization. The study analyzed think-aloud data to identify issues visitors had mapping the visual representations to their intended referents, examine why they occurred, and consider if and how these decoding issues were resolved. The paper also describes how multiple visual encodings both helped and hindered decoding and concludes with implications on the design and adaptation of visualizations for informal science learning venues. [ABSTRACT FROM AUTHOR]

In this paper, thermostatically controlled loads (TCLs), e.g., air conditioners, are utilized to mitigate the photovoltaic and load variations in a building-microgrid community, so that the whole community can provide ancillary services, e.g., fulfilling the power dispatch order from the main grid. First, a distributed control scheme with a two-layer hierarchical communication graph is proposed. The control gains are selected based on a linear quadratic regulator approach to achieve optimal control performance. Then, an initial value updating method is developed so that the dispatch order and local regulation signals are converted into the initial conditions for distributed control. With the proposed control scheme, the building-microgrid community can provide ancillary services while fairly sharing power and customers’ comfort requirement among all participated TCLs. The effectiveness of this control scheme is validated on a building-microgrid community with a variety of test cases. [ABSTRACT FROM AUTHOR]

Sparse unmixing has become a popular tool for hyperspectral imagery interpretation. It refers to finding the optimal subset of a spectral library to reconstruct the image data and further estimate the proportions of different materials. Recently, multi-objective based sparse unmixing methods have presented promising performance because of their advantages in addressing combinatorial problems. A spectral and multi-objective based sparse unmixing (SMoSU) algorithm was proposed in our previous work, which solves the decision-making problem well. However, it does not show outstanding advantages in strong noise cases. To solve the problem, in this paper, SMoSU is improved based on the estimation of distribution algorithms (EDAs). The machine learning based EDAs have been a reliable approach in solving multi-objective problems. However, most of them are for special problems and relatively weak in theoretical foundations. Thus, it is unreliable to extend it directly to sparse unmixing. Here, we improve EDA on the basis of classification and propose a classification-based model for individual generating under the framework of SMoSU (CM-MoSU). In CM-MoSU, the whole population is divided to be positive and negative. Then, the macroinformation of positive individuals is used to guide the generation of new individuals. Therefore, the optimization task could pay more attention to the feasible space with high quality. Moreover, some theoretical analyses are presented to prove the reliability of CM-MoSU. In experiments, several state-of-the-art sparse unmixing algorithms are compared. Both synthetic and real-world experiments demonstrate the effectiveness of CM-MoSU. [ABSTRACT FROM AUTHOR]

As the mutation strategy and algorithmic parameters in differential evolution (DE) are sensitive to the problems being solved, a hot research topic is to adaptively control the strategy and parameters according to the requirements of the problem. In the literature, most adaptive DE use either historical experiences of the population or heuristic information of the individuals to promote adaptation. In this paper, we develop a novel variant of adaptive DE, utilizing both the historical experience and heuristic information for the adaptation. In this novel historical and heuristic DE (HHDE), each individual dynamically adjusts its mutation strategy and associated parameters not only by learning from previous successful experience of the whole population, but also according to heuristic information related with its own current state. These help the algorithm select a more suitable mutation strategy and determinate better parameters for each individual in different evolutionary stages. The performance of the proposed HHDE is extensively evaluated on 30 benchmark functions with different dimensions. Experimental results confirm the competitiveness of the proposed algorithm to a number of DE variants. [ABSTRACT FROM AUTHOR]

Decomposition of a multiobjective optimization problem (MOP) into several simple multiobjective subproblems, named multiobjective evolutionary algorithm based on decomposition (MOEA/D)-M2M, is a new version of multiobjective optimization-based decomposition. However, it fails to consider different contributions from each subproblem but treats them equally instead. This paper proposes a collaborative resource allocation (CRA) strategy for MOEA/D-M2M, named MOEA/D-CRA. It allocates computational resources dynamically to subproblems based on their contributions. In addition, an external archive is utilized to obtain the collaborative information about contributions during a search process. Experimental results indicate that MOEA/D-CRA outperforms its peers on 61% of the test cases in terms of three metrics, thereby validating the effectiveness of the proposed CRA strategy in solving MOPs. [ABSTRACT FROM AUTHOR]

Optimization problems with variable-length decision space are a class of challenging optimization problems derived from some real-world applications, such as the composite laminate stacking problem and the sensor coverage problem. Unlike other optimization problems, the solutions in these problems might be represented as the vectors with different variable size (i.e., dimensionality). So far, some research efforts have been done on the use of evolutionary algorithms (EAs) for solving single objective variable-length optimization problems. In fact, the variable-length problem difficulty can also exist in multiobjective optimization. However, such challenging problems have not yet gained much attention in the area of evolutionary multiobjective optimization. To facilitate the research on the variable-length Pareto optimization, we first suggest a systematic toolkit for constructing benchmark multiobjective test problems with variable-length feature in this paper. Then, we also propose a variable-length multiobjective EA based on a two-level decomposition strategy, which decomposes a multiobjective optimization problem in terms of the penalty boundary intersection search directions and the dimensionality of variables. The performance of our proposed algorithm and the other three state-of-the-art algorithms on these problems are compared. To further show the effectiveness of our proposed algorithm, some experimental results on a bi-objective laminate stacking optimization problem are also reported and analyzed. [ABSTRACT FROM AUTHOR]

The Latin square completion (LSC) problem involves completing a partially filled Latin square of order ${n}$ by assigning numbers from 1 to ${n}$ to the empty grids such that each number occurs exactly once in each row and each column. LSC has numerous applications and is, however, NP-complete. In this paper, we investigate an approach for solving LSC by converting an LSC instance to a domain-constrained Latin square graph and then solving the associated list coloring problem. To be effective, we first employ a constraint propagation-based kernelization technique to reduce the graph model and then call for a dedicated memetic algorithm to find a legal list coloring. The population-based memetic algorithm combines a problem-specific crossover operator to generate meaningful offspring solutions, an iterated tabu search procedure to improve the offspring solutions, and a distance-quality-based pool updating strategy to maintain a healthy diversity of the population. Extensive experiments on more than 1800 LSC benchmark instances in the literature show that the proposed approach can successfully solve all the instances, surpassing the state-of-the-art methods. To our knowledge, this is the first approach achieving such a performance for the considered problem. We also report computational results for the related partial Latin square extension problem. [ABSTRACT FROM AUTHOR]

There are many target methods that are efficient to tackle the robustness and immunization problem, in particular, to identify the most influential nodes in a certain complex network. Unfortunately, owing to the diversity of networks, none of them could be accounted as a universal approach that works well in a wide variety of networks. Hence, in this paper, from a percolation perspective, we connect the immunization and robustness problem with an evolutionary algorithm, i.e., a framework of an evolutionary algorithm for investigation of influential nodes in complex networks, in which we have developed procedures of selection, mutation, and initialization of population as well as maintaining the diversity of population. To validate the performance of the proposed framework, we conduct intensive experiments on a large number of networks and compare it to several state-of-the-art strategies. The results demonstrate that the proposed method has significant advantages over others, especially on empirical networks in most of which our method has over 10% advantages of both optimal immunization threshold and average giant fraction, even against the most excellent existing strategies. Additionally, our discussion reveals that there might be better solutions with various initial methods. [ABSTRACT FROM AUTHOR]

In an organization, individuals prefer to form various formal and informal groups for mutual interactions. Therefore, ubiquitous identification of such groups and understanding their dynamics are important to monitor activities, behaviors, and well-being of the individuals. In this paper, we develop a lightweight, yet near-accurate, methodology, called GroupSense, to identify various interacting groups based on collective sensing through users’ smartphones. Group detection from sensor signals is not straightforward because users in proximity may not always be under the same group. Therefore, we use acoustic context extracted from audio signals to infer the interaction pattern among the subjects in proximity. We have developed an unsupervised and lightweight mechanism for user group detection by taking cues from network science and measuring the cohesivity of the detected groups regarding modularity. Taking modularity into consideration, GroupSense can efficiently eliminate incorrect groups, as well as adapt the mechanism depending on the role played by the proximity and the acoustic context in a specific scenario. The proposed method has been implemented and tested under many real-life scenarios in an academic institute environment, and we observe that GroupSense can identify user groups with on an average $0.9(\pm 0.14)$ 0. 9 (± 0. 14) $F_1$ F 1 -Score even in a noisy environment. [ABSTRACT FROM AUTHOR]

Decomposition-based evolutionary algorithms have shown great potential in many-objective optimization. However, the lack of theoretical studies on decomposition methods has hindered their further development and application. In this paper, we first theoretically prove that weight sum, Tchebycheff, and penalty boundary intersection decomposition methods are essentially interconnected. Inspired by this, we further show that highly customized dominance relationship can be derived from decomposition for any given decomposition vector. A new evolutionary algorithm is then proposed by applying the customized dominance relationship with adaptive strategy to each subpopulation of multiobjective to multiobjective framework. Experiments are conducted to compare the proposed algorithm with five state-of-the-art decomposition-based evolutionary algorithms on a set of well-known scaled many-objective test problems with 5 to 15 objectives. Simulation results have shown that the proposed algorithm can make better use of the decomposition vectors to achieve better performance. Further investigations on unscaled many-objective test problems verify the robust and generality of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Parking is a major constraint for car users and therefore an important factor in mode choice decisions. In this paper we introduce a model to simulate parking search behavior for cars within a multiagent transport simulation, including full simulation of all steps of parking search, such as walking to and from the vehicle. This is combined with the capabilities of privately owned autonomous vehicles (AVs), which may park automatically, often in other locations than conventional cars, once they are not in use. Three different strategies for AVs to park are developed: (1) Conventional parking search, (2) parking at a designated AV lot, and (3) empty cruising, where vehicles do not use any parking space, but keep on driving. We apply the simulation model to a residential neighborhood in central Berlin, where parking pressure is generally high and apply different shares of AV usage to the synthetic population used. This allows a detailed evaluation of effects for both AV and conventional vehicle owners. Results suggest that the usage of designated parking lots may be the most beneficial solution for most users, with both vehicle wait times and parking search durations being the lowest. [ABSTRACT FROM AUTHOR]

Due to the growth of modern dataset size and the desire to harness computing power of multiple machines, there is a recent surge of interest in the design of distributed machine learning algorithms. However, distributed algorithms are sensitive to Byzantine attackers who can send falsified data to prevent the convergence of algorithms or lead the algorithms to converge to value of the attackers’ choice. Some recent work proposed interesting algorithms that can deal with the scenario when up to half of the workers are compromised. In this paper, we propose a novel algorithm that can deal with an arbitrary number of Byzantine attackers. The main idea is to ask the parameter server to randomly select a small clean dataset and compute noisy gradient using this small dataset. This noisy gradient will then be used as a ground truth to filter out information sent by compromised workers. We show that the proposed algorithm converges to the neighborhood of the population minimizer regardless the number of Byzantine attackers. We further provide numerical examples to show that the proposed algorithm can benefit from the presence of good workers and achieve better performance than existing algorithms. [ABSTRACT FROM AUTHOR]

The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least one defective element. The basic problem is to find all defectives using a minimal possible number of group tests. However, when the number of defectives is unknown there arises an additional problem, namely: how to estimate the random number of defective elements. In this paper, we concentrate on testing the hypothesis $H_0$ : the number of defectives $\leq s_1$ against the alternative hypothesis $H_1$ : the number of defectives $\geq s_2$. We introduce a new decoding algorithm based on the comparison of the number of tests having positive responses with an appropriate fixed threshold. For some asymptotic regimes on $s_1$ and $s_2$ , the proposed algorithm is shown to be order-optimal. Additionally, our simulation results verify the advantages of the proposed algorithm such as low complexity and a small error probability compared with known algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a new multilayer Lyapunov control scheme based on energy-level connectivity graphs of quantum systems, which enables a high-probability population transfer to any eigenstate in high-dimensional quantum systems. We provide a graph connectivity result for stability analysis and explore the selectivity characteristic of the Lyapunov control fields. A systematic layering method for the energy-level connectivity graph is presented to achieve a layer-by-layer population transfer to the target state. Several applications including a five-level quantum system, a three-qubit superconducting system, and a spin chain of five qubits are presented to demonstrate the effectiveness of the multilayer Lyapunov control method. [ABSTRACT FROM AUTHOR]

This paper studies a charging facility for electrical vehicles (EVs) at a parking garage, under the assumption that the infrastructure has a limited power capacity. In situations of overload, scheduling decisions must be made on which EVs to charge, possibly taking into account users’ sojourn times. We propose a fluid model that tracks service and sojourn times for a large population, enabling analytical studies of the distribution of service in steady state, for different policies. These results raise the issue of fairness in the distribution of partial service. We introduce a new policy called least laxity ratio to achieve a suitable notion of proportional fairness. We test our results in simulation, including a real data-set with time-varying load. Our results show that our conclusions remain valid in this scenario, in particular the proposed policy performs well under an objective empirical measure of fairness. [ABSTRACT FROM AUTHOR]

This paper proposes a novel distributed solution for the operation of large populations of thermostatically controlled loads (TCLs) providing frequency support. A game-theory framework is adopted, modeling the TCLs as price-responsive rational agents that schedule their energy consumption and allocate frequency response provision in order to minimize their operational costs. The novelty of this work lies in the use of mean field games to abstract the complex interactions of large numbers of TCLs with the grid and in the introduction of an innovative market structure, envisioning distinct price signals for electricity and response. Differently from previous approaches, such prices are not designed ad hoc but are derived instead from an underlying system scheduling model. [ABSTRACT FROM AUTHOR]

Early stopping of iterative algorithms is a widely used form of regularization in statistics, commonly used in conjunction with boosting and related gradient-type algorithms. Although consistency results have been established in some settings, such estimators are less well-understood than their analogues based on penalized regularization. In this paper, for a relatively broad class of loss functions and boosting algorithms (including $L^{2}$ -boost, LogitBoost, and AdaBoost, among others), we exhibit a direct connection between the performance of a stopped iterate and the localized Gaussian complexity of the associated function class. This connection allows us to show that the local fixed point analysis of Gaussian or Rademacher complexities, now standard in the analysis of penalized estimators, can be used to derive optimal stopping rules. We derive such stopping rules in detail for various kernel classes and illustrate the correspondence of our theory with practice for Sobolev kernel classes. [ABSTRACT FROM AUTHOR]

In this paper, a new model describing the human immunodeficiency virus (HIV)-acquired immuno deficiency syndrome (AIDS) epidemic spread is proposed. The improvement with respect to the known models has been driven by recent results obtained from historical data collection and the suggestions given by the World Health Organization: the characteristics of the virus diffusion, mainly by body fluids, imply the trivial fact that wise behaviors of healthy subjects and fast timely recognition of a new positive diagnosis should reduce the spread quite fast. Therefore, the set of susceptible subjects is divided into two categories: the wise people that, suitably informed, avoid dangerous behaviors, and the ones that, with irresponsible acts, could get the infection. The set of infected subjects is constituted by people who are still not aware of being infected (and therefore are responsible of the HIV spread), along with the subjects aware of being infected by HIV or AIDS. Inspired by the international guidelines suggestions, three controls are introduced, aiming both at the prevention and at the cure: an informative campaign, a test campaign, and an HIV/AIDS therapy action. Among them, the core of the control effort is a fast HIV diagnosis. The equilibrium points, their stability, and the influences of the introduced inputs to the system behavior are studied, yielding to preliminary statements for prospective works on suitable control design approaches. [ABSTRACT FROM AUTHOR]

Finding the overall Pareto optimal front while addressing the effect of an increasing number of objectives has become an essential and challenging issue for multiobjective optimization in real-world applications. Preference information provided by a decision maker can guide the search for preferred regions of the Pareto front and accelerate the convergence of the population. In this paper, a new variant of the Pareto dominance relation, called preference angle and reference information-based dominance, is proposed to create a stricter partial order among nondominated solutions. In the proposed method, the Euclidean distance and angle information between candidate solutions and reference points are calculated to evaluate the degree of convergence and population diversity, respectively. In addition, an adaptive threshold is designed to adjust the judgment condition of ar-dominance using an iterative process in a prespecified interval. The proposed algorithm increases the convergence speed of the population and reduces the number of solutions in the nonpreferred region. Comparative evaluation experiments are presented with respect to two performance metrics for a variety of benchmark test problems and real-world aluminum electrolytic production cases. The results demonstrate that the proposed approach is effective for highly complex, multiobjective optimization problems when compared with five state-of-the-art evolutionary algorithms. [ABSTRACT FROM AUTHOR]

Surrogate-assisted evolutionary algorithms (SAEAs) are promising methods for solving high-dimensional expensive problems. The basic idea of SAEAs is the integration of nature-inspired searching ability of evolutionary algorithms and prediction ability of surrogate models. This paper proposes a novel evolutionary sampling assisted optimization (ESAO) method which combines the two abilities to consider global exploration and local exploitation. Differential evolution is employed to generate offspring using mutation and crossover operators. A global radial basis functions surrogate model is built for prescreening of the offspring’s objective function values and identifying the best one, which will be evaluated with the true function. The best offspring will replace its parent’s position in the population if its function value is smaller than that of its parent. A local surrogate model is then built with selected current best solutions. An optimizer is applied to find the optimum of the local model. The optimal solution is then evaluated with the true function. Besides, a better point found in the local search will be added into the population in the global search. Global and local searches will alternate if one search cannot lead to a better solution. Comprehensive analysis is conducted to study the mechanism of ESAO and insights are gained on different local surrogates. The proposed algorithm is compared with two state-of-the-art SAEAs on a series of high-dimensional problems and results show that ESAO behaves better both in effectiveness and robustness on most of the test problems. Besides, ESAO is applied to an airfoil optimization problem to show its effectiveness. [ABSTRACT FROM AUTHOR]