Search

Community structure is a common phenomenon observed in various social networks. In this work, a novel community detection algorithm is proposed by estimating the effect of community structure on the average path length of a network. The Erdos-Renyi graph model is used as a reference to compute the change in the average path length of a network due to community formation. By experimenting with artificial networks, it is found that community structure in a social network contributes towards the lengthening of the average shortest path length. A random graph is found to have a lesser average shortest path length than a social network with community structure. As the size of individual communities increases, there is a decrease in the difference of average shortest path lengths, compared with a random graph containing an equal number of nodes and edges. This relationship is used to predict the average community size and their numbers in a network. The findings mentioned above are applied to the proposed algorithm. The proposed community detection algorithm is an enhancement over Fire Spread community detection algorithm (Pattanayak, 2019), in which the value of R for the R-radius neighborhood subgraph is automatically calculated.

It is challenging to deploy check-in nodes optimally in a complex network so as to perform specific check-in like services, e.g., fuel supplements etc., but crucial in many real-world applications. In this article, we propose and study the new optimization problem of placing check-in nodes with the minimum cost, i.e., the problem of finding the minimum-cost check-in nodes (MCCN), which is of great interests for real-world application situations, but even more difficult. We motivate the new algorithms through three typical worse cases by the often-used greedy-type algorithms, i.e., One-to-Many, Many-to-One, and Duplicate-Overrides. With this respect, the proposed novel optimization algorithms utilize a novel metric of contribution density for selecting check-in nodes iteratively, which successfully avoid the occurrence of the two worse cases of One-to-Many and Many-to-One. We also introduce an extra backward extraction step in one of new algorithms, which overcomes the crucial worse case of ``duplicate overrides'' and largely improves the algorithmic performance in solving the introduced optimization problem of MCCN. Meanwhile, we extend the new contribution density metric to a more general class of functions and study their effectiveness to eliminate the two worse cases of One-to-Many and Many-to-One; also, a detailed analysis on complexity and performance of the proposed algorithms is presented to show their numerical efficiency and accuracy. Extensive experiments over two classical artificial networks, i.e., BA network and ER network, and ten real-world networks, under two typical cost setups, show the proposed algorithms significantly outperform the four state-of-the-art algorithms. We also demonstrate that our proposed algorithms are much reliable and robust with different experiment settings of deployment cost and network-type and scale.

The design of the water distribution system is inherently linked to the execution of calculations, which aim, among other things, to determine the flow rate through individual pipes and the selection of diameters at the appropriate speed. Each step in the calculations is followed by an evaluation of the results and, if necessary, a correction of the data and further calculations. It is up to the designer to analyse the accuracy of the calculation results and is time-consuming for large systems. In this article, a diagnostic method for the results of hydraulic calculations, based on Kohonen Network, which classifies nominal diameters [DN] on the basis of data, in the form of flows, has been proposed. After calculating the new variant of the water distribution system, the individual calculation sections are assigned to the neurons of the topological map of Kohonen Network drawn up for nominal diameters. By comparing the diameter used for the calculation, with the diameter obtained on the topological map, the accuracy of the chosen diameter can be assessed. The topological map, created as a result of labelling the neurons of the output layer of the Kohonen Network, graphically shows the position of the classified diameter, relative to those diameters with similar input values. The position of a given diameter, relative to other diameters, may suggest the need to change the diameter of the pipe.

The similarity graphs of most spectral clustering algorithms carry lots of wrong community information. In this paper, we propose a probability matrix and a novel improved spectral clustering algorithm based on the probability matrix for community detection. First, the Markov chain is used to calculate the transition probability between nodes, and the probability matrix is constructed by the transition probability. Then, the similarity graph is constructed with the mean probability matrix. Finally, community detection is achieved by optimizing the NCut objective function. The proposed algorithm is compared with SC, WT, FG, FluidC, and SCRW on artificial networks and real networks. Experimental results show that the proposed algorithm can detect communities more accurately and has better clustering performance.

This paper attempts to describe and address a specific puzzle related to compositionality in artificial networks such as Deep Neural Networks and machine learning in general. The puzzle identified here touches on a larger debate in Artificial Intelligence related to epistemic opacity but specifically focuses on computational applications of human level linguistic abilities or properties and a special difficulty with relation to these. Thus, the resulting issue is both general and unique. A partial solution is suggested.

