Search

The effect of the substrate on the cyclic bending reliability of screen printed silver traces is studied in this paper. The silver screen printed test samples in this study were three different plastic films and three varieties of paper sheets. The specimens with line widths of 250, 500, 1000, and 2000 \mu\mboxm were subjected to cyclic bending, and their electrical behavior was monitored with dc resistance measurements in situ. In this study, a 20% increase in resistance was defined as the failure criterion, and the reliability of each test population was assessed by a statistical Weibull analysis. The results showed that the reliability of the traces was highly dependent on the substrate thickness in all the studied materials. The traces on a 125- \mu\mboxm-thick polyethylene terephthalate substrate were found to have the lowest characteristic lifetimes of about 1000 bending cycles, whereas the traces with the same geometry on polyethylene terephthalate with a thickness of 50 \mu\mboxm endured hundreds of thousands of bending cycles. Similarly, decreasing the substrate thickness improved the reliability of the printed traces on paper substrates. This relationship was due to the reduced mechanical strain on the trace surface when using thinner substrates. [ABSTRACT FROM PUBLISHER]

The antagonistic behavior in the crowd usually exacerbates the seriousness of the situation in sudden riots, where the antagonistic emotional contagion and behavioral decision making play very important roles. However, the complex mechanism of antagonistic emotion influencing decision making, especially in the environment of sudden confrontation, has not yet been explored very clearly. In this paper, we propose an Emotional contagion-aware Deep reinforcement learning model for Antagonistic Crowd Simulation (ACSED). First, we build a group emotional contagion module based on the improved Susceptible Infected Susceptible (SIS) infection disease model, and estimate the emotional state of the group at each time step during the simulation. Then, the tendency of crowd antagonistic action is estimated based on Deep Q Network (DQN), where the agent learns the action autonomously, and leverages the mean field theory to quickly calculate the influence of other surrounding individuals on the central one. Finally, the rationality of the predicted actions by DQN is further analyzed in combination with group emotion, and the final action of the agent is determined. The proposed method in this paper is verified through several experiments with different settings. We can conclude antagonistic emotions play a critical role in the decision making of the crowd through influencing the individual behavior in the riot scenario, where individual behaviors are primarily driven by emotions and goals, rather than common rules. The experiment results also prove that the antagonistic emotion has a vital impact on the group combat, and positive emotional states are more conducive to combat. Moreover, by comparing the simulation results with real scenes, the feasibility of our method is further confirmed, which can provide good reference to formulate battle plans and improve the win rate of righteous groups in a variety of situations. [ABSTRACT FROM AUTHOR]

Cooperative co-evolution (CC) is an evolutionary algorithm that adopts the divide-and-conquer strategy to solve large-scale optimization problems. It is difficult for CC to specify a suitable subpopulation size to solve different subproblems. The population diversity may be insufficient to search for the global optimum during subpopulations' evolution. In this paper, an adaptive method for enhancing population diversity is embedded in a contribution-based CC. In CC, there are two kinds of subpopulation: the convergent or stagnant subpopulations and the non-convergent and non-stagnant subpopulations. A method is proposed in the paper to evaluate the convergent and stagnant subpopulations' contributions to improving the best overall objective value, which is different from the contribution evaluation on the non-convergent and non-stagnant subpopulations. In each co-evolutionary cycle, the new CC adaptively determines to select a subpopulation, which can make a greater contribution to improving the best overall objective value, between the above two kinds of subpopulation to undergo evolution. When a convergent or stagnant subpopulation is selected to undergo evolution, the subpopulation is re-diversified to enhance its global search capability. Our experimental results and analysis suggest that the new CC algorithm can improve the performance of CC and serves as a competitive solver for large-scale optimization problems. [ABSTRACT FROM AUTHOR]

In recent years, multilayer networks have served as effective models for addressing and analyzing real-world systems with multiple relationships. Among these scenarios, the community detection (CD) problem is one of the most prominent research hotspots. Although some research on multilayer network CD (MCD) has been proposed to address this problem, most studies focus only on topological structures. Therefore, their algorithms cannot extract the most out of complementary network information, such as node similarities and low-rank features, which may lead to unsatisfactory accuracy. To tackle this problem, this paper proposes a novel multi-objective evolutionary algorithm based on consensus prior information (MOEA-CPI). The proposed algorithm takes full advantage of prior information to guide the MOEA with respect to topological structures, initializations, and the optimization process. More specifically, this paper first extracts two kinds of prior information, i.e., graph-level and node-level information, based on Node2vec and Jaccard similarity, respectively. Then, the prior layer and a high-quality initial population are constructed on the basis of the graph-level information. During the optimization process, the genetic operator, which integrates the weighting strategy and node-level information, is applied to guide the algorithm to distribute similar nodes into the same community. Extensive experiments are implemented to prove the superior performance of MOEA-CPI over the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the generalization performance of the Iterative Hard Thresholding (IHT) algorithm widely used for sparse recovery problems. The parameter estimation and sparsity recovery consistency of IHT has long been known in compressed sensing. From the perspective of statistical learning, another fundamental question is how well the IHT estimation would predict on unseen data. This paper makes progress towards answering this open question by introducing a novel sparse generalization theory for IHT under the notion of algorithmic stability. Our theory reveals that: 1) under natural conditions on the empirical risk function over $n$ samples of dimension $p$ , IHT with sparsity level $k$ enjoys an $\tilde {\mathcal {O}}(n^{-1/2}\sqrt {k\log (n)\log (p)})$ rate of convergence in sparse excess risk; 2) a tighter $\tilde {\mathcal {O}}(n^{-1/2}\sqrt {\log (n)})$ bound can be established by imposing an additional iteration stability condition on a hypothetical IHT procedure invoked to the population risk; and 3) a fast rate of order $\tilde {\mathcal {O}}\left ({n^{-1}k(\log ^{3}(n)+\log (p))}\right)$ can be derived for strongly convex risk function under proper strong-signal conditions. The results have been substantialized to sparse linear regression and sparse logistic regression models to demonstrate the applicability of our theory. Preliminary numerical evidence is provided to support our theoretical predictions. [ABSTRACT FROM AUTHOR]

With the advent of electric vehicles (EVs), issues connected to the electric vehicle charging scheduling (EVCS) problem, which is $\textsf {NP}$ -hard, have become important. In previous studies, EVCS has been mainly formulated as a constrained shortest-path problem; however, such formulations have not involved variables such as charging rates, traffic congestion, scalability, and waiting time at charging station (CS), that need to be considered in practical settings. Earlier research has also tended to focus on the strengths of particular evolutionary optimization algorithms like differential evolution (DE) or particle swarm optimization (PSO) over others or traditional mathematical programming methods, with only a limited study of hybrid approaches. In this paper, fast and slow charging options at a station are considered in the EVCS problem for practical use. In previous studies, EVs have been considered to have fixed speeds; however, in order to mitigate CS congestion and thus waiting times at CSs, dynamic speed control of EVs has been considered in this work. This work also investigates the scalability of different EVCS solutions. A hybrid approach using PSO and the Firefly algorithm (FFA) with a Lévy flights search strategy is designed and implemented to solve the EVCS. Also, different hybrid methods variants of PSO and FFA have been evaluated in this paper to find the best performing hybrid variant. Experimental results validate the effectiveness of our approach on both synthetic and the real-world transportation networks. [ABSTRACT FROM AUTHOR]

