Search

Proximal remote sensing is being used across a very wide range of research fields and by scientists, who are often without deep theoretical knowledge optical physics; the author of this article falls squarely in that category! This article highlights two optical phenomena, which may greatly influence the quality and robustness of proximal remote sensing: penetration and scattering. Penetration implies that acquired reflectance signals are associated with both physical and chemical properties of target objects from both the surface and internal tissues/structures. Scattering implies that reflectance signals acquired from one point or object are influenced by scattered radiometric energy from neighboring points or objects. Based on a series of laboratory experiments, penetration and scattering were discussed in the context of “robustness” (repeatability) of hyperspectral reflectance data. High robustness implies that it is possible to control imaging conditions and therefore: 1) obtain very similar radiometric signals from inert objects (objects that do not change) over time, and 2) be able to consistently distinguish objects that are otherwise highly similar in appearance (size, shape, and color) and in terms of biochemical composition. It was demonstrated that robustness of hyperspectral reflectance data (40 spectral bands from 385 to 1024 nm) were significantly influenced by penetration and scattering of radiometric energy. In addition, it was demonstrated that the influence of penetration and scattering varied across the examined spectrum. Characterization of how optical phenomena may affect the robustness of reflectance data is important when using proximal remote sensing technologies as tools used to classify engineering and biological objects. [ABSTRACT FROM AUTHOR]

The dispatching of hydro-thermal system is a nonlinear programming problem with multiple constraints and high dimensions and the solution techniques of the model have been a hotspot in research. Based on the advantage of that the artificial bee colony algorithm (ABC) can efficiently solve the high-dimensional problem, an improved artificial bee colony algorithm has been proposed to solve DHTS problem in this paper. The improvements of the proposed algorithm include two aspects. On one hand, local search can be guided in efficiency by the information of the global optimal solution and its gradient in each generation. The global optimal solution improves the search efficiency of the algorithm but loses diversity, while the gradient can weaken the loss of diversity caused by the global optimal solution. On the other hand, inspired by genetic algorithm, the nectar resource which has not been updated in limit generation is transformed to a new one by using selection, crossover and mutation, which can ensure individual diversity and make full use of prior information for improving the global search ability of the algorithm. The two improvements of ABC algorithm are proved to be effective via a classical numeral example at last. Among which the genetic operator for the promotion of the ABC algorithm’s performance is significant. The results are also compared with those of other state-of-the-art algorithms, the enhanced ABC algorithm has general advantages in minimum cost, average cost and maximum cost which shows its usability and effectiveness. The achievements in this paper provide a new method for solving the DHTS problems, and also offer a novel reference for the improvement of mechanism and the application of algorithms. [ABSTRACT FROM AUTHOR]

Unless the targeted mesh is developable, metric distortion is inevitable during the process of surface mesh parameterization, thus one important objective of all involved parametric studies is to reduce the metric distortion. In order to further reduce area and angle distortion, a novel method of boundary-free mesh parameterization is presented in the paper. Firstly, the initial boundary-fixed conformal parameterization from 3D surface mesh patch to a plane is performed in the method. Then, based on the initial parameterization, the iterations of boundary-free quasi-harmonic parameterization are developed, where the tensor field is updated in each iterative step and the principal curvature direction is utilized to terminate the iteration. The solution of the novel method is convenient to calculate since it involves a series of linear systems. In our novel parameterization method, lower metric distortion and considerable efficiency have been obtained in experiments. [ABSTRACT FROM AUTHOR]

The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user’s Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user’s QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time. [ABSTRACT FROM AUTHOR]

Combinatorial test design is a plan of test that aims to reduce the amount of test cases systematically by choosing a subset of the test cases based on the combination of input variables. The subset covers all possible combinations of a given strength and hence tries to match the effectiveness of the exhaustive set. This mechanism of reduction has been used successfully in software testing research with t-way testing (where t indicates the interaction strength of combinations). Potentially, other systems may exhibit many similarities with this approach. Hence, it could form an emerging application in different areas of research due to its usefulness. To this end, more recently it has been applied in a few research areas successfully. In this paper, we explore the applicability of combinatorial test design technique for Fractional Order (FO), Proportional-Integral-Derivative (PID) parameter design controller, named as FOPID, for an automatic voltage regulator (AVR) system. Throughout the paper, we justify this new application theoretically and practically through simulations. In addition, we report on first experiments indicating its practical use in this field. We design different algorithms and adapted other strategies to cover all the combinations with an optimum and effective test set. Our findings indicate that combinatorial test design can find the combinations that lead to optimum design. Besides this, we also found that by increasing the strength of combination, we can approach to the optimum design in a way that with only 4-way combinatorial set, we can get the effectiveness of an exhaustive test set. This significantly reduced the number of tests needed and thus leads to an approach that optimizes design of parameters quickly. [ABSTRACT FROM AUTHOR]

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. [ABSTRACT FROM AUTHOR]

This paper presents the Hybrid Scalable-Minimized-Butterfly-Fat-Tree (H-SMBFT) topology for on-chip communication. Main aspects of this work are the description of the architectural design and the characteristics as well as a comparative analysis against two established indirect topologies namely Butterfly-Fat-Tree (BFT) and Scalable-Minimized-Butterfly-Fat-Tree (SMBFT). Simulation results demonstrate that the proposed topology outperforms its predecessors in terms of performance, area and power dissipation. Specifically, it improves the link interconnectivity between routing levels, such that the number of required links isreduced. This results into reduced router complexity and shortened routing paths between any pair of communicating nodes in the network. Moreover, simulation results under synthetic as well as real-world embedded applications workloads reveal that H-SMBFT can reduce the average latency by up-to35.63% and 17.36% compared to BFT and SMBFT, respectively. In addition, the power dissipation of the network can be reduced by up-to33.82% and 19.45%, while energy consumption can be improved byup-to32.91% and 16.83% compared to BFT and SMBFT, respectively. [ABSTRACT FROM AUTHOR]

