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]

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]

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]

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]

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]

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]

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]

Background: Hypochondriac symptoms are commonly reported in health science students. With their incomplete medical knowledge, they may compare their own bodily symptoms with disease symptoms during the process of learning, which can lead to mental distress and the need for repeated medical reassurance. Objective: To estimate the prevalence of hypochondriac symptoms in Chinese health science students. Methods: A systematic literature search was conducted on PubMed, Web of Science, Embase, China National Knowledge Infrastructure, China Biology Medicine disc, and Wanfang Data on July 1, 2018. Additionally, the references of the retrieved papers were searched. Cross-sectional studies published in either English or Chinese that reported the prevalence of hypochondriac symptoms in health science students were included. The selection process was executed based on the Preferred Reporting Items for Systematic Reviews and Meta-Analysis, and study quality was assessed with the checklist recommended by the Agency for Healthcare Research and Quality for cross-sectional studies. A random-effects model according to the DerSimonian-Laird method was used to calculate the pooled prevalence. Results: Seven cross-sectional studies involving 6,217 Chinese health science students were included. The pooled prevalence of hypochondriac symptoms among health science students was 28.0% (95% CI = 19.0%–38.0%). The symptoms were a little more common in females (30.0%, 95% CI = 19.0%–42.0%) than in males (29.0%, 95% CI = 16.0%–42.0%), but the difference was not significant. No significant differences were found between participants grouped by study year. Only three studies explored the coping styles of students with hypochondriasis, and these revealed a high tendency toward help-seeking behaviors. Conclusion: Our systematic review and meta-analysis showed a high prevalence of hypochondriac symptoms among health science students, indicating that it is a noteworthy phenomenon. We suggest that counseling and other support services are necessary for health science students. [ABSTRACT FROM AUTHOR]

Distinguishing certain and uncertain information is of crucial importance both in the scientific field in the strict sense and in the popular scientific domain. In this paper, by adopting an epistemic stance perspective on certainty and uncertainty, and a mixed procedure of analysis, which combines a bottom-up and a top-down approach, we perform a comparative study (both qualitative and quantitative) of the uncertainty linguistic markers (verbs, non-verbs, modal verbs, conditional clauses, uncertain questions, epistemic future) and their scope in three different corpora: a historical corpus of 80 biomedical articles from the British Medical Journal (BMJ) 1840–2007; a corpus of 12 biomedical articles from BMJ 2013, and a contemporary corpus of 12 scientific popular articles from Discover 2013. The variables under observation are time, structure (IMRaD vs no-IMRaD) and genre (scientific vs popular articles). We apply the Generalized Linear Models analysis in order to test whether there are statistically significant differences (1) in the amount of uncertainty among the different corpora, and (2) in the categories of uncertainty markers used by writers. The results of our analysis reveal that (1) in all corpora, the percentages of uncertainty are always much lower than that of certainty; (2) uncertainty progressively diminishes over time in biomedical articles (in conjunction with their structural changes–IMRaD–and to the increase of the BMJ Impact Factor); and (3) uncertainty is slightly higher in scientific popular articles (Discover 2013) as compared to the contemporary corpus of scientific articles (BMJ 2013). Nevertheless, in all corpora, modal verbs are the most used uncertainty markers. These results suggest that not only do scientific writers prefer to communicate their uncertainty with markers of possibility rather than those of subjectivity but also that science journalists prefer using a third-person subject followed by modal verbs rather than a first-person subject followed by mental verbs such as think or believe. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) have been well recognized as a deferrable load with the flexibility to shift their energy demands over time. Although this one-dimensional flexibility has been extensively investigated both by research and industrial implementations, the expanding energy demand and the associated uncertainties still make the integration of a large population of EVs into power system reliably and economically greatly challenging. In this paper, we design an auction scheme via mechanism design to elicit two additional flexibilities from EVs, namely energy flexibility and deadline flexibility. An offline mechanism is firstly designed as a benchmark based on the famous Vickrey–Clark–Groves mechanism. Then based on the primal-dual approach, we propose an online auction, in which all bids are truthful, the loss of social welfare is bounded by competitive ratio, and the mechanism can be implemented in polynomial time. By the numerical results, we quantitatively show that both the power system operators and individual EVs can benefit from the integration of the multi-dimensional flexibilities through our proposed mechanisms. [ABSTRACT FROM AUTHOR]