Purpose The state-of-the-art methods designed for overlapping community detection are limited by their high execution time as in CPM or the need to provide some parameters like the number of communities in Bigclam and Nise_sph, which is a nontrivial information. Hence, there is a need to develop the accuracy that represents the primordial goal, where the actual state-of-the-art methods do not succeed to achieve high correspondence with the ground truth for many instances of networks. The paper aims to discuss this issue. Design/methodology/approach The authors offer a new method that explore the union of all maximum spanning trees (UMST) and models the strength of links between nodes. Also, each node in the UMST is linked with its most similar neighbor. From this model, the authors extract local community for each node, and then they combine the produced communities according to their number of shared nodes. Findings The experiments on eight real-world data sets and four sets of artificial networks show that the proposed method achieves obvious improvements over four state-of-the-art (BigClam, OSLOM, Demon, SE, DMST and ST) methods in terms of the F-score and ONMI for the networks with ground truth (Amazon, Youtube, LiveJournal and Orkut). Also, for the other networks, it provides communities with a good overlapping modularity. Originality/value In this paper, the authors investigate the UMST for the overlapping community detection.

In this paper, we introduce a new approach for detecting community structures in networks. The approach is subject to modifying one of the connectivity-based community quality functions based on considering the impact that each community’s most influential node has on the other vertices. Utilizing the proposed quality measure, we devise an algorithm that aims to detect high-quality communities of a given network based on two stages: finding a promising initial solution using greedy methods and then refining the solutions in a local search manner.The performance of our algorithm has been evaluated on some standard real-world networks as well as on some artificial networks. The experimental results of the algorithm are reported and compared with several state-of-the-art algorithms. The experiments show that our approach is competitive with the other well-known techniques in the literature and even outperforms them. This approach can be used as a new community detection method in network analysis.

The intensive use of antibiotics in livestock practice has a negative impact on human health and increases the antibiotic resistance. In this study feasible data interpretation algorithm along with efficient extraction protocol were combined for selective analysis of three antibiotics in milk samples. Trimethoprim, sulphamethoxazole and oxytetracycline are widely used antibiotics in veterinary pharmaceuticals. The studied antibiotics were efficiently extracted from milk samples with solidification of floating organic droplet in dispersive liquid-liquid microextraction. This extraction protocol was optimized not only to maximize extraction recoveries but also to approach the lower residue limits specified by European Union. Artificial neural networks succeeded in resolving spectral overlap between the studied drugs. The network architecture was optimized and validated for accurate and precise analysis. The proposed method outweighs the reported chromatographic methods for being simple and inexpensive and compared favorable to official methods.

SummaryNatural decisions involve two seemingly separable processes: inferring the relevant task (task-belief) and performing the believed-relevant task. The assumed separability has led to the traditional practice of studying task-switching and perceptual decision-making individually. Here, we used a novel paradigm to manipulate and measure macaque monkeys’ task-belief, and demonstrated inextricable neuronal links between flexible task-belief and perceptual decision-making. We showed that in animals, but not artificial networks that performed as well or better than the animals, stronger task-belief is associated with better perception. Correspondingly, recordings from neuronal populations in cortical areas 7a and V1 revealed that stronger task-belief is associated with better discriminability of the believed-relevant but not the believed-irrelevant feature. Perception also impacts belief updating: noise fluctuations in V1 help explain how task-belief is updated. Our results demonstrate that complex tasks and multi-area recordings can reveal fundamentally new principles of how biology affects behavior in health and disease.

As the community detection is able to facilitate the discovery of hidden information in complex networks, it has been drawn a lot of attention recently. However, due to the growth in computational power and data storage, the scale of these complex networks has grown dramatically. In order to detect communities by utilizing global approaches, it is required to have all the global information of the whole network; something which is impossible, because of the rapid growth in the size of the networks. In this paper, a local approach has been proposed based on the detection and expansion of core nodes. First, a community’s central node (core node) which has a high level of embeddedness is detected based on the similarity between graph’s nodes. By using this, the total weights of a weighted graph’s edges created. Following by that, the expansion of these nodes will be considered, by utilizing the concept of node’s membership based on the definition of strong community for weighted graphs. It can be seen that in detecting communities, the more accurate the weights of edges detected based on the node similarity, the more precise the local algorithm will be. In fact, the algorithm has the ability to detect all the graph’s communities in a network using local information as well as identifying various roles of nodes, either being (core or outlier). Test results on both real-world and artificial networks prove that the quality of the communities which are detected by the proposed algorithm is better than the results which are achieved by other state-of-the-art algorithms in the complex networks.

