Search

Classifying bank accounts by using transaction data is encouraging in cracking down on illegal financial activities. However, few research simultaneously use heterogenous features, which are embedded in the time series data. In this paper, a two route convolution neural network TRHD-CNN model, fed with two types of heterogeneous feature matrices, is proposed for classifying the bank accounts. TRHD-CNN adopts divide and conquer strategy to extract characteristics from two types of data source independently. The strategy is proved able in mining complementary classification characteristics. We firstly transfer the original log data into a directed and dynamic transaction network. On the basis of that, two feature generation methods are devised for extracting information from local topological structure and time series transaction respectively. A DirectedWalk method is developed in this paper to learning the network vector of vertices used for embedding the neighbor relationship of bank account. The extensive experimental results, conducted on a real bank transaction dataset that contains illegal pyramid selling accounts, show the significant advantage of TRHD-CNN over the existing methods. TRHD-CNN can provide recall scores up to 5.15% higher than competing methods. In addition, the two-route architecture of TRHD-CNN is easy to extend to multi-route scenarios and other fields. [ABSTRACT FROM AUTHOR]

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

As the location trajectory contains more spatial-temporal information about the user, it will be even dangerous for jeopardizing the privacy of the user. In order to cope with the correlation, an algorithm that utilizes the query division had been proposed. In this algorithm, random blocks of query context was used, so as the adversary was obfuscated and difficult to correlate the real result. However, this algorithm fails to dispose the size of each query block, as once same size blocks were obtained by the adversary continuously, so the adversary can regard them as blocks from the same query context, and then obtains the query context to correlate the discrete locations. In view of above conditions, in this paper we propose a fine granularity block division algorithm based on the conception of granularity measurement as well as granularity layer division, so with the help of collaborative users the location privacy of the user will be protected. In this algorithm, the query context will be divided into fine granularity size of information blocks that difficult to be distinguished with others, and then these blocks will be exchanged with other collaborative users to eliminate the difference in block size. In addition, as each block is divided into fine granularity size, the adversary will be difficult to correlate the discrete locations into location trajectory, so the location privacy will be protected. At last, through security analysis and experimental verification, this granularity indistinguishable algorithm is analyzed and verified at both theoretical and practical levels, which further demonstrate the superiority of the proposed algorithm compared with other similar algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we explore the (in)efficiency of the continuum Bitcoin-USD market in the period ranging from mid 2010 to early 2019. To deal with, we dynamically analyse the evolution of the self-similarity exponent of Bitcoin-USD daily returns via accurate FD4 approach by a 512 day sliding window with overlapping data. Further, we define the memory indicator by the difference between the self-similarity exponent of Bitcoin-USD series and the self-similarity index of its shuffled series. We also carry out additional analyses via FD4 approach by sliding windows of sizes equal to 64, 128, 256, and 1024 days, and also via FD algorithm for values of q equal to 1 and 2 (and sliding windows equal to 512 days). Moreover, we explored the evolution of the self-similarity exponent of actual S&P500 series via FD4 algorithm by sliding windows of sizes equal to 256 and 512 days. In all the cases, the obtained results were found to be similar to our first analysis. We conclude that the self-similarity exponent of the BTC-USD (resp., S&P500) series stands above 0.5. However, this is not due to the presence of significant memory in the series but to its underlying distribution. In fact, it holds that the self-similarity exponent of BTC-USD (resp., S&P500) series is similar or lower than the self-similarity index of a random series with the same distribution. As such, several periods with significant antipersistent memory in BTC-USD (resp., S&P500) series are distinguished. [ABSTRACT FROM AUTHOR]

Humans have a demonstrated tendency to copy or imitate the behavior and attitude of others and actively influence each other’s opinions. In plenty of empirical contexts, publicly revealed opinions are not necessarily in line with internal opinions, causing complex social influence dynamics. We study to what extent hypocrisy is sustained during opinion formation and how hidden opinions change the convergence to consensus in a group. We build and analyze a modified version of the voter model with hypocrisy in a complete graph with a neutral competition between two alternatives. We compare the process from various initial conditions, varying the proportions between the two opinions in the external (revealed) and internal (hidden) layer. According to our results, hypocrisy always prolongs the time needed for reaching a consensus. In a complete graph, this time span increases linearly with group size. We find that the group-level opinion emerges in two steps: (1) a fast and directional process, during which the number of the two kinds of hypocrites equalizes; and (2) a slower, random drift of opinions. During stage (2), the ratio of opinions in the external layer is approximately equal to the ratio in the internal layer; that is, the hidden opinions do not differ significantly from the revealed ones at the group level. We furthermore find that the initial abundances of opinions, but not the initial prevalence of hypocrisy, predicts the mean consensus time and determines the opinions’ probabilities of winning. These insights highlight the unimportance of hypocrisy in consensus formation under neutral conditions. Our results have important societal implications in relation to hidden voter preferences in polls and improve our understanding of opinion formation in a more realistic setting than that of conventional voter models. [ABSTRACT FROM AUTHOR]

We introduce a minimal agent-based model to understand the effects of the interplay between dispersal and geometric constraints in metapopulation dynamics under the Allee Effect. The model, which does not impose nonlinear birth and death rates, is studied both analytically and numerically. Our results indicate the existence of a survival-extinction boundary with monotonic behavior for weak spatial constraints and a nonmonotonic behavior for strong spatial constraints so that there is an optimal dispersal that maximizes the survival probability. Such optimal dispersal has empirical support from recent experiments with engineered bacteria. [ABSTRACT FROM AUTHOR]