In order to obtain a good optimization method for the electrical transformer design with optimal selection of parameters, performance evaluation of three evolutionary algorithms (EAs), namely, genetic algorithm (GA), differential evolution algorithm, and nondominated sorting GA (NSGA-II), is carried out. The aim of this paper is to optimize parameters of transformer design (core thicknesses, primary-turn number, secondary-turn number, primary conductor area, and secondary conductor area) for minimization of total power losses (no-load losses and load losses) in three-phase transformer topology while maintaining high efficiency and low cost. The method used for this optimization scheme combines the finite-element method (FEM) and EAs to provide an accurate selection of parameters together with the optimized magnetic flux density and decreased loss. Experimental results show that NSGA-II+FEM model successfully provides a global feasible solution by minimizing total loss and related cost while improving the efficiency of three-phase transformer, rendering it suitable for application in the design environment of industrial transformers. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new approach for learning node embeddings for weighted undirected networks. We perform a random walk on the network to extract the latent structural information and perform node embedding learning under a similarity-based framework. Unlike previous works, we apply a different criterion to capture the proximity information between nodes in a network, and use it for improved modeling of similarities between nodes. We show that the mean commute time (MCT) between two nodes, defined as the average time a random walker takes to reach a target node and return to the source, plays a crucial role in quantifying the actual degree of proximity between two nodes of the network. We then introduce a novel definition of a similarity matrix that is based on the pair-wise mean commute time captured, which enables us to adequately represent the connection of similar nodes. We utilize pseudoinverse of the Laplacian matrix of the graph for calculating such a proximity measure, capturing rich structural information out of the graph for learning more adequate node representations of a network. The results of different experiments on three real-world networks demonstrate that our proposed method outperforms existing related efforts in classification, clustering, visualization as well as link prediction tasks. [ABSTRACT FROM AUTHOR]

As a consequence of industrial development, large quantities of hazardous materials are shipped everyday. Most related studies consider the risks as fixed weights on edges. However, the loads of the vehicles are important factors about the risks. Thus, considering the risks as fixed parameters cannot reflect actual practice. In addition, the vehicle routing models in previous studies simultaneously minimize the total transportation cost and the total risk. However, simply considering the total risk of a fleet as a whole cannot evaluate each vehicle's risk. Although the total risk is low, the risk of a specific vehicle may still be very high. In this paper, the actual load dependent risk is introduced, and a corresponding bi-objective vehicle routing model for hazardous materials transportation is developed, minimizing the maximum risk of vehicles and the total transportation cost simultaneously. An exact algorithm is developed based on the $\varepsilon $ -constraint method with several improvements. For large-scale problems, an approximation approach is proposed. Computational experiments on a series of instances are reported and several managerial insights are derived from the sensitivity analysis. [ABSTRACT FROM AUTHOR]

This paper presents a methodology and set of validation criteria for the systematic creation of synthetic power system test cases. The synthesized grids do not correspond to any real grid and are, thus, free from confidentiality requirements. The cases are built to match statistical characteristics found in actual power grids. First, substations are geographically placed on a selected territory, synthesized from public information about the underlying population and generation plants. A clustering technique is employed, which ensures the synthetic substations meet realistic proportions of load and generation, among other constraints. Next, a network of transmission lines is added. This paper describes several structural statistics to be used in characterizing real power system networks, including connectivity, Delaunay triangulation overlap, dc power flow analysis, and line intersection rate. The paper presents a methodology to generate synthetic line topologies with realistic parameters that satisfy these criteria. Then, the test cases can be augmented with additional complexities to build large, realistic cases. The methodology is illustrated in building a 2000 bus public test case that meets the criteria specified. [ABSTRACT FROM AUTHOR]

