Home Research on Critical Nodes Algorithm in Social Complex Networks
Article Open Access

Research on Critical Nodes Algorithm in Social Complex Networks

  • Xue-Guang Wang EMAIL logo
Published/Copyright: March 16, 2017

Abstract

Discovering critical nodes in social networks has many important applications and has attracted more and more institutions and scholars. How to determine the K critical nodes with the most influence in a social network is a NP (define) problem. Considering the widespread community structure, this paper presents an algorithm for discovering critical nodes based on two information diffusion models and obtains each node’s marginal contribution by using a Monte-Carlo method in social networks. The solution of the critical nodes problem is the K nodes with the highest marginal contributions. The feasibility and effectiveness of our method have been verified on two synthetic datasets and four real datasets.

1 Introduction

The analysis of social networks has many important applications and has attracted more and more institutions and scholars. How to identify influential individuals from a network is called a critical node problem (CNP), and this is one of the basic problems in the field of social network analysis. An effective solution for this problem will have an important practical value [1]. For example, we can better target and isolate the source of the disease and block its spread and diffusion in the disease network; or companies may identify individuals with influence and let them recommend products to their friends so that a cascade spreads by the greatest extent.

Domingos and Richardson first studied the CNP as an algorithmic problem and presented a greedy approximation algorithm. Currently, the research on the CNP of social networks mainly concentrates on improving the greedy algorithm or developing new methods by graph theory and complex network theory. Considering the widespread community structure in social networks, this paper gives a solution for the CNP, which assigns a marginal contribution for every node in a community of a social network using the solution concept and union concept of cooperative games. Then we sort all nodes by their contribution and obtain critical nodes according to some rules.

2 Background

The models for information propagation in networks have been widely studied [2]. We consider two models in this paper: independent cascade model (ICM) and linear threshold model (LTM) [2].

1) ICM Model. In this model, a propagation probability pu,v is given for each edge (u, v) ∈ E, that is, vertex v is activated with probability pu,v by u. When an initial set A0 of active vertices is given, the diffusion process spreads up according to the following randomized rule. When a vertex u is activated at time-step i, it has a single chance of activating its neighbor v with pu,v. If u succeeds, v will become active at time-step i + 1. Here, if v has multiple parent vertices that become active at time-step i for the first time, then their activation attempts are sequenced in an arbitrary order. Whether or not u succeeds, it cannot make any further attempts to activate v in subsequent steps. The process runs until no more activation is possible.

2) LTM Model. In this model, vertex v is influenced by each neighbor u according to a weight wv,u such that ∑v wv,u ≤ 1. Each vertex has a predefined threshold θv ∈ [0, 1], which is chosen uniformly at random. When an initial set A0 with active vertices is given, the diffusion process unfolds according to the following randomized rule. All activated vertices at time-step i still keep active at time-step i + 1. Whether or not any inactivated vertex is activated is determined by its neighbors’ weights such that Σv wv,uθv. The process runs until no more activation is possible.

The difference between ICM and LTM is that (for ICM,?) each attempt of activation is independent of the attempts by all the other active individuals, while in the latter model each inactive individual is influenced by the aggregated weight of all its active neighbors.

A network is modeled as a graph G = (V, E) with vertices in V modeling the individuals in the network and edges in E modeling the relationship between individuals. A vertex has two states: active and inactive, which in this context means whether a product or idea is accepted by individuals or not. We assume that a vertex can only change from inactive to active and not vice versa; an inactive vertex can be activated by its active neighbor vertices and an active vertex can activate its inactive neighbors; the increment of activated vertices represents the dissemination of information.

The definition of the CNP is as follow:

Input: G = (V, E) and an integer k;

Output: A = arg maxSV,|S|kσ(S)

For k - CNP, we hope to find out a set A with k elements and maximize σ(A) which is a NP-hard (define). But, Nemhauser et al. have approved that there is a greedy algorithm (see Algorithm 1) which approximates the optimum within a factor of (1 - 1/e)4.

Algorithm 1 Greedy Algorithm

1: A = Φ

2: fori = 1 to k