Advances in machine learning and deep learning methods, together with the increasing availability of large-scale pharmacological, genomic, and chemical datasets, have created opportunities for identifying potentially useful relationships within biochemical networks. Knowledge embedding models have been found to have value in detecting knowledge-based correlations among entities, but little effort has been made to apply them to networks of biochemical entities. This is because such networks tend to be unbalanced and sparse, and knowledge embedding models do not work well on them. However, to some extent, the shortcomings of knowledge embedding models can be compensated for if they are used in association with graph embedding. In this paper, we combine knowledge embedding and graph embedding to represent biochemical entities and their relations as dense and low-dimensional vectors. We build a cascade learning framework which incorporates semantic features from the knowledge embedding model, and graph features from the graph embedding model, to score the probability of linking. The proposed method performs noticeably better than the models with which it is compared. It predicted links and entities with an accuracy of 93%, and its average hits@10 score has an average of 8.6% absolute improvement compared with original knowledge embedding model, 1.1% to 9.7% absolute improvement compared with other knowledge and graph embedding algorithm. In addition, we designed a meta-path algorithm to detect path relations in the biomedical network. Case studies further verify the value of the proposed model in finding potential relationships between diseases, drugs, genes, treatments, etc. Amongst the findings of the proposed model are the suggestion that VDR (vitamin D receptor) may be linked to prostate cancer. This is backed by evidence from medical databases and published research, supporting the suggestion that our proposed model could be of value to biomedical researchers. [ABSTRACT FROM AUTHOR]

Clustering large and complex data sets whose partitions may adopt arbitrary shapes remains a difficult challenge. Part of this challenge comes from the difficulty in defining a similarity measure between the data points that captures the underlying geometry of those data points. In this paper, we propose an algorithm, DCG++ that generates such a similarity measure that is data-driven and ultrametric. DCG++ uses Markov Chain Random Walks to capture the intrinsic geometry of data, scans possible scales, and combines all this information using a simple procedure that is shown to generate an ultrametric. We validate the effectiveness of this similarity measure within the context of clustering on synthetic data with complex geometry, on a real-world data set containing segmented audio records of frog calls described by mel-frequency cepstral coefficients, as well as on an image segmentation problem. The experimental results show a significant improvement on performance with the DCG-based ultrametric compared to using an empirical distance measure. [ABSTRACT FROM AUTHOR]

In a Quantum Walk (QW) the “walker” follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of problem solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. This paves the way for future QW implementations with spatial modes of light in free-space that are both versatile and scalable. [ABSTRACT FROM AUTHOR]

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

Various feature selection algorithms have been proposed to identify cancer prognostic biomarkers. In recent years, however, their reproducibility is criticized. The performance of feature selection algorithms is shown to be affected by the datasets, underlying networks and evaluation metrics. One of the causes is the curse of dimensionality, which makes it hard to select the features that generalize well on independent data. Even the integration of biological networks does not mitigate this issue because the networks are large and many of their components are not relevant for the phenotype of interest. With the availability of multi-omics data, integrative approaches are being developed to build more robust predictive models. In this scenario, the higher data dimensions create greater challenges. We proposed a phenotype relevant network-based feature selection (PRNFS) framework and demonstrated its advantages in lung cancer prognosis prediction. We constructed cancer prognosis relevant networks based on epithelial mesenchymal transition (EMT) and integrated them with different types of omics data for feature selection. With less than 2.5% of the total dimensionality, we obtained EMT prognostic signatures that achieved remarkable prediction performance (average AUC values >0.8), very significant sample stratifications, and meaningful biological interpretations. In addition to finding EMT signatures from different omics data levels, we combined these single-omics signatures into multi-omics signatures, which improved sample stratifications significantly. Both single- and multi-omics EMT signatures were tested on independent multi-omics lung cancer datasets and significant sample stratifications were obtained. [ABSTRACT FROM AUTHOR]

Time series segmentation aims to identify segment boundary points in a time series, and to determine the dynamical properties corresponding to each segment. To segment time series data, this article presents a Bayesian change-point model in which the data within segments follows an autoregressive moving average (ARMA) model. A prior distribution is defined for the number of change-points, their positions, segment means and error terms. To quantify uncertainty about the location of change-points, the resulting posterior probability distributions are sampled using the Generalized Gibbs sampler Markov chain Monte Carlo technique. This methodology is illustrated by applying it to simulated data and to real data known as the well-log time series data. This well-log data records the measurements of nuclear magnetic response of underground rocks during the drilling of a well. Our approach has high sensitivity, and detects a larger number of change-points than have been identified by comparable methods in the existing literature. [ABSTRACT FROM AUTHOR]

Idealized passive dynamic walkers (PDW) exhibit limit cycle stability at steady state. Yet in reality, uncertainty in ground interaction forces result in variability in limit cycles even for a simple walker known as the Rimless Wheel (RW) on seemingly even slopes. This class of walkers is called metastable walkers in that they usually walk in a stable limit cycle, though guaranteed to eventually fail. Thus, control action is only needed if a failure state (i.e. RW stopping down the ramp) is imminent. Therefore, efficiency of estimating the time to reach a failure state is key to develop a minimal intervention controller to inject just enough energy to overcome a failure state when required. Current methods use what is known as a Mean First Passage Time (MFPT) from current state (rotary speed of RW at the most recent leg collision) to an arbitrary state deemed to be a failure in the future. The frequently used Markov chain based MFPT prediction requires an absorbing state, which in this case is a collision where the RW comes to a stop without an escape. Here, we propose a novel method to estimate an MFPT from current state to an arbitrary state which is not necessarily an absorbing state. This provides freedom to a controller to adaptively take action when deemed necessary. We demonstrate the proposed MFPT predictions in a minimal intervention controller for a RW. Our results show that the proposed method is useful in controllers for walkers showing up to 44.1% increase of time-to-fail compared to a PID based closed-loop controller. [ABSTRACT FROM AUTHOR]

