Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

Protein Contact Network (PCN) is an emerging paradigm for modelling protein structure. A common approach to interpreting such data is through network-based analyses. It has been shown that clustering analysis may discover allostery in PCN. Nevertheless Network Embedding has shown good performances in discovering hidden communities and structures in network. In this work, we compare some approaches for graph embedding with respect to some classical clustering approaches for annotating protein structures.

Network Embedding (NE) is an important method to learn the representations of network via a low-dimensional space. Conventional NE models focus on capturing the structure information and semantic information of vertices while neglecting such information for edges. In this work, we propose a novel NE model named BimoNet to capture both the structure and semantic information of edges. BimoNet is composed of two parts, i.e., the bi-mode embedding part and the deep neural network part. For bi-mode embedding part, the first mode named add-mode is used to express the entity-shared features of edges and the second mode named subtract-mode is employed to represent the entity-specific features of edges. These features actually reflect the semantic information. For deep neural network part, we firstly regard the edges in a network as nodes, and the vertices as links, which will not change the overall structure of the whole network. Then we take the nodes' adjacent matrix as the input of the deep neural network as it can obtain similar representations for nodes with similar structure. Afterwards, by jointly optimizing the objective function of these two parts, BimoNet could preserve both the semantic and structure information of edges. In experiments, we evaluate BimoNet on three real-world datasets and task of relation extraction, and BimoNet is demonstrated to outperform state-of-the-art baseline models consistently and significantly.

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.

With large-scale distributed generators (DGs) in an active distribution network (ADN), conventional load flow convergence failure is incurred by heavy power transmission. The Holomorphic Embedding Load Flow Method (HELM) has proven to be more robust than the Newton–Raphson method under heavy power transmission. At present, HELM is mainly designed for balanced transmission networks. In this study, we developed a three-phase HELM model to accommodate DGs, delta connection loads, and ZIP loads for ADN. The effectiveness and better performance of the proposed method under heavy load situations were validated using modified unbalanced IEEE 13, 34, 37, and 123 test feeders.

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.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

Nowadays, we use social networks such as Twitter, Facebook, WeChat and Weibo as means to communicate with each other and get to know others. Gradually social networks has become indispensable in our everyday life, and we cannot absolutely imagine what the daily life would be like without social networks. Through social networks, we can access friends' opinions and behaviors easily and are influenced by them in turn. Thus, an effective algorithm to find the top-K influential nodes (the problem of influence maximization) in the social network is critical for various downstream tasks such as viral marketing, anticipating natural hazards, reducing gang violence, public opinion supervision etc. Solving the problem of influence maximization in real-world propagation scenarios often involves estimating influence strength (influence probability between two nodes), which cannot directly observed. To estimate influence strength, conventional approaches propose various humanly-devised rules to extract features of user interactions, the effectiveness of which heavily depends on domain expert knowledge. Besides, they are often applicable for special scenarios or specific diffusion models. Consequently, they are difficult to be generalized into different scenarios, diffusion models and even domains. Inspired by the powerful ability of neural networks in the field of representation learning, we design a deep hierarchical network embedding model HGE to map nodes (with attributes) into latent space automatically. In general, HGE takes an attributed social network as the input for learning latent network representation of each node, incorporating hierarchical community structure, node attributes and general network structure into a unified deep generative framework. Then, with the leaned latent representation of each node, we propose a HGE-GA algorithm to predict influence strength and compute the top-K influential nodes through a greedy-based maximization algorithm. Extensive experiments on real-world attributed networks demonstrate the outstanding superiority of the proposed HGE model and HGE-GA algorithm compared with the state-of-the-art methods, verifying the effectiveness of the proposed model and algorithm.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

This paper outlines a tool developed with the purpose of creating a simple configurable emulated network environment that can be used in cyber defence exercises. Research has been conducted into the various related subject areas: cyber defence exercises, network threats, network emulation, network traffic replay, network topologies, and common network services. From this research a requirements specification was produced to encapsulate the features required to create this tool. A network, containing many of the aspects researched, was designed and implemented using Netkit-NG to act as a blueprint for the tool and to further knowledge in the construction of an emulated network. Following this the tool was developed and tested to ensure requirements were met.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

The article presents the Base Point Split (BPSplit) algorithm for generating a polygon skeleton based on sets of vector data describing lakes and rivers. A key feature of the BPSplit algorithm is that it is dependent on base points representing the source or mouth of a river or a stream. The input values of base points determine the shape of the resulting skeleton. Various skeletons can be generated with the use of different base points. Base points are applied to divide polygon boundaries into segments. Segmentation supports the selection of TIN edges inside polygons. The midpoints of selected TIN edges constitute a basis for generating a skeleton. The algorithm handles polygons with numerous holes, and it accounts for all holes. This article proposes a method for modifying a complex skeleton with numerous holes. In the discussed approach, skeleton edges that do not meet the preset criteria (e.g. that the skeleton is to be located between holes in the center of the polygon), are automatically removed. A simple algorithm for smoothing zigzag lines was proposed.

It is important to reduce the computation complexity while maintaining the accuracy of convolution neural networks. We deem it is possible to further reduce the network complexity while ensuring the accuracy. In this paper, we propose a novel feature extraction network called DSRNet which is lightweight but effective. DSRNet follows the basic ideas of stacking modules and short connection, introduces Depthwise Separable convolution and utilizes the Dilated convolution. The proposed network has fewer parameters and achieves outstanding speed. We conducted comprehensive experiments on CIFAR10, CIFAR100 and STL10 datasets, and the results showed the DSRNet has great performance improvement in terms of accuracy and speed.

Network Simulators is typically used to study services and applications in complex scenarios due to the infeasibility of deploying real testbeds. Many problems can be solved by using network simulators such as NS-3. With this in mind, the aim of this article is to introduce new NS-3 users through detailed information. It is sometimes difficult to handle by new users the traditional manuals developed by NS-3 project official website. In this article, NS-3 for communication network and Eclipse Integrated Development Environment (IDE) for powerful programming language are integrated step-by-step, explaining the main features of these open source software packages and concluding with an example simulation. Our effort is to make it easy for a beginner to be part of the NS-3 research community and to maintain an open environment of knowledge.

This paper addresses the alliance route network design problem considering uncertainty of unit transportation cost. An alliance route network is constructed based on the hub-and-spoke (HS) network , in which airlines can achieve inter-area passenger transport through their international gateways. The design problem is formulated with a robust model containing a set of uncertain cost parameters. The model is established based on the three-subscript model of the HS network. A case study collected from real-world data is used to test the proposed model. The results show that the robust solution can reduce the impact of cost uncertainty.

This paper incorporates the definition of Intrusion Detection Systems and the methodologies utilised by these systems. As well as this, this research paper also encompasses a taxonomy and a survey of IDS and the specific strategies and principles. Finally, this paper also includes a discussion amongst other authors for instance what the authors differ and agree on, along with the previously related studies.

Recently, the Integrated Air Defense System (IADS) has become vital for the defense system as the military defense system is vital for national security. Placing Integrated Air Defense System batteries among locations to protect locations assets is a crucial problem because optimal solutions are needed for interceptor missiles to intercept attacker missiles for maximizing protection of assets across locations or places. In this research, the procedures of using network algorithms along with developing several network algorithms are going to be demonstrated to develop a model for sequential development of seven network securing strategies of placing Surface to Air Missile (SAM) batteries to maximize the protection of assets across locations (based on given asset values) by generating optimal solutions through computation to destroy maximum attacker missiles by using minimum interceptor missiles with given intercept probability. This network securing strategies can be implemented not only for Integrated Air Defense System (IADS) planning but also Counter Air (CA) planning as Integrated Air Defense System (IADS) is conducted with defensive counter air supported by attack operations in offensive counter air.

Convolutional Neural Networks (CNNs) are largely hand-crafted, which leads to inefficiency in the constructed network. Various other algorithms have been proposed to address this issue, but the inefficiencies resulting from human intervention have not been addressed. Our proposed EvolveNet algorithm is a task-agnostic evolutionary search algorithm that can find optimal depth and width scales automatically in an efficient way. The optimal configurations are not found using grid search, instead evolved from an existing network. This eliminates inefficiencies that emanate from hand-crafting, thus reducing the drop in accuracy. The proposed algorithm is a framework to search through a large search space of subnetworks until a suitable configuration is found. Extensive experiments on the ImageNet dataset demonstrate the superiority of the proposed method by outperforming the state-of-the-art methods.