Contributions: The underrepresentation of women in computer science (CS) majors has long been a focus of attention in many academic documents, the majority of them from the United States and Europe. There is, however, a lack of information about educational interventions (EIs) for women in computing in Latin America. The contribution of this article is to cover this gap and describe what researchers in Latin American countries have been publishing about the recruitment and retention of women in the CS field. Background: Many EIs targeting female students at different educational levels—K-12, undergraduate, and graduate—have been undertaken to increase the participation of women in computing in Latin America. However, descriptions of these activities rarely are included in international academic databases. Research Questions: This literature mapping addresses two main research questions (RQ) about the topic of women in computing in academic publications in Latin American countries: RQ1) what are the characteristics of the publications about women in computing in Latin America? and RQ2) what are the published interventions to recruit and retain women in computing in Latin America? To answer RQ1, six subquestions were created covering year, language, country of origin, document type, and professional track. Furthermore, for RQ2, two subquestions were created involving educational level and the use of software development with a female theme. Methodology: This investigation used the systematic literature mapping process. To achieve a broad coverage of papers, the following sources were included: Scopus, Web of Science, Google Scholar, EBSCO, the proceedings of the Latin American Women in Computing Conference (LAWCC), and those of the Women in Technology (WIT) workshop colocated with the annual conference of the Brazilian Computer Society (SBC). The included papers were published in the last decade (2010–2020) and written in English, Portuguese, or Spanish. Findings: The literature mapping encompasses 197 academic documents, 48.2% of which were written in Portuguese, 28.7% in English, and 23.1% in Spanish. The papers originated from 15 of the 20 Latin American countries. Brazil and Costa Rica have the highest number of publications overall. The documents describe initiatives to increase the participation of women in computing majors that cover the entire educational spectrum, from K-12 to graduate programs, but papers targeting populations in higher education have started to appear recently. [ABSTRACT FROM AUTHOR]

This paper explores the feasibility and scope of co-channel coexistence between a low data rate Orthogonal Frequency Division Multiplexing (OFDM) secondary network and a digital television (DTV) broadcast network operating in the same area. Since DTV receivers do not transmit, neither the presence nor the impact of interference from the secondary network on these DTV receivers can be known. Consequently, conventional spectrum sensing techniques cannot be employed effectively. This paper proposes to compensate the lack of feedback by combining the available information about population distribution in the region - ranging from coarse population density estimates to accurate geospatial maps - with better estimation of interference using a data-driven technique called Ordinary Kriging. Radio Environment Maps constructed using the Kriging method from field-reported observations from the secondary nodes are used to obtain better accuracy than the conventional statistical models. The estimates are then used to compute communication parameters for each secondary link in terms of power, number of active subcarriers, and active time slots, while keeping the average interference in the DTV network within threshold bounds. Thus, the viability of such co-channel license-exempt operation of secondary networks in the DTV black and grey spaces for low data rate applications in densely populated urban areas and higher data rate capabilities for sparsely populated rural areas is established. [ABSTRACT FROM AUTHOR]

This paper considers the problem of adaptive group testing for isolating up to $k$ defective items from a population of size $n$. There exist restrictions or preferences which determine how the items can be pooled for testing. A graphical model formalizes the pooling restrictions and preferences. Such graph-constrained group testing is investigated in three settings: populations with defectives, populations facing the potential presence of inhibitors, and populations with community structures. Adaptive group testing frameworks are provided for each setting. In populations without inhibitors, existing non adaptive frameworks can isolate the defective items perfectly with $\Theta(k \log n/k)$ number of tests, where is the $\beta$ -mixing time of a random walk over the underlying graph. This paper provides a two-stage framework that can perfectly isolate up to $k$ defective items for a regular graph using $\Theta(k2 \log n k + k)$ number of tests, thus achieving an approximate gain of a factor of $k$ over the non-adaptive frameworks. This twostage framework's principles are extended to community-structured graphs and graphs with up to $r$ inhibitor items. In particular, when inhibitors are present in the graph, a four-stage group testing framework is proposed. The results show that in the regime $r= O(k)$ for a fully connected graph, $\Theta ((k+r)\log n/(k+r) + r\log n)$ tests are sufficient for isolating the defective items. This matches the corresponding necessary condition on tests which scales $(k+r)\log n$. The adaptive graphconstrained group testing framework is also empirically evaluated. [ABSTRACT FROM AUTHOR]

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

The coronavirus disease 2019 (COVID-19) epidemic continues to spread rapidly around the world and nearly 20 millions people are infected. This paper utilises both single-locus analysis and joint-SNPs analysis for detection of significant single nucleotide polymorphisms (SNPs) in the phenotypes of symptomatic versus asymptomatic, the early collection time versus the late collection time, the old versus the young, and the male versus the female. Also, this paper analyses the relationship between any two SNPs via linkage disequilibrium analysis, and visualises the patterns of cumulative mutations of SNPs over collection time. The results are in three folds. First, the SNP which locates at the nucleotide position 4321 is found to be an independent significant locus associated with all the first three phenotypes. Moreover, 12 significant SNPs are found in the first two studies. Second, gene orf1ab containing SNP-4321 is detected to be significantly associated with the first three phenotypes, and the three genes S, ORF3a, and N, are detected to be significant in the first two phenotypes. Third, some of the detected genes or SNPs are related to the SARS-COV-2 as supported by literature survey, which indicates that the results here may be helpful for further investigation. [ABSTRACT FROM AUTHOR]

Rapid urbanization, high city population growth rates, technological development, environmental impacts, and human wellbeing in urban areas have over the years become increasingly challenging concerns. These trends are related to the complex, multiple factors to be considered when evaluating “smart” cities, that is, municipalities that seek to improve residents’ quality of life by combining new technologies and environmentally sustainable practices. The above tendencies thus add to the myriad of indicators that need to be included in smart city assessments, whose intricacy hinders related decision-making processes. Based on the principles of multiple-criteria decision analysis, this paper seeks to integrate cognitive mapping and the Choquet integral to develop an assessment system that facilitates the evaluation of smart cities, which was named “SMART-C.” The research includes a panel of experts on smart cities who identifies the evaluation criteria and their respective interactions. The results of a real-life application of the assessment system developed in this paper are validated both by the panel members and a representative of the Lisboa E-Nova nonprofit association of the Lisbon City Council's Environment and Energy Department. These experts confirm that the proposed evaluation system facilitates making distinctions between cities according to how fully they develop “smartness.” The advantages and limitations of this assessment framework are also discussed. [ABSTRACT FROM AUTHOR]

