Startseite Research on the method of information system risk state estimation based on clustering particle filter
Artikel Open Access

Research on the method of information system risk state estimation based on clustering particle filter

  • Jia Cui EMAIL logo , Bei Hong , Xuepeng Jiang und Qinghua Chen
Veröffentlicht/Copyright: 4. Mai 2017

Abstract

With the purpose of reinforcing correlation analysis of risk assessment threat factors, a dynamic assessment method of safety risks based on particle filtering is proposed, which takes threat analysis as the core. Based on the risk assessment standards, the method selects threat indicates, applies a particle filtering algorithm to calculate influencing weight of threat indications, and confirms information system risk levels by combining with state estimation theory. In order to improve the calculating efficiency of the particle filtering algorithm, the k-means cluster algorithm is introduced to the particle filtering algorithm. By clustering all particles, the author regards centroid as the representative to operate, so as to reduce calculated amount. The empirical experience indicates that the method can embody the relation of mutual dependence and influence in risk elements reasonably. Under the circumstance of limited information, it provides the scientific basis on fabricating a risk management control strategy.

1 Introduction

In recent years, the information system has brought people convenience, but at the same time, the security problem is also becoming more and more outstanding. It has been widely used to solve the potential security problem by identifying the security risk of information system [1]. The evaluation result of traditional risk assessment method may have greater subjectivity such as matrix method and phase multiplication, because they mainly depend on the experience of experts. Some researchers have proposed using rough set model [2], Bayesian network model [3] or support vector machine model [4] method for risk assessment, which have made some achievements, but there are some problems in these models: rough set model has lower accuracy; Bayesian network model's accuracy is determined by the class conditional probability density and the prior probability; support vector machine model needs solving convex quadratic programming, which is equal to the number of training samples two times, the storage space is large, and the calculation time is long.

In order to improve the accuracy of the evaluation results, it may be considered to start with one or several major security risk factors [5, 6]. A method of information system risk assessment based on particle filter is proposed in this paper. It is based on the information security risk assessment process and combined with the information security risk assessment standards, to reduce the risk assessment of subjectivity, improve the effectiveness of evaluation and decision-making as the goal, and it's a new and effective risk evaluation method.

2 Particle filter algorithm

The particle filter algorithm is that: by looking for a random sample spread in the state space to approximate the probability density function p(xk|yk), integral operation by sample mean value, so as to obtain the process state minimum variance estimation, the random sample is called particle. The mathematical language is described as follows: for stationary stochastic processes, it can be assumed that at the k − 1 moment, the posterior probability density of the system is p(xk − 1|yk − 1), according to a certain principle, then select n random sample point, after getting the measure information yk at the k moment, the posterior probability density of n particle can be approximated to p(xk|yk) after the state and time renewal process. With the increase of the number of particles, probability density function of particle is gradually approaching the probability density function of the state, the particle filter estimation is to achieve the effect of the optimal Bayesian estimation.

Particle filter algorithm has the following advantages:

  1. The state equation and the observation equation of the system are not required to be linearized, which avoids the error caused by the linearization process;

  2. With a large number of sample points, this algorithm predicts and updates the probability density function of state by sampling and re-sampling, and contains more information than only using mean value and variance;

  3. Particle filter algorithm does not need to has too many constraints on the probability density of the state variables

Therefore, it is the “optimal” filter for the state estimation of nonlinear non-Gaussian systems.

The core of the particle filter algorithm is with a set of random samples to represent random variables inspection probability density, which can be obtained basing on the approximate optimal numerical solution of physical model rather than the approximate model of optimal filtering. Particle filtering algorithm can be used in any system, and is especially suitable for strong nonlinear non-Gaussian system.

Theoretically speaking, all systems in real life are nonlinear, many of which are nonlinear and non-Gaussian, therefore using the particle filter algorithm to estimate the system, and estimating the risking state for nonlinear non-Gaussian information system would undoubtedly be the best choice.

Sequential importance sampling first appeared in 1950s, however, due to the limitations of the degradation problem and the computational power, the SIS has not been well developed. Until 1993, Gordon overcomes the problem of degradation of the algorithm, and puts forward the concept of resampling, then the first operation of the Carlo Monte filter appears, that is called the resampling particle filter algorithm [712]. As for particle filter algorithm, when the number of particles approaches infinity, the calculation accuracy of the particle filter algorithm is the highest, but the computation is also increased. How to reduce the computational complexity of the particle filter algorithm, and how to improve the computational efficiency of the particle filter algorithm have become a hot spot in the research field of the particle filter algorithm. Aiming at the above problems, the K-means clustering algorithm was proposed into particle filter algorithm by clustering all particles on the particle concentration, the centroid of each class as the class representative to participate in the operation [13, 14]. When the degenerate phenomenon is serious, the optimal particle is replaced by the degenerated particle, so as to reduce the amount of computation, and solve the problem of degradation to a certain extent.

3 Clustering algorithm

Cluster analysis is an unsupervised pattern recognition method, which is one of the most common techniques in data mining. Clustering is a progress of dividing a data set into several groups or classes, which makes the data object in the same class of high similarity, and similarities between data objects are relatively low.

Each set of data generated by the clustering is called a cluster, and each data in the cluster is called an object. The purpose of clustering is to make the characteristics of objects in the same cluster as similar as possible, and the difference among different cluster objects is as large as possible. The task of clustering is to divide an unlabeled model into several subsets according to some criteria, and the similar samples are classified into the same class. Many existing clustering methods such as rough set clustering [15], fuzzy clustering [16, 17] and support vector clustering [18] have been used in many fields, including data analysis, fault diagnosis, text classification, pattern recognition, image processing, radar target detection, biological engineering, space remote sensing technology, etc.

3.1 Characteristics of K-means algorithm

Particle filter algorithm is designed to reduce the calculation of particle filter algorithm, so the first principle of the clustering algorithm is: easy to implement, as the algorithm is simple. K-means clustering algorithm, also known as hard C mean clustering algorithm, which is a classical algorithm to solve the clustering problem, and it has been successfully applied in many clustering problems [19]. The main advantages of the algorithm are simplicity and speed. In addition, when programming in MATLAB, one can directly call the K-means clustering function to simplify the preparation of the program. Above all, K-means algorithm is the best choice of particle clustering algorithm.

K-means clustering algorithm is one of the basic and most widely used classification methods in clustering analysis. It is a method to discover clusters and cluster centers in non-labeled data. After choosing the number of expecting centers k, K-means becomes the progress of minimizing variance within clusters by moving the centers repeatedly.

3.2 The idea of K-means clustering algorithm

The basic idea of K-means clustering algorithm is: giving a database containing n data object, and the number of clusters to be generated k, select k objects as the initial k cluster centers randomly, then calculate the distance between every remaining sample and each cluster center, then return to its nearest cluster center which is located in the class, then calculate the cluster centers by the method of adjusting the new class using the average value. If there is no change in the cluster center of the two adjacent centers, it means the sample adjustment is done and the clustering average error criterion function E is convergent [20, 21]. The algorithm has to examine whether each sample in each iteration is correct. If it is not correct, then it should be adjusted. After all the samples are adjusted, the algorithm should modify the cluster center and enter the next iteration. In an iterative algorithm, if all samples are correctly classified, there will be no adjustment, the clustering center will not have any change too. In the process of iterative algorithm, the value of E decreased, and finally converged to a fixed value, which is also one of the basis of the measurement algorithm [22]. The following criterion function is generally selected:

E=i=1kpCi|pmi|2,(1)

where the E is the sum of squared error of all research objects, p is the point of the space, that is, data objects, mi is the average value of class Ci. According to this criterion, the resulting clusters tend to be independent and compact.

3.3 K-means algorithm process

Input: number of clusters k, and a sample set {x} containing n data objects.

Output: k cluster with minimum variance criterion.

K-means clustering algorithm process [23, 24]

Step 1. Select k object as the initial cluster center: z1(1), z2(1), z3(1), . . . . . . , zk(1), the ordinal number in the bracket is the second ordinal of the iteration of the center of the class, the vector value of cluster centers can be arbitrarily set, for example, k initial data can be used as the clustering center;

Step 2. According to the mean value of all the objects in each cluster, the distance between each object in the sample set {x} and the center object is calculated, according to the principle of minimum distance, the corresponding object is divided into the corresponding cluster center zj(t). Which means when {‖xzi(t)‖, i = 1, 2 … , k} = ‖xzj(t)‖, xSj(t), where Sj(t) indicates the cluster whose center is zj(t);

Step 3. Calculate the average (center object) of each cluster. zj(t + 1), j = 1, 2 … , k, that is

zj(t+1)=1NjxSj(t)x,j=1,2,k(2)

Where Nj represents the number of samples contained in the cluster Sj(t). The cluster mean value is used as the class center, which can make the clustering criterion function

Jj=xSj(t)xzj(t+1),j=1,2,k(3)

In this step, the mean of the k clusters is calculated separately, and the name of the k-means cluster is derived;

Step 4. If zj(t + 1) ≠ zj(t), j = 1, 2 … , k, then t = t + 1, back to step 2, reclassification of sample set {x}, then iterative calculate; if zj(t + 1) = zj(t), then the algorithm is convergent, and the calculation is finished.

4 Information system security risk state estimation method based on clustering particle filter

In the process of information security risk assessment, the risk state estimation is a key link, and the accuracy of the state estimation algorithm will directly determine whether the evaluation results are accurate. Particle filter is a nonlinear non-Gaussian optimal filtering algorithm [7, 25], so this paper select the particle filter algorithm for information system security risk assessment, combined with clustering algorithm to solve the computational problem.

The dynamic model of the information system is assumed to be:

xk=f(xk1,νk1)yk=h(xk,vk)(4)

where xkRnx is the threat index vector of the system at moment k, ykRny is risk output vector, νkRnν is the system’s noise, vkRnn is the observation noise.

The posterior density p(x0:k|y1:k) is a complete solution to the sequential estimation problem. According to the principle of Monte Carlo simulation, the posterior density can be approximately represented as:

p(x0:k|y1:k)i=1Nwkiδ(x0:kx0:ki)(5)

Introducing the key density q(x0:k|y1:k) and assuming that the sample x0:ki is obtained from the focus density sampling:

xkiq(x0:k|y1:k)(6)

and the importance weight:

wkip(x0:ki|y1:k)q(x0:ki|y1:k)(7)

Assuming that the density can be decomposed into:

q(x0:k|y1:k)=q(xk|x0:k1,y1:k)q(x0:k1|y1:k1)(8)

Which means that the sample set x0:kiq(x0:k|y1:k) can be obtained by adding the new particle xkiq(xk|x0:k1,y1:k) into x0:k1iq(x0:k1|y1:k1). And p(x0:k|y1:k) can be expressed as a recursive form below:

p(x0:k|y1:k)=p(yk|y1:k1|x0:k)p(yk|y1:k1)×p(y1:k1|x0:k)p(x0:k)p(y1:k1)(9)

Using Bayes formula:

p(x0:k|y1:k)=p(yk|y1:k1|x0:k)p(yk|y1:k1)×p(xk|x0:k1|y1:k1)p(x0:k1|y1:k1)(10)

As the system follows the first order Markov process, and it’s an independent observation system, so

p(x0:k|y1:k)p(yk|xk)p(xk|xk1)p(x0:k1|y1:k1)(11)

If the focus density satisfies

q(xk|x0:k1,y1:k)=q(xk|xk1,yk)(12)

Combining formulas (4)

wkiwk1ip(yk|xki)p(xki|xk1i)q(xki|xk1i,yk)(13)

Which is

xkiq(xk|xk1i,yk)(14)

After weight normalization

wki=wki/i=1Nwki(15)

Usually taking

q(xki|xk1i,yk)=p(xki|xk1i)(16)

Which is

xkip(xk|xk1i)(17)

Then

wkiwk1ip(yk|xki)(18)

The above steps are all the basis of particle filter dynamic estimation algorithm. According to the measuring value of the system, the above-mentioned method is used to calculate samples and weight recursively, forming a dynamic estimation algorithm of particle filtering. And the progress of particle filter and state estimation algorithm based on weight is as follows:

Step 1. Initialization: At k = 0 moment, taking samples according to the key density, k = 1;

Step 2. Predication:

xki=f(xk1i,νk1)(19)

Step 3. Weighting:

wki=wk1i×p(yk|xki)p(xki|xk1i)q(xki|xk1i,yk)(20)

Step 4. Weight normalization:

wki=wki/i=1Nwki(21)

Step 5. State estimation:

xk=i=1Nxki×wki(22)

Step 6. Back to step 2.

The essence of the method of information system state estimation based on particle filter is that making j-steps forward prediction about the particle at k moment. Knowing the observed value y1:k, when making j-steps forward prediction about the system’s state, particles are updated in an existing way, the weight of a particle at (k + j) moment keeps unchanged to particle at k moment, and the j-step forward to the state of risk prediction probability (i.e., a comprehensive assessment of the risk level) can be calculated as:

rp(j,k)=i=1NwkjI(xk+jk+j1i),j[1,n](23)

Where wkj is the importance weight corresponding to xki, which is the system risk state, such as {normal, medium, dangerous}, and w0 = {0.1, 0.5, 1}, I(A) is the symbolic function. In order to ensure the accuracy of calculation, usually take j = 1, which means one step prediction.

5 Simulation and verification

In this paper, the simulation data is generated by a security laboratory database provided by a scientific research institution. In order to ensure the overall accuracy of the selected indicators, this paper takes the GB/T 20984-2007 “Information security technology-risk assessment specification for information security” as the principle, which raises the basic concepts, elements relationships, analysis principles, implementation processes and assessment methods, as well as implementation points and forms of work on risk assessment [26]. According to the information security risk management and the actual evaluation process specification and experts’ discussion, the 12 specific threat indexes system is finally obtained which is shown in Figure 1.

Figure 1 The system of threat indexes
Figure 1

The system of threat indexes

According to the 12 risk indexes selected in Figure 1, the paper converts it into a 1×12 dimensional line vector and extract all kinds of samples to participate in the validation in order. The dynamic equation of the information system can be found below:

x(k+1)=Ax(k)+v(k)y(k)=Cx1(k)x12(k)+v(k)(24)

Where A and C are the system state parameter matrices and they are full rank, this paper selects it as the unit matrix. Under normal circumstances, the track situation of former three threat index of the risk status is as shown in Figure 2. Figure 3 shows the track situation of former three threat index of the risk status when the system state is in risk.

Figure 2 State estimation situations (system is normal)
Figure 2

State estimation situations (system is normal)

Figure 3 State estimation situations (system is in risk)
Figure 3

State estimation situations (system is in risk)

In the normal operation of the system as in Figure 2, it can be showed that the true value of the system state agrees with the estimated value well. When the system is in danger, the state estimation from Figure 3 shows that the state estimation algorithm based on particle filter can track the change of system state very well. The risk level probability of the comprehensive assessment is calculated by formula (23), and Table 1 lists the probability from 74 to 83 moment. As shows Table 1, if the threat of hidden dangers remains, the system risk will change as time goes on. In this paper, the algorithm can track the dynamic change of the risk very well.

Table 1

Comprehensive evaluation probability on risk level

time74757677787980818283
x10.27590.27400.27340.27260.27110.27080.27050.27010.26980.2682
rp0.30400.40200.52200.67400.62400.84800.81800.97600.99801.0000

6 Conclusion

Considering the key threat analysis, this paper proposes an effective method of information security risk assessment based on particle filter combined with information security risk assessment process. Firstly, the paper uses particle filter algorithm to obtain the indexes of comprehensive influence weight according to the selected threat indicators, and at the same time uses the state estimation theory to track the dynamic change of information system risk. Finally, the impact of the weight of each index obtained and the state are used to take a comprehensive evaluation on the information system, to determine the probability of safety risk level.

Acknowledgements

The authors would like to acknowledge many helpful suggestions of the reviewers and the participants on earlier versions of this paper, and also thank authors mentioned in the references.

References

[1] Feng D.G., Zhang Y., Zhang Y.Q., Survey of information security risk assessment, Journal of China Institute of Communication, 2004, 7, 10-18.Suche in Google Scholar

[2] Chen X.Z., Zheng Q.H., Guan X.H., et al., Approach to security evaluation based on rough set theory for host computer, Journal of Xi’an Jiaotong University, 2004, 12, 1228-1231.Suche in Google Scholar

[3] Wang Z.Z., Jiang X., Wu X.Y., et al., Planning exploitation graph-bayesian networks model for information security risk frequency measurement, Acta Electronica Sinica, 2010, 2A, 18-22.Suche in Google Scholar

[4] Dang D.P., Meng Z., Assessment of information security risk by support vector machine, Journal of Huazhong University of Science and Technology(Natural Science Edition), 2010, 3, 46-49.Suche in Google Scholar

[5] Luo C.C., Chen W.J., A hybrid information security risk assessment procedure considering interdependences between controls, Expert System with Applications, 2012, 39, 247-257.10.1016/j.eswa.2011.07.015Suche in Google Scholar

[6] Wang Y.W., Chen H., Research of information security risk assessment method based on business process, Library and Information Service, 2011, 8, 62-66.Suche in Google Scholar

[7] Ryu H.R., Huber M., A particle filter approach for multitarget tracking, Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, CA, USA, 2007, 2753-2760.10.1109/IROS.2007.4399632Suche in Google Scholar

[8] Moon H., Chellappa R., 3D shape-encoded particle filter for object tracking and its application to human body tracking, EURASIP Journal on Image and Video Processing, 2008, 5, 1-16.10.1155/2008/596989Suche in Google Scholar

[9] Liu Y., Shen T., Wang X., Image restoration using gaussian particle filters, Proceedings of the 2007 International Conference on Computational Intelligence and Security, IEEE, Harbin, China, 2007, 391-394.10.1109/CIS.2007.17Suche in Google Scholar

[10] Canton-Ferrer C., Segura C., Casas J., Pardas M., Hernando J., Audio-visual head orientation estimation with particle filtering in multisensor scenarios, EURASIP Journal on Advances in Signal Processing, 2007, 6, 1-12.10.1155/2008/276846Suche in Google Scholar

[11] Caron F., Davy M., Duflos E., Vanheeghe P., Particle filtering for multisensor data fusion with switching observation models: application to land vehicle positioning, IEEE Transactions 5 on Signal Processing, 2007, 6, 2703-2719.10.1109/TSP.2007.893914Suche in Google Scholar

[12] Miller I., Campbell M., Particle filtering for map-aided localization in sparse GPS environments, Proceedings of the 2008 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, 2008, 1834-1841.10.1109/ROBOT.2008.4543474Suche in Google Scholar

[13] Hamerly G., Elkan C., Learning the k in k-means, Proceedings of the 17th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2003, 1-8.Suche in Google Scholar

[14] Pelleg D., Moore A., X-means: extending K-means with efficient estimation of the number of clusters, Proceedings of the 17th 15 International Conference on Machine Learning, Morgan Kaufmann, 2000, 727-734.Suche in Google Scholar

[15] Sun S.B., Zhao W.T., Qin K.Y., Wang Y.L., Research on data clustering algorithm based on rough sets, Computer Engineering and Applications, 2006, 22, 140-141.Suche in Google Scholar

[16] Liu J.Z., Xie W.X., Clustering analysis by genetic algorithms, Acta Electronica Sinica, 1995, 11, 81-83.10.1007/BF02274051Suche in Google Scholar

[17] Gao X.B., Pei J.H., Xie W.X., A study of weighting exponent m in a fuzzy c-means algorithm, Acta Electronica Sinica, 2000, 4, 1-4.Suche in Google Scholar

[18] Zhang Z., Zheng N., Shi G., Maximum entropy clustering algorithm and its global convergence, Science in China (series E), 2001, 1, 59-70.10.1007/BF02916729Suche in Google Scholar

[19] Zhang Y.N., Zhao R.C., Liang Y., An eflcient target recognition method for large scale data, Acta Electronica Sinica, 2002, 10, 1533-1535.Suche in Google Scholar

[20] Yang Z.H., Yang Y., Document clustering method based on hybrid of SOM and k-means, Application Research of Computers, 2006, 5, 73-79.Suche in Google Scholar

[21] Li Y.S., Yang S.L., Ma X.J., Hu X.X., Chen Z.M., Optimization study on k value of spatial clustering, Journal of System Simulation, 2006, 3, 573-576.Suche in Google Scholar

[22] Shi Y.P., Xin D.X., Analysis and application based on k-means clustering algorithm, Journal of Xi’An Technological University, 2006, 1, 45-48.Suche in Google Scholar

[23] Yuan F., Meng Z.H., Yu G., Improved k-means clustering algorithm, Computer Engineering and Applications, 2004, 36, 177-178.Suche in Google Scholar

[24] Sizhong Z., Lan X., Yang X., A sufficient condition for the existence of a k-factor excluding a given r-factor, Applied Mathematics and Nonlinear Sciences, 2017, 1, 13-20.10.21042/AMNS.2017.1.00002Suche in Google Scholar

[25] Brzeziński D.W., Accuracy problems of numerical calculation of fractional order derivatives and integrals applying the Riemann-Liouville/Caputo formulas, Applied Mathematics and Nonlinear Sciences, 2016, 1, 23-44.10.21042/AMNS.2016.1.00003Suche in Google Scholar

[26] State Bureau of Technical Supervision of the People’s Republic of China, GB/T 20984-2007, Information security technology risk assessment specification for information security, Standards Press of China, Beijing, 2007.Suche in Google Scholar

Received: 2016-11-24
Accepted: 2017-1-16
Published Online: 2017-5-4

© 2017 J. Cui et al.

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

Artikel in diesem Heft

  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
Heruntergeladen am 11.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/phys-2017-0026/html
Button zum nach oben scrollen