Targeted environmental and ecosystem management remain crucial in control of dengue. However, providing detailed environmental information on a large scale to effectively target dengue control efforts remains a challenge. An important piece of such information is the extent of the presence of potential dengue vector breeding sites, which consist primarily of open containers such as ceramic jars, buckets, old tires, and flowerpots. In this paper we present the design and implementation of a pipeline to detect outdoor open containers which constitute potential dengue vector breeding sites from geotagged images and to create highly detailed container density maps at unprecedented scale. We implement the approach using Google Street View images which have the advantage of broad coverage and of often being two to three years old which allows correlation analyses of container counts against historical data from manual surveys. Containers comprising eight of the most common breeding sites are detected in the images using convolutional neural network transfer learning. Over a test set of images the object recognition algorithm has an accuracy of 0.91 in terms of F-score. Container density counts are generated and displayed on a decision support dashboard. Analyses of the approach are carried out over three provinces in Thailand. The container counts obtained agree well with container counts from available manual surveys. Multi-variate linear regression relating densities of the eight container types to larval survey data shows good prediction of larval index values with an R-squared of 0.674. To delineate conditions under which the container density counts are indicative of larval counts, a number of factors affecting correlation with larval survey data are analyzed. We conclude that creation of container density maps from geotagged images is a promising approach to providing detailed risk maps at large scale. [ABSTRACT FROM AUTHOR]

Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at . [ABSTRACT FROM AUTHOR]

Due to recent advances in genetic manipulation, transgenic mosquitoes may be a viable alternative to reduce some diseases. Feasibility conditions are obtained by simulating and analyzing mathematical models that describe the behavior of wild and transgenic populations living in the same geographic area. In this paper, we present a reaction–diffusion model in which the reaction term is a nonlinear function that describes the interaction between wild and transgenic mosquitoes, considering the zygosity, and the diffusive term that represents a nonuniform spatial spreading characterized by a random diffusion parameter. The resulting nonlinear system of partial differential equations is numerically solved using the sequential operator splitting technique, combining the finite element method and Runge-Kutta method. This scheme is numerically implemented considering uncertainty in the diffusion parameters of the model. Several scenarios simulating spatial release strategies of transgenic mosquitoes are analyzed, demonstrating an intrinsic association between the transgene frequency in the total population and the strategy adopted. [ABSTRACT FROM AUTHOR]

In this paper, we present and analyze an SEIR Zika epidemic model. Firstly, we investigate the model with constant controls. The steady states of the model is found to be locally and globally asymptotically stable. Thereafter, we incorporate time dependent controls into the model in order to investigate the optimal effects of bednets, treatments of infective and spray of insecticides on the disease spread. Furthermore, we used Pontryagin’s Maximum Principle to determine the necessary conditions for effective control of the disease. Also, the numerical results were presented. [ABSTRACT FROM AUTHOR]

Haptics applications such as surgery simulations require collision detections that are more precise than others. An efficient collision detection method based on the clustering of bounding spheres was proposed in our prior study. This paper analyzes and compares the applied effects of the five most common subdivision surface methods on some 3D models for haptic collision detection. The five methods are Butterfly, Catmull-Clark, Mid-point, Loop, and LS3 (Least Squares Subdivision Surface). After performing a number of experiments, we have concluded that LS3 method is the most appropriate for haptic simulations. The more we applied surface subdivision, the more the collision detection results became precise. However, it is observed that the performance becomes better until a certain threshold and degrades afterward. In order to reduce the performance degradation, we adopted our prior work, which was the fast and precise collision detection method based on adaptive clustering. As a result, we obtained a notable improvement of the speed of collision detection. [ABSTRACT FROM AUTHOR]

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies. [ABSTRACT FROM AUTHOR]

As a sustainable transportation mode, high-speed railway (HSR) has become an efficient way to meet the huge travel demand. However, due to the high acquisition and maintenance cost, it is impossible to build enough infrastructure and purchase enough train-sets. Great efforts are required to improve the transport capability of HSR. The utilization efficiency of train-sets (carrying tools of HSR) is one of the most important factors of the transport capacity of HSR. In order to enhance the utilization efficiency of the train-sets, this paper proposed a train-set circulation optimization model to minimize the total connection time. An innovative two-stage approach which contains segments generation and segments combination was designed to solve this model. In order to verify the feasibility of the proposed approach, an experiment was carried out in the Beijing-Tianjin passenger dedicated line, to fulfill a 174 trips train diagram. The model results showed that compared with the traditional Ant Colony Algorithm (ACA), the utilization efficiency of train-sets can be increased from 43.4% (ACA) to 46.9% (Two-Stage), and 1 train-set can be saved up to fulfill the same transportation tasks. The approach proposed in the study is faster and more stable than the traditional ones, by using which, the HSR staff can draw up the train-sets circulation plan more quickly and the utilization efficiency of the HSR system is also improved. [ABSTRACT FROM AUTHOR]

In this paper, an attempt is made to apply the African Buffalo Optimization (ABO) to tune the parameters of a PID controller for an effective Automatic Voltage Regulator (AVR). Existing metaheuristic tuning methods have been proven to be quite successful but there were observable areas that need improvements especially in terms of the system’s gain overshoot and steady steady state errors. Using the ABO algorithm where each buffalo location in the herd is a candidate solution to the Proportional-Integral-Derivative parameters was very helpful in addressing these two areas of concern. The encouraging results obtained from the simulation of the PID Controller parameters-tuning using the ABO when compared with the performance of Genetic Algorithm PID (GA-PID), Particle-Swarm Optimization PID (PSO-PID), Ant Colony Optimization PID (ACO-PID), PID, Bacteria-Foraging Optimization PID (BFO-PID) etc makes ABO-PID a good addition to solving PID Controller tuning problems using metaheuristics. [ABSTRACT FROM AUTHOR]