Several optimization problems have features that hinder the capabilities of searching heuristics. To cope with this issue, different methods have been proposed to manipulate search spaces and improve the optimization process. This paper focuses on Dilation Functions (DFs), which are one of the most promising techniques to manipulate the fitness landscape, by "expanding" or "compressing" specific regions. The definition of appropriate DFs is problem dependent and requires a-priori knowledge of the optimization problem. Therefore, it is essential to introduce an automatic and efficient strategy to identify optimal DFs. With this aim, we propose a novel method based on Genetic Programming, named GP4DFs, which is capable of evolving effective DFs. GP4DFs identifies optimal dilations, where a specific DF is applied to each dimension of the search space. Moreover, thanks to a knowledge-driven initialization strategy, GP4DFs converges to better solutions with a reduced number of fitness evaluations, compared to the state-of-the-art approaches. The performance of GP4DFs is assessed on a set of 43 benchmark functions mimicking several features of real-world optimization problems. The obtained results indicate the suitability of the generated DFs. [ABSTRACT FROM AUTHOR]

Hybrid flow shop scheduling problems have gained an increasing attention in recent years because of its wide applications in real-world production systems. Most of the prior studies assume that the processing time of jobs is deterministic and constant. In practice, jobs’ processing time is usually difficult to be exactly known in advance and can be influenced by many factors, e.g., machines’ abrasion and jobs’ feature, thereby leading to their uncertain and variable processing time. In this paper, a dual-objective stochastic hybrid flow shop deteriorating scheduling problem is presented with the goal to minimize makespan and total tardiness. In the formulated problem, the normal processing time of jobs follows a known stochastic distribution, and their actual processing time is a linear function of their start time. In order to solve it effectively, this paper develops a hybrid multiobjective optimization algorithm that maintains two populations executing the global search in the whole solution space and the local search in promising regions, respectively. An information sharing mechanism and resource allocating method are designed to enhance its exploration and exploitation ability. The simulation experiments are carried out on a set of instances, and several classical algorithms are chosen as its peers for comparison. The results demonstrate that the proposed algorithm has a great advantage in dealing with the investigated problem. [ABSTRACT FROM AUTHOR]

Multiple solutions are often needed because of different kinds of uncertain failures in a plan execution process and scenarios for which precise mathematical models and constraints are difficult to obtain. This paper proposes an optimization strategy for multirobot task allocation (MRTA) problems and makes efforts on offering multiple solutions with same or similar quality for switching and selection. Since the mentioned problem can be regarded as a multimodal optimization one, this paper presents a niching immune-based optimization algorithm based on Softmax regression (sNIOA) to handle it. A prejudgment of population is done before entering an evaluation process to reduce the evaluation time and to avoid unnecessary computation. Furthermore, a guiding mutation (GM) operator inspired by the base pair in theory of gene mutation is introduced into sNIOA to strengthen its search ability. When a certain gene mutates, the others in the same gene group are more likely to mutate with a higher probability. Experimental results show the improvement of sNIOA on the aspect of accelerating computation speed with comparison to other heuristic algorithms. They also show the effectiveness of the proposed GM operator by comparing sNIOA with and without it. Two MRTA application cases are tested finally. [ABSTRACT FROM AUTHOR]

This paper considers the problem of secure parameter estimation when an estimation algorithm is prone to causative attacks. Causative attacks, in general, target decision-making algorithms (e.g., inference or learning algorithm) to alter their decisions in specific scenarios (e.g., distort parameter estimates for specific ranges of the parameter of interest). Such attacks influence the decisions via tampering with the mechanisms through which an algorithm acquires the statistical model of the population about which it aims to form a decision. Such attacks are viable, for instance, by contaminating the historical or training data, or by compromising an expert who provides the statistical model. In the presence of causative attacks, inference algorithms operate under a distorted statistical model for the data samples. This paper introduces a notion of secure parameter estimation and formalizes a framework under which secure estimation can be formulated and analyzed. The central premise underlying the secure estimation framework is that forming secure estimates introduces a new dimension to the estimation objective, pertaining to detecting attacks and isolating the true model. Since detection and isolation decisions themselves are imperfect, their inclusion induces an inherent coupling between the desired secure estimation objective and the auxiliary detection and isolation decisions that need to be formed in conjunction with the estimates. This paper establishes the fundamental interplay among these decisions, and characterizes the general decision rules in closed-forms for any desired estimation cost function. Furthermore, to circumvent the computational complexity associated with growing parameter dimension or attack complexity, a scalable estimation algorithm is provided, which is shown to enjoy certain optimality guarantees. Finally, the theory developed is applied to secure parameter estimation in sensor networks. [ABSTRACT FROM AUTHOR]

Objective: Despite numerous neural computational models proposed to explain physiological and pathological mechanisms of brain activity, a large gap remains between theory and application of the models. Building on the successful application of data-driven methods in epileptic seizure detection, we aim to build a bridge between data and models in this paper. Methods: We first propose a novel model-driven seizure detection method based on dynamic features in epileptic EEGs, where the rationale for dynamic features in epileptic EEGs can be clarified in theory by characterizing the variation of parameters of the model. Then we apply the proposed D&F-model-driven method to the problem of early epileptic seizure detection, where the evolution of model parameters selected and optimized by the proposed method is measured and used to detect the starting point of the seizure. Results: Numerical results on two open EEG databases demonstrate that our proposed method does a good job of early epileptic seizure detection. The average detection sensitivity, false positive rate and early detection period attain 100%, 0.1/h, and 7.1 s respectively. Conclusion: This paper provides a strategy to characterize EEG signals using a NMM-related method and the model parameters optimized by real EEG may then serve as features in their own right for early seizure detection. Significance: An useful attempt to early detect epileptic seizures by combining the neural mass model with data analysis. [ABSTRACT FROM AUTHOR]

Let $\mathrm {W}\in \mathbb {C}^{n\times n}$ be a single-spiked Wishart matrix in the class $\mathrm {W}\sim \mathcal {CW}_{n}(m,\mathrm {I}_{n}+ \theta \mathrm {v}\mathrm {v}^{\dagger}) $ with $m\geq n$ , where ${\mathrm {I}}_{n}$ is the $n\times n$ identity matrix, $\mathrm {v}\in \mathbb {C}^{n\times 1}$ is an arbitrary vector with unit Euclidean norm, $\theta \geq 0$ is a non-random parameter, and $(\cdot)^{\dagger} $ represents the conjugate-transpose operator. Let u1 and ${\mathrm {u}}_{n}$ denote the eigenvectors corresponding to the smallest and the largest eigenvalues of W, respectively. This paper investigates the probability density function (p.d.f.) of the random quantity $Z_{\ell }^{(n)}=\left |{\mathrm {v}^{\dagger} \mathrm {u}_\ell }\right |^{2}\in (0,1)$ for $\ell =1,n$. In particular, we derive a finite dimensional closed-form p.d.f. for $Z_{1}^{(n)}$ which is amenable to asymptotic analysis as $m,n$ diverges with $m-n$ fixed. It turns out that, in this asymptotic regime, the scaled random variable $nZ_{1}^{(n)}$ converges in distribution to $\chi ^{2}_{2}/2(1+\theta)$ , where $\chi _{2}^{2}$ denotes a chi-squared random variable with two degrees of freedom. This reveals that u1 can be used to infer information about the spike. On the other hand, the finite dimensional p.d.f. of $Z_{n}^{(n)}$ is expressed as a double integral in which the integrand contains a determinant of a square matrix of dimension $(n-2)$. Although a simple solution to this double integral seems intractable, for special configurations of $n=2,3$ , and 4, we obtain closed-form expressions. [ABSTRACT FROM AUTHOR]

