Acceder

Bibliografías temáticas / Newman and Ziff algorithm / Artículos de revistas

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Newman and Ziff algorithm.

Artículos de revistas sobre el tema "Newman and Ziff algorithm"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 14 de febrero de 2022

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Newman and Ziff algorithm".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Tronin, I. V. "New algorithm to test percolation conditions within the Newman–Ziff algorithm." International Journal of Modern Physics C 25, no. 11 (2014): 1450064. http://dx.doi.org/10.1142/s0129183114500648.

Texto completo

Resumen

A new algorithm to test percolation conditions for the solution of percolation problems on a lattice and continuum percolation for spaces of an arbitrary dimension has been proposed within the Newman–Ziff algorithm. The algorithm is based on the use of bitwise operators and does not reduce the efficiency of the operation of the Newman–Ziff algorithm as a whole. This algorithm makes it possible to verify the existence of both clusters touching boundaries at an arbitrary point and single-loop clusters continuously connecting the opposite boundaries in a percolating system with periodic boundary

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

de FREITAS, JOAQUIM E., and LIACIR S. LUCENA. "EQUIVALENCE BETWEEN THE FLR TIME DEPENDENT PERCOLATION MODEL AND THE NEWMAN–ZIFF ALGORITHM." International Journal of Modern Physics C 11, no. 08 (2000): 1581–84. http://dx.doi.org/10.1142/s0129183100001425.

Texto completo

Resumen