3:   vi = arg maxuV\A(σ(A ⋃ {u}) - σ(A))

4:   A = A ⋃{vi}

5: end for

There is a key problem in how to compute the value of σ(A) in Algorithm 1. Currently, we do not have any efficient method to obtain its exact solution. However, we can use a Monte-Carlo method to simulate the process of influence spread for obtaining approximate results by high probability.

3 The Algorithm

3.1 Introduction to the algorithm

Given a finite set of players N, a cooperative game with transferable utility as a pair (N, v), characteristic function v : 2N →R and v(∅) = 0. For ∀iN, if payoff vector satisfies xiv({i}) and i=1Nxi=v(N), then it is so-called an allocation of (N, v). The solution of a cooperative game is a kind of allocation rule and the allocated payoff for every player denotes a method to measure the negotiation strength of the players in the game. Shapely (cite) presented a solution concept which determines the only allocation distribution scheme from the solutions with different property, i.e., it assigns the player’s payoff according to the importance of every player for the game [5]. The Shapely value of the player i in the game (N, v) is

Shi(v)={SN|iS}(ns)!(s1)!n!(v(S{i})v(S)),iN

where n = |N| and s = |S|.

However, the Shapely value does not consider the impact of coalition structure and Owen extends it [6]. Each union obtains its payoff from the game between the unions, and then the payoff is allocated by the internal game among the members of the union. All the payoffs are computed by the Shapely value.

Assuming that N = {1, 2,..., n} and M = {1,..., m}, a partition P = {N1, N2,..., Nm} is a coalition structure on N. Let Nk a union and ⋃1≤k≤mNk = N. When lk, NiNk = ∅. For iN, k(i) denotes the index of the union containing player i, so k(i) is defined by the relation iNk(i). For kM and SNk, the game S is defined by

v^S(Q)=v(hQNh),kQv(hQ{k}NhS),kQ

where QM.

The game v¯k is defined by v¯k(S)=Shk(v^S), then the Owen value of the player i ∈N in the game v¯k(i) is Owi(v,P)=Shi(v¯k(i)).

3.2 A new algorithm

Because the community structure is prevalent in social networks [7], we respectively consider the community’s influence on the information diffusion and every node’s influence in the community. We take the nodes in the social network as the players in the cooperative game and information diffusion as coalition formulation. We can map the information diffusion into a cooperative game with transferable utility which is formalized in the literature [8]. So, we can use the Owen value to obtain the marginal contribution of every node. Because the Owen value can be seen as a two-step procedure in which the Shapely value applies twice, we firstly compute a node’s Shapely value.

Given a node i ∈N and a subset SN such that iS,the marginal contribution of node i is v(S ⋃ {i}) - v(S), ∀SN\{i}. Consider the set of all possible permutations Ψ on N, let ψΨ and define Si(ψ) to be the set of all nodes appearing before node i in the permutation ψ. So, the average marginal contribution of node i to the given coalition game is

1n!ψΨ[v(Si(ψ){i})v(Si(ψ))].

Note that, this method must work with n! permutations and its computational complexity is O((n/e)n)9. Therefore, we give the approximate method for computing the Shapely value. Randomly generated t-sets Ψt with t permutations, see Algorithm 2, let ψ ∈Ψt and ψ(i) denotes the ith node in the permutation. The number of activated nodes after running the diffusion model when the node ψ(1) is activated is the contribution of ψ(1). Next, we consider the node ψ(2). If ψ(2) becomes active after ψ(1) is activated, then the contribution of ψ(2) is 0. Otherwise, the contribution of ψ(2) is the number of activated nodes by ψ(2). Therefore, we can obtain the contributions of ψ(3),..., ψ(n). For ψΨt, we repeat the above process R times. Then the average contribution of each node in the diffusion process can be calculated. We can obtain the top-k nodes by sorting by the greatest influence and ensure that they are not adjacent to each other. See Algorithm 3 and Algorithm 4.

Algorithm 2 CREAT_Ψt(n)

1: t=random(n)

2: m=random(n)

3: Select_t (n)

4: for i = 0 to m do

5:  arr[i] = random() % (n-i)

6:  for j=0 to i do