This paper proposes and implements an asynchronous distributed IoT-enabled customer characterization framework to classify customers’ load consumption behaviors in electric distribution networks. More specifically, the proposed framework enables robust distributed clustering of customers’ electricity consumption habits in a highly scalable and interoperable framework. The proposed clustering method eliminates the need for hefty synchronization efforts typical to other distributed clustering algorithms. The theoretical foundations of designing the proposed framework are introduced. The orchestration of the application layers integrated in the proposed framework is demonstrated in an experimental implementation on a real-time network adopting a data-centric databus architecture. The results of the experimental implementation on IoT development boards demonstrate that the proposed framework can characterize customer categories with a 95% accuracy compared to classical centralized $k$ -means clustering, while ensuring seamless and interoperable peer-to-peer information exchange. This proved to be highly scalable and applicable to the real-world. [ABSTRACT FROM AUTHOR]

As an important research topic of machine learning, multiclass classification has wide applications ranging from computer vision to bioinformatics. A variety of multiclass classification algorithms with promising performance have been proposed. Among them, the decomposition-based algorithms have shown their competitiveness, since they transform the original problem into several easily solved binary classification sub-problems. Unlike existing decomposition-based algorithms which tackle each sub-problem independently, this paper suggests an evolutionary multitasking method, named EMT-MC, for multiclass classification, where the concept of multitasking is introduced to achieve the multiclass classifier with better quality. To be specific, in EMT-MC, each binary classification sub-problem is firstly viewed as a task. Then, during the evolution, the tasks with low performance (termed "ill-solved" tasks) are aided by some well-selected "assisting" tasks by using the evolutionary multitasking learning. This not only ensures that the useful information in "assisting" tasks can be transferred into those "ill-solved" tasks, but also helps them to achieve classifiers with higher accuracy. Numerical experiments on different multiclass classification datasets demonstrate the superiority of the proposed method over the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Online romance scams are a prevalent form of mass-marketing fraud in the West, and yet few studies have presented data-driven responses to this problem. In this type of scam, fraudsters craft fake profiles and manually interact with their victims. Because of the characteristics of this type of fraud and how dating sites operate, traditional detection methods (e.g., those used in spam filtering) are ineffective. In this paper, we investigate the archetype of online dating profiles used in this form of fraud, including their use of demographics, profile descriptions, and images, shedding light on both the strategies deployed by scammers to appeal to victims and the traits of victims themselves. Furthermore, in response to the severe financial and psychological harm caused by dating fraud, we develop a system to detect romance scammers on online dating platforms. This paper presents the first fully described system for automatically detecting this fraud. Our aim is to provide an early detection system to stop romance scammers as they create fraudulent profiles or before they engage with potential victims. Previous research has indicated that the victims of romance scams score highly on scales for idealized romantic beliefs. We combine a range of structured, unstructured, and deep-learned features that capture these beliefs in order to build a detection system. Our ensemble machine-learning approach is robust to the omission of profile details and performs at high accuracy (97%) in a hold-out validation set. The system enables development of automated tools for dating site providers and individual users. [ABSTRACT FROM AUTHOR]

The multimodal optimization problem (MMOP) requires the algorithm to find multiple global optima of the problem simultaneously. In order to solve MMOP efficiently, a novel differential evolution (DE) algorithm based on the local binary pattern (LBP) is proposed in this paper. The LBP makes use of the neighbors’ information for extracting relevant pattern information, so as to identify the multiple regions of interests, which is similar to finding multiple peaks in MMOP. Inspired by the principle of LBP, this paper proposes an LBP-based adaptive DE (LBPADE) algorithm. It enables the LBP operator to form multiple niches, and further to locate multiple peak regions in MMOP. Moreover, based on the LBP niching information, we develop a niching and global interaction (NGI) mutation strategy and an adaptive parameter strategy (APS) to fully search the niching areas and maintain multiple peak regions. The proposed NGI mutation strategy incorporates information from both the niching and the global areas for effective exploration, while APS adjusts the parameters of each individual based on its own LBP information and guides the individual to the promising direction. The proposed LBPADE algorithm is evaluated on the extensive MMOPs test functions. The experimental results show that LBPADE outperforms or at least remains competitive with some state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Objective: Preterm birth is the first cause of perinatal morbidity and mortality. Despite continuous clinical routine improvements, the preterm rate remains steady. Moreover, the specificity of the early diagnosis stays poor as many hospitalized women for preterm delivery threat finally deliver at term. In this context, the use of electrohysterograms may increase the sensitivity and the specificity of early diagnosis of preterm labor. Methods: This paper proposes a clinical application of electrohysterogram processing for the classification of patients as prone to deliver within a week or later. The approach relies on non-linear correlation analysis for the contraction bursts extraction and uses computation of various features combined with the use of Gaussian mixture models for their classification. The method is tested on a new dataset of 68 records collected on women hospitalized for preterm delivery threat. Results: This paper presents promising results for the automatic segmentation of the contraction and a classification sensitivity, specificity, and accuracy of, respectively, 80.7%, 76.3%, and 76.2%. Conclusion: These results are in accordance with the gold standards but have the advantage to be non-invasive and could be performed at home. Significance: Diagnosis of imminent labor is possible by electrohysterography recording and may help in avoiding over-medication and in providing better cares to at-risk pregnant women. [ABSTRACT FROM AUTHOR]

In the last two decades, a variety of different types of multiobjective optimization problems (MOPs) have been extensively investigated in the evolutionary computation community. However, most existing evolutionary algorithms encounter difficulties in dealing with MOPs whose Pareto optimal solutions are sparse (i.e., most decision variables of the optimal solutions are zero), especially when the number of decision variables is large. Such large-scale sparse MOPs exist in a wide range of applications, for example, feature selection that aims to find a small subset of features from a large number of candidate features, or structure optimization of neural networks whose connections are sparse to alleviate overfitting. This paper proposes an evolutionary algorithm for solving large-scale sparse MOPs. The proposed algorithm suggests a new population initialization strategy and genetic operators by taking the sparse nature of the Pareto optimal solutions into consideration, to ensure the sparsity of the generated solutions. Moreover, this paper also designs a test suite to assess the performance of the proposed algorithm for large-scale sparse MOPs. The experimental results on the proposed test suite and four application examples demonstrate the superiority of the proposed algorithm over seven existing algorithms in solving large-scale sparse MOPs. [ABSTRACT FROM AUTHOR]

In this paper, we discuss a method for generating new individuals such that their mean vector and the covariance matrix are defined by formulas analogous to the covariance matrix adaptation evolution strategy (CMA-ES). In contrast to CMA-ES, which generates new individuals using multivariate Gaussian distribution with an explicitly defined covariance matrix, the introduced method uses combinations of difference vectors between archived individuals and univariate Gaussian random vectors along directions of past shifts of the population midpoints. We use this method to formulate the differential evolution strategy (DES)—an algorithm that is a crossover between differential evolution (DE) and CMA-ES. The numerical results presented in this paper indicate that DES is competitive against CMA-ES in performing both local and global optimization. [ABSTRACT FROM AUTHOR]