Self-organized mechanisms are frequently encountered in nature and known to achieve flexible, adaptive control and decision-making. Noise plays a crucial role in such systems: It can enable a self-organized system to reliably adapt to short-term changes in the environment while maintaining a generally stable behavior. This is fundamental in biological systems because they must strike a delicate balance between stable and flexible behavior. In the present paper we analyse the role of noise in the decision-making of the true slime mold Physarum polycephalum, an important model species for the investigation of computational abilities in simple organisms. We propose a simple biological experiment to investigate the reaction of P. polycephalum to time-variant risk factors and present a stochastic extension of an established mathematical model for P. polycephalum to analyze this experiment. It predicts that—due to the mechanism of stochastic resonance—noise can enable P. polycephalum to correctly assess time-variant risk factors, while the corresponding noise-free system fails to do so. Beyond the study of P. polycephalum we demonstrate that the influence of noise on self-organized decision-making is not tied to a specific organism. Rather it is a general property of the underlying process dynamics, which appears to be universal across a wide range of systems. Our study thus provides further evidence that stochastic resonance is a fundamental component of the decision-making in self-organized macroscopic and microscopic groups and organisms. [ABSTRACT FROM AUTHOR]

Background: This paper presents a new agent-based model (ABM) for investigating T. b. rhodesiense human African trypanosomiasis (rHAT) disease dynamics, produced to aid a greater understanding of disease transmission, and essential for development of appropriate mitigation strategies. Methods: The ABM was developed to model rHAT incidence at a fine spatial scale along a 75 km transect in the Luangwa Valley, Zambia. The method offers a complementary approach to traditional compartmentalised modelling techniques, permitting incorporation of fine scale demographic data such as ethnicity, age and gender into the simulation. Results: Through identification of possible spatial, demographic and behavioural characteristics which may have differing implications for rHAT risk in the region, the ABM produced output that could not be readily generated by other techniques. On average there were 1.99 (S.E. 0.245) human infections and 1.83 (S.E. 0.183) cattle infections per 6 month period. The model output identified that the approximate incidence rate (per 1000 person-years) was lower amongst cattle owning households (0.079, S.E. 0.017), than those without cattle (0.134, S.E. 0.017). Immigrant tribes (e.g. Bemba I.R. = 0.353, S.E.0.155) and school-age children (e.g. 5–10 year old I.R. = 0.239, S.E. 0.041) were the most at-risk for acquiring infection. These findings have the potential to aid the targeting of future mitigation strategies. Conclusion: ABMs provide an alternative way of thinking about HAT and NTDs more generally, offering a solution to the investigation of local-scale questions, and which generate results that can be easily disseminated to those affected. The ABM can be used as a tool for scenario testing at an appropriate spatial scale to allow the design of logistically feasible mitigation strategies suggested by model output. This is of particular importance where resources are limited and management strategies are often pushed to the local scale. [ABSTRACT FROM AUTHOR]

Maximisation of influence propagation is a key ingredient to any viral marketing or socio-political campaigns. However, it is an NP-hard problem, and various approximate algorithms have been suggested to address the issue, though not largely successful. In this paper, we propose a bio-inspired approach to select the initial set of nodes which is significant in rapid convergence towards a sub-optimal solution in minimal runtime. The performance of the algorithm is evaluated using the re-tweet network of the hashtag #KissofLove on Twitter associated with the non-violent protest against the moral policing spread to many parts of India. Comparison with existing centrality based node ranking process the proposed method significant improvement on influence propagation. The proposed algorithm is one of the hardly few bio-inspired algorithms in network theory. We also report the results of the exploratory analysis of the network kiss of love campaign. [ABSTRACT FROM AUTHOR]

Railway and metro transport systems (RS) are becoming one of the popular choices of transportation among people, especially those who live in urban cities. Urbanization and increasing population due to rapid development of economy in many cities are leading to a bigger demand for urban rail transit. Despite being a popular variant of Traveling Salesman Problem (TSP), it appears that the universal formula or techniques to solve the problem are yet to be found. This paper aims to develop an optimization algorithm for optimum route selection to multiple destinations in RS before returning to the starting point. Bee foraging behaviour is examined to generate a reliable algorithm in railway TSP. The algorithm is then verified by comparing the results with the exact solutions in 10 test cases, and a numerical case study is designed to demonstrate the application with large size sample. It is tested to be efficient and effective in railway route planning as the tour can be completed within a certain period of time by using minimal resources. The findings further support the reliability of the algorithm and capability to solve the problems with different complexity. This algorithm can be used as a method to assist business practitioners making better decision in route planning. [ABSTRACT FROM AUTHOR]

With cutting-edge live microscopy and image analysis, biologists can now systematically track individual cells in complex tissues and quantify cellular behavior over extended time windows. Computational approaches that utilize the systematic and quantitative data are needed to understand how cells interact in vivo to give rise to the different cell types and 3D morphology of tissues. An agent-based, minimum descriptive modeling and analysis framework is presented in this paper to study C. elegans embryogenesis. The framework is designed to incorporate the large amounts of experimental observations on cellular behavior and reserve data structures/interfaces that allow regulatory mechanisms to be added as more insights are gained. Observed cellular behaviors are organized into lineage identity, timing and direction of cell division, and path of cell movement. The framework also includes global parameters such as the eggshell and a clock. Division and movement behaviors are driven by statistical models of the observations. Data structures/interfaces are reserved for gene list, cell-cell interaction, cell fate and landscape, and other global parameters until the descriptive model is replaced by a regulatory mechanism. This approach provides a framework to handle the ongoing experiments of single-cell analysis of complex tissues where mechanistic insights lag data collection and need to be validated on complex observations. [ABSTRACT FROM AUTHOR]

Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70–90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks. [ABSTRACT FROM AUTHOR]

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques. [ABSTRACT FROM AUTHOR]

