Search

The objectives of this paper are to investigate the capability of genetic programming to select and extract linearly separable features when the evolutionary process is guided to achieve the same and to propose an integrated system for that. We decompose a c-class problem into c binary classification problems and evolve c sets of binary classifiers employing a steady-state multiobjective genetic programming with three minimizing objectives. Each binary classifier is composed of a binary tree and a linear support vector machine (SVM). The features extracted by the feature nodes and some of the function nodes of the tree are used to train the SVM. The decision made by the SVM is considered the decision of the corresponding classifier. During crossover and mutation, the SVM-weights are used to determine the usefulness of the corresponding nodes. We also use a fitness function based on Golub’s index to select useful features. To discard less frequently used features, we employ unfitness functions for the feature nodes. We compare our method with 34 classification systems using 18 datasets. The performance of the proposed method is found to be better than 432 out of 570, i.e., 75.79% of comparing cases. Our results confirm that the proposed method is capable of achieving our objectives. [ABSTRACT FROM AUTHOR]

The performance of decomposition-based multiobjective evolutionary algorithms (MOEAs) often deteriorates clearly when solving multiobjective optimization problems with irregular Pareto fronts (PFs). The main reason is the improper settings of reference vectors and scalarizing functions. In this paper, we propose a decomposition-based MOEA guided by a growing neural gas network, which learns the topological structure of the PF. Both reference vectors and scalarizing functions are adapted based on the topological structure to enhance the evolutionary algorithm’s search ability. The proposed algorithm is compared with eight state-of-the-art optimizers on 34 test problems. The experimental results demonstrate that the proposed method is competitive in handling irregular PFs. [ABSTRACT FROM AUTHOR]

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

Social relationships have a strong influence on individual travel behavior and, consequently, on travel demand. However, most current literatures on population synthesis, which is the fundamental building block of disaggregated travel demand forecasting and agent-based traffic simulation, only considers the household impact. This paper makes two contributions in this regard. First, a methodological issue is identified: the existence of multiple social relationships (e.g., a dual set of constraints from social institutions or structures) makes it more difficult to generate a consistent synthetic population, meaning that this population satisfies constraints from more than one type of social organizations. A tensor decomposition method is then proposed to generate a consistent population with multi-social relationships. To our knowledge, this is the first time that this type of methodological issue has been addressed. Our sample-based method constitutes an improvement compared to existing approaches in that it can respect constraints from multiple social organizations without reducing accuracy. A numerical test concerning individual, household, and enterprise, using Chinese national population and economic census data, indicates that the new method can lead to stable and relatively small errors in total. The source code is available from https://github.com/PeijunYe/MulSocPopSyn.git. [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]

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

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

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

Running time analysis is a fundamental problem of critical importance in evolutionary computation. However, the analysis results have rarely been applied to advanced evolutionary algorithms (EAs) in practice, let alone their variants for continuous optimization. In this paper, an experimental method is proposed for analyzing the running time of EAs that are widely used for solving continuous optimization problems. Based on Glivenko–Cantelli theorem, the proposed method simulates the distribution of gain, which is introduced by average gain model to characterize progress during the optimization process. Data fitting techniques are subsequently adopted to obtain a desired function for further analyses. To verify the validity of the proposed method, experiments were conducted to estimate the upper bounds on expected first hitting time of various evolutionary strategies, such as (1, λ) evolution strategy, standard evolution strategy, covariance matrix adaptation evolution strategy, and its improved variants. The results suggest that all estimated upper bounds are correct. Backed up by the proposed method, state-of-the-art EAs for continuous optimization will have identical results about the running time as simplified schemes, which will bridge the gap between theoretical foundation and applications of evolutionary computation. [ABSTRACT FROM AUTHOR]

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

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

Prediction of event such as failure event or critical warning event plays an important role in reliability engineering. In this paper, we present a semiparametric method to predict event occurrences for an individual unit in real time using recurrent event data. The intensity of event occurrence is modeled using the extended Cox proportional-hazard model and the distinction of units is achieved using an additional frailty parameter. The method presented features an online updating scheme, and therefore, can provide the real-time prediction of the occurrence of next event. We demonstrate the efficacy of frailty and the updating scheme through comprehensive numerical experiments and a case study based on real-world data. [ABSTRACT FROM AUTHOR]

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

When solving constrained optimization problems by evolutionary algorithms, the core issue is to balance constraints and objective function. This paper is the first attempt to utilize the correlation between constraints and objective function to keep this balance. First of all, the correlation between constraints and objective function is mined and represented by a correlation index. Afterward, a weighted sum updating approach and an archiving and replacement mechanism are proposed to make use of this correlation index to guide the evolution. By the above process, a novel constrained optimization evolutionary algorithm is presented. Experiments on a broad range of benchmark test functions indicate that the proposed method shows better or at least competitive performance against other state-of-the-art methods. Moreover, the proposed method is applied to the gait optimization of humanoid robots. [ABSTRACT FROM AUTHOR]

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

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]

Contactless fingerprint recognition is highly promising and an essential component in the automatic fingerprint identification system. However, due to the inherent characteristic of perspective distortions of contactless fingerprints, achieving a highly accurate contactless fingerprint recognition system is very challenging. In this paper, we propose a robust contactless fingerprint recognition method based on global minutia topology and loose genetic algorithm. In order to avoid the inaccurate minutiae alignment problem suffered in conventional transformation-based methods, the minutiae correspondence is established by optimizing an energy function of the similarity matrix. We define an innovative similarity matrix based on both minutiae and minutia-pairs, which takes the global minutia topology into account. By adopting a distortion-free feature of ridge count to define the similarity, the problem of perspective distortions is effectively overcome. To solve the optimization, we propose a new genetic algorithm (GA) named loose GA with new mutation and crossover operators. We also propose a strict minutia-pair expanding algorithm to enhance the reliability of the minutiae correspondence. For recognition, a metric for measuring comparison scores which takes advantage of both the global topological similarity and the number of corresponding minutiae is proposed. We evaluate our method using two contactless fingerprint benchmark databases and achieve competitive performances in comparison with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

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

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

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

Thanks to their ubiquitous coverage, Long-Term Evolution (LTE) networks are considered the most potential enabler for massive Machine-Type Communications (mMTC) service in fifth-generation (5G) context. LTE standard, however, was not designed for mMTC and scenarios where the massive Machine-Type Devices (MTDs) population try to access a network over a short period may overload the Random Access CHannel (RACH). Furthermore, there is no mechanism to prioritize urgent MTDs in such overload situation. The baseline Access Class Barring (B-ACB) scheme is thus adopted by the 3GPP to address both issues at a substantial cost of access delay. This paper follows a different approach and proposes a complete solution to the two main issues of cellular mMTC. We promote the use of a mechanism called Distributed Queueing (DQ), aided by a MAC-layer load estimation technique, to effectively resolve contentions between the MTDs to improve delay performance with minimal impacts to LTE access procedure and air interface. Then, by exploiting information related to congestion level from the DQ process, a dynamic access prioritization scheme can be realized without additional signaling overhead. Computer simulation under an mMTC-oriented traffic model shows that our framework outperforms the B-ACB in terms of both access delay and energy consumption when all devices are of equal importance. On the other hand, when devices of different priorities coexist, our framework with proper tuning also offers lower delay for all classes and lower overall energy consumption compared to both the baseline and a dynamic ACB solutions in massive bursty access scenarios. [ABSTRACT FROM AUTHOR]

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

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

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

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

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

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

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]

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]

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]

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]