This paper presents fuzzy ${c}$ -means-based yield estimation (FUZYE), a methodology that reduces the time impact caused by Monte Carlo (MC) simulations in the context of analog integrated circuits (ICs) yield estimation, enabling it for yield optimization with population-based algorithms, e.g., the genetic algorithm (GA). MC analysis is the most general and reliable technique for yield estimation, yet the considerable amount of time it requires has discouraged its adoption in population-based optimization tools. The proposed methodology reduces the total number of MC simulations that are required, since, at each GA generation, the population is clustered using a fuzzy ${c}$ -means (FCMs) technique, and, only the representative individual (RI) from each cluster is subject to MC simulations. This paper shows that the yield for the rest of the population can be estimated based on the membership degree of FCM and RIs yield values alone. This new method was applied on two real circuit-sizing optimization problems and the obtained results were compared to the exhaustive approach, where all individuals of the population are subject to MC analysis. The FCM approach presents a reduction of 89% in the total number of MC simulations, when compared to the exhaustive MC analysis over the full population. Moreover, a ${k}$ -means-based clustering algorithm was also tested and compared with the proposed FUZYE, with the latest showing an improvement up to 13% in yield estimation accuracy. [ABSTRACT FROM AUTHOR]

The aim of this paper is to mitigate the problem of high power demand peak and load oscillations in the operation of a large population of thermostatically controlled loads (TCLs) operated by model predictive control (MPC) at the TCL level. Two desynchronized MPC schemes are introduced: 1) adding random delays in reference signals and 2) extra penalizations on MPC objective functions. For characterizing and validating the proposed desynchronization MPC schemes, a partial differential equation (PDE) model is developed to represent the evolution of the operational states of the TCLs controlled by MPC in a population. The focus of this paper is put on the control of cooling fans in server racks of datacenters, whereas the proposed approach is applicable to other types of TCLs. Numerical simulation studies are carried out and the obtained results confirm the validity and the applicability of the developed approach. [ABSTRACT FROM AUTHOR]

Intelligent learning environments can be designed to support the development of learners’ cognitive skills, strategies, and metacognitive processes as they work on complex decision-making and problem-solving tasks. However, the complexity of the tasks may impede the progress of novice learners. Providing adaptive feedback to learners who face difficulties requires learner modeling approaches that can identify learners’ proficiencies and the difficulties they face in executing required skills, strategies, and metacognitive processes. This paper discusses a multilevel hierarchical learner modeling scheme that analyzes and captures learners’ cognitive processes and problem-solving strategies along with their performance on assigned tasks in a game-based environment called UrbanSim that requires complex decision making for dealing with counterinsurgency scenarios. As the scenario evolves in a turn-by-turn fashion, UrbanSim evaluates the learners’ moves using a number of performance measures. Our learner modeling scheme interprets the reported performance values by analyzing the learners’ activities captured in log files to derive learners’ proficiencies in associated cognitive skills and strategies, and updates the learner model. We discuss the details of the learner modeling algorithms in this paper, and then demonstrate the effectiveness of our approach by presenting results from a study we conducted at Vanderbilt University. [ABSTRACT FROM AUTHOR]

Objective: The goal of this paper was to optimize robust PID control for propofol anesthesia in children aged 5–10 years to improve performance, particularly to decrease the time of induction of anesthesia while maintaining robustness. Methods: We analyzed results of a previous study conducted by our group to identify opportunities for system improvement. Allometric scaling was introduced to reduce the interpatient variability and a new robust PID controller was designed using an optimization-based method. We evaluated this optimized design in a clinical study involving 16 new cases. Results: The optimized controller design achieved the performance predicted in simulation studies in the design stage. Time of induction of anesthesia was median [Q1, Q3] 3.7 [2.3, 4.1] min and the achieved global score was 13.4 [9.9, 16.8]. Conclusion: Allometric scaling reduces the interpatient variability in this age group and allows for improved closed-loop performance. The uncertainty described by the model set, the predicted closed-loop responses, and the predicted robustness margins are realistic. The system meets the design objectives of improved speed of induction of anesthesia while maintaining robustness and improving clinically relevant system behavior. Significance: Control system optimization and ongoing system improvements are essential to the development of a clinically relevant commercial device. This paper demonstrates the validity of our approach, including system modeling, controller optimization, and pre-clinical testing in simulation. [ABSTRACT FROM AUTHOR]

Evolutionary multitasking is a recently proposed paradigm to simultaneously solve multiple tasks using a single population. Most of the existing evolutionary multitasking algorithms treat all tasks equally and then assign the same amount of resources to each task. However, when the resources are limited, it is difficult for some tasks to converge to acceptable solutions. This paper aims at investigating the resource allocation in the multitasking environment to efficiently utilize the restrictive resources. In this paper, we design a novel multitask evolutionary algorithm with an online dynamic resource allocation strategy. Specifically, the proposed dynamic resource allocation strategy allocates resources to each task adaptively according to the requirements of tasks. We also design an adaptive method to control the resources invested into cross-domain searching. The proposed algorithm is able to allocate the computational resources dynamically according to the computational complexities of tasks. The experimental results demonstrate the superiority of the proposed method in comparison with the state-of-the-art algorithms on benchmark problems of multitask optimization. [ABSTRACT FROM AUTHOR]

Under transactive (market-based) coordination, a population of distributed energy resources (DERs), such as thermostatically controlled loads (TCLs) and storage devices, bid into an energy market. Consequently, a certain level of demand will be cleared based on the operating conditions of the grid. This paper analyzes the influence of various factors, such as price signals, feeder limits, and user-defined bid functions and preferences, on the aggregate energy usage of DERs. We identify cases that can lead to load synchronization, undesirable power oscillations and highly volatile prices. To address these issues, the paper develops an aggregate model of DERs under transactive coordination. A set of Markov transition equations have been developed over discrete ranges (referred to as “bins”) of price levels and their associated DER operating states. A detailed investigation of the performance of this aggregate model is presented. With reformulation of the transition equations, the bin model has been incorporated into a model predictive control setting using both mixed integer programming and quadratic programming. A case study shows that a population of TCLs can be managed economically while avoiding congestion in a distribution grid. Simulations also demonstrate that power oscillations arising from synchronization of TCLs can be effectively avoided. [ABSTRACT FROM AUTHOR]

