Search

The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defective items, negative if it has up to $\ell $ defective items, where $0 \leq \ell < u$ , and arbitrary otherwise. This is called threshold group testing. The parameter $g = u - \ell - 1$ is called the gap. In this paper, we focus on the case $g > 0$ , i.e., threshold group testing with a gap. Note that the results presented here are also applicable to the case $g = 0$ ; however, the results are not as efficient as those in related work. Currently, a few reported studies have investigated test designs and decoding algorithms for identifying defective items. Most of the previous studies have not been feasible because there are numerous constraints on their problem settings or the decoding complexities of their proposed schemes are relatively large. Therefore, it is compulsory to reduce the number of tests as well as the decoding complexity, i.e., the time for identifying the defective items, for achieving practical schemes. The work presented here makes five contributions. The first is a more accurate theorem for a non-adaptive algorithm for threshold group testing proposed by Chen and Fu. The second is an improvement in the construction of disjunct matrices, which are the main tools for tackling (threshold) group testing and other tasks such as constructing cover-free families or learning hidden graphs. Specifically, we present a better exact upper bound on the number of tests for disjunct matrices compared with that in related work. The third and fourth contributions are a reduced exact upper bound on the number of tests and a reduced asymptotic bound on the decoding time for identifying defective items in a noisy setting on test outcomes. The fifth contribution is a simulation on the number of tests of the resulting improvements for previous work and the proposed theorems. [ABSTRACT FROM AUTHOR]

Suppression of excessively synchronous beta frequency (12–35 Hz) oscillatory activity in the basal ganglia is believed to correlate with the alleviation of hypokinetic motor symptoms of the Parkinson’s disease. Delayed feedback is an effective strategy to interrupt the synchronization and has been used in the design of closed-loop neuromodulation methods computationally. Although tremendous efforts in this are being made by optimizing delayed feedback algorithm and stimulation waveforms, there are still remaining problems in the selection of effective parameters in the delayed feedback control schemes. In most delayed feedback neuromodulation strategies, the stimulation signal is obtained from the local field potential (LFP) of the excitatory subthalamic nucleus (STN) neurons and then is administered back to STN itself only. The inhibitory external globus pallidus (GPe) nucleus in the excitatory–inhibitory STN–GPe reciprocal network has not been involved in the design of the delayed feedback control strategies. Thus, considering the role of GPe, this paper proposes three schemes involving GPe in the design of the delayed feedback strategies and compared their effectiveness to the traditional paradigm using STN only. Based on a neural mass model of STN–GPe network having capability of simulating the LFP directly, the proposed stimulation strategies are tested and compared. Our simulation results show that the four types of delayed feedback control schemes are all effective, even if with a simple linear delayed feedback algorithm. But the three new control strategies we propose here further improve the control performance by enlarging the oscillatory suppression space and reducing the energy expenditure, suggesting that they may be more effective in applications. This paper may guide a new approach to optimize the closed-loop deep brain stimulation treatment to alleviate the Parkinsonian state by retargeting the measurement and stimulation nucleus. [ABSTRACT FROM AUTHOR]

Diabetes mellitus is one of the major public health problems in the world due to its high prevalence and medical costs. The prevention effort necessitates reliable risk assessment models which can effectively identify high-risk individuals and enable healthcare practitioners to initiate appropriate preventive interventions. However, diabetes risk assessment models based on data analysis face multiple challenges, such as class imbalance and low identification rate. To cope with these challenges, this paper proposed an analytical framework based on data-driven approaches using large population data from the Henan Rural Cohort Study. A joint bagging-boosting model (JBM) was developed and validated. For the convenience of large-scale population screening, our study excluded laboratory variables and collinearity variables using the maximum likelihood ratio method to obtain accessibility variables. Then, we explored the effects of different methods for dealing with the unbalanced nature of the available data, including over-sampling and under-sampling methods. Finally, to improve the overall model performance, a joint model which combined the bagging and boosting algorithms with the stacking algorithm was constructed. The model we built demonstrated good discrimination, with an area under the curve (AUC) value of 0.885, and acceptable calibration (Brier score = 0.072). Compared with the benchmark model, the proposed framework improved the AUC value of the overall model performance by 13.5%, and the recall increased from 0.744 to 0.847. The proposed model contributes to the personalized management of diabetes, especially in medical resource-poor settings. [ABSTRACT FROM AUTHOR]

Natural ecosystems exhibit complex dynamics of interacting species. Man-made ecosystems exhibit similar dynamics and, in the case of mobile app stores, can be said to perform optimization as developers seek to maximize app downloads. This work aims to understand stability and instability within app store dynamics and how it affects fitness. The investigation is carried out with AppEco, a model of the iOS App Store, which was extended for this paper and updated to model the store from 2008 to 2014. AppEco models apps containing features, developers who build the apps, users who download apps according to their preferences, and an app store that presents apps to the users. It also models developers who use commonly observed strategies to build their apps: innovator, milker, optimizer, copycat, and flexible (the ability to choose any strategy). Results show that despite the success of the copycat strategy, there is a clear stable state for low proportion of copycats in developer populations, mirroring results in theoretical biology for producer–scrounger systems. The results also show that the best fitness is achieved when the evolutionary optimizer (as producer) and copycat (as scrounger) strategies coexist together in stable proportions. [ABSTRACT FROM PUBLISHER]

Multiobjective evolutionary algorithms evolve a population of solutions through successive generations toward the Pareto-optimal front (POF). One of the most critical questions faced by the researchers and practitioners in this domain relates to the number of generations that may be sufficient for an algorithm to offer a good approximation of the POF for a given problem. Ironically, to date, this question largely remains unanswered and the number of generations are arbitrarily fixed a priori, with potentially punitive implications. If the a priori fixed generations are insufficient, then the algorithm reports suboptimal solutions. In contrast, if the a priori fixed generations are far too many, it implies waste of computational resources. This paper proposes a novel entropy-based dissimilarity measure that helps identify on the fly the number of generations beyond which an algorithm stabilizes, implying that either a good approximation has been obtained or that it cannot be obtained due to the stagnation of the algorithm in the search space. Given that in either case no further improvement in the approximation can be obtained, despite additional computational expense, the proposed dissimilarity measure provides a termination criterion and facilitates a termination detection algorithm. The generality, on-the-fly implementation, low-computational complexity, and the demonstrated efficacy of the proposed termination detection algorithm, on a wide range of multiobjective and many-objective test problems, define the novel contribution of this paper. [ABSTRACT FROM AUTHOR]

