Search

In order to optimize hydro power plants generator scheduling according to 24-h system demand, a parallel self-adaptive differential evolution algorithm has been applied. The proposed algorithm presents a novel approach to considering the multi-population and utilization of the preselection step for the improvements of the algorithm's global search capabilities. A preselection step with the best, middle, and worst populations' individuals establishes the new trial vectors. This algorithm has been verified on two different models. The first one consists of eight power plants with real parameters, and the second one consists of four power plants, mostly used as a test model in scientific papers. The main goal of the optimization process is to satisfy system demand for 24 h with a decreased usage of water quantity per electrical energy unit. The initial and final states of the reservoirs must also be satisfied. [ABSTRACT FROM PUBLISHER]

Current social networks are of extremely large-scale generating tremendous information flows at every moment. How information diffuses over social networks has attracted much attention from both industry and academics. Most of the existing works on information diffusion analysis are based on machine learning methods focusing on social network structure analysis and empirical data mining. However, the network users' decisions, actions, and socio-economic interactions are generally ignored by most of existing works. In this paper, we propose an evolutionary game theoretic framework to model the dynamic information diffusion process in social networks. Specifically, we derive the information diffusion dynamics in complete networks, uniform degree, and nonuniform degree networks, with the highlight of two special networks, the Erdős–Rényi random network and the Barabási–Albert scale-free network. We find that the dynamics of information diffusion over these three kinds of networks are scale-free and all the three dynamics are same with each other when the network scale is sufficiently large. To verify our theoretical analysis, we perform simulations for the information diffusion over synthetic networks and real-world Facebook networks. Moreover, we also conduct an experiment on a Twitter hashtags dataset, which shows that the proposed game theoretic model can well fit and predict the information diffusion over real social networks. [ABSTRACT FROM PUBLISHER]

We propose in this paper to consider code-smells detection as a distributed optimization problem. The idea is that different methods are combined in parallel during the optimization process to find a consensus regarding the detection of code-smells. To this end, we used Parallel Evolutionary algorithms (P-EA) where many evolutionary algorithms with different adaptations (fitness functions, solution representations, and change operators) are executed, in a parallel cooperative manner, to solve a common goal which is the detection of code-smells. An empirical evaluation to compare the implementation of our cooperative P-EA approach with random search, two single population-based approaches and two code-smells detection techniques that are not based on meta-heuristics search. The statistical analysis of the obtained results provides evidence to support the claim that cooperative P-EA is more efficient and effective than state of the art detection approaches based on a benchmark of nine large open source systems where more than 85 percent of precision and recall scores are obtained on a variety of eight different types of code-smells. [ABSTRACT FROM PUBLISHER]

Scalable compact models for passive elements are important in the Analog/RF circuit design and optimization. Traditional scalable modeling methods are mainly physical and manual based methods, which usually require deep physical insight and extensive human intervention. In this paper, an automatic scalable compact modeling method for generic passive elements is established. The proposed method is a unified parameter extraction and scalable modeling scheme with novel inner-loop correlated parameter extraction and outer-loop adaptive boundary compression techniques. Experimental results show that both accuracy and scalability have been achieved by the proposed method for industrial inductors and transformers with an acceptable computational cost. [ABSTRACT FROM PUBLISHER]

Methods for obtaining cardiomyocytes from human embryonic stem cells (hESCs) are improving at a significant rate. However, the characterization of these cardiomyocytes (CMs) is evolving at a relatively slower rate. In particular, there is still uncertainty in classifying the phenotype (ventricular-like, atrial-like, nodal-like, etc.) of an hESC-derived cardiomyocyte (hESC-CM). While previous studies identified the phenotype of a CM based on electrophysiological features of its action potential, the criteria for classification were typically subjective and differed across studies. In this paper, we use techniques from signal processing and machine learning to develop an automated approach to discriminate the electrophysiological differences between hESC-CMs. Specifically, we propose a spectral grouping-based algorithm to separate a population of CMs into distinct groups based on the similarity of their action potential shapes. We applied this method to a dataset of optical maps of cardiac cell clusters dissected from human embryoid bodies. While some of the nine cell clusters in the dataset are presented with just one phenotype, the majority of the cell clusters are presented with multiple phenotypes. The proposed algorithm is generally applicable to other action potential datasets and could prove useful in investigating the purification of specific types of CMs from an electrophysiological perspective. [ABSTRACT FROM PUBLISHER]

The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Evolutionary clustering is a recent framework for clustering dynamic networks that introduces the concept of temporal smoothness inside the community structure detection method. Evolutionary-based clustering approaches try to maximize cluster accuracy with respect to incoming data of the current time step, and minimize clustering drift from one time step to the successive one. In order to optimize both these two competing objectives, an input parameter that controls the preference degree of a user towards either the snapshot quality or the temporal quality is needed. In this paper the detection of communities with temporal smoothness is formulated as a multiobjective problem and a method based on genetic algorithms is proposed. The main advantage of the algorithm is that it automatically provides a solution representing the best trade-off between the accuracy of the clustering obtained, and the deviation from one time step to the successive. Experiments on synthetic data sets show the very good performance of the method when compared with state-of-the-art approaches. [ABSTRACT FROM PUBLISHER]

