Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

Graft injury affects over 50% of liver transplant (LT) recipients, but non-invasive biomarkers to diagnose and guide treatment are currently limited. We aimed to develop a biomarker of graft injury by integrating serum metabolomic profiles with clinical variables. Serum from 55 LT recipients with biopsy confirmed metabolic-dysfunction associated steatohepatitis (MASH), T-cell mediated rejection (TCMR) and biliary complications was collected and processed using a combination of LC-MS/MS assay. The metabolomic profiles were integrated with clinical information using a multi-class Machine Learning (ML) classifier. The efficacy of the model was assessed through the evaluation of the Out-of-Bag (OOB) error estimate. Our ML model yielded an overall accuracy of 79.66% with an OOB estimate of the error rate at 19.75%. The model exhibited a maximum ability to distinguish MASH, with an OOB error estimate of 7.4% compared to 22.2% for biliary and 29.6% for TCMR. The metabolites serine and serotonin emerged as the topmost predictors. When predicting binary outcomes using 3 models: Biliary (biliary vs. rest), MASH (MASH vs. rest) and TCMR (TCMR vs. rest), the AUCs were 0.882, 0.972 and 0.96 respectively. Our ML tool integrating serum metabolites with clinical variables shows promise as a non-invasive, multi-class serum biomarker of graft pathology.

Recent neuroscience research results show that the nerve information in the brain is not only encoded by the spatial information. Spiking neural network based on pulse frequency coding plays a very important role in dealing with the problem of brain signal, especially complicated space-time information. In this paper, an unsupervised learning algorithm for bilayer feedforward spiking neural networks based on spike-timing dependent plasticity (STDP) competitiveness is proposed and applied to SAR image classification on MSTAR for the first time. The SNN learns autonomously from the input value without any labeled signal and the overall classification accuracy of SAR targets reached 80.8%. The experimental results show that the algorithm adopts the synaptic neurons and network structure with stronger biological rationality, and has the ability to classify targets on SAR image. Meanwhile, the feature map extraction ability of neurons is visualized by the generative property of SNN, which is a beneficial attempt to apply the brain-like neural network into SAR image interpretation.

A continuous Deep Belief Network (cDBN) with two hidden layers is proposed in this paper, focusing on the problem of weak feature learning ability when dealing with continuous data. In cDBN, the input data is trained in an unsupervised way by using continuous version of transfer functions, the contrastive divergence is designed in hidden layer training process to raise convergence speed, an improved dropout strategy is then implemented in unsupervised training to realize features learning by de-cooperating between the units, and then the network is fine-tuned using back propagation algorithm. Besides, hyper-parameters are analysed through stability analysis to assure the network can find the optimal. Finally, the experiments on Lorenz chaos series, CATS benchmark and other real world like CO2 and waste water parameters forecasting show that cDBN has the advantage of higher accuracy, simpler structure and faster convergence speed than other methods.

With the rapid development of the Internet industry, the problem of information overload has arisen due to the abundance of information available online. Recommendation algorithms, as the core of recommendation systems, have been attracting much attention and are a hot topic of research for many experts and scholars. The classical recommendation algorithms are mainly divided into three major categories: collaborative filtering recommendation algorithms, content-based recommendation algorithms, and hybrid-based recommendation algorithms. Although these algorithms are widely used in various fields, with the proliferation of information, these traditional recommendation algorithms are no longer able to meet the needs of the times. To address this issue, recommendation systems have been developed to provide users with personalized and relevant information or products. Despite the wide use of recommendation algorithms, such as collaborative filtering, content-based filtering, and hybrid approaches, traditional recommendation algorithms have limitations and are no longer suitable for meeting the demands of the times. This paper proposes a new recommendation algorithm, SFRRG, that fuses structure and feature information in graph neural networks to improve the performance of the recommendation system in rating prediction. The effectiveness of the proposed algorithm is demonstrated through experiments on various data sets and compared with existing recommendation algorithms.

The increasing demand for higher power in rocket launchers is driving the development of higher power nozzles, achieved essentially by increasing the expansion ratio. However, this can lead to flow separation and resulting unsteady, asymmetrical forces, called side loads, which can limit the life of both the nozzle itself and other engine components. If this problem can be overcome, engine performance can be significantly increased. Therefore, various separation control methods have been proposed, but none have been fully implemented to date due to the uncertainties associated with modeling and predicting the flow phenomena. A numerical study of high area ratio rocket engine is presented to analyze the aeroelastic performance of the structure under the condition of flow separation. The finite volume method, the 2nd order upwind scheme and the extended wall function are used to analyze the flow inside the rocket nozzle and the transition of the Free Shock Separation (FSS) to Restricted Shock Separation (RSS) separation pattern ) to be discussed in detail. Since the location of the flow separation point depends heavily on the flow.

Background. The Stanford Health Assessment Questionnaire-Disability Index (HAQ) is widely used to measure functional ability in persons with Rheumatoid Arthritis (RA). The instrument was developed with limited involvement from persons with RA, and their perception of the instrument has not been studied in depth. The aim of this study was to explore how persons with RA experience the use of the HAQ in care. Methods. Forty persons with RA were purposefully recruited to participate in semi-structured interviews. The interviews were then analyzed qualitatively using thematic analysis. Results. The participants questioned the relevance of the HAQ but nevertheless experienced that the instrument had a profound effect on their understanding of health and how care is delivered. The analysis resulted in three themes: Problems with individual items, meaning of the summative score, and effects on care and health perceptions. Conclusions. To make the HAQ relevant to persons with RA, it needs to be revised or to include an option to select items most meaningful to the respondent. To ensure relevance, the HAQ update should preferably be co-created by researchers, clinicians and persons with RA.

The spectrums of one type of object under different conditions have the same features (up, down, protruding, concave) at the same spectral positions, which can be used as primary parameters to evaluate the difference among remotely sensed pixels. Wavelet-feature correlation ratio Markov clustering algorithm (WFCRMCA) for the remotely sensed data is proposed based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying a wavelet transform to spectral data. The correlation ratio between two samples is a statistical calculation of the matched peak point positions on the wavelet feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding the computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. Markov clustering applies several strategies, such as a simulated annealing method and gradually shrinking the clustering size, to control the clustering convergence. At each clustering tempera-ture, it can obtain the best class centers quickly. The experimental results of the Airborne Visible/ Infrared Imaging Spectrometer (AVIRIS) and Thermal Mapping (TM) data have verified its ac-ceptable clustering accuracy and high convergence velocity.

This paper presents an unsupervised feature selection method for multi-dimensional histogram-valued data. We define a multi-role measure, called the compactness, based on the concept size of given objects and/or clusters described by a fixed number of equal probability bin-rectangles. In each step of clustering, we agglomerate objects and/or clusters so as to minimize the compactness for the generated cluster. This means that the compactness plays the role of a similarity measure between objects and/or clusters to be merged. To minimize the compactness is equivalent to maximize the dis-similarity of the generated cluster, i.e., concept, against the whole concept in each step. In this sense, the compactness plays the role of cluster quality. We also show that the average compactness of each feature with respect to objects and/or clusters in several clustering steps is useful as feature effectiveness criterion. Features having small average compactness are mutually covariate, and are able to detect geometrically thin structure embedded in the given multi-dimensional histogram-valued data. We obtain thorough understandings of the given data by the visualization using dendrograms and scatter diagrams with respect to the selected informative features. We illustrate the effectiveness of the proposed method by using an artificial data set and real histogram-valued data sets.

The present grievous situation of the tuberculosis disease can be improved by efficient case management and timely follow-up evaluations. With the advent of digital technology this can be achieved by quick summarization of the patient-centric data. The aim of our study was to assess the effectiveness of the ODK Scan paper-to-digital system during testing period of three months. A sequential, explanatory mixed-method research approach was employed to elucidate technology use. Training, smartphones, application and 3G enabled SIMs were provided to the four field workers. At the beginning, baseline measures of the data management aspects were recorded and compared with endline measures to see the impact of ODK Scan. Additionally, at the end, users’ feedback was collected regarding app usability, user interface design and workflow changes. 122 patients’ records were retrieved from the server and analysed for quality. It was found that ODK Scan recognized 99.2% of multiple choice bubble responses and 79.4% of numerical digit responses correctly. However, the overall quality of the digital data was decreased in comparison to manually entered data. Using ODK Scan, a significant time reduction is observed in data aggregation and data transfer activities, however, data verification and form filling activities took more time. Interviews revealed that field workers saw value in using ODK Scan, however, they were more concerned about the time consuming aspects of the use of ODK Scan. Therefore, it is concluded that minimal disturbance in the existing workflow, continuous feedback and value additions are the important considerations for the implementing organization to ensure technology adoption and workflow improvements.

This paper presents a novel method of restoring the electron beam (EB) measurements that are degraded by linear motion blur. This is based on a Fuzzy Inference System (FIS) and Wiener inverse filter, together providing autonomy, reliability, flexibility and real-time execution. This system is capable of restoring highly degraded signals without requiring the exact knowledge of EB probe size. The FIS is formed of three inputs, eight fuzzy rules and one output. The FIS is responsible to monitor the restoration results, grade their validity and choose the one that yields to a better grade. These grades are produced autonomously by analyzing results of Wiener inverse filter. To benchmark the performance of the system, ground truth signals obtained using an 18 um wire probe are compared with the restorations. Main aims are therefore a) Provide unsupervised deblurring for device independent EB measurement; b) Improve the reliability of the process; c) Apply deblurring without knowing the probe size. These, further facilitates the deployment and manufacturing of EB probes and probe independent and accurate EB characterization. It also makes restoration of previously collected EB measurements easier, where the probe sizes are not known or recorded.

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

Hyperspectral image (HSI) classification is a mechanism of analyzing differentiated land cover in remotely sensed hyperspectral images. In the last two decades, a number of different types of classification algorithms have been proposed for classifying hyperspectral data. These algorithms include supervised as well as unsupervised methods. Each of these algorithms has its own limitations. In this research, three different types of unsupervised classification methods are used to classify different datasets i-e Pavia Center, Pavia University, Cuprite, Moffett Field. The main objective is to assess the performance of all three classifiers K-Means, Spectral Matching, and Abundance Mapping, and observing their applicability on different datasets. This research also includes spectral feature extraction for hyperspectral datasets.

Unsupervised metric learning has been generally studied as a byproduct of dimensionality reduction or manifold learning techniques. Manifold learning techniques like Diusion maps, Laplacian eigenmaps has a special property that embedded space is Euclidean. Although laplacian eigenmaps can provide us with some (dis)similarity information it does not provide with a metric which can further be used on out-of-sample data. On other hand supervised metric learning technique like ITML which can learn a metric needs labeled data for learning. In this work propose methods for incremental unsupervised metric learning. In rst approach Laplacian eigenmaps is used along with Information Theoretic Metric Learning(ITML) to form an unsupervised metric learning method. We rst project data into a low dimensional manifold using Laplacian eigenmaps, in embedded space we use euclidean distance to get an idea of similarity between points. If euclidean distance between points in embedded space is below a threshold t₁ value we consider them as similar points and if it is greater than a certain threshold t₂ we consider them as dissimilar points. Using this we collect a batch of similar and dissimilar points which are then used as a constraints for ITML algorithm and learn a metric. To prove this concept we have tested our approach on various UCI machine learning datasets. In second approach we propose Incremental Diusion Maps by updating SVD in a batch-wise manner.