It is known that various types of location privacy attacks can be carried out using a personalized transition matrix that is learned for each target user, or a population transition matrix that is common to all target users. However, since many users disclose only a small amount of location information in their daily lives, the training data can be extremely sparse. The aim of this paper is to clarify the risk of location privacy attacks in this realistic situation. To achieve this aim, we propose a learning method that uses tensor factorization (or matrix factorization) to accurately estimate personalized transition matrices (or a population transition matrix) from a small amount of training data. To avoid the difficulty in directly factorizing the personalized transition matrices (or population transition matrix), our learning method first factorizes a transition count tensor (or matrix), whose elements are the number of transition counts that the user has made, and then normalizes counts to probabilities. We focus on a localization attack, which derives an actual location of a user at a given time instant from an obfuscated trace, and compare our learning method with the maximum likelihood (ML) estimation method in both the personalized matrix mode and the population matrix mode. The experimental results using four real data sets show that the ML estimation method performs only as well as a random guess in many cases, while our learning method significantly outperforms the ML estimation method in all of the four data sets. [ABSTRACT FROM PUBLISHER]

Social hierarchy (i.e., pyramid structure of societies) is a fundamental concept in sociology and social network analysis. The importance of social hierarchy in a social network is that the topological structure of the social hierarchy is essential in both shaping the nature of social interactions between individuals and unfolding the structure of the social networks. The social hierarchy found in a social network can be utilized to improve the accuracy of link prediction, provide better query results, rank web pages, and study information flow and spread in complex networks. In this paper, we model a social network as a directed graph G, and consider the social hierarchy as DAG (directed acyclic graph) of G, denoted as GD. By DAG, all the vertices in G can be partitioned into different levels, the vertices at the same level represent a disjoint group in the social hierarchy, and all the edges in DAG follow one direction. The main issue we study in this paper is how to find DAG GD in G. The approach we take is to find GD by removing all possible cycles from G such that G=U(G)∪GD, where U(G) is a maximum Eulerian subgraph which contains all possible cycles. We give the reasons for doing so, investigate the properties of GD found, and discuss the applications. In addition, we develop a novel two-phase algorithm, called Greedy-&-Refine, which greedily computes an Eulerian subgraph and then refines this greedy solution to find the maximum Eulerian subgraph. We give a bound between the greedy solution and the optimal. The quality of our greedy approach is high. We conduct comprehensive experimental studies over 14 real-world datasets. The results show that our algorithms are at least two orders of magnitude faster than the baseline algorithm. [ABSTRACT FROM AUTHOR]

Large-scale design optimization of electric machines is oftentimes practiced to achieve a set of objectives, such as the minimization of cost and power loss, under a set of constraints, such as maximum permissible torque ripple. Accordingly, the design optimization of electric machines can be regarded as a constrained optimization problem (COP). Evolutionary algorithms (EAs) used in the design optimization of electric machines including differential evolution (DE), which has received considerable attention during recent years, are unconstrained optimization methods that need additional mechanisms to handle COPs. In this paper, a new optimization algorithm that features combined multi-objective optimization with differential evolution (CMODE) has been developed and implemented in the design optimization of electric machines. A thorough comparison is conducted between the two counterpart optimization algorithms, CMODE and DE, to demonstrate CMODE’s superiority in terms of convergence rate, diversity and high definition of the resulting Pareto fronts, and its more effective constraint handling. More importantly, CMODE requires a lesser number of simultaneous processing units which makes its implementation best suited for state-of-the-art desktop computers reducing the need for high-performance computing systems and associated software licenses. [ABSTRACT FROM PUBLISHER]

Stability analysis is an important research direction in evolutionary game theory. Evolutionarily stable states have a close relationship with Nash equilibria of repeated games, which are characterized by the folk theorem. When applying the folk theorem, one needs to compute the minimax profile of the game in order to find Nash equilibria. Computing the minimax profile is an NP-hard problem. In this paper, we investigate a new methodology to compute evolutionary stable states based on the level- k equilibrium, a new refinement of Nash equilibrium in repeated games. A level- k equilibrium is implemented by a group of players who adopt reactive strategies and who have no incentive to deviate from their strategies simultaneously. Computing the level- k equilibria is tractable because the minimax payoffs and strategies are not needed. As an application, this paper develops a tractable algorithm to compute the evolutionarily stable states and the Pareto front of n -player symmetric games. Three games, including the iterated prisoner’s dilemma, are analyzed by means of the proposed methodology. [ABSTRACT FROM PUBLISHER]

There are few systematic methodologies capable of predicting and leveraging the reserve capacity potential of large populations of thermostatically-controlled loads (TCLs). For such reserves to have economic and technical value, it is essential that demand-side flexibility aggregators and system operators be able to do so quickly and robustly. In addition, aggregators need to ensure TCL users' comfort and end use satisfaction. Part I of this two-part paper introduces an analytical approach to characterize and control the statistical bounds on the potential aggregated response of a population of TCLs, while ensuring users' comfort satisfaction. First, the uncertainty associated with the instantaneous power consumption of a typical TCL is described by a set of random variables and their statistics. TCL statistics are then employed to characterize the exploitable flexibility from a large population of similar devices. From this, a control strategy and parameters are introduced for sporadic (i.e., contingency-type) reserve provision by the population. In Part II, the proposed analytical approach and control strategy are validated for the special case of electric water heaters (EWHs). Further, the trade-off between demand response capacity and EWH users' comfort satisfaction is investigated through several case studies. [ABSTRACT FROM AUTHOR]