Semiconductor manufacturers are increasingly assembling multiple chips into a single package to maximize the capacity of flash memories. Multiple-chip products (MCPs) require repetitive visits to assembly stages and incur frequent setup changes. As utilization of packaging facilities decreases due to the introduction of MCPs, research on scheduling of packaging facilities is becoming more important than ever. In this paper, we propose a novel framework to find a good schedule for semiconductor packaging facilities by focusing on bottleneck stages while satisfying practical operational constraints. A genetic algorithm-based sequence optimizer is employed, and construction and performance evaluation of a schedule are separately addressed by a simulator. Furthermore, a recommender is proposed to accelerate convergence of the optimizer. Experimental results show that the proposed approach performs better than the other existing methods while successfully reducing computation time. [ABSTRACT FROM AUTHOR]

Concurrent minimization of project time and project cost is an important issue in construction planning and management. Tradeoff optimization between these two variables is necessary to maximize overall construction project benefit. This paper presents a two-phase differential evolution (DE) model to resolve these problems. This model is able to effectively consider both time–cost effects and resource constraints. First, we introduce a novel multiple-objective algorithm, the chaotic initialized multiple objective differential evolution with adaptive-mutation strategy-based time–cost tradeoff, to determine the execution mode that best optimizes the time–cost balance. Subsequently, we introduce a DE-based resource-constrained method to generate a feasible schedule. A real construction case study is then used to illustrate the application of the proposed algorithm. Performance comparisons done with the nondominated sorting genetic algorithm, multiple objective particle swarm optimization, and multiple objective differential evolution further verify the efficiency and effectiveness of the proposed algorithm. [ABSTRACT FROM PUBLISHER]

In this paper, a new methodology for the automated generation of the optimal performance trade-offs of integrated inductors is presented. The methodology combines a multiobjective optimization algorithm with electromagnetic simulation to get highly accurate results. A set of sized inductors is obtained showing the best performance trade-offs for a given technology. Unlike reported approaches for inductor synthesis, performance trade-offs are generated offline, i.e., before any specific inductance or quality factor are required. The tight efficiency versus accuracy trade-off of existing approaches is, in this way, avoided and performance evaluation via electromagnetic simulation becomes affordable. [ABSTRACT FROM PUBLISHER]

Power electronic converters are often used in parallel both for efficiency and reliability improvement. Numerous approaches have been documented, but so far, to the best knowledge of the authors, there is no general proof demonstrating if a given configuration would lead to maximum overall efficiency throughout the whole load range. Finding a general answer is complicated by the large number of topologies and load sharing strategies that are used. This paper endeavors to find a generic solution to the question, Which current sharing technique yields best results in terms of overall efficiency?, by using a game theoretic approach and a generalized form of efficiency load current characteristic. The authors start from the assumption that each converter in parallel can be modeled as an agent endowed with intelligence, able to choose a strategy in order to achieve a target. The method is applied to dc/dc converters in general and as an example to the buck converter. Nevertheless, the results can be generalized to other converter types (in the case of ac, additional dimensions will appear, such as reactive power, phase, or frequency) or to other energy conversion or transmission devices. [ABSTRACT FROM PUBLISHER]

This paper aims to design new strategies to extend traditional multiobjective optimization algorithms to efficiently obtain Pareto-optimal solutions in presence of noise on the objective surfaces. The first strategy, referred to as adaptive selection of sample size, is employed to balance the tradeoff between quality measure of fitness and run-time complexity. The second strategy is concerned with determining statistical expectation, instead of conventional averaging, of fitness samples as the measure of fitness of the trial solutions. The third strategy attempts to extend Goldberg's method to compare slightly worse trial solutions with its competitor by a more statistically viable comparator to examine possible placement of the former solution in the Pareto optimal front. The traditional differential evolution for multiobjective optimization algorithm has been modified by extending its selection step with the proposed strategies. Experiments undertaken to study the performance of the extended algorithm reveal that the extended algorithm outperforms its competitors with respect to three performance metrics, when examined on a test suite of 23 standard benchmarks with additive noise of three statistical distributions. The extended algorithm has been applied on the well known box-pushing problem, where the forces and torques required to shift the box by two robots are evaluated to jointly satisfy the conflicting objectives on task-execution time and energy consumption in presence of noise on range estimates from the sidewalls of the workspace. The application justifies the importance of the proposed noise-handling strategies in practical systems. [ABSTRACT FROM AUTHOR]

Moment estimation is an important problem during circuit validation, in both presilicon and postsilicon stages. From the estimated moments, the probability of failure and parametric yield can be estimated at each circuit configuration and corner, and these metrics are used for design optimization and making product qualification decisions. The problem is especially difficult if only a very small sample size is allowed for measurement or simulation, as is the case for complex analog/mixed-signal circuits. In this paper, we propose an efficient moment estimation method, called multiple-population moment estimation (MPME), that significantly improves estimation accuracy under small sample size. The key idea is to leverage the data collected under different corners/configurations to improve the accuracy of moment estimation at each individual corner/configuration. Mathematically, we employ the hierarchical Bayesian framework to exploit the underlying correlation in the data. We apply the proposed method to several datasets including postsilicon measurements of a commercial high-speed I/O link, and demonstrate an average error reduction of up to $2\times$ , which can be equivalently translated to significant reduction of validation time and cost. [ABSTRACT FROM PUBLISHER]