We discuss the problem of locating the rumored origin in the social networks. Earlier works focused on network structure and sensor nodes; we concentrate on the timestamp of infected nodes. We recommend a two-stage algorithm to find the root node in a network using neighbor nodes' timestamp. In the first stage, discover the neighbor nodes with the minimal timestamp. Second, find the origin node using the minimal timestamp of the friend nodes. Simulations illustrate that our proposed two-stage algorithm works well and determines the root node within few hops. We evaluate our algorithm on small- scale networks, large-scale networks, and artificial networks. Our numerical results also show that our recommended two-stage algorithm operates well to discover the root node accurately, with a higher success rate and fewer distance error hops.

SummaryThe convergent evolution of the fly and mouse olfactory system led us to ask whether the anatomic connectivity and functional logic of olfactory circuits would evolve in artificial neural networks trained to perform olfactory tasks. Artificial networks trained to classify odor identity recapitulate the connectivity inherent in the olfactory system. Input units are driven by a single receptor type, and units driven by the same receptor converge to form a glomerulus. Glomeruli exhibit sparse, unstructured connectivity to a larger, expansion layer of Kenyon cells. When trained to both classify odor identity and to impart innate valence onto odors, the network develops independent pathways for identity and valence classification. Thus, the defining features of fly and mouse olfactory systems also evolved in artificial neural networks trained to perform olfactory tasks. This implies that convergent evolution reflects an underlying logic rather than shared developmental principles.

Social networking services (SNSs) are constantly used by a large number of people with various motivations and intentions depending on their social relationships and purposes, and thus, resulting in diverse strategies of posting/consuming content on SNSs. Therefore, it is important to understand the differences of the individual strategies depending on their network locations and surroundings. For this purpose, by using a game-theoretical model of users called agents and proposing a co-evolutionary algorithm called multiple-world genetic algorithm to evolve diverse strategy for each user, we investigated the differences in individual strategies and compared the results in artificial networks and those of the Facebook ego network. From our experiments, we found that agents did not select the free rider strategy, which means that just reading the articles and comments posted by other users, in the Facebook network, although this strategy is usually cost-effective and usually appeared in the artificial networks. We also found that the agents who mainly comment on posted articles/comments and rarely post their own articles appear in the Facebook network but do not appear in the connecting nearest-neighbor networks, although we think that this kind of user actually exists in real-world SNSs. Our experimental simulation also revealed that the number of friends was a crucial factor to identify users’ strategies on SNSs through the analysis of the impact of the differences in the reward for a comment on various ego networks.

We introduce and analyze a continuous time and state-space model of opinion cascades on networks of large numbers of agents that form opinions about two or more options. By leveraging our recent results on the emergence of agreement and disagreement states, we introduce novel tools to analyze and control agreement and disagreement opinion cascades. New notions of agreement and disagreement centrality, which depend only on network structure, are shown to be key to characterizing the nonlinear behavior of agreement and disagreement opinion formation and cascades. Our results are relevant for the analysis and control of opinion cascades in real-world networks, including biological, social, and artificial networks, and for the design of opinion-forming behaviors in robotic swarms. We illustrate an application of our model to a multi-robot task-allocation problem and discuss extensions and future directions opened by our modeling framework.

Traditional image recognition is mainly based on shallow neural networks, mainly including artificial networks, but these shallow neural networks have limited feature extraction capabilities. This paper can speed up the operation efficiency of the model, eliminate over-fitting, and improve the recognition accuracy by adding batch normalization layers to the neural network. The experiments are based on the MNIST data set, and have fully verified the recognition ability depth model proposed in this article.

With the development in the areas such as high performance graphic processing units (GPU), sensor technologies and artificial networks the goal of self-driving vehicles has never been closer. With the promise of massive decrease in the road accidents, self-driving cars have been the center of attention for the past few years. In this paper we discuss the major components of a self-driving vehicles along with the methodologies required to produce a self-driving vehicle. With the added advent of the 3D printed body our aim is to rapid prototype a 3D printed Electric Vehicle with the goal to test and improve the current self-driving algorithms. The chassis of the car, with an initial body design was simulated and tested along with some basic parameters such as vehicle speed acceleration and traction force. The paper also presents the simulated results of an end-to-end approach to steering vehicle using convolutional neural networks, that would later be the basis of the self-driving algorithm.