7:   if arr[j] <= arr[i] then

8:    arr[i]=arr[i]+1

9:   end if

10:  end for

11:  v = arr[i]

12:  for k = i-1 to j do

13:   arr[k+1] = arr[k]

14:   k=k-1

15:  end for

16:  arr[j] = v

17: end for

18: for h=2 to t do

19:  |Ψh-1| =arr

20:  n=n-m

21:  m=random(n)

22:  Select_t(n)

23: end for

24: | Ψh | =arr

Algorithm 3 Shapely Value(v, R)

1: n=|ψ|

2: t=|CREAT_Ψt|

3: tmp[1...n]=0

4: ShV[1...n]=0

5: for i=1 to t do

6:  for r=1 to R do

7:   for j=1 to n do

8:    tmp_b=v(Sj(ψi)⋃ {j}) - v(Sj(ψi))

9:    tmp[j]=α tmp[j] + (1-α) tmp_b

10:   end for

11:  end for

12: end for

13: for i=1 to n do

14:  ShV[i]=tmp[i]/t

15: end for

Algorithm 4 TOP_K(V)

1: TopK[1...k]=0

2: AsceSort(V);

3: TopK[1]= V[1]

4: i=1

5: j=2;

6: while i < k do

7:  if V[j] is not adjacent to TopK[1... i-1] then

8:   TopK[i]= V[j]

9:   i=i+1

10:  end if

11:  j=j+1

12: end while

According to the description in Section 3.1, we provide the calculation method of the Owen value. Roger Guimerà, et al studied node roles in a community according to within-module degree z and participation coefficient P, which are divided into seven categories Role = {R1, R2, R3, R4, R5, R6, R7}10. We consider two types of the roles: Non-hub connector node (z < 2.5 and 0.62 < P ≤ 0.80, R3) and Connector hub (z ≥2.5 and 0.30 < P ≤0.75, R6). Most of the nodes which belong to these two roles connect to other communities.

We use the CNM algorithm [11] to divide the network G = (V, E) into l communities C = {C1, C2,..., Cl|Ci = (Vi, Ei), i = 1,...,l} and assign the role rvihRole for every node vihVi in the community. Let Role’ = {R3, R6}, i = 1, ..., l, j = 1, ..., l,

V={vih,vjg|(vih,vjg),vihVi,rvihRole,ij},
E={eih,(vih,vjg)|eih=(viha,vihb)Ei,vihaVi,vihbVi,rvihRole,ij},

define G′ = (V′, E′) as the community game network. So, we can obtain the Shapely value of every node in the network G′ and take the sum of the Shapely values of all nodes in the same community as the community’s payoff. Then we treat a community as a separate network and calculate the Shapely value of every node in the community. The node’s Owen value is assigned according to the normalized Shapely value of the node in the community and the community’s payoff. So, we can obtain the k critical nodes by Algorithm 4.

4 Experiments

We validate our method using two synthetic datasets and four real network datasets. All experiments are executed using a PC with 3.2GHz CPU, 4G Memory and Windows 7. The development tools are Matlab 2009 and Microsoft Visual Studio 2010.

4.1 Datasets

We use the BA model [12] and the Forest Fire model [13] to generate two synthetic datasets with 5000 nodes. The BA model takes the power-law distribution and has two important features: growth and preferential attachment. The model can generate a scale-free network whose power exponent is 3 and community structure is not obvious. The Forest Fire model can generate a network with degree power law, densification law, shrinking diameter, and obvious community structure.

The real datasets include DBLP, Facebook, Enron and Youtube. The DBLP dataset [14] constructs a co-author network with 143276 nodes and 359812 edges according to the papers published in the conferences and journals of the computer field from 1997 to 2006. The Facebook dataset [15] provides the friendship network of the New Orleans area with 60567 users and 583766 connections obtained from Jan. 1, 2007 to Dec. 31, 2008. The Enron dataset [16-19] is an E-mail network with 36692 nodes and 367662 edges. The Youtube dataset [20, 21] consists of 35468 nodes and 261191 edges obtained from Jan. 1, 2007 and Jan. 15, 2007.