Contribution: This paper explores the factors contributing to the development of engineering identity in Latinx students at two institutions. A better understanding of these factors will support the development of more inclusive engineering education environments and experiences. Background: Persistence of Latinx engineering students is of particular interest due to their underrepresentation in the field. Identity is a lens for understanding student persistence, but Latinx students are underrepresented in prior engineering identity studies. This paper seeks to identify the unique factors, academic and professional, that contribute to engineering identity development, and potential means for supporting the persistence of Latinx engineers. Research Questions: 1) What academic and professional affect factors predict engineering identity development of Latinx students? and 2) What role does the institution play in Latinx students’ engineering identity development? Methodology: A mixed-methods approach was used to measure engineering identity based on a framework incorporating both academic and professional affect elements. Regression analyses were conducted on 892 responses to an online survey from Latinx engineering students, with additional insight from interviews with ten Latinx engineering students. Findings: Six of the nine factors analyzed (performance/competence, interest, recognition, analysis, framing and solving problems, and tinkering) were significant predictors of Latinx students’ engineering identity, as were institution, gender, and having a parent with an engineering degree. Engineering identity was higher for Latinx students at the Hispanic Serving Institution, but none of the interaction terms were significant, so the relationship between these factors and engineering identity is similar at each institution. [ABSTRACT FROM AUTHOR]

The main goal in group testing is to recover a small subset of defective items from a larger population while efficiently reducing the total number of (possibly noisy) required tests/measurements. Under the assumption that the input-output statistical relationship (i.e., channel law) is known to the recovery algorithm, the fundamental as well as the computational limits of the group testing problem are relatively better understood than when these statistical relationships are unknown. Practical considerations, however, render this assumption inapplicable, and “blind” recovery/estimation procedures, independent of the input-output statistics, are desired. In this paper, we analyze the fundamental limits of a general noisy group testing problem, when this relationship is unknown. Specifically, in the first part of this paper, we propose an efficient scheme, based on the idea of separate-decoding of items (where each item is recovered separately), for which we derive sufficient conditions on the number of tests required for exact recovery. The difficulty in obtaining these conditions stems from the fact that we allow the number of defective items to grow with the population size, which in turn requires delicate concentration analysis of certain probabilities. Furthermore, we show that in several scenarios, our proposed scheme achieves the same performance as that of the corresponding non-blind recovery algorithm (where the input-output statistics are known), implying that the proposed blind scheme is robust/universal. Finally, in the second part of this paper, we propose also an inefficient combinatorial-based scheme (or, “joint-decoding”), for which we derive similar sufficient conditions. [ABSTRACT FROM AUTHOR]

The failure rate is essential in power system reliability assessment and thus far, it has been commonly assumed as constant. This is a basic approach that delivers reasonable results. However, this approach neglects the heterogeneity in component populations, which has a negative impact on the accuracy of the failure rate. This paper proposes a method based on risk functions, which describes the risk behavior of condition measurements over time, to compute individual failure rates within populations. The method is applied to a population of 12 power transformers on transmission level. The computed individual failure rates depict the impact of maintenance and that power transformers with long operation times have a higher failure rate. Moreover, this paper presents a procedure based on the proposed approach to forecast failure rates. Finally, the individual failure rates are calculated over a specified prediction horizon and depicted with a 95% confidence interval. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) has two salient components: 1) a dynamical rule governing particle motion and 2) an interparticle communication topology. Recent practice has focused on the fully connected topology (Gbest) despite earlier indications on the superiority of local particle neighborhoods. This paper seeks to address the controversy with empirical trials with canonical PSO on a large benchmark of functions, categorized into 14 properties. This paper confirms the early lore that Gbest is the overall better algorithm for unimodal and separable problems and that a ring neighborhood of connectivity two (Lbest) is the preferred choice for multimodal, nonseparable and composition functions. Topologies of intermediate particle connectivity were also tested and the difference in global/local performance was found to be even more marked. A measure of significant improvement is introduced in order to distinguish major improvements from refinements. Lbest, according to the experiments on the 84 test functions and a bi-modal problem of adjustable severity, is found to have significant improvements later in the run, and to be more diverse at termination. A mobility study shows that Lbest is better able to jump between optimum basins. Indeed Gbest was unable to switch basins in the bi-modal trial. The implication is that Lbest’s larger terminal diversity, its better ability to basin hop and its later significant improvement account for the performance enhancement. In several cases where Lbest was not the better algorithm, the trials show that Lbest was not stuck but would have continued to improve with an extended evaluation budget. Canonical PSO is a baseline algorithm and the ancestor of all contemporary PSO variants. These variants build on the basic structure of baseline PSO and the broad conclusions of this paper are expected to follow through. In particular, research that fails to consider local topologies risks underplaying the success of the promoted algorithm. [ABSTRACT FROM AUTHOR]

Understanding intra-urban human mobility patterns and their potential driving forces are vital to city planning and commercial site selection. In this paper, we first investigate the functions of urban regions and how different region types dynamically influence people’s trip decisions. Furthermore, we characterize urban circadian rhythms by time-vary inter-regional transition probabilities between these regions with different functions, and integrate them into intervening opportunity model to predict human mobility. Public transportation card data in Shanghai are used to demonstrate the effectiveness of the model in terms of station passenger flows, travel time and trip flux. By taking regional function into consideration, the proposed model significantly improved the prediction accuracy. Quantitative analysis ulteriorly indicates that trip intentions and regional features are critical elements in trip flux prediction, especially in the afternoon and evening when people have an abundance of opportunities to travel by their own volition. When the function of a certain region changes, our model is able to make reasonable predictions accordingly. The results indicate the importance of considering individual travel motivation and regional function in modeling human mobility. The proposed model could serve as a guide for popularity and trip flux prediction in urban planning and reconstruction. [ABSTRACT FROM AUTHOR]

Floating Content (FC) is a paradigm for localized infrastructure-less content dissemination, that aims at sharing information among nodes within a restricted geographical area by relying only on opportunistic content exchanges. FC provides the basis for the probabilistic spatial storage of shared information in a completely decentralized fashion, usually without support from dedicated infrastructure. One of the key open issues in FC is the characterization of its performance limits as functions of the system parameters, accounting for its reliance on volatile wireless exchanges and on limited user resources. This paper takes a first step towards tackling this issue, by elaborating a model for the storage capacity of FC, i.e., for the maximum amount of information that can be stored through the FC paradigm. The storage capacity of FC, and of similar probabilistic content dissemination systems, is evaluated with a powerful information theoretical approach, based on a mean field model of opportunistic information exchange. In addition, an extremely simple explicit approximate expression for storage capacity is derived. The numerical results generated by our analytical models are compared to the predictions of realistic simulations under different setups, proving the accuracy of our analytical approaches, and characterizing the properties of the FC storage capacity. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) is an emerging computing paradigm that decreases the computing time and extends the lifespan of user equipments (UEs). In MEC, the computational tasks are offloaded from UEs to the base station (BS) at the edge of the network for processing. However, MEC cannot cope with environments where there are no BS or where communication facilities have been destroyed. In this paper, we study the problem of minimizing the energy consumption of UAV equipped with MEC servers as a mobile base station to serve users. The problem involves user offloading decision, UAV location and allocation with computational resources, and is a hybrid optimization problem with continuous and discrete variables. To address this problem, we propose a hybrid nature-inspired optimization algorithm (HNIO) and its version for discrete optimization, where HNIO incorporates mutation and population diversity detection mechanisms to boost its global optimization capability, and we design a probabilistic selection-based coding strategy for the discrete optimization version. The experimental study is conducted based on ten cases with different numbers of UEs. Comparing HNIO with several other state-of-the-art optimization algorithms, it is concluded from the Friedman and Wilcoxon’s test of the experimental results that HNIO shows better precision and stability in nine out of the ten cases with higher number of UEs. [ABSTRACT FROM AUTHOR]

