Search Results for "random walk"
Sort By:
Showing 18 open source projects for "random walk"
View related business solutions-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
HiPS : Hierarchical Petri net Simulator
HiPS tool features to design and analyze hierarchical Petri nets
...HiPS tool has also functions of static/dynamic analysis : T-invariant detection, Reachability path analysis, deadlock state detection, and k-boundedness analysis. In addition, it is possible to perform a random walk simulation with each firing steps. -
2
ChaosEsqueAnthology
A free 3d game for PC that does not limit the player. Fight,Build,Gain
(NOTE: Make sure to download Volume2 aswell!: http://sourceforge.net/p/chaosesqueanthologyvolume2/ ) 200+ weapons. Build-able enter-able buildings (Like an FPS RPG but with interiors) (Multi-tool/ Utili-tool). City generation (all buildings enterable). A 2 iso (6GB) exploration of what QuakeC can do. Over 100 maps included, along with map editor and sourcecode. Fully free and opensource: code and media. A modification of Xonotic which included extended weapons, maps, vehicles,... -
3
LinkLiar
Link-Layer MAC spoofing GUI for macOS
...Everyone nearby may freely collect this unique identifier and use it to track your movement. Did you know that your phone does not send out its Wi-Fi identifier, but rather a random, fake one? This is to protect you from the common practice of businesses to track your movements when you walk around in stores. With LinkLiar you can achieve the same privacy for your MacBook. Though the MAC address is hardwired into your Wi-Fi network card, you are free to modify it. -
4
RWRMTN
Predicting disease-associated miRNAs on a miRNA-target gene network
The misregulations of microRNA have been shown the contribution to diseases. Recently, we have proposed a computational method based on a random walk framework on a microRNA-target gene network to predict disease-associated microRNAs. This was shown superior when compared to existing state-of-the-art network- and machine learning-based methods since it well exploits mutual regulation between miRNAs and their target genes in microRNA-target gene networks. To facilitate the use of this method, we develop a Cytoscape app, named RWRMTN, to predict disease-associated microRNAs. ... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
Kalibr Allan
IMU Allan standard deviation charts
...These plots are analyzed to determine noise density and random walk parameters for both gyroscopes and accelerometers. The repository also includes example data and plots from real sensors such as the XSENS MTI-G-700, Tango Yellowstone Tablet, and ASL-ETH VI-Sensor, providing reference points for interpretation. -
6
Pi-Trav
An interactive pi walk.
A simulation and visualization of random walks based on the digits pi. This program also has a settings menu. -
7
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction.... -
8
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
... - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. ... -
9
BiRW
Bi-random Walks for Phenome-Genome Association Prediction
...BiRW is a package designed for analysis and prediction of the phenome-genome associations. BiRW package contains a program for analysis of circular bigraphs (CBGs) and the bi-random walk (BiRW) algorithm to capture the CBG patterns in the networks for unveiling human and mouse phenome-genome association. The processed OMIM human disease phenotype-gene association network and MGI mouse phentoype-gene association network are also released together with the source code. -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
Volume approximation
Efficient Random-Walk Methods for Approximating Polytope Volume.
Efficient Random-Walk Methods for Approximating Polytope Volume. This project is moved and is being developed on https://github.com/GeomScale/volume_approximation -
11
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
This software package provides a framework for calculating similarity between neighborhoods rooted at two vertices of interest in a labeled graph (undirected or directed). The list of available similarity functions includes: cumulative random walk, standard random walk, standard graphlet kernel, edit distance graphlet kernel, label substitution graphlet kernel and edge indel graphlet kernel. The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based clustering, or community detection. If you use this framework, please cite the following paper: Lugo-Martinez J, Radivojac P. ... -
12
JProGraM (PRObabilistic GRAphical Models in Java) is a statistical machine learning library. It supports statistical modeling and data analysis along three main directions: (1) probabilistic graphical models (Bayesian networks, Markov random fields, dependency networks, hybrid random fields); (2) parametric, semiparametric, and nonparametric density estimation (Gaussian models, nonparanormal estimators, Parzen windows, Nadaraya-Watson estimator); (3) generative models for random networks (small-world, scale-free, exponential random graphs, Fiedler random fields), subgraph sampling algorithms (random walk, snowball, etc.), and spectral decomposition.
-
13
Random Walk
A small Programm to show that even random has a direction.
Random Walk is a small programm I devoleped by myself. It shows that even when generating random numbers there is a tendency in on direction. I am no professional programmer, so please bear with me, when viewing the source code or when you are trying to give me tips. :-) There is still a lot left to be done. (Especially on creating random numbers and such). -
14
LX29 SGGF
Some Graphical Art Functions combined in one Form
The Lukix29 SGGF makes much more than only SGGF's it is an tool for making and manipulating mostly Random generated geometrical Pictures -
15
GenePrioritization is a program to prioritize disease genes based on the random walk with restart algorithm for any kind of gene/protein networks. Putative genes can be verified through evidences found in PubMed, OMIM, and GeneRIF databases.
-
16
GHIRL is the Graph-based Heterogeneous Information Representation Language: a java library for representing, querying, and navigating graph- or network-based data structures.
-
17
-
18
HiPS1_released
HiPS : Hierarchical Petri net Simulator
...HiPS tool has also functioned of static/dynamic analysis: T-invariant detection, Reachability path analysis, deadlock state detection, and k-boundedness analysis. Also, it is possible to perform a random walk simulation with each firing steps. GitHub https://github.com/kisolab/HiPS1_released/ SourceForge http://sourceforge.net/projects/hips-tools/ introduction video https://youtu.be/usF1JrQegOE
- Previous
- You're on page 1
- Next