A social circle usually has some cores. Inspired by this phenomenon, we consider that a community in a complex network is also formed around one or several core vertices, called core region. We define the core score of a vertex to reflect its ability to attract other vertices. Utilizing the core scores of vertices, we address how to find the core region of one community, and then we apply local expansion and optimization to detect communities based on these core regions. Besides detecting community structure, our method can detect some abnormal vertices that are the hubs of network. Experimental results based on artificial networks and real-world networks show that our method is more effective than some usual methods.

Introduction Early judgment of the depth of burns is very important for the accurate formulation of treatment plans. In medical imaging the application of Artificial Intelligence has the potential for serving as a very experienced assistant to improve early clinical diagnosis. Due to lack of large volume of a particular feature, there has been almost no progress in burn field. Methods 484 early wound images are collected on patients who discharged home after a burn injury in 48 h, from five different levels of hospitals in Hunan Province China. According to actual healing time, all images are manually annotated by five professional burn surgeons and divided into three sets which are shallow(0–10 days), moderate(11–20 days) and deep(more than 21 days or skin graft healing). These ROIs were further divided into 5637 patches sizes 224 × 224 pixels, of which 1733 shallow, 1804 moderate, and 2100 deep. We used transfer learning suing a Pre-trained ResNet50 model and the ratio of all images is 7:1.5:1.5 for training:validation:test. Results A novel artificial burn depth recognition model based on convolutional neural network was established and the diagnostic accuracy of the three types of burns is about 80%. Discussion The actual healing time can be used to deduce the depth of burn involvement. The artificial burn depth recognition model can accurately infer healing time and burn depth of the patient, which is expected to be used for auxiliary diagnosis improvement.

The dynamic range of stimulus processing in living organisms is much larger than a single neural network can explain. For a generic, tunable spiking network we derive that while the dynamic range is maximal at criticality, the interval of discriminable intensities is very similar for any network tuning due to coalescence. Compensating coalescence enables adaptation of discriminable intervals. Thus, we can tailor an ensemble of networks optimized to the distribution of stimulus intensities, e.g., extending the dynamic range arbitrarily. We discuss potential applications in machine learning., 6 pages plus supplemental material

Duplication and divergence are two basic evolutionary mechanisms of bio-molecular networks. Real-world bio-molecular networks and their statistical characteristics can be well mimicked by artificial algorithms based on the two mechanisms. Bio-molecular networks consist of network motifs, which act as building blocks of large-scale networks. A fundamental question is how network motifs are evolved from long time evolution and natural selection. By considering the effect of various duplication and divergence strategies, it is founded that the underlying duplication scheme of the real-world undirected bio-molecular networks would rather follow the anti-preference strategy than the random one. The anti-preference duplication mechanism and the dimerization can lead to the formation of various motifs and robustly conserve proper quantities of motifs in the artificial networks as that in the real-world ones. Furthermore, the anti-preference mechanism and edge deletion divergence can robustly preserve the sparsity of the networks. The investigations reveal the possible evolutionary mechanisms of network motifs and have potential implications in the design, synthesis, and reengineering of biological networks for biomedical purpose.

Nowadays there is a boom in social network data streaming from various fields of interest related to finance, engineering, medicine, and general sciences. All these data are modeled as graphs for better analysis. Community detection is one such mechanism for the analysis of such massive data. Many community detection algorithms exist in literature. The existing algorithms are compared by using either real-world or artificial networks (modeled as graphs) but not both. This paper aims to make a comparative study of two popular existing community detection algorithms both on real-world and synthetic data and verify their performance. The approach in this paper makes good use of recent advances in graphical modeling of different social networks. We generated a random graph that represents most of the observed properties of a real-world dataset. The experimental results are tabulated and the computed metrics help in inferring the suitability or scalability of an algorithm for small or massive datasets.