Population decay (real transition) and pure dephasing (virtual transition) determine the dephasing rates of excitons in quantum-dot (QD) semiconductor optical amplifiers. In previous theoretical studies, population-decay and pure dephasing are usually handled separately. In this paper, the theory of exciton dephasing in an InAs/GaAs QD semiconductor optical amplifier is presented to elucidate the combination of population decay and pure dephasing and determine the total dephasing rate. The proposed model extends the classical independent boson model to include the effects of real transition. Results show that population decay decreases the pure dephasing rate and imply that the former is directly coupled to pure dephasing despite their differences. Our theoretical results are consistent with the reported experimental phenomena. [ABSTRACT FROM AUTHOR]

This paper discusses a theoretical and experimental investigation of parameters of plasma [hydrogen (H2) and argon (Ar)] developed in an inductively coupling plasma reactor. The reactor was shaped as a planar chamber inserted between two gaps formed between two separated identical halves of a quasi-closed solenoid cut along its diameter and powered with a 13.56-MHz RF to generate a closed loop of alternating magnetic field crossing the reactor chamber twice. It has been shown that the solution of the Hamilton–Jacobi equation describing motion of a charged particle with the certain momentum in a radial cylindrical wave generated in a gap of the quasi-closed solenoid can be presented as the particle motion along a closed Fig. 8-type trajectory. Simple estimation based on this solution has shown that energy of plasma electrons captured and accelerated in the gap at reasonable power applied to the solenoid should run up to \sim70~eV. Experiments have shown that in the reactor filled with H2 at 6 mtorr and powered, for example, with 2 kW of 13.56-MHz RF, the electrons accelerated in electromagnetic fields were arranged in three distinct populations: 1) electrons of \rm\sim130\-eV energy detected as stable electron flows; 2) certain portion of electrons mentioned in 1) diffused on neutrals and forming in velocity space a layer with thickness \sim6~eV at average energy \sim100~eV; and 3) a small population of cold electrons of \sim20\-eV energy in plasma potential vicinity. It has been shown also that the certain disposition of one of the quasi-closed solenoid halves with respect to the other one leads to the electron energy variation at approximate conservation of their density for all of the electron populations in the range from \sim6 to \sim100~eV. The same effect can be obtained by shift of phase of the RF source powering one of the solenoid halves with respect to the other one. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm is presented for estimating scene flow, which is a richer, 3D analog of optical flow. The approach operates orders of magnitude faster than alternative techniques and is well suited to further performance gains through parallelized implementation. The algorithm employs multiple hypotheses to deal with motion ambiguities, rather than the traditional smoothness constraints, removing oversmoothing errors and providing significant performance improvements on benchmark data, over the previous state of the art. The approach is flexible and capable of operating with any combination of appearance and/or depth sensors, in any setup, simultaneously estimating the structure and motion if necessary. Additionally, the algorithm propagates information over time to resolve ambiguities, rather than performing an isolated estimation at each frame, as in contemporary approaches. Approaches to smoothing the motion field without sacrificing the benefits of multiple hypotheses are explored, and a probabilistic approach to occlusion estimation is demonstrated, leading to 10 and 15 percent improved performance, respectively. Finally, a data-driven tracking approach is described, and used to estimate the 3D trajectories of hands during sign language, without the need to model complex appearance variations at each viewpoint. [ABSTRACT FROM AUTHOR]

In the path to the future implementation of the smart grid, microgrids are presented as a cornerstone. An efficient and optimal microgrid operation is paramount. In this paper, we present a hierarchical microgrid management system using task sharing and an evolutionary game theory based dispatch strategy as a coordination algorithm to integrate the three main control levels needed for microgrid operation, which can be considered as a distributed intelligent system. The proposed algorithm shares the total load demanded into the distributed generators efficiently, while the microgrid utility is maximized dynamically, increasing the system reliability. Some simulation results are presented to illustrate the effectiveness of the dynamic performance of the proposed approach compared with a traditional hierarchical algorithm. [ABSTRACT FROM AUTHOR]

A near-optimal base-station antenna array synthesis suitable for broadcasting applications is presented. The array is required to provide a high-gain radiation pattern with a main lobe slightly tilted from the horizontal plane and null filling inside an angular sector under the main lobe. To satisfy the above requirements, a novel invasive weed optimization (IWO) variant called Taguchi initialized IWO (TI-IWO) is proposed in this paper. In TI-IWO, the Taguchi's optimization method is employed to initialize effectively the positions of the weeds used by the IWO method. In this way, the fitness function starts from lower values and, thus, the TI-IWO method finds better near-optimal solutions than the conventional IWO method. The proposed method has been applied to linear arrays. Due to its easy implementation in practice, a uniform-amplitude excitation distribution is considered to be applied on the array elements. Two cases of isotropic source arrays are studied under specific requirements for maximum possible gain, main lobe tilting, and null filling. Also, the TI-IWO method is applied to optimize realistic cases of collinear wire dipole arrays in front of a mast under the same requirements and an additional one concerning the impedance matching of all the dipoles. [ABSTRACT FROM AUTHOR]