Model understanding is critical in many domains, particularly those involved in high-stakes decisions, i.e., medicine, criminal justice, and autonomous driving. Explainable AI (XAI) methods are essential for working with black-box models such as Convolutional Neural Networks. This paper evaluates the traffic sign classifier of Deep Neural Network (DNN) from the Programmable Systems for Intelligence in Automobiles (PRYSTINE) project for explainability. The results of explanations were further used for the CNN PRYSTINE classifier vague kernels` compression. After all, the precision of the classifier was evaluated in different pruning scenarios. The proposed classifier performance methodology was realised by creating the original traffic sign and traffic light classification and explanation code. First, the status of the kernels of the network was evaluated for explainability. For this task, the post-hoc, local, meaningful perturbation-based forward explainable method was integrated into the model to evaluate each kernel status of the network. This method enabled distinguishing high and low-impact kernels in the CNN. Second, the vague kernels of the classifier of the last layer before the fully connected layer were excluded by withdrawing them from the network. Third, the network's precision was evaluated in different kernel compression levels. It is shown that by using the XAI approach for network kernel compression, the pruning of 5% of kernels leads only to a 1% loss in traffic sign and traffic light classification precision. The proposed methodology is crucial where execution time and processing capacity prevail.

Deeper understanding of biological processes, disease mechanisms, and prospective therapeutic targets can be attained by Gene Expression Network Analysis (GENA), which offers a potent framework for revealing the intricate regulatory mechanisms controlling gene expression. GENA is a computational method used to understand the intricate interactions and relationships between the genes in a biological system. It entails using network theory, statistical analysis, and gene expression data to pinpoint functional modules, regulatory linkages, and important genes or pathways involved in a particular biological process or illness. This chapter broadly outlines the principles and practice of GENA, to an novice reader and outlines a simple method of performing a GENA using online Rice gene expression datasets available in various websites.

An earthquake is a natural event by its general definition. This natural event is a disaster that causes significant damage, loss of life, and other economic effects that will damage the state. The possibility of predicting a natural event such as an earthquake will minimize the reasons mentioned. Data collection, data processing, and data evaluation were carried out in this study. Earthquake forecasting was performed using the data and the RNN (Recurrent Neural Network) method. The study was carried out on seismic data with a magnitude of 3.0 and above belonging to Düzce Province between 1990 and 2022. In order to increase the learning potential of the method, the b and d values of the earthquake were calculated and included in the data set, except for the earthquake magnitude. The determination of earthquakes in a specific time interval in regions of Turkey, the classification of earthquake-related seismic data using artificial neural networks, and the production of predictions for the future reveal the importance of this study.

This research aims to produce a network structure in the Integrated Urban Farming Program in Bandung City to map the policy actors involved in it as an effort to support food security in the city. This research uses a mixed method with an exploratory sequential strategy involving policy actors from the government, private sector, academia, community, and mass media. To obtain the network structure in integrated urban farming to determine the most important actors, this research uses a social network analysis approach by utilizing the Gephi application. The network structure is based on four dimensions, namely centrality. The results of this study confirm that the actor who has the most connections (degree centrality), as well as the one who holds the best communication control (betweenness centrality), is Parahyangan Catholic University (Academic). While the actor who plays the most important role (eigenvector) is at the lower level of the government Sub-District and Urban Village. This research is useful for explaining the importance of the position of actors in the urban agriculture policy network which is the key to the success of a program.

The heterogeneous structure implies that a few nodes may be crucial in maintaining network structural and functional properties. Identifying these crucial nodes correctly and quickly is a primary issue as contemporarily may face the mushrooming of large-scale datasets. Besides, the ‘weight issue’ is always ignored in this field which edge weight may play a positive/negative role in contributing to the node importance in different weighted networks. This paper provides a novel algorithm, Weighted Expectation Algorithm (WEA), which aims to ensure accuracy and speed of computation by taking advantage of dynamic programming to better handle the task of large-scale networks. Additionally, the weight issue that edge weights may contribute differently is addressed by a simply quantitative definition. Two standard experiments show WEA can maintain the network structure in connectivity well (by the lowest average robustness 0.192) and identify the node importance better in the spreading function test of spreading dynamics (by the highest average Kendall’s tau-b 0.678). In addition, the time complexities of different algo-rithms are evaluated, and their time-consuming are tested, proving that WEA consumes a rela-tively short time.

The electroencephalogram (EEG) is a record of brain activity. Brain Computer Interface (BCI) technology formed by the EEG signal has become one of the hotspots at present. How to extract the feature signal of EEG is the most basic research of BCI technology. In this paper, A new method of recognizing fatigue, conscious, concentrated state of human brain is proposed by the combination of discrete wavelet transform and the neural network based on EEG signal. First of all, the law signal is preprocessed by the wavelet denoising method because the law EEG signal contains a large number of high frequency noise, which is decomposed into multi-layer high frequency signal and low frequency signal. thus, δ wave, θ wave, α wave, β wave are obtained by the wavelet transform. And then, frequency band energy of the different wave is regards as the feature signal of EEG. In the experiment, the feature signal is classified by radial basic function (RBF) and annealed chaotic competitive learning network (ACCLN). RBF and ACCLN networks are trained with 500 sets of sample data and are tested by 100 sets of samples in different mental states. The experimental results show that the average accuracy of RBF network under three conditions are 88.75%, 88.25%, 88.5%, respectively, and the correct rate of ACCLN network is 97%, 98%, 98%, respectively.

Although neural network architectures are critical for their performance, how the structural characteristics of a neural network affect its performance has still not been fully explored. We here map architectures of neural network to directed acyclic graphs, and find that incoherence, a structural characteristic to measure the order of directed acyclic graphs, is a good indicator for the performance of corresponding neural networks. Therefore we propose a deep isotropic neural network architecture by folding a chain of same blocks then connecting the blocks with skip connections at different distances. Our models, named FoldNet, have two distinguishing features compared with traditional residual neural netowrks. First, the distances between block pairs connected by skip connections increase from always equal to one to specially selected different values, which lead to more incoherent graphs and let the neural network explore larger receptive fields and thus enhance its multi-scale representation ability. Second, the number of direct paths increases from one to multiple, which leads to a larger proportion of shorter paths and thus improve the direct propagation of information throughout the entire network. Image classification results on CIFAR-10 and Tiny ImageNet benchmarks suggested that our new network architecture performs better than traditional residual neural networks.

A convolutional neural network (CNN) is sometimes understood as a black box in the sense that while it can approximate any function, studying its structure will not give us any insights into the nature of the function being approximated. In other terms, the discriminative ability does not reveal much about the latent representation of a network. This research aims to establish a framework for interpreting the CNNs by profiling them in terms of interpretable visual concepts and verifying them by means of Integrated Gradient. We also ask the question, "Do different input classes have a relationship or are they unrelated?" For instance, could there be an overlapping set of highly active neurons to identify different classes? Could there be a set of neurons that are useful for one input class whereas misleading for a different one? Intuition answers these questions positively, implying the existence of a structured set of neurons inclined to a particular class. Knowing this structure has significant values; it provides a principled way for identifying redundancies across the classes. Here the interpretability profiling has been done by evaluating the correspondence between individual hidden neurons and a set of human-understandable visual semantic concepts. We also propose an integrated gradient-based class-specific relevance mapping approach that takes the spatial position of the region of interest in the input image. Our relevance score verifies the interpretability scores in terms of neurons tuned to a particular concept/class. Further, we perform network ablation and measure the performance of the network based on our approach.

Medical Trust-Network is one of the most promising fields of study in network science. Establishment of trust within medical entities ensures better treatment and increases better medical facilities. The word ‘Trust’ signifies a very important behavioral aspect between any human entities, especially among doctors and patients. To represent such relationships Trust Network Models are built to express the interactions between human entities within such networks. Though the idea of a Trust-Network has traditionally been one of the major areas of research, yet the concept of a medical trust network model is relatively a new domain. In this paper, we introduce an overall multilayered Trust Network to represent the entire healthcare architecture. More specifically our model is based on an evolutionary graph system with a discrete relationship between the three most important entities of any healthcare system, namely – Doctors, Departments, and Hospitals. Observations indicate that based on our model, the medical healthcare system is a multilayered model unlike a feed-forward model as indicated by previous studies.

With the fast development of the mobile Internet, the online platforms of social networks have rapidly been developing for the purpose of making friends, sharing information, etc. In these online platforms, users being related to each other forms social networks. Literature reviews have shown that social networks have community structure. Through the studies of community structure, the characteristics and functions of networks structure and the dynamical evolution mechanism of networks can be used for predicting user behaviours and controlling information dissemination. Therefore, this study proposes a deep community detection method which includes (1) matrix reconstruction method, (2) spatial feature extraction method and (3) community detection method. The original adjacency matrix in social network is reconstructed based on the opinion leader and nearer neighbors for obtaining spatial proximity matrix. The spatial eigenvector of reconstructed adjacency matrix can be extracted by an auto-encoder based on convolution neural network for the improvement of modularity. In experiments, four open datasets of practical social networks were selected to evaluate the proposed method, and the experimental results show that the proposed deep community detection method obtained higher modularity than other methods. Therefore, the proposed deep community detection method can effectively detect high quality communities in social networks.

In this perspective article, we ponder topographical enhancements of artificial neural networks. In our recent paper in JMLR, we proved a quasi-equivalence between the network width and depth and also discussed the power of intra-links, which can be viewed as network height. In 1982, Hopfield published a network to model human associative memory, which contains many loops for dynamic evolution toward fixed points. Based on noising-denoising loops, diffusion models are recently developed to enable Bayesian modeling and inference with big data. Furthermore, we envision development of multi-AI-agent systems through “netware” engineering as a quantum leap of software engineering for emergent behaviors and autonomous AI at individual and population levels. We believe that the novel use of links and loops in space and time via multi-scale coupling would catalyze the next-generation neural networks.

Phylostratigraphic analysis is a way to look anew on phylogenetic data in the evolutionary aspect. It allows counting the evolutionary age based on the analysis of genes, their orthologs and finding the last common ancestor. We performed phylostratigraphic analysis of Arabidopsis thaliana genes associated with several types of abiotic stresses (heat, cold, water-related, light, osmotic, salt, and oxidative) determined by the Gene Ontology annotation. Comparison of the distributions of ages of genes associated with stresses of different type has shown the heat stress to involve older genes while the light stress – younger genes. At the same time, all types of stress are characterized by a significantly higher proportion of old genes (common to all eukaryotes) compared to the whole set of A.thaliana genes. This can be explained by the involvement of basic molecular processes in plant cells into the stress response. Reconstruction and graphical analysis of the gene network of the heat stress educed several clusters associated with different response functions. Some of these clusters contain only ancient genes. The results obtained show that the phylostratigraphic analysis reveals the fundamental features of the organization of gene networks and their evolution.

Dyslipidemia (Dys) is a disease characterised by abnormally high levels of lipids in the 1 blood. It causes the deposits of lipids on the arterial wall, leading to the insurgence of atherosclerosis, 2 i.e. the increased thickness of arterial walls, which finally increases the risk of cardiovascular diseases. 3 Dyslipidemia is as comorbidity of Type 2 Diabetes Mellitus (T2DM). A set of genes has been associated 4 with dyslipidemia, but examining the regulation of such genes in age and sex is still an open research 5 field. In this study, starting from publicly available databases, we select genes associated with 6 dyslipidemia and we analyse their basal level changes by means of age and sex. Also studying the 7 networks associated to the genes, we identify the rewiring changes showing that there exists a set of 8 genes whose expression changes with age in: artery tibial, artery aorta and blood. Finally, we report 9 about changes associated to gender atributes in the extracted data

Dyslipidemia (Dys) is a disease characterised by abnormally high levels of lipids in the blood. It causes the deposits of lipids on the arterial wall leading to the insurgence of atherosclerosis, i.e. the increased thickness of arterial walls, which finally increases the risk of cardiovascular diseases. Dyslipidemia is a comorbidity of Type 2 Diabetes Mellitus (T2DM). A set of genes has been associated with dyslipidemia, but examining the regulation of such genes in age and sex is still an open research field. In this study, we select from publicly available databases the genes associated with dyslipidemia and analyse changes in the basal level of such genes by age and sex. Moreover, we also distinct differential rewiring of the related gene association network in males and females. Our results show that there exist a set of genes whose expression changes with age in artery tibial, artery aorta and blood. Moreover, there exist significant differences between sex.

Several effective online and offline inference tools offer an interactive platform for inference, visualization, and analysis of gene regulatory networks. However, a tool currently needs to offer a scalable, lightweight, integrated online platform for carrying out inference, visualization, benchmarking, and extensive network analysis in an integrated manner. We introduce NetRA (Network Reconstruction and Analysis for Gene Regulatory Network), a comprehensive web tool for network analysis, visualization, and inference of large expression networks. Additionally, a platform for benchmarking and evaluation is provided. In order to deliver a highly scalable, lightweight, and rich user interface, the tool is created using the most recent technologies. We incorporate the original code of eleven (11) inference algorithms (not limited to) from Bioconductor in the current version. We also report a qualitative comparison of 11 candidate methods regarding prediction accuracy and network characteristics which will shed light on their performance against 4000 sizes synthetic DREAM network. We believe the tool will significantly aid biologists' downstream system biology research. NetRA tool can be extensible to different kinds of complex network analyses. Availability: On request (sroy01@cus.ac.in).

Keywords: Convolutional Neural Network, Deep Learning, Skin cancer, Generative Adversarial Network

Scientific social networking sites like Researchgate or Academia.edu have become part of the work practice of academic researchers. These digital platforms have been designed precisely to encourage the exchange of knowledge between scholars and to help the expansion of collaborative networks among them. Even if studies on this topic have multiplied in recent years, there is a dearth of research on the actual impact of these platforms on scientific production. The goal of this study is to investigate the relation between the attitude of researchers towards scientific social networks and the use of knowledge in their scientific work. Data from users of the scientific social networking site Researchgate were collected. A total of 143 valid responses were received and structural equation modeling was applied for data analysis. Findings of this study confirmed that researchers use knowledge obtained from scientific social networking sites both incorporating it within their research products and to acquire new competences. In particular approaching the platform as a scientific community with a shared language and a shared vision was found to have a positive impact on knowledge use. To the best knowledge of the authors this is the first study investigating the actual use of knowledge from scientific social networking sites by academic researchers. Results help to understand the impact of these platforms on the work practice of a strategic sector like scientific research.

Animal-focused research has been crucial for scientific advancement however, in this matter, rodents are still taking a starring role. Coming out from merely being supportive of evidence found in rodents, the use of fish models has slowly taken a more central role and expanded its overall contributions in areas such as social sciences, evolution, physiology, and recently in translational medical research. In neurosciences, zebrafish has been widely adopted, contributing to our understanding of the genetic control of brain processes, and the effects of pharmacological manipulations. However, discussion continues regarding the paradox of function versus structure, when fish and mammals are compared, and on the potentially evolutionarily conserved nature of behaviour across fish species. From the behavioural stand point we explored aversive/stress and social behaviour in selected fish models, and refer to the extensive contributions of stress and monoaminergic systems. We suggest that, in spite of marked neuroanatomical differences between fish and mammals, stress and sociality are conserved at the behavioural and molecular levels. We also suggest that stress and sociality are mediated by monoamines in predictable and non-trivial ways, and that monoamines could “bridge” the relationship between stress and social behaviour. To reconcile the level of divergence with the level of similarity, we need neuroanatomical, pharmacological, behavioural, and ecological studies conducted in the laboratory and in nature. These areas need to add to each other to enhance our understanding of fish behaviour and ultimately how this all may translate to better model systems for translational studies.

Speech Emotion Recognition (SER) is an interesting and difficult problem to handle. In this paper, we deal with it through the implementation of deep learning networks. We have designed and implemented six different deep learning networks, a Deep Belief Network (DBN), a simple deep neural network (SDNN), a LSTM network (LSTM), a LSTM network with the addition of an attention mechanism (LSTM-ATN), a Convolutional neural network (CNN), and a Convolutional neural network with the addition of an attention mechanism (CNN-ATN), having in mind, apart from solving the SER problem, to test the impact of attention mechanism to the results. Dropout and Batch Normalization techniques are also used to improve the generalization ability (prevention of overfitting) of the models as well as to speed up the training process. The Surrey Audio-Visual Expressed Emotion database (SAVEE), and the Ryerson Audio-Visual Database (RAVDESS) database were used for training and evaluation of our models. The results showed that networks with the addition of the attention mechanism did better than the others. Furthermore, they showed that CNN-ATN was the best among tested networks, achieving an accuracy of 74% for the SAVEE and 77% for the RAVDESS dataset, and exceeded existing state-of-the-art systems for the same datasets.

Deep learning methods have been widely used in PolSAR image classification. To learn the polarimetric information, many deep learning methods expect to learn high-level semantic features from original PolSAR data. However, only original data cannot learn multiple scattering features and complex structures for extremely heterogeneous terrain objects. In addition, deep learning methods always cause edge confusion due to the high-level features. To overcome these shortages, we propose a double-channel CNN network combined with an edge-preserving MRF model(DCCNN-MRF) for PolSAR image classification. Firstly, to combine complex matrix data and multiple scattering features together, a double-channel convolution network(DCCNN) is developed, which consists of a Wishart-based complex matrix and multi-feature subnetworks. The Wishart-based complex matrix network can learn the statistical characteristics and channel correlation well, and the multi-feature network can learn high-level semantic features well. Then, a unified network framework is designed to fuse two kinds of features to enhance advantageous features and reduce redundant ones. Finally, an edge preserving MRF model is designed to combine with the DCCNN network. In the MRF model, a sketch map-based edge energy function is designed by defining adaptive weighted neighborhood for edge pixels. Experiments are conducted on four real PolSAR data sets with different sensors and bands. Experimental results demonstrate the effectiveness of the proposed DCCNN-MRF method.

Computer-aided image diagnostics (CAD) have been used in many fields of diagnostic medicine. It relies heavily on classical computer vision and artificial intelligence. Quantum neural network (QNN) has been introduced by many researchers around the world and presented recently by research corporations such as Microsoft, Google, and IBM. In this paper, the investigation of the validity of using the QNN algorithm for machine-based breast cancer detection was performed. To validate the learnability of the QNN, a series of learnability tests were performed alongside with classical convolutional neural network (CCNN). QNN is built using the Cirq library to perform the assimilation of quantum computation on classical computers. Series of investigations were performed to study the learnability characteristics of QNN and CCNN under the same computational conditions. The comparison was performed for real Mammogram data sets. The investigations showed success in terms of recognizing the data and training. Our work shows better performance of QNN in terms of successfully training and producing a valid model for smaller data set compared to CCNN.

Recently, with the rapid advancement of the 4th Industrial Revolution, there has been a continuous outlook that Data (D), Network (N), and Artificial Intelligence (A) should be heavily utilized as resources in light of new value. South Korea is preparing policy training plans the likes of 5G network enhancement, AI manpower training, and data openings, etc., recognizing DNA technology as the key driving force behind the 4th Industrial Revolution and 5G network enhancement, AI manpower training, and data opening, etc. However, there is a criticism that the DNA industry remains in an early stage. Despite policy support within South Korea, the DNA industry has not been revitalized due to various causes, and in particular, not being concentrated on limited resources selectively is also pointed to as an important cause. this study would quantitatively draw the priority of policy measures as well as propose policy implications for the revitalization of the DNA industry by means of the ISM-ANP model. It is judged that South Korea’s experience in this way will be an important lesson for other countries which would politically promote the DNA industry as a new growth engine within the 4th Industrial Revolution environment.

Wireless Sensor Networks (WSNs) is considered to be a promising research area since it entails sensing capabilities. WSNs are confronted by fabricated explosion injection attacks and in return results into draining of vitality on sensor nodes routing mainly because of increased capabilities in a broad range of applications where sensor nodes use a battery as the power source. In this paper, we reveal and claim a state-of-the-art model to minimize vitality depletion of nodes within the network in return increases network period to more realistic stretch. It is revealed that the main cause is vitality consumption unbalances in different parts of the network direct resulting from having a static sink. More still, the network nodes neighboring the sink insistently partake in progressing data of other nodes to the sink. Consequently, the network nodes are supplementarily subjected to untimely vitality exhaustion. This paper mainly provides a novel movable (mobile) fuzzy logic sink approach and an intelligent system like expect systems that are able to scrutinize network situation, and make the superlative choice for spreading the network period robotically.

Optical artificial neural networks (ONNs) — analog computing hardware tailored for machine learning [1,2] — have significant potential for ultra-high computing speed and energy efficiency [3]. We propose a new approach to architectures for ONNs based on integrated Kerr micro-comb sources [4] that is programmable, highly scalable and capable of reaching ultra-high speeds. We experimentally demonstrate the building block of the ONN — a single neuron perceptron — by mapping synapses onto 49 wavelengths of a micro-comb to achieve a high single-unit throughput of 11.9 Giga-FLOPS at 8 bits per FLOP, corresponding to 95.2 Gbps. We test the perceptron on simple standard benchmark datasets — handwritten-digit recognition and cancer-cell detection — achieving over 90% and 85% accuracy, respectively. This performance is a direct result of the record small wavelength spacing (49GHz) for a coherent integrated microcomb source, which results in an unprecedented number of wavelengths for neuromorphic optics. Finally, we propose an approach to scaling the perceptron to a deep learning network using the same single micro-comb device and standard off-the-shelf telecommunications technology, for high-throughput operation involving full matrix multiplication for applications such as real-time massive data processing for unmanned vehicle and aircraft tracking.

Next-generation cancer and oncology research needs to take full advantage of the multi-modal structured, or graph, information, with the graph datatypes ranging from molecular structures to spatially resolved imaging and digital pathology to biological networks to knowledge graphs. Graph Neural Networks (GNNs) efficiently combine the graph structure representations with the high predictive performance of deep learning, especially on the large multi-modal datasets. In this review article, we survey the landscape of recent (2020-present) GNN applications in the context of cancer and oncology research, and delineate six currently predominant research areas. Subsequently, we identify the most promising directions for future research. We compare GNNs with graphical models and "non-structured" deep learning, and devise the guidelines for cancer and oncology researchers or physician-scientists asking the question of whether they should adopt the GNN methodology in their research pipelines.

Relay protection service is the most crucial service carried by the electric power communication network, which is directly linked to the safe operation of the power grid. In the route planning of power services, a route planning architecture for the power communication network is constructed in this paper, considering the operation and maintenance requirements, such as relay protection service overload (RPSO) and dual route. To minimize network risk variance, the problem of single-service route allocation is formulated by taking the factors into account such as service delay, link bandwidth utilization, and RPSO constraints. Based on $k$ shortest paths algorithm, a route planning scheme for the power services is proposed, which considers RPSO and risk balance, and a strategy for implementing multi-service route planning of the communication network is studied. The simulation results show that the proposed route planning strategy can effectively avoid relay protection service overload, reduce network risk variance, and balance network risk.

In the trend of transforming existing systems and services into non-face-to-face models, the concert industry is also showing movements toward transitioning to virtual formats. Physical concerts in the real world require venues that can accommodate hundreds to tens of thousands of spectators, but non-face-to-face methods that can accommodate large audiences face various limitations. Moreover, to elevate the satisfaction level of virtual concert attendees to that of real-world concerts, it's important to implement interaction between performers and audiences. Modern metaverse platforms apply cutting-edge network technologies to accommodate numerous users within a single channel. Many researchers are adopting network technologies such as SDN (Software Defined Networking) and CDN (Content Delivery Network) to set up a virtual concert that can accommodate large audiences. In this paper, we propose a network framework to be designed for the composition of virtual concerts. In particular, we separate a channel dedicated to interaction in order to provide an immersive experience of exchanging interactions between performers and audiences. As massive audiences transmitting interaction data to the performer in a 1:N format can lead to problems with acceptance and latency, this study introduces a concept of a channel form called 'Zone' and proposes an interaction data channel network framework that does not compromise immersion. The proposed framework supports tasks for effectively transmitting interaction data using network technologies for metaverse platforms like XDN and clustering algorithms like fuzzy c-means. We also suggest a CDN-based architecture that can ensure low latency for performers to transmit interaction data to the audience.

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.

With the development of the city, a large number of water networks in the built-up areas of Bangkok have been filled and hardened, resulting in poor urban flooding and aggravating flooding, causing loss of life and property of citizens. In this paper, on the basis of combing the current water networks and open space potential flood storage points in the built-up areas of Bangkok, the complex network diagram of the water system in the built-up areas of Bangkok is constructed by combining the theory of complex networks and analyzing the attribute parameters of the network and the characteristic parameters of the open space storage nodes and water system paths, and finding that the water system network in the built-up area of Bangkok has complex network characteristics such as robustness, clustering and hierarchy. By exploring the key storage points and water system connection paths, the researchers initially constructed a flood safety pattern in the built-up area of Bangkok with 145 key nodes and 127 river paths as the backbone, and conceptualized the development study of the flood safety pattern in both horizontal and vertical directions. The urban flood safety pattern based on complex network theory proposed in this paper provides a case reference and methodological ideas to scientifically solve the game conflict between the demand for construction land for urban development and the construction area of urban open space storage points and water storage network under the increasingly severe flooding situation.

Forest fire identification is important for forest resource protection. Effective monitoring of forest fires requires the deployment of multiple monitors with different viewpoints, while most traditional recognition models can only recognize images from a single source. By ignoring the information from images with different viewpoints, these models produce high rates of missed and false alarms. In this paper, we propose a graph neural network model based on the similarity of dynamic features of multi-view images to improve the accuracy of forest fire recognition. The input features of the nodes on the graph are converted into relational features of different gallery pairs by establishing pairs (nodes) representing different viewpoint images and gallery images. The new feature library relationship is used to update the image gallery with dynamic features in order to achieve the estimation of similarity between images and improve the image recognition rate of the model. In addition, to reduce the complexity of image pre-processing process and extract key features in images effectively, this paper also proposes a dynamic feature extraction method for fire regions based on image segment ability. By setting the threshold value of HSV color space, the fire region is segmented from the image, and the dynamic features of successive frames of the fire region are extracted. The experimental results show that, compared with the baseline method Resnet, this paper's method is more effective in identifying forest fires, and its recognition accuracy is improved by 2%. And the scheme of this paper can adapt to different forest fire scenes, with better generalization ability and anti-interference ability.

Over the past decade, wireless communication technologies have developed significantly for intelligent applications in road transport. This paper provides an overview of telecommunications-based intelligent transport systems with a focus on ensuring system safety and resilience. In vehicle-to-everything, these problems are extremely acute due to the specifics of the operation of transport networks, which requires the use of special protection mechanisms. In this regard, it was decided to use blockchain as a system platform to support the needs of transport systems for secure information exchange. This paper describes the technological aspects of implementing blockchain technology in vehicle-to-network; the features of such technology are presented, as well as the features of their interaction.

One of the most serious concerns about mega event-related changes to small cities is how to effectively utilize newly developed public attractions after the Olympic Games. Making connections with existing local amenities and forming attraction networks can be effective strategies for continuing a city’s revitalization. However, despite the expected benefits, attraction network research shows that these benefits often fail to materialize. With the case of Gangneung, a 2018 winter Olympic hosting city, this study investigated visitation patterns to nineteen selected attractions using network analysis. The results indicate that the most influential nodes are located on the northern coast, the eastern coast, and in the south downtown area, those nodes being the central locations where the strongest of connections are made. New attractions such as the Olympic Park and Walwha Linear Park were rather isolated. While seasonal and periodic variations, visitors’ residences, and destination choice attitudes had a significant effect on visitation patterns, the attraction networks, modes of transportation, proximity to region, and type similarity were not significant factors in the forming of visitation patterns. The results make a methodological contribution to tourist behavior and network research. In addition, beyond individual attraction development, the results provide practical implications in regard to networking and cooperation between multiple attractions using temporal and spatial strategies such as management/investment prioritizing, travel route development, and program scheduling.

Alzheimer’s Disease (AD) is a neurodegenerative condition that currently has no known cure. The principles of the expanding field of network medicine (NM) have recently been applied to AD research. The main principle of NM proposes that diseases are much more complicated than one mutation in one gene, and incorporate different genes, connections between genes, and pathways that may include multiple diseases to create full scale disease networks. AD research findings as a result of the application of NM principles have suggested that functional network connectivity, myelination, myeloid cells, and genes and pathways may play an integral role in AD progression, and may be integral to the search for a cure. Different aspects of the AD pathology could be potential targets for drug therapy to slow down or stop the disease from advancing, but more research is needed to reach definitive conclusions. Additionally, the holistic approaches of network pharmacology in traditional Chinese medicine (TCM) research may be viable options for the AD treatment, and may lead to an effective cure for AD in the future.

Linear state estimation (SE) formulation under a rectangular coordinate system has been proved to be applicable for real-time distribution network management. Micro phasor measurements’ model can be accommodated into this kind of SE easily. However, voltage magnitude, active power and reactive power measurements are transformed to linear measurements with large node voltage error. To cope with this issue, a linear state estimation under a polar coordinate system is adopted at the first stage to obtain accurate enough complex node voltage, and then nonlinear measurements are transformed to be linear with complex node voltage. At the second stage, linear SE under a rectangular coordinate system can be adopted to satisfy more strict network constraints. The proposed two-stage linear SE is validated on balanced 14, 33, 70,84, 119, 135 nodes network and IEEE 13, 34, 37,123 unbalanced test feeders.

Investigating the network response to node removal and the efficacy of the node removal strategies are related and fundamental questions in network science. Research studies proposed many node centralities based on the network structure ranking node to remove. The random walk (RW) on networks describes a stochastic process in which a walker travels among nodes. RW can be a model of transport, diffusion, and search on networks, and an essential tool for studying the importance of network nodes. In this manuscript, we propose four new measures of node centrality based on RW. Then, we compare the efficacy of the new RW node removal strategies to network dismantle with effective node removal strategies from the literature, such as betweenness and closeness node removal over synthetic and real-world networks. We evaluate the network dismantle along node removal using the size of the largest connected component (LCC). We find that, hence the betweenness nodes attack is the best strategy overall, the new node removal strategies based on RW show the highest efficacy in peculiar network topology. Specifically, RW strategies based on covering times emerge as the most effective strategy on a synthetic lattice network and two real-world road networks. Our results may be useful in selecting the best node attack strategies in a specific class of networks and in building more robust network structures.

Human activity recognition (HAR) using wearable sensors is gaining popularity in the healthcare domain, enabling continuous monitoring and timely interventions. The conventional HAR systems are centralised and need data sharing with a server for processing and model training. However, this data sharing leads to various challenges, such as privacy concerns, increased communication and storage costs, inefficient computational algorithms, data scarcity due to unwillingness to share, and difficulty achieving high accuracy and personalised models simultaneously. To overcome these challenges, this paper introduces a privacy and energy-aware federated learning (FL) framework for model training without data sharing. The proposed scheme incorporates spiking neural networks (SNNs), which are particularly suited for resource-constrained devices due to their event-driven information processing. The key idea is to synergise the strengths of SNNs and long short-term memory (LSTM) to create a hybrid model for robust HAR. The proposed hybrid spiking LSTM (S-LSTM) model uses the LSTM as an input layer to capture temporal dependencies efficiently, followed by spiking layers that replace the typical activation using leaky integrate-and-fire neurons. We employ the combination of surrogate gradient learning and backpropagation through time (BPTT) to update the weights of SNN layers in a supervised manner. The performance of the proposed model is evaluated using two publicly available datasets for both indoor and outdoor scenarios. The results show that the proposed S-LSTM performs much better than spike convolutional neural networks (S-CNN) and simple CNN, achieving the accuracy of 97% and 87% for indoor and outdoor datasets, respectively. Personalisation, also known as fine-tuning the global model using local data, is crucial in HAR. It allows the model to adapt to individual behaviour and preferences, making predictions more accurate. The results also show that personalisation improves the performance of participants up to 9% on average. Additionally, analysis with 50% random client participation reduces communication costs by 50% with minimal impact on accuracy.

A scalable optical convolutional neural network (SOCNN) based on free-space optics and Koehler illumination was proposed to address the limitations of the previous 4f correlator system. Unlike Abbe illumination, Koehler illumination provides more uniform illumination and reduces crosstalk. SOCNN allows for scaling up of the input array and the use of incoherent light sources. Hence, the problems associated with 4f correlator systems can be avoided. We analyzed the limitations in scaling the kernel size and parallel throughput and found that SOCNN can offer a multilayer convolutional neural network with massive optical parallelism.

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.

With the development of deep learning technology, various structures and research methods for super-resolution restoration of natural images and document images have been introduced. In particular, a number of recent studies have been conducted and developed in image restoration using generative adversarial network. Super-resolution restoration is ill-posed problem because of some complex restraints such as a lot of high-resolution images being restored for the same low-resolution image and also difficulty in restoring noises like edges, light smudging, and blurring. In this study, we utilized the spatially adaptive de-normalization (SPADE) structure for document image restoration to solve previous problems such as edge unclearness, hardness to catch features of texts, and the image color transition. Consequently, it can be confirmed that the edge of the character and the ambiguous stroke are restored more clearly when contrasting with the other previously suggested methods. Also, the proposed method’s PSNR and SSIM scores are geting 8% and 15% higher, respectively, compared to the previous methods.

Many complex networks have a connectivity that might be only partially detected or that tends to grow over time, hence the prediction of non-observed links is a fundamental problem in network science. The aim of topological link prediction is to forecast these non-observed links by only exploiting features intrinsic to the network topology. It has a wide range of real applications, like suggesting friendships in social networks or predicting interactions in biological networks.The Cannistraci-Hebb theory is a recent achievement in network science that includes a theoretical framework to understand local-based link prediction on paths of length n. In this study we introduce two innovations: theory of modelling (science) and theory of realization (engineering). For the theory of modelling we first recall a definition of network automata as a general framework for modelling the growth of connectivity in complex networks. We then show that several deterministic models previously developed fall within this framework and we introduce novel network automata following the Cannistraci-Hebb rule. For the theory of realization, we present how to build adaptive network automata for link prediction, which incorporate multiple deterministic models of self-organization and automatically choose the rule that better explains the patterns of connectivity in the network under investigation. We compare Cannistraci-Hebb adaptive (CHA) network automaton against state-of-the-art link prediction methods such as structural perturbation method (SPM), stochastic block models (SBM) and artificial intelligence algorithms for graph embedding. CHA displays an overall higher link prediction performance across different evaluation frameworks on 1386 networks. Finally, we highlight that CHA offers the key advantage to explicitly explain the mechanistic rule of self-organization which leads to the link prediction performance, whereas SPM and graph embedding not. In comparison to CHA, SBM unfortunately shows irrelevant and unsatisfactory performance demonstrating that SBM modelling is not adequate for link prediction in real networks.

Unmanned Aerial Vehicles (UAVs) in particular multirotors are becoming the {\it de facto} tool for aerial sensing and remote inspection. In large industrial facilities, a UAV can transmit an online video stream to inspect difficult to access structures, such chimneys, deposits and towers. However, the communication range is limited, constraining the UAV operation range. This limitation can be overcome with relaying UAVs placed between the source UAV and the control station, creating a line of communication links. In this work we assume the use of a digital data packet network technology, namely WiFi, and tackle the problem of defining the exact placement for the relaying UAVs that creates an end-to-end channel with maximal delivery of data packets. We consider asymmetric communication links and we show an increase as large as $15$\% in end-to-end packet delivery ratio when compared to an equidistant placement. We also discuss the deployment of such a network and propose a fully distributed method that converges to the global optimal relay positions taking, on average, 1.4 the time taken by a centralized method.

Corynebacterium glutamicum is a Gram-positive bacterium found in soil where the condition changes demand plasticity of the regulatory interactions, which study at the global scale has been challenged by the lack of data integration. Here, we update the manually-curated C. glutamicum transcriptional regulatory network, now including protein-protein interactions having a direct effect on gene transcription. The network model with regulations supported by any experimental evidence increased by 557 interactions regarding the previous (2018) version. 73 interactions supported by directed experiments were also included in a second model. We included 545 sRNA-mediated regulations in a third model with a total of 5164 interactions. We deposited the three network models in Abasy Atlas v2.4. We study the C. glutamicum regulatory structure by comparing it against the networks for more than 40 species, finding it to contrast in several global structural properties. We analyze the system-level components of the networks, finding that the inclusion of the sRNAs regulations changes their proportions, transferring part of the basal machinery to the modular class and increasing the number of modules while decreasing their size. Finally, we use strong networks of three model organisms to provide insights in future directions of the C. glutamicum network characterization.

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implement FQ-AGO on the NS-3 simulator and compare the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we consider various network metrics to compare the performance of the routing protocols. Our simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay.

In the pursuit of energy efficiency and reduced environmental impact, adequate ventilation in enclosed spaces is essential. This study presents a hybrid neural network model designed for real-time monitoring and prediction of environmental variables. The system comprises two phases: An IoT hardware-software platform for data acquisition and decision-making, and a hybrid model combining short-term memory and convolutional recurrent structures. The results are promising and hold potential for integration into parallel processing AI architectures.

By framing the problem of determining the state of Schrodinger’s cat as a problem of searching for Hidden Markov Model (HMM), this work shows that Schrodinger’s cat is dead with stationary probabilities P(Cat = Dead) = 1 and P(Cat = Alive) = 0 consistently in various observation-based modelling of the HMM.

In the landscape of network management, software-defined networking (SDN) technology emerges as a dynamic approach, facilitating efficient network configuration for improved performance and monitoring, akin to the agility of cloud computing rather than traditional methods. However, its centralized structure exposes SDN to various attack vectors. Distributed Denial of Service (DDoS) attacks, particularly, pose a significant threat to SDN. This study employs machine learning algorithms and Network Traffic Classification Analysis (NCA) to classify SDN traffic as potential attacks. Notably, Decision Trees (DT) out shine other algorithms with a flawless 100% classification success, spotlighting their supremacy. Through this research, a robust path toward fortified SDN security takes form, where technological prowess and strategic intelligence unite for enhanced defense.

We study the synchronous dynamics of three diffusively coupled erbium-doped fiber lasers (EDLFs) in the unidirectional ring configuration without external pump modulation. The dynamical behavior of the system is analyzed using time series, Fourier spectra, Poincaré sections, bifurcation diagrams, and Lyapunov exponents for different values of the coupling strength. For weak coupling, we observe a well-known route to chaos from a stable equilibrium through a Hopf bifurcation and a series of torus bifurcations as the coupling strength is increased. An interesting result is found for large values of the coupling strength, where the phase locking is close to zero. This allows a significant increase in the peak energy of the EDFLs pulses, i.e., above the coupling strength the lasers switch to a Q-switching mode with large-amplitude short pulses. This result allows us to propose a new method for increasing the laser pulse energy based on the control of the bistability by the rotating wave in the array of three unidirectionally ring-coupled EDFLs as a function of the coupling strength. In our system, we were able to increase the peak laser power by almost 20 times more than a continuous single EDFL.

In the fast-paced internet world that we live in today, internet technologies and tools that enable us to connect online are rapidly changing and improving. To adapt to the changing environment, many game developers are changing their business models to adjust to this online environment by developing games that are centred around online gaming. As such, the internet demands of consumers such as gamers are increasing because of the need for quality internet connection for optimal gameplay. There are too many factors that can affect online gameplay. Moreover, not all gamers are equipped with the network knowledge and skills to diagnose and troubleshoot any internet issues that may arise during their gameplay session. The main contribution of this research was to gather insights from Malaysian broadband internet consumers, mainly from gamers and general users regarding their opinions of their ISP service experience in gaming, general use and service quality. A 1-click solution is presented as a smart autonomous network monitoring tool that can autonomously monitor, diagnose, and troubleshoot network problems with minimal input from the user. This research was conducted using a mixed-mode research methodology where the participants were asked to fill up a questionnaire regarding the user experience of their Internet Service Provider (ISP), and their perception of the 1 click-automated networking tool for their personal use. It is shown that there is a market demand for a 1 click-automated networking tool as gamers and general users both agree that such a tool would be beneficial to them by improving the internet quality of a network.

In the age of social media your personal branding is critical to find a job. Information is highly available and handy for everyone looking for a job as well as for people trying to recruit employees at all levels. Currently, there is a first e-impression that encompasses employee education, qualifications, and relationships. This e-impression is given by your social media, specifically those websites that were built to facilitate interactions between employee and employer during the job-hunting process. There are different websites that enable you to establish a social network. For example, meet, Xing, Bark, Opportunity, Lunchmeet, and LinkedIn among others. This article is written by a group of young undergraduate and graduate researchers, who have noticed the importance of social networks to apply for graduate school and industry jobs. This manuscript offers ten simple rules that include resources to facilitate the journey on LinkedIn-like social networks, hoping that you have a successful career description in the most popular professional social networking site.

Background: Disruption of alternative splicing (AS) is frequently observed in cancer and it might represent an important signature for tumor progression and therapy. Exon skipping (ES) represents one of the most frequent AS events and in non-small cell lung cancer (NSCLC) MET exon 14 skipping was shown to be targetable. Methods: We constructed a neural network (NN) specifically designed to detect MET exon 14 skipping events using RNAseq data. Furthermore, for discovery purpose we also developed a sparsely connected autoencoder to identify uncharacterized MET isoforms. Results: The NN had 100% Met exon 14 skipping detection rate, when tested on a manually curated set of 690 TCGA bronchus and lung samples. When globally applied to 2605 TCGA samples, we observed that the majority of false positives was characterized by a blurry coverage of exon 14, but interesting they share a common coverage peak in the second intron and we speculate that this event could be the transcription signature of a LINE1-MET fusion. Conclusions: Taken together our results indicate that neural networks can be an effective tool to provide a quick classification of pathological transcription events and sparsely connected autoencoders could represent the basis for the development of an effective discovery tool.

Learning models of the cerebellum propose that the cerebellum implements an algorithm which makes iterative adjustments to synaptic transmission strength that collectively determine the response to input in learned patterns following training. We propose instead that pattern recognition and control of firing by output cells are separately handled functions which process independently variable data. This can account for the evidence without a machine learning algorithm. The model is a hybrid of physiological arguments and computational methods used to test and quantify the ideas. We argue inter alia that learning operates at the level of functional groups of Purkinje cells defined by their shared climbing fibre input; Golgi cells have several functions and regulation of parallel fibre activity by Golgi cells is not in the expected way; recoding of input to the cerebellum received in the granular layer converts the number of input variables (variables expressed in mossy fibre input to the system) into a much reduced number of functional variables expressed by internal signals traffic; circuits simultaneously execute separate but integrated functions of pattern memory and output coding; they are able to operate separately because the expression of data used in each varies independently of the other; output rates are not learned but controlled by recent relevant input signals in a window opened by pattern memory; the moment-to-moment probability that a Purkinje cell spikes is synchronised across a microzone; a principal function of functional organisation of Purkinje cells into microzones is to increase resolution of rate coded information received by the output cells of the circuit, and to do so in a very short integration window, so that circuit architecture can be explained partly as a device with this function.

Using smartphone especially android platform has already got eighty percent market shares, due to aforementioned report, it becomes attacker’s primary goal. There is a growing number of private data onto smart phones and low safety defense measure, attackers can use multiple way to launch and to attack user’s smartphones.(e.g. Using different coding style to confuse the software of detecting malware). Existing android malware detection methods use multiple features, like safety sensor API, system call, control flow structure and data information flow, then using machine learning to check whether its malware or not. These feature provide app’s unique property and limitation, that is to say, from some perspectives it might suit for some specific attack, but wouldn’t suit for others. Nowadays most malware detection methods use only one aforementioned feature, and these methods mostly analysis to detect code, but facing the influence of malware’s code confusion and zero-day attack, aforementioned feature extraction method may cause wrong judge. So, it’s necessary to design an effective technique analysis to prevent malware. In this paper, we use the importance of word from apk, because of code confusion, some malware attackers only rename variables, if using general static analysis wouldn’t judge correctly, then use these importance value to go through our proposed method to generate picture, finally using convolutional neural network to see whether the apk file is malware or not.

In this paper, we propose a novel network representation learning model TransPath to encode heterogeneous information networks (HINs). Traditional network representation learning models aim to learn the embeddings of a homogeneous network. TransPath is able to capture the rich semantic and structure information of a HIN via meta-paths. We take advantage of the concept of translation mechanism in knowledge graph which regards a meta-path, instead of an edge, as a translating operation from the first node to the last node. Moreover, we propose a user-guided meta-path sampling strategy which takes users' preference as a guidance, which could explore the semantics of a path more precisely, and meanwhile improve model efficiency via the avoidance of other noisy and meaningless meta-paths. We evaluate our model on two large-scale real-world datasets DBLP and YELP, and two benchmark tasks similarity search and node classification. We observe that TransPath outperforms other state-of-the-art baselines consistently and significantly.

Graphs are largely used in computer science to model relations, or associations, among entities the compose complex systems. More recently, they found a broad field of application in bioinformatics and medical informatics supporting modelling, analysis of many systems. The applications span from representing interactions among molecules within cells, to model the functions of the brains. In order to support research, algorithms from graph theory that are able to extract knowledge from network should be coupled to efficient visualisation techniques. Although the importance of such topic, we retain that many challenges should be faced in the futures, such as automated pathway and network layout to better match biologists’ needs, the developing of a standard able to give more and better choices to represent nodes, edges finally, the developing of automated mechanism able to improve the network navigation methods that help users manage large and complex networks with the goal to improve the usability.

Recent methodological advances have enabled researchers to track the network structure of the human brain over time. Together, these studies provide novel insights into effective brain function, highlighting the importance of the systems-level perspective in understanding the manner in which the human brain organizes its activity to facilitate behavior. Here, we review a range of recent fMRI and electrophysiological studies that have mapped the relationship between inter-regional communication and network structure across a diverse range of brain states. In doing so, we identify both behavioral and biological axes that may underlie the tendency for network reconfiguration. We conclude our review by providing suggestions for future research endeavors that may help to refine our understanding of the functioning of the human brain.

In several emergency situations, during natural or human-caused disasters, frontline responders need to be able to communicate and collaborate to properly carry out the relief mission. Some countries are building their national Public Safety Mobile Broadband based on cellular LTE technology to provide fast, safe, and secure emergency services. Otherwise, in several emergency situations, the cellular antennas can be overloaded or partially damaged in manner to affect the group communication services. Since few last years, direct device-to-device (D2D) communications have been proposed by 3GPP as an underlay to Long Term Evolution (LTE) networks based on proximity, reuse, and hop gains. This paper focuses on the loosely coupled model based on D2D direct communication for Public Safety context. Many scenarios related to user membership and network management are detailed. Both “less cost” and “optimized tree” approaches are proposed, implemented, and their performance evaluated in terms of network updates number and resulting average Channel Quality Indicator (CQI). Other optimization approaches with different CQI threshold and optimization interval values have been implemented, simulated and their performance are compared with the “optimized tree”.

To protect power lines, distance relays are used which can rely on a modified distance resistance. But usually the operating range of these relays changes as the network conditions change (network topology, load value, output value, etc.) and leads to false trips, By using methods that can process information and recognize patterns, for example, the use of micro and intelligent processor algorithms can use the new relays with high precision and thus provide adequate protection. In this study, a distance relay was modeled using a neural network, and it was observed that the neural relay had higher accuracy than the conventional relay. In addition to detecting the fault and its location, type and phase of the fault, three-stage simultaneous protection can be performed. As a result, the number of linear relays can be reduced by using relays based on neural technologies. An MLP (multilayer perceptron) neural network is used to model a sequence of distances.

Deep learning is emerging in many industrial sectors in hand with big data analytics to streamline production. In the biomanufacturing sector, big data infrastructure is lagging comparatively to other industries. A promising approach is to combine Deep Neural Networks (DNN) with prior knowledge in Hybrid Neural Network (HNN) workflows that are less dependent on the quality and quantity of data. This paper reviews published articles over the past 30 years on the topic of HNN applications to bioprocesses. It revealed that HNNs were applied to various bioprocesses, including microbial cultures, animal cells cultures, mixed microbial cultures, and enzyme biocatalysis. HNNs were mainly applied for process analysis, process monitoring, development of software sensors, open- and closed-loop control, batch-to-batch control, model predictive control, intensified design of experiments, quality-by-design, and recently for the development of digital twins. Most previous HNN studies combined shallow Feedforward Neural Networks (FFNNs) with physical laws, such as macroscopic material balance equations, following the semiparametric design principle. Only recently, deep HNNs based on deep FFNNs, Convolution Neural Networks (CNN), Long Short-Term Memory (LSTM) networks and Physics Informed Neural Networks (PINNs) have been reported. The biopharma sector is currently a major driver but applications to biologics quality attributes, new modalities, and downstream processing are significant research gaps.

A road network represents road objects in a given geographic area and their interconnections, and is an essential component of intelligent transportation systems (ITS) enabling emerging new applications such as dynamic route guidance, driving assistance systems, and autonomous driving. As the digitization of geospatial information becomes prevalent, a number of road networks with a wide variety of characteristics coexist. In this paper, we present an area partitioning approach to the conflation of two road networks with a large difference in level of details. Our approach first partitions the geographic area by the Network Voronoi Area Diagram (NVAD) of low-detailed road network. Next, a subgraph of high-detailed road network corresponding to a complex intersection is extracted and then aggregated into a supernode so that a high matching precision can be achieved via 1:1 node matching. To improve the matching recall, we also present a few schemes that address the problem of missing corresponding object and representation dissimilarity between these road networks. Numerical results at Yeouido, Korea's autonomous vehicle testing site, show that our area partitioning approach can significantly improve the performance of road network matching.

Link prediction is an iconic problem in complex networks because deals with the ability to predict nonobserved existing or future parts of the network structure. The impact of this prediction on real applications can be disruptive: from prediction of covert links between terrorists in their social networks to repositioning of drugs in molecular diseasome networks. Here we compare: (1) an ensemble meta-learning method (Ghasemian et al.), which uses an artificial intelligence (AI) stacking strategy to create a single meta-model from hundreds of other models; (2) a structural predictability method (SPM, Lü et al.), which relies on a theory derived from quantum mechanics and does not assume any model; (3) a modelling rule named Cannistraci-Hebb (CH, Muscoloni et al.), which relies on one brain-bioinspired model adapting to the intrinsic network structure.We conclude that brute-force stacking of algorithms by AI does not perform better than (and is often significantly outperformed by) SPM and one simple brain-bioinspired rule such as CH. This agrees with the Gödel incompleteness: stacking is optimal but incomplete, you cannot squeeze out more than what is already in your features. Hence, we should also pursue AI that resembles human-like physical ‘understanding’ of simple generalized rules associated to complexity. The future might be populated by AI that ‘steals for us the fire from Gods’, towards machine intelligence that creates new rules rather than stacking the ones already known.

We advance binational link-tracing sampling design, an innovative data collection methodology for sampling from transnational social fields, i.e., transnational networks embedding migrants and non-migrants. This paper shows the practical challenges of such a design, the representativeness of the samples and the qualities of the resulted networks. We performed 303 face-to-face structured interviews on sociodemographic variables, migration trajectories and personal networks of people living in a Romanian migration sending community (Dâmbovița) and in a migration receiving Spanish town (Castellón), simultaneously in both sites. Inter-connecting the personal networks, we built a multi-layered complex network structure embedding 4,855 nominated people, 5,477 directed ties (nominations) and 2,540 edges. Results indicate that the participants’ unique identification is a particularly difficult challenge, the representativeness of the data is not optimal (homophily on observed attributes was detected in the nomination patterns), and the relational and attribute data allow to explore the social organization of the Romanian migrant enclave in Castellón, as well as its connectivity to other places. Furthermore, we provide methodological suggestions for improving link-tracing sampling from transnational networks of migration. Our research contributes to the emerging efforts of applying social network analysis to the study of international migration.

The emerging use of visualization techniques in pathology and microbiol- ogy has been accelerated by machine learning (ML) approaches towards image preprocessing, classification, and feature extraction in an increasingly complex series of datasets. Modern Convolutional Neural Network (CNN) architectures have developed into an umbrella of vast image reinforcement and recognition methods, including a combined classification-localization of single/multi-object featured images. As a subtype neural network, CNN cre- ates a rapid order of complexity by initially detecting borderlines, edges, and colours in images for dataset construction, eventually capable in mapping intricate objects and conformities. This paper investigates the disparities between Tensorflow object detection APIs, exclusively, Single Shot Detector (SSD) Mobilenet V1 and the Faster RCNN Inception V2 model, to sample computational drawbacks in accuracy-precision vs. real time visualization capabilities. The situation of rapid ML medical image analysis is theoretically framed in regions with limited access to pathology and disease prevention departments (e.g. 3rd world and impoverished countries). Dark field mi- croscopy datasets of an initial 62 XML-JPG annotated training files were processed under Malaria and Syphilis classes. Model trainings were halted as soon as loss values were regularized and converged.

Recent brain imaging findings by using different methods (e.g., fMRI and PET) have suggested that social anxiety disorder (SAD) is correlated with alterations in regional or network-level brain function. However, due to many limitations associated with these methods, such as poor temporal resolution and limited number of samples per second, neuroscientists could not quantify the fast dynamic connectivity of causal information networks in SAD. In this study, SAD-related changes in brain connections within the default mode network (DMN) were investigated using eight electroencephalographic (EEG) regions of interest. Partial directed coherence (PDC) was used to assess the causal influences of DMN regions on each other and indicate the changes in the DMN effective network related to SAD severity. The DMN is a large-scale brain network basically composed of the mesial prefrontal cortex (mPFC), posterior cingulate cortex (PCC)/precuneus, and lateral parietal cortex (LPC). The EEG data were collected from 88 subjects (22 control, 22 mild, 22 moderate, 22 severe) and used to estimate the effective connectivity between DMN regions at different frequency bands: delta (1–3 Hz), theta (4–8 Hz), alpha (8–12 Hz), low beta (13–21 Hz), and high beta (22–30 Hz). Among the healthy control (HC) and the three considered levels of severity of SAD, the results indicated a higher level of causal interactions for the mild and moderate SAD groups than for the severe and HC groups. Between the control and the severe SAD groups, the results indicated a higher level of causal connections for the control throughout all the DMN regions. We found significant increases in the mean PDC in the delta (p = 0.009) and alpha (p = 0.001) bands between the SAD groups. Among the DMN regions, the precuneus exhibited a higher level of causal influence than other regions. Therefore, it was suggested to be a major source hub that contributes to the mental exploration and emotional content of SAD. In contrast to the severe group, HC exhibited higher resting-state connectivity at the mPFC, providing evidence for mPFC dysfunction in the severe SAD group. Furthermore, the total Social Interaction Anxiety Scale (SIAS) was positively correlated with the mean values of the PDC of the severe SAD group, r (22) = 0.576, p = 0.006 and negatively correlated with those of the HC group, r (22) = −0.689, p = 0.001. The reported results may facilitate greater comprehension of the underlying potential SAD neural biomarkers and can be used to characterize possible targets for further medication.

In the current industrial landscape, increasingly pervaded by technological innovations, the adoption of optimized strategies for asset management is becoming a critical key success factor. Among the various strategies available, the “Prognostics and Health Management” strategy is able to support maintenance management decisions more accurately, through continuous monitoring of equipment health and “Remaining Useful Life” forecasting. In the present study, Convolutional Neural Network-based Deep Neural Network techniques are investigated for the Remaining Useful Life prediction of a punch tool, whose degradation is caused by working surface deformations during the machining process. Surface deformation is determined using a 3D scanning sensor capable of returning point clouds with micrometric accuracy during the operation of the punching machine, avoiding both downtime and human intervention. The 3D point clouds thus obtained are transformed into bidimensional image-type maps, i.e., maps of depths and normal vectors, to fully exploit the potential of convolutional neural networks for extracting features. Such maps are then processed by comparing 15 genetically optimized architectures with the transfer learning of 19 pre-trained models, using a classic machine learning approach, i.e., Support Vector Regression, as a benchmark. The achieved results clearly show that, in this specific case, optimized architectures provide performance far superior (MAPE=0.058) to that of transfer learning which, instead, remains at a lower or slightly higher level (MAPE=0.416) than Support Vector Regression (MAPE=0.857).

Drug-target affinity (DTA) prediction is crucial for understanding molecular interactions and aiding drug discovery and development. While various computational methods have been proposed for DTA prediction, their predictive accuracy remains limited, failing to delve into the structural nuances of interactions. With increasingly accurate and accessible structure prediction of targets, we developed a novel deep learning model, named S2DTA, to accurately predict DTA by fusing sequence and structural knowledge of drugs, targets, and pockets using heterogeneous models based on graph and semantic networks. Experimental findings underscored that complex feature representations imparted negligible enhancements to the model’s performance. However, the integration of heterogeneous models demonstrably bolstered predictive accuracy. In comparison to three state-of-the-art methodologies, the supremacy of S2DTA became strikingly apparent. It showcased a noteworthy 25.2% reduction in Mean Absolute Error (MAE) and an impressive 20.1% decrease in Root Mean Square Error (RMSE). Furthermore, S2DTA exhibited substantial advancements in other pivotal metrics, including Pearson Correlation Coefficient (PCC), Spearman, Concordance Index (CI), and R2. These metrics experienced remarkable increments of at least 19.6%, 17.5%, 8.1%, and a remarkable 49.4%, respectively. Finally, we conducted interpretability analysis on the effectiveness of S2DTA by bidirectional self-attention mechanism, fully proving that S2DTA is a valuable and accurate tool for predicting DTA. For further exploration, the source data and code repository can be accessed at https://github.com/dldxzx/S2DTA.

Applying the improved social network analysis method and the idea of rolling window regression, this paper explores the impact of HSR network on the quality of urbanization and its dynamics. Based on a sample of 273 cities in China over 2009–2019, we find that the high-speed railway network has an increasing positive effect on the quality of urbanization, which proves the existence of network effect. The empirical results further show that this effect is closely related to the cov-erage rate of high-speed rail network. In addition, heterogeneity analysis reveals that urban ag-glomeration cities are the main beneficiaries. Academically, our study provides a plausible expla-nation and evidence from network size differences for the two conflicting views of the HSR effect. Practically, we also propose some important policy implications for countries in different high-speed rail network construction stages.

Hyperspectral image and LiDAR image fusion plays a crucial role in remote sensing by capturing spatial relationships and modeling semantic information for accurate classification and recognition. However, existing methods, like Graph Convolutional Networks (GCNs), face challenges in constructing effective graph structures due to variations in local semantic information and limited receptiveness to large-scale contextual structures. To overcome these limitations, we proposed a invariant attribute-driven binary bi-branch classification (IABC) method which is a unified network that combines binary Convolutional Neural Network (CNN) and GCN with invariant attributes. Our approach utilizes a joint detection framework that can simultaneously learn features from small-scale regular regions and large-scale irregular regions, resulting in an enhanced structured representation of HSI and LiDAR images in the spectral-spatial domain. This approach not only improves the accuracy of classification and recognition but also reduces storage requirements and enables real-time decision-making, which is crucial for effectively processing large-scale remote sensing data. Extensive experiments demonstrates the superior performance of our proposed method in hyperspectral image analysis tasks. The combination of CNNs and GCNs allows for accurate modeling of spatial relationships and effective construction of graph structures. Furthermore, the integration of binary quantization enhances computational efficiency, enabling real-time processing of large-scale data. Therefore, our approach presents a promising opportunity for advancing remote sensing applications using deep learning techniques.

In order to realize the performance degradation trend prediction accurately, a prediction method based on multi-domain features and temporal convolutional network (TCN) is proposed. Firstly, construct a high-dimensional feature set in the multi-domain of vibration signals, and use comprehensive evaluation indicators to preliminarily screen performance degradation indexes with good sensitivity and strong trend. Secondly, the kernel principal component analysis (KPCA) method is adopted to eliminate redundant information between multi-domain features, and construct a health index (HI) based on convolutional auto-encoder (CAE) network. Thirdly, a TCN-based performance degradation trend prediction model is constructed, and direct multi-step prediction is used to predict the performance degradation trend of the monitored object. On this basis, the validity of the proposed method is verified using the bearing public data, and it is successfully applied to performance degradation trend prediction of rolling contact fatigue specimen. The results show that the feature set can be reduced from 14 dimensions to 4 dimensions by using KPCA, while 98.33% of the information of the original feature set is retained. Furthermore, the method of constructing HI based on CAE network is effective. The change process of the HI constructed truly reflects the performance degradation process of the rolling contact fatigue specimen. Compared with the two commonly used HI construction methods, auto-encoding (AE) network and gaussian mixture model (GMM), this method has obvious advantages. At the same time, the prediction model based on TCN can accurately predict the performance degradation of the rolling contact fatigue specimen with the root mean square error 0.0146 and the mean absolute error 0.0105, which has better performance and higher prediction accuracy than the prediction model based on the long short-term memory (LSTM) network and the gated recurrent unit (GRU). This method has general significance and may be extended to the performance degradation prediction of other mechanical equipment/parts.

The CAN protocol is widely adopted for in-vehicle networks due to its cost efficiency and reliable transmission. However, despite its popularity, the protocol lacks built-in security mechanisms, making it vulnerable to various attacks such as flooding, fuzzing, and DoS. These attacks can exploit vulnerabilities and disrupt the normal behavior of the in-vehicle network. One of the main reasons for these security concerns is that the protocol relies on broadcast frames for communication between ECUs within the network. To tackle this issue, this paper presents an intrusion detection system that leverages multiple LSTM-Autoencoders. The proposed system utilizes diverse features, including transmission interval and payload value changes, to capture various characteristics of normal network behavior. By analyzing different types of features separately using the LSTM-Autoencoder model, the system effectively detects anomalies. In our evaluation, we conducted experiments using real vehicle network traffic, and the results demonstrated the system's high precision with a 99% detection rate in identifying anomalies.

Drought is one of the most serious abiotic stressors in the environment, restricting agricultural production by reducing plant growth, development, and productivity. To investigate such a complex and multifaceted stressor and its effects on the plants, a systems biology-based approach is necessitated, entailing the generation of co-expression networks, identification of highly-priority transcription factors (TFs) dynamic mathematical modeling, and computational simulations. Here, we studied a high-resolution drought transcriptome of Arabidopsis. We revealed distinct temporal transcriptional signatures and demonstrated the involvement of specific biological pathways. Generation of a large-scale co-expression network followed by network centrality analyses identified 117 TFs that possess critical properties of hubs, bottlenecks, and high clustering coefficients nodes. Dynamic transcriptional regulatory modeling on integrated TF-target and transcriptome datasets uncovered major transcriptional events during the course of drought stress. Mathematical transcriptional simulations allowed us to ascertain the activation status of major TFs as well as the transcriptional intensity and amplitude of their target genes. Finally, we validated our predictions by providing experimental evidence of gene expression under drought stress for a set of four TFs and their major target genes using qRT-PCR. Taken together, we provided a systems-level perspective on the dynamic transcriptional regulation during drought stress in Arabidopsis and uncovered numerous novel TFs that can potentially be used in future genetic crop engineering programs.

The fusion of "innovation theory" and "ecology" gave birth to a large number of studies on "innovation ecology", which mainly studies how to build an industrial ecological chain at the regional level, focusing on self-evolution, achieving ecological balance, and enabling the regional economy to take the path of sustainable innovation. This type of research borrows a lot of concepts from ecology, and very vividly describes the competition and cooperation relationships formed by various agents in the innovation system, laying a good foundation for qualitative analysis of the inherent dynamics of innovation development. However, many studies focus on the analogous description of ecosystems and economic systems, lacking scientifically and rigorously quantitative empirical research as a support. This paper uses network-based indicators such as degree, cluster coefficient, and betweenness centrality to measure the function and position of high-tech enterprises in the Z-Park in a business environment, so as to clarify the socio-economic meaning of the topological structure of the regional innovation system. On this basis, it provides theoretical references for regional innovation development and sustainable development policy formulation.

Effectively avoiding gas accident is vital to the security of mineral manufacture, and the coal mine gas accident is often caused by gas concentration overrun. The prediction accuracy of gas emission quantity in coal mine is the key to solve this problem. To maintain concentration of gas in a secure range，grey theory and neural network model increasingly diffusely used in forecasting gas emission quantity in coal mine critically. Nevertheless, the limitation of the grey neural network model is that researchers merely bonded the conventional neural network and grey theory. To enhance accuracy of prediction, a modified grey GM(1,1) and RBF neural network model is proposed combined amended grey GM(1,1) model and RBF neural network model. Then the proposed model was put into simulation experiment which is built based on Matlab software. Ultimately, conclusion of the simulation experiment verified that the modified grey GM(1,1) and RBF neural network model not only boosts the precision of prediction, but also restricts relative error in a minimum range. This showed that the modified grey GM(1,1) and RBF neural network model achieves effectiveness in precision of prediction much better than grey GM(1,1) model and RBF neural network model.

Synesthesia is a psychological phenomenon where sensory signals become mixed. Input to one sensory modality produces an experience in a second, unstimulated modality. In “grapheme-color synesthesia”, viewed letters and numbers evoke mental imagery of colors. The study of this condition has implications for increasing our understanding of brain architecture and function, language, memory and semantics, and the nature of consciousness. In this work, we propose a novel application deep learning to model perception in grapheme-color synesthesia. Achromatic letter images, taken from database of handwritten characters, are used to induce synesthesia. Results show the model learns to accurately create a colored version of the inducing stimulus, according to a statistical distribution from experiments on a sample population of grapheme-color synesthetes. The spontaneous, creative mental imagery characteristic of the synesthetic perceptual experience is reproduced by the model. A model of synesthesia that generates testable predictions on brain activity and behavior is needed to complement large scale data collection efforts in neuroscience, especially when articulating simple descriptions of cause (stimulus) and effect (behavior). The research and modeling approach reported here begins to address this need.

Fatigue fractures in materials are the main cause of approximately 80% of all material failures, and it is believed that such failures can be predicted and mathematically calculated in a reliable manner. It is possible to establish prediction modalities in cases of fatigue fracture, according to three fundamental variables in fatigue, such as volume, number of fracture cycles, as well as applied stress, with the integration of Weibull constants (length characteristic). This investigation was carried out mechanical fatigue tests on specimens smaller than 4 mm2 in section of different industrial materials for their subsequent analysis through precision computed tomography in search of microfractures. The measurement of these microfractures, along with their metrics and classifications, was recorded. A convolutional neural network trained with deep learning was used to achieve the detection of microfractures in image processing. The detection of microfractures in images with 480x854 or 960x960 pixels is the primary objective of this network, and its accuracy is above 95%. Images that have microfractures and those that do not are classified by the network. Subsequently, by means of image processing, the microfracture is isolated. Finally, the images that do contain this feature are interpreted by image processing to obtain their area, perimeter, characteristic length, circularity, orientation, and type microfracture metrics. All values will be obtained in pixels and converted to metric units (μm) through a conversion factor based on image resolution.

Ensuring the integrity of scientific literature is essential for advancing knowledge and research. However, the credibility and trustworthiness of scholarly publications are compromised by manipulated citations. Traditional methods, such as manual inspection and basic statistical analyses, have limitations in detecting intricate patterns and subtle manipulations of citations. In recent years, network-based approaches have emerged as promising techniques for identifying and understanding citation manipulation. This study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model. The key idea is to reconstruct meaningful connections represented by citations within a network by exploring slightly longer alternative paths. These indirect pathways enable the recovery of original and reliable citations while estimating their trustworthiness. The investigation takes a comprehensive approach to link prediction, leveraging the consistent behavior of prominent connections when exposed to network perturbations. Through numerical experiments, the method demonstrates a high capability to identify reliable citations as the core of the analyzed data and to raise suspicions about unreliable references that may have been manipulated.

Soft tactile sensors based on piezoresistive materials have various large-area sensing applications. However, their accuracy is often affected by hysteresis, a phenomenon that poses a significant challenge during operation. This paper introduces a novel approach that employs a backpropagation (BP) neural network to address the hysteresis nonlinearity in conductive fibre-based tactile sensors. To assess the effectiveness of the proposed method, four sensor units with different layer configurations (1, 3, 6, and 12) were designed. These sensor units underwent force sequences to collect corresponding output resistances. A backpropagation network was trained using these force sequences, thereby correcting the resistance values. The training process exhibited excellent convergence, effectively adjusting the network's parameters to minimize the error between predicted and actual resistance values. As a result, the trained BP network accurately predicted the output resistances. Several validation experiments were conducted to highlight the primary contribution of this research. The proposed method reduced the maximum hysteresis error from 24.2% of the sensor's full-scale output to 13.5%. This improvement establishes the approach as a promising solution for enhancing the accuracy of soft tactile sensors based on piezoresistive materials. By effectively mitigating hysteresis nonlinearity, the capabilities of soft tactile sensors in various applications can be enhanced. These sensors become more reliable and more efficient tools for force measurement and control, particularly in the fields of soft robotics and wearable technology. Consequently, their widespread applications extend to robotics, medical devices, consumer electronics, and gaming. Notably, the complete elimination of hysteresis in tactile sensors may not be feasible. Nevertheless, the proposed method effectively modifies the hysteresis nonlinearity, leading to improved sensor output accuracy.

The Lightning Network (LN), a second-layer protocol built on top of the Bitcoin blockchain, is an innovative digital payment solution that offers increased convenience, speed, and cost-effectiveness to consumers and businesses alike. However, there is limited literature available on the characteristics of this nascent technology, the depth and breadth of the various business LN-related applications as well as relevant adoption/implementation challenges. This study aims to contribute to the understanding of the LN’s characteristics, its potential in enhancing business operations and its applicability across different sectors, while taking into account adoption and implementation challenges. We apply a narrative review methodology using a semi-systematic approach to examine new and emerging business models empowered by the LN and its characteristics, topology, performance, privacy, and security. We analyze the data to identify key themes and trends in the literature, offering a critical analysis of the strengths and weaknesses of the existing literature. Based on the findings, we provide several clusters of fruitful areas for future research directions. The findings of this study will help businesses make more informed decisions about adopting and leveraging the LN to improve their operations and enhance customer experience.

While modeling data in reality, uncertainties in both data (aleatoric) and model (epistemic) are not necessarily Gaussian. The uncertainties could appear with multimodality or any other particular forms which need to be captured. Gaussian mixture models (GMMs) are powerful tools that allow us to capture those features from a unknown density with a peculiar shape. Inspired by Fourier expansion, we propose a GMM model structure to decompose arbitrary unknown densities and prove the property of convergence. A simple learning method is introduced to learn GMMs through sampled datasets. We applied GMMs as well as our learning method to two classic neural network applications. The first one is learning encoder output of autoencoder as GMMs for handwritten digits images generation. The another one is learning gram matrices as GMMs for style-transfer algorithm. Comparing with the classic Expectation maximization (EM) algorithm, our method does not involve complex formulations and is capable of achieving applicable accuracy.

The concentration of data from multiple links to a single output is an essential task performed by High-Energy Physics (HEP) Data Acquisition Systems (DAQs). At high and varying data rates combined with the large width of the concentrator’s output interface, this task is non-trivial. This paper presents a concentrator based on the Beneš network, which provides efficient concentration without using a high-frequency clock internally. It warrants that empty data are eliminated and does not disturb the data time-ordering if the data rates significantly differ between inputs. Additionally, it is well suited to FPGA implementation. It is based on simple data-routing primitives and may be fully pipelined.

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.

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.

Although train simulation research is vast, most available network simulators do not track the instantaneous movements and interactions of multiple trains for the computation of energy/fuel consumption. In this paper, we introduce the NeTrainSim simulator for heavy long-haul freight trains on a network of multiple intersecting tracks. Trains are modeled as a series of moving mass points (each car/locomotive is modeled as a point mass) while ensuring safe following distances between them. The simulator considers the motion of the train as a whole and neglects the relative movements between the train cars/locomotives. Furthermore, the powers of the different locomotives are transferred to the first locomotive as such a simplification result in a reduced simulation time without impacting the accuracy of energy consumption estimates. While the different tractive forces are combined, the resistive forces are calculated at their corresponding locations. The output files of the simulator contain pertaining information to the train trajectories and the instantaneous energy consumption levels. A summary file is also provided with the total energy consumed for the full trip and the entire network of trains. Two case studies are conducted to demonstrate the performance of the simulator. The first case study validates the model by comparing the output of NeTrainSim to empirical trajectory data using a basic single-train network. The results confirm that the simulated trajectory is precise enough to estimate the electric energy consumption of the train. The second case study demonstrates the train-following model considering six trains following each other. The results showcase the model’s ability in relation to maintaining safe-following distances between successive trains. Finally, the NeTrainSim is demonstrated to be scalable with computational times of O(n) for less than 50 trains (n) and O(n²) for higher number of trains.