Modular steel buildings (MSBs) interlocking inter-module connections (IMCs) have piqued researchers’ interest. However, the existing literature has not yet studied the optimisation of its plate thicknesses. This paper, therefore, focuses on optimising interlocking (IMCs) plate thickness in (MSBs), leveraging previous experimental and numerical simulation methodologies. Various numerical models for four MSBs interlocking (IMCs) with plate thicknesses (4 mm, 6 mm, 10 mm, and 12 mm) were developed under compression loading conditions. The study’s novelty lay in its comprehensive parametric analysis, which evaluated the slip phenomenon in (MSBs) connections and introduced a slip prediction model validated against empirical data. Further innovative machine learning approach was utilised to predict slip values based on applied force through a random forest regression model trained using the 'Treebagger' function. Sensitivity analysis and comparisons with alternative methods were utilised to underscore the reliability and applicability of the findings. The results showed that 11.03 mm was the optimal plate thickness for interlocking (IMCs) in modular steel buildings, with up to 8.08% reduced material costs. Increasing plate thickness boosts its deformation resistance by up to 50.75%. ‘TreeBagger’ random forest for anomaly detection and machine learning improves slip prediction up to 7% at higher force levels.

Characterization of flying insects in-situ measurement using remote sensing spectroscopy is an emerging research field. Also, most analysis techniques in remote sensing spectroscopy are based on the use of an intensity threshold which introduces indeterminacies in the number of detected specimens. In this manuscript, we investigated the possibility of analysing passive remote sensing spectroscopy measurement data using the maximum noise fraction method. The results obtained show that this analysis technique can help to overcome the measurement of background noise in spectroscopic measurements.

Ligand-based virtual screening (LBVS) is a promising approach for rapid and low-cost screening of potentially bioactive molecules in the early stage of drug discovery. Compared with traditional similarity-based machine learning methods, deep learning frameworks for LBVS can more effectively extract high-order molecule structure representations from molecular fingerprints or structures. However, the 3D conformation of a molecule largely influences its bioactivity and physical properties, and has rarely been considered in previous deep learning-based LBVS methods. Moreover, the relative bioactivity benchmark dataset is still lacking. To address these issues, we introduce a novel end-to-end deep learning architecture trained from molecular conformers for LBVS. We first extracted molecule conformers from multiple public molecular bioactivity data and consolidated them into a large-scale bioactivity benchmark dataset, which totally includes millions of endpoints and molecules corresponding to 954 targets. Then, we devised a deep learning-based LBVS called EquiVS to learn molecule representations from conformers for bioactivity prediction. Specifically, graph convolutional network (GCN) and equivariant graph neural network (EGNN) are sequentially stacked to learn high-order molecule-level and conformer-level representations, followed by attention-based deep multiple-instance learning (MIL) to aggregate these representations and then predict the potential bioactivity for the query molecule on a given target. We conducted various experiments to validate the data quality of our benchmark dataset, and confirmed EquiVS achieved better performance compared with 10 traditional machine learning or deep learning-based LBVS methods. Further ablation studies demonstrate the significant contribution of molecular conformation for bioactivity prediction, as well as the reasonability and non-redundancy of deep learning architecture in EquiVS. Finally, a model interpretation case study on CDK2 shows the potential of EquiVS in optimal conformer discovery. The overall study shows that our proposed benchmark dataset and EquiVS method have promising prospects in virtual screening applications.

Convolutional neural networks (CNN) have attracted much attention as a commonly used method for hyperspectral image (HSI) classification in recent years, however, CNNs can only be applied to Euclidean data and have limitations in dealing with relationships due to the limitations of local feature extraction. However, each pixel of a hyperspectral image contains a set of spectral bands that are correlated and interact with each other, and the methods used to process Euclidean data cannot effectively obtain these correlations. In contrast, the graph convolutional network (GCN) can be used in non-Euclidean data, but usually leads to oversmoothing and ignoring local detail features due to the need for superpixel segmentation processing to reduce computational effort. To overcome the above problems, we constructed a network a fusion network based on GCN and CNN, which contains two branches: a graph convolutional network based on superpixel segmentation and a convolutional network with added attention mechanism. The graph convolu-tional branch can extract the structural features and capture the relationships between the nodes, and the convolutional branch can extract the detailed features in the local fine region. Owing to the fact that the features extracted from the two branches are different, the classification performance can be improved by fusing the complementary features extracted from the two branches. To vali-date the proposed algorithm, experiments were conducted on three widely used datasets, namely Indian Pines, Pavia University, and Salinas, and the overall accuracy of 98.78% was obtained in the Indian Pines dataset, and the overall accuracy of 98.99% and 98.69% was obtained in the other two datasets. The results showed that the proposed fusion network can obtain richer features and achieve high classification accuracy.

We propose a novel unsupervised semantic segmentation method for fast and accurate flood area detection utilizing color images acquired from Unmanned Aerial Vehicles (UAVs). To the best of our knowledge, this is the first fully unsupervised method for flood area segmentation in color images captured by UAVs, without the need of pre-disaster images. The proposed framework addresses the problem of flood segmentation based on parameter-free calculated masks and unsupervised image analysis techniques. First, a fully unsupervised algorithm gradually excludes areas classified as non-flood utilizing calculated masks over each component of the LAB colorspace, as well an RGB vegetation index and the detected edges of the original image. Unsupervised image analysis techniques, such as distance transform, are then applied, producing a probability map for the location of flooded areas. Finally, flood detection is obtained by applying the hysteresis thresholding segmentation. The proposed method is tested and compared with variations, and other supervised methods in two public datasets, consisting of 953 color images in total, yielding high-performance results, with 87.4% and 80.9% overall accuracy and F1-Score, respectively. The results and computational efficiency of the proposed method show that it is suitable for on board data execution and decision-making during UAVs flight.

Coastal marine ecosystems worldwide, like Florida Bay, are increasingly affected by tide alteration and anthropogenic disturbances which affect water quality imbalance leading to algal blooms. Increased bloom persistence is a serious threat due to the long-lasting impact on processes like carbon cycle and services like species presence. However, exploring eco-environmental feedback patterns of algal blooms remains challenging and poorly investigated, also due to the paucity of data. Florida Bay, taken as an epitome, has long experienced algal blooms in its central and western regions, and in 2006 an unprecedented bloom occurred in the eastern habitats. We analyzed the occurrence of blooms from three perspectives: (1) the spatial spreading networks of chlorophyll-a (CHLa) that pinpoints source and unbalanced habitats; (2) the fluctuations of water quality factors pre- and post-bloom outbreaks to in assess environmental impacts of ecological dysbiosis and target prevention and control of algal of blooms; and (3) the biogeochemical-spreading network topological co-evolution to quantify ecosystemic stability and ecological shift likelihood in long-term. Here, we propose Transfer Entropy (TE) to quantify dynamical interactions between spatial areas and biogeochemical factors (ecosystem connectome) underpinning bloom emergence and spreading, as well as environmental effects; the Pareto principle is defined for identifying the salient eco-environmental interactions of CHLa. We quantified the spatial dynamics of algal blooms, and thus obtained areas in need for ecological monitoring and potential bloom control. Results show that algal blooms are increasingly persistent over space with long-term negative effects on water quality factor. A dichotomy is reported between spatial ecological corridors of spreading and biogeochemical networks as well as divergence from the optimal eco-organization: randomization of the former due to nutrients' overload and temperature increase leads to scale-free CHLa spreading and extreme outbreaks a posteriori. Subsequently this increases bloom persistence, turbidity and salinity with potentially strong ecological effects on highly biodiverse and vulnerable areas such as tidal flats and marshes. Algal blooms are important ecosystem regulators of nutrient cycles; however, beyond limit chlorophyll-a outbreaks cause aquatic species mortality due to their effect on water turbidity, nutrient balance (nitrogen and phosphorus in particular), salinity and temperature. Beyond compromising local environmental quality, socio-ecological services are also compromised at large scales, yet ecological assessment models like the one presented are in need of application in subtropical and tropical bays worldwide.

Background. Gene rearrangements affecting KMT2A are frequent in acute myeloid leukemia (AML) and are often associated with a poor prognosis. KMT2A gene fusions are often detected by chromosome banding analysis and confirmed by fluorescence in-situ hybridization. However, small intragenic insertions, termed KMT2A partial tandem duplication (PTD), are particularly challenging to detect using standard molecular and cytogenetic approaches. Methods. We have validated the use of a custom hybrid capture based next-generation sequencing (NGS) panel for comprehensive profiling of AML patients seen at our institution. This NGS panel targets the entire consensus coding DNA sequence of KMT2A; to deduce the presence of a PTD we used the relative ratio of KMT2A exons coverage. We sought to corroborate the KMT2A-PTD NGS results using (1) multiplex-ligation probe amplification (MLPA) and (2) optical genome mapping (OGM). Results. We analyzed 932 AML cases and identified 41 individuals harboring a KMT2A-PTD. MLPA, NGS and OGM confirmed the presence of a KMT2A-PTD in 22 of the cases analyzed where orthogonal testing was possible. Two false positive PTD calls by NGS could be explained by the presence of cryptic structural variants impacting KMT2A and interfering with PTD analysis. OGM revealed the nature of these previously undetected gene rearrangements in KMT2A, while MLPA yielded in-conclusive results. MLPA analysis for KMT2A-PTD is limited to exon 4, whereas NGS and OGM resolved KMT2A-PTD sizes and copy number levels. Conclusion. KMT2A-PTDs are complex gene rearrangements that cannot be fully ascertained using a single genomic platform. MLPA, NGS panels and OGM are complementary technologies applied in standard of care testing for AML patients. MLPA and NGS panels are designed for targeted copy number analysis; however, our results show that integration of concurrent genomic alterations is needed for accurate KMT2A-PTD identification. Unbalanced chromosomal rearrangements overlapping with KMT2A can interfere with the diagnostic sensitivity and specificity of copy number based KMT2A-PTD detection methodologies.

Parasomnias are a group of sleep disorders characterized by abnormal and unpleasant motor, verbal or behavioral events that occur during sleep or during transitions between wake and sleep states. They disrupt sleep and can have a detrimental impact on the individual experiencing them. Our goal was to identify types of parasomnias and their prevalence in the post-secondary student population and to explore students' coping strategies for parasomnias they found distressing. Seventy-seven post-secondary students completed the 21-item Munich Parasomnia Screening (MUPS) frequency scale. They also rated, on a 10-point scale, how disturbing each parasomnia was. Not only did 92% percent of students report at least one parasomnia, but our results also indicate that the vast majority of students experienced more than one parasomnia. This led us to investigate the likelihood of the co-occurrence of different parasomnias. With respect to the level of subjectively experienced distress, the most prevalent parasomnias were not always the more disturbing ones. Coded open-ended responses about what students do about the disturbing parasomnias indicate that grounding strategies and physical manipulation of one’s body were the most common, although most participants indicated that in spite of distress, they do nothing to cope. In conclusion, our study found a strikingly high prevalence of parasomnias in this sample of young adults and a lack of knowledge about effective means of dealing with these.