This paper compares three modern and two classical multiobjective optimizers (MOOs) as applied to real-world problems in electromagnetics. The behavior of sophisticated optimizers on simple test functions has been studied exhaustively. In contrast, the algorithms here are tested on practical applications, where the function evaluations are computationally expensive, making the convergence rate a crucial factor. The examples considered include the optimization of a narrowband slot antenna, a mushroom-type electromagnetic bandgap structure, and an ultrawideband Vivaldi antenna. Another popular topic in the literature is in comparing classical MOOs on electromagnetics problems. The modern optimizers chosen in this paper are state of the art and each has a distinct design philosophy. This paper introduces two unique MOOs to the electromagnetics community: BORG, an auto-adaptive genetic algorithm and the Multi-Objective Covariance Matrix Adaptation Evolutionary Strategy (MO-CMA-ES), an extension of the popular single-objective CMA-ES. These algorithms are compared to the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), a Chebysheff scalarization algorithm, and two classical MOOs. This paper will study the behavior of these algorithms on problems in electromagnetics with a limited number of function evaluations using five distinct metrics and will provide useful guidelines and recommended optimizer settings. [ABSTRACT FROM AUTHOR]

This paper proposes an application of an evolutionary game dynamics called the escort dynamics (ED) for the decentralized load management of plug-in electric vehicles (PEV). Different from earlier contributions, in the present approach, PEVs work together in a fair scheme in order to provide several ancillary services to the grid: Load shifting, active power balancing, and partial supply of reactive power demand on each phase of the distribution transformer. Meanwhile, batteries are guaranteed to be fully charged according to the constraints imposed by the owners. In the proposed formulation, chargers can be either three phase or single phase; however, in this paper, only three-phase chargers are considered. The key concepts behind ED, especially for escort functions, are provided at the beginning of this paper. Based on these concepts, the assumptions and analogies followed for the construction of the proposed approach are explained in detail, especially for the proposed definition of escort functions. A multipopulation scenario is proposed for the interaction of several PEVs using local ED routines. This interaction among populations follows another well-known evolutionary game dynamics called the best reply dynamics. Performance is evaluated using real data measured from a distribution transformer from the SOREA utility grid company in the region of Savoie, France. [ABSTRACT FROM AUTHOR]

Population dynamics have been widely used in the design of learning and control systems for networked engineering applications, where the information dependency among elements of the network has become a relevant issue. Classic population dynamics (e.g., replicator, logit choice, Smith, and projection) require full information to evolve to the solution (Nash equilibrium). The main reason is that classic population dynamics are deduced by assuming well-mixed populations, which limits the applications where this theory can be implemented. In this paper, we extend the concept of population dynamics for nonwell-mixed populations in order to deal with distributed information structures that are characterized by noncomplete graphs. Although the distributed population dynamics proposed in this paper use partial information, they preserve similar characteristics and properties of their classic counterpart. Specifically, we prove mass conservation and convergence to Nash equilibrium. To illustrate the performance of the proposed dynamics, we show some applications in the solution of optimization problems, classic games, and the design of distributed controllers. [ABSTRACT FROM PUBLISHER]

This paper proposes a united-based imperialist competitive algorithm (UICA) for compensatory neural fuzzy systems. The original imperialist competitive algorithm (ICA) comprises numerous empires in the population, and each empire comprises one imperialist and some colonies. Each country represents a feasible solution in the empire, and the more favorable solutions become imperialists, taking over less favorable solutions (i.e., colonies). In the ICA, each colony moves toward its relevant imperialist according to an assimilation policy. This paper proposes a UICA that focuses on this assimilation policy to explore the characteristics of the colonies. The assimilation policy consists of three major parts in this paper. In the first part, a colony searches for the best previous position of the colony. In the second part, the colony faces the best-so-far imperialist. In the third part, the colony moves toward the corresponding imperialist of the colony. The proposed UICA was applied to nonlinear system problems, and the experimental results indicated that the proposed UICA is effective. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce a novel method for the discovery of value functions for Markov decision processes (MDPs). This method, which we call value function discovery (VFD), is based on ideas from the evolutionary algorithm field. VFDs key feature is that it discovers descriptions of value functions that are algebraic in nature. This feature is unique, because the descriptions include the model parameters of the MDP. The algebraic expression of the value function discovered by VFD can be used in several scenarios, e.g., conversion to a policy (with one-step policy improvement) or control of systems with time-varying parameters. The work in this paper is a first step toward exploring potential usage scenarios of discovered value functions. We give a detailed description of VFD and illustrate its application on an example MDP. For this MDP, we let VFD discover an algebraic description of a value function that closely resembles the optimal value function. The discovered value function is then used to obtain a policy, which we compare numerically to the optimal policy of the MDP. The resulting policy shows near-optimal performance on a wide range of model parameters. Finally, we identify and discuss future application scenarios of discovered value functions. [ABSTRACT FROM PUBLISHER]