A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a lustering algorithm based on nt olony ptimization (ACO) for VAs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO. [ABSTRACT FROM AUTHOR]

Background: Piwi-interacting RNA (piRNA) is the largest class of small non-coding RNA molecules. The transposon-derived piRNA prediction can enrich the research contents of small ncRNAs as well as help to further understand generation mechanism of gamete. Methods: In this paper, we attempt to differentiate transposon-derived piRNAs from non-piRNAs based on their sequential and physicochemical features by using machine learning methods. We explore six sequence-derived features, i.e. spectrum profile, mismatch profile, subsequence profile, position-specific scoring matrix, pseudo dinucleotide composition and local structure-sequence triplet elements, and systematically evaluate their performances for transposon-derived piRNA prediction. Finally, we consider two approaches: direct combination and ensemble learning to integrate useful features and achieve high-accuracy prediction models. Results: We construct three datasets, covering three species: Human, Mouse and Drosophila, and evaluate the performances of prediction models by 10-fold cross validation. In the computational experiments, direct combination models achieve AUC of 0.917, 0.922 and 0.992 on Human, Mouse and Drosophila, respectively; ensemble learning models achieve AUC of 0.922, 0.926 and 0.994 on the three datasets. Conclusions: Compared with other state-of-the-art methods, our methods can lead to better performances. In conclusion, the proposed methods are promising for the transposon-derived piRNA prediction. The source codes and datasets are available in . [ABSTRACT FROM AUTHOR]

Insects determine their body segments in two different ways. Short-germband insects, such as the flour beetle Tribolium castaneum, use a molecular clock to establish segments sequentially. In contrast, long-germband insects, such as the vinegar fly Drosophila melanogaster, determine all segments simultaneously through a hierarchical cascade of gene regulation. Gap genes constitute the first layer of the Drosophila segmentation gene hierarchy, downstream of maternal gradients such as that of Caudal (Cad). We use data-driven mathematical modelling and phase space analysis to show that shifting gap domains in the posterior half of the Drosophila embryo are an emergent property of a robust damped oscillator mechanism, suggesting that the regulatory dynamics underlying long- and short-germband segmentation are much more similar than previously thought. In Tribolium, Cad has been proposed to modulate the frequency of the segmentation oscillator. Surprisingly, our simulations and experiments show that the shift rate of posterior gap domains is independent of maternal Cad levels in Drosophila. Our results suggest a novel evolutionary scenario for the short- to long-germband transition and help explain why this transition occurred convergently multiple times during the radiation of the holometabolan insects. [ABSTRACT FROM AUTHOR]

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing. [ABSTRACT FROM AUTHOR]

Appropriate large-scale citizen-science data present important new opportunities for biodiversity modelling, due in part to the wide spatial coverage of information. Recently proposed occupancy modelling approaches naturally incorporate random effects in order to account for annual variation in the composition of sites surveyed. In turn this leads to Bayesian analysis and model fitting, which are typically extremely time consuming. Motivated by presence-only records of occurrence from the UK Butterflies for the New Millennium data base, we present an alternative approach, in which site variation is described in a standard way through logistic regression on relevant environmental covariates. This allows efficient occupancy model-fitting using classical inference, which is easily achieved using standard computers. This is especially important when models need to be fitted each year, typically for many different species, as with British butterflies for example. Using both real and simulated data we demonstrate that the two approaches, with and without random effects, can result in similar conclusions regarding trends. There are many advantages to classical model-fitting, including the ability to compare a range of alternative models, identify appropriate covariates and assess model fit, using standard tools of maximum likelihood. In addition, modelling in terms of covariates provides opportunities for understanding the ecological processes that are in operation. We show that there is even greater potential; the classical approach allows us to construct regional indices simply, which indicate how changes in occupancy typically vary over a species’ range. In addition we are also able to construct dynamic occupancy maps, which provide a novel, modern tool for examining temporal changes in species distribution. These new developments may be applied to a wide range of taxa, and are valuable at a time of climate change. They also have the potential to motivate citizen scientists. [ABSTRACT FROM AUTHOR]

Collective behaviour is of fundamental importance in the life sciences, where it appears at levels of biological complexity from single cells to superorganisms, in demography and the social sciences, where it describes the behaviour of populations, and in the physical and engineering sciences, where it describes physical phenomena and can be used to design distributed systems. Reasoning about collective behaviour is inherently difficult, as the non-linear interactions between individuals give rise to complex emergent dynamics. Mathematical techniques have been developed to analyse systematically collective behaviour in such systems, yet these frequently require extensive formal training and technical ability to apply. Even for those with the requisite training and ability, analysis using these techniques can be laborious, time-consuming and error-prone. Together these difficulties raise a barrier-to-entry for practitioners wishing to analyse models of collective behaviour. However, rigorous modelling of collective behaviour is required to make progress in understanding and applying it. Here we present an accessible tool which aims to automate the process of modelling and analysing collective behaviour, as far as possible. We focus our attention on the general class of systems described by reaction kinetics, involving interactions between components that change state as a result, as these are easily understood and extracted from data by natural, physical and social scientists, and correspond to algorithms for component-level controllers in engineering applications. By providing simple automated access to advanced mathematical techniques from statistical physics, nonlinear dynamical systems analysis, and computational simulation, we hope to advance standards in modelling collective behaviour. At the same time, by providing expert users with access to the results of automated analyses, sophisticated investigations that could take significant effort are substantially facilitated. Our tool can be accessed online without installing software, uses a simple programmatic interface, and provides interactive graphical plots for users to develop understanding of their models. [ABSTRACT FROM AUTHOR]