An optimization technique based on the combination of optimization algorithm and sensitivity analysis is discussed. The technique allows reducing the number of optimized parameters during the optimization process, which consequently reduces the search space and time of optimization. This paper explains the principle, benefits, and future challenges of this technique and illustrates its utilization with numerical experiments and a typical example. The algorithm is implemented in the framework OptiLab that represents a part of the application Agros2D developed by me. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid algorithm based on the genetic algorithm (GA) and the evolution strategy (ES) for the electromagnetic optimization problem. The GA is not good enough at times in searching the optimal solution from the view point of the convergence speed and the solution quality, while the ES has the risk of being trapped in a local minimum. The hybrid algorithm is composed of GA and ES in order to make up for these defects. First, we reached the vicinity of optimal solution using the GA. Then, the ES is used to find the accurate optimal solution. The switching point can be a main issue, which is also resolved in this paper. First, the performance of the convergence speed and the solution accuracy are comparatively tested using the known functions. In addition, the optimized design of the 2.45 GHz coplanar waveguide-fed circularly polarized antenna is carried out as a practical application. Only the GA and the hybrid algorithm reach the satisfactory value, and the more rapid convergence can be shown by the ES in this hybrid method after 380 iterations. [ABSTRACT FROM AUTHOR]

In cyber-physical systems (CPS), service organizers (SOs) aim to collect service from service entities at lower price and provide better combined services to users. However, each entity receives payoffs when providing services, which leads to competition between SOs and service entities or within internal service entities. In this paper, we first formulate the price competition model of SOs where the SOs dynamically increase and decrease their service prices periodically according to the number of collected services from entities. A game based s ervices price decision (GSPD) model which depicts the process of price decisions is proposed in this paper. In the GSPD model, entities game with other entities under the rule of “survival of the fittest” and calculate payoffs according to their own payoff-matrix, which leads to a Pareto-optimal equilibrium point. Numerous experiments demonstrate that the GSPD model can explain the price dynamics in the real world, and also can help decision makers a lot under various scenarios. [ABSTRACT FROM PUBLISHER]

The use of distributed generation (DG) resources is seen as a key important factor in improving technical and economic aspects of distribution systems. However, little research exists concerning the optimal location and operation of DGs. This paper proposes a novel method to find simultaneously the optimal location and operation of DGs. The method is developed in two phases, namely Phase 1 and 2. Phase 1 deals with the optimal location of DGs using a multiobjective optimization problem in which active power loss reduction, voltage profile improvement, and voltage regulation are the objectives. A Pareto frontier differential evolution (PDE) algorithm is developed to solve the multiobjective problem. Phase 2 copes with the optimal income of the DGs’ owners along with the optimal total payment of the distribution company by adopting a bi-level optimization method with two agents. Game theory is employed to assist in finding optimal contract prices. The performance of the proposed method is evaluated by using two IEEE, 33-bus, and 69-bus, standard distribution networks. This paper concludes that the proposed method can serve as an accurate tool for practitioners in finding the optimal location and operation strategy of DGs. [ABSTRACT FROM PUBLISHER]

This paper proposes a fully distributed control strategy for the management of micro-storage devices that perform energy arbitrage. For large storage populations, the problem can be approximated as a differential game with infinite players (mean field game). Through the resolution of coupled partial differential equations (PDEs), it is possible to determine, as a fixed point, the optimal feedback strategy for each player and the resulting price of energy if that strategy is applied. Once this price is calculated, it can be communicated to the devices, which are able to independently determine their optimal charge profile. Simulation results are provided, calculating the fixed point through numerical integration of the PDEs. The original model is then extended in order to consider additional elements, such as multiple population of devices and demand uncertainty. [ABSTRACT FROM PUBLISHER]

This paper studies the behavior of regularized Tyler estimators (RTEs) of scatter matrices. The advantages of these estimators are twofold. First, they guarantee by construction a good conditioning of the estimate and second, being derivatives of robust Tyler estimators, they inherit their robustness properties, notably their resilience to outliers. Nevertheless, one major problem that poses the use of RTEs is represented by the question of setting the regularization parameter \rho . While a high value of \rho is likely to push all the eigenvalues away from zero, it comes at the cost of a larger bias with respect to the population covariance matrix. A deep understanding of the statistics of RTEs is essential to come up with appropriate choices for the regularization parameter. This is not an easy task and requires working under asymptotic regimes wherein the number of observations n and/or their size N increase together. First asymptotic results have recently been obtained when N and n are large and commensurable. Interestingly, no results concerning the regime of n going to infinity with N fixed exist. This motivates our work. In particular, we prove in this paper that the RTEs converge to a deterministic matrix when n\to \infty with N fixed, which is expressed as a function of the theoretical covariance matrix. We also derive the fluctuations of the RTEs around this limit and establish that these fluctuations converge in distribution to a multivariate Gaussian distribution with parameters depending on the population covariance and the regularization coefficient. [ABSTRACT FROM AUTHOR]

This paper proposes a methodology to determine a realistic time-dependent dielectric breakdown failure rate. The in-die constant voltage stress was performed to determine the chip level Weibull shape ( \beta \mathrm{die}) and voltage acceleration factor, while a voltage ramp (Vramp) is performed in production line (inline Vramp) to determine the via-to-line and line-to-line spacing distributions. We found that for the chip population with spacing ( $s$ ) smaller than 4 nm, the in-die voltage accelerations based on power-law and sqrt-V models do not lead to a significant difference in the lifetime prediction. For the chips with large spacing, the stress voltage ( $\sim 20$ V) is significantly higher than the operating voltage (1 V). The extrapolation using the power law results in an infinitely long lifetime, which could lead to an overoptimistic reliability prediction. In this paper, a new method is introduced for a more realistic failure rate calculation, which is the superposition of the failure rates of chips with small spacing ( $s<4$ nm) and the failure rates of chips with large spacing, by using different voltage acceleration models. [ABSTRACT FROM AUTHOR]

