Insights into microbiota community dynamics and flavor development mechanism during golden pomfret(Trachinotus ovatus)fermentation based on single-molecule real-time sequencing and molecular networking analysis

Popular fermented golden pomfret(Trachinotus ovatus)is prepared via spontaneous fermentation;however,the mechanisms underlying the regulation of its flavor development remain unclear.This study shows the roles of the complex microbiota and the dynamic changes in microbial community and flavor compounds during fish fermentation.Single-molecule real-time sequencing and molecular networking analysis revealed the correlations among different microbial genera and the relationships between microbial taxa and volatile compounds.Mechanisms underlying flavor development were also elucidated via KEGG based functional annotations.Clostridium,Shewanella,and Staphylococcus were the dominant microbial genera.Forty-nine volatile compounds were detected in the fermented fish samples,with thirteen identified as characteristic volatile compounds(ROAV>1).Volatile profiles resulted from the interactions among the microorganisms and derived enzymes,with the main metabolic pathways being amino acid biosynthesis/metabolism,carbon metabolism,and glycolysis/gluconeogenesis.This study demonstrated the approaches for distinguishing key microbiota associated with volatile compounds and monitoring the industrial production of high-quality fermented fish products.

Effect of land use on soil nematode community composition and co-occurrence network relationship

Land use influences soil biota community composition and diversity,and then belowground ecosystem processes and functions.To characterize the effect of land use on soil biota,soil nematode communities in crop land,forest land and fallow land were investigated in six regions of northern China.Generic richness,diversity,abundance and biomass of soil nematodes was the lowest in crop land.The richness and diversity of soil nematodes were 28.8and 15.1%higher in fallow land than in crop land,respectively.No significant differences in soil nematode indices were found between forest land and fallow land,but their network keystone genera composition was different.Among the keystone genera,50%of forest land genera were omnivores-predators and 36%of fallow land genera were bacterivores.The proportion of fungivores in forest land was 20.8%lower than in fallow land.The network complexity and the stability were lower in crop land than forest land and fallow land.Soil pH,NH_(4)^(+)-N and NO_(3)^(–)-N were the major factors influencing the soil nematode community in crop land while soil organic carbon and moisture were the major factors in forest land.Soil nematode communities in crop land influenced by artificial management practices were more dependent on the soil environment than communities in forest land and fallow land.Land use induced soil environment variation and altered network relationships by influencing trophic group proportions among keystone nematode genera.

Dynamic analysis of major public health emergency transmission considering the dual-layer coupling of community–resident complex networks

We construct a dual-layer coupled complex network of communities and residents to represent the interconnected risk transmission network between communities and the disease transmission network among residents. It characterizes the process of infectious disease transmission among residents between communities through the SE2IHR model considering two types of infectors. By depicting a more fine-grained social structure and combining further simulation experiments, the study validates the crucial role of various prevention and control measures implemented by communities as primary executors in controlling the epidemic. Research shows that the geographical boundaries of communities and the social interaction patterns of residents have a significant impact on the spread of the epidemic, where early detection, isolation and treatment strategies at community level are essential for controlling the spread of the epidemic. In addition, the study explores the collaborative governance model and institutional advantages of communities and residents in epidemic prevention and control.

Expert Recommendation in Community Question Answering via Heterogeneous Content Network Embedding

ExpertRecommendation(ER)aims to identify domain experts with high expertise and willingness to provide answers to questions in Community Question Answering(CQA)web services.How to model questions and users in the heterogeneous content network is critical to this task.Most traditional methods focus on modeling questions and users based on the textual content left in the community while ignoring the structural properties of heterogeneous CQA networks and always suffering from textual data sparsity issues.Recent approaches take advantage of structural proximities between nodes and attempt to fuse the textual content of nodes for modeling.However,they often fail to distinguish the nodes’personalized preferences and only consider the textual content of a part of the nodes in network embedding learning,while ignoring the semantic relevance of nodes.In this paper,we propose a novel framework that jointly considers the structural proximity relations and textual semantic relevance to model users and questions more comprehensively.Specifically,we learn topology-based embeddings through a hierarchical attentive network learning strategy,in which the proximity information and the personalized preference of nodes are encoded and preserved.Meanwhile,we utilize the node’s textual content and the text correlation between adjacent nodes to build the content-based embedding through a meta-context-aware skip-gram model.In addition,the user’s relative answer quality is incorporated to promote the ranking performance.Experimental results show that our proposed framework consistently and significantly outperforms the state-of-the-art baselines on three real-world datasets by taking the deep semantic understanding and structural feature learning together.The performance of the proposed work is analyzed in terms of MRR,P@K,and MAP and is proven to be more advanced than the existing methodologies.

Robustness of community networks against cascading failures with heterogeneous redistribution strategies