Many link prediction methods have been developed to infer unobserved links or predict missing links based on the observed network structure that is always incomplete and subject to interfering noise. Thus, the performance of existing methods is usually limited in that their computation depends only on input graph structures, and they do not consider external information. The effects of social influence and homophily suggest that both network structure and node attribute information should help to resolve the task of link prediction. This work proposes SASNMF, a link prediction unified framework based on non-negative matrix factorization that considers not only graph structure but also the internal and external auxiliary information, which refers to both the node attributes and the structural latent feature information extracted from the network. Furthermore, three different combinations of internal and external information are proposed and input into the framework to solve the link prediction problem. Extensive experimental results on thirteen real networks, five node attribute networks and eight non-attribute networks show that the proposed framework has competitive performance compared with benchmark methods and state-of-the-art methods, indicating the superiority of the presented algorithm. [ABSTRACT FROM AUTHOR]

It is known that when one (or both) variable is multiplicative, the choice of differencing intervals (n) (for example, differencing interval of n = 7 means a weekly datum which is the product of seven daily data) affects the Pearson correlation coefficient (ρ) between variables (often asset returns) and that ρ converges to zero as n increases. This fact can cause the resulting correlation to be arbitrary, hence unreliable. We suggest using Spearman correlation (r) and prove that as n increases Spearman correlation tends to a limit which only depends on Pearson correlation based on the original data (i.e., the value for a single period). In addition, we show, via simulation, that the relative variability (CV) of the estimator of ρ increases with n and that r does not share this disadvantage. Therefore, we suggest using Spearman when one (or both) variable is multiplicative. [ABSTRACT FROM AUTHOR]

Humans build models of their environments and act according to what they have learnt. In simple experimental environments, such model-based behaviour is often well accounted for as if subjects are ideal Bayesian observers. However, more complex probabilistic tasks require more sophisticated forms of inference that are sufficiently computationally and statistically taxing as to demand approximation. Here, we study properties of two approximation schemes in the context of a serial reaction time task in which stimuli were generated from a hierarchical Markov chain. One, pre-existing, scheme was a generically powerful variational method for hierarchical inference which has recently become popular as an account of psychological and neural data across a wide swathe of probabilistic tasks. A second, novel, scheme was more specifically tailored to the task at hand. We show that the latter model fit significantly better than the former. This suggests that our subjects were sensitive to many of the particular constraints of a complex behavioural task. Further, the tailored model provided a different perspective on the effects of cholinergic manipulations in the task. Neither model fit the behaviour on more complex contingencies that competently. These results illustrate the benefits and challenges that come with the general and special purpose modelling approaches and raise important questions of how they can advance our current understanding of learning mechanisms in the brain. [ABSTRACT FROM AUTHOR]

Researchers in many disciplines have previously used a variety of mathematical techniques for analyzing group interactions. Here we use a new metric for this purpose, called “integrated information” or “phi.” Phi was originally developed by neuroscientists as a measure of consciousness in brains, but it captures, in a single mathematical quantity, two properties that are important in many other kinds of groups as well: differentiated information and integration. Here we apply this metric to the activity of three types of groups that involve people and computers. First, we find that 4-person work groups with higher measured phi perform a wide range of tasks more effectively, as measured by their collective intelligence. Next, we find that groups of Wikipedia editors with higher measured phi create higher quality articles. Last, we find that the measured phi of the collection of people and computers communicating on the Internet increased over a recent six-year period. Together, these results suggest that integrated information can be a useful way of characterizing a certain kind of interactional complexity that, at least sometimes, predicts group performance. In this sense, phi can be viewed as a potential metric of effective group collaboration. [ABSTRACT FROM AUTHOR]

The paper investigates the effect of preferential gathering sites on urban insurgency in an agent-based model (ABM). The ABM model was proposed in earlier work and has been validated using FBI data. There is a nonlinear tradeoff between the local density of citizens due to the number of preferential gathering sites and the ability of law enforcement officers (LEOs) to adequately patrol that leads to a non-monotonic behavior in the number of large scale outburst of insurgency with respect to the number of gathering sites. The inclusion of a moderate number of sites decreases the number of large-scale outbursts. Having no gathering sites or a large number of gathering sites has a dilutive effect on the number of large-scale outbursts. Thus, this non-monotonicity indicates that a small number of organized units produces a larger insurgency effect than a larger number of distributed units. It is also shown, using Koopman mode analysis, that the spatial morphology of agents due to the gathering sites gives rise to temporal organization of the model dynamics; there is a prominent quasi-periodic component in the number of active and intimidated citizens and in the spatial distribution of the LEOs. [ABSTRACT FROM AUTHOR]

Wind and temperature data are important parameters in aircraft performance studies. The lack of accurate measurements of these parameters forces researchers to rely on numerical weather prediction models, which are often filtered for a larger area with decreased local accuracy. Aircraft, however, also transmit information related to weather conditions, in response to interrogation by air traffic controller surveillance radars. Although not intended for this purpose, aircraft surveillance data contains information that can be used for weather models. This paper presents a method that can be used to reconstruct a weather field from surveillance data that can be received with a simple 1090 MHz receiver. Throughout the paper, we answer two main research questions: how to accurately infer wind and temperature from aircraft surveillance data, and how to reconstruct a real-time weather grid efficiently. We consider aircraft as moving sensors that measure wind and temperature conditions indirectly at different locations and flight levels. To address the first question, aircraft barometric altitude, ground velocity, and airspeed are decoded from down-linked surveillance data. Then, temperature and wind observations are computed based on aeronautical speed conversion equations. To address the second question, we propose a novel Meteo-Particle (MP) model for constructing the wind and temperature fields. Short-term local prediction is also possible by employing a predictor layer. Using an unseen observation test dataset, we are able to validate that the mean absolute errors of inferred wind and temperature using MP model are 67% and 26% less than using the interpolated model based on GFS reanalysis data. [ABSTRACT FROM AUTHOR]

