Showing 301 - 320 results of 645 for search '"Computational complexity theory', query time: 0.09s Refine Results
  1. 301

    On Modeling Agent Behavior Change Through Multi-Typed Information Diffusion in Online Social Networks by Masaaki Miyashita, Norihiko Shinomiya, Daisuke Kasamatsu, Genya Ishigaki

    Published 2025-01-01
    “…Therefore, this study introduces a computational model that combines subjective logic to represent opinion changes of individuals using multi-typed information and cumulative prospect theory to simulate individuals’ decision-making. …”
    Get full text
    Article
  2. 302

    Physical-layer security transmission method based on spatial modulation with finite alphabet inputs by Bo CUI, Lu LIU, Xiang-yu LI, Liang JIN

    Published 2015-02-01
    “…Addressing the problem of wireless physical layer security transmission for finite alphabet input systems,a spatial modulation secure transmission method is proposed.On the basis of information theory,the method utilizes the receive antenna indices of multiple-input multiple-output (MIMO) system to bear information,and randomizes the eavesdropper’s equivalent channel by switching the receive antennas,which can guarantee physical layer security transmission.First,the different receiving performances of the legitimate user and eavesdropper are analyzed in the spatial modulation secure transmission system.Second,the mutual information and secrecy mutual information of the transmission system are calculated,and two sufficient conditions that ensure positive secrecy mutual information are pointed out.Finally,an estimation algorithm of mutual information is provided.Moreover,the symmetry of finite alphabet set is exploited to decrease the computational complexity.Theoretical analysis and numerical simulation results verify the availability of the security transmission method.…”
    Get full text
    Article
  3. 303
  4. 304
  5. 305

    CFD for turbulence: from fundamentals to geophysics and astrophysics by Cambon, Claude, Alvarez Laguna, Alejandro, Zhou, Ye

    Published 2022-12-01
    “…In this paper, we review the role of CFD in the study of turbulence through both direct numerical simulations and the resolution of statistical multi-scale theories. With a historical perspective, we will discuss the evolution of the numerical modeling of turbulence from the first numerical experiments as proposed by Orszag and Patterson [1] to complex geophysical and plasma simulations where body forces such as Coriolis, the buoyancy force, or the Lorentz force can introduce strong anisotropies. …”
    Get full text
    Article
  6. 306

    Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field by Jinwang Liu, Dongmei Li, Licui Zheng

    Published 2018-01-01
    “…Two tractable criterions are presented for the existence of minor prime factorization, which can be realized by programming and complexity computations. On the theory and application, we shall obtain some new and interesting results, giving some constructive computational methods for carrying out the minor prime factorization.…”
    Get full text
    Article
  7. 307

    Adaptive Differentiator-Based Predefined-Time Control for Nonlinear Systems Subject to Pure-Feedback Form and Unknown Disturbance by Man Yang, Qiang Zhang, Ke Xu, Ming Chen

    Published 2021-01-01
    “…An adaptive predefined-time controller is designed by introducing the finite-time differentiator which is used to decrease the computational complexity problem appeared in the traditional backstepping control. …”
    Get full text
    Article
  8. 308
  9. 309
  10. 310

    A Flexible Polynomial Expansion Method for Response Analysis with Random Parameters by Rugao Gao, Keping Zhou, Yun Lin

    Published 2018-01-01
    “…The generalized Polynomial Chaos Expansion Method (gPCEM), which is a random uncertainty analysis method by employing the orthogonal polynomial bases from the Askey scheme to represent the random space, has been widely used in engineering applications due to its good performance in both computational efficiency and accuracy. But in gPCEM, a nonlinear transformation of random variables should always be used to adapt the generalized Polynomial Chaos theory for the analysis of random problems with complicated probability distributions, which may introduce nonlinearity in the procedure of random uncertainty propagation as well as leading to approximation errors on the probability distribution function (PDF) of random variables. …”
    Get full text
    Article
  11. 311
  12. 312
  13. 313
  14. 314
  15. 315
  16. 316
  17. 317
  18. 318
  19. 319
  20. 320

    Twin Subgraphs and Core-Semiperiphery-Periphery Structures by Ricardo Riaza

    Published 2018-01-01
    “…A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. …”
    Get full text
    Article