The recently deployed 4G access technology promises to satisfy the increasing demand of bandwidth consuming applications by providing high network capacity, low latency and seamless mobility. Towards this direction, concept solutions concerning the integration of wireless and optical networks have been proposed. However, the majority of these approaches assume the conventional fixed commitment of resources to the base stations, an inefficient and costly process, especially in case the Passive Optical Network (PON) belongs to a different operator. As a result, new, more dynamic backhaul resource allocation approaches are required. In this paper, the authors study the problem of committing resources of the backhaul network to a base station by employing evolutionary game theory in order to model the interactions between the subscribers and the base station. The asymptotic stability of the proposed scheme is proven under the replicator dynamics model. Finally, the impact of time delay in the proposed scheme is also investigated. [ABSTRACT FROM PUBLISHER]

In this paper we describe a method for optimizing frequency reconfigurable pixel antennas. The method utilizes a multi-objective function that is efficiently computed by using only one full electromagnetic simulation in the entire genetic algorithm optimization process. Minimization of the number of switches in the design is also attempted. The method is demonstrated using an antenna structure consisting of a rectangular grid of pixels adjacent to a ground plane and using RF MEMS switches for achieving the reconfigurability. The effects of the RF MEMS switches on the antenna performance as well as the control feed lines for them are also addressed. We provide both simulation and experimental results for a reconfigurable dual-band antenna that reconfigures the bands 820–1140 and 1720–1900 MHz to the bands 860–1160 and 1890–2300 MHz with dimensions of 39 mm \times 24 mm on a ground plane of 40 mm \times 65 mm with one switch only. The results demonstrate that reconfigurable antennas can be designed effectively with a minimum number of switches using an efficient optimization method. [ABSTRACT FROM PUBLISHER]

Image-guided radiotherapy (IGRT) requires fast and accurate localization of the prostate in 3-D treatment-guided radiotherapy, which is challenging due to low tissue contrast and large anatomical variation across patients. On the other hand, the IGRT workflow involves collecting a series of computed tomography (CT) images from the same patient under treatment. These images contain valuable patient-specific information yet are often neglected by previous works. In this paper, we propose a novel learning framework, namely incremental learning with selective memory (ILSM), to effectively learn the patient-specific appearance characteristics from these patient-specific images. Specifically, starting with a population-based discriminative appearance model, ILSM aims to “personalize” the model to fit patient-specific appearance characteristics. The model is personalized with two steps: backward pruning that discards obsolete population-based knowledge and forward learning that incorporates patient-specific characteristics. By effectively combining the patient-specific characteristics with the general population statistics, the incrementally learned appearance model can localize the prostate of a specific patient much more accurately. This work has three contributions: 1) the proposed incremental learning framework can capture patient-specific characteristics more effectively, compared to traditional learning schemes, such as pure patient-specific learning, population-based learning, and mixture learning with patient-specific and population data; 2) this learning framework does not have any parametric model assumption, hence, allowing the adoption of any discriminative classifier; and 3) using ILSM, we can localize the prostate in treatment CTs accurately (DSC \sim0.89) and fast (\sim4 s), which satisfies the real-world clinical requirements of IGRT. [ABSTRACT FROM AUTHOR]

Validation is arguably the bottleneck in the diffusion magnetic resonance imaging (MRI) community. This paper evaluates and compares 20 algorithms for recovering the local intra-voxel fiber structure from diffusion MRI data and is based on the results of the “HARDI reconstruction challenge” organized in the context of the “ISBI 2012” conference. Evaluated methods encompass a mixture of classical techniques well known in the literature such as diffusion tensor, Q-Ball and diffusion spectrum imaging, algorithms inspired by the recent theory of compressed sensing and also brand new approaches proposed for the first time at this contest. To quantitatively compare the methods under controlled conditions, two datasets with known ground-truth were synthetically generated and two main criteria were used to evaluate the quality of the reconstructions in every voxel: correct assessment of the number of fiber populations and angular accuracy in their orientation. This comparative study investigates the behavior of every algorithm with varying experimental conditions and highlights strengths and weaknesses of each approach. This information can be useful not only for enhancing current algorithms and develop the next generation of reconstruction methods, but also to assist physicians in the choice of the most adequate technique for their studies. [ABSTRACT FROM AUTHOR]

Multilevel thresholding amounts to segmenting a gray-level image into several distinct regions. This paper presents a 2D histogram based multilevel thresholding approach to improve the separation between objects. Recent studies indicate that the results obtained with 2D histogram oriented approaches are superior to those obtained with 1D histogram based techniques in the context of bi-level thresholding. Here, a method to incorporate 2D histogram related information for generalized multilevel thresholding is proposed using the maximum Tsallis entropy. Differential evolution (DE), a simple yet efficient evolutionary algorithm of current interest, is employed to improve the computational efficiency of the proposed method. The performance of DE is investigated extensively through comparison with other well-known nature inspired global optimization techniques such as genetic algorithm, particle swarm optimization, artificial bee colony, and simulated annealing. In addition, the outcome of the proposed method is evaluated using a well known benchmark—the Berkley segmentation data set (BSDS300) with 300 distinct images. [ABSTRACT FROM AUTHOR]