Condition-specific modules in multiple networks must be determined to reveal the underlying molecular mechanisms of diseases. Current algorithms exhibit limitations such as low accuracy and high sensitivity to the number of networks because these algorithms discover condition-specific modules in multiple networks by separating specificity and modularity of modules. To overcome these limitations, we characterize condition-specific module as a group of genes whose connectivity is strong in the corresponding network and weak in other networks; this strategy can accurately depict the topological structure of condition-specific modules. We then transform the condition-specific module discovery problem into a clustering problem in multiple networks. We develop an efficient heuristic algorithm for the S pecific M odules in M ultiple N etworks ( SMMN ), which discovers the condition-specific modules by considering multiple networks. By using the artificial networks, we demonstrate that SMMN outperforms state-of-the-art methods. In breast cancer networks, stage-specific modules discovered by SMMN are more discriminative in predicting cancer stages than those obtained by other techniques. In pan-cancer networks, cancer-specific modules are more likely to associate with survival time of patients, which is critical for cancer therapy.

This study uses simulation over real and artificial networks to compare the eventual adoption outcomes of network interventions, operationalized as idealized contagion processes with different sets of seeds. While the performance depends on the details of both the network and behaviour adoption mechanisms, interventions with seeds that are central to the network are more effective than random selection in the majority of simulations, with faster or more complete adoption throughout the network. These results provide additional theoretical justification for utilizing relevant network information in the design of public health behavior interventions.

Measurement of the spreading capability of nodes has been one of the most attractive challenges in the field of social networks. Because of the huge number of nodes in a network, it has appealed to many researchers to find an accurate measure which can potentially detect the spreading capability and rankings of nodes. Most of the available methods determine the spreading capability of nodes based on their topological locations. In this paper, however, we have proposed a new measure based on the basic notions in information theory to detect the spreading capability of nodes in networks on the basis of their topological information. The simulation and experimental results of investigating real-world and artificial networks show that the proposed measure is more accurate and efficient than the similar ones.

Ranking influential nodes of networks is very meaningful for many applications, such as disease propagation inhibition and information dissemination control. Taking multiple attributes into consideration is a hopeful strategy. However, traditional multi-attribute ranking methods have some defects. Firstly, the computational complexity of these methods is usually higher than O(n), inapplicable to large scale social networks. Secondly, contributions of different attributes are viewed as equally important, leading to the limited improvement in performance. This paper proposes a multi-attribute ranking method based on node position and neighborhood, with low computational complexity O(n). The proposed method utilizes iteration information in the K-shell decomposition to further distinguish the node position and also fully considers the neighborhood’s effect upon the influence capability of a node. Furthermore, the entropy method is used to weight the node position and neighborhood attributes. Experiment results in terms of monotonicity, correctness and efficiency have demonstrated the good performance of the proposed method on both artificial networks and real world ones. It can efficiently and accurately provide a more reasonable ranking list than previous approaches.

Identifying the influential spreaders is an important issue in understanding and controlling the spreading processes in social networks. The key to the influential spreader identification problem is how to evaluate the spreading ability of the nodes. Centralities such as degree, semi-local centrality, betweenness, closeness, k-shell are usually used as evaluation metric. However, we observe that these centralities are sensitive not only to the spreading probability, but also to the network structure. We are not sure which centrality is efficient when we face a new network. In this paper, we propose a robust method named Adjustable multi-Hops Spreading (AHS). In AHS, we refine the influence of a node into direct influence and indirect influence, and then integrate them with a adjustable parameter. The experimental results in both real social networks and artificial networks show that AHS outperforms other centralities in effectiveness, robustness and the distinguish ability.

The present study aims to apply different methods to investigate effect of previous time of discharge and stage on modeling stage–discharge curve at two hydrometric stations (Faraman and Qorbaghestan stations of Qara Sou River) using measured data-set through the artificial networks (ANNs) and Genetic Expression Programming (GEP) techniques. Subsequently, stage and discharge data of several consecutive water years are applied as models input–output variables. The obtained results indicate that applied machine learning techniques (GEP and ANNs) have reliable performance in modeling stage–discharge curve and can be used instead of other methods. As well as previous time discharge and stage have positive influence on modeling stage–discharge curve.

Nonparametric cost estimation in construction projects with the use of artificial networks is presented as suitable mainly for the early estimates. These conceptual estimates are based on the variables – namely cost predictors that characterize the project or a facility. Data gathered on the basis of completed projects are combined together and applied to the current project cost estimation process. The aim of the paper is to discuss the opportunities and challenges of the approach based on the artificial intelligence tools to cost estimation of construction works. The proposed approach is based on the concept of nonparametric cost estimation and application of artificial neural networks. The author's idea and intention is to transfer the mechanisms of nonparametric cost estimating to the level of construction works. Neural networks, due to their general capabilities, seem to be a good tool to aid the proposed approach. The paper contains discussion of the proposed approach and its applicability.

