Biased Random Walk With Restart on Multilayer Heterogeneous Networks for MiRNA–Disease Association Prediction

Numerous experiments have proved that microRNAs (miRNAs) could be used as diagnostic biomarkers for many complex diseases. Thus, it is conceivable that predicting the unobserved associations between miRNAs and diseases is extremely significant for the medical field. Here, based on heterogeneous networks built on the information of known miRNA–disease associations, miRNA function similarity, disease semantic similarity, and Gaussian interaction profile kernel similarity for miRNAs and diseases, we developed a computing model of biased random walk with restart on multilayer heterogeneous networks for miRNA–disease association prediction (BRWRMHMDA) through enforcing degree-based biased random walk with restart (BRWR). Assessment results reflected that an AUC of 0.8310 was gained in local leave-one-out cross-validation (LOOCV), which proved the calculation algorithm’s good performance. Besides, we carried out BRWRMHMDA to prioritize candidate miRNAs for esophageal neoplasms based on HMDD v2.0. We further prioritize candidate miRNAs for breast neoplasms based on HMDD v1.0. The local LOOCV results and performance analysis of the case study all showed that the proposed model has good and stable performance.

Cross-Compiler Bipartite Vulnerability Search

Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance.

Detection of Airborne Biological Particles in Indoor Air Using a Real-Time Advanced Morphological Parameter UV-LIF Spectrometer and Gradient Boosting Ensemble Decision Tree Classifiers

We present results from a study evaluating the utility of supervised machine learning to classify single particle ultraviolet laser-induced fluorescence (UV-LIF) signatures to investigate airborne primary biological aerosol particle (PBAP) concentrations in a busy, multifunctional building using a Multiparameter Bioaerosol Spectrometer. First we introduce and demonstrate a gradient boosting ensemble decision tree algorithm’s ability to accurately classify laboratory generated PBAP samples into broad taxonomic classes with a high level of accuracy. We then develop a framework to appraise the classification accuracy and performance using the Hellinger distance metric to compare product parameter probability density function similarity; this framework showed that key training classes were sufficiently different in terms of particle fluorescence and morphology to facilitate classification. We also demonstrate the utility of including advanced morphological parameters to minimise inter-class conflation and improve classification confidence, where relying on the fluorescent spectra alone would likely result in misattribution. Finally, we apply these methods to ambient data collected within a large multi-functional building where ambient bacterial- and fungal-like classes were identified to display trends corresponding to human activity; fungal-like classes displayed a consistent diurnal trend with a maximum at midday and hourly peaks correlating to movements within the building; bacteria-like aerosol displayed complex, episodic events during opening hours. All PBAP classes fell to low baseline concentrations when the building was unoccupied overnight and at weekends.

A Cluster and Process Collaboration-Aware Method to Achieve Service Substitution in Cloud Service Processes

Some cloud services may be invalid since they are located in a dynamically changing network environment. Service substitution is necessary when a cloud service cannot be used. Existing work mainly concerned on service function and quality in service substitution. To select a more suitable substitutive service, process collaboration similarity needs to be considered. This paper proposes a cluster and process collaboration-aware method to achieve service substitution. To compute the process collaboration similarity, we use logic Petri nets to model service processes. All the service processes are transformed into path strings. Service vectors for cloud services are generated by Word2Vec from these path strings. Process collaboration similarity of two cloud services is obtained by computing the cosine value of their service vectors. Meanwhile, similar cloud services are classified as a service cluster. By calculating function similarity and quality matching, a candidate set for services substitution is generated. The service with the highest process collaboration similarity to invalid one in the candidate set is chosen as the substitutive one. Simulation experiments show the proposed method is less time-consuming than traditional methods in finding substitutive service. Meanwhile, the substitutive one has a high cooccurrence rate with neighboring services of the invalid cloud service. Thus, the proposed method is efficient and integrates process collaboration well in service substitution.

Function Similarity Using Family Context

Finding changed and similar functions between a pair of binaries is an important problem in malware attribution and for the identification of new malware capabilities. This paper presents a new technique called Function Similarity using Family Context (FSFC) for this problem. FSFC trains a Support Vector Machine (SVM) model using pairs of similar functions from two program variants. This method improves upon previous research called Cross Version Contextual Function Similarity (CVCFS) e epresenting a function using features extracted not just from the function itself, but also, from other functions with which it has a caller and callee relationship. We present the results of an initial experiment that shows that the use of additional features from the context of a function significantly decreases the false positive rate, obviating the need for a separate pass for cleaning false positives. The more surprising and unexpected finding is that the SVM model produced by FSFC can abstract function similarity features from one pair of program variants to find similar functions in an unrelated pair of program variants. If validated by a larger study, this new property leads to the possibility of creating generic similar function classifiers that can be packaged and distributed in reverse engineering tools such as IDA Pro and Ghidra.