Gastrulation is the initial systematic deformation of the embryo to form germ layers, which is characterized by the placement of appropriate cells in their destined locations. Thus, gastrulation, which occurs at the beginning of the second month of pregnancy, is a critical stage in human body formation. Although histological analyses indicate that human gastrulation is similar to that of other amniotes (birds and mammals), much of human gastrulation dynamics remain unresolved due to ethical and technical limitations. We used human induced pluripotent stem cells (hiPSCs) to study the migration of mesendodermal cells through the primitive streak to form discoidal germ layers during gastrulation. Immunostaining results showed that hiPSCs differentiated into mesendodermal cells and that epithelial–mesenchymal transition occurred through the activation of the Activin/Nodal and Wnt/beta-catenin pathways. Single-cell time-lapse imaging of cells adhered to cover glass showed that mesendodermal differentiation resulted in the dissociation of cells and an increase in their migration speed, thus confirming the occurrence of epithelial–mesenchymal transition. These results suggest that mesendodermal cells derived from hiPSCs may be used as a model system for studying migration during human gastrulation in vitro. Using random walk analysis, we found that random migration occurred for both undifferentiated hiPSCs and differentiated mesendodermal cells. Two-dimensional random walk simulation showed that homogeneous dissociation of particles may form a discoidal layer, suggesting that random migration might be suitable to effectively disperse cells homogeneously from the primitive streak to form discoidal germ layers during human gastrulation. [ABSTRACT FROM AUTHOR]

This paper studies the structure of the Japanese production network, which includes one million firms and five million supplier-customer links. This study finds that this network forms a tightly-knit structure with a core giant strongly connected component (GSCC) surrounded by IN and OUT components constituting two half-shells of the GSCC, which we call awalnut structure because of its shape. The hierarchical structure of the communities is studied by the Infomap method, and most of the irreducible communities are found to be at the second level. The composition of some of the major communities, including overexpressions regarding their industrial or regional nature, and the connections that exist between the communities are studied in detail. The findings obtained here cause us to question the validity and accuracy of using the conventional input-output analysis, which is expected to be useful when firms in the same sectors are highly connected to each other. [ABSTRACT FROM AUTHOR]

We describe a methodology for assessing agreement and reliability among a set of shapes. Motivated by recent studies of the reliability of manually segmented medical images, we focus on shapes composed of rasterized, binary-valued data representing closed geometric regions of interest. The methodology naturally generalizes to N dimensions and other data types, though. We formulate the shape variance, shape correlation and shape intraclass correlation coefficient (ICC) in terms of a simple distance metric, the Manhattan norm, which quantifies the absolute difference between any two shapes. We demonstrate applications of this methodology by working through example shape variance calculations in 1-D, for the analysis of overlapping line segments, and 2-D, for the analysis of overlapping regions. We also report the results of a simulated reliability analysis of manually delineated shape boundaries, and we compare the shape ICC with the more conventional and commonly used area ICC. The proposed shape-sensitive methodology captures all of the variation in the shape measurements, and it provides a more accurate estimate of the measurement reliability than an analysis of only the measured areas. [ABSTRACT FROM AUTHOR]

Background: Making inferences about measles distribution patterns at small area level is vital for more focal targeted intervention. However, in statistical literature, the analysis of originally collected data on one resolution with the purpose to make inferences on a different level of spatial resolution is referred to as the misalignment problem. In Namibia the measles data were available in aggregated format at regional level for the period 2005 to 2014. This leads to a spatial misalignment problem if the purpose is to make decisions at constituency level. Moreover, although data on risk covariates of measles could be obtained at constituency level, they were not available each year between 2005 and 2014. Thus, assuming that covariates were constant through the study period would induce measurement errors which might have effects on the analysis results. This paper presents a spatio-temporal model through a multi-step approach in order to deal with misalignment and measurement error. Methods: For the period 2005–2014, measles data from the Ministry of Health and Social Services (MoHSS) were analysed in two steps. First, a multi-step approach was applied to correct spatial misalignment in the data. Second, a classical measurement error model was fitted to account for measurement errors. The time effects were specified using a nonparametric formulation for the linear trend through first order random walk. An interaction between area and time was modelled through type I and type II interaction structures. Results: The study showed that there was high variation in measles risk across constituencies and as well as over the study period (2005–2014). Furthermore, the risk of measles was found to be associated with (i) the number of people aged between 0 and 24 years, (ii) the percentages of women aged 15–49 with an educational level more than secondary, (iii) the percentages of children age 12–23 months who received measles vaccine, (iv) the percentages of malnourished children under 5 years, and (vi) the measles cases for each previous year. Conclusion: The study showed some of the determinants of measles risk and revealed areas at high risk through disease mapping. Additionally, the study showed a non-linear temporal distribution of measles risk over the study period. Finally, it was shown that ignoring the measurement errors may yield misleading results. It was recommended that group and geographically targeted intervention, prevention and control strategies can be tailored on the basis these findings. [ABSTRACT FROM AUTHOR]

The minimally invasive transcatheter aortic valve implantation (TAVI) is the most prevalent method to treat aortic valve stenosis. For pre-operative surgical planning, contrast-enhanced coronary CT angiography (CCTA) is used as the imaging technique to acquire 3-D measurements of the valve. Accurate localization of the eight aortic valve landmarks in CT images plays a vital role in the TAVI workflow because a small error risks blocking the coronary circulation. In order to examine the valve and mark the landmarks, physicians prefer a view parallel to the hinge plane, instead of using the conventional axial, coronal or sagittal view. However, customizing the view is a difficult and time-consuming task because of unclear aorta pose and different artifacts of CCTA. Therefore, automatic localization of landmarks can serve as a useful guide to the physicians customizing the viewpoint. In this paper, we present an automatic method to localize the aortic valve landmarks using colonial walk, a regression tree-based machine-learning algorithm. For efficient learning from the training set, we propose a two-phase optimized search space learning model in which a representative point inside the valvular area is first learned from the whole CT volume. All eight landmarks are then learned from a smaller area around that point. Experiment with preprocedural CCTA images of TAVI undergoing patients showed that our method is robust under high stenotic variation and notably efficient, as it requires only 12 milliseconds to localize all eight landmarks, as tested on a 3.60 GHz single-core CPU. [ABSTRACT FROM AUTHOR]