The three-way representation of communities as a triple of positive, boundary and negative regions brings more insight into interpretation of communities.The overlapping regions are further refined into 4 macro types and 8 micro types.The three-way decision strategies are introduced to detect the overlapping communities based on the introduced relation-graph.A new fitness function is devised to adapt to processing networks with overlapping.The refinement of overlapping regions can reveal the different significance to impact forming or changing of communities. The identification of communities is crucial to an understanding of the structural and functional properties of a complex network. Many methods and algorithms have been developed to detect overlapping communities. A problem that has not been addressed satisfactorily is the relationship or difference between vertices in overlapping regions during the formation and growth of communities. This paper investigates methods that not only detect the overlapping communities but also refine the overlapping regions. We give a three-way representation of a community by using interval sets and re-formalize the problem of community detection as three-way clustering. We suggest four macro types and eight micro types of vertices to characterize members in overlapping regions for their refinement. We propose an overlapping community detection algorithm by classifying the vertices into core vertices, bone vertices, and trivial vertices. The main strategy of this algorithm is to find an initial cluster core, to expand the core to a preliminary community according to a new fitness function, and to merge trivial vertices based on three-way decision strategies. The experimental results on both real-world social networks and computer-generated artificial networks show the effectiveness and efficiency of the proposed methods.

Despite enormous progress in machine learning, artificial neural networks still lag behind brains in their ability to generalize to new situations. Given identical training data, differences in generalization are caused by many defining features of a learning algorithm, such as network architecture and learning rule. Their joint effect, called “inductive bias,” determines how well any learning algorithm—or brain—generalizes: robust generalization needs good inductive biases. Artificial networks use rather nonspecific biases and often latch onto patterns that are only informative about the statistics of the training data but may not generalize to different scenarios. Brains, on the other hand, generalize across comparatively drastic changes in the sensory input all the time. We highlight some shortcomings of state-of-the-art learning algorithms compared to biological brains and discuss several ideas about how neuroscience can guide the quest for better inductive biases by providing useful constraints on representations and network architecture.

Machine learning and artificial intelligence have become increasingly attractive for quantitative risk management in recent years. Today’s significantly enhanced computer power paves the way for the use of more complex models (e.g., artificial networks with a considerable number of nodes), which results in a much higher quality of results. Both the achievable enhanced quality of results as well as an enhanced familiarity with the methodology result in an increasing acceptance of these methods by financial regulators. In this article, we not only address the aspect of reliability of the results obtained using machine learning methods, but also indicate the impact on how credit risk parameters are modeled.

We propose a new ensemble clustering algorithm for graphs (ECG) which is based on the Louvain algorithm and the concept of consensus clustering. We validate our approach by replicating a recently published study comparing graph clustering algorithms over artificial networks, showing that ECG outperforms the leading algorithms from that study. We also illustrate how the ensemble obtained with ECG can be used to quantify the presence of community structure in the graph.

Studying the spread of infections is an important tool in limiting or preventing future outbreaks. A first step in understanding disease dynamics is constructing networks that reproduce features of real-world interactions. In this paper, we generate networks that maintain some features of the partial interaction networks that were recorded in an existing diary-based survey at the University of Warwick. To preserve realistic structure in our artificial networks, we use a context-specific approach. In particular, we propose different algorithms for producing larger home, work and social networks. Our networks are able to maintain much of the interaction structure in the original diary-based survey and provide a means of accounting for the interactions of survey participants with non-participants. Simulating a discrete susceptible–infected–recovered model on the full network produces epidemic behaviour which shares characteristics with previous influenza seasons. Our approach allows us to explore how disease transmission and dynamic responses to infection differ depending on interaction context. We find that, while social interactions may be the first to be reduced after influenza infection, limiting work and school encounters may be significantly more effective in controlling the overall severity of the epidemic.