Selecting road networks in cartographic generalization has consistently posed formidable challenges, driving research towards the application of intelligent models. Despite previous efforts, the accuracy and connectivity preservation in these studies, particularly when dealing with road types of similar sample sizes, still warrant improvement. To address these shortcomings, we introduce a Heterogeneous Graph Attention Network (HAN) for road selection, where feature masking method is initially utilized to assess the significance of road features. Concentrating on the most relevant features, two meta-paths are introduced within the HAN framework: one for aggregating features of the same road type within the first-order neighborhood, emphasizing local connectivity, and another extending this aggregation to the second-order neighborhood, capturing a broader spatial context. For a comprehensive evaluation, we introduce a set of metrics considering both quantitative and qualitative aspects of the road network. Compared to traditional neural networks, our HAN model demonstrates superior accuracy and F1-score, particularly for road types with comparable samples. Additionally, it enhances the overall connectivity of the selected network. In summary, our HAN-based method provides an advanced solution for road network selection, surpassing previous approaches in terms of accuracy and connectivity preservation.

：Non-Euclidean data, such as social networks, and citation relationships between documents, has node information and structural information. Graph Convolutional Network(GCN) can automatically learn node features and association information between nodes. The core ideology of the graph convolutional network is to aggregate node information by using edge information, thereby generating a new node feature. In the process of updating node features, there are two core influencing factors. One is the number of neighboring nodes of the central node, the other is the contribution of the neighboring nodes to the central node. Due to the previous GCN methods not simultaneously considering the numbers and different contributions of neighboring nodes to the central node, we design the Adaptive Attention Mechanism(AAM). To further enhance the representational capability of the model, we utilize Multi-Head Graph Convolution(MHGC). Finally, we adopt cross-entropy(CE) loss function to describe the difference between the predicted results of node categories and the ground truth (GT). Combined with backpropagation, this ultimately achieves accurate node classification. Based on AAM, MHGC and CE, we contrive the novel Graph Adaptive Attention Network (GAAN). Experiments show that the classification accuracy has achieved outstanding performances on Cora, Citeseer and Pubmed datasets.

Estimating parameters for multiple datasets can be time consuming, especially when the number of datasets is large. One solution is to sample from multiple datasets simultaneously using Bayesian methods such as adaptive multiple importance sampling (AMIS). Here we use the AMIS approach to fit a von Misses distribution to multiple datasets for wind trajectories derived from a Lagrangian Particle Dispersion Model driven from a 3D meteorological data. The primary objective is to characterise the uncertainties in wind trajectories in a form that can be used as inputs for predictive models of wind-dispersed insect pests and pathogens of agricultural crops for use in evaluating risk and in planning mitigation actions. Our results show that AMIS can significantly improve the efficiency of parameter inference for multiple datasets.

Deep learning heavily relies on statistical correlations to drive artificial intelligence (AI) innovations, particularly in computer vision applications like autonomous driving and robotics. However, despite providing a solid foundation for deep learning, these statistical correlations can be vulnerable to unforeseen and uncontrolled factors. The lack of prior knowledge guidance can result in spurious correlations, introducing confounding factors and affecting the model's robustness. To address this challenge, recent research efforts have focused on integrating causal theory into deep learning methodologies. By modelling the inherent and unbiased causal structure, causal theory can potentially mitigate the impact of spurious correlations effectively. Hence, this paper explores the basics of causal methodologies in image classification.

This research aims to determine the similarities in groups of people to build a film recommender system for users. Users often have difficulty in finding suitable movies due to the increasing amount of movie information. The recommender system is very useful for helping customers choose a preferred movie with the existing features. In this study, the recommender system development is established by using several algorithms to obtain groupings, such as the K-Means algorithm, birch algorithm, mini-batch K-Means algorithm, mean-shift algorithm, affinity propagation algorithm, agglomerative clustering algorithm, and spectral clustering algorithm. We propose methods optimizing K so that each cluster may not significantly increase variance. We are limited to using groupings based on Genre and, Tags for movies. This research can discover better methods for evaluating clustering algorithms. To verify the quality of the recommender system, we adopted the mean square error (MSE), such as the Dunn Matrix and Cluster Validity Indices, and social network analysis (SNA), such as Degree Centrality, Closeness Centrality, and Betweenness Centrality. We also used Average Similarity, Computational Time, Association Rule with Apriori algorithm, and Clustering Performance Evaluation as evaluation measures to compare method performance of recommender systems using Silhouette Coefficient, Calinski-Harabaz Index, and Davies-Bouldin Index.

Classical methods for inverse problems are mainly based on regularization theory. In particular those which are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond, respectively, to the likelihood and prior probability models.

Attribute reduction is a core technique in the rough set domain and an important step in data preprocessing. Researchers have proposed numerous innovative methods to enhance the capability of attribute reduction, such as the emergence of multi-granularity rough set models, which can effectively process distributed and multi-granularity data. However, these innovative methods still have many shortcomings, such as how to deal with complex constraints and how to perform multi-angle effectiveness evaluations. Based on the multi-granularity model, this study proposes a new method of attribute reduction, namely using multi-granularity neighborhood information gain ratio as the measurement criterion. This method combines both supervised and unsupervised perspectives, and by integrating multi-granularity technology with neighborhood rough set theory, constructs a model that can adapt to multi-level data features. This model can select the optimal granularity level or attribute set according to the requirements. Finally, the proposed method is experimented with on 15 UCI datasets against six other attribute reduction algorithms. The experimental outcomes, upon analysis and comparative review, substantiate the reliability and consistency of the attribute reduction approach introduced in this study.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved by machines, which still poses challenges in natural language processing and computer vision. Significant progress promotes existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to the poor effect of the theorem prediction and affect the accuracy in problem solving. In this paper, the formal language graph is constructed by the extracted formal language set and used to theorem prediction by graph convolutional network. So as to better extract the relationship set of diagram elements, an improved diagram parser was proposed. The test results indicate that the improved method has good results in solving the problem with interpretability geometry.

Healthcare professionals constantly face situations that reflect ecosystems’ degradation. These can negatively affect their mental health. Research suggests that hope and resilience can play an important role in this scenario, since they are related to/predict mental health in highly heterogeneous samples (considering geography, age, profession, health, etc.). In this context, the aims of the present study are: to characterize and explore the relationship between hope, resilient coping and mental health of Portuguese healthcare professionals. Using Google Forms, 276 healthcare professionals answered to the GHQ-28, the (adult) Trait Hope Scale, and the Brief Resilient Coping Scale (cross-sectional study). The minimum and maximum possible scores were reached, with the exception of the maximum score of GHQ-28-Total. Regarding Hope, 19.6% scored below the midpoint (M=43.46, SD=11.97); 29.3% revealed low resilience (M=14.93, SD=4.05); and the average of 4 of the 5 Mental Health scores (exception: Severe Depression) indicates the probability of a psychiatric case. Hope correlated with Social Dysfunction and GHQ-28-Total; resilient coping proved to be a (weak) predictor of 4 of the 5 GHQ-28 indicators (exception: Severe depression). The results support the need to promote the sample's mental health, hope and resilient coping. They also suggest that stimulating resilient coping may contribute to improving healthcare professionals’ mental health.

Graph neural networks (GNNs) build on the success of deep learning models by extending them for use in graph spaces. Transfer learning has proven extremely successful for traditional deep learning problems: resulting in faster training and improved performance. Despite the increasing interest in GNNs and their use cases, there is little research on their transferability. This research demonstrates that transfer learning is effective with GNNs, and describes how source tasks and the choice of GNN impact the ability to learn generalisable knowledge. We perform experiments using real-world and synthetic data within the contexts of node classification and graph classification. To this end, we also provide a general methodology for transfer learning experimentation and present a novel algorithm for generating synthetic graph classification tasks. We compare the performance of GCN, GraphSAGE and GIN across both the synthetic and real-world datasets. Our results demonstrate empirically that GNNs with inductive operations yield statistically significantly improved transfer. Further we show that similarity in community structure between source and target tasks support statistically significant improvements in transfer over and above the use of only the node attributes.

The graph model enables a broad range of analysis, thus graph processing is an invaluable tool in data analytics. At the heart of every graph processing system lies a concurrent graph data structure that stores the graph. Such a data structure needs to be highly efficient for both graph algorithms and queries. Due to the continuous evolution, the sparsity, and the scale-free nature of real-world graphs, graph processing systems face the challenge of providing an appropriate graph data structure that enables both fast analytical workloads and low-memory fast graph mutations. Existing graph structures offer a hard tradeoff between read-only performance, update friendliness, and memory consumption upon updates. In this paper, we introduce CSR++, a new graph data structure that removes these tradeoffs and enables both fast read-only analytics and quick and memory-friendly mutations. CSR++ combines ideas from CSR, the fastest read-only data structure, and adjacency lists to achieve the best of both worlds. We compare CSR++ to CSR, adjacency lists from the Boost Graph Library, as well as state-of-the-art update-friendly graph structures: LLAMA, STINGER, GraphOne, and Teseo. In our evaluation, which is based on popular graph processing algorithms executed over real-world graphs, we show that CSR++ remains close to CSR in read-only concurrent performance (within 10% on average), while significantly outperforming CSR (by an order of magnitude) and LLAMA (by almost 2×) with frequent updates. We also show that both CSR++’s update throughput and analytics performance exceed that of several state-of-the-art graph structures, while maintaining low memory consumption when the workload includes updates.

One of the most important sources of energy is the sun. Taiwan is located at north 22-25° latitude. Due to its proximity to the equator, it experiences only a small angle of sunlight incidence. Its unique geographical location which can obtain sustainable and stable solar resources. This study takes research on the forecast of solar radiation to maximize the benefits of solar power generation, and develops methods that can predict the future solar radiation pattern to help reduce the costs of solar power generation. This study builds supervised machine learning models, known as deep neural network (DNN) and long short-term memory neural network (LSTM). The hybrid supervised and unsupervised model, namely cluster-based artificial neural network (k-means clustering and fuzzy C-means clustering-based models), was developed. After establishing these models, the study evaluated their prediction results. For different prediction periods, the study selected the best-performing model based on the results and proposed combining them to establish a real-time updated solar radiation forecast system capable of predicting the next 12 hours. The study area covered Kaohsiung, Hualien, and Penghu in Taiwan. Data from ground stations of the Central Weather Administration, collected between 1993 and 2021, as well as the solar angle parameters of each station, were used as input data for the model. The results of this study show that different models have their advantages and disadvantages in predicting different future times. Therefore, the hybrid prediction system can predict future solar radiation more accurately than a single model.

The prediction of system degradation is very important as it serves as an important basis for the formulation of condition-based maintenance strategies. An effective health indicator (HI) plays a key role in the prediction of system degradation as it enables vital information for critical tasks ranging from fault diagnosis to remaining useful life prediction. To address this issue, a method for monitoring data fusion and health indicator construction based on autoencoder (AE) and long short-term memory (LSTM) network is proposed to improve the predictability and effectiveness of health indicator in this study. Firstly, an unsupervised method and overall framework for HI construction is built based on deep autoencoder and LSTM neural network. The neural network is trained fully based on the normal operating monitoring data and then the construction error of the AE model is adopted as the health indicator of the system. Secondly, we propose related machine learning techniques for monitoring data processing to overcome the issue of data fusion, like mutual information for sensor selection and t-distributed stochastic neighbor embedding (T-SNE) for operating condition identification, etc. Thirdly, in order to verify the performance of the proposed method, experiments are conducted based on CMAPSS dataset and results are compared with algorithms of principal component analysis (PCA) and vanilla autoencoder model. Result shows that LSTM-AE model outperforms the PCA and Vanilla-AE model in metrics of monotonicity, trendability, prognosability and fitness. Fourthly, in order to analyze the impact of the time step of the LSMT-AE model on HI construction, we construct and analyze the system HI curve under different time steps of 5, 10, 15, 20, and 25 cycles. Finally, the results demonstrate that the proposed method for HI construction can effectively characterize the health state of system, which is helpful for further failure prognostics and converting the scheduled maintenance into condition-based maintenance.