Existing population-based Stochastic Search Algorithms (SSAs) are too time-consuming to solve dynamic optimal power flow (OPF). The solution proposed in this paper is to accelerate SSAs with memory. Two memory schemes, the similarity retrieval scheme and the mean-based immigrants scheme, are proposed and applied together to the Differential Evolution and Particle Swarm Optimizer, which are two representatives of SSAs. Experiments are conducted on modified IEEE 30-bus and IEEE 118-bus systems with changing load buses and the objective of minimizing real power transmission loss. The results show that the proposed schemes significantly improve the performance of the two existing algorithms, and that SSAs could be practical for tracking optima of dynamic OPF. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of associating mobile stations (MSs) with base stations (BSs) in an energy-efficient manner. We take a population game approach, which allows tractable analysis of many selfish mobiles without growing mathematical complexity. From our game-theoretical analysis, we prove that a simple power-dependent pricing by operators leads a Nash equilibrium to be equal to the optimal solution of a social optimization problem (i.e., no price-of-anarchy). We study three evolution dynamics of associating MSs, each expressed as a differential equation, all of which provably and/or numerically converge to the Nash equilibrium. Based on several considerations regarding implementation of association algorithms in practice, we found that asynchronicity and fast load tracking are the key components to practical algorithms. Motivated by this, we propose a practical energy-efficient user association mechanism, named BRUTE. To evaluate the performance of BRUTE, we implement a cellular network simulator using an event-driven simulator, SimPy, and perform extensive simulations under various scenarios including a real BS topology in U.K. Our simulation results show that BRUTE outperforms other conventional user association techniques. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce a hierarchical system model that captures the decision making processes involved in a network of multiple providers and a large number of consumers in the smart grid, incorporating multiple processes from power generation to market activities and to power consumption. We establish a Stackelberg game between providers and end users, where the providers behave as leaders maximizing their profit and end users act as the followers maximizing their individual welfare. We obtain closed-form expressions for the Stackelberg equilibrium of the game and prove that a unique equilibrium solution exists. In the large population regime, we show that a higher number of providers help to improve profits for the providers. This is inline with the goal of facilitating multiple distributed power generation units, one of the main design considerations in the smart grid. We further prove that there exist a unique number of providers that maximize their profits, and develop an iterative and distributed algorithm to obtain it. Finally, we provide numerical examples to illustrate the solutions and to corroborate the results. [ABSTRACT FROM PUBLISHER]

Scheduling for directed acyclic graph (DAG) tasks with the objective of minimizing makespan has become an important problem in a variety of applications on heterogeneous computing platforms, which involves making decisions about the execution order of tasks and task-to-processor mapping. Recently, the chemical reaction optimization (CRO) method has proved to be very effective in many fields. In this paper, an improved hybrid version of the CRO method called HCRO (hybrid CRO) is developed for solving the DAG-based task scheduling problem. In HCRO, the CRO method is integrated with the novel heuristic approaches, and a new selection strategy is proposed. More specifically, the following contributions are made in this paper. (1) A Gaussian random walk approach is proposed to search for optimal local candidate solutions. (2) A left or right rotating shift method based on the theory of maximum Hamming distance is used to guarantee that our HCRO algorithm can escape from local optima. (3) A novel selection strategy based on the normal distribution and a pseudo-random shuffle approach are developed to keep the molecular diversity. Moreover, an exclusive-OR (XOR) operator between two strings is introduced to reduce the chance of cloning before new molecules are generated. Both simulation and real-life experiments have been conducted in this paper to verify the effectiveness of HCRO. The results show that the HCRO algorithm schedules the DAG tasks much better than the existing algorithms in terms of makespan and speed of convergence. [ABSTRACT FROM AUTHOR]

Power converters systems aimed at renewable energy applications have become a common option for sustainable electricity and distributed generation, since their performance has improved, and prices have steadily been reduced in the last years. However, there are still several drawbacks that hinder their widespread installation, such as the simultaneous minimization of cost and volume, efficiency maximization, size reduction, etc. Quite often, accomplishing these goals requires dealing with complicated optimization problems, which are difficult to solve by classical methods. Metaheuristic techniques provide a viable alternative to solve complex intricate optimization problems, such as those encountered in the development of power electronics converters. This paper presents a comprehensive coverage of metaheuristic methodologies applied in the area of power converters. The review includes a classification of the methodologies and main objective functions in each paper surveyed. An aim for this paper is to highlight the importance of the optimization tools, and the many benefits they provide to tackle the challenges encountered in the design, operation, and control of power converters. [ABSTRACT FROM AUTHOR]

Most researchers employed common functional models when managing scheduling problems with controllable processing times. However, in many complicated manufacturing systems with a high diversity of jobs, these functional resource models fail to reflect their specific characteristics. To fulfill these requirements, we apply a more general model, the discrete model. Traditional functional models can be viewed as special cases of such model. In this paper, the discrete model is implemented on a problem of minimizing the weighted resource allocation subject to a common deadline on a single machine. By reducing the problem to a partition problem, we demonstrate that it is NP-complete, which addresses the difficult issue of the guarantee of both the solution quality and time cost. In order to tackle the problem, we develop an estimation of distribution algorithm based on an approximation of the Boltzmann distribution. The approximation strategy represents a tradeoff between complexity and solution accuracy. The results of the experiments conducted on benchmarks show that, compared with other alternative approaches, the proposed algorithm has competitive behavior, obtaining 74 best solutions out of 90 instances. [ABSTRACT FROM AUTHOR]

In this paper, a novel approach is proposed to improve the classification performance of a polynomial neural network (PNN). In this approach, the partial descriptions (PDs) are generated at the first layer based on all possible combinations of two features of the training input patterns of a dataset. The set of PDs from the first layer, the set of all input features, and a bias constitute the chromosome of the real-coded genetic algorithm (RCGA). A system of equations is solved to determine the values of the real coefficients of each chromosome of the RCGA for the training dataset with the mean classification accuracy (CA) as the fitness value of each chromosome. To adjust these values for unknown testing patterns, the RCGA is iterated in the usual manner using simple selection, crossover, mutation, and elitist selection. The method is tested extensively with the University of California, Irvine benchmark datasets by utilizing tenfold cross validation of each dataset, and the performance is compared with various well-known state-of-the-art techniques. The results obtained from the proposed method in terms of CA are superior and outperform other known methods on various datasets. [ABSTRACT FROM PUBLISHER]