The most effective cancer treatments are the ones that prolong patients’ lives while offering a reasonable quality of life during and after treatment. The treatments must also carry out their actions rapidly and with high efficiency such that a very large percentage of tumor cells die or shift into a state where they stop proliferating. Due to biological and microenvironmental variabilities within tumor cells, the action period of an administered drug can vary among a population of patients. In this paper, based on a recently proposed model for tumor growth inhibition, we first probabilistically characterize the variability of the length of drug action. Then, we present a methodology to devise optimal intervention strategies for any Markovian genetic regulatory network governing the tumor when the antitumor drug has a random-length duration of action. [ABSTRACT FROM PUBLISHER]

Image cytometry has emerged as a valuable in vitro screening tool and advances in automated microscopy have made it possible to readily analyze large cellular populations of image data. The purpose of this paper is to illustrate the viability of using cell shape to test equality of cell populations based on image data. Shape space theory is reviewed, from which differences between shapes can be quantified in terms of geodesic distance. Several multivariate nonparametric statistical hypothesis tests are adapted to test equality of cell populations. It is illustrated that geodesic distance can be a better feature than cell spread area and roundness in distinguishing between cell populations. Tests based on geodesic distance are able to detect natural perturbations of cells, whereas Kolmogorov–Smirnov tests based on area and roundness are not. [ABSTRACT FROM AUTHOR]

This paper describes a probabilistic method based on a total risk index (probability times consequences) for assessing the number of spare breakers required for a group of similar high voltage breakers used in switching and transformer stations. The proposed method uses a Markov model for assessing the probability of failures and a bulk power system reliability program for evaluating failure consequences. The method considers a number of factors such as the group size, unit failure rate, unit repair time, transmission station layout, and other power system parameters that may impact the number of spare breakers. A cost/benefit analysis approach is used in determining the required number of spare breakers. The number of spare units is determined when the total cost (sum of spare unit costs, system operating costs and system outage costs due to breaker failures) is minimum. An example is given to illustrate the proposed method of assessment. [ABSTRACT FROM PUBLISHER]

In this paper, a novel hybrid algorithm based on artificial bee colony (ABC) algorithm and differential evolution (DE) algorithm called ABC-DE is proposed to inherit their advantages and overcome their drawbacks. In ABC-DE algorithm, employed bees employ the mutation and crossover strategies of DE to enforce their exploration ability while onlooker bees keep their original updating strategy to retain the exploitation ability. Classical test functions have been provided to testify the ABC-DE algorithm. Furthermore, ABC-DE is applied to different types of time-modulated arrays (TMAs) pattern synthesis problems, including the syntheses of low equal-ripple sidelobe level (SLL) pattern, deep null level pattern, multiple-beams patterns and satellite footprint pattern. Experiment results reveal that ABC-DE has a promising performance in the convergence rate and the exploration ability when compared with other improved evolutionary algorithms, which indicates that the proposed algorithm can be an effective approach for TMAs synthesis problems. [ABSTRACT FROM PUBLISHER]

Smart-grid development calls for effective solutions, such as electric vehicles (EVs), to meet the energy and environmental challenges. To facilitate large-scale EV applications, optimal locating and sizing of charging stations in smart grids have become essential. This paper proposes a multiobjective EV charging station planning method which can ensure charging service while reducing power losses and voltage deviations of distribution systems. A battery capacity-constrained EV flow capturing location model is proposed to maximize the EV traffic flow that can be charged given a candidate construction plan of EV charging stations. The data-envelopment analysis method is employed to obtain the final optimal solution. Subsequently, the well-established cross-entropy method is utilized to solve the planning problem. The simulation results have demonstrated the effectiveness of the proposed method based on a case study consisting of a 33-node distribution system and a 25-node traffic network system. [ABSTRACT FROM AUTHOR]

Reading reference documentation is an important part of programming with application programming interfaces (APIs). Reference documentation complements the API by providing information not obvious from the API syntax. To improve the quality of reference documentation and the efficiency with which the relevant information it contains can be accessed, we must first understand its content. We report on a study of the nature and organization of knowledge contained in the reference documentation of the hundreds of APIs provided as a part of two major technology platforms: Java SDK 6 and .NET 4.0. Our study involved the development of a taxonomy of knowledge types based on grounded methods and independent empirical validation. Seventeen trained coders used the taxonomy to rate a total of 5,574 randomly sampled documentation units to assess the knowledge they contain. Our results provide a comprehensive perspective on the patterns of knowledge in API documentation: observations about the types of knowledge it contains and how this knowledge is distributed throughout the documentation. The taxonomy and patterns of knowledge we present in this paper can be used to help practitioners evaluate the content of their API documentation, better organize their documentation, and limit the amount of low-value content. They also provide a vocabulary that can help structure and facilitate discussions about the content of APIs. [ABSTRACT FROM PUBLISHER]