In recent years, Edge Intelligence (EI) has emerged, combining edge computing with AI, specifically deep learning, to run AI algorithms directly on edge devices. In practical applications, EI faces challenges related to computational power, power consumption, size, and cost, with the primary challenge being the trade-off between computational power and power consumption. This has rendered traditional computing platforms unsustainable, making heterogeneous parallel computing platforms a crucial pathway for implementing EI. In our research, we leveraged the Xilinx Zynq 7000 heterogeneous computing platform, employed High-Level Synthesis (HLS) for design, and implemented two different accelerators for LeNet-5 using loop unrolling and pipelining optimization techniques. The experimental results show that when running at a clock speed of 100 MHz, the PIPELINE accelerator, compared to the UNROLL accelerator, experiences an 8.09% increase in power consumption but speeds up by 14.972 times, making the PIPELINE accelerator superior in performance. Compared to the CPU, the PIPELINE accelerator reduces power consumption by 91.37% and speeds up by 70.387 times, while compared to the GPU, it reduces power consumption by 93.35%.This study provides two different optimization schemes for edge intelligence applications through design and experimentation, and demonstrates the impact of different quantization methods on FPGA resource consumption. These experimental results can provide a reference for practical applications, thereby providing a reference hardware acceleration scheme for edge intelligence applications.

The research of object classification and part segmentation is a hot topic in computer vision. A considerable number of studies have been carried out about deep learning on 3D point clouds. However,it is challenging to achieve effective feature learning due to sparsity of point clouds. Recently, a variety of Transformers have been adopted to improve point cloud processing and display great potential. Nevertheless, large numbers of Transformer layers tend to incur huge computational and memory costs. PointNet++ is one of the most influential neural architectures for point cloud understanding. Although the accuracy of PointNet++ has been largely surpassed by recent networks, this does not mean that PointNet++ has no potential.Thus, this paper offer two major contributions that significantly improve PointNet++ performance. Firstly, we introduce a novel contextual feature extraction (CFE) block that significantly enhances the feature extraction capabilities of PointNet++ networks. Secondly, to further enhance feature fusion, we seamlessly integrate a mutual learning (ML) block into the network architecture. By embedding these two innovative blocks within each layer of the network, we not only enrich the network's functionality but also impart it with greater robustness and adaptability. The specific experiments were conducted on the S3DIS (6-fold cross-validation) and Modelnet40 datasets with 86.5% and 92.7% accuracy, respectively, which proved that our model is comparable or even better than most existing methods for classification and segmentation tasks.

The interest in the Spark Plasma Sintering (SPS) technique has continuously increased over the last few years. This article shows the possibility of the development of a SPS device used for material processing and synthesis both in both scientific and industrial applications. This work presents an example of processing Arc-Meleted (half-Heusler, cobalt triantimonide) and SHS-synthesized semiconductors (bismuth telluride) materials with SPS device. The system functionalities expansion is presented, showing the possible way of increasing the information amount obtained about SPS processes and using the SPS apparatus for conducting synthesis of materials and increasing reproducibility and accuracy of process parameters control.

Human action recognition (HAR) based on skeleton data is a challenging yet important technique because of its wide range of applications in many fields, including patient monitoring, security surveillance, and observing human-machine interactions. Many algorithms that attempt to distinguish between many types of activities have been proposed. However, most practical applications require highly accurate detection of specific types of activities. In this study, a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data is proposed. Furthermore, an extensive study was conducted using different modalities. For this purpose, a spatiotemporal graph autoencoder that automatically learns spatial as well as temporal patterns from human skeleton datasets was built. The powerful graph convolutional network named GA-GCN, developed in this study, notably outperforms most of the existing state-of-the-art methods based on two common datasets, namely NTU RGB+D and NTU RGB+D 120 . On the first dataset, we achieved an accuracy of 92.3% and 96.7% based on the cross-subject and cross-view evaluations, respectively. On the other more challenging dataset (i.e. NTU RGB+D 120), GA-GCN achieved 88.8% and 90.4% based on the cross-subject and cross-set evaluation, respectively.

The chemical graph theory is a subfield of mathematical chemistry which applies classic graph theory to chemical entities and phenomena. Chemical graphs are main data structures to represent chemical structures in cheminformatics. Computable properties of graphs lay the foundation for (quantitative) structure activity and structure property predictions - a core discipline of cheminformatics. It has a historic relevance for natural sciences, such as chemistry, biochemistry and biology, and is in the heart of modern disciplines, such as cheminformatics and bioinformatics. This review first covers the history of chemical graph theory, then provides an overview of its various techniques and applications for CASE, and finally summarises modern tools using chemical graph theory for CASE.

With advances in next-generation sequencing(NGS) technologies, large number of multiple types of high-throughput genomics data are available. A great challenge in exploring cancer mechanism is to identify the driver genes from the mutation genes by analyzing and integrating multi-types genomics data. Breast cancer is known as a heterogeneous disease. The identification of subtype-specific driver genes is critical to guide the diagnosis, assessment of prognosis and treatment of breast cancer. We developed an integrated frame based on gene expression profilings and copy number variation(CNV) data to identify breast cancer subtype-specific driver genes. In this frame, we employed statistical machine-learning method to select gene subsets and utilized an module-network analysis method to identify potential candidate driver genes. The final subtype-specific driver genes were acquired by paired-wise comparison in subtypes. To validate specificity of the driver genes, the gene expression data of these genes were applied to classify the patient samples with 10-fold cross validation and the enrichment analysis were also conducted on the identified driver genes. The experimental results show that the proposed integrative method can identify the potential driver genes and the classifier with these genes acquired better performance than with genes identified by other methods.

With the rapid development of Internet of Things (IoT)-based near-earth remote sensing technology, the problem of network intrusion for near-earth remote sensing systems has become more complex and large-scale. Therefore, it is essential to seek an intelligent, automated, and robust network intrusion detection method. In recent years, network intrusion detection methods based on graph neural networks (GNNs) have been proposed. However, there are still some practical issues with these methods. For example, they have not taken into consideration the characteristics of near-earth remote sensing systems, the state of the nodes, and the temporal features. Therefore, this article analyzes the characteristics of existing near-earth remote sensing systems and proposes a spatio-temporal graph attention network (N-STGAT) that considers the state of nodes. The proposed network applies spatiotemporal graph neural networks to the network intrusion detection of near-earth remote sensing systems and validates the effectiveness of the proposed method on the latest flow-based dataset.

In this paper, we delve into the realm of aspect-level sentiment analysis, a sophisticated analytical task focused on pinpointing and interpreting the sentiment directed towards specific elements within a sentence. Traditional methods in this domain, primarily based on neural networks, have often overlooked the critical role of syntactic structures in sentences. To bridge this gap, we have developed the Syntax-Enhanced Sentiment Graph Network (SentiSyn). This pioneering model represents a significant step forward in aspect-level sentiment analysis, bringing to the forefront the utilization of word dependency relationships to enrich sentiment analysis. SentiSyn stands out by its innovative use of a dependency graph, a tool that meticulously maps out the intricate web of syntactic relationships surrounding a target aspect in a sentence. This approach allows SentiSyn to effectively capture and channel sentiment-related characteristics that are deeply rooted in the syntactic context of the aspect target. By doing so, SentiSyn unlocks a deeper understanding of sentiment dynamics in textual content, enabling a more nuanced and accurate sentiment analysis. Our comprehensive experimental evaluation of SentiSyn showcases its remarkable capabilities. When combined with advanced embedding techniques like GloVe and BERT, SentiSyn demonstrates a superior performance edge over several existing sentiment analysis methods. This performance leap is not just incremental; it represents a significant enhancement in the field of sentiment analysis, underscoring the importance of syntactic context in understanding sentiments. Furthermore, our analysis delves into how SentiSyn effectively leverages these embeddings to gain a more profound and contextually rich insight into sentiment dynamics. The results from our tests indicate that SentiSyn, with its unique approach to integrating syntactic structures and advanced embeddings, sets a new benchmark in aspect-level sentiment analysis, offering both enhanced accuracy and deeper sentiment understanding.

In recent years, weeds is responsible for most of the agricultural yield losses. To deal with this threat, farmers resort to spraying pesticides throughout the field. Such method not only requires huge quantities of herbicides but impact environment and humans health. One way to reduce the cost and environmental impact is to allocate the right doses of herbicide at the right place and at the right time (Precision Agriculture). Nowadays, Unmanned Aerial Vehicle (UAV) is becoming an interesting acquisition system for weeds localization and management due to its ability to obtain the images of the entire agricultural field with a very high spatial resolution and at low cost. Despite the important advances in UAV acquisition systems, automatic weeds detection remains a challenging problem because of its strong similarity with the crops. Recently Deep Learning approach has shown impressive results in different complex classification problem. However, this approach needs a certain amount of training data but, creating large agricultural datasets with pixel-level annotations by expert is an extremely time consuming task. In this paper, we propose a novel fully automatic learning method using Convolutional Neuronal Networks (CNNs) with unsupervised training dataset collection for weeds detection from UAV images. The proposed method consists in three main phases. First we automatically detect the crop lines and using them to identify the interline weeds. In the second phase, interline weeds are used to constitute the training dataset. Finally, we performed CNNs on this dataset to build a model able to detect the crop and weeds in the images. The results obtained are comparable to the traditional supervised training data labeling. The accuracy gaps are 1.5% in the spinach field and 6% in the bean field.

This paper proposes an innovative mechatronic piezo-actuated module to control vibrations in modern machine tools. Vibrations represent one of the main issues that compromise seriously the quality of the workpiece. The active vibration control (AVC) device is composed by a host part integrated with sensors and actuators synchronized by a regulator, able to make a self-assessment and adjust to the environmental alteration. This study presents the mechatronic model based on the kinematic and dynamic analysis of the AVC device. To ensure a real time performance, a H2-LQG controller has been developed and validated by simulations involving machine tool, PZT actuator and controller models. The Hardware-in-the-loop (HIL) architecture is adopted to control and attenuate the vibrations. A set of experimental tests has been performed to validate the AVC module on a commercial machine tool. The feasibility of the real time vibration damping is demonstrated and the simulation accuracy is evaluated.

To address the challenge of recognizing ship states accurately amidst the complexities of marine environments, this study proposes a novel ship state recognition approach leveraging a graph convolutional neural network (GCNN). Initially, the method extracts canonical and efficient ship motion trajectories from AIS data. Subsequently, a state recognition network tailored for ship motion trajectories is devised and implemented employing graph convolution. Notably, the accuracy of this model is enhanced through the introduction of novel weights and optimization of the Adj parameter. Experimental evaluations conducted on a ship state dataset demonstrate significant performance improvements. Specifically, the proposed recognition network achieves a recognition accuracy of 98.3% for regulated ship trajectories, marking an impressive 8.4% enhancement over traditional convolutional neural networks. This advancement holds promise for enhancing ship state recognition accuracy across diverse maritime applications including maritime supervision, navigation safety, and ship management.