4.2 The results

We compare our method CNP-OV with the greedy algorithm GREEDY (Algorithm 1), the degree-heuristic algorithm DEGREE and the random algorithm RANDOM. DEGREE selects k nodes with the greatest degree from the network as the initial set; RANDOM randomly selects k nodes as the initial set. In order to obtain the accurate influence of every algorithm, we use the average number of the activated nodes after running ICM and LTM 10000 times for every initial set. In ICM, the propagation probability is set to 0.05; in LTM, the edge-weight of a node is the reciprocal of the node’s degree. The size of the initial set is respectively set from 1 to 20. In the experiments, we only discuss the case of using the ICM because we obtain the same conclusions for ICM and LTM.

First, we consider the influence of community structure on the CNP-OV. We respectively compute the Shapely value and Owen value of every node in the BA and FF datasets and obtain the initial set and the number of activated nodes after running the ICM. The process is repeated 100 times and the average number of the nodes activated by the initial set with different size is drawn in Figure 1. The dashed Sv denotes the method based on the Shapely value and the solid line Ov is the method based on the Owen value. The Sv is almost the same as the Ov for the BA dataset with an unobvious community structure (Figure 1a). In contrast, the Ov is significantly better than the Sv for the FF dataset with an obvious community structure (Figure 1b).

Figure 1 The influence of community structure on our method.
Figure 1

The influence of community structure on our method.

Secondly, we analyze our method’s accuracy. We respectively use GREEDY, DEGREE, RANDOM and CNP-OV to determine the initial sets from above for four real datasets. Figure 2 describes the number of nodes activated by the initial set with different size based on ICM. The accuracy of the CNP-OV is similar to GREEDY, sometimes even better than it(Figure 2b). Compared with DEGREE and RANDOM, the CNP-OV provides a large advantage.

Figure 2 Performance Analysis
Figure 2

Performance Analysis

5 Conclusions

Considering the widespread community structure in social networks, for solving the CNP, in this paper we present a new algorithm for discovering critical nodes based on cooperative games. It assigns a marginal contribution for every node in a community of social networks using the solution concept and union concept of cooperative games. We sort all nodes by their contribution and obtain critical nodes according to selected rules. We have validated its feasibility and effectiveness. The next step will be to study how to improve the time efficiency of the CNP-OV.

Acknowledgement

This work is supported by the National Social Science Foundation of China (No.11BFX125), PuJiang Talent Project, Peak of law subject construction Project and Public Security Discipline Construction Foundation.

References

[1] He N., Li D.Y., Gan W.Y., Zhu X., Mining vital nodes in complex networks, Computer Science, 2007, 34(12): 1-5.Search in Google Scholar

[2] Even-Dar E., Shapira A., A note on maximizing the spread of influence in social networks, WINE 2007, LNCS 4858, 2007: 281-286.10.1007/978-3-540-77105-0_27Search in Google Scholar

[3] Shetty J., Adibi J., Discovering Important Nodes through Graph Entropy The Case of Enron Email Database, The 3rd international workshop on Link discovery, Chicago, Illinois, 2005:74-81.10.1145/1134271.1134282Search in Google Scholar

[4] Nemhauser G., Wolsey L., Fisher M., An analysis of the approximations for maximizing submodular set functions, Mathematical Programming, 1978, 14(1): 265-294.10.1007/BF01588971Search in Google Scholar

[5] Shapley L.S., A value for n-person games, In: Kuhn H W, Tucker A W (Eds.), Contributions to the Theory of Games II, Princeton University Press, 1953, 307-317.10.1515/9781400881970-018Search in Google Scholar

[6] Owen G., Values of games with a priori unions, In: Henn R, Moeschlin O (Eds.), Essays in mathematical economics and game theory, Springer-Verlag, Berlin, 1977, 76-88.10.1007/978-3-642-45494-3_7Search in Google Scholar

[7] Scott J., Social Network Analysis: A Handbook (2nd ed), Sage, London, 2000.Search in Google Scholar