Probability theory is well adapted to handle aleatory uncertainties resulting from the variability of failure phenomena. Recently, several uncertainty theories such as belief function theory were introduced in reliability assessments to handle epistemic uncertainties resulting from the lack of knowledge or insufficient data. In this paper, we propose some methods to construct belief functions of reliability parameters of components from statistical data about reliability. The proposed methods consider the parametric estimation of reliability parameters. [ABSTRACT FROM PUBLISHER]

In this paper, the plasma generated by the electrical explosion of a single aluminum wire in high vacuum is investigated, through self-emission spectrum in the range of near UV to visible wavelength (347.5–477.6 nm) captured by imaging spectrometer with the duration of the spectrometer time frame of 3 ns. Electron temperature and density of the plasma are determined through the spectrum using Boltzmann Plot and Stark Broadening Effect of isolated lines of Al III. The results show that the electron temperature in the plasma is in the range of 3.7–8.6 eV and the electron density has the order of magnitude about 10^18~cm^-3. Population inversion of Al II is found according to the intensity of the isolated lines in the spectra. [ABSTRACT FROM AUTHOR]

Recommending TV content to groups of viewers is best carried out when relevant information such as the demographics of the group is available. However, it can be difficult and time consuming to extract information for every user in the group. This paper shows how an audio analysis of the age and gender of a group of users watching the TV can be used for recommending a sequence of N short TV content items for the group. First, a state of the art audio-based classifier determines the age and gender of each user in an M-user group and creates a group profile. A genetic recommender algorithm then selects for each user in the profile, a single personalized multimedia item for viewing. When the number of items to be presented is different to the number of viewers in the group, i.e. M = N, a novel adaptation algorithm is proposed that first converts the M-user group profile to an N-slot content profile, thus ensuring that items are proportionally allocated to users with respect to their demographic categorization. The proposed system is compared to an ideal system where the group demographics are provided explicitly. Results using real speaker utterances show that, in spite of the inaccuracies of state-of-the-art age-and-gender detection systems, the proposed system has a significant ability to predict an item with a matching age and gender category. User studies were conducted where subjects were asked to rate a sequence of advertisements, where half of the advertisements were randomly selected, and the other half were selected using the audio-derived demographics. The recommended advertisements received a significant higher median rating of 7.75, as opposed to 4.25 for the randomly selected advertisements. [ABSTRACT FROM PUBLISHER]

As improved versions of the successive cancellation (SC) decoding algorithm, the successive cancellation list (SCL) decoding and the successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. In this paper, unified descriptions of the SC, SCL, and SCS decoding algorithms are given as path search procedures on the code tree of polar codes. Combining the principles of SCL and SCS, a new decoding algorithm called the successive cancellation hybrid (SCH) is proposed. This proposed algorithm can provide a flexible configuration when the time and space complexities are limited. Furthermore, a pruning technique is also proposed to lower the complexity by reducing unnecessary path searching operations. Performance and complexity analysis based on simulations shows that under proper configurations, all the three improved successive cancellation (ISC) decoding algorithms can approach the performance of the maximum likelihood (ML) decoding but with acceptable complexity. With the help of the proposed pruning technique, the time and space complexities of ISC decoders can be significantly reduced and be made very close to those of the SC decoder in the high signal-to-noise ratio regime. [ABSTRACT FROM AUTHOR]

A type of disruption/delay tolerant networks, known as pigeon networks, utilizes controllable special purpose vehicles called pigeons to convey messages among segregated areas. This paper aims to provide optimization methods for the challenging problem that how a pigeon should design its route to minimize the average delay of messages. For small scale networks, we construct an exact optimization algorithm that shows significant reduction in delay over the existing heuristic algorithms. For large scale networks, we present both the lower bound and upper bound of the average delay, and devise partitioning-based optimization algorithms that perform close to the lower bound. Both theoretical analysis and numerical results show that the delay could be reduced by as much as 50% compared to the existing algorithm. [ABSTRACT FROM AUTHOR]

The design of klystrons has long been a manual process guided by experience. However, with well-defined specifications and sufficiently rapid simulation methods, it is a good candidate process for automatic optimization techniques. In this paper, such a technique is evaluated and refined using klystron specific techniques, leading to several designs (with different tradeoffs between efficiency and size) each of a structure comparable with the SLAC B-factory klystrons. The most efficient of which, while only 1% more efficient, is 17.1% shorter. [ABSTRACT FROM AUTHOR]

In this paper, a Pareto-archived estimation-of-distribution algorithm (PAEDA) is presented for the multiobjective resource-constrained project scheduling problem with makespan and resource investment criteria. First, by combining the activity list and the resource list, an encoding scheme named activity-resource list is presented. Second, a novel hybrid probability model is designed to predict the most promising activity permutation and resource capacities. Third, a new sampling and updating mechanism for the probability model is developed to track the area with promising solutions. In addition, a Pareto archive is used to store the nondominated solutions that have been explored, and another archive is used to store the solutions for updating the probability model. The evolution process of the PAEDA is visualized showing the most promising area of the search space is tracked. Extensive numerical testing results then demonstrate that the PAEDA outperforms the existing methods. [ABSTRACT FROM PUBLISHER]