Mechanical equipment is composed of several parts, the interaction between the parts exists throughout whole life cycle leads to the widespread phenomenon of fault coupling and the diagnosis of independent faults cannot meet the requirements of the health management of mechanical equipment under actual working conditions. In this paper, the topological structure of graph neural network is used to describe the correlation of coupling faults and multiple fault types are regarded as network nodes respectively. The fault features are fused and extracted by graph convolution to achieve the classification of coupling faults. In this paper, dynamic vertexes are defined in data topology and the parameters of DIGNN classification model are optimized by changing the fault type of dynamic vertexes during training stage. The data is loaded into dynamic vertexes for classification and analysis during testing stage. The one-dimensional vibration data is converted into two-dimensional time-frequency domain data by wavelet transform making the input features of the model interpretable to reduce the uncertainty of model training. The data topology is then fed into DIGNN for fault classification, and GCN's node aggregation gives interpretability to each layer of network data processing. The method proposed in this paper can realize accurate diagnosis of independent faults on the data set, and can effectively judge the coupling mode of coupling faults, which is suitable for coupling fault analysis of mechanical equipment.

There is a considerable amount of research in online social networks, most of which focuses on the structural analysis of social graphs. The interpersonal relationships of social networks, especially friend circle, can solve the cold start and sparsity problems, and through the relationship between social networks can effectively recommend users' favorite items (items), such as music , videos, brands/products, preferred tags, location, services, etc. User relationships in social networks are diverse and there are many different perspectives on different social networks. Associations among users can form multi-layered composite networks, and multi-layered social networks present new challenges and opportunities. Different relationships can influence users' preferences to different degrees, which in turn affects their behavior. Therefore, fusing multiple social networks is an effective way to improve recommendation. Although some studies have started to address multiple social network recommendations, simple linear superposition cannot reflect the coupling and nonlinear association between multiple social networks. In this paper, we propose a graph neural network recommendation model under social relationships based on this background. We first propose to compute the 2nd order collaborative signals and their intensities directly from the neighboring matrix for updating the node embedding of the graph convolution layer. Secondly by embedding historical evaluations, various social networks constituting different dimensions, the attention integration of user preferences by different social networks is achieved, and its effectiveness and scalability are demonstrated in theoretical derivation and experimental validation. The theoretical derivation and experimental validation demonstrate its effectiveness and scalability.

A modern binary executable is a composition of various networks. Control flow graphs are commonly used to represent an executable program in labeled datasets used for classification tasks. Control flow and term representations are widely adopted, but provide only a partial view of program semantics. This study is an empirical analysis of the networks composing malicious binaries in order to provide a complete representation of the structural properties of a program. This is accomplished by the measurement of structural properties of program networks in a malicious binary executable dataset. We demonstrate the presence of Scale-Free properties of network structure for program data dependency and control flow graphs, and show that data dependency graphs also have Small-World structural properties. We show that program data dependency graphs have a degree correlation that is structurally disassortative, and that control flow graphs have a neutral degree assortativity, indicating the use of random graphs to model the structural properties of program control flow graphs would show increased accuracy. By providing an increase in feature resolution within labeled datasets of executable programs we provide a quantitative basis to interpret the results of classifiers trained on CFG graph features. An increase in feature resolution allows for the structural properties of program classes to be analyzed for patterns as well as their component parts. By capturing a complete picture of program graphs we can enable theoretical solutions for the mapping a program's operational semantics to its structure.

The study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model, incorporating Graph Masked Autoencoders. This approach integrates textual information with graph connectivity evidence, resulting in a more sophisticated model of citation distribution. By training a deep network using partial data and reconstructing masked connections, the method leverages the inherent characteristics of central connections under network perturbations. Quantitative evaluations demonstrate its remarkable ability to pinpoint trustworthy citations in the analyzed data and raise concerns about potentially unreliable references due to potential manipulation.

Global Earth Observation (EO) is becoming increasingly important in understanding and addressing critical aspects of life on our planet about environmental issues, natural disasters, sustainable development and others. EO plays a key role in making informed decisions on applying or reforming land use, responding to disasters, shaping climate adaptation policies etc. EO is also becoming a useful tool for helping professionals make the most profitable decisions, e.g., in real estate or the investment sector. Finding similarities in landscapes may provide useful information regarding applying contiguous policies, taking alike decisions or learning from best practices on events and happenings that have already occurred in similar landscapes in the past. However, current applications of similar landscape retrieval are limited by moderate performance and the need for time-consuming and costly annotations. We propose splitting the similar landscape retrieval task into a set of smaller tasks that aim at identifying individual concepts inherent to satellite images. Our approach relies on several models trained with Unsupervised Representation Learning (URL) on Google Earth images to identify these concepts. We show the efficacy of matching individual concepts for tackling the task of retrieving similar landscape(s) to a user-selected satellite image with a proof-of-concept application of the proposed approach on the geographical territory of the Republic of Cyprus. Our results demonstrate the efficacy of breaking up the landscape similarity task into individual concepts closely related to remote sensing instead of trying to capture all concepts and image semantics with a single model like a single RGB semantics model.

Background and Objectives: Knee osteoarthritis (KOA) is a degenerative disease that is targeting continuously people of different ages, but especially the elderly population, the number of which tends to increase continuously at the global level. Apart from age, excess weight can influence the evolution of the disease, with obesity being associated with a weak inflammation stage, and an imbalance between pro-inflammatory and anti-inflammatory cytokines. The present work aimed to identify specific biomarkers alike ACRP-30, IL-10, TNF-α, and IL-6 in synovial fluid and correlate them with patients’ clinical data. Materials and Methods: 24 subjects with KOA and over 50 years of age are involved in the present study. All patients performed a supine X-ray at the target knee. Ultrasound was performed using an ESAOTE MyLab Omega (ESAOTE Spa, Italy) ultrasound device and a 6-19 MHz linear array transducer. Results: The obtained results highlighted a significant correlation between age and adiponectin level (p=0.0451, r=-0.412). Also, the IL-10 values are lower in cases where the intensity of the pain is more pronounced (p=0.0405, r=-0.421). In addition, analyzing the data by gender, it was observed that in the case of males, stiffness is more related to age (p=0.0079, r=0.7993), compared to women (p=0.0203, r=0.6223). In the case of women, the progression of the disease tends to increase more intensively total WOMAC score’s values (p=0.00031, r=0.8342), compared with men (p=0.0289, r=7013). Regarding interleukins and BMI, significant correlations were observed only in the case of men. Conclusions: A significant correlation between age and adiponectin, and adiponectin and IL-6, suggests that advanced age may contribute to adiponectin reduction. Comparing men with women, it was observed that men's age is more related to rigidity, and IL-6 and IL-10 are directly correlated to BMI and women seem to be more sensitive to pain and stiffness.

Underwater visual detection technology plays a pivotal role in fields such as marine exploration. With the increasing demand for underwater monitoring, the quest for efficient and reliable methods for underwater target recognition has become particularly significant. To address this requirement, this study developed an innovative underwater object detection architecture based on YOLOv8, named YOLOv8-MU, aimed at significantly enhancing detection accuracy.By integrating the LarK module proposed in UniRepLKNet to optimize the backbone network, YOLOv8-MU aims to achieve a larger receptive field without increasing the model’s depth. Further, this research introduces C2fSTR, an innovative method that combines Swin Transformer with the C2f module. Additionally, we have incorporated the SPPFCSPC_EMA module, which combines Cross-Stage Partial Fast Spatial Pyramid Pooling (SPPFCSPC) with attention mechanisms, significantly improving the detection accuracy and robustness of various biological targets. Moreover, by introducing a fusion block based on DAMO-YOLO into the neck of the model, we further enhanced the model’s capability in multi-scale feature extraction. Finally, the adoption of the MPDIoU loss function, designed around vertex distance, effectively tackles the challenges of localization accuracy and boundary clarity in underwater organism detection. Experimental results on the URPC2019 dataset demonstrate that the YOLOv8-MU model achieved an [email protected] of 78.4%, marking improvements of 5.6%, 1.1%, and 4.0% over YOLOv5s, YOLOv7, and YOLOv8n respectively, indicating the leading performance (SOTA) of this method. On the other hand, further evaluation on the URPC2020 dataset confirmed the generalization capability of the YOLOv8-MU architecture, with its [email protected] reaching 80.4%, surpassing various models including YOLOv5x and YOLOv8n, showcasing the wide applicability of our proposed improved model architecture.

This work presents significant results obtained by the application of global optimization techniques to the design of finite, normal form games with mixed strategies. To that end, the Fuzzy ASA global optimization method is applied to several design examples of strategic games, demonstrating its effectiveness in obtaining payoff functions whose corresponding games present a previously established Nash equilibrium. In other words, the game designer becomes able to choose a convenient Nash equilibrium for a generic finite state strategic game and the proposed method computes payoff functions that will realize the desired equilibrium, making it possible for the players to reach the favorable conditions represented by the chosen equilibrium. Considering that game theory is a very significant approach for modeling interactions between competing agents, and Nash equilibrium represents a powerful solution concept, portraying situations in which joint strategies are optimal in the sense that players cannot benefit from individually modifying their current strategies provided that other players do not change their strategies as well, it is natural to infer that the proposed method may be very useful for strategists in general. In summary, it is a genuine instance of artificial inference of payoff functions after a process of global machine learning, applied to their numerical components.

In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams-Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

The diffusion of molecules in aqueous solutions in the domain of membrane technology is very critical in the efficiency of chemical engineering and purification processes. In this study, the diffusion in high and low concentration regions is simulated with finite difference method (FDM), and then the results of numerical computations are coupled with adaptive network-based fuzzy inference system (ANFIS) and bilayered neural network method (BNNM). Machine learning approach can individually predict diffusion phenomena across the domain based on understanding of the machine instead of the discretization of an ordinary differential equation (ODE). The findings of the machine learning method are in good agreement with those of FDM at different times of the simulation. In addition to numerical computation, the error of the system is computed for different iterations. The results show that by increasing the number of iterations and training datasets, all errors reduce significantly for both training and testing. BNN method is also used to train the prediction process of diffusion for a more accurate comparison. This technique is similar to ANFIS method in terms of prediction capability. According to the findings, ANFIS approach predicts diffusion slightly better than BNN method. In this regard, ANFIS technique produces R>0.99 while BNN method produces R around 0.98. Both machine learning methods are accurate enough to predict diffusion throughout the domain for different time steps. The computational time for both algorithms is less than that of FDM method to predict low and high concentrations in the domain. Besides, based on the results, artificial intelligence (AI) can find the relationship between inputs and outputs and determine which input has the main influence on the output in this study to optimize the process. As such, future studies can be focused on AI and other methods for faster prediction and optimization processes.

In Lagrangian dynamics, the detection of coherent clusters can help understand the organization of transport by identifying regions with coherent trajectory patterns. Many clustering algorithms, however, rely on user-input parameters, requiring a priori knowledge about the flow and making the outcome subjective. Building on the conventional spectral clustering method of Hadjighasem et al (2016), a new parameter-free spectral clustering approach is developed that automatically identifies parameters and does not require any user-input choices. A noise-based metric for quantifying the coherence of the resulting coherent clusters is also introduced. The parameter-free spectral clustering is applied to two benchmark analytical flows, the Bickley Jet and the asymmetric Duffing oscillator, and to a realistic, numerically-generated oceanic coastal flow. In the latter case, the identified model-based clusters are tested using observed trajectories of real drifters. In all examples, our approach succeeded in performing the partition of the domain into coherent clusters with minimal inter-cluster similarity and maximum intra-cluster similarity. For the coastal flow, the resulting coherent clusters are qualitatively similar over the same phase of the tide on different days and even different years, whereas coherent clusters for the opposite tidal phase are qualitatively different.