Diffusion MRI is a powerful tool for non-invasive probing of brain tissue microstructure. Recent multi-center efforts in the acquisition and analysis of diffusion MRI data significantly increase sample sizes and hence improve sensitivity and reliability in detecting subtle changes associated with development, aging, and diseases. However, discrepancies resulting from different scanner vendors, acquisition protocols, and image reconstruction algorithms can cause data incompatibility across imaging centers. In this paper, we introduce a model-free method that is based on the method of moments for the direct harmonization of diffusion MRI data to reduce site-specific variations. Our method directly harmonizes diffusion-attenuated signal without the need to fit any diffusion model. Moreover, our method allows the explicit definition of well-behaved mapping functions with properties such as invertibility, smoothness, and injectivity. We show that our method is effective in lowering the variations of diffusion scalars of traveling human phantoms scanned at different sites from 1%–3% to less than 0.9% for fractional anisotropy (FA) and mean diffusivity and from 1%–2.5% to 0.3%–1.2% for generalized FA. We also demonstrate its ability in preserving individual differences and in increasing across-site consistency in tractography and white matter connectivity. [ABSTRACT FROM AUTHOR]

The construction of large renewable energy projects is characterized by the great uncertainties associated with their administrative complexity and their constructive characteristics. For proper management, it is necessary to undertake a thorough project risk assessment prior to construction. The work presented in this paper is based on a hierarchical risk structure identified by a group of experts, from which a Probabilistic Fuzzy Sets with Analysis Hierarchy Process (PFSAHP) was applied. This probabilistic analysis approach used expert opinion based on the Monte Carlo Method that allows for extracting more information from the original data. In addition, the coherence of the experts’ opinions is assessed using a novel parameter known as Confidence Level, which allows for adjusting the opinions of experts and weighting their judgments regarding impact and probability according to their coherence. This model has the advantage of offering a risk analysis in the early stages of the management of renewable energy projects in which there is no detailed information. This model is also more accurate than the classic fuzzy methodology when working with complete distribution functions, whilst it avoids the loss of information that results from the traditional mathematical operations with Fuzzy numbers. To test the model, it was applied to a 250 MW photovoltaic solar plant construction project located in southeast of Spain (Region of Murcia). As a result of the application of the proposed method, risk rankings are obtained with respect to the cost, the time, the scope and from a general point of view of the project. [ABSTRACT FROM AUTHOR]

Objectives: This paper focuses on the issue of intimate partner violence and, specifically, on the distribution of femicides over time and the existence of copycat effects. This is the subject of an ongoing debate often triggered by the social alarm following multiple intimate partner homicides (IPHs) occurring in a short span of time. The aim of this research is to study the evolution of IPHs and provide a far-reaching answer by rigorously analyzing and searching for patterns in data on femicides. Methods: The study analyzes an official dataset, provided by the system VioGén of the Secretaría de Estado de Seguridad (Spanish State Secretariat for Security), including all the femicides occurred in Spain in 2007-2017. A statistical methodology to identify temporal interdependencies in count time series is proposed and applied to the dataset. The same methodology can be applied to other contexts. Results: There has been a decreasing trend in the number of femicides per year. No interdependencies among the temporal distribution of femicides are observed. Therefore, according to data, the existence of copycat effect in femicides cannot be claimed. Conclusions: Around 2011 there was a clear change in the average number of femicides which has not picked up. Results allow for an informed answer to the debate on copycat effect in Spanish femicides. The planning of femicides prevention activities should not be a reaction to a perceived increase in their occurrence. As a copycat effect is not detected in the studied time period, there is no evidence supporting the need to censor media reports on femicides. [ABSTRACT FROM AUTHOR]