Comprehensive information on the timing and location of gene expression is fundamental to our understanding of embryonic development and tissue formation. While high-throughput in situ hybridization projects provide invaluable information about developmental gene expression patterns for model organisms like Drosophila, the output of these experiments is primarily qualitative, and a high proportion of protein coding genes and most non-coding genes lack any annotation. Accurate data-centric predictions of spatio-temporal gene expression will therefore complement current in situ hybridization efforts. Here, we applied a machine learning approach by training models on all public gene expression and chromatin data, even from whole-organism experiments, to provide genome-wide, quantitative spatio-temporal predictions for all genes. We developed structured in silico nano-dissection, a computational approach that predicts gene expression in >200 tissue-developmental stages. The algorithm integrates expression signals from a compendium of 6,378 genome-wide expression and chromatin profiling experiments in a cell lineage-aware fashion. We systematically evaluated our performance via cross-validation and experimentally confirmed 22 new predictions for four different embryonic tissues. The model also predicts complex, multi-tissue expression and developmental regulation with high accuracy. We further show the potential of applying these genome-wide predictions to extract tissue specificity signals from non-tissue-dissected experiments, and to prioritize tissues and stages for disease modeling. This resource, together with the exploratory tools are freely available at our webserver , which provides a valuable tool for a range of applications, from predicting spatio-temporal expression patterns to recognizing tissue signatures from differential gene expression profiles. [ABSTRACT FROM AUTHOR]

For the evaluation of infectious-diseases interventions, the transmissible nature of such diseases plays a central role. Agent-based models (ABM) allow for dynamic transmission modeling but publications are limited. We aim to provide an overview of important characteristics of ABM for decision-analytic modeling of infectious diseases. A case study of dengue epidemics illustrates model characteristics, conceptualization, calibration and model analysis. First, major characteristics of ABM are outlined and discussed based on ISPOR and ISPOR-SMDM Good Practice guidelines. Second, in our case study, we modeled a dengue outbreak in Cebu City (Philippines) to assess the impact interventions to control the relative growth of the mosquito population. Model outcomes include prevalence and incidence of infected persons. The modular ABM simulates persons and mosquitoes over an annual time horizon considering daily time steps. The model was calibrated and validated. ABM is a dynamic, individual-level modeling approach that is capable to reproduce direct and indirect effects of interventions for infectious diseases. The ability to replicate emerging behavior and to include human behavior or the behavior of other agents is a distinguishing modeling characteristic (e.g., compared to Markov models). Modeling behavior may, however, require extensive calibration and validation. The analyzed hypothetical effectiveness of dengue interventions showed that a reduced human-mosquito ratio of 1:2.5 during rainy seasons leads already to a substantial decrease of infected persons. ABM can support decision-analyses for infectious diseases including disease dynamics, emerging behavior, and providing a high level of reusability due to modularity. [ABSTRACT FROM AUTHOR]

Background: Vector control remains the primary method to prevent dengue infections. Environmental interventions represent sustainable and safe methods as there are limited risks of environmental contamination and toxicity. The objective of this study is to perform a systematic review and meta-analysis of the effectiveness of the following environmental methods for dengue vector control. Methodology/Principal findings: Following the PRISMA guidelines, a systematic literature search was conducted using the databases PubMed, EMBASE, LILACS, the Cochrane Library and Google Scholar. Quality assessment was done using the CONSORT 2010 checklist. For the meta-analysis the difference-in-differences (DID) and the difference-of-endlines (DOE) were calculated according to the Schmidt-Hunter method for the Breteau index (BI) and the pupae per person index (PPI). Nineteen studies were eligible for the systematic review, sixteen contributed data to the meta-analysis. The following methods were evaluated: (a) container covers with and without insecticides, (b) waste management and clean-up campaigns, and (c) elimination of breeding sites by rendering potential mosquito breeding sites unusable or by eliminating them. Study quality was highest for container covers with insecticides, followed by waste management without direct garbage collection and elimination of breeding places. Both, systematic review and meta-analysis, showed a weak effect of the interventions on larval populations, with no obvious differences between the results of each individual method. For the meta-analysis, both, container covers without insecticides (BI: DID -7.9, DOE -5) and waste management with direct garbage collection (BI: DID -8.83, DOE -6.2) achieved the strongest reductions for the BI, whereas for the PPI results were almost opposite, with container covers with insecticides (PPI: DID -0.83, DOE 0.09) and elimination of breeding places (PPI: DID -0.95, DOE -0.83) showing the strongest effects. Conclusions: Each of the investigated environmental methods showed some effectiveness in reducing larval and pupal densities of Aedes sp. mosquitoes. However, there is a need for more comparable high-quality studies at an adequate standard to strengthen this evidence. [ABSTRACT FROM AUTHOR]

