Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network f...Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network functionalities.Network dismantling aims to find the smallest set of nodes such that after their removal the network is broken into connected components of sub-extensive size.To overcome the limitations and drawbacks of existing network dismantling methods,this paper focuses on network dismantling problem and proposes a neighbor-loop structure based centrality metric,NL,which achieves a balance between computational efficiency and evaluation accuracy.In addition,we design a novel method combining NL-based nodes-removing,greedy tree-breaking and reinsertion.Moreover,we compare five baseline methods with our algorithm on ten widely used real-world networks and three types of model networks including Erd€os-Renyi random networks,Watts-Strogatz smallworld networks and Barabasi-Albert scale-free networks with different network generation parameters.Experimental results demonstrate that our proposed method outperforms most peer methods by obtaining a minimal set of targeted attack nodes.Furthermore,the insights gained from this study may be of assistance to future practical research into real-world networks.展开更多
Using a statistical method which is based on random matrix theory, the results for the nearest-neighbor energy spacing distributions E(S) obtained from experimental as well as from computational data have been selecte...Using a statistical method which is based on random matrix theory, the results for the nearest-neighbor energy spacing distributions E(S) obtained from experimental as well as from computational data have been selected for review study. The obtained results confirm that the energy spacing correlation between secondary charged particles depends upon the charged particles multiplicity and central collisions are also associated with charged particles multiplicity.展开更多
Let p be a prime. For any finite p-group G, the deep transfers T H,G ' : H / H ' → G ' / G " from the maximal subgroups H of index (G:H) = p in G to the derived subgroup G ' are introduced as an ...Let p be a prime. For any finite p-group G, the deep transfers T H,G ' : H / H ' → G ' / G " from the maximal subgroups H of index (G:H) = p in G to the derived subgroup G ' are introduced as an innovative tool for identifying G uniquely by means of the family of kernels ùd(G) =(ker(T H,G ')) (G: H) = p. For all finite 3-groups G of coclass cc(G) = 1, the family ùd(G) is determined explicitly. The results are applied to the Galois groups G =Gal(F3 (∞)/ F) of the Hilbert 3-class towers of all real quadratic fields F = Q(√d) with fundamental discriminants d > 1, 3-class group Cl3(F) □ C3 × C3, and total 3-principalization in each of their four unramified cyclic cubic extensions E/F. A systematic statistical evaluation is given for the complete range 1 d 7, and a few exceptional cases are pointed out for 1 d 8.展开更多
The beneficial acclimation hypothesis (BAH) predicts that animals acclimated to a particular temperature have enhanced performance or fitness at that temperature in comparison with animals acclimated to other temperat...The beneficial acclimation hypothesis (BAH) predicts that animals acclimated to a particular temperature have enhanced performance or fitness at that temperature in comparison with animals acclimated to other temperatures. The BAH has been tested by a variety of empirical examinations, and was rejected by some of them. In order to provide new evidences for the BAH, the effects of acute and acclimation temperature (AT) on locomotor performance of Macrobiotus hufelandi (Tardigrada: Macrobiotidae) were investigated. The tardigrades were collected from Nanwutai, Qinling Mountains which traverse from west to east in central China. The subjects were acclimated to either 2℃ or 22℃ for 2 weeks. The animal was transferred onto a frosted slide and allowed to walk freely at the performance temperature (PT) 2℃ or 22℃. Only one individual was tested per test bout, which lasted from three to five minutes. To avoid occurrence of thermal acclimation effect, the standard adaptation time was limited to 1.5 min. Each subject was tested for once at the same PT, and was tested only at one PT. A total of 25 individuals were tested and measured at the same PT. The locomotor performance of the animals was recorded with a digital video camera mounted on a microscope at 4×10 amplification and replayed on a PC. Every subject was identified. Walking speed (WS) and percentage of time moving (PTM) at both PTs (2℃ or 22℃) were selected as the rate parameters of locomotor performance. The two-way repeated measures ANOVA with a significance level of α= 0.05 and Duncan multiple range test were used to analyze the data. WS of the animals acclimated to and tested at the same temperatures was significantly faster than that for animals acclimated to and tested at the different temperatures, similarly, PTM of the animals acclimated to 22℃ and tested at 22℃ was significantly greater than PTM of animals acclimated to 22℃ and tested at 2℃, which indicated that the animals acclimated to a particular temperature have enhanced locomotor performance in that temperature relative to the animals acclimated to that temperature in other thermal environment. WS of the animals acclimated to 22℃ and tested at 22℃ was significantly faster than WS of animals acclimated to 2℃ and tested at 22℃, PTM of the animals acclimated to 22℃ and tested at 22℃ was significantly greater than PTM of animals acclimated to 2℃ and tested at 22℃. These results supported the BAH. It could be concluded that the PT and thermal acclimation as well as the interaction between the PT and AT significantly influence the locomotor performance of M.hufelandi, and that, despite the existence of a few results of this study that don’t support the BAH, some results of this study support for this hypothesis, and that the animals acclimated to a particular temperature have enhanced locomotor performance in that temperature relative to the animals acclimated to that temperature in other thermal environment, implying that any performance temperature that deviates from the acclimation temperature could cause the reduction of the walking speed which is closely related to the fitness of the M.hufelandi.展开更多
In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by de...In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by developing a novel iterative algorithm for computing a set of tensor equations. Under some conditions, the existence and uniqueness of this centrality were proven by applying the Brouwer fixed point theorem. Furthermore, the convergence of the proposed iterative algorithm was established. Finally, numerical experiments on a simple multilayer network and two real-world multilayer networks(i.e., Pierre Auger Collaboration and European Air Transportation Networks) are proposed to illustrate the effectiveness of the proposed algorithm and to compare it to other existing centrality measures.展开更多
Network is considered naturally as a wide range of different contexts, such as biological systems, social relationships as well as various technological scenarios. Investigation of the dynamic phenomena taking place i...Network is considered naturally as a wide range of different contexts, such as biological systems, social relationships as well as various technological scenarios. Investigation of the dynamic phenomena taking place in the network, determination of the structure of the network and community and description of the interactions between various elements of the network are the key issues in network analysis. One of the huge network structure challenges is the identification of the node(s) with an outstanding structural position within the network. The popular method for doing this is to calculate a measure of centrality. We examine node centrality measures such as degree, closeness, eigenvector, Katz and subgraph centrality for undirected networks. We show how the Katz centrality can be turned into degree and eigenvector centrality by considering limiting cases. Some existing centrality measures are linked to matrix functions. We extend this idea and examine the centrality measures based on general matrix functions and in particular, the logarithmic, cosine, sine, and hyperbolic functions. We also explore the concept of generalised Katz centrality. Various experiments are conducted for different networks generated by using random graph models. The results show that the logarithmic function in particular has potential as a centrality measure. Similar results were obtained for real-world networks.展开更多
In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrali...In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.展开更多
The zero-degree calorimeter(ZDC)plays a crucial role toward determining the centrality in the Cooling-Storage-Ring External-target Experiment(CEE)at the Heavy Ion Research Facility in Lanzhou.A boosted decision tree(B...The zero-degree calorimeter(ZDC)plays a crucial role toward determining the centrality in the Cooling-Storage-Ring External-target Experiment(CEE)at the Heavy Ion Research Facility in Lanzhou.A boosted decision tree(BDT)multi-classification algorithm was employed to classify the centrality of the collision events based on the raw features from ZDC such as the number of fired channels and deposited energy.The data from simulated^(238)U+^(238)U collisions at 500 MeV∕u,generated by the IQMD event generator and subsequently modeled using the GEANT4 package,were employed to train and test the BDT model.The results showed the high accuracy of the multi-classification model adopted in ZDC for centrality determination,which is robust against variations in different factors of detector geometry and response.This study demon-strates the good performance of CEE-ZDC in determining the centrality in nucleus-nucleus collisions.展开更多
Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlat...Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.展开更多
The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based fea...The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.展开更多
My essay on Heart of Darkness explores Conrad’s dramatization of the voice and heart dynamic in the novella as a penetration of the deep-lying rationale of colonial operation and more generally the human condition at...My essay on Heart of Darkness explores Conrad’s dramatization of the voice and heart dynamic in the novella as a penetration of the deep-lying rationale of colonial operation and more generally the human condition at the turn of the 20th century.Three different forms of assumed centrality in the novella-capital,Eurocentrism,and the African interior as detrimental void symbolized by the heart of darkness form concentric circles that interconnect and work in concert as the core colonial ideology and produce a sense of incongruity and absurdity.The voice of this colonial ideological apparatus disguised as the universal subject of humanity and rationality finds its best expression in the eloquence of Kurtz,the specimen of culture seduced by its very opposite-the wilderness-right in the heart of darkness.“The horror”,as his final verdict of life as a European with real intent of living on his own terms at the turn of the 20th century,sums up the predicament of a civilization with too much culture and self-absorption for its own good.展开更多
Let F be a number field and p be a prime. In the successive approximation theorem, we prove that, for each integer n ≥ 1, finitely many candidates for the Galois group of the nth stage of the p-class tower over F are...Let F be a number field and p be a prime. In the successive approximation theorem, we prove that, for each integer n ≥ 1, finitely many candidates for the Galois group of the nth stage of the p-class tower over F are determined by abelian type invariants of p-class groups C1pE of unramified extensions E/F with degree [E : F] = pn-1. Illustrated by the most extensive numerical results available currently, the transfer kernels (TE, F) of the p-class extensions TE, F : C1pF → C1pE from F to unramified cyclic degree-p extensions E/F are shown to be capable of narrowing down the number of contestants significantly. By determining the isomorphism type of the maximal subgroups S G of all 3-groups G with coclass cc(G) = 1, and establishing a general theorem on the connection between the p-class towers of a number field F and of an unramified abelian p-extension E/F, we are able to provide a theoretical proof of the realization of certain 3-groups S with maximal class by 3-tower groups of dihedral fields E with degree 6, which could not be realized up to now.展开更多
The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading process.This problem finds man...The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading process.This problem finds many practical applications in numerous areas such as information dissemination,epidemic immunity,and viral marketing.However,most existing influence maximization algorithms are limited by the“rich-club”phenomenon and are thus unable to avoid the influence overlap of seed spreaders.This work proposes a novel adaptive algorithm based on a new gravity centrality and a recursive ranking strategy,named AIGCrank,to identify a set of influential seeds.Specifically,the gravity centrality jointly employs the neighborhood,network location and topological structure information of nodes to evaluate each node's potential of being selected as a seed.We also present a recursive ranking strategy for identifying seed nodes one-byone.Experimental results show that our algorithm competes very favorably with the state-of-the-art algorithms in terms of influence propagation and coverage redundancy of the seed set.展开更多
Sub-Saharan African cities are uniquely characterized by retail competition influencing outlet location.This work focused on revealing retail outlet location in Uyo and its relationship with distances from the Central...Sub-Saharan African cities are uniquely characterized by retail competition influencing outlet location.This work focused on revealing retail outlet location in Uyo and its relationship with distances from the Central Business Districts.Distance was measured along the six major arterial roads that link the city to the central business districts by the use of Google Map[5]Distance Calculator and itouch maps[7]technology.Six arteries were divided into four distinct spaces in kilometers namely 0-1km,1-2km,2-3km,3-4km.Retail Outlets were grouped into ten classes.Data was analysed using distance in kilometers from the Central Business District as variable Y1.The independent variables X1,X2,X3,X4,X5 and X6 were the six major arteries represented by the location of each specific retail outlet group.Utilising SPSS version 20 software the results reflected centre a 47.9 percent variation in retail outlets location with correlation coefficient(R)of 69.2%revealing a strong relationship between the distances from the Central Business Districts and the location of retail outlets located across the six major arteries.H1 was accepted which states a significant relationship in the location of retail outlets as distance increase from the city centre across the linkages.This confirms a strong intensity of location of retail outlets in the city centre with a gradual decline as distance increase from the centre.Although there was an increase in intensity of retail outlets in junctions away from the Central Business Districts according to multiple nuclei concept.It is recommended that urban expansion through growth poles.Aim:To access the relationship between retail outlets location and distance from central business district in a Uyo.Research Questions:This work provided answers to the following questions:1.Where are these retail outlets located in the city space?2.What is the relationship between Retail outlets and the distance from the City Centre?Objectives:1.To explain the distribution of location of retail outlets in city space.2.To reveal the relationship between Retail Outlets and distance from the City Centre.Hypothesis:There is no significant relationship between the distance from the central business district and the location of retail outlets.展开更多
Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their ...Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.展开更多
A novel approach for improving antenna bandwidth is described using a 6-element Yagi-Uda array as an example. The new approach applies Central Force Optimization, a deterministic metaheuristic, and Variable Z0 technol...A novel approach for improving antenna bandwidth is described using a 6-element Yagi-Uda array as an example. The new approach applies Central Force Optimization, a deterministic metaheuristic, and Variable Z0 technology, a novel, proprietary design and optimization methodology, to produce an array with 33.09% fractional impedance bandwidth. This array’s performance is compared to its CFO-optimized Fixed Z0counterpart, and to the performance of a 6-ele- ment Dominating Cone Line Search-optimized array. Both CFO-optimized antennas exhibit better performance than the DCLS array, especially with respect to impedance bandwidth. Although the Yagi-Uda antenna was chosen to illustrate this new approach to antenna design and optimization, the methodology is entirely general and can be applied to any antenna against any set of performance objectives.展开更多
In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such ...In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such as Label Propagation Algorithms. This study evaluates the effects of such orderings on the Speaker-listener Label Propagation Algorithm or SLPA, a modification of LPA which has already been stabilized through alternate means. This study demonstrates that in cases where stability has been achieved without eliminating randomness, the result of removing random ordering is over fitting and bias. The results of testing seven various measures of centrality in conjunction with SLPA across five social network graphs indicate that while certain measures outperform random orderings on certain graphs, random orderings have the highest overall accuracy. This is particularly true when strict orderings are used in each run. These results indicate that the more evenly distributed solution space which results from complete random ordering is more valuable than the more targeted search that results from centrality orderings.展开更多
We present an energy-based method to estimate centrality in electrical networks. Here the energy between a pair of vertices denotes by the effective resistance between them. If there is only one generation and one loa...We present an energy-based method to estimate centrality in electrical networks. Here the energy between a pair of vertices denotes by the effective resistance between them. If there is only one generation and one load, then the centrality of an edge in our method is the difference between the energy of network after deleting the edge and that of the original network. Compared with the local current-flow betweenness on the IEEE 14-bus system, we have an interesting discovery that our proposed centrality is closely related to it in the sense of that the significance of edges under the two measures are very similar.展开更多
基金the National Natural Science Foundation of China under Grants 61871209 and 61901210,in part by Artificial Intelligence and Intelligent Transportation Joint Technical Center of HUST and Hubei Chutian Intelligent Transportation Co.,LTD under project”Intelligent Transportation Operation Monitoring Network and System”.
文摘Nearly all real-world networks are complex networks and usually are in danger of collapse.Therefore,it is crucial to exploit and understand the mechanisms of network attacks and provide better protection for network functionalities.Network dismantling aims to find the smallest set of nodes such that after their removal the network is broken into connected components of sub-extensive size.To overcome the limitations and drawbacks of existing network dismantling methods,this paper focuses on network dismantling problem and proposes a neighbor-loop structure based centrality metric,NL,which achieves a balance between computational efficiency and evaluation accuracy.In addition,we design a novel method combining NL-based nodes-removing,greedy tree-breaking and reinsertion.Moreover,we compare five baseline methods with our algorithm on ten widely used real-world networks and three types of model networks including Erd€os-Renyi random networks,Watts-Strogatz smallworld networks and Barabasi-Albert scale-free networks with different network generation parameters.Experimental results demonstrate that our proposed method outperforms most peer methods by obtaining a minimal set of targeted attack nodes.Furthermore,the insights gained from this study may be of assistance to future practical research into real-world networks.
文摘Using a statistical method which is based on random matrix theory, the results for the nearest-neighbor energy spacing distributions E(S) obtained from experimental as well as from computational data have been selected for review study. The obtained results confirm that the energy spacing correlation between secondary charged particles depends upon the charged particles multiplicity and central collisions are also associated with charged particles multiplicity.
文摘Let p be a prime. For any finite p-group G, the deep transfers T H,G ' : H / H ' → G ' / G " from the maximal subgroups H of index (G:H) = p in G to the derived subgroup G ' are introduced as an innovative tool for identifying G uniquely by means of the family of kernels ùd(G) =(ker(T H,G ')) (G: H) = p. For all finite 3-groups G of coclass cc(G) = 1, the family ùd(G) is determined explicitly. The results are applied to the Galois groups G =Gal(F3 (∞)/ F) of the Hilbert 3-class towers of all real quadratic fields F = Q(√d) with fundamental discriminants d > 1, 3-class group Cl3(F) □ C3 × C3, and total 3-principalization in each of their four unramified cyclic cubic extensions E/F. A systematic statistical evaluation is given for the complete range 1 d 7, and a few exceptional cases are pointed out for 1 d 8.
文摘The beneficial acclimation hypothesis (BAH) predicts that animals acclimated to a particular temperature have enhanced performance or fitness at that temperature in comparison with animals acclimated to other temperatures. The BAH has been tested by a variety of empirical examinations, and was rejected by some of them. In order to provide new evidences for the BAH, the effects of acute and acclimation temperature (AT) on locomotor performance of Macrobiotus hufelandi (Tardigrada: Macrobiotidae) were investigated. The tardigrades were collected from Nanwutai, Qinling Mountains which traverse from west to east in central China. The subjects were acclimated to either 2℃ or 22℃ for 2 weeks. The animal was transferred onto a frosted slide and allowed to walk freely at the performance temperature (PT) 2℃ or 22℃. Only one individual was tested per test bout, which lasted from three to five minutes. To avoid occurrence of thermal acclimation effect, the standard adaptation time was limited to 1.5 min. Each subject was tested for once at the same PT, and was tested only at one PT. A total of 25 individuals were tested and measured at the same PT. The locomotor performance of the animals was recorded with a digital video camera mounted on a microscope at 4×10 amplification and replayed on a PC. Every subject was identified. Walking speed (WS) and percentage of time moving (PTM) at both PTs (2℃ or 22℃) were selected as the rate parameters of locomotor performance. The two-way repeated measures ANOVA with a significance level of α= 0.05 and Duncan multiple range test were used to analyze the data. WS of the animals acclimated to and tested at the same temperatures was significantly faster than that for animals acclimated to and tested at the different temperatures, similarly, PTM of the animals acclimated to 22℃ and tested at 22℃ was significantly greater than PTM of animals acclimated to 22℃ and tested at 2℃, which indicated that the animals acclimated to a particular temperature have enhanced locomotor performance in that temperature relative to the animals acclimated to that temperature in other thermal environment. WS of the animals acclimated to 22℃ and tested at 22℃ was significantly faster than WS of animals acclimated to 2℃ and tested at 22℃, PTM of the animals acclimated to 22℃ and tested at 22℃ was significantly greater than PTM of animals acclimated to 2℃ and tested at 22℃. These results supported the BAH. It could be concluded that the PT and thermal acclimation as well as the interaction between the PT and AT significantly influence the locomotor performance of M.hufelandi, and that, despite the existence of a few results of this study that don’t support the BAH, some results of this study support for this hypothesis, and that the animals acclimated to a particular temperature have enhanced locomotor performance in that temperature relative to the animals acclimated to that temperature in other thermal environment, implying that any performance temperature that deviates from the acclimation temperature could cause the reduction of the walking speed which is closely related to the fitness of the M.hufelandi.
基金Project supported by the Postgraduate Research and Practice Innovation Program of Jiangsu Province,China(Grant No.AE91313/001/016)the National Natural Science Foundation of China(Grant No.11701097)the Natural Science Foundation of Jiangxi Province,China(Grant No.20161BAB212055)
文摘In this paper, we propose a new centrality algorithm that can simultaneously rank the nodes and layers of multilayer networks, referred to as the MRFNL centrality. The centrality of nodes and layers are obtained by developing a novel iterative algorithm for computing a set of tensor equations. Under some conditions, the existence and uniqueness of this centrality were proven by applying the Brouwer fixed point theorem. Furthermore, the convergence of the proposed iterative algorithm was established. Finally, numerical experiments on a simple multilayer network and two real-world multilayer networks(i.e., Pierre Auger Collaboration and European Air Transportation Networks) are proposed to illustrate the effectiveness of the proposed algorithm and to compare it to other existing centrality measures.
文摘Network is considered naturally as a wide range of different contexts, such as biological systems, social relationships as well as various technological scenarios. Investigation of the dynamic phenomena taking place in the network, determination of the structure of the network and community and description of the interactions between various elements of the network are the key issues in network analysis. One of the huge network structure challenges is the identification of the node(s) with an outstanding structural position within the network. The popular method for doing this is to calculate a measure of centrality. We examine node centrality measures such as degree, closeness, eigenvector, Katz and subgraph centrality for undirected networks. We show how the Katz centrality can be turned into degree and eigenvector centrality by considering limiting cases. Some existing centrality measures are linked to matrix functions. We extend this idea and examine the centrality measures based on general matrix functions and in particular, the logarithmic, cosine, sine, and hyperbolic functions. We also explore the concept of generalised Katz centrality. Various experiments are conducted for different networks generated by using random graph models. The results show that the logarithmic function in particular has potential as a centrality measure. Similar results were obtained for real-world networks.
文摘In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with?n?vertices is defined as , where ?is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.
基金This work was supported in part by the National Nature Science Foundation of China(NSFC)(Nos.11927901 and 12175084)the National Key Research and Development Program of China(Nos.2020YFE0202002 and 2022YFA1604900)the Fundamental Research Funds for the Central Universities(No.CCNU22QN005).
文摘The zero-degree calorimeter(ZDC)plays a crucial role toward determining the centrality in the Cooling-Storage-Ring External-target Experiment(CEE)at the Heavy Ion Research Facility in Lanzhou.A boosted decision tree(BDT)multi-classification algorithm was employed to classify the centrality of the collision events based on the raw features from ZDC such as the number of fired channels and deposited energy.The data from simulated^(238)U+^(238)U collisions at 500 MeV∕u,generated by the IQMD event generator and subsequently modeled using the GEANT4 package,were employed to train and test the BDT model.The results showed the high accuracy of the multi-classification model adopted in ZDC for centrality determination,which is robust against variations in different factors of detector geometry and response.This study demon-strates the good performance of CEE-ZDC in determining the centrality in nucleus-nucleus collisions.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.62162040 and 11861045)。
文摘Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.
文摘The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.
文摘My essay on Heart of Darkness explores Conrad’s dramatization of the voice and heart dynamic in the novella as a penetration of the deep-lying rationale of colonial operation and more generally the human condition at the turn of the 20th century.Three different forms of assumed centrality in the novella-capital,Eurocentrism,and the African interior as detrimental void symbolized by the heart of darkness form concentric circles that interconnect and work in concert as the core colonial ideology and produce a sense of incongruity and absurdity.The voice of this colonial ideological apparatus disguised as the universal subject of humanity and rationality finds its best expression in the eloquence of Kurtz,the specimen of culture seduced by its very opposite-the wilderness-right in the heart of darkness.“The horror”,as his final verdict of life as a European with real intent of living on his own terms at the turn of the 20th century,sums up the predicament of a civilization with too much culture and self-absorption for its own good.
文摘Let F be a number field and p be a prime. In the successive approximation theorem, we prove that, for each integer n ≥ 1, finitely many candidates for the Galois group of the nth stage of the p-class tower over F are determined by abelian type invariants of p-class groups C1pE of unramified extensions E/F with degree [E : F] = pn-1. Illustrated by the most extensive numerical results available currently, the transfer kernels (TE, F) of the p-class extensions TE, F : C1pF → C1pE from F to unramified cyclic degree-p extensions E/F are shown to be capable of narrowing down the number of contestants significantly. By determining the isomorphism type of the maximal subgroups S G of all 3-groups G with coclass cc(G) = 1, and establishing a general theorem on the connection between the p-class towers of a number field F and of an unramified abelian p-extension E/F, we are able to provide a theoretical proof of the realization of certain 3-groups S with maximal class by 3-tower groups of dihedral fields E with degree 6, which could not be realized up to now.
基金the National Social Science Foundation of China(Grant Nos.21BGL217 and 18AZD005)the National Natural Science Foundation of China(Grant Nos.71874108 and 11871328)。
文摘The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading process.This problem finds many practical applications in numerous areas such as information dissemination,epidemic immunity,and viral marketing.However,most existing influence maximization algorithms are limited by the“rich-club”phenomenon and are thus unable to avoid the influence overlap of seed spreaders.This work proposes a novel adaptive algorithm based on a new gravity centrality and a recursive ranking strategy,named AIGCrank,to identify a set of influential seeds.Specifically,the gravity centrality jointly employs the neighborhood,network location and topological structure information of nodes to evaluate each node's potential of being selected as a seed.We also present a recursive ranking strategy for identifying seed nodes one-byone.Experimental results show that our algorithm competes very favorably with the state-of-the-art algorithms in terms of influence propagation and coverage redundancy of the seed set.
文摘Sub-Saharan African cities are uniquely characterized by retail competition influencing outlet location.This work focused on revealing retail outlet location in Uyo and its relationship with distances from the Central Business Districts.Distance was measured along the six major arterial roads that link the city to the central business districts by the use of Google Map[5]Distance Calculator and itouch maps[7]technology.Six arteries were divided into four distinct spaces in kilometers namely 0-1km,1-2km,2-3km,3-4km.Retail Outlets were grouped into ten classes.Data was analysed using distance in kilometers from the Central Business District as variable Y1.The independent variables X1,X2,X3,X4,X5 and X6 were the six major arteries represented by the location of each specific retail outlet group.Utilising SPSS version 20 software the results reflected centre a 47.9 percent variation in retail outlets location with correlation coefficient(R)of 69.2%revealing a strong relationship between the distances from the Central Business Districts and the location of retail outlets located across the six major arteries.H1 was accepted which states a significant relationship in the location of retail outlets as distance increase from the city centre across the linkages.This confirms a strong intensity of location of retail outlets in the city centre with a gradual decline as distance increase from the centre.Although there was an increase in intensity of retail outlets in junctions away from the Central Business Districts according to multiple nuclei concept.It is recommended that urban expansion through growth poles.Aim:To access the relationship between retail outlets location and distance from central business district in a Uyo.Research Questions:This work provided answers to the following questions:1.Where are these retail outlets located in the city space?2.What is the relationship between Retail outlets and the distance from the City Centre?Objectives:1.To explain the distribution of location of retail outlets in city space.2.To reveal the relationship between Retail Outlets and distance from the City Centre.Hypothesis:There is no significant relationship between the distance from the central business district and the location of retail outlets.
文摘Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.
文摘A novel approach for improving antenna bandwidth is described using a 6-element Yagi-Uda array as an example. The new approach applies Central Force Optimization, a deterministic metaheuristic, and Variable Z0 technology, a novel, proprietary design and optimization methodology, to produce an array with 33.09% fractional impedance bandwidth. This array’s performance is compared to its CFO-optimized Fixed Z0counterpart, and to the performance of a 6-ele- ment Dominating Cone Line Search-optimized array. Both CFO-optimized antennas exhibit better performance than the DCLS array, especially with respect to impedance bandwidth. Although the Yagi-Uda antenna was chosen to illustrate this new approach to antenna design and optimization, the methodology is entirely general and can be applied to any antenna against any set of performance objectives.
文摘In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such as Label Propagation Algorithms. This study evaluates the effects of such orderings on the Speaker-listener Label Propagation Algorithm or SLPA, a modification of LPA which has already been stabilized through alternate means. This study demonstrates that in cases where stability has been achieved without eliminating randomness, the result of removing random ordering is over fitting and bias. The results of testing seven various measures of centrality in conjunction with SLPA across five social network graphs indicate that while certain measures outperform random orderings on certain graphs, random orderings have the highest overall accuracy. This is particularly true when strict orderings are used in each run. These results indicate that the more evenly distributed solution space which results from complete random ordering is more valuable than the more targeted search that results from centrality orderings.
文摘We present an energy-based method to estimate centrality in electrical networks. Here the energy between a pair of vertices denotes by the effective resistance between them. If there is only one generation and one load, then the centrality of an edge in our method is the difference between the energy of network after deleting the edge and that of the original network. Compared with the local current-flow betweenness on the IEEE 14-bus system, we have an interesting discovery that our proposed centrality is closely related to it in the sense of that the significance of edges under the two measures are very similar.