This paper presents the fast topology optimization methods for rotating machines based on deep learning. The cross-sectional image of electric motors and their performances obtained during a multi-objective topology optimization based on the finite-element method and genetic algorithm (GA) is used for training of the convolutional neural network (CNN). Two different approaches are proposed: 1) CNN trained by preliminary optimization with a small population for GA is used for the main optimization with a large population and 2) CNN is used for screening of torque performances in the optimization with respect to the motor efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we propose a hybrid genetic algorithm (GA) for the optimal shape design of an axially symmetric dual-reflector antenna by combining the GA with the moving least square (MLS), which enhances the convergence rate and the global search performance. The MLS is used to construct local interpolation functions from non-uniform sample data and to estimate new superior positions. By combining these superior positions in the next generation, the MLS-GA shows better search performance for the global optimum and a faster convergence rate than those of the conventional GA. To verify the proposed MLS-GA, we applied it to the optimal shape design of the DRA at the W-band. [ABSTRACT FROM AUTHOR]

Zero failures sampling plans have been widely established in quality management and control. Their performance is better than sampling plans that allow failures. This is reflected in the operating characteristic (OC) curve. The OC-curve gives the likelihood of acceptance of a random sample as a function of the proportion of defective devices in a population. In this paper, we add information to the sampling plan. If a failure occurs in the sample and a countermeasure is implemented, we consider the effectiveness of this countermeasure as well. In reliability engineering, this concept is known as fractional failures. Taking this additional information into account and increasing the size of the random sample leads to sampling plans that have at least the same performance as zero failures sampling plans. The consumer's risk is controlled as well as the producer's risk. The results are very easy to handle and very transparent in the communication between producers and their customers. This method gives an alternative way how zero failures sampling plans can be realized and assessed. [ABSTRACT FROM AUTHOR]

In the population protocol model [Angluin et al. 2006], it is impossible to design a self-stabilizing leader election protocol without any knowledge of the exact number of nodes in the system. The notion of loose-stabilization, which relaxes the closure requirement of self -stabilization, was introduced in 2009 to circumvent this impossibility. The notion can be described as follows: a loosely-stabilizing protocol guarantees that, starting from any initial configuration, a system reaches a safe configuration eventually, and after that, the system maintains its specification (e.g., the unique leader) not forever, but for a sufficiently long time. The previous work of the authors presented a loosely-stabilizing protocol that solves the leader election on complete graphs using only a given upper bound $N$N on the number of nodes $n$n in the system, instead of the exact value of $n$n. In this paper, we propose two loosely-stabilizing protocols that solve leader election for arbitrary graphs. One is a deterministic protocol that uses the unique identifiers of nodes while the other is a probabilistic protocol that works on anonymous networks. Given an upper bound $N$N on the number of nodes, both protocols maintain a unique leader for $\Omega (Ne^{2N})$Ω(Ne2N) expected steps (holding time) after entering a safe configuration. The first algorithm enters a safe configuration within $O(mN \, \log n)$O(mNlogn) expected steps (convergence time) while the second one does this within $O(mN^2\,\log N)$O(mN2logN) expected steps, where $m$m is the number of edges in the graph. Both protocols require only $O(\log N)$O(logN) bits for each node's memory. A novel concept, called the same speed timer is introduced, by which all nodes of the system can count down their timers at the same speed. This concept allows to achieve fast convergence time of both algorithms. To design the second protocol, we design a self-stabilizing two-hop coloring protocol, which is interesting in its own right. This protocol uses only $O(\log N)$O(logN) memory space per node. We establish a lower bound. Any loosely-stabilizing leader election protocol with expected exponential holding time requires $\Omega (mN)$Ω(mN) expected convergence time. This lower bound shows a near-optimality of the first algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel generalized multiparticle drift-diffusion (mp-DD) model capable to overcome some limitations imposed by the classic drift-diffusion model by taking into account multiple carrier populations. We demonstrate the model’s ability and flexibility in simulating systems from different application contexts. We conclude that the developed mp-DD model allows investigating a wide range of complex mechanisms, such as subband charge transport calculation or intersystem crossing (ISC), which are crucial for the understanding and design of organic and inorganic semiconductor devices largely employed for both photovoltaics and light emitting applications. [ABSTRACT FROM AUTHOR]