It is crucial for large-scale communication networks such as the internet to be resilient against attacks such as censorship and surveillance, which pose a threat to free expression and free association. Self-organized networks such as the internet’s router network typically have heavy-tailed degree distributions, making them highly vulnerable to targeted attacks against central nodes. While cryptographic solutions exist, they fail to address the underlying topological problem, and remain vulnerable to man-in-the-middle attacks and coercion. Coercion-resistant, topological approaches to attack tolerance are needed to address the current vulnerability of communications infrastructure to censorship and surveillance. We present a novel concurrent multipath routing (CMR) algorithm for the wraparound butterfly network topology, as well as a highly attack-tolerant Structured Multipath Fault Tolerance (SMFT) architecture which incorporates the butterfly CMR algorithm. We also identify a previously unexplored relationship between network topology, trust transitivity, and attack-tolerance, and provide a framework for further exploration of this relationship. Our work is the first theoretical demonstration of a point-to-point communication network architecture that can resist coercion and other non-technical attacks, without requiring infinitely transitive trust. To address cases where the network structure cannot be fully controlled, we demonstrate how a snapshot of the internet’s router network can be partially rewired for greater attack-tolerance. More broadly, we hope that this work will serve as a starting point for the evelopment of additional topology-based attack-tolerant communication architectures to guard against the dangers of censorship and surveillance. [ABSTRACT FROM AUTHOR]

West Nile virus (WNV)—a mosquito-borne arbovirus—entered the USA through New York City in 1999 and spread to the contiguous USA within three years while transitioning from epidemic outbreaks to endemic transmission. The virus is transmitted by vector competent mosquitoes and maintained in the avian populations. WNV spatial distribution is mainly determined by the movement of residential and migratory avian populations. We developed an individual-level heterogeneous network framework across the USA with the goal of understanding the long-range spatial distribution of WNV. To this end, we proposed three distance dispersal kernels model: 1) exponential—short-range dispersal, 2) power-law—long-range dispersal in all directions, and 3) power-law biased by flyway direction —long-range dispersal only along established migratory routes. To select the appropriate dispersal kernel we used the human case data and adopted a model selection framework based on approximate Bayesian computation with sequential Monte Carlo sampling (ABC-SMC). From estimated parameters, we find that the power-law biased by flyway direction kernel is the best kernel to fit WNV human case data, supporting the hypothesis of long-range WNV transmission is mainly along the migratory bird flyways. Through extensive simulation from 2014 to 2016, we proposed and tested hypothetical mitigation strategies and found that mosquito population reduction in the infected states and neighboring states is potentially cost-effective. [ABSTRACT FROM AUTHOR]

New approaches to lineage tracking have allowed the study of differentiation in multicellular organisms over many generations of cells. Understanding the phenotypic variability observed in these lineage trees requires new statistical methods. Whereas an invariant cell lineage, such as that for the nematode Caenorhabditis elegans, can be described by a lineage map, defined as the pattern of phenotypes overlaid onto the binary tree, a traditional lineage map is static and does not describe the variability inherent in the cell lineages of higher organisms. Here, we introduce lineage variability maps which describe the pattern of second-order variation in lineage trees. These maps can be undirected graphs of the partial correlations between every lineal position, or directed graphs showing the dynamics of bifurcated patterns in each subtree. We show how to infer these graphical models for lineages of any depth from sample sizes of only a few pedigrees. This required developing the generalized spectral analysis for a binary tree, the natural framework for describing tree-structured variation. When tested on pedigrees from C. elegans expressing a marker for pharyngeal differentiation potential, the variability maps recover essential features of the known lineage map. When applied to highly-variable pedigrees monitoring cell size in T lymphocytes, the maps show that most of the phenotype is set by the founder naive T cell. Lineage variability maps thus elevate the concept of the lineage map to the population level, addressing questions about the potency and dynamics of cell lineages and providing a way to quantify the progressive restriction of cell fate with increasing depth in the tree. [ABSTRACT FROM AUTHOR]

Background: High-throughput sequencing technology has revolutionized both medical and biological research by generating exceedingly large numbers of genetic variants. The resulting datasets share a number of common characteristics that might lead to poor generalization capacity. Concerns include noise accumulated due to the large number of predictors, sparse information regarding the p≫n problem, and overfitting and model mis-identification resulting from spurious collinearity. Additionally, complex correlation patterns are present among variables. As a consequence, reliable variable selection techniques play a pivotal role in predictive analysis, generalization capability, and robustness in clustering, as well as interpretability of the derived models. Methods and findings: K-dominating set, a parameterized graph-theoretic generalization model, was used to model SNP (single nucleotide polymorphism) data as a similarity network and searched for representative SNP variables. In particular, each SNP was represented as a vertex in the graph, (dis)similarity measures such as correlation coefficients or pairwise linkage disequilibrium were estimated to describe the relationship between each pair of SNPs; a pair of vertices are adjacent, i.e. joined by an edge, if the pairwise similarity measure exceeds a user-specified threshold. A minimum k-dominating set in the SNP graph was then made as the smallest subset such that every SNP that is excluded from the subset has at least k neighbors in the selected ones. The strength of k-dominating set selection in identifying independent variables, and in culling representative variables that are highly correlated with others, was demonstrated by a simulated dataset. The advantages of k-dominating set variable selection were also illustrated in two applications: pedigree reconstruction using SNP profiles of 1,372 Douglas-fir trees, and species delineation for 226 grasshopper mouse samples. A C++ source code that implements SNP-SELECT and uses Gurobi optimization solver for the k-dominating set variable selection is available (). [ABSTRACT FROM AUTHOR]

An imperative curve modeling technique has been established with a view to its applications in various disciplines of science, engineering and design. It is a new spline method using piecewise quadratic trigonometric functions. It possesses error bounds of order 3. The proposed curve model also owns the most favorable geometric properties. The proposed spline method accomplishes C2 smoothness and produces a Quadratic Trigonometric Spline (QTS) with the view to its applications in curve design and control. It produces a C2 quadratic trigonometric alternative to the traditional cubic polynomial spline (CPS) because of having four control points in its piecewise description. The comparison analysis of QTS and CPS verifies the QTS as better alternate to CPS. Also, the time analysis proves QTS computationally efficient than CPS. [ABSTRACT FROM AUTHOR]