Movement patterns resembling Lévy walks, often attributed to the execution of an advantageous probabilistic searching strategy, are found in a wide variety of organisms, from cells to human hunter-gatherers. It has been suggested that such movement patterns may be fundamental to how humans interact and experience the world and that they may have arisen early in our genus with the evolution of a hunting and gathering lifestyle. Here we show that Lévy walks are evident in the Me’Phaa of Mexico, in Brazilian Cariri farmers and in Amazonian farmers when gathering firewood, wild fruit and nuts. Around 50% of the search patterns resemble Lévy walks and these are characterized by Lévy exponents close to 1.7. The other search patterns more closely resemble bi-phasic walks. We suggest potential generative mechanisms for the occurrence of these ubiquitous Lévy walks which can be used to guide future studies on human mobility. We show that frequent excursions and meanderings from pre-existing trails can account for our observations. [ABSTRACT FROM AUTHOR]

The kidney exchange programs bring new insights in the field of organ transplantation. They make the previously not allowed surgery of incompatible patient-donor pairs easier to be performed on a large scale. Mathematically, the kidney exchange is an optimization problem for the number of possible exchanges among the incompatible pairs in a given pool. Also, the optimization modeling should consider the expected quality-adjusted life of transplant candidates and the shortage of computational and operational hospital resources. In this article, we introduce a bio-inspired stochastic-based Ant Lion Optimization, ALO, algorithm to the kidney exchange space to maximize the number of feasible cycles and chains among the pool pairs. Ant Lion Optimizer-based program achieves comparable kidney exchange results to the deterministic-based approaches like integer programming. Also, ALO outperforms other stochastic-based methods such as Genetic Algorithm in terms of the efficient usage of computational resources and the quantity of resulting exchanges. Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs. A reference implementation for ALO algorithm for kidney exchanges is written in MATLAB and is GPL licensed. It is available as free open-source software from: . [ABSTRACT FROM AUTHOR]

Size estimation is particularly important for populations whose members experience disproportionate health issues or pose elevated health risks to the ambient social structures in which they are embedded. Efforts to derive size estimates are often frustrated when the population is hidden or hard-to-reach in ways that preclude conventional survey strategies, as is the case when social stigma is associated with group membership or when group members are involved in illegal activities. This paper extends prior research on the problem of network population size estimation, building on established survey/sampling methodologies commonly used with hard-to-reach groups. Three novel one-step, network-based population size estimators are presented, for use in the context of uniform random sampling, respondent-driven sampling, and when networks exhibit significant clustering effects. We give provably sufficient conditions for the consistency of these estimators in large configuration networks. Simulation experiments across a wide range of synthetic network topologies validate the performance of the estimators, which also perform well on a real-world location-based social networking data set with significant clustering. Finally, the proposed schemes are extended to allow them to be used in settings where participant anonymity is required. Systematic experiments show favorable tradeoffs between anonymity guarantees and estimator performance. Taken together, we demonstrate that reasonable population size estimates are derived from anonymous respondent driven samples of 250-750 individuals, within ambient populations of 5,000-40,000. The method thus represents a novel and cost-effective means for health planners and those agencies concerned with health and disease surveillance to estimate the size of hidden populations. We discuss limitations and future work in the concluding section. [ABSTRACT FROM AUTHOR]

Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks. [ABSTRACT FROM AUTHOR]

For a broad range of research and practical applications it is important to understand the allegiances, communities and structure of key players in society. One promising direction towards extracting this information is to exploit the rich relational data in digital social networks (the social graph). As global social networks (e.g., Facebook and Twitter) are very large, most approaches make use of distributed computing systems for this purpose. Distributing graph processing requires solving many difficult engineering problems, which has lead some researchers to look at single-machine solutions that are faster and easier to maintain. In this article, we present an approach for analyzing full social networks on a standard laptop, allowing for interactive exploration of the communities in the locality of a set of user specified query vertices. The key idea is that the aggregate actions of large numbers of users can be compressed into a data structure that encapsulates the edge weights between vertices in a derived graph. Local communities can be constructed by selecting vertices that are connected to the query vertices with high edge weights in the derived graph. This compression is robust to noise and allows for interactive queries of local communities in real-time, which we define to be less than the average human reaction time of 0.25s. We achieve single-machine real-time performance by compressing the neighborhood of each vertex using minhash signatures and facilitate rapid queries through Locality Sensitive Hashing. These techniques reduce query times from hours using industrial desktop machines operating on the full graph to milliseconds on standard laptops. Our method allows exploration of strongly associated regions (i.e., communities) of large graphs in real-time on a laptop. It has been deployed in software that is actively used by social network analysts and offers another channel for media owners to monetize their data, helping them to continue to provide free services that are valued by billions of people globally. [ABSTRACT FROM AUTHOR]