In recent years, we have witnessed the explosion of large-scale data in various fields. Classical statistical methodologies, such as linear regression or generalized linear regression, often show inadequate performance on heterogeneous data because the key homogeneity assumption fails. In this paper, we present a flexible framework to handle heterogeneous populations that can be naturally grouped into several ordered subtypes. A local model technique utilizing ordinal class labels during the training stage is proposed. We define a new “progression score” that captures the progression of ordinal classes, and use a truncated Gaussian kernel to construct the weight function in a local regression framework. Furthermore, given the weights, we apply sparse shrinkage on the local fitting to handle high dimensionality. In this way, our local model is able to conduct variable selection on each query point. Numerical studies show the superiority of our proposed method over several existing ones. Our method is also applied to the Alzheimer’s Disease Neuroimaging Initiative data to make predictions on the longitudinal clinical scores based on different modalities of baseline brain image features. [ABSTRACT FROM AUTHOR]

This paper analyzes seasonal effects and their potential drivers in charitable giving. We conduct two studies to analyze whether donations to the German Red Cross differ between the Christmas season and summer. In study 1 we find that in the pre-Christmas shopping season prosocial subjects almost donate 50% less compared to prosocials in summer. In study 2 we replicate the low donations in the Christmas season. In an extensive questionnaire we control for several causes of this effect. The data suggest that the higher prosocials’ self-reported stress level, the lower the donations. The higher their relative savings, the lower the giving. Our questionnaire rules out that “donation fatigue” matters. That is, donations do not depend on the number of charitable campaigns subjects are confronted with and their engagement in these activities during Christmas season outside the lab. [ABSTRACT FROM AUTHOR]

This paper explores extreme response style to the Life Impact Burn Recovery Evaluation (LIBRE) Profile, a measure of social participation in burn survivors. We fit a Multidimensional Generalized Partial Credit Model (MGPCM) with a positive extreme response style (PERS) factor and compared this model with the original MGPCM, estimated the impact that PERS has on scores, and examined the personal characteristics that may result in an individual more likely to respond in a fashion that would inflate their true low scores. The average impact of the PERS, based upon the root mean squared bias, ranged from 0.27 to 0.50 of a standard deviation of the scale. Individuals who were older, had participated in a burn survivor support group, and had selected to self-administer the measure were less likely to have a high PERS bias that masks low scores. Future work can consider PERS when measuring the psychosocial impacts of burn injuries and other health conditions. [ABSTRACT FROM AUTHOR]

Location-based social media have been extensively utilized in the concept of “social sensing” to exploit dynamic information about human activities, yet joint uses of social sensing and remote sensing images are underdeveloped at present. In this paper, the close relationship between the number of Twitter users and brightness of nighttime lights (NTL) over the contiguous United States is calculated and geotagged tweets are then used to upsample a stable light image for 2013. An associated outcome of the upsampling process is the solution of two major problems existing in the NTL image, pixel saturation, and blooming effects. Compared with the original stable light image, digital number (DN) values of the upsampled stable light image have larger correlation coefficients with gridded population (0.47 versus 0.09) and DN values of the new generation NTL image product (0.56 versus 0.52), i.e., the Visible Infrared Imaging Radiometer Suite day/night band image composite. In addition, total personal incomes of states are disaggregated to each pixel in proportion to the DN value of the pixel in the NTL images and then aggregate by counties. Personal incomes distributed by the upsampled NTL image are closer to the official demographic data than those distributed by the original stable light image. All of these results explore the potential of geotagged tweets to improve the quality of NTL images for more accurately estimating or mapping socioeconomic factors. [ABSTRACT FROM AUTHOR]

The physical unclonable function (PUF) based on resistive random-access memory (RRAM) possesses a distinctive advantage that can offer higher security and lower cost than the traditional complementary metal–oxide–semiconductor-based cryptographic devices and other conventional PUFs. The intrinsic stochasticity of RRAM devices successfully provides attractive properties to implement PUF. In this paper, we present a novel multistate-based RRAM PUF to realize strong tolerance against attack. By applying multilevel states with bit shuffling to the RRAM PUF, the randomness and uniqueness were enhanced close to ideal values. In addition, the bit error rate was dramatically reduced using the temperature compensation mechanism. Moreover, our new method not only enables the generation of larger challenge–response pairs (CRPs) with less footprint but also can reconfigure CRPs. [ABSTRACT FROM AUTHOR]

Brain storm optimization (BSO) is a swarm intelligence optimization algorithm inspired by the collective behavior of human beings in solving problems. This paper provides a conceptual overview and detailed explanation of the BSO algorithm. For the first time, the effectiveness of BSO in electromagnetic applications is demonstrated using a Yagi–Uda antenna design and a Luneburg lens antenna design, and this effectiveness is further validated via optimization, prototyping, and measurement of a dual-band slotted patch antenna design. In addition, a novel binary version of BSO (BBSO) for optimizing discrete problems is proposed, and the process of transforming the concept of BSO into a binary language is discussed in detail. A method for selecting algorithm parameter values for BBSO is shown. Finally, BBSO is applied successfully to an array thinning example and a pixelated patch antenna design. [ABSTRACT FROM AUTHOR]

Information about a person’s income can be useful in several business-related contexts, such as personalized advertising or salary negotiations. However, many people consider this information private and are reluctant to share it. In this paper, we show that income is predictable from the digital footprints people leave on Facebook. Applying an established machine learning method to an income-representative sample of 2,623 U.S. Americans, we found that (i) Facebook Likes and Status Updates alone predicted a person’s income with an accuracy of up to r = 0.43, and (ii) Facebook Likes and Status Updates added incremental predictive power above and beyond a range of socio-demographic variables (ΔR2 = 6–16%, with a correlation of up to r = 0.49). Our findings highlight both opportunities for businesses and legitimate privacy concerns that such prediction models pose to individuals and society when applied without individual consent. [ABSTRACT FROM AUTHOR]

This paper presents the first empirical investigation that compares Euler and linear diagrams when they are used to represent set cardinality. A common approach is to use area-proportional Euler diagrams but linear diagrams can exploit length-proportional straight-lines for the same purpose. Another common approach is to use numerical annotations. We first conducted two empirical studies, one on Euler diagrams and the other on linear diagrams. These suggest that area-proportional Euler diagrams with numerical annotations and length-proportional linear diagrams without numerical annotations support significantly better task performance. We then conducted a third study to investigate which of these two notations should be used in practice. This suggests that area-proportional Euler diagrams with numerical annotations most effectively supports task performance and so should be used to visualize set cardinalities. However, these studies focused on data that can be visualized reasonably accurately using circles and the results should be taken as valid within that context. Future work needs to determine whether the results generalize both to when circles cannot be used and for other ways of encoding cardinality information. [ABSTRACT FROM AUTHOR]

Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been applied to various applications such as friend recommendation, community detection, anomaly detection, etc. However, RWR suffers from two problems: 1) using the same restart probability for all the nodes limits the expressiveness of random walk, and 2) the restart probability needs to be manually chosen for each application without theoretical justification. We have two main contributions in this paper. First, we propose R W E R (RWER), a random walk based measure which improves the expressiveness of random walks by using a distinct restart probability for each node. The improved expressiveness leads to superior accuracy for ranking and link prediction. Second, we propose SR (pervised start for RWER), an algorithm for learning the restart probabilities of RWER from a given graph. SR eliminates the need to heuristically and manually select the restart parameter for RWER. Extensive experiments show that our proposed method provides the best performance for ranking and link prediction tasks. [ABSTRACT FROM AUTHOR]