This paper addresses impacts of hydrogen production and thermal energy recovery with an economic model of proton exchange membrane fuel cell power plant (PEMFCPP) on optimal operation management of renewable microgrids (MGs). A stochastic scenario-based approach is proposed to capture uncertainties of electrical and thermal loads, output power production of photovoltaic (PV) and wind turbine (WT) units, market price, natural gas price, hydrogen selling price, operating temperature of the stack of fuel cells (FCs), and pressure of hydrogen and oxygen. The proposed economic model is tested on an MG with different types of power sources including FCs, PV and WT units, and microturbines (MTs). [ABSTRACT FROM PUBLISHER]

In many diagnostic imaging settings, including positron emission tomography (PET), images are typically used for multiple tasks such as detecting disease and quantifying disease. Unlike conventional image reconstruction that optimizes a single objective, this work proposes a multi-objective optimization algorithm for PET image reconstruction to identify a set of images that are optimal for more than one task. This work is reliant on a genetic algorithm to evolve a set of solutions that satisfies two distinct objectives. In this paper, we defined the objectives as the commonly used Poisson log-likelihood function, typically reflective of quantitative accuracy, and a variant of the generalized scan-statistic model, to reflect detection performance. The genetic algorithm uses new mutation and crossover operations at each iteration. After each iteration, the child population is selected with non-dominated sorting to identify the set of solutions along the dominant front or fronts. After multiple iterations, these fronts approach a single non-dominated optimal front, defined as the set of PET images for which none the objective function values can be improved without reducing the opposing objective function. This method was applied to simulated 2D PET data of the heart and liver with hot features. We compared this approach to conventional, single-objective approaches for trading off performance: maximum likelihood estimation with increasing explicit regularization and maximum a posteriori estimation with varying penalty strength. Results demonstrate that the proposed method generates solutions with comparable to improved objective function values compared to the conventional approaches for trading off performance amongst different tasks. In addition, this approach identifies a diverse set of solutions in the multi-objective function space which can be challenging to estimate with single-objective formulations. [ABSTRACT FROM AUTHOR]

Power cables are critical assets for the reliable operation of the grid. The cable lifetime is generally estimated from the conductor temperature, and associated lifetime reduction. However, these tasks are intricate due to the complex physics-of-failure (PoF) degradation mechanism of the cable. This is further complicated with the different sources of uncertainty that affect the cable lifetime estimation. Generally, simplified or deterministic PoF models are adopted resulting in non-accurate decision-making under uncertainty. In contrast, the integration of uncertainties leads to a probabilistic decision-making process impacting directly on the flexibility to adopt decisions. Accordingly, this paper presents a novel cable lifetime estimation framework that connects data-driven probabilistic uncertainty models with PoF-based operation, and degradation models through Bayesian state-estimation techniques. The framework estimates the cable health state, and infers confidence intervals to aid decision-making under uncertainty. The proposed approach is validated with a case study with different configuration parameters, and the effect of measurement errors on cable lifetime are evaluated with a sensitivity analysis. Results demonstrate that ambient temperature measurement errors influence more than load measurement errors, and the greater the cable conductor temperature the greater the influence of uncertainties on the lifetime estimate. [ABSTRACT FROM AUTHOR]

Traditional methods of Human Activity Recognition (HAR) do not take into consideration physical attributes of human subjects such as height, weight, gender etc. Thus, a particular recognition model does not perform consistently for different subjects having diverse physical attributes. In this paper, we propose a novel Physique-based HAR method that takes care of this problem and provides better accuracy in comparatively less time. Raw sensor data are acquired from inbuilt accelerometer and gyroscope sensor modules of smartphones. After pre-processing of the collected data physique-based datasets were prepared, based on the similarities of subjects’ physique. Analysis is done on both of these physique-based datasets and normal traditional dataset with the help of various machine learning algorithms. The work not only identifies the suitable learning algorithms for HAR but also shows that the proposed physique-based method outperforms the traditional HAR approach for both publicly available dataset and our own generated dataset, with an accuracy of 99.88%. Individual activity-wise accuracy results are also compared with several recent benchmarks to show the efficiency of the proposed Physique-based HAR method. [ABSTRACT FROM AUTHOR]

This paper studies the problem of developing an efficient signal sampling framework for distributed blind spectrum sensing, together with the corresponding local cognitive radio (CR) decision and fusion rules. A novel collaborative sampling and binary output (CSBO) generating scheme is proposed to overcome the disadvantage of traditional energy detectors for blind spectrum sensing, in which the signal-to-noise ratio (SNR) and level of noise power at the CRs are unknown and thus the decision threshold of local energy detectors cannot be specified. In designing the fusion rule in conjunction with the proposed CSBO scheme, both fixed-sample-size tests and sequential tests are considered. It is theoretically shown that the proposed CSBO scheme outperforms traditional blind cooperative energy detectors with uniform sampling schemes in terms of its ability to increase the amount of information acquired under a given number of samples. Simulation results confirm the theoretical analyses, and demonstrate that, compared with the fixed-sample-size test, the sequential test requires fewer observations on average to achieve comparable detection performance. The reduction in the expected sample size needed in the sequential CSBO test when compared to the fixed-sample-size CSBO can reach 50% when primary signal is present. [ABSTRACT FROM AUTHOR]

Various Artificial Intelligence (AI) techniques are combined with classic side-channel methods to improve the efficiency of attacks. Among them, Genetic-Algorithms-based Correlation Power Analysis (GA-CPA) is proposed to launch attacks on hardware cryptosystems to extract the secret key efficiently. However, the convergence efficiency of GA-CPA is unsatisfactory due to two problems: the randomly generated initial population generally have low fitness, and the mutation operation in each iteration hardly produces high-quality individuals because of the confusion and diffusion characteristics of S-boxes. In this paper, we propose an analysis framework of GA-CPA which focuses on solving these two problems. First, we explore the list of candidate key bytes which is the result of Correlation Power Analysis (CPA) on a limited number of power traces, so that the population can be initialized with high quality candidates. Second, we improve the mutation operation by guiding the candidate key to mutate in a higher-fitness direction instead of randomly. Third, we make full use of the fitness calculation method and combine it with key enumeration algorithms to further improve the efficiency of key recovery. Simulation experimental results show that our method reduces the number of traces by 33.3% and 43.9% compared to CPA with key enumeration and GA-CPA respectively when the success rate is fixed to 90%. Real experiments performed on SAKURA-G confirm that the number of traces required in our method is much less than the numbers of traces required in CPA and GA-CPA. Besides, we adjust our method to deal with DPA contest v1 dataset, and achieve a better result of 40.76 traces than the winning proposal of 42.42 traces. The computation cost of our proposal is nearly 16.7% of the winner. [ABSTRACT FROM AUTHOR]

With the rapid development of in-vehicle communication technology and the integration of big data intelligent technology, intelligent algorithms for vehicle communication used to predict traffic flow and location information have been widely used. Aiming at the problem that the gravitational algorithm is difficult to minimize the complex function and easily fall into the local optimum, this paper proposes an improved IGSA algorithm. First, a gridding algorithm is introduced to initialize the population, and under the premise of ensuring the randomness of the initial individuals, improving the ergodicity of the population is conducive to improving the quality of the solution; then, an adaptive location-based update strategy of decreasing inertia weights is proposed. this strategy inherits the advantages of linearly decreasing weights, and adaptively adjusts the weights according to the fitness value to further improve the optimization performance. The optimization simulation of 8 classic test functions shows that the IGSA algorithm is an effective algorithm for solving complex optimization problems. Finally, the IGSA algorithm is used to predict the geographic location problem in the vehicle GPS data. The IGSA algorithm is used to optimize the extreme learning method to optimize the hyperparameters and establish a vehicle GPS data prediction model. Simulation results verify the feasibility of the method. [ABSTRACT FROM AUTHOR]

There is a pressing need for strategies to slow or treat the progression of functional decline in people living with HIV. This paper explores a novel rehabilitation robotics approach to measuring cognitive and motor impairment in adults living with HIV, including a subset with stroke. We conducted a cross-sectional study with 21 subjects exhibiting varying levels of cognitive and motor impairment. We tested three robot-based tasks – trajectory tracking, N-back, and spatial span – to assess if metrics derived from these tasks were sensitive to differences in subjects with varying levels of executive function and upper limb motor impairments. We also examined how well these metrics could estimate clinical cognitive and motor scores. The results showed that the average sequence length on the robot-based spatial span task was the most sensitive to differences between various cognitive and motor impairment levels. We observed strong correlations between robot-based measures and clinical cognitive and motor assessments relevant to the HIV population, such as the Color Trails 1 (rho = 0.83), Color Trails 2 (rho = 0.71), Digit Symbol – Coding (rho = 0.81), Montreal Cognitive Assessment – Executive Function subscore (rho = 0.70), and Box and Block Test (rho = 0.74). Importantly, our results highlight that gross motor impairment may be overlooked in the assessment of HIV-related disability. This study shows that rehabilitation robotics can be expanded to new populations beyond stroke, namely to people living with HIV and those with cognitive impairments. [ABSTRACT FROM AUTHOR]

The goal of sample-data-based origin-destination (O-D) demand estimation is to aggregate the location data into the traffic network. Inevitably, the scaling rate, which expands the estimated O-D demands to the population level, should be generated. In this paper, a two-stage optimization model is explored for determining the sensor location and stochastic scaling rate. In the first stage, a sensor deployment model identifies the optimal sensor location strategy by minimizing the variability of the scaling rate under a budget constraint. In the second stage, a Bayesian-based scaling rate inference model leverages the prior information and the data that were observed at the identified sensor locations to derive the stochastic scaling rate. The Bayesian-based scaling rate inference model is a bilevel program, which seeks the maximum a posteriori (MAP) scaling rate conditioned by the observed link flows in the upper level and optimizes the stochastic user equilibrium (SUE) in the lower level. To reflect the interactive relationships between the sensor location and the stochastic scaling rate inference, an integrating model is built. A sequential identifying sensor location algorithm that avoids matrix inversions was proposed to solve the sensor deployment model, and an iterative solution algorithm was developed to solve the Bayesian-based scaling rate inference model. The results from numerical experiments demonstrate that the sensor deployment model could provide the most reliable scheme of sensor locations, thereby contributing to the reliable estimation of the stochastic scaling rate. The results also demonstrate that both the endogenous information (prior information on the scaling rate) and exogenous factors (link flows) can facilitate a more accurate scaling rate inference. [ABSTRACT FROM AUTHOR]

In this paper, a fast power/ground (P/G) pin assignment method for large-scale high-pin-count ball grid array (BGA) packages using static template is proposed. The static template is generated using genetic algorithm. An algorithm is developed to remove the boundary problem of the static template so that its copies can be directly merged into a large-scale BGA package. The selection of the size of static template is demonstrated. A visual demonstration method is presented to better evaluate the quality of the assignment of signal and P/G pins by human eyes. Using static template method, the pin assignment of a $50\times 50$ BGA package with blocks of core, I/Os and differential pairs can be generated in a few tens of seconds automatically. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a vehicle type classification method using a semisupervised convolutional neural network from vehicle frontal-view images. In order to capture rich and discriminative information of vehicles, we introduce sparse Laplacian filter learning to obtain the filters of the network with large amounts of unlabeled data. Serving as the output layer of the network, the softmax classifier is trained by multitask learning with small amounts of labeled data. For a given vehicle image, the network can provide the probability of each type to which the vehicle belongs. Unlike traditional methods by using handcrafted visual features, our method is able to automatically learn good features for the classification task. The learned features are discriminative enough to work well in complex scenes. We build the challenging BIT-Vehicle dataset, including 9850 high-resolution vehicle frontal-view images. Experimental results on our own dataset and a public dataset demonstrate the effectiveness of the proposed method. [ABSTRACT FROM PUBLISHER]

Radio frequency identification (RFID) systems are widely used in various applications such as supply chain management, inventory control, and object tracking. Identifying RFID tags in a given tag population is the most fundamental operation in RFID systems. While the Tree Walking (TW) protocol has become the industrial standard for identifying RFID tags, little is known about the mathematical nature of this protocol, and only some ad hoc heuristics exist for optimizing it. In this paper, first we analytically model the TW protocol, and then using that model, propose the Tree Hopping (TH) protocol that optimizes TW both theoretically and practically. The key novelty of TH is to formulate tag identification as an optimization problem and find the optimal solution that ensures the minimal average number of queries or identification time as per the requirement. With this solid theoretical underpinning, for different tag population sizes ranging from 100 to 100 K tags, TH significantly outperforms the best prior tag identification protocols on the metrics of the total number of queries per tag, the total identification time per tag, and the average number of responses per tag by an average of 40%, 59%, and 67%, respectively, when tag IDs are nonuniformly distributed in the ID space, and of 50%, 10%, and 30%, respectively, when tag IDs are uniformly distributed. [ABSTRACT FROM PUBLISHER]

Decomposition-based evolutionary algorithms have been quite successful in solving optimization problems involving two and three objectives. Recently, there have been some attempts to exploit the strengths of decomposition-based approaches to deal with many objective optimization problems. Performance of such approaches are largely dependent on three key factors: 1) means of reference point generation; 2) schemes to simultaneously deal with convergence and diversity; and 3) methods to associate solutions to reference directions. In this paper, we introduce a decomposition-based evolutionary algorithm wherein uniformly distributed reference points are generated via systematic sampling, balance between convergence and diversity is maintained using two independent distance measures, and a simple preemptive distance comparison scheme is used for association. In order to deal with constraints, an adaptive epsilon formulation is used. The performance of the algorithm is evaluated using standard benchmark problems, i.e., DTLZ1-DTLZ4 for 3, 5, 8, 10, and 15 objectives, WFG1-WFG9, the car side impact problem, the water resource management problem, and the constrained ten-objective general aviation aircraft design problem. Results of problems involving redundant objectives and disconnected Pareto fronts are also included in this paper to illustrate the capability of the algorithm. The study clearly highlights that the proposed algorithm is better or at par with recent reference direction-based approaches for many objective optimization. [ABSTRACT FROM AUTHOR]

Integration of plug-in electric vehicle (PEV) will influence distribution systems in various aspects from network loss and operating costs to system reliability. PEVs can be either mobile loads or mobile storages dispersed in the network. In this paper, distribution feeder reconfiguration (DFR) technique is employed as a reliability-enhancing strategy to coordinate vehicle-to-grid (V2G) provision of PEV fleets in a stochastic framework. Uncertainties associated with network load demand, energy price, wind power generation, and PEV fleet behavior are considered. The proposed stochastic optimization problem is solved with a self-adaptive evolutionary algorithm based on symbiotic organism search (SOS). Numerical studies on standard test system verify the efficacy of the proposed DFR to improve the system reliability and optimal dispatch of V2G. [ABSTRACT FROM PUBLISHER]

A deep understanding of people's activity-travel behaviors is critical and essential for effective travel demand forecasting and management. Although it is acknowledged that social interactions play an important role in people's decision-making behaviors, our understanding of how they shape and impact activity-travel behaviors of people is still limited. Therefore, for the first time, this paper introduces social learning into artificial transportation systems (ATSs) to model their influence on activity-travel behaviors. Based on a specified ATS, three types of universal social interactions (i.e., imitation, conformity, and experience sharing on social networks) are modeled and studied. The results indicate that our models can make artificial agents learn to decide the best behavior, form habitual choices, and emerge fashion gradually. [ABSTRACT FROM PUBLISHER]

Enterprise servers require customized solid-state drives (SSDs) to satisfy their specialized I/O performance and reliability requirements. For effective use of SSDs for enterprise purposes, SSDs must be designed considering requirements such as those related to performance, lifetime, and cost constraints. However, SSDs have numerous hardware and software design options, such as flash memory types and block allocation methods, which have not been well analyzed yet, but on which the SSD performance depends. Furthermore, there is no methodology for determining the optimal design for a particular I/O workload. This paper proposes SSD-Tailor, a customization tool for SSDs. SSD-Tailor determines a near-optimal set of design options for a given workload. SSD designers can use SSD-Tailor to customize SSDs in the early design stage to meet the customer requirements. We evaluate SSD-Tailor with nine I/O workload traces collected from real-world enterprise servers. We observe that SSD-Tailor finds near-optimal SSD designs for these workloads by exploring only about 1% of the entire set of design candidates. We also show that the near-optimal designs increase the average I/O operations per second by up to 17% and decrease the average response time by up to 163% as compared to an SSD with a general design. [ABSTRACT FROM PUBLISHER]

The populations of industrialized countries will decline over the coming decades. To ensure that we have efficient access networks in the coming age of depopulation, it is important to consider the reorganization of central offices over time. The cost for operating and maintaining central offices can be reduced by efficiently closing central offices. However, dynamic facility location models that have been developed largely focused on the problem of optimally expanding a network over time to meet increasing demand. The practical relevance of the dynamic models is limited because the complexity and the required amount of data are much greater than with static models. This paper proposes a dynamic access network reorganization model for the depopulation age. Although the proposed model is a dynamic model, it is simple because it assumes that the only option will be to close central offices. The model first searches for a set of optimal solutions for each planning period as a capacitated facility location problem. Then, it selects the optimal combination of optimal solutions that can minimize the total number of open offices with the limitation of network reorganization. The validity of the proposed model was evaluated with computer simulations. It was confirmed that although the proposed model is a dynamic model it is simple and practical. [ABSTRACT FROM PUBLISHER]

This paper addresses the integrated volt-var control for distribution network operation via multiobjective optimization. This paper seeks to explore the problem of energy savings and peak demand relief through the voltage reduction procedure. Currently, due to the emergence of the distribution smart grids, these procedures are gaining renewed interest and attention. The proposal presented here is for the operation phase, with a strategy based on an hourly load forecast for the next day/week, taking into account the active power intake reduction, and the voltage deviation. Therefore, the result is a set of nondominated optimal solutions, and then one may decide when, where, and how to apply them to meet different goals. The obtained solutions, for two typical distribution networks, describe relevant economic and technical benefits. [ABSTRACT FROM AUTHOR]