In smart parking environments, how to choose suitable parking facilities with various attributes to satisfy certain criteria is an important decision issue. Based on the multiple attributes decision making (MADM) theory, this study proposed a smart parking guidance algorithm by considering three representative decision factors (i.e., walk duration, parking fee, and the number of vacant parking spaces) and various preferences of drivers. In this paper, the expected number of vacant parking spaces is regarded as an important attribute to reflect the difficulty degree of finding available parking spaces, and a queueing theory-based theoretical method was proposed to estimate this expected number for candidate parking facilities with different capacities, arrival rates, and service rates. The effectiveness of the MADM-based parking guidance algorithm was investigated and compared with a blind search-based approach in comprehensive scenarios with various distributions of parking facilities, traffic intensities, and user preferences. Experimental results show that the proposed MADM-based algorithm is effective to choose suitable parking resources to satisfy users’ preferences. Furthermore, it has also been observed that this newly proposed Markov Chain-based availability attribute is more effective to represent the availability of parking spaces than the arrival rate-based availability attribute proposed in existing research. [ABSTRACT FROM AUTHOR]

The ability to predict what courses a student may enroll in the coming semester plays a pivotal role in the allocation of learning resources, which is a hot topic in the domain of educational data mining. In this study, we propose an innovative approach to characterize students’ cross-college course enrollments by leveraging a novel contextual graph. Specifically, different kinds of variables, such as students, courses, colleges and diplomas, as well as various types of variable relations, are utilized to depict the context of each variable, and then a representation learning algorithm node2vec is applied to extracting sophisticated graph-based features for the enrollment analysis. In this manner, the relations between any pair of variables can be measured quantitatively, which enables the variable type to transform from nominal to ratio. These graph-based features are examined by the random forest algorithm, and experiments on 24,663 students, 1,674 courses and 417,590 enrollment records demonstrate that the contextual graph can successfully improve analyzing the cross-college course enrollments, where three of the graph-based features have significantly stronger impacts on prediction accuracy than the others. Besides, the empirical results also indicate that the student’s course preference is the most important factor in predicting future course enrollments, which is consistent to the previous studies that acknowledge the course interest is a key point for course recommendations. [ABSTRACT FROM AUTHOR]

With the highly dense genomic data available nowadays, ignoring linkage between genes would result in a huge loss of information. One way to prevent such a loss is to focus on the blocks of chromosomes shared identical by descent (IBD) in populations. The development of the theoretical framework modelling IBD processes is essential to support the advent of new tools such as haplotype phasing, imputation, inferring population structure and demographic history, mapping loci or detecting signatures of selection. This article aims to present the relevant models used in this context, and specify the underlying definitions of identity by descent that are yet to be gathered at one place. In light of this, we derived a general expression for the expected IBD block length, for any population model at any generation after founding. [ABSTRACT FROM AUTHOR]

This paper presents the concept of a social autonomous agent to conceptualize such Autonomous Vehicles (AVs), which interacts with other AVs using social manners similar to human behavior. The presented AVs also have the capability of predicting intentions, i.e. mentalizing and copying the actions of each other, i.e. mirroring. Exploratory Agent Based Modeling (EABM) level of the Cognitive Agent Based Computing (CABC) framework has been utilized to design the proposed social agent. Furthermore, to emulate the functionality of mentalizing and mirroring modules of proposed social agent, a tailored mathematical model of the Richardson’s arms race model has also been presented. The performance of the proposed social agent has been validated at two levels–firstly it has been simulated using NetLogo, a standard agent-based modeling tool and also, at a practical level using a prototype AV. The simulation results have confirmed that the proposed social agent-based collision avoidance strategy is 78.52% more efficient than Random walk based collision avoidance strategy in congested flock-like topologies. Whereas practical results have confirmed that the proposed scheme can avoid rear end and lateral collisions with the efficiency of 99.876% as compared with the IEEE 802.11n-based existing state of the art mirroring neuron-based collision avoidance scheme. [ABSTRACT FROM AUTHOR]

There is a burst of work on human mobility and encounter networks. However, the connection between these two important fields just begun recently. It is clear that both are closely related: Mobility generates encounters, and these encounters might give rise to contagion phenomena or even friendship. We model a set of random walkers that visit locations in space following a strategy akin to Lévy flights. We measure the encounters in space and time and establish a link between walkers after they coincide several times. This generates a temporal network that is characterized by global quantities. We compare this dynamics with real data for two cities: New York City and Tokyo. We use data from the location-based social network Foursquare and obtain the emergent temporal encounter network, for these two cities, that we compare with our model. We found long-range (Lévy-like) distributions for traveled distances and time intervals that characterize the emergent social network due to human mobility. Studying this connection is important for several fields like epidemics, social influence, voting, contagion models, behavioral adoption and diffusion of ideas. [ABSTRACT FROM AUTHOR]

Since the microbiome has a significant impact on human health and disease, microbe-disease associations can be utilized as a valuable resource for understanding disease pathogenesis and promoting disease diagnosis and prognosis. Accordingly, it is necessary for researchers to achieve a comprehensive and deep understanding of the associations between microbes and diseases. Nevertheless, to date, little work has been achieved in implementing novel human microbe-disease association prediction models. In this paper, we develop a novel computational model to predict potential microbe-disease associations by bi-random walk on the heterogeneous network (BiRWHMDA). The heterogeneous network was constructed by connecting the microbe similarity network and the disease similarity network via known microbe-disease associations. Microbe similarity and disease similarity were calculated by the Gaussian interaction profile kernel similarity measure; moreover, a logistic function was applied to regulate disease similarity. Additionally, leave-one-out cross validation and 5-fold cross validation were implemented to evaluate the predictive performance of our method; both cross validation methods performed well. The leave-one-out cross validation experiment results illustrate that our method outperforms other previously proposed methods. Furthermore, case studies on asthma and inflammatory bowel disease prove the favorable performance of our method. In conclusion, our method can be considered as an effective computational model for predicting novel microbe-disease associations. [ABSTRACT FROM AUTHOR]