This paper studies the sample complexity of searching over multiple populations. We consider a large number of populations, each corresponding to either distribution P0 or P1. The goal of the search problem studied here is to find one population corresponding to distribution P1 with as few samples as possible. The main contribution is to quantify the number of samples needed to correctly find one such population. We consider two general approaches: nonadaptive sampling methods, which sample each population a predetermined number of times until a population following P1 is found, and adaptive sampling methods, which employ sequential sampling schemes for each population. We first derive a lower bound on the number of samples required by any sampling scheme. We then consider an adaptive procedure consisting of a series of sequential probability ratio tests, and show it comes within a constant factor of the lower bound. We give explicit expressions for this constant when samples of the populations follow Gaussian and Bernoulli distributions. An alternative adaptive scheme is discussed which does not require full knowledge of P1, and comes within a constant factor of the optimal scheme. For comparison, a lower bound on the sampling requirements of any nonadaptive scheme is presented. [ABSTRACT FROM AUTHOR]

In this paper, we propose three classes of systematic approaches for constructing zero-correlation zone (ZCZ) sequence families. In most cases, these approaches are capable of generating sequence families that achieve the upper bounds on the family size (K) and the ZCZ width (T) for a given sequence period (N). Our approaches can produce various binary and polyphase ZCZ families with desired parameters (N,K,T) and alphabet size. They also provide additional tradeoffs amongst the above four system parameters and are less constrained by the alphabet size. Furthermore, the constructed families have nested-like property that can be either decomposed or combined to constitute smaller or larger ZCZ sequence sets. We make detailed comparisons with related works and present some extended properties. For each approach, we provide examples to numerically illustrate the proposed construction procedure. [ABSTRACT FROM AUTHOR]

The intent of this paper is to propose new methods for the reconstruction of areas obscured by clouds. They are based on compressive sensing (CS) theory, which allows finding sparse signal representations in underdetermined linear equation systems. In particular, two common CS solutions are adopted for our reconstruction problem: the basis pursuit and the orthogonal matching pursuit methods. A novel alternative CS solution is also proposed through a formulation within a multiobjective genetic optimization scheme. To illustrate the performances of the proposed methods, a thorough experimental analysis on FORMOsa SATellite-2 and Satellite Pour l'Observation de la Terre-5 multispectral images is reported and discussed. It includes a detailed simulation study that aims at assessing the accuracy of the methods in different qualitative and quantitative cloud-contamination conditions. Compared with state-of-the-art techniques for cloud removal, the proposed methods show a clear superiority, which makes them a promising tool in cleaning images in the presence of clouds. [ABSTRACT FROM AUTHOR]

This paper considers minimizing makespan for a blocking flowshop scheduling problem, which has important application in a variety of modern industries. A constructive heuristic is first presented to generate a good initial solution by combining the existing profile fitting (PF) approach and Nawaz–Enscore–Ham (NEH) heuristic in an effective way. Then, a memetic algorithm (MA) is proposed including effective techniques like a heuristic-based initialization, a path-relinking-based crossover operator, a referenced local search, and a procedure to control the diversity of the population. Afterwards, the parameters and operators of the proposed MA are calibrated by means of a design of experiments approach. Finally, a comparative evaluation is carried out with the best performing algorithms presented for the blocking flowshop with makespan criterion, and with the adaptations of other state-of-the-art MAs originally designed for the regular flowshop problem. The results show that the proposed MA performs much better than the other algorithms. Ultimately, 75 out of 120 upper bounds provided by Ribas [“An iterated greedy algorithm for the flowshop scheduling with blocking”, OMEGA, vol. 39, pp. 293–301, 2011.] for Taillard flowshop benchmarks that are considered as blocking flowshop instances are further improved by the presented MA. [ABSTRACT FROM AUTHOR]

Morphological and attribute profiles have been proven to be effective tools to fuse spectral and spatial information for classification of remote sensing data. A wide range of filters (i.e., number of levels in the profiles) is usually necessary in order to properly model the spatial information in a remote sensing scene. A dense sampling of the values of the parameters of the filters generates profiles that have both a very large dimensionality (leading to the Hughes phenomenon in classification) and a high redundancy. In this paper, a novel iterative technique based on genetic algorithms (GAs) is proposed to automatically optimize the selection of the optimal features from the profiles. The selection of the filtered images that compose the profile is performed by dividing them into three classes corresponding to high, medium, and low importance. We propose to measure the importance (modeled in terms of discriminative power in the classification task) using a random forest classifier, which provides a rank for each feature with its model. Only the set of images associated with the highest importance is selected, i.e., preserved for classification. The proposed technique is applied to the features labeled with medium importance, whereas the images with the lowest importance are removed from the profile. This method is employed to classify three hyperspectral data sets achieving significantly high classification accuracy values. A parallel computing implementation has been developed in order to significantly reduce the time required for the run of the GAs. [ABSTRACT FROM AUTHOR]