Human keratinocytes and melanoma can stick together to form clusters after eight days in co-culture. As in dynamic system concepts, one can consider cluster formation as the system attractor, cell seeding as the initial condition, and density change over time as a path within the basin of attraction. Herein, Cellular Automata, which is a class of Agent-Based Models, and Boolean Networks are discrete modeling methods used in population dynamics such that running the dynamics of cellular automata backward reveals an underlying network in terms of basin of attraction, also known as global dynamics. Thus, we hypothesize that one can estimate the local dynamic of an agent-based model from the basin of attraction of a boolean network. Here, we propose an approach to estimating these agent-based model rules, which consists of comparing the density states within each state transition and reaching a consensus among state transitions belonging to a basin of attraction of a boolean network. The objectives of this study are: (1) to infer a boolean network from the co-culture growth curve; (2) to estimate the rules of agent-based models; and (3) to implement spatial dynamics simulations. The binarization of the growth curve shows high population density after four days; the estimated agent-based model rules were compatible with cell proliferation and migration in agreement with literature, so we had to propose individual rules for survival and death. Spatial dynamics shows that (1) keratinocytes exhibit a higher density in neighborhoods where melanoma is present; (2) the chance of keratinocyte migration increases until the fourth day, then decreases, and the probability of survival increases substantially after four days; and (3) cells with low proliferation capacity die and free space for those with high ones. Our approach suggests that the attractor state of cell co-culture is induced mainly by an increase in keratinocyte migration and survival. Our approach has the potential to offer valuable clues about microenvironmental interactions or configurations that drive population dynamics.

This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. Especially, we generalize the concept generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct for any graph operation expression a corresponding derived graph operation in any graph algebra.

Reliable quantification of pulmonary arterial pressure is essential in the diagnostic and prognostic assessment of a range of cardiovascular pathologies including rheumatic heart disease, yet an accurate and routinely available method for its quantification remains elusive. This work proposes an approach to infer pulmonary arterial pressure based on scientific machine learning techniques and non-invasive, clinically available measurements. A 0-D multicompartment model of the cardiovascular system was optimized using several optimization algorithms, subject to forward-mode automatic differentiation. Measurement data were synthesized from known parameters to represent the healthy, mitral regurgitant, aortic stenosed and combined valvular disease situations with and without pulmonary hypertension. Eleven model parameters were selected for optimization based on 95 % explained variation in mean pulmonary arterial pressure. A hybrid Adam and limited-memory Broyden-Fletcher-Goldfarb-Shanno optimizer yielded the best results with input data including valvular flow rates, heart chamber volume changes and systematic arterial pressure. Mean absolute percentage errors ranged from 1.8 % to 3.78 % over the simulated test cases. The model was able to capture pressure dynamics under hypertensive conditions with pulmonary arterial systole, diastole, and mean pressure average percentage errors of 1.12 %, 2.49 % and 2.14 %, respectively. The relatively low errors highlight the potential of the proposed model to recover pulmonary pressures for diseased heart valve and pulmonary hypertensive conditions.

For Convolutional Neural Network (CNN), Depthwise Separable CNN (DSCNN) is a preferred architecture for Application Specific Integrated Circuit (ASIC) implementation on edge devices. It can benefit from a multi-mode approximate multiplier proposed in this work. The proposed approximate multiplier uses two 4-bit multiplication operations to implement a 12-bit multiplication operation by reusing the same multiplier array. With this approximate multiplier, sequential multiplication operations are pipelined in a modified DSCNN to fully utilize the PE array in the convolutional layer. This Approximate (A-DSCNN) was implemented on TSMC 40-nm CMOS process with a supply voltage of 0.9 V. At the clock frequency of 200 MHz, the design achieves 4.78 GOPs/mW while occupying 1.24 mm x 1.24 mm silicon area. Compared to conventional DSCNN implemented in a similar process node, the chip area and power consumption were reduced by 53% and 25%, while the throughput was improved by 17%.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

Public transportation scheduling aims to optimize the allocation of transportation resources, enhance transportation efficiency, and increase passenger satisfaction, which is crucial for building a sustainable urban transportation system. As a complement to public transportation, shared bikes provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, such as peak usage periods in the morning and evening and significant fluctuations in demand across different areas, the optimization of shared bike dispatch can better meet user needs, thereby reducing vehicle vacancy rates and increasing operating revenue. Addressing this issue, this paper designs a comprehensive decision-making approach for spatio-temporal demand prediction and bike dispatch optimization. For demand prediction, we designed a T-GCN based bike demand prediction model. In terms of dispatch optimization, we considered factors such as dispatch capacity, distance restrictions, and dispatch costs, and designed an optimization solution based on genetic algorithms. Finally, this paper validates the approach using shared bike operating data, shows that T-GCN can effectively predict short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution verifying the model’s effectiveness. The shared bike dispatch approach proposed in this paper, which combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.

The purpose of this study is to analyze the self-regulated learning and the ability to write scientific papers of students after learning with the Project-Based Digital Science Module (DSM). This research is a mixed methods by analyzing quantitatively and qualitatively. The research instrument used to obtain data is using a product assessment sheet and a self-regulated learning questionnaire. Data analysis uses N-Gain to determine the increase in self-regulated learning scores and student scientific writing skills scores, and uses linear regression analysis to determine the effect of self-regulated learning on student scientific writing skills. The results obtained showed N-Gain score of learning independent is 0,65 and scientific writing ability is 0,94, then significant’s score from linear regression by using SPSS is 0,22 < 0,05. This result showed an increase in self-regulated learning and the ability to write scientific papers of students on each indicator after learning using the Project-Based Digital Science Module (DSM). In addition, based on the results of data analysis, it can be seen that there is an influence of self-regulated learning on the ability to write scientific papers of students after learning using the Project-Based Digital Science Module.

An important indicator of human-related pollution in watersheds is dissolved oxygen (DO). The DO is highly dependent on both space and time characteristics of the watershed and is directly linked to eutrophication, which impairs the development of both the aquatic fauna and flora, also negatively impacting the water quality. Aspiring to reach a more accurate and precise forecasting approach to predict levels of DO, the present work proposes new graph-based and transformer-based deep learning models. The models were trained and validated for the Credit River Watershed, and the results were compared with both benchmarking and literature-found approaches. The proposed Graph Neural Network Sample and Aggregate (GNN-SAGE) model was the best-performing approach, reaching coefficient of determination (R2) and Root Mean Squared Error (RMSE) values of 97% and 0.34 ppm, respectively. The findings from the Shapley additive explanations (SHAP) indicated that the GNN-SAGE benefited from spatiotemporal information from the surrounding stations, improving the model’s results, and that temperature is a major input attribute for determining future DO levels. The results established that the proposed GNN-SAGE model stands as a state-of-the-art solution for DO forecasting, with potential for real-time water quality applications.

With the improvement of software copyright protection awareness, code obfuscation technology plays a crucial role in protecting key code segments. As the obfuscation technology becomes more and more complex and diverse, it has spawned a large number of malware variants, which make it easy to evade the detection of anti-virus software. Malicious code detection mainly depends on binary code similarity analysis. However, the existing software analysis technologies are difficult to deal with the growing complex obfuscation technologies. To solve this problem, this paper proposes a new obfuscation-resilient program analysis method, which is based on the data flow transformation relationship of the intermediate representation and the graph network model. In our approach, we first construct the data transformation graph based on LLVM IR. Then, we design a novel intermediate language representation model based on graph networks, named DFSGraph, to learn the data flow semantics from DTG. DFSGraph can detect the similarity of obfuscated code by extracting the semantic information of program data flow without deobfuscation. Extensive experiments prove that our approach is more accurate than existing deobfuscation tools when searching for similar functions from obfuscated code.

In this work, we propose a self-supervised multi-agent system that meets the online learning of clustering tasks for video behavior recognition spatio-temporal tasks. Encoding visual behavioral actions as discrete temporal sequence(DTS). Real-time clustering recognition task in a multi-agent system for continuous model building, training, and correction. Finally, we implemented a fully decentralized multi-agent system and completed its feasibility verification in a surveillance video application scenario on vehicle path clustering.

The growth rate in academic and scientific publications increased very fast. Researchers must choose a good representative and significant literature in publications, which has become challenging worldwide. Usually, the paper citation number indicates this paper's potential influence and importance. However, this standard metric of citation numbers cannot be used as a measurement to judge the popularity and significance of the recently published papers. To address this challenge, this paper presents an effective prediction method called FutureCite to predict the future citation level of research articles. FutureCite combines machine learning with text and graph mining techniques, leveraging their abilities in classification, datasets in-depth analysis, and feature extraction. FutureCite aims to predict future citation levels of research articles applying a multilabel classification approach. FutureCite can extract significant semantic features and capture the interconnection relationships found in scientific articles during feature extraction using textual content, citation networks, and metadata as feature resources. Our goal is to contribute to the advancement of substantial effective approaches impacting the citation counts in scientific publications by enhancing the precision of future citations. We conducted several experiments using a comprehensive publication dataset to evaluate our method and determine the impact of using a variety of machine learning algorithms. FutureCite demonstrated its robustness and efficiency and showed promising results based on different evaluation metrics. Using the FutureCite model has significant implications in improving the researchers' ability to determine targeted literature for their research and better understand the potential impact of research publications.

Digital twin technology is revolutionizing traditional manufacturing paradigms. In modern manufacturing systems, digital twin technology is fraught with challenges due to the scarcity of labeled data. Specifically, existing supervised machine learning algorithms, with their reliance on voluminous training data, find their applicability constrained in real-world production settings. This paper introduces an unsupervised 3D reconstruction approach tailored for industrial applications, aimed at bridging the data void in creating digital twin models. Our proposed model, by ingesting high-resolution 2D images, autonomously reconstructs precise 3D digital twin models without the need for manual annotations or prior knowledge. Through comparisons with multiple baseline models, we demonstrate the superiority of our method in terms of accuracy, speed, and generalization capabilities. This research not only offers an efficient approach to industrial 3D reconstruction but also paves the way for the widespread adoption of digital twin technology in manufacturing.

Indoor positioning based on the received signal strength (RSS) of the WiFi signal has become the most popular solution for indoor localization. In order to realize the rapid deployment of indoor localization systems, solutions based on crowdsourcing have been proposed. However, compared to conventional methods, crowdsourced RSS values are more erroneous and can result in large localization errors. To mitigate the negative effect of the erroneous measurements, a graph-based semi-supervised learning (G-SSL) method is used to exploit the correlation between the RSS values at nearby locations to estimate an optimal RSS value at each location. Before using the G-SSL method, the Linear Regression (LR) algorithm is proposed to solve the device diversity problem in crowdsourcing system. Since the spatial distribution of the APs is sparse, the Compressed Sensing (CS) method is applied to precisely estimate the location of the APs. Based on the location of the APs and a simple signal propagation model, the RSS difference between different locations is calculated and used as an additional constraint to improve the performance of G-SSL. Furthermore, to exploit the sparsity of the weights used in the G-SSL, we use the CS method to reconstruct these weights more accurately and make a further improvement on the performance of the G-SSL. Experimental results show improved results in terms of the smoothness of the radio map and the localization accuracy.