[8] Jean-Francois C., Network Games as TU Cooperative Games: The Core, the Shapley Value and Simple Network Games, 2009, http://centres.fusl.ac.be/CEREC/document/seminars/caulier_cerec_feb2009.pdfSearch in Google Scholar

[9] Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, 2nd ed, Cambridge, MA: MIT Press, 2001.Search in Google Scholar

[10] Guimerà R., Amaral L.A.N., Functional cartography of complex metabolic networks, Nature, 2005, 433:895-900.10.1038/nature03288Search in Google Scholar PubMed PubMed Central

[11] Clauset A., Newman M.E.J., Moore C., Finding community structure in very large networks, PHYSICAL REVIEW E, 2004, 70(6): 066111 (6).10.1103/PhysRevE.70.066111Search in Google Scholar PubMed

[12] Barabási A.L., Albert R., Emergence of scaling in random networks, Science, 1999, 286(5439): 509-512.10.1515/9781400841356.349Search in Google Scholar

[13] Leskovec J., Kleinberg J., Faloutsos C., Graphs over time: Densification laws, shrinking diameters and possible explanations, The 11th ACM SIGKDD international conference on Knowledge discovery in data mining (KDD). Chicago, Illinois, USA, 2005: 177-187.10.1145/1081870.1081893Search in Google Scholar

[14] http://dblp.uni-trier.de/Search in Google Scholar

[15] Viswanath B., Mislove A., Cha M., Gummadi K.P., On the evolution of user interaction in Facebook, The 2nd ACM SIGCOMM Workshop on Social Networks(WOSN), Barcelona, Spain,2009: 37-42.10.1145/1592665.1592675Search in Google Scholar

[16] http://www-2.cs.cmu.edu/~enron/Search in Google Scholar

[17] Awadalla N.S., Hanna M.A., Ismail M.N., Period Variation Study and Light Curve Analysis of the Eclipsing Binary GSC 02013-00288, Applied Mathematics and Nonlinear Sciences, 2016, 1(2): 321–334.10.21042/AMNS.2016.2.00027Search in Google Scholar

[18] Chen Q., Chang H., Govindan R., Jamin S., Shenker S.J., Willinger W., The origin of power laws in Internet topologies revisited, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, Los Alamitos, CA, USA, 2002: 608-617.Search in Google Scholar

[19] Watts D.J., Strogatz S.H., Collective dynamics of “small-world” networks, Nature, 1998, 393: 440-442.10.1515/9781400841356.301Search in Google Scholar

[20] Rosa M., Gandarias M.L., Multiplier method and exact solutions for a density dependent reaction-diffusion equation, Applied Mathematics and Nonlinear Sciences, 2016, 1(2):311–320.10.21042/AMNS.2016.2.00026Search in Google Scholar

[21] Mislove A., Marcon M., Gummadi K.P., Druschel P., Bhattacharjee B., Measurement and analysis of online social networks, The 7th ACM SIGCOMM conference on Internet measurement conference (IMC), San Diego, California, USA, 2007: 29-42.10.1145/1298306.1298311Search in Google Scholar

Received: 2016-8-10
Accepted: 2016-9-14
Published Online: 2017-3-16