Benchmarking surveillance systems requires realistic simulations of disease outbreaks. However, obtaining these data in sufficient quantity, with a realistic shape and covering a sufficient range of agents, size and duration, is known to be very difficult. The dataset of outbreak signals generated should reflect the likely distribution of authentic situations faced by the surveillance system, including very unlikely outbreak signals. We propose and evaluate a new approach based on the use of historical outbreak data to simulate tailored outbreak signals. The method relies on a homothetic transformation of the historical distribution followed by resampling processes (Binomial, Inverse Transform Sampling Method—ITSM, Metropolis-Hasting Random Walk, Metropolis-Hasting Independent, Gibbs Sampler, Hybrid Gibbs Sampler). We carried out an analysis to identify the most important input parameters for simulation quality and to evaluate performance for each of the resampling algorithms. Our analysis confirms the influence of the type of algorithm used and simulation parameters (i.e. days, number of cases, outbreak shape, overall scale factor) on the results. We show that, regardless of the outbreaks, algorithms and metrics chosen for the evaluation, simulation quality decreased with the increase in the number of days simulated and increased with the number of cases simulated. Simulating outbreaks with fewer cases than days of duration (i.e. overall scale factor less than 1) resulted in an important loss of information during the simulation. We found that Gibbs sampling with a shrinkage procedure provides a good balance between accuracy and data dependency. If dependency is of little importance, binomial and ITSM methods are accurate. Given the constraint of keeping the simulation within a range of plausible epidemiological curves faced by the surveillance system, our study confirms that our approach can be used to generate a large spectrum of outbreak signals. [ABSTRACT FROM AUTHOR]

In vitro cell culture is routinely used to grow and supply a sufficiently large number of cells for various types of cell biology experiments. Previous experimental studies report that cell characteristics evolve as the passage number increases, and various cell lines can behave differently at high passage numbers. To provide insight into the putative mechanisms that might give rise to these differences, we perform in silico experiments using a random walk model to mimic the in vitro cell culture process. Our results show that it is possible for the average proliferation rate to either increase or decrease as the passaging process takes place, and this is due to a competition between the initial heterogeneity and the degree to which passaging damages the cells. We also simulate a suite of scratch assays with cells from near–homogeneous and heterogeneous cell lines, at both high and low passage numbers. Although it is common in the literature to report experimental results without disclosing the passage number, our results show that we obtain significantly different closure rates when performing in silico scratch assays using cells with different passage numbers. Therefore, we suggest that the passage number should always be reported to ensure that the experiment is as reproducible as possible. Furthermore, our modelling also suggests some avenues for further experimental examination that could be used to validate or refine our simulation results. [ABSTRACT FROM AUTHOR]

We study how large functional networks can grow stably under possible cascading overload failures and evaluated the maximum stable network size above which even a small-scale failure would cause a fatal breakdown of the network. Employing a model of cascading failures induced by temporally fluctuating loads, the maximum stable size nmax has been calculated as a function of the load reduction parameter r that characterizes how quickly the total load is reduced during the cascade. If we reduce the total load sufficiently fast (r ≥ rc), the network can grow infinitely. Otherwise, nmax is finite and increases with r. For a fixed r(< rc), nmax for a scale-free network is larger than that for an exponential network with the same average degree. We also discuss how one detects and avoids the crisis of a fatal breakdown of the network from the relation between the sizes of the initial network and the largest component after an ordinarily occurring cascading failure. [ABSTRACT FROM AUTHOR]

In multicellular organisms, cell motility is central in all morphogenetic processes, tissue maintenance, wound healing and immune surveillance. Hence, the control of cell motion is a major demand in the creation of artificial tissues and organs. Here, cell migration assays on plastic 2D surfaces involving normal (MDCK) and tumoral (B16F10) epithelial cell lines were performed varying the initial density of plated cells. Through time-lapse microscopy quantities such as speed distributions, velocity autocorrelations and spatial correlations, as well as the scaling of mean-squared displacements were determined. We find that these cells exhibit anomalous diffusion with q-Weibull speed distributions that evolves non-monotonically to a Maxwellian distribution as the initial density of plated cells increases. Although short-ranged spatial velocity correlations mark the formation of small cell clusters, the emergence of collective motion was not observed. Finally, simulational results from a correlated random walk and the Vicsek model of collective dynamics evidence that fluctuations in cell velocity orientations are sufficient to produce q-Weibull speed distributions seen in our migration assays. [ABSTRACT FROM AUTHOR]

Contrary to the assumption that web browsers are designed to support the user, an examination of a 900,000 distinct PCs shows that web browsers comprise a complex ecosystem with millions of addons collaborating and competing with each other. It is possible for addons to “sneak in” through third party installations or to get “kicked out” by their competitors without user involvement. This study examines that ecosystem quantitatively by constructing a large-scale graph with nodes corresponding to users, addons, and words (terms) that describe addon functionality. Analyzing addon interactions at user level using the Personalized PageRank (PPR) random walk measure shows that the graph demonstrates ecological resilience. Adapting the PPR model to analyzing the browser ecosystem at the level of addon manufacturer, the study shows that some addon companies are in symbiosis and others clash with each other as shown by analyzing the behavior of 18 prominent addon manufacturers. Results may herald insight on how other evolving internet ecosystems may behave, and suggest a methodology for measuring this behavior. Specifically, applying such a methodology could transform the addon market. [ABSTRACT FROM AUTHOR]

The maturation of the cortical gray matter (GM) and white matter (WM) are described as sequential processes following multiple, but distinct rules. However, neither the mechanisms driving brain maturation processes, nor the relationship between GM and WM maturation are well understood. Here we use connectomics and two MRI measures reflecting maturation related changes in cerebral microstructure, namely the Apparent Diffusion Coefficient (ADC) and the T1 relaxation time (T1), to study brain development. We report that the advancement of GM and WM maturation are inter-related and depend on the underlying brain connectivity architecture. Particularly, GM regions and their incident WM connections show corresponding maturation levels, which is also observed for GM regions connected through a WM tract. Based on these observations, we propose a simple computational model supporting a key role for the connectome in propagating maturation signals sequentially from external stimuli, through primary sensory structures to higher order functional cortices. [ABSTRACT FROM AUTHOR]