In this study we sought to investigate the impact of urbanization, presence of concrete river bottom, and nutrient pollution on microbial communities along the L.A. River. Six molecular markers were evaluated for identification of bacteria, plants, fungi, fish, and invertebrates in 90 samples. PCA (principal components analysis) was used with PAM (partitioning around medoids) clustering to reveal community structure and an NB (Negative binomial) model in DESeq2 was used for differential abundance analysis. PCA and factor analysis exposed the main axes of variation but were sensitive to outliers. Differential abundance of Proteobacteria was associated with soft bottom sites, and there was an apparent balance in the abundance of organisms responsible for nitrogen cycling. Nitrogen cycling was explained by differential abundance of ammonia oxidizing archaea, the complete ammonia oxidizers Nitrospira sp., nitrate reducing bacteria Marmoricola sp., and nitrogen fixing bacteria Devosia sp. which were differentially abundant at soft-bottom sites (p adj &lt; 0.002). In contrast, differential abundance of several Cyanobacteria and other anoxygenic phototrophs was associated with the concrete bottom sites, which suggested the accumulation of excess nitrogen. The soft bottom sites tended to be represented by differential abundance of aerobes, whereas the concrete-associated species tended to be alkaliphilic, saliniphilic, calciphilic, sulfate dependent, and anaerobic. In Glendale Narrows, downstream from multiple water reclamation plants, there were differential abundance of cyanobacteria and algae, however indicator species for low nutrient environments and ammonia-abundance were also present. There was differential abundance of ascomycetes associated with Arroyo Seco and a differential abundance of Scenedesmaceae green algae and cyanobacteria in Maywood, in the analysis which compared suburban with urban river communities. The proportion of Ascomycota to Basidiomycota within the LA River differed from the expected proportion based on published worldwide freshwater and river 18S data; the shift in community structure was most likely associated with the extremes of urbanization. This study indicates that extreme urbanization can result in overrepresentation of cyanobacterial species that could cause reductions in water quality and safety.

Three computer algorithms are presented. One reduces a network $\CALN$ to its interior, $\CALI$. Another counts all the triangles in the network, and the last randomly generates networks similar to $\CALN$ given just its interior $\CALI$. But these algorithms are not the usual numeric programs that manipulate a matrix representation of the network; they are set-based. Union and meet are essential binary operators; contained_in is the basic relational comparator. The interior $\CALI$ is shown to have desirable formal properties and to provide an effective way of revealing ``communities'' in social networks.

With the rapid development of technology and the advancement of Internet technology, various social networking platforms are gradually coming into people's view and occupying a higher and higher position. In the recommendation scenario, the user-item interaction naturally forms a bipartite heterogeneous graph structure and with the development of graph embedding and graph neural network technologies based on deep learning to process graph domain information, the combination of graph information and recommendation systems shows strong research potential and application prospects. The methodological improvement of the recommendation algorithm based on collaborative filtering takes advantage of the nature that user-items can form a bipartite graph in the recommendation scenario. The existing methods still have some shortcomings. The methods that only use weights or convolutional recurrent neural networks to implicitly model different historical behaviors lack explicit modeling of video switching relationships in serialized behaviors. The user's interest is changing all the time, so it is not possible to recommend based on the user's history, and it is necessary to consider both the long-term and short-term interest of the user according to the video content in order to achieve accurate recommendation of short videos. In this paper, we design a recommendation model based on graph neural network, which models users' long-term and short-term interests by two vector propagation methods, respectively.

The key issue in the post-genomic era is how to systematically describe the association between small molecule transcripts or translations inside cells. With the rapid development of high-throughput “omics” technologies, the achieved ability to detect and characterize molecules with other molecule targets opens up the possibility of investigating the relationships between different molecules from a global perspective. In this article, a Molecular Associations Network(MAN) is constructed and comprehensively analyzed by integrating the associations among miRNA, lncRNA, protein, drug, and disease, in which any kind of potential associations can be predicted. More specifically, each node in MAN can be represented as a vector by combining two kinds of information including the attributes of the node itself (e.g. sequences of ncRNAs and proteins, semantics of diseases and molecular fingerprints of drugs) and the manner of the node in the complex network (associations with other nodes). Random Forest classifier is trained to classify and predict new interactions or associations between biomolecules. In the experiment, the proposed method achieves a superb performance with 0.9735 AUC in 5-fold cross-validation, which show that the proposed method can provide new insight for exploration of the molecular mechanisms of disease and valuable clues for disease treatment.

Education on Innovation and Entrepreneurship (I&E) has increased in the last two decades, specially, through MOOCs. Lately, these reusable online alternatives have tended to be revalorized by HEIs into blended learning activities, posing new challenges for instructors, specially, on how to bridge prior knowledge with in-class activities. Adopting a discursive approach to knowledge, our proposal aims to meet this challenge by identifying student’s ‘representations’, i.e., patterned constructions on disciplinary knowledge. Representations can be found across different cohorts and thus further complemented by instructors. To test this assumption and build our proposal, we analysed student’s representations in two observations. We mapped students’ representations over key I&E definitions (e.g., ‘start-up’) and, to know how prior knowledge may be complemented by instructors, we identified students’ alignment with expert disciplinary knowledge. Firstly, we found that the two cohorts tended to express representations by turning attention to several dimensions, e.g., referring to different types of features or finalities associated with concepts. Secondly, the disciplinary alignment description revealed that students tended to focus on the same components present in experts’ definitions, but with a greater level of generality. Our results have been packaged into a proposal that aims to help instructors scale their blended activities.

Diabetes mellitus is a popular life-threatening disease and patients may gradually have started suffering from other diabetes-causing diseases such as heart attacks, stroke, hypertension, blurry vision, blindness, foot ulcer, amputation, kidney damage and other organ failures before diagnosis. Early detection can help reduce the fatality of this disease. Deep learning models have proven very useful in disease detection and computer-aided diagnosis. In this work, we proposed a deep unsupervised machine learning model for early detection of diabetes using voting ensemble feature selection and deep belief neural networks (DBN). Dataset was obtained from an online repository containing responses of prediagnosed patients to direct questionnaires administered in Sylhet Diabetes Hospital in Sylhet, Bangladesh. The dataset was preprocessed and preprocessed. Features were reduced using the ensemble feature selector. The DBN model was pretrained and tuned to obtain optimal performance. The model was also compared with other models with no multiple hidden layers. The DBN performed at its relative best with F1-measure, precision and recall of 1.00, 0.92 and 1.00 respectively. We conclude that DBN is a useful tool for an unsupervised early prediction of Type II diabetes mellitus.

Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph. For this purpose, regular graph is considered so the internal relation and external relation on this new graph are studied. The kind of having same number of edges when this number is originated by common number of graphs like maximum degree, minimum degree, domination number, coloring number and clique number, is founded in the word of having regular graph

Myocarditis is the form of an inflammation of the middle layer of the heart wall which is caused by a viral infection and can affect the heart muscle and its electrical system. It has remained as one of the most challenging diagnoses in cardiology. Myocardial is the prime cause of unexpected death in approximately 20% of adults less than 40 years of age. Cardiac MRI (CMR) has been considered as a noninvasive and golden standard diagnostic tool for suspected myocarditis and plays an indispensable role in diagnosing various cardiac diseases. However, the performance of CMR is heavily dependent on the clinical presentation and non-specific features such as chest pain, arrhythmia, and heart failure. Besides, other imaging factors like artifacts, technical errors, pulse sequence, acquisition parameters, contrast agent dose, and more importantly qualitatively visual interpretation can affect the result of the diagnosis. This paper introduces a new deep learning-based model called Convolutional Neural Network-Clustering (CNN-KCL) to diagnose the Myocarditis. The hybrid CNN-KCL method performs the early and accurate diagnosis of Myocarditis. To the best-of-our-knowledge, a Convolutional neural network has never been used before for the diagnosis of Myocarditis. In this study, we used 47 subjects to diagnose myocarditis patients from Tehran's Omid Hospital. The total number of data examined is 10425. Our results demonstrate that CNN-KCL achieves 92.3% in terms of diagnosis myocarditis prediction accuracy which is significantly better than those reported in previous studies.

As Heterogeneous Wireless Sensor Network (HWSN) fulfill the requirements of researchers in the design of real life application to resolve the issues of unattended problem. But, the main constraint face by researchers is energy source available with sensor nodes. To prolong the life of sensor nodes and hence HWSN, it is necessary to design energy efficient operational schemes. One of the most suitable routing scheme is clustering approach, which improves stability and hence enhances performance parameters of HWSN. A novel solution proposed in this article is to design energy efficient clustering protocol for HWSN, to enhance performance parameters by EECPEP-HWSN. Propose protocol is designed with three level nodes namely normal, advance and super node respectively. In clustering process, for selection of cluster head we consider three parameters available with sensor node at run time, i.e., initial energy, hop count and residual energy. This protocol enhance the energy efficiency of HWSN, it improves performance parameters in the form of enhance energy remain in the network, force to enhance stability period, prolong lifetime and hence higher throughput. It is been found that proposed protocol outperforms than LEACH, DEEC and SEP with about 188, 150 and 141 percent respectively.

Following the adoption of the Kunming-Montreal Global Biodiversity Framework (KM-GBF), with the Convention on Biological Diversity serving as its guiding treaty, the European Union (EU) has just reached an agreement on an EU Nature Restoration Regulation. This study carries out a systematic cross-walk between the restoration regulation and the KM-GBF, focusing on their implications for forest ecosystems. This paper identifies areas of alignment, divergence, and potential gaps related to habitat restoration, species protection, climate resilience, and the sustainable use of natural resources. The methodology adopts a grounded approach, starting with the 23 targets outlined in the KM-GBF and proceeding to the 28 articles set out in the restoration regulation. The results highlight the need for better alignment between the KM-GBF, the restoration regulation, and other forest-relevant EU policy instruments. The study stresses the need for a coherent and integrated EU policy approach that can address the diverse challenges and policy objectives facing forests. It concludes that amendments to the restoration regulation have significantly diluted its potential impact, limiting the EU Members States accountability and ability to meet KM-GBF goals and targets. It further stresses the need for strategies that can reconcile divergent EU policy pathways, support forest management and restoration efforts, while aligning with global biodiversity objectives.

This paper presents a method to detect and classify the high impedance fault that occur in the medium voltage distribution network using discrete wavelet transform (DWT) and adaptive neuro-fuzzy inference system (ANFIS). The network is designed using Matlab software and various faults such as high impedance, symmetrical and unsymmetrical fault have been applied to study the effectiveness of the proposed ANFIS classifier method. This is achieved by training the ANFIS classifier using the features (standard deviation values) extracted from the three phase fault current signal by DWT technique for various cases of fault with different values of fault resistance in the system. The success and discrimination rate obtained for identifying and classifying the high impedance fault from the proffered method is 100% whereas the values are 66.7% and 85% respectively for conventional fuzzy based approach. The results indicate that the proposed method is more efficient to identify and discriminate the high impedance fault accurately from other power system faults in the system.