This paper demonstrates how Geographic Information Systems (GIS) can be utilized to study the effects of spatial phenomena. Since experimental designs such as Randomized Controlled Trials are generally not feasible for spatial problems, researchers need to rely on quasi-experimental approaches using observational data. We provide a regression-based framework of the key procedures for GIS-based empirical research design using georeferenced point data for both spatial events of interest and subjects exposed to the events. We illustrate its utility and implementation through a case study on the impacts of the Cambodian genocide under the Pol Pot regime on post-conflict education. [ABSTRACT FROM AUTHOR]

The demand for automatic extraction of true information (i.e., truths) from conflicting multi-source data has soared recently. A variety of truth discovery methods have witnessed great successes via jointly estimating source reliability and truths. All existing truth discovery methods focus on providing a point estimator for each object's truth, but in many real-world applications, confidence interval estimation of truths is more desirable, since confidence interval contains richer information. To address this challenge, in this paper, we propose a novel truth discovery method (ETCIBoot) to construct confidence interval estimates as well as identify truths, where the bootstrapping techniques are nicely integrated into the truth discovery procedure. Due to the properties of bootstrapping, the estimators obtained by ETCIBoot are more accurate and robust compared with the state-of-the-art truth discovery approaches. The proposed framework is further adapted to deal with large-scale truth discovery task in distributed paradigm. Theoretically, we prove the asymptotical consistency of the confidence interval obtained by ETCIBoot. Experimentally, we demonstrate that ETCIBoot is not only effective in constructing confidence intervals but also able to obtain better truth estimates. [ABSTRACT FROM AUTHOR]

Objective: Metal Road Safety Barriers (MRSB) are one of the devices implemented in roadsides to mitigate the consequences of run-off crashes. In Europe, they have to meet the requirements of the European Standard EN-1317-2. This article analyzes a set of run-off crashes against MRSB, for which an in-depth investigation has been performed, comparing them with the standard tests. It has been observed that in many of these real crashes, the barriers have not worked properly in spite of having passed these standard tests. This paper demonstrates which variables may be responsible for this, with the objective of helping to improve the current test standard through the analysis of new test variables. Methods: Multidimensional Scaling, a dimension reduction multivariate statistical technique, has been used to better understand how real crashes compare to standard tests, using several impact variables at the same time. Then, a statistical analysis has been developed to show the influence of the “Relative orientation impact angle” on the performance of the MRSB. Results: Most of the real crashes analyzed are close to “TB11” and “TB32” standard tests. In many of these real crashes, the “Relative orientation impact angle” is very different from the “Impact angle”, and in these situations, the vehicle is not safely redirected to the road concerning the so-called “Exit-Box”. Conclusions: MRSB are not working properly in some situations that are not far from the standard tests. To handle this, it could be interesting to include the “Relative orientation impact angle” as a control variable in new versions of the EN-1317-2 tests to guarantee the behavior of the MRSB. These results can help to adapt some test variables from the EN-1317-2 to what is happening in crashes. [ABSTRACT FROM AUTHOR]

The ability to produce timely and accurate flu forecasts in the United States can significantly impact public health. Augmenting forecasts with internet data has shown promise for improving forecast accuracy and timeliness in controlled settings, but results in practice are less convincing, as models augmented with internet data have not consistently outperformed models without internet data. In this paper, we perform a controlled experiment, taking into account data backfill, to improve clarity on the benefits and limitations of augmenting an already good flu forecasting model with internet-based nowcasts. Our results show that a good flu forecasting model can benefit from the augmentation of internet-based nowcasts in practice for all considered public health-relevant forecasting targets. The degree of forecast improvement due to nowcasting, however, is uneven across forecasting targets, with short-term forecasting targets seeing the largest improvements and seasonal targets such as the peak timing and intensity seeing relatively marginal improvements. The uneven forecasting improvements across targets hold even when “perfect” nowcasts are used. These findings suggest that further improvements to flu forecasting, particularly seasonal targets, will need to derive from other, non-nowcasting approaches. [ABSTRACT FROM AUTHOR]

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