Hypergraph clustering refers to the process of extracting maximally coherent groups from a set of objects using high-order (rather than pairwise) similarities. Traditional approaches to this problem are based on the idea of partitioning the input data into a predetermined number of classes, thereby obtaining the clusters as a by-product of the partitioning process. In this paper, we offer a radically different view of the problem. In contrast to the classical approach, we attempt to provide a meaningful formalization of the very notion of a cluster and we show that game theory offers an attractive and unexplored perspective that serves our purpose well. To this end, we formulate the hypergraph clustering problem in terms of a noncooperative multiplayer “clustering game,” and show that a natural notion of a cluster turns out to be equivalent to a classical (evolutionary) game-theoretic equilibrium concept. We prove that the problem of finding the equilibria of our clustering game is equivalent to locally optimizing a polynomial function over the standard simplex, and we provide a discrete-time high-order replicator dynamics to perform this optimization, based on the Baum-Eagon inequality. Experiments over synthetic as well as real-world data are presented which show the superiority of our approach over the state of the art. [ABSTRACT FROM AUTHOR]

In wireless multicast systems, cooperative multicast, in which successful users help to relay received packets to unsuccessful users, has been shown to be effective in combating channel fading and improving system performance. However, this mechanism requires the users' voluntary contributions, which cannot be guaranteed since users are selfish and only care about their own performance. Furthermore, users may have heterogeneous costs (which are their private information) to forward packets, and they may lie about their costs if cheating can improve their utilities. To address these problems, in this paper, we model the interaction among users in the wireless multicast system as a multiseller multibuyer payment-based game, where users pay to receive relay service and get paid if they forward packets to others. A simplified case with homogeneous users that have the same cost to forward packets is investigated first. Then, for the case with heterogeneous users, to encourage users to tell their true costs, we use the second-price sealed-bid auction, which is a truth-telling auction, since bidding the true cost is a weakly dominant strategy. To analyze the multiseller multibuyer payment-based game, we observe that under different selected prices, the game can converge to different equilibria, resulting in different user free-riding probabilities and system throughput. We also study the price selection problem and derive the optimal price that maximizes the system throughput. Simulation results show the effectiveness of our proposed mechanism. [ABSTRACT FROM PUBLISHER]

Layered queueing networks are a useful tool for the performance modeling and prediction of software systems that exhibit complex characteristics such as multiple tiers of service, fork/join interactions, and asynchronous communication. These features generally result in nonproduct form behavior for which particularly efficient approximations based on mean value analysis (MVA) have been devised. This paper reconsiders the accuracy of such techniques by providing an interpretation of layered queueing networks as fluid models. Mediated by an automatic translation into a stochastic process algebra, PEPA, a network is associated with a set of ordinary differential equations (ODEs) whose size is insensitive to the population levels in the system under consideration. A substantial numerical assessment demonstrates that this approach significantly improves the quality of the approximation for typical performance indices such as utilization, throughput, and response time. Furthermore, backed by established theoretical results of asymptotic convergence, the error trend shows monotonic decrease with larger population sizes—a behavior which is found to be in sharp contrast with that of approximate mean value analysis, which instead tends to increase. [ABSTRACT FROM PUBLISHER]

Utilizing battery storage systems (BSSs) can reduce the intermittent output of PV generation systems (PVGSs) and make them dispatchable. The aim of this paper is to design an optimal charging/discharging scheduling for BSSs such that the line loss of distribution systems interconnected with sizeable PVGSs can be minimized. A mathematical model for BSSs which can be used to simulate the charging procedures such as the commonly-used constant current to constant voltage (CC-CV) charging method, the discharging procedures and the state of charge (SOC) is proposed first. The minimum line loss problem considering the intermittent output of PVGSs and the scheduling of BSSs is then formulated based on the BSS mathematical model. The optimal charging/discharging scheduling of BSSs can then be obtained by a genetic algorithm (GA) based method. Test results demonstrate the validity of the proposed mathematical model and optimal charging/discharging scheduling for BSSs. [ABSTRACT FROM PUBLISHER]

In this paper, impedance spectroscopy, gene expression programming (GEP), and genetic algorithms are combined to perform sensor characterization. The process presented is useful when there is no knowledge of the sensor equivalent circuit, and a set of impedance responses can be obtained for different measurand values. These responses are used by the algorithm to determine a suitable equivalent circuit and choose a circuit component that describes the measurand values. From this component, interpolation is used to infer the measurand value from the measured frequency responses. Improvements on the application of GEP to impedance characterization are presented. The method is validated through its application to numerical results of a humidity sensor and measurement results of a viscosity sensor. [ABSTRACT FROM AUTHOR]

This paper considers a system consisting of n linearly ordered multistate components. Each component can have different states: from complete failure, up to perfect functioning. A performance rate is associated with each state. The system fails if in each of at least m consecutive overlapping groups of r consecutive components (windows) the sum of the performance rates of components belonging to the group is lower than a minimum allowable level. It is shown that, in the case of different components, the system reliability depends on their arrangement. The optimal arrangement problem is formulated, and a numerical tool for solving this problem is suggested. The tool uses an extended universal moment generating function technique for system reliability evaluation, and a genetic algorithm for optimization. Examples of system reliability optimization are presented. [ABSTRACT FROM PUBLISHER]