We compare the results of a very efficient algorithm that we have proposed to study the time evolution of percolation clusters when the occupation probability swept through the critical value in the same sample and in a single run with another algorithm proposed by Newman and Ziff to allow fast calculations of the standard percolation model. Both have a complexity per site that is roughly independent of the size of the system. Our results show that for the derivative threshold distribution, the results ( exponent = 1.8 ± 0.2) are closer to Wester while for the cumulative distribution ( exponen

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

Choi, Jeong-Ok, and Unjong Yu. "Newman-Ziff algorithm for the bootstrap percolation: Application to the Archimedean lattices." Journal of Computational Physics 386 (June 2019): 1–8. http://dx.doi.org/10.1016/j.jcp.2019.02.005.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

Brauer, O., H. A. Camargo, and M. Socolovsky. "Newman-Janis Algorithm Revisited." International Journal of Theoretical Physics 54, no. 1 (2014): 302–14. http://dx.doi.org/10.1007/s10773-014-2225-3.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

Harold Erbin and Lucien Heurtier. "Five-dimensional Janis–Newman algorithm." Classical and Quantum Gravity 32, no. 16 (2015): 165004. http://dx.doi.org/10.1088/0264-9381/32/16/165004.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

Drake, S. P., and Peter Szekeres. "Uniqueness of the Newman–Janis Algorithm in Generating the Kerr–Newman Metric." General Relativity and Gravitation 32, no. 3 (2000): 445–57. http://dx.doi.org/10.1023/a:1001920232180.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

Erbin, Harold. "Janis-Newman algorithm for supergravity black holes." Fortschritte der Physik 64, no. 4-5 (2016): 376–77. http://dx.doi.org/10.1002/prop.201500065.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

Keane, Aidan J. "An extension of the Newman–Janis algorithm." Classical and Quantum Gravity 31, no. 15 (2014): 155003. http://dx.doi.org/10.1088/0264-9381/31/15/155003.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

Gutiérrez-Chávez, Carlos, Francisco Frutos-Alfaro, Iván Cordero-García, and Javier Bonatti-González. "A Computer Program for the Newman-Janis Algorithm." Journal of Modern Physics 06, no. 15 (2015): 2226–30. http://dx.doi.org/10.4236/jmp.2015.615227.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

Erbin, Harold, and Lucien Heurtier. "Supergravity, complex parameters and the Janis–Newman algorithm." Classical and Quantum Gravity 32, no. 16 (2015): 165005. http://dx.doi.org/10.1088/0264-9381/32/16/165005.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Erbin, Harold. "Janis–Newman Algorithm: Generating Rotating and NUT Charged Black Holes." Universe 3, no. 1 (2017): 19. http://dx.doi.org/10.3390/universe3010019.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Rajan, Del, and Matt Visser. "Cartesian Kerr–Schild variation on the Newman–Janis trick." International Journal of Modern Physics D 26, no. 14 (2017): 1750167. http://dx.doi.org/10.1142/s021827181750167x.

Texto completo

Resumen

The Newman–Janis trick is a procedure, (not even really an ansatz), for obtaining the Kerr spacetime from the Schwarzschild spacetime. This 50 years old trick continues to generate heated discussion and debate even to this day. Most of the debate focusses on whether the Newman–Janis procedure can be upgraded to the status of an algorithm, or even an inspired ansatz, or is it just a random trick of no deep physical significance. (That the Newman–Janis procedure very quickly led to the discovery of the Kerr–Newman spacetime is a point very much in its favor.) In the current paper, we will not an

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

Li, Xuming, Zhihua Cui, and Zhongzhi Shi. "Newman and Watts Small World Social Emotional Optimization Algorithm with WSN." Sensor Letters 10, no. 8 (2012): 1676–81. http://dx.doi.org/10.1166/sl.2012.2641.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Li Wentao, 李文韬, 付晗 Fu han, 郝真 Hao Zhen, et al. "Detection Algorithm of Crowd Abnormal Event Based on Girvan-Newman Splitting." Laser & Optoelectronics Progress 57, no. 6 (2020): 061506. http://dx.doi.org/10.3788/lop57.061506.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

Lombardo, Diego Julio Cirilo. "The Newman–Janis algorithm, rotating solutions and Einstein–Born–Infeld black holes." Classical and Quantum Gravity 21, no. 6 (2004): 1407–17. http://dx.doi.org/10.1088/0264-9381/21/6/009.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Larrañaga, Alexis, Claudia Grisales, and Manuel Londoño. "A Topologically Charged Rotating Black Hole in the Brane." Advances in High Energy Physics 2013 (2013): 1–6. http://dx.doi.org/10.1155/2013/727294.

Texto completo

Resumen

We have obtained a rotating black hole solution in the braneworld scenario by applying the Newman-Janis algorithm. The new solution carries two types of charge, one arising from the bulk Weyl tensor and one from the gauge field trapped on the brane. In order to obtain this result, we used a modified version of the algorithm in which the involved complexification is the key point. The analysis of the horizon structure of the new metric shows similarities to the Kerr-Newman solution. In particular, there is a minimal mass to which the black hole can decay through the Hawking radiation. From the

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

Chen, Benyan, Ju Xiang, Ke Hu, and Yi Tang. "Enhancing betweenness algorithm for detecting communities in complex networks." Modern Physics Letters B 28, no. 09 (2014): 1450074. http://dx.doi.org/10.1142/s0217984914500742.

Texto completo

Resumen

Community structure is an important topological property common to many social, biological and technological networks. First, by using the concept of the structural weight, we introduced an improved version of the betweenness algorithm of Girvan and Newman to detect communities in networks without (intrinsic) edge weight and then extended it to networks with (intrinsic) edge weight. The improved algorithm was tested on both artificial and real-world networks, and the results show that it can more effectively detect communities in networks both with and without (intrinsic) edge weight. Moreover

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

Mahdi, Mustafa Kamil, and Huda Naji Nawaf. "Finding Overlapped Communities in Directed Network Based on Improved Cluster-Overlap Newman Girvan Algorithm." Journal of Computational and Theoretical Nanoscience 16, no. 3 (2019): 897–902. http://dx.doi.org/10.1166/jctn.2019.7971.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

Dymnikova, Irina, and Evgeny Galaktionov. "Regular rotating electrically charged structures in nonlinear electrodynamics minimally coupled to gravity." International Journal of Modern Physics: Conference Series 41 (January 2016): 1660120. http://dx.doi.org/10.1142/s2010194516601204.

Texto completo

Resumen

In nonlinear electrodynamics minimally coupled to gravity, regular spherically symmetric electrically charged solutions satisfy the weak energy condition and have obligatory de Sitter center. By the Gürses-Gürsey algorithm they are transformed to regular axially symmetric solutions asymptotically Kerr-Newman for a distant observer. Rotation transforms de Sitter center into de Sitter equatorial disk embedded as a bridge into a de Sitter vacuum surface. The de Sitter surfaces satisfy [Formula: see text] and have properties of a perfect conductor and ideal diamagnetic. The Kerr ring singularity i

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

Chen, Li Qiang. "The Wireless Sensor Network Routing Algorithm Based on the Small World Model." Applied Mechanics and Materials 325-326 (June 2013): 1045–48. http://dx.doi.org/10.4028/www.scientific.net/amm.325-326.1045.

Texto completo

Resumen

Small-world networks have the higher clustering coefficient and shorter average path length. According to the design requirements of topology and routing algorithm of the WSN, we apply small world theory into the WSN, and propose the routing algorithm based on Newman Watts small-world network model. This algorithm judge the cluster number whether same to decide the communication type. Data is transmitted to super node firstly, and then the packets are sent by the shortest transmission paths which get from the super node ring. Experiments show that the routing algorithm improves the network thr

Los estilos APA, Harvard, Vancouver, ISO, etc.

21

VIAGGIU, STEFANO. "INTERIOR KERR SOLUTIONS WITH THE NEWMAN–JANIS ALGORITHM STARTING WITH STATIC PHYSICALLY REASONABLE SPACE–TIMES." International Journal of Modern Physics D 15, no. 09 (2006): 1441–53. http://dx.doi.org/10.1142/s0218271806009169.

Texto completo

Resumen

We present a simple approach for obtaining Kerr interior solutions with the help of the Newman–Janis algorithm (NJA) starting with static space–times describing physically sensible interior Schwarzschild solutions. In this context, the Darmois–Israel (DI) junction conditions are analyzed. Starting from the incompressible Schwarzschild solution, a class of Kerr interior solutions is presented, together with a discussion of the slowly rotating limit. The energy conditions are discussed for the solutions so obtained. Finally, the NJA algorithm is applied to the static, anisotropic, conformally fl

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

Drake, S. P., and R. Turolla. "The application of the Newman - Janis algorithm in obtaining interior solutions of the Kerr metric." Classical and Quantum Gravity 14, no. 7 (1997): 1883–97. http://dx.doi.org/10.1088/0264-9381/14/7/021.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

Mukunda, Keshav. "Pisot Numbers from {0, 1}-Polynomials." Canadian Mathematical Bulletin 53, no. 1 (2010): 140–52. http://dx.doi.org/10.4153/cmb-2010-028-7.

Texto completo

Resumen

AbstractA Pisot number is a real algebraic integer greater than 1, all of whose conjugates lie strictly inside the open unit disk; a Salem number is a real algebraic integer greater than 1, all of whose conjugate roots are inside the closed unit disk, with at least one of them of modulus exactly 1. Pisot numbers have been studied extensively, and an algorithm to generate them is well known. Our main result characterises all Pisot numbers whose minimal polynomial is derived from a Newman polynomial — one with {0, 1}-coefficients — and shows that they form a strictly increasing sequence with lim

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

Han, Jingti, and Changmei Mao. "Roles of Clustering Coefficient for the Network Reconstruction." Mathematical Problems in Engineering 2018 (October 24, 2018): 1–11. http://dx.doi.org/10.1155/2018/4949673.

Texto completo

Resumen

It is important to establish relations between the network reconstruction and the topological dynamical structure of networks. In this article, we quantify the effect for two types of network topologies on the performance of network reconstruction. First, we generate two network modes with variable clustering coefficient based on Holme-Kim model and Newman-Watts small-world model, then we reconstruct the artificial networks by using a novel framework called L1-norm minimization algorithm based on a theory called compressive sensing (CS), a framework for recovering sparse signals. The results o

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

Tong, Chao, Jianwei Niu, Bin Dai, and Zhongyu Xie. "A Novel Complex Networks Clustering Algorithm Based on the Core Influence of Nodes." Scientific World Journal 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/801854.

Texto completo

Resumen

In complex networks, cluster structure, identified by the heterogeneity of nodes, has become a common and important topological property. Network clustering methods are thus significant for the study of complex networks. Currently, many typical clustering algorithms have some weakness like inaccuracy and slow convergence. In this paper, we propose a clustering algorithm by calculating the core influence of nodes. The clustering process is a simulation of the process of cluster formation in sociology. The algorithm detects the nodes with core influence through their betweenness centrality, and

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

Xu, Mingyao, and Qinhai Zhang. "A Classification of Metacyclic 2-Groups." Algebra Colloquium 13, no. 01 (2006): 25–34. http://dx.doi.org/10.1142/s1005386706000058.

Texto completo

Resumen

A finite p-group G is called metacyclic if it has a cyclic normal subgroup A such that G/A is cyclic. In 1973, King classified metacyclic p-groups; in 1987, Newman and the first author developed a new approach to metacyclic p-groups suggested by the p-group generation algorithm, they found new presentations for these groups. However, their results were only announced in the case of p odd, and no proof was given. The purpose of this paper is to give a new proof of their results in the case of p=2, which is independent of the p-group generation algorithm.

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Dymnikova, Irina. "Image of the Electron Suggested by Nonlinear Electrodynamics Coupled to Gravity." Particles 4, no. 2 (2021): 129–45. http://dx.doi.org/10.3390/particles4020013.

Texto completo

Resumen

We present a systematic review of the basic features that were adopted for different electron models and show, in a brief overview, that, for electromagnetic spinning solitons in nonlinear electrodynamics minimally coupled to gravity (NED-GR), all of these features follow directly from NED-GR dynamical equations as model-independent generic features. Regular spherically symmetric solutions of NED-GR equations that describe electrically charged objects have obligatory de Sitter center due to the algebraic structure of stress–energy tensors for electromagnetic fields. By the Gürses-Gürsey formal

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

Dymnikova, Irina, and Evgeny Galaktionov. "Dynamics of Electromagnetic Fields and Structure of Regular Rotating Electrically Charged Black Holes and Solitons in Nonlinear Electrodynamics Minimally Coupled to Gravity." Universe 5, no. 10 (2019): 205. http://dx.doi.org/10.3390/universe5100205.

Texto completo

Resumen

We study the dynamics of electromagnetic fields of regular rotating electrically charged black holes and solitons replacing naked singularities in nonlinear electrodynamics minimally coupled to gravity (NED-GR). They are related by electromagnetic and gravitational interactions and described by the axially symmetric NED-GR solutions asymptotically Kerr-Newman for a distant observer. Geometry is described by the metrics of the Kerr-Schild class specified by T t t = T r r ( p r = − ρ ) in the co-rotating frame. All regular axially symmetric solutions obtained from spherical solutions with the Ne

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

Zhang, Xue, Zhi-Hong Luo, Hui-Dong Wu, Zhuo-Xuan Yang, and Pei-Yuan Ma. "Revealing the strong and stable community structure in social networks." Modern Physics Letters B 34, no. 31 (2020): 2050351. http://dx.doi.org/10.1142/s0217984920503510.

Texto completo

Resumen

In a complex network, the global similarity standard is of high complexity and local similarity standard has biased error on node similarity. This paper puts forward a community discovering algorithm OBS, based on the degree of contribution of shared nodes in complex network. It distributes the contribution, using the degree of shared nodes as the unit, equally, which is made by shared nodes. Compared with average commute time standard, Random Walk with Restart standard and Hierarchical Structure Method standard, OBS standard has a more veracious forecast to the similar relationship between no

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

Dwi Putra Aditama, Taufan Bagus, and Azhari SN. "Determining Community Structure and Modularity in Social Network using Genetic Algorithm." IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 14, no. 3 (2020): 219. http://dx.doi.org/10.22146/ijccs.57834.

Texto completo

Resumen

Research on determining community structure in complex networks has attracted a lot of attention in various applications, such as email networks and social networks. The popularity determines the structure of a community because it can analyze the structure.Meanwhile, to determine the structure of the community by maximizing the value of modularity is difficult. Therefore, a lot of research introduces new algorithms to solve problems in determining community structure and maximizing the value of modularity. Genetic Algorithm can provide effective solutions by combining exploration and exploita

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

Zolkepli, Maslina, Fangyan Dong, and Kaoru Hirota. "Visualizing Fuzzy Relationship in Bibliographic Big Data Using Hybrid Approach Combining Fuzzyc-Means and Newman-Girvan Algorithm." Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no. 6 (2014): 896–907. http://dx.doi.org/10.20965/jaciii.2014.p0896.

Texto completo

Resumen

Bibliographic big data visualization method is proposed by incorporating a combination of fuzzyc-means clustering and the Newman-Girvan clustering algorithm, where clustered results are displayed in a network view by grouping objects with similar cluster memberships. As current bibliographic visualizations focus on the crisp relationship among data, fuzzy analysis and visualization may offer insights to bibliographic big data, enabling faster decision making by improving displayed information precision. The proposed method is applied to the DBLP citation network dataset. Results show that merg

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

Erkaymaz, Okan. "Resilient back-propagation approach in small-world feed-forward neural network topology based on Newman–Watts algorithm." Neural Computing and Applications 32, no. 20 (2020): 16279–89. http://dx.doi.org/10.1007/s00521-020-05161-6.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

Reddy, Sohail R., Matthias K. Scharrer, Franz Pichler, Daniel Watzenig, and George S. Dulikravich. "Accelerating parameter estimation in Doyle–Fuller–Newman model for lithium-ion batteries." COMPEL - The international journal for computation and mathematics in electrical and electronic engineering 38, no. 5 (2019): 1533–44. http://dx.doi.org/10.1108/compel-12-2018-0533.

Texto completo

Resumen

Purpose This paper aims to solve the parameter identification problem to estimate the parameters in electrochemical models of the lithium-ion battery. Design/methodology/approach The parameter estimation framework is applied to the Doyle-Fuller-Newman (DFN) model containing a total of 44 parameters. The DFN model is fit to experimental data obtained through the cycling of Li-ion cells. The parameter estimation is performed by minimizing the least-squares difference between the experimentally measured and numerically computed voltage curves. The minimization is performed using a state-of-the-ar

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

Wu, Weiwei, Haoyu Zhang, Shengrun Zhang, and Frank Witlox. "Community Detection in Airline Networks: An Empirical Analysis of American vs. Southwest Airlines." Journal of Advanced Transportation 2019 (December 31, 2019): 1–11. http://dx.doi.org/10.1155/2019/3032015.

Texto completo

Resumen

In this paper, we develop a route-traffic-based method for detecting community structures in airline networks. Our model is both an application and an extension of the Clauset-Newman-Moore (CNM) modularity maximization algorithm, in that we apply the CNM algorithm to large airline networks, and take both route distance and passenger volumes into account. Therefore, the relationships between airports are defined not only based on the topological structure of the network but also by a traffic-driven indicator. To illustrate our model, two case studies are presented: American Airlines and Southwe

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

Bocu, Razvan, and Sabin Tabirca. "The Flag-based Algorithm - A Novel Greedy Method that Optimizes Protein Communities Detection." International Journal of Computers Communications & Control 6, no. 1 (2011): 33. http://dx.doi.org/10.15837/ijccc.2011.1.2198.

Texto completo

Resumen

Proteins and the networks they determine, called interactome networks, have received attention at an important degree during the last years, because they have been discovered to have an influence on some complex biological phenomena, such as problematic disorders like cancer. This paper presents a contribution that aims to optimize the detection of protein communities through a greedy algorithm that is implemented in the C programming language. The optimization involves a double improvement in relation to protein communities detection, which is accomplished both at the algorithmic and programm

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

Perrin, Dimitri, and Guido Zuccon. "Recursive module extraction using Louvain and PageRank." F1000Research 7 (August 14, 2018): 1286. http://dx.doi.org/10.12688/f1000research.15845.1.

Texto completo

Resumen

Biological networks are highly modular and contain a large number of clusters, which are often associated with a specific biological function or disease. Identifying these clusters, or modules, is therefore valuable, but it is not trivial. In this article we propose a recursive method based on the Louvain algorithm for community detection and the PageRank algorithm for authoritativeness weighting in networks. PageRank is used to initialise the weights of nodes in the biological network; the Louvain algorithm with the Newman-Girvan criterion for modularity is then applied to the network to iden

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

Yin, Rongwang, Qingyu Li, Peichao Li, Yang Guo, Yurong An, and Detang Lu. "GPU-Based Computation of Formation Pressure for Multistage Hydraulically Fractured Horizontal Wells in Tight Oil and Gas Reservoirs." Mathematical Problems in Engineering 2018 (2018): 1–10. http://dx.doi.org/10.1155/2018/2582797.

Texto completo

Resumen

A mathematical model for multistage hydraulically fractured horizontal wells (MFHWs) in tight oil and gas reservoirs was derived by considering the variations in the permeability and porosity of tight oil and gas reservoirs that depend on formation pressure and mixed fluid properties and introducing the pseudo-pressure; analytical solutions were presented using the Newman superposition principle. The CPU-GPU asynchronous computing model was designed based on the CUDA platform, and the analytic solution was decomposed into infinite summation and integral forms for parallel computation. Implemen

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

Leben, W. R. "Tonal feet and the adaptation of English borrowings into Hausa." Studies in African Linguistics 25, no. 2 (1996): 129–54. http://dx.doi.org/10.32473/sal.v25i2.107400.

Texto completo

Resumen

This paper investigates how Hausa places a tonal interpretation on stress in English borrowings. A key intermediary in this process is the tonal foot, which is maximally disyllabic. Tonal feet are of two kinds, in complementary distribution in the data. One is interpreted as HL, or falling-toned, the other as High-toned. The analysis represents a significant advance over the less highly structured view that a simple substitution algorithm replaces stresses with tones, e.g., High tone for-stressed syllables and Low tone for unstressed. This provides a boost for the status of the tonal foot as a

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

Huang, Wencheng, Linqing Li, Hongyi Liu, Rui Zhang, and Minhao Xu. "Defense resource allocation in road dangerous goods transportation network: A Self-Contained Girvan-Newman Algorithm and Mean Variance Model combined approach." Reliability Engineering & System Safety 215 (November 2021): 107899. http://dx.doi.org/10.1016/j.ress.2021.107899.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

Du, Congju, and Bin Tang. "Novel Unconventional-Active-Jamming Recognition Method for Wideband Radars Based on Visibility Graphs." Sensors 19, no. 10 (2019): 2344. http://dx.doi.org/10.3390/s19102344.

Texto completo

Resumen

Radar unconventional active jamming, including unconventional deceptive jamming and barrage jamming, poses a serious threat to wideband radars. This paper proposes an unconventional-active-jamming recognition method for wideband radar. In this method, the visibility algorithm of converting the radar time series into graphs, called visibility graphs, is first given. Then, the visibility graph of the linear-frequency-modulation (LFM) signal is proved to be a regular graph, and the rationality of extracting features on visibility graphs is theoretically explained. Therefore, four features on visi

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

Sangkaran, Theyvaa, Azween Abdullah, and NZ Jhanjhi. "Criminal Community Detection Based on Isomorphic Subgraph Analytics." Open Computer Science 10, no. 1 (2020): 164–74. http://dx.doi.org/10.1515/comp-2020-0112.

Texto completo

Resumen

AbstractAll highly centralised enterprises run by criminals do share similar traits, which, if recognised, can help in the criminal investigative process. While conducting a complex confederacy investigation, law enforcement agents should not only identify the key participants but also be able to grasp the nature of the inter-connections between the criminals to understand and determine the modus operandi of an illicit operation. We studied community detection in criminal networks using the graph theory and formally introduced an algorithm that opens a new perspective of community detection co

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Crocomo, Marcio K., Jean P. Martins, and Alexandre C. B. Delbem. "Decomposition of Black-Box Optimization Problems by Community Detection in Bayesian Networks." International Journal of Natural Computing Research 3, no. 4 (2012): 1–19. http://dx.doi.org/10.4018/jncr.2012100101.

Texto completo

Resumen

Estimation of Distribution Algorithms (EDAs) have proved themselves as an efficient alternative to Genetic Algorithms when solving nearly decomposable optimization problems. In general, EDAs substitute genetic operators by probabilistic sampling, enabling a better use of the information provided by the population and, consequently, a more efficient search. In this paper the authors exploit EDAs' probabilistic models from a different point-of-view, the authors argue that by looking for substructures in the probabilistic models it is possible to decompose a black-box optimization problem and sol

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

MOODY, JAMES, and PETER J. MUCHA. "Portrait of Political Party Polarization." Network Science 1, no. 1 (2013): 119–21. http://dx.doi.org/10.1017/nws.2012.3.

Texto completo

Resumen

To find out, we measure co-voting similarity networks in the US Senate and trace individual careers over time. Standard network visualization tools fail on dense highly clustered networks, so we used two aggregation strategies to clarify positional mobility over time. First, clusters of Senators who often vote the same way capture coalitions, and allow us to measure polarization quantitatively through modularity (Newman, 2006; Waugh et al., 2009; Poole, 2012). Second, we use role-based blockmodels (White et al., 1976) to identify role positions, identifying sets of Senators with highly similar

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

Dymnikova, Irina, and Kirill Kraav. "Identification of a Regular Black Hole by Its Shadow." Universe 5, no. 7 (2019): 163. http://dx.doi.org/10.3390/universe5070163.

Texto completo

Resumen

We study shadows of regular rotating black holes described by the axially symmetric solutions asymptotically Kerr for a distant observer, obtained from regular spherical solutions of the Kerr–Schild class specified by T t t = T r r ( p r = − ε ) . All regular solutions obtained with the Newman–Janis algorithm belong to this class. Their basic generic feature is the de Sitter vacuum interior. Information about the interior content of a regular rotating de Sitter-Kerr black hole can be in principle extracted from observation of its shadow. We present the general formulae for description of shado

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

Kósa, Balázs, Márton Balassi, Péter Englert, and Attila Kiss. "Betweenness versus Linerank." Computer Science and Information Systems 12, no. 1 (2015): 33–48. http://dx.doi.org/10.2298/csis141101092k.

Texto completo

Resumen

In our paper we compare two centrality measures of networks, betweenness and Linerank. Betweenness is widely used, however, its computation is expensive for large networks. Calculating Linerank remains manageable even for graphs of billion nodes, it was offered as a substitute of betweenness in [12]. To the best of our knowledge the relationship between these measures has never been seriously examined. We calculate the Pearson?s and Spearman?s correlation coefficients for both node and edge variants of these measures. For edges the correlation tends to be rather low. Our tests with the Girvan-

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

Nguyen, Tuan Minh, Abdelraheem M. Aly, and Sang-Wook Lee. "Improved wall boundary conditions in the incompressible smoothed particle hydrodynamics method." International Journal of Numerical Methods for Heat & Fluid Flow 28, no. 3 (2018): 704–25. http://dx.doi.org/10.1108/hff-02-2017-0056.

Texto completo

Resumen

Purpose The purpose of this paper is to improve the 2D incompressible smoothed particle hydrodynamics (ISPH) method by working on the wall boundary conditions in ISPH method. Here, two different wall boundary conditions in ISPH method including dummy wall particles and analytical kernel renormalization wall boundary conditions have been discussed in details. Design/methodology/approach The ISPH algorithm based on the projection method with a divergence velocity condition with improved boundary conditions has been adapted. Findings The authors tested the current ISPH method with the improved bo

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

Hu, Po, and Lily Lee. "Community-Based Link-Addition Strategies for Mitigating Cascading Failures in Modern Power Systems." Processes 8, no. 2 (2020): 126. http://dx.doi.org/10.3390/pr8020126.

Texto completo

Resumen

The propagation of cascading failures of modern power systems is mainly constrained by the network topology and system parameter. In order to alleviate the cascading failure impacts, it is necessary to adjust the original network topology considering the geographical factors, construction costs and requirements of engineering practice. Based on the complex network theory, the power system is modeled as a directed graph. The graph is divided into communities based on the Fast–Newman algorithm, where each community contains at least one generator node. Combined with the islanding characteristics

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

Markowska, Anna. "Using Area Cartograms in Teaching Geography in Secondary Schools." Abstracts of the ICA 1 (July 15, 2019): 1–2. http://dx.doi.org/10.5194/ica-abs-1-240-2019.

Texto completo

Resumen

<p><strong>Abstract.</strong> An area cartogram is one of the cartographic presentation forms. It is a unique way of presenting statistical data, in which the surface of the individual spatial units is proportional to the value of the phenomenon. Due to its specificity, the area cartogram is an interesting way of graphical representation of phenomena, in particular, the demographic and economic problems of the world.</p><p>In my research, I discuss an empirical study that I have conducted among pupils of the secondary school in Poland. On the basis of the list of

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

Zhang, Yulin, Kebo Lv, Shudong Wang, Jionglong Su, and Dazhi Meng. "Modeling Gene Networks inSaccharomyces cerevisiaeBased on Gene Expression Profiles." Computational and Mathematical Methods in Medicine 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/621264.

Texto completo

Resumen

Detailed and innovative analysis of gene regulatory network structures may reveal novel insights to biological mechanisms. Here we study how gene regulatory network inSaccharomyces cerevisiaecan differ under aerobic and anaerobic conditions. To achieve this, we discretized the gene expression profiles and calculated the self-entropy of down- and upregulation of gene expression as well as joint entropy. Based on these quantities the uncertainty coefficient was calculated for each gene triplet, following which, separate gene logic networks were constructed for the aerobic and anaerobic condition

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Tian, Xiujuan, Chunyan Liang, and Tianjun Feng. "Dynamic Control Subarea Division Based on Node Importance Evaluating." Mathematical Problems in Engineering 2021 (August 18, 2021): 1–11. http://dx.doi.org/10.1155/2021/9923514.

Texto completo

Resumen

In order to optimize the existing control subarea division methods, a new dynamic subarea division method based on node importance evaluating is proposed for regional coordinated control. Firstly, considering the characteristics of road network and traffic flow between adjacent intersections, correlation degree model is established by calculating the correlation coefficients of traffic flow, signal cycle, and traffic state. Then, road traffic network is abstracted into a network topology structure graph. From the global perspective of the road network, intersection position information and the

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!