© 2017 X.-G. Wang

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Articles in the same Issue

  1. Regular Articles
  2. Analysis of a New Fractional Model for Damped Bergers’ Equation
  3. Regular Articles
  4. Optimal homotopy perturbation method for nonlinear differential equations governing MHD Jeffery-Hamel flow with heat transfer problem
  5. Regular Articles
  6. Semi- analytic numerical method for solution of time-space fractional heat and wave type equations with variable coefficients
  7. Regular Articles
  8. Investigation of a curve using Frenet frame in the lightlike cone
  9. Regular Articles
  10. Construction of complex networks from time series based on the cross correlation interval
  11. Regular Articles
  12. Nonlinear Schrödinger approach to European option pricing
  13. Regular Articles
  14. A modified cubic B-spline differential quadrature method for three-dimensional non-linear diffusion equations
  15. Regular Articles
  16. A new miniaturized negative-index meta-atom for tri-band applications
  17. Regular Articles
  18. Seismic stability of the survey areas of potential sites for the deep geological repository of the spent nuclear fuel
  19. Regular Articles
  20. Distributed containment control of heterogeneous fractional-order multi-agent systems with communication delays
  21. Regular Articles
  22. Sensitivity analysis and economic optimization studies of inverted five-spot gas cycling in gas condensate reservoir
  23. Regular Articles
  24. Quantum mechanics with geometric constraints of Friedmann type
  25. Regular Articles
  26. Modeling and Simulation for an 8 kW Three-Phase Grid-Connected Photo-Voltaic Power System
  27. Regular Articles
  28. Application of the optimal homotopy asymptotic method to nonlinear Bingham fluid dampers
  29. Regular Articles
  30. Analysis of Drude model using fractional derivatives without singular kernels
  31. Regular Articles
  32. An unsteady MHD Maxwell nanofluid flow with convective boundary conditions using spectral local linearization method
  33. Regular Articles
  34. New analytical solutions for conformable fractional PDEs arising in mathematical physics by exp-function method
  35. Regular Articles
  36. Quantum mechanical calculation of electron spin
  37. Regular Articles
  38. CO2 capture by polymeric membranes composed of hyper-branched polymers with dense poly(oxyethylene) comb and poly(amidoamine)
  39. Regular Articles
  40. Chain on a cone
  41. Regular Articles
  42. Multi-task feature learning by using trace norm regularization
  43. Regular Articles
  44. Superluminal tunneling of a relativistic half-integer spin particle through a potential barrier
  45. Regular Articles
  46. Neutrosophic triplet normed space
  47. Regular Articles
  48. Lie algebraic discussion for affinity based information diffusion in social networks
  49. Regular Articles
  50. Radiation dose and cancer risk estimates in helical CT for pulmonary tuberculosis infections
  51. Regular Articles
  52. A comparison study of steady-state vibrations with single fractional-order and distributed-order derivatives
  53. Regular Articles
  54. Some new remarks on MHD Jeffery-Hamel fluid flow problem
  55. Regular Articles
  56. Numerical investigation of magnetohydrodynamic slip flow of power-law nanofluid with temperature dependent viscosity and thermal conductivity over a permeable surface
  57. Regular Articles
  58. Charge conservation in a gravitational field in the scalar ether theory
  59. Regular Articles
  60. Measurement problem and local hidden variables with entangled photons
  61. Regular Articles
  62. Compression of hyper-spectral images using an accelerated nonnegative tensor decomposition
  63. Regular Articles
  64. Fabrication and application of coaxial polyvinyl alcohol/chitosan nanofiber membranes
  65. Regular Articles
  66. Calculating degree-based topological indices of dominating David derived networks
  67. Regular Articles
  68. The structure and conductivity of polyelectrolyte based on MEH-PPV and potassium iodide (KI) for dye-sensitized solar cells
  69. Regular Articles
  70. Chiral symmetry restoration and the critical end point in QCD
  71. Regular Articles
  72. Numerical solution for fractional Bratu’s initial value problem
  73. Regular Articles
  74. Structure and optical properties of TiO2 thin films deposited by ALD method
  75. Regular Articles
  76. Quadruple multi-wavelength conversion for access network scalability based on cross-phase modulation in an SOA-MZI
  77. Regular Articles
  78. Application of ANNs approach for wave-like and heat-like equations
  79. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  80. Study on node importance evaluation of the high-speed passenger traffic complex network based on the Structural Hole Theory
  81. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  82. A mathematical/physics model to measure the role of information and communication technology in some economies: the Chinese case
  83. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  84. Numerical modeling of the thermoelectric cooler with a complementary equation for heat circulation in air gaps
  85. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  86. On the libration collinear points in the restricted three – body problem
  87. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  88. Research on Critical Nodes Algorithm in Social Complex Networks
  89. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  90. A simulation based research on chance constrained programming in robust facility location problem
  91. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  92. A mathematical/physics carbon emission reduction strategy for building supply chain network based on carbon tax policy
  93. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  94. Mathematical analysis of the impact mechanism of information platform on agro-product supply chain and agro-product competitiveness
  95. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  96. A real negative selection algorithm with evolutionary preference for anomaly detection
  97. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  98. A privacy-preserving parallel and homomorphic encryption scheme
  99. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  100. Random walk-based similarity measure method for patterns in complex object
  101. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  102. A Mathematical Study of Accessibility and Cohesion Degree in a High-Speed Rail Station Connected to an Urban Bus Transport Network
  103. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  104. Design and Simulation of the Integrated Navigation System based on Extended Kalman Filter
  105. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  106. Oil exploration oriented multi-sensor image fusion algorithm
  107. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  108. Analysis of Product Distribution Strategy in Digital Publishing Industry Based on Game-Theory
  109. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  110. Expanded Study on the accumulation effect of tourism under the constraint of structure
  111. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  112. Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph
  113. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  114. Research on the method of information system risk state estimation based on clustering particle filter
  115. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  116. Demand forecasting and information platform in tourism
  117. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  118. Physical-chemical properties studying of molecular structures via topological index calculating
  119. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  120. Local kernel nonparametric discriminant analysis for adaptive extraction of complex structures
  121. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  122. City traffic flow breakdown prediction based on fuzzy rough set
  123. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  124. Conservation laws for a strongly damped wave equation
  125. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  126. Blending type approximation by Stancu-Kantorovich operators based on Pólya-Eggenberger distribution
  127. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  128. Computing the Ediz eccentric connectivity index of discrete dynamic structures
  129. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  130. A discrete epidemic model for bovine Babesiosis disease and tick populations
  131. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  132. Study on maintaining formations during satellite formation flying based on SDRE and LQR
  133. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  134. Relationship between solitary pulmonary nodule lung cancer and CT image features based on gradual clustering
  135. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  136. A novel fast target tracking method for UAV aerial image
  137. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  138. Fuzzy comprehensive evaluation model of interuniversity collaborative learning based on network
  139. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  140. Conservation laws, classical symmetries and exact solutions of the generalized KdV-Burgers-Kuramoto equation
  141. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  142. After notes on self-similarity exponent for fractal structures
  143. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  144. Excitation probability and effective temperature in the stationary regime of conductivity for Coulomb Glasses
  145. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  146. Comparisons of feature extraction algorithm based on unmanned aerial vehicle image
  147. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  148. Research on identification method of heavy vehicle rollover based on hidden Markov model
  149. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  150. Classifying BCI signals from novice users with extreme learning machine
  151. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  152. Topics on data transmission problem in software definition network
  153. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  154. Statistical inferences with jointly type-II censored samples from two Pareto distributions
  155. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  156. Estimation for coefficient of variation of an extension of the exponential distribution under type-II censoring scheme
  157. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  158. Analysis on trust influencing factors and trust model from multiple perspectives of online Auction
  159. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  160. Coupling of two-phase flow in fractured-vuggy reservoir with filling medium
  161. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  162. Production decline type curves analysis of a finite conductivity fractured well in coalbed methane reservoirs
  163. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  164. Flow Characteristic and Heat Transfer for Non-Newtonian Nanofluid in Rectangular Microchannels with Teardrop Dimples/Protrusions
  165. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  166. The size prediction of potential inclusions embedded in the sub-surface of fused silica by damage morphology
  167. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  168. Research on carbonate reservoir interwell connectivity based on a modified diffusivity filter model
  169. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  170. The method of the spatial locating of macroscopic throats based-on the inversion of dynamic interwell connectivity
  171. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  172. Unsteady mixed convection flow through a permeable stretching flat surface with partial slip effects through MHD nanofluid using spectral relaxation method
  173. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  174. A volumetric ablation model of EPDM considering complex physicochemical process in porous structure of char layer
  175. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  176. Numerical simulation on ferrofluid flow in fractured porous media based on discrete-fracture model
  177. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  178. Macroscopic lattice Boltzmann model for heat and moisture transfer process with phase transformation in unsaturated porous media during freezing process
  179. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  180. Modelling of intermittent microwave convective drying: parameter sensitivity
  181. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  182. Simulating gas-water relative permeabilities for nanoscale porous media with interfacial effects
  183. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  184. Simulation of counter-current imbibition in water-wet fractured reservoirs based on discrete-fracture model
  185. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  186. Investigation effect of wettability and heterogeneity in water flooding and on microscopic residual oil distribution in tight sandstone cores with NMR technique
  187. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  188. Analytical modeling of coupled flow and geomechanics for vertical fractured well in tight gas reservoirs
  189. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  190. Special Issue: Ever New "Loopholes" in Bell’s Argument and Experimental Tests
  191. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  192. The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  193. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  194. Erratum to: The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  195. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  196. Rhetoric, logic, and experiment in the quantum nonlocality debate
  197. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  198. What If Quantum Theory Violates All Mathematics?
  199. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  200. Relativity, anomalies and objectivity loophole in recent tests of local realism
  201. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  202. The photon identification loophole in EPRB experiments: computer models with single-wing selection
  203. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  204. Bohr against Bell: complementarity versus nonlocality
  205. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  206. Is Einsteinian no-signalling violated in Bell tests?
  207. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  208. Bell’s “Theorem”: loopholes vs. conceptual flaws
  209. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  210. Nonrecurrence and Bell-like inequalities
  211. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  212. Three-dimensional computer models of electrospinning systems
  213. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  214. Electric field computation and measurements in the electroporation of inhomogeneous samples
  215. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  216. Modelling of magnetostriction of transformer magnetic core for vibration analysis
  217. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  218. Comparison of the fractional power motor with cores made of various magnetic materials
  219. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  220. Dynamics of the line-start reluctance motor with rotor made of SMC material
  221. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  222. Inhomogeneous dielectrics: conformal mapping and finite-element models
  223. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  224. Topology optimization of induction heating model using sequential linear programming based on move limit with adaptive relaxation
  225. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  226. Detection of inter-turn short-circuit at start-up of induction machine based on torque analysis
  227. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  228. Current superimposition variable flux reluctance motor with 8 salient poles
  229. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  230. Modelling axial vibration in windings of power transformers
  231. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  232. Field analysis & eddy current losses calculation in five-phase tubular actuator
  233. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  234. Hybrid excited claw pole generator with skewed and non-skewed permanent magnets
  235. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  236. Electromagnetic phenomena analysis in brushless DC motor with speed control using PWM method
  237. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  238. Field-circuit analysis and measurements of a single-phase self-excited induction generator
  239. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  240. A comparative analysis between classical and modified approach of description of the electrical machine windings by means of T0 method
  241. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  242. Field-based optimal-design of an electric motor: a new sensitivity formulation
  243. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  244. Application of the parametric proper generalized decomposition to the frequency-dependent calculation of the impedance of an AC line with rectangular conductors
  245. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  246. Virtual reality as a new trend in mechanical and electrical engineering education
  247. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  248. Holonomicity analysis of electromechanical systems
  249. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  250. An accurate reactive power control study in virtual flux droop control
  251. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  252. Localized probability of improvement for kriging based multi-objective optimization
  253. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  254. Research of influence of open-winding faults on properties of brushless permanent magnets motor
  255. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  256. Optimal design of the rotor geometry of line-start permanent magnet synchronous motor using the bat algorithm
  257. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  258. Model of depositing layer on cylindrical surface produced by induction-assisted laser cladding process
  259. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  260. Detection of inter-turn faults in transformer winding using the capacitor discharge method
  261. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  262. A novel hybrid genetic algorithm for optimal design of IPM machines for electric vehicle
  263. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  264. Lamination effects on a 3D model of the magnetic core of power transformers
  265. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  266. Detection of vertical disparity in three-dimensional visualizations
  267. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  268. Calculations of magnetic field in dynamo sheets taking into account their texture
  269. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  270. 3-dimensional computer model of electrospinning multicapillary unit used for electrostatic field analysis
  271. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  272. Optimization of wearable microwave antenna with simplified electromagnetic model of the human body
  273. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  274. Induction heating process of ferromagnetic filled carbon nanotubes based on 3-D model
  275. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  276. Speed control of an induction motor by 6-switched 3-level inverter
Downloaded on 14.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/phys-2017-0008/html
Scroll to top button