Biocomputing systems based on engineered bacteria can lead to novel tools for environmental monitoring and detection of metabolic diseases. In this paper, we propose a Bacterial Molecular Computing on a Chip (BMCoC) using microfluidic and electrochemical sensing technologies. The computing can be flexibly integrated into the chip, but we focus on engineered bacterial AND Boolean logic gate and ON-OFF switch sensors that produces secondary signals to change the pH and dissolved oxygen concentrations. We present a prototype with experimental results that shows the electrochemical sensors can detect small pH and dissolved oxygen concentration changes created by the engineered bacterial populations’ molecular signals. Additionally, we present a theoretical model analysis of the BMCoC computation reliability when subjected to unwanted effects, i.e., molecular signal delays and noise, and electrochemical sensors threshold settings that are based on either standard or blind detectors. Our numerical analysis found that the variations in the production delay and the molecular output signal concentration can impact on the computation reliability for the AND logic gate and ON-OFF switch. The molecular communications of synthetic engineered cells for logic gates integrated with sensing systems can lead to a new breed of biochips that can be used for numerous diagnostic applications. [ABSTRACT FROM AUTHOR]

Pattern mining (PM) refers to the process of discovering patterns of interest to users from data. However, most studies have considered only one pattern, such as frequent pattern or high-utility pattern. With the continuous requirement of businesses in various industries, the single-objective PM methods are difficult to meet the increasingly diverse needs of users. In this paper, a multi-objective problem model for high quality pattern mining (HQPM) is proposed, where the objectives are support, occupancy, and utility. In order to solve the proposed three-objective problem efficiently, an improved multi-objective evolutionary algorithm for HQPM (MOEA-PM) is proposed. Two kinds of population initialization strategies are designed, which is used to ensure the population is effectively distributed in the feasible solution space. By taking the properties of the model into consideration, an auxiliary tool is proposed to accelerate the convergence of the algorithm. Experimental results on real-world datasets show that the proposed three-objective problem model with the MOEA-PM algorithm can discover patterns that are both frequently occurring and has a high utility in the transaction datasets, while at the same time being relatively complete. Compared with the state-of-the-art MOEA-based HQPM algorithms, MOEA-PM has better performance in terms of efficiency, quality, and convergence speed. [ABSTRACT FROM AUTHOR]

The population of electric vehicles (EVs) has grown rapidly over the past decade due to the development of EV technologies, battery materials, charger facilities, and public charging services. Many governments have implemented plans to ban fossil fuel vehicles considering the significance of EVs in reducing greenhouse gas emissions. However, due to the battery material characteristics and charger power limitations, the EV charging process requires more time than is needed to fill a non-EV with fuel at a gasoline station, causing drivers to experience range anxiety and impeding the promotion of EVs. Hence, the battery swapping station (BSS) model has been proposed as an alternative method. Recently, researchers have studied the BSS approach by proposing various operation systems and optimization methods, and BSS service operators have successfully implemented swapping at commercial and private stations. This paper reviews the state-of-the-art BSS literature and business models, where the BSS offers a recharged battery to an incoming EV with a low state-of-charge. First, four operation modes are presented: a single BSS, multiple BSSs, an integrated BSS and battery charging station (BCS), and multiple BSSs and BCSs. Then, the BSS decision scenarios are surveyed in relation to five operational areas, i.e., charging schedule, service policy, construction and planning, dispatching and routing, and power management, where the scenarios are compared in terms of the BSS mode, decision maker, EV category, number of battery types, vehicle to grid, and focus and objective. Finally, the survey concludes with a discussion of several future research directions for EV BSSs. [ABSTRACT FROM AUTHOR]

The capability of traffic-information systems to sense the movement of millions of users and offer trip plans through mobile phones has enabled a new way of optimizing city traffic dynamics, turning transportation big data into insights and actions in a closed-loop and evaluating this approach in the real world. Existing research has applied dynamic Bayesian networks and deep neural networks to make traffic predictions from floating car data, utilized dynamic programming and simulation approaches to identify how people normally travel with dynamic traffic assignment for policy research, and introduced Markov decision processes and reinforcement learning to optimally control traffic signals. However, none of these works utilized floating car data to suggest departure times and route choices in order to optimize city traffic dynamics. In this paper, we present a study showing that floating car data can lead to lower average trip time, higher on-time arrival ratio, and higher Charypar-Nagel score compared with how people normally travel. The study is based on optimizing a partially observable discrete-time decision process and is evaluated in one synthesized scenario, one partly synthesized scenario, and three real-world scenarios. This study points to the potential of a “living lab” approach where we learn, predict, and optimize behaviors in the real world. [ABSTRACT FROM AUTHOR]

Food is one of the basic essential elements for human beings. Its quality is directly related to our physical, emotional, and social well-being. An electronic nose is a non-destructive instrument and is an effective solution for quick and easy determination of food quality. In this paper, an integrated soft E-nose methodology focusing on performance enhancement and complexity reduction is proposed and implemented for the effective classification of beef quality and prediction of microbial population in beef. The soft E-nose methodology is tested on 18 available datasets. Ours is a four-step approach that includes validated data collection, signal processing with a moving average filter and principal component analysis for feature reduction, efficient pattern recognition using machine learning and deep learning techniques like support vector machine, k-nearest neighbors, artificial neural network, extreme learning machine, and deep neural network for classification and regression, and an output stage for classification and prediction of the microbial population of beef. This methodology could provide accuracy greater than 98% using k-nearest neighbors, artificial neural network methods, and a correlation coefficient of greater than 0.98 using support vector machine and artificial neural network methods. The proposed methodology is validated using 10-fold cross-validation. [ABSTRACT FROM AUTHOR]

Rhythmic oscillation is crucial for information transmission and neural communication among different brain areas. Stochastic resonance (SR) can evoke different patterns of neural oscillation. However, the characteristics of network resonance and underlying dynamical mechanisms are still unclear. In this paper, a biological model of cortical network is established and its dynamical response to external periodic stimulation is investigated. We explore the oscillatory resonance of excitatory and inhibitory populations in cortical network. It is found that the intrinsic parameters of neural populations determine the extent of resonant activity, indicating that the firing rate exhibits coherent oscillation when the frequency of external stimulation is close to intrinsic frequency of neural population. In addition, the nonlinear dynamics of cortical network in oscillatory resonance can be represented by helical manifolds in low-dimensional state space. The geometry of neural manifolds reveals the periodic dynamics and state transition in oscillatory resonance. Moreover, time delay in chemical synapses can induce multiple resonances, which appear intermittently at integer multiples of the period of input signal. The dynamical response of neural population achieves maximal periodically, due to the transition of network states induced by time delay. Furthermore, mean-field theory is applied to analyze theoretical dynamic of cortical networks with time delay and demonstrate the effective transmission of stimulation information via oscillatory resonance in the brain. Consequently, the obtained results contribute to the improvement of neuromodulation for neurological disease from the viewpoint of the neural basis. [ABSTRACT FROM AUTHOR]