We present a technique applicable in any dynamical framework to identify control-robust subsets of an interacting system. These robust subsystems, which we call stable modules, are characterized by constraints on the variables that make up the subsystem. They are robust in the sense that if the defining constraints are satisfied at a given time, they remain satisfied for all later times, regardless of what happens in the rest of the system, and can only be broken if the constrained variables are externally manipulated. We identify stable modules as graph structures in an expanded network, which represents causal links between variable constraints. A stable module represents a system “decision point”, or trap subspace. Using the expanded network, small stable modules can be composed sequentially to form larger stable modules that describe dynamics on the system level. Collections of large, mutually exclusive stable modules describe the system’s repertoire of long-term behaviors. We implement this technique in a broad class of dynamical systems and illustrate its practical utility via examples and algorithmic analysis of two published biological network models. In the segment polarity gene network of Drosophila melanogaster, we obtain a state-space visualization that reproduces by novel means the four possible cell fates and predicts the outcome of cell transplant experiments. In the T-cell signaling network, we identify six signaling elements that determine the high-signal response and show that control of an element connected to them cannot disrupt this response. [ABSTRACT FROM AUTHOR]

Barnacle naupliar larvae are differentiated from other zooplankton by their unique pair of frontal lateral horns, frontal filaments, and a pear-shaped cephalic shield. Their morphology impose constraints on their ecological functions and reflect their evolutionary history. To explore the potential functional basis underlying the similarities and differences in barnacle larval form, we conducted a meta-analysis on the shape of the barnacle nauplii’s cephalic shield and examined its relation to larval size, trophic mode, pelagic larval duration and habitat. Nauplii cephalic shield morphology of 102 species were quantified with normalized elliptic Fourier analysis. Most of the species were distributed around the center of the morphospace but a few extreme groups occupied the periphery: nauplii that were large and lecithotrophic. Subsequent principal component regression analyses showed that larval size was a good predictor of the first shape variations axis (aspect ratio). After allometry adjustment, nauplii from different trophic modes differentiated along the second axis of the major shape variations (relative frontal horn length). Habitat was a poor predictor of variations in naupliar body form, but it could be used to differentiate extreme morphology groups from other nauplii. Our result suggests that size-related biomechanical or developmental constraints and feeding requirements are important in shaping the evolution of the naupliar body form. Within the limitations of these functional constraints, habitat drives the divergence of extreme morphology groups from the majority of species. Our comparative morphometrics analysis demonstrated how variations in larval body form can be quantitatively linked to the functional needs that constrain or drive their diversity, and inform further empirical experiments on larval functional morphology. [ABSTRACT FROM AUTHOR]

Isolation profoundly influences social behavior in all animals. In humans, isolation has serious effects on health and disease. Drosophila melanogaster is a powerful model to study small-scale, temporally-transient social behavior. However, longer-term analysis of large groups of flies is hampered by the lack of effective and reliable tools. We built a new imaging arena and improved the existing tracking algorithm to reliably follow a large number of flies simultaneously. Next, based on the automatic classification of touch and graph-based social network analysis, we designed an algorithm to quantify changes in the social network in response to prior social isolation. We observed that isolation significantly and swiftly enhanced individual and local social network parameters depicting near-neighbor relationships. We explored the genome-wide molecular correlates of these behavioral changes and found that whereas behavior changed throughout the six days of isolation, gene expression alterations occurred largely on day one. These changes occurred mostly in metabolic genes, and we verified the metabolic changes by showing an increase of lipid content in isolated flies. In summary, we describe a highly reliable tracking and analysis pipeline for large groups of flies that we use to unravel the behavioral, molecular and physiological impact of isolation on social network dynamics in Drosophila. [ABSTRACT FROM AUTHOR]

The present work is a reanalysis of prior work documenting postural sway in phasmids (i.e., “stick insects”) []. The prior work pursued the possibility that postural sway was an evolutionary adaptation supporting motion camouflage to avoid the attention of predators. For instance, swaying along with leaves blown by the wind might reduce the likelihood of standing out to a predator. The present work addresses the alternative—but by no means conflicting and perhaps more explanatory—proposal that phasmid postural sway carries evidence of the tensegrity-like structures allowing postural stabilization under wind-like stimulation. Tensegrity structures are prestressed architectures embodying nonlinear interactions across scales of space and time that provide context-sensitive responses faster than neural tissue can support. Multifractal modeling of the postural-displacement series initially recorded in [] offers a metric equally effective for quantifying complexity of phasmid postural sway under wind stimulation as for quantifying complexity of human postural sway [–]. Furthermore, multifractal modeling offers a means to demonstrate empirically the nonlinear interactions across space and time scales in body-wide coordination that tensegrity-based hypotheses predict. Specifically, multifractal modeling allows diagnosing the strength and direction of nonlinear interactions across time scale as the difference between multifractal estimates for the original postural-displacement series and for a sample of best-fitting linear models of the series. The reduction of postural sway directly following the application of wind stimulus appears as a significant decrease in the multifractal structure for original postural-displacement series as compared to best-fitting linear models of those series. This decrease indicates the capacity for nonlinear interactions across time scale to constrict variability, which is an aspect of nonlinear dynamics often overshadowed by the possibility that nonlinearity can produce more variability. This work offers the longer-range opportunity that multifractal modeling could provide a common language within which to coordinate behavioral sciences across a wide range of species. [ABSTRACT FROM AUTHOR]