The assessment of sustainability provides the actual situation of a site and provides information for decision making. In the Amazon, the assessment of the sustainability benefits of using adapted analytical models. However, this model is not always accurate. In this paper we propose a methodology that uses an artificial intelligence algorithm based on artificial neural networks (ANN), as a decision support tool, which aims to classify agroecosystems with agroforestry systems and without agroforestry systems. The sites are classified into two groups: Sustainable and Not Sustainable. For data collection we carried out technical visits to the rural community of Santa Luzia, in the municipality of Tome-Acu, Para Amazon. During the research data of 28 production units were collected. Finally, the data were submitted to the ANN and the results demonstrate the high potential of using computational intelligence algorithms for the purpose of monitoring the agroforestry systems in the Amazon region.

Recent work investigating the development of the phonological lexicon, where edges between words represent phonological similarity, have suggested that phonological network growth may be partly driven by a process that favors the acquisition of new words that are phonologically similar to several existing words in the lexicon. To explore this growth mechanism, we conducted a simulation study to examine the properties of networks grown by inverse preferential attachment, where new nodes added to the network tend to connect to existing nodes with fewer edges. Specifically, we analyzed the network structure and degree distributions of artificial networks generated via either preferential attachment, an inverse variant of preferential attachment, or combinations of both network growth mechanisms. The simulations showed that network growth initially driven by preferential attachment followed by inverse preferential attachment led to densely-connected network structures (i.e., smaller diameters and average shortest path lengths), as well as degree distributions that could be characterized by non-power law distributions, analogous to the features of real-world phonological networks. These results provide converging evidence that inverse preferential attachment may play a role in the development of the phonological lexicon and reflect processing costs associated with a mature lexicon structure.

Use of artificial networks to signify the onset of dynamic catastrophes in engineering systems is a simple and efficient strategy. Here an ordinal partition network and its construction from time series are introduced. The selection of mapping parameter is discussed in detail, which may significantly enhance the performance of the proposed method. Topological properties of the resulting network can sensitively detect the dynamic changes of original underlying systems, making the strategy workable. A Catastrophe Prediction Index (CPI) is proposed to serve as a monitoring indicator for pre-warning catastrophe events. The numerical results verify the feasibility of the proposed method.

It has been found that many networks display community structure, analysis of the com-munity structure in the network is meaningful for understanding the real-world network. Recently, many community discovery methods have been proposed, most of which are based on the assumption that nodes in the network can only belong to a community at most. The proposed method in the paper is based on the affinity between nodes and it does not agree with the assumption, i.e., the method is able to discover overlapping community structures in networks. We apply the method to various real-world networks and artificial networks, the experimental results confirm that it has better performance on networks with overlapping community structures and non-overlapping community structures.

The encoding of the spatial-temporal archeological, historical and anthropological records can be considered an ideal-typical representation of the human reasoning and thus also an artificial membrane interposed between the researcher and the past. These membranes are here considered artificial networks and can undergo interrogation processes through the most advanced analytical tools for learning and modeling complex configurations. The aim of this paper is to synthesize recent advances in Artificial Intelligence and Computer Science and – at the same time – to support the connectionists and symbolic computational paradigms as a new epistemic frontier in the automatic annotation of tangible and intangible heritage as well in the contemporary theories and methods of the archeological thought.

Social networks display community structures of interest, which have to be uncovered to understand the latent relationships present in them. These networks are composed of loosely connected small clusters, whose structure is more convenient for analysis. Graph clustering algorithms have been developed to identify communities in real or artificial networks using structural characteristics of the network. Determining the efficiency of such techniques with respect to accuracy and computational time is an open question in the absence of ground truth labels for the underlying communities as is seen in most real-world situations. In this study, performance of eight state-of-the-art graph clustering algorithms are demonstrated on small egocentric graphs, obtained from Facebook. The results are used for objective evaluation and a critical discussion is presented.

Green infrastructure can be considered as all-natural, semi-natural and artificial networks of multifunctional ecological systems within, around and between urban areas, at all spatial scales. In this chapter, the authors cover how different components of green infrastructure (GI) project management relate to environmental justice (EJ) issues. Some of the key questions that they raise are: In what ways does assessing benefits of restoration using standard economic measures fall short of EJ goals? In what ways does GI implementation reinforce existing dynamics and values versus transforming them? The authors then cover a review of ecosystem services that urban waterways can provide with an emphasis on cultural services, ways of assessing ecosystems service and some case studies of applied ecosystem service assessment of benefits as well as environmental justice impacts to urban waterway communities. They explores green infrastructure using the lens of environmental justice, identifying several challenges and limitations that arise in connection with the context of restoration projects.