Advances in communications, storage and computational technology allow significant quantities of data to be collected and processed by distributed devices. Combining the information from these endpoints can realize significant societal benefit but presents challenges in protecting the privacy of individuals, especially important in an increasingly regulated world. Differential privacy (DP) is a technique that provides a rigorous and provable privacy guarantee for aggregation and release. The Shuffle Model for DP has been introduced to overcome challenges regarding the accuracy of local-DP algorithms and the privacy risks of central-DP. In this work we introduce a new protocol for vector aggregation in the context of the Shuffle Model. The aim of this paper is twofold; first, we provide a single message protocol for the summation of real vectors in the Shuffle Model, using advanced composition results. Secondly, we provide an improvement on the bound on the error achieved through using this protocol through the implementation of a Discrete Fourier Transform, thereby minimizing the initial error at the expense of the loss in accuracy through the transformation itself. This work will further the exploration of more sophisticated structures such as matrices and higher-dimensional tensors in this context, both of which are reliant on the functionality of the vector case. [ABSTRACT FROM AUTHOR]

Joint caching and recommendation has been recently proposed as a new paradigm for increasing the efficiency of mobile edge caching. Early findings demonstrate significant gains for the network performance. However, previous works evaluated the proposed schemes exclusively on simulation environments. Hence, it still remains uncertain whether the claimed benefits would change in real settings. In this paper, we propose a methodology that enables to evaluate joint network and recommendation schemes in real content services by only using publicly available information. We apply our methodology to the YouTube service, and conduct extensive measurements to investigate the potential performance gains. Our results show that significant gains can be achieved in practice; e.g., 8 to 10 times increase in the cache hit ratio from cache-aware recommendations. Finally, we build an experimental testbed and conduct experiments with real users; we make available our code and datasets to facilitate further research. To our best knowledge, this is the first realistic evaluation (over a real service, with real measurements and user experiments) of the joint caching and recommendations paradigm. Our findings provide experimental evidence for the feasibility and benefits of this paradigm, validate assumptions of previous works, and provide insights that can drive future research. [ABSTRACT FROM AUTHOR]

Alterations in the human Gut Bacteriome (GB) can be associated with human health issues, such as type-2 diabetes and obesity. Both external and internal factors can drive changes in the composition and in interactions of the human GB, impacting negatively on the host cells. This paper focuses on the human GB metabolism and proposes a two-layer network system to investigate its dynamics. Furthermore, we develop an in-silico simulation model (virtual GB), allowing us to study the impact of the metabolite exchange through molecular communications in the human GB network system. Our results show that regulation of molecular inputs strongly affects bacterial population growth and creates an unbalanced network, as shown by shifts in the node weights based on the produced molecular signals. Additionally, we show that the metabolite molecular communication production is greatly affected when directly manipulating the composition of the human GB network in the virtual GB. These results indicate that our human GB interaction model can help to identify hidden behaviours of the human GB depending on molecular signal interactions. Moreover, the virtual GB can support the research and development of novel medical treatments based on the accurate control of bacterial population growth and exchange of metabolites. [ABSTRACT FROM AUTHOR]

Due to natural disasters or system failures, the facility has the risk of disruption, and thus improving the location reliability under uncertainty of facilities becomes an important issue. In this paper, we propose a multi-objective facility location problem under uncertainty of facilities, where two objectives on reliability are constructed and multiple coverage with variable radius is imposed to reduce the influence caused by the facility disruption. A dual-population based evolutionary algorithm is also suggested to address this problem, where one population is for the location optimization and the other population is for the radius optimization. These two populations iteratively exchange the information obtained from elite solutions during the evolution to collaboratively search for the optimal solutions of the problem. The location population provides the high-quality location schemes for radius population in evaluating the quality of radii of each location, whereas the radius population equips the proper radii for location population in determining the good location schemes. Experimental results indicate that the proposed model can effectively improve the location reliability and the proposed method can obtain higher quality optimal solutions in comparison with four state-of-the-art algorithms. Moreover, the proposed method is applied to a real-world facility location with uncertainty of express cabinets in Tianjin, China, and it produces satisfactory location schemes. [ABSTRACT FROM AUTHOR]

Today’s Internet traffic has been dominated by video contents. To efficiently serve online videos for millions of users, it is essential to cache frequently requested videos on various devices such as edge servers, personal computers, etc. Existing caching algorithms are mainly designed by leveraging the information of past request records. However, it is insufficient to only use simple statistics of past request records, e.g., video popularity which ignores the occurrence time of past video request events and the discrepancies among individual devices. In this paper, we propose a radically different learning-based video caching algorithm for Internet devices, called PPVC (Point Process based Video Cache) which can take exact video request patterns into account. By utilizing Hawkes Process (HP), we are able to link the future video request rates of a device with three kinds of historical records, namely, historical requests for the same video launched by the device itself, historical requests for the same video from other devices with a similar request pattern, and historical requests for other similar videos from the same device. The video request patterns can be efficiently computed via Singular Value Decomposition (SVD). Parameters linking these historical events can be determined by maximizing the likelihood of historical events. To further reduce the computation load, we also propose an online version of PPVC, which can timely update cached videos with the incremental arrival of events. One nice property of PPVC is that it can adapt to the change of video popularity very fast and is also applicable to Internet devices at different levels, ranging from the high-level servers that serve a large population of users to the low-level user devices (e.g., personal computers). Finally, we conduct extensive simulations with real traces and the results show that PPVC can always achieve the best video caching performance in terms of the hit rate on all levels of Internet devices, and quickly adapt to the dynamics of video requests. [ABSTRACT FROM AUTHOR]

Knowledge graph is becoming an indispensable resource that offers structured information for numerous AI applications. However, the knowledge graph often suffers from its incompleteness. Building a complete, high-quality knowledge graph is time-consuming and requires significant human annotation efforts. In this paper, we study the Knowledge Graph Population task, which aims at extending the scale of structured knowledge, with a special focus on reducing data preparation and annotation efforts. Previous works mainly based on discriminative methods build classifiers and verify candidate triplets that are extracted from texts, which heavily rely on the quality of data collection and co-occurrance of entities in the text. However, such methods fail to generalize on entity pairs that are not highly co-occurred, and fail to discover entity pairs that are not co-occurred at all in the given text corpus. We introduce a generative perspective to approach this task and define each relationship by learning the data distribution that embodies the core common properties for relational reasoning. A generative model KGGen is proposed, which samples from the learned data distribution for each relation and can generate triplets regardless of entity pair co-occurrence in the text corpus. To further improve the generation quality while alleviate human annotation efforts, adversarial learning is adopted to not only encourage generating high quality triplets, but also give model the ability to automatically assess the generation quality. Quantitative and qualitative experimental results conducted on two real-world generic knowledge graphs show that the proposed model KGGen generates novel and meaningful triplets with improved efficiency and less human annotation comparing with the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]