Chemical cues are arguably the most fundamental means of animal communication and play an important role in mate choice and kin recognition. Consequently, there is growing interest in the use of gas chromatography (GC) to investigate the chemical basis of eco-evolutionary interactions. Both GC-MS (mass spectrometry) and FID (flame ionization detection) are commonly used to characterise the chemical composition of biological samples such as skin swabs. The resulting chromatograms comprise peaks that are separated according to their retention times and which represent different substances. Across chromatograms of different samples, homologous substances are expected to elute at similar retention times. However, random and often unavoidable experimental variation introduces noise, making the alignment of homologous peaks challenging, particularly with GC-FID data where mass spectral data are lacking. Here we present , a user-friendly R package for aligning GC-FID data based on retention times. The package was developed specifically for ecological and evolutionary studies that seek to investigate similarity patterns across multiple and often highly variable biological samples, for example representing different sexes, age classes or reproductive stages. The package also implements dynamic visualisations to facilitate inspection and fine-tuning of the resulting alignments and can be integrated within a broader workflow in R to facilitate downstream multivariate analyses. We demonstrate an example workflow using empirical data from Antarctic fur seals and explore the impact of user-defined parameter values by calculating alignment error rates for multiple datasets. The resulting alignments had low error rates for most of the explored parameter space and we could also show that performed equally well or better than other available software. We hope that will help to simplify the processing of chemical datasets and improve the standardization and reproducibility of chemical analyses in studies of animal chemical communication and related fields. [ABSTRACT FROM AUTHOR]

Introduction: Schistosomiasis is a chronic parasitic trematode disease that affects over 240 million people worldwide. The Schistosoma lifecycle is complex, involving transmission via specific intermediate-host freshwater snails. Predictive mathematical models of Schistosoma transmission have often chosen to simplify or ignore the details of environmental human-snail interaction in their analyses. Schistosome transmission models now aim to provide better precision for policy planning of elimination of transmission. This heightens the importance of including the environmental complexity of vector-pathogen interaction in order to make more accurate projections. Methodology and principal findings: We propose a nonlinear snail force of infection (FOI) that takes into account an intermediate larval stage (miracidium) and snail biology. We focused, in particular, on the effects of snail force of infection (FOI) on the impact of mass drug administration (MDA) in human communities. The proposed (modified) model was compared to a conventional model in terms of their predictions. A longitudinal dataset generated in Kenya field studies was used for model calibration and validation. For each sample community, we calibrated modified and conventional model systems, then used them to model outcomes for a range of MDA regimens. In most cases, the modified model predicted more vigorous post-MDA rebound, with faster relapse to baseline levels of infection. The effect was pronounced in higher risk communities. When compared to observed data, only the modified system was able to successfully predict persistent rebound of Schistosoma infection. Conclusion and significance: The observed impact of varying location-specific snail inputs sheds light on the diverse MDA response patterns noted in operational research on schistosomiasis control, such as the recent SCORE project. Efficiency of human-to-snail transmission is likely to be much higher than predicted by standard models, which, in practice, will make local elimination by implementation of MDA alone highly unlikely, even over a multi-decade period. [ABSTRACT FROM AUTHOR]

Scanning flow cytometry (SFCM) is characterized by the measurement of time-resolved pulses of fluorescence and scattering, enabling the high-throughput quantification of phytoplankton morphology and pigmentation. Quantifying variation at the single cell and colony level improves our ability to understand dynamics in natural communities. Automated high-frequency monitoring of these communities is presently limited by the absence of repeatable, rapid protocols to analyse SFCM datasets, where images of individual particles are not available. Here we demonstrate a repeatable, semi-automated method to (1) rapidly clean SFCM data from a phytoplankton community by removing signals that do not belong to live phytoplankton cells, (2) classify individual cells into trait clusters that correspond to functional groups, and (3) quantify the biovolumes of individual cells, the total biovolume of the whole community and the total biovolumes of the major functional groups. Our method involves the development of training datasets using lab cultures, the use of an unsupervised clustering algorithm to identify trait clusters, and machine learning tools (random forests) to (1) evaluate variable importance, (2) classify data points, and (3) estimate biovolumes of individual cells. We provide example datasets and R code for our analytical approach that can be adapted for analysis of datasets from other flow cytometers or scanning flow cytometers. [ABSTRACT FROM AUTHOR]

Fish, birds, insects and robots frequently swim or fly in groups. During their three dimensional collective motion, these agents do not stop, they avoid collisions by strong short-range repulsion, and achieve group cohesion by weak long-range attraction. In a minimal model that is isotropic, and continuous in both space and time, we demonstrate that (i) adjusting speed to a preferred value, combined with (ii) radial repulsion and an (iii) effective long-range attraction are sufficient for the stable ordering of autonomously moving agents in space. Our results imply that beyond these three rules ordering in space requires no further rules, for example, explicit velocity alignment, anisotropy of the interactions or the frequent reversal of the direction of motion, friction, elastic interactions, sticky surfaces, a viscous medium, or vertical separation that prefers interactions within horizontal layers. Noise and delays are inherent to the communication and decisions of all moving agents. Thus, next we investigate their effects on ordering in the model. First, we find that the amount of noise necessary for preventing the ordering of agents is not sufficient for destroying order. In other words, for realistic noise amplitudes the transition between order and disorder is rapid. Second, we demonstrate that ordering is more sensitive to displacements caused by delayed interactions than to uncorrelated noise (random errors). Third, we find that with changing interaction delays the ordered state disappears at roughly the same rate, whereas it emerges with different rates. In summary, we find that the model discussed here is simple enough to allow a fair understanding of the modeled phenomena, yet sufficiently detailed for the description and management of large flocks with noisy and delayed interactions. Our code is available at . [ABSTRACT FROM AUTHOR]