Production systems required much information to be properly design. Artificial neural networks seems to be perfect solution for analysis of such amount of data. However to gain useful output from artificial networks data have to be correctly prepared. This article shows a thinking-process of obtaining correct criteria for each step of systems designing process. Research goes through basics of knowledge management in production companies that gives further ideas for criteria prioritizing. Different criteria was dedicated to different management approach based of production unit complexity.

Community detection has been paid much attention, and a large number of community-detection methods have been proposed in the last decade. Spectral methods are widely used in many applications due to their solid mathematical foundations. In this paper, we propose a hybrid spectral method to effectively identify communities from networks. This method begins with a network-sparsification operation, which is expected to remove some between-community edges from the network to make the community boundaries clearer and sharper, then it utilizes an iterative spectral bisection algorithm to partition the network into small communities, and finally some of the small communities are merged to obtain the resulting community structure. We conducted extensive experiments on five real-world networks and two artificial networks, the experimental results show that our proposed method can extract high-quality community structures from networks effectively.

A metabolic network model provides a computational framework for studying the metabolism of a cell at the system level. The organization of metabolic networks has been investigated in different studies. One of the organization aspects considered in these studies is the decomposition of a metabolic network. The decompositions produced by different methods are very different and there is no comprehensive evaluation framework to compare the results with each other. In this study, these methods are reviewed and compared in the first place. Then they are applied to six different metabolic network models and the results are evaluated and compared based on two existing and two newly proposed criteria. Results show that no single method can beat others in all criteria but it seems that the methods introduced by Guimera and Amaral and Verwoerd do better on among metabolite-based methods and the method introduced by Sridharan et al. does better among reaction-based ones. Also, the methods are applied to several artificial networks, each constructed from merging a few KEGG pathways. Then, their capability to recover those pathways are compared. Results show that among metabolite-based methods, the method of Guimera and Amaral does better again, however, no notable difference between the performances of reaction-based methods was detected.

Spiking Neural Networks (SNNs) are artificial networks inspired by the biological brain and are used to study various aspects of brainlike-computing. SNNs are typically computed using general-purpose processors. However, with the recent maturity of High-Level Synthesis (HLS) tools, system developers can now accelerate their design on Field-Programmable Gate-Arrays (FPGA) with small to minimal impact in productivity. The present work focuses on accelerating SNNs on FPGAs. We show how OpenCL for FPGAs can be leveraged to accelerate two different but equally important neuron models, including axons and synapses, and empirically quantify the performance of our designs, reaching performance up to 2.25 GSpikes/second.

Technological advances have dramatically expanded our ability to probe multi-neuronal dynamics and connectivity in the brain. However, our ability to extract a simple conceptual understanding from complex data is increasingly hampered by the lack of theoretically principled data analytic procedures, as well as theoretical frameworks for how circuit connectivity and dynamics can conspire to generate emergent behavioral and cognitive functions. We review and outline potential avenues for progress, including new theories of high dimensional data analysis, the need to analyze complex artificial networks, and methods for analyzing entire spaces of circuit models, rather than one model at a time. Such interplay between experiments, data analysis and theory will be indispensable in catalyzing conceptual advances in the age of large-scale neuroscience., 11 pages, 3 figures

The participation of a node in more than one community is a common phenomenon in complex networks. However most existing methods, fail to identify nodes with multiple community affiliation, correctly. In this paper, a unique method to define overlapping community in complex networks is proposed, using the overlapping neighborhood ratio to represent relations between nodes. Matrix factorization is then utilized to assign nodes into their corresponding community structures. Moreover, the proposed method demonstrates the use of Perron clusters to estimate the number of overlapping communities in a network. Experimental results in real and artificial networks show, with great accuracy, that the proposed method succeeds to recover most of the overlapping communities existing in the network.

In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a node community can be defined as a subgraph induced by a set of nodes, while a link community is a subgraph induced by a set of links. Although most researches pay more attention to identifying node communities in both unipartite and bipartite networks, some researchers have investigated the link community detection problem in unipartite networks. But current research pays little attention to the link community detection problem in bipartite networks. In this paper, we investigate the link community detection problem in bipartite networks, and formulate it into an integer programming model. We proposed a genetic algorithm for partition the bipartite network into overlapping link communities. Simulations are done on both artificial networks and real-world networks. The results show that the bipartite network can be efficiently partitioned into overlapping link communities by the genetic algorithm.