With the increasing availability of high-throughput data, various computational methods have recently been developed for understanding the cell through protein-protein interaction (PPI) networks at a systems level. However, due to the incompleteness of the original PPI networks those efforts have been significantly hindered. In this paper, we propose a two stage method to predict underlying links between two originally unlinked protein pairs. First, we measure gene expression and gene functional similarly between unlinked protein pairs on Saccharomyces cerevisiae benchmark network and obtain new constructed networks. Then, we select the significant part of the new predicted links by analyzing the difference between essential proteins that have been identified based on the new constructed networks and the original network. Furthermore, we validate the performance of the new method by using the reliable and comprehensive PPI dataset obtained from the STRING database and compare the new proposed method with four other random walk-based methods. Comparing the results indicates that the new proposed strategy performs well in predicting underlying links. This study provides a general paradigm for predicting new interactions between protein pairs and offers new insights into identifying essential proteins. [ABSTRACT FROM AUTHOR]

Least-cost modelling and circuit theory are common analogs used in ecology and evolution to model gene flow or animal movement across landscapes. Least-cost modelling estimates the least-cost distance, whereas circuit theory estimates resistance distance. The bias added in choosing one method over the other has not been well documented. We designed an experiment to test whether both methods were linearly related. We also tested the sensitivity of these metrics to variation in Euclidean distance, spatial autocorrelation, the number of pixels representing the landscape, and data aggregation. We found that least-cost and resistance distance were not linearly related unless a transformation was applied. Resistance distance was less sensitive to the number of pixels representing a landscape and was also less sensitive than least-cost distance to the Euclidean distance between nodes. Spatial autocorrelation did not affect either method or the relationship between methods. Resistance distance was more sensitive to aggregation in any form compared to least-cost distance. Therefore, the metric used to infer movement or gene flow and the manipulations applied to the data used to calculate these metrics may govern findings. [ABSTRACT FROM AUTHOR]

The deployment of large number of femtocell base stations allows us to extend the coverage and efficiently utilize resources in a low cost manner. However, the small cell size of femtocell networks can result in frequent handovers to the mobile user, and consequently throughput degradation. Thus, in this paper, we propose predictive association control schemes to improve the system’s effective throughput. Our design focuses on reducing handover frequency without impacting on throughput. The proposed schemes determine handover decisions that contribute most to the network throughput and are proper for distributed implementations. The simulation results show significant gains compared with existing methods in terms of handover frequency and network throughput perspective. [ABSTRACT FROM AUTHOR]

The Internet has provided us with great opportunities for large scale collaborative public good projects. Wikipedia is a predominant example of such projects where conflicts emerge and get resolved through bottom-up mechanisms leading to the emergence of the largest encyclopedia in human history. Disaccord arises whenever editors with different opinions try to produce an article reflecting a consensual view. The debates are mainly heated by editors with extreme views. Using a model of common value production, we show that the consensus can only be reached if groups with extreme views can actively take part in the discussion and if their views are also represented in the common outcome, at least temporarily. We show that banning problematic editors mostly hinders the consensus as it delays discussion and thus the whole consensus building process. To validate the model, relevant quantities are measured both in simulations and Wikipedia, which show satisfactory agreement. We also consider the role of direct communication between editors both in the model and in Wikipedia data (by analyzing the Wikipedia talk pages). While the model suggests that in certain conditions there is an optimal rate of “talking” vs “editing”, it correctly predicts that in the current settings of Wikipedia, more activity in talk pages is associated with more controversy. [ABSTRACT FROM AUTHOR]

We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user’s graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score. [ABSTRACT FROM AUTHOR]

We propose a new meta-heuristic algorithm named Levy flights multi-verse optimizer (LFMVO), which incorporates Levy flights into multi-verse optimizer (MVO) algorithm to solve numerical and engineering optimization problems. The Original MVO easily falls into stagnation when wormholes stochastically re-span a number of universes (solutions) around the best universe achieved over the course of iterations. Since Levy flights are superior in exploring unknown, large-scale search space, they are integrated into the previous best universe to force MVO out of stagnation. We test this method on three sets of 23 well-known benchmark test functions and an NP complete problem of test scheduling for Network-on-Chip (NoC). Experimental results prove that the proposed LFMVO is more competitive than its peers in both the quality of the resulting solutions and convergence speed. [ABSTRACT FROM AUTHOR]

Identification of miRNA-disease association is a fundamental challenge in human health clinic. However, the known miRNA-disease associations are rare and experimental verification methods are expensive and time-consuming. Therefore, there is a strong incentive to develop computational methods. In this paper, we calculate the similarity score for each miRNAs pair by integrating miRNA functional similarity and miRNA family information. We use the disease phenotype similarity data to construct the disease similarity network. Then we introduce a new miRNA-disease association prediction method (NETwork Group Similarity, NetGS) to explore the global network similarity, capturing the relationship between the disease and other diseases, the similarity between the potential disease-related miRNA and other miRNAs. Finally based on the consistency of diffusion profiles we get the miRNA-disease association scores. NetGS is tested by the leave-one-out cross validation and achieves an AUC value of 0.8450, which improves the prediction accuracy. NetGS can also be applied to solve the new miRNA-disease association and obtain reliable accuracy. Moreover, we use NetGS to predict new causing miRNAs of three cancers including breast cancer, lung cancer and Hepatocellular cancer. And the top predictions have been confirmed in the online databases. The encouraging results indicate that NetGS might play an essential role for future scientific research. [ABSTRACT FROM AUTHOR]