This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. A simplistic principle founded upon regular variation theory is that the backoff time has a truncated Pareto-type tail distribution with an exponent of (\log \gamma \!)/\log m ( \boldsymbol m is the multiplicative factor and \gamma is the collision probability). This reveals that the per-node backoff process is heavy-tailed in the strict sense for \gamma > 1/m^2 , and paves the way for the following unifying result. The state-of-the-art theory on the superposition of the heavy-tailed processes is applied to establish a dichotomy exhibited by the aggregate backoff process, putting emphasis on the importance of time-scales on which we view the backoff processes. While the aggregation on normal time-scales leads to a Poisson process, it is approximated by a new limiting process possessing long-range dependence (LRD) on coarse time-scales. This dichotomy turns out to be instrumental in formulating short-term fairness, extending existing formulas to arbitrary population, and to elucidate the absence of LRD in practical situations. A refined wavelet analysis is conducted to strengthen this argument. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper. [ABSTRACT FROM PUBLISHER]

Harmony search (HS) algorithm is an evolutionary optimization algorithm developed in an analogy with an improvisation process where musicians try to polish their pitches to obtain a better harmony. In this paper, a modified HS (MHS) algorithm is adapted to multi-objective optimization using external archiving, ranking with crowding distance, and control parameters tuning based on Ricker map to solve a transformer design optimization (TDO) problem with two competing objectives. Simulations applied to a TDO problem demonstrate the effectiveness of the proposed multi-objective MHS algorithm. Results indicate that, compared with other multi-objective HS algorithm, in terms of output quality, the proposed MHS is able to find competitive solutions with a good tradeoff between the design objectives. [ABSTRACT FROM PUBLISHER]

Energy storage systems play a significant role in both distributed power systems and utility power systems. Among the many benefits of an energy storage system, the improvement of power system cost and voltage profile can be the salient specifications of storage systems. Studies show that improper size and placement of energy storage units leads to undesired power system cost as well as the risk of voltage stability, especially in the case of high renewable energy penetration. To solve the problem, a hybrid multi-objective particle swarm optimization (HMOPSO) approach is proposed in the paper to minimize the power system cost and improve the system voltage profiles by searching sitting and sizing of storage units under consideration of uncertainties in wind power production. Furthermore, the probability cost analysis is first put forward in this paper. The proposed HMOPSO combines multi-objective particle swarm optimization (MOPSO) algorithm with elitist nondominated sorting genetic algorithm (NSGA-II) and probabilistic load flow technique. It also incorporates a five-point estimation method (5PEM) for discretizing wind power distribution. The IEEE 30-bus system is adopted to perform case studies. The simulation results for each case clearly demonstrate the necessity for optimal storage allocation, and the effectiveness of the proposed method. [ABSTRACT FROM PUBLISHER]

Quantifying the impact of new technologies on a single distribution feeder is a tractable analysis problem. But the analysis of a single distribution feeder does not provide insight into the complexities and variations of a system-wide deployment. The inability to extrapolate system-wide impacts hinders the deployment of many promising new technologies. This paper presents a three-stage method of extrapolating technological impacts, either simulated or from a field demonstration, from a limited number of distribution feeders to the entire system. The size of the system can vary from the service territory of a single utility, to a region, or to an entire country. The paper will include an example analysis using the United States Department of Energy funded Smart Grid Investment Grant projects, extrapolating their benefits to a national level, and an example of a regionalized deployment of Volt-VAR optimization for peak demand reduction. Both of the example analyses utilize the presented three-stage extrapolation method. [ABSTRACT FROM PUBLISHER]

In this paper, a new multiobjective optimization framework based on nondominated sorting and local search (NSLS) is introduced. The NSLS is based on iterations. At each iteration, given a population P , a simple local search method is used to get a better population P' , and then the nondominated sorting is adopted on P \cup P' to obtain a new population for the next iteration. Furthermore, the farthest-candidate approach is combined with the nondominated sorting to choose the new population for improving the diversity. Additionally, another version of NSLS (NSLS-C) is used for comparison, which replaces the farthest-candidate method with the crowded comparison mechanism presented in the nondominated sorting genetic algorithm II (NSGA-II). The proposed method (NSLS) is compared with NSLS-C and the other three classic algorithms: NSGA-II, MOEA/D-DE, and MODEA on a set of seventeen bi-objective and three tri-objective test problems. The experimental results indicate that the proposed NSLS is able to find a better spread of solutions and a better convergence to the true Pareto-optimal front compared to the other four algorithms. Furthermore, the sensitivity of NSLS is also experimentally investigated in this paper. [ABSTRACT FROM AUTHOR]

Several studies have shown the importance of realistic micromobility and macromobility modeling in vehicular ad hoc networks (VANETs). At the macroscopic level, most researchers focus on a detailed and accurate description of road topology. However, a key factor often overlooked is a spatiotemporal configuration of vehicular traffic. This factor greatly influences network topology and topology variations. Indeed, vehicle distribution has high spatial and temporal diversity that depends on the time of the day and place attraction. This diversity impacts the quality of radio links and, thus, network topology. In this paper, we propose a new mobility model for vehicular networks in urban and suburban environments. To reproduce realistic network topology and topological changes, the model uses real static and dynamic data on the environment. The data concern particularly the topographic and socioeconomic characteristics of infrastructures and the spatiotemporal population distribution. We validate our model by comparing the simulation results with real data derived from individual displacement survey. We also present statistics on network topology, which show the interest of taking into account the spatiotemporal mobility variation. [ABSTRACT FROM PUBLISHER]

Brain storm optimization (BSO) is a novel population-based swarm intelligence algorithm based on the human brainstorming process. BSO has been proven feasible and has been successfully applied to benchmark problems in the electromagnetic field. In this paper, inspired by the mechanism of quantum theories, a novel variant of BSO algorithm, called quantum-behaved BSO (QBSO), is proposed to solve an optimization problem modeled for Loney’s solenoid problem. The new mechanism improves the diversity of population and also utilizes the global information to generate the new individual. Simulation results show that QBSO has better ability to jump out of local optima and perform better compared with the basic BSO. [ABSTRACT FROM AUTHOR]