Background: Patients undergoing brain tumor resection experience changes to their neurocognitive abilities, many of which can be difficult to predict. We hypothesized that changes in brain connectivity could predict changes in neurocognitive functioning, demonstrating the potential for brain connectivity aware surgical planning to provide enhanced outcomes for patients. Methods: Patients underwent functional and diffusion MR scanning and neuropsychological testing before tumor resection and two weeks post-resection. Using this functional and diffusion imaging, we measured changes in the topology of the functional and structural graph networks, respectively. From the neuropsychological testing scores, we derived a composite score that describes a patient’s overall level of neurocognitive functioning. We then used a multiple linear regression model to test if structural and functional connectivity measures could predict changes in composite scores. Results: Twenty-one subjects completed imaging and neuropsychological evaluation both before and after surgery. The multiple linear regression model showed that changes in functional local efficiency were inversely correlated with changes in composite score (p

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

This research addresses the formidable challenge of achieving precise trajectory tracking for autonomous vehicle formations in uncertain environments. It introduces an adaptive control system tailored for autonomous vehicles, with a primary focus on ensuring prescribed performance in trajectory tracking within a leader-follower formation paradigm. The system incorporates a guidance law that allows the leader vehicle to dynamically adjust desired yaw angles and speeds for follower vehicles based on the established reference trajectory, enhancing tracking accuracy and responsiveness to environmental changes. To address practical external disturbances, the study utilizes Radial Basis Function Neural Networks (RBFNN) in conjunction with second-order filters for error approximation. This approach is further strengthened by a carefully formulated adaptive law. The innovative integration of a barrier Lyapunov function with the backstepping method significantly enhances the system’s adaptability and robustness, ensuring trajectory tracking performance meets predetermined standards. Simulation results illustrate the control system’s adept handling of various external disturbances, consistently maintaining trajectory tracking errors within predefined limits. This underscores the system’s potential to markedly enhance the operational reliability and efficiency of autonomous vehicle formations in unpredictable environmental conditions.

Numerical methods, including machine learning methods, are now actively used in the applications related to guided wave propagation. The method proposed in this study for material properties characterization is based on the algorithm of the clustering of multivariate data series obtained as a result of the application of the matrix pencil method to the experimental data. In the proposed technique, multi-objective optimization is employed to improve the accuracy of particular parameter identification. At the first stage, the computationally efficient method based on the calculation of the Fourier transform of Green's matrix is employed iteratively and the obtained solution is used for the filter construction with decreasing bandwidth, which allows us to obtain nearly noise-free classified data (with mode separation). The filter provides data separation between all guided waves in a natural way, which is needed at the second stage, where the slower method based on the minimization of the slowness residuals is applied to the data. The method might be applied for material properties identification in plates with thin coatings/interlayers, multi-layered anisotropic laminates etc.

Educational data-mining is an evolving discipline that focuses on the improvement of self-learning and adaptive methods. It is used for finding hidden patterns or intrinsic structures of educational data. In the arena of education, the heterogeneous data is involved and continuously growing in the paradigm of big-data. To extract meaningful information adaptively from big educational data, some specific data mining techniques are needed. This paper presents a clustering approach to partition students into different groups or clusters based on their learning behavior. Furthermore, personalized e-learning system architecture is also presented which detects and responds teaching contents according to the students’ learning capabilities. The primary objective includes the discovery of optimal settings, in which learners can improve their learning capabilities. Moreover, the administration can find essential hidden patterns to bring the effective reforms in the existing system. The clustering methods K-Means, K-Medoids, Density-based Spatial Clustering of Applications with Noise, Agglomerative Hierarchical Cluster Tree and Clustering by Fast Search and Finding of Density Peaks via Heat Diffusion (CFSFDP-HD) are analyzed using educational data mining. It is observed that more robust results can be achieved by the replacement of existing methods with CFSFDP-HD. The data mining techniques are equally effective to analyze the big data to make education systems vigorous.

We describe a new approach for integrating multiple views of data into a common latent space using non-negative tensor factorization (NTF). This approach, which we refer to as the "Integrated Sources Model" (ISM), consists of two main steps: embedding and analysis. In the embedding step, each view is transformed into a matrix with common non-negative components. In the analysis step, the transformed views are combined into a tensor and decomposed using NTF. Noteworthy, ISM can be extended to process multi-view data sets with missing views. We illustrate the new approach using two examples: the UCI digit dataset and a public cell type gene signatures dataset, to show that multi-view clustering of digits or marker genes by their respective cell type is better achieved with ISM than with other latent space approaches. We also show how the non-negativity and sparsity of the ISM model components enable straightforward interpretations, in contrast to latent factors of mixed signs. Finally, we present potential applications to single-cell multi-omics and spatial mapping, including spatial imaging and spatial transcriptomics, and computational biology, which are currently under evaluation. ISM relies on state-of-the-art algorithms invoked via a simple workflow implemented in a Jupyter Python notebook.

The question of molecular similarity is core in cheminformatics, and is usually assessed via a pairwise comparison based on vectors of properties or molecular fingerprints. We recently exploited variational autoencoders to embed 6M molecules in a chemical space, such that their (Euclidean) distance within the latent space so formed could be assessed within the framework of the entire molecular set. However, the standard objective function used did not seek to manipulate the latent space so as to cluster the molecules based on any perceived similarity. Using a set of some 160,000 molecules of biological relevance, we here bring together three modern elements of deep learning to create a novel and disentangled latent space, viz transformers, contrastive learning, and an embedded autoencoder. The effective dimensionality of the latent space was varied such that clear separation of individual types of molecules could be observed within individual dimensions of the latent space. The capacity of the network was such that many dimensions were not populated at all. As before, we assessed the utility of the representation by comparing clozapine with its near neighbours, and did the same for various antibiotics related to flucloxacillin. Transformers, especially when as here coupled with contrastive learning, effectively provide one-shot learning, and lead to a successful and disentangled representation of molecular latent spaces that at once uses the entire training set in their construction while allowing ‘similar’ molecules to cluster together in an effective and interpretable way.

This project designed a set of network security mechanisms for cloud applications in VANETs. At present, cloud computing is one of the government’s development priorities in the industry. We divide cloud into public, private, and hybrid clouds in this project. Vehicles or passengers can access road conditions or public transport information through the public cloud; public transportation can access current driving records and users can access relevant enterprise information on the private cloud and hybrid cloud is a combination of public and private clouds. Both cloud computing or VANETs require network and information security. At present, many researches on VANETs security only focus on message communication, and neglect information storage. Researches on cloud computing security only focus on information protection, and neglect user privacy and anonymity. This project designed a set of network and information security mechanisms in line with the requirements of Confidentiality, Authentication, Non-repudiation, Conditional Anonymity, and Conditional Untraceability. This project primarily needs to achieve the following: 1.an authentication mechanism to verify the identity of each other between the passenger and the vehicle and to verify the identity with Single Sign-On; 2. vehicle or user privacy and anonymity, which need to be able to replace the anonymous ID and related parameters for the vehicle or the user; 3. a private communication mechanism, which enables any vehicle or user to communicate privately; and 4. an information security encryption method, which can encrypt the information on a cloud server to avoid unauthorized access by internal personnel or hackers.

The fitting and modeling of skewed, complex, symmetric, and asymmetric datasets is an exciting research topic in many fields of applied sciences, notably lifetime, medical, and financial sciences. The Heavy tailed Nadarajah Haghighi model is introduced by compounding the heavy tailed family and Nadarajah Haghighi distribution in this paper. The so obtained model has three parameters accounting for the scale and shape of the distribution. The proposed distribution's fundamental characteristics such as probability density, cumulative distribution, hazard rate, and survival functions are provided, and several key statistical properties are established, and several entropy information measures are proposed. The estimation of model parameter is performed via the ML procedure. Further, different simulation experiments are conducted to demonstrate the performance of proposed estimator’s using some measure, like the average estimate, the average bias, and associated mean square error. Finally, we are applied our proposed model to analyze three different real datasets. In our illustration, we are compared the practicality of the recommended model with several well-known competing models.

Tracking temperature changes in certain geographic regions is a current task in modern research on Earth's climate changes. One of the global problems in solving this task is related to the large volume of measured data and the search for appropriate methods for effective determination of changes. The purpose of this research is to track climate temperature changes using a machine learning-based automated change detection method. The presented method includes training of a two-level structure of neural networks, with measured temperatures for a ten-year period of time for a certain geographical region. In the testing phase, the neural structure classifies measured temperatures for two three-year periods, before and after the ten-year time period, respectively, for the same geographic region. An algorithm was developed to visualize the studied regions by creating a map with their geographic coordinates. The classification results in the neural structure outputs are presented and analyzed as possible temperature changes. Suggestions for continuing and expanding the research in the future are discussed.

In the famous medieval magical manual called Picatrix, the unknown author describes the phenomenon of magic with the term nigromantia. As is well known, the original meaning of the Greek term necromantia has a more concise meaning. It is used for a special kind of divination, i.e., divination through the parts of a cadaver and the conjured spirit of the dead. Seemingly in the Picatrix, no necromantic ritual can be found; moreover, the author stresses that his main goal is pious, i.e., to find the path leading to the ultimate source of the universe, the one and only God. In my paper, I show that on some pages of the Picatrix, there are traces of divinatory practices that may be connected to the original meaning of the term nigromantia. In the third book of the manual, descriptions of some interesting rituals attributed to the pagan Sabeans of Harran and their teacher, the god Hermes can be found. During the practices, the magician involved conjured spirits of the heavenly bodies and powers as well. Because of this, by looking closely at and analyzing the given text, it is possible to piece together a complex web of necromantic and demonic divinatory rituals.

Extensive growth in the volume of irregular brain cells is known as brain tumor. Human brain is surrounded by stiff skull. There are various issues that occur due to the growth of any tumor inside this restricted space. The malignant and benign are two main categories of the brain tumor. The skull is pressurized to enlarge from inside in case of growth of any benign or malignant tumor. This tumor leads to harm in brain and it may be dangerous to life also. The brain tumor is divided into two kinds - primary or secondary. The brain tumor detection techniques have various phases. In this paper, comparative study of CNN with GLCM approach and superpixel based spectral clustering is done tumor. This work takes into account metrics like accuracy, sensitivity and specificity for drawing the comparison between both the techniques.

In contemporary construction, the prevalence of vibration serviceability issues in lightweight and slender structures has become increasingly common, owing to advancements in building materials and construction methods. While these structures often meet the criteria for ultimate limit states, they can still elicit complaints due to excessive vibrations induced by human activity. To address this challenge, the Integral Resonant Control (IRC) technique has emerged as a favored approach for actively damping vibrations in various systems. This study introduces a fresh perspective on implementing a multi-input multi-output (MIMO) IRC scheme for active vibration control (AVC) specifically tailored for pedestrian structures utilizing inertial mass actuators. Building upon a common framework and design methodology outlined in previous research, this work presents a novel application of MIMO IRC for AVC. The designed controller is rigorously tested and implemented on a laboratory floor structure to validate its efficacy.

Hepatitis C virus (HCV) is a major public health threat associated with serious clinical consequences worldwide. The WHO reports an estimated 58 million people globally living with chronic hepatitis C virus (HCV) infection, with 1.5 million new cases and over 350,000 deaths annually due to HCV-related diseases. Despite the existence of multiple diagnostic methods, the accessibility of diagnosis and treatment is often hindered across the continent by limited resources, insufficient healthcare infrastructure, and low public awareness of Hepatitis C virus Hepatitis C virus infection is a major public health concern in African countries, which have the highest prevalence rates of HCV in the world (1–26%). Egypt, African country which had the highest prevalence of Hepatitis C virus infection in the world. Its national hepatitis C elimination initiative emerges as an exemplary case of success an having screened over 60 million individuals, and treated more than 4 million, thereby markedly diminishing both the prevalence and incidence of the disease. The strategies employed by Egypt offer critical insights and adaptable frameworks for other African Countries facing analogous challenges. The Aim of this Review is to highlight the triumphs and hurdles of Egypt's approach, while also providing strategic guidance for African Countries to accelerate the journey towards the eradication of hepatitis C.