Network robustness is one of the core contents of complex network security research.This paper focuses on the robustness of community networks with respect to cascading failures,considering the nodes influence and community heterogeneity.A novel node influence ranking method,community-based Clustering-LeaderRank(CCL)algorithm,is first proposed to identify influential nodes in community networks.Simulation results show that the CCL method can effectively identify the influence of nodes.Based on node influence,a new cascading failure model with heterogeneous redistribution strategy is proposed to describe and analyze node fault propagation in community networks.Analytical and numerical simulation results on cascading failure show that the community attribute has an important influence on the cascading failure process.The network robustness against cascading failures increases when the load is more distributed to neighbors of the same community instead of different communities.When the initial load distribution and the load redistribution strategy based on the node influence are the same,the network shows better robustness against node failure.

Research on Community Structure in Bus Transport Networks

We abstract the bus transport networks(BTNs)to two kinds of complex networks with space L and spaceP methods respectively.Using improved community detecting algorithm(PKM agglomerative algorithm),we analyzethe community property of two kinds of BTNs graphs.The results show that the BTNs graph described with space Lmethod have obvious community property,but the other kind of BTNs graph described with space P method have not.The reason is that the BTNs graph described with space P method have the intense overlapping community propertyand general community division algorithms can not identify this kind of community structure.To overcome this problem,we propose a novel community structure called N-depth community and present a corresponding community detectingalgorithm,which can detect overlapping community.Applying the novel community structure and detecting algorithmto a BTN evolution model described with space P,whose network property agrees well with real BTNs',we get obviouscommunity property.

Generating weighted community networks based on local events

Many realistic networks have community structures, namely, a network consists of groups of nodes within which links are dense but among which links are sparse. This paper proposes a growing network model based on local processes, the addition of new nodes intra-community and new links intra- or inter-community. Also, it utilizes the preferential attachment for building connections determined by nodes＇ strengths, which evolves dynamically during the growth of the system. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes＇ degrees and strengths.

Synchronization of coupled logistic maps on random community networks

The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter rn, and the other is the ratio σ of the connection probability p of each pair of nodes within each community to the connection probability q of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger rn and smaller σ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.

Supply Community Network:A Taxonomy of Flow Dimensions

Supply chain management(SCM)and its associated activities continue to evolve as new communication technologies and cooperative efforts emerge to facilitate system-wide process integration;the context within which supply chains(SCs)operate,the technologies,and performance enhancement mechanisms have all changed.Thus,linear-based SCs are increasingly being challenged as firms look towards a more networked approach to maximize performance amid growing market dynamics.This paper,however,recognizing inherent similarities between social structure of Social Internet of Things(SIoT)principles and what we term supply community networks(SCN)from literature,seeks to cross-pollinate the two in a way capable of dealing with these market dynamics.Our contribution is,therefore,a new‘setting’of social relationships between supply community agents(SCA)within SCN mirroring interactions played out in the physical world;SCAs autonomously sense each other,exchange information and interact within SCN mimicking the behavior of humans.Also,it identifies the bounds of flow,i.e.all possible dimensions within a SCN which need to be understood to support relationship management.Therefore,communications are improved,sharpening SCAs synchronization in a way responsive to customer needs.

LC-NPLA: Label and Community Information-Based Network Presentation Learning Algorithm

Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some limitations.For instance,only the structural information of nodes is considered when these kinds of algorithms are constructed.Aiming at this issue,a label and community information-based network presentation learning algorithm(LC-NPLA)is proposed in this paper.First of all,by using the community information and the label information of nodes,the first-order neighbors of nodes are reconstructed.In the next,the random walk strategy is improved by integrating the degree information and label information of nodes.Then,the node sequence obtained from random walk sampling is transformed into the node representation vector by the Skip-Gram model.At last,the experimental results on ten real-world networks demonstrate that the proposed algorithm has great advantages in the label classification,network reconstruction and link prediction tasks,compared with three benchmark algorithms.

Community detection on elite mathematicians’collaboration network

Purpose:This study focuses on understanding the collaboration relationships among mathematicians,particularly those esteemed as elites,to reveal the structures of their communities and evaluate their impact on the field of mathematics.Design/methodology/approach:Two community detection algorithms,namely Greedy Modularity Maximization and Infomap,are utilized to examine collaboration patterns among mathematicians.We conduct a comparative analysis of mathematicians’centrality,emphasizing the influence of award-winning individuals in connecting network roles such as Betweenness,Closeness,and Harmonic centrality.Additionally,we investigate the distribution of elite mathematicians across communities and their relationships within different mathematical sub-fields.Findings:The study identifies the substantial influence exerted by award-winning mathematicians in connecting network roles.The elite distribution across the network is uneven,with a concentration within specific communities rather than being evenly dispersed.Secondly,the research identifies a positive correlation between distinct mathematical sub-fields and the communities,indicating collaborative tendencies among scientists engaged in related domains.Lastly,the study suggests that reduced research diversity within a community might lead to a higher concentration of elite scientists within that specific community.Research limitations:The study’s limitations include its narrow focus on mathematicians,which may limit the applicability of the findings to broader scientific fields.Issues with manually collected data affect the reliability of conclusions about collaborative networks.Practical implications:This study offers valuable insights into how elite mathematicians collaborate and how knowledge is disseminated within mathematical circles.Understanding these collaborative behaviors could aid in fostering better collaboration strategies among mathematicians and institutions,potentially enhancing scientific progress in mathematics.Originality/value:The study adds value to understanding collaborative dynamics within the realm of mathematics,offering a unique angle for further exploration and research.

Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

Advanced Community Identification Model for Social Networks

Community detection in social networks is a hard problem because of the size,and the need of a deep understanding of network structure and functions.While several methods with significant effort in this direction have been devised,an outstanding open problem is the unknown number of communities,it is generally believed that the role of influential nodes that are surrounded by neighbors is very important.In addition,the similarity among nodes inside the same cluster is greater than among nodes from other clusters.Lately,the global and local methods of community detection have been getting more attention.Therefore,in this study,we propose an advanced communitydetection model for social networks in order to identify network communities based on global and local information.Our proposed model initially detects the most influential nodes by using an Eigen score then performs local expansion powered by label propagation.This process is conducted with the same color till nodes reach maximum similarity.Finally,the communities are formed,and a clear community graph is displayed to the user.Our proposed model is completely parameter-free,and therefore,no prior information is required,such as the number of communities,etc.We perform simulations and experiments using well-known synthetic and real network benchmarks,and compare them with well-known state-of-the-art models.The results prove that our model is efficient in all aspects,because it quickly identifies communities in the network.Moreover,it can easily be used for friendship recommendations or in business recommendation systems.

Social Networks and Citizen Participation in the Collaborative Community Policing ——A Case Study of S Community in Beijing

It is of great significance to enhance collaborative community policing for crime prevention and better community-police relationships. Understanding the relational structure of collaborative community policing is necessary to pinpoint the pattern of interactions among key actors involved in community policing and improve the effectiveness of network governance. Based on 234 surveys of citizens of S Community in Beijing from April 2017 to May 2017, this paper empirically examines the characteristics of formal network and informal network of citizen participation in the collaborative community policing. Beijing is widely known for its active involvement of neighborhood volunteers in different types of community policing. We focused on four different types of interpersonal work relationships in this study： workflow, problem solving, mentoring and friendship, among resident committees, neighborhood administrative offices, media, police station, business security personnel, neighborhood volunteers, and security activists. The nature of relationships between individuals in networks can be treated as from instrumental ties to expressive ties. Expressive ties cover relationships that involve the exchange of friendship, trust, and socio-emotional support. We extended this intra-organizational insight into a community policing inter-organizational context. The collaborative network showed the trend of the distributed network. The clustering analysis showed that in the workflow network, we should make thll use of the close interaction between the citizens and activists in the community. Meanwhile, in the problem-solving network, mentoring network and friendship network, interactions between citizens and neighborhood committee are weak.

A Weighted Evolving Network with Community Size Preferential Attachment

Community structure is an important characteristic in real complex network.It is a network consists ofgroups of nodes within which links are dense but among which links are sparse.In this paper, the evolving network includenode, link and community growth and we apply the community size preferential attachment and strength preferentialattachment to a growing weighted network model and utilize weight assigning mechanism from BBV model.Theresulting network reflects the intrinsic community structure with generalized power-law distributions of nodes'degreesand strengths.

Probability Distribution of Edge in Adjacent Matrix of Aviation Network of China and Algorithm of Searching Non-overlap Community Structure Based on Complex Network

In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.

Cascades with coupled map lattices in preferential attachment community networks

In this paper, cascading failure is studied by coupled map lattice （CML） methods in preferential attachment community networks. It is found that external perturbation R is increasing with modularity Q growing by simulation. In particular, the large modularity Q can hold off the cascading failure dynamic process in community networks. Furthermore, different attack strategies also greatly affect the cascading failure dynamic process. It is particularly significant to control cascading failure process in real community networks.

A genetic algorithm for community detection in complex networks

A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.

Back propagation artificial neural network for community Alzheimer's disease screening in China

AIzheimer＇s disease patients diagnosed with the Chinese Classification of Mental Disorders diagnostic criteria were selected from the community through on-site sampling. Levels of macro and trace elements were measured in blood samples using an atomic absorption method, and neurotransmitters were measured using a radioimmunoassay method. SPSS 13.0 was used to establish a database, and a back propagation artificial neural network for Alzheimer＇s disease prediction was simulated using Clementine 12.0 software. With scores of activities of daily living, creatinine, 5-hydroxytryptamine, age, dopamine and aluminum as input variables, the results revealed that the area under the curve in our back propagation artificial neural network was 0.929 （95% confidence interval： 0.868-0.968）, sensitivity was 90.00%, specificity was 95.00%, and accuracy was 92.50%. The findings indicated that the results of back propagation artificial neural network established based on the above six variables were satisfactory for screening and diagnosis of Alzheimer＇s disease in patients selected from the community.

Detecting community structure using label propagation with consensus weight in complex network

Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm （LPA） is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight （LPAcw）, and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions.