Showing 261 - 280 results of 378 for search '"Computational complexity theory', query time: 0.06s Refine Results
  1. 261

    Three-Dimensional Microwave Imaging for Concealed Weapon Detection Using Range Stacking Technique by Weixian Tan, Pingping Huang, Zengshu Huang, Yaolong Qi, Wenqin Wang

    Published 2017-01-01
    “…In this paper, from an alternative viewpoint, we propose a novel interpolation-free imaging algorithm based on wavefront reconstruction theory. The algorithm is an extension of the 2D range stacking algorithm (RSA) with the advantages of low computational cost and high precision. …”
    Get full text
    Article
  2. 262

    Blockchain sharding storage scheme based on concatenated coding by TIAN Youliang, HUANG Yuqing, WANG Shuai

    Published 2024-07-01
    “…Existing research has reduced the storage overhead of blockchain based on erasure coding theory, but it brings high computational and communication spending during the decoding and recovery of blocks. …”
    Get full text
    Article
  3. 263

    Intratumor heterogeneity: models of malignancy emergence and evolution by R. A. Ivanov, S. A. Lashin

    Published 2023-12-01
    “…In this paper, we set out to describe the current approaches to address this evolutionary complexity and theories of its occurrence.…”
    Get full text
    Article
  4. 264

    Predictive channel scheduling algorithm between macro base station and micro base station group by Yinghai XIE, Ruohe YAO, Bin WU

    Published 2019-11-01
    “…A novel predictive channel scheduling algorithm was proposed for non-real-time traffic transmission between macro-base stations and micro-base stations in 5G ultra-cellular networks.First,based on the stochastic stationary process characteristics of wireless channels between stationary communication agents,a discrete channel state probability space was established for the scheduling process from the perspective of classical probability theory,and the event domain was segmented.Then,the efficient scheduling of multi-user,multi-non-real-time services was realized by probability numerical calculation of each event domain.The theoretical analysis and simulation results show that the algorithm has low computational complexity.Compared with other classical scheduling algorithms,the new algorithm can optimize traffic transmission in a longer time dimension,approximate the maximum signal-to-noise ratio algorithm in throughput performance,and increase system throughput by about 14% under heavy load.At the same time,the new algorithm is accurate.Quantitative computation achieves a self-adaption match between the expected traffic rate and the actual scheduling rate.…”
    Get full text
    Article
  5. 265

    Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression by Kai Lu, Shuyan Jiang, Yiming Zhao, Yongjie Lin, Yinhai Wang

    Published 2021-01-01
    “…The graphical progression method can obtain grand coordinated schemes with minimal computational complexity. However, there is no standardized solution for this method, and only a few related studies have been found thus far. …”
    Get full text
    Article
  6. 266

    Rapid Fluid Velocity Field Prediction in Microfluidic Mixers via Nine Grid Network Model by Qian Li, Yuwei Chen, Taotao Sun, Junchao Wang

    Published 2024-12-01
    “…Traditionally, the simulation of these mixers relies on the finite element method (FEM), which, although effective, presents challenges due to its computational complexity and time-consuming nature. To address this, we propose a nine-grid network (NGN) model theory with a centrally symmetric structure.The NGN uses a symmetric structure similar to a 3 × 3 grid to partition the fluid space to be predicted. …”
    Get full text
    Article
  7. 267

    A measure of the difference between test sets for generating controlled random tests by V. N. Yarmolik, V. V. Petrovskaya, I. Mrozek

    Published 2022-12-01
    “…The main attention is paid to binary test sets, when the task of calculating given difference metric is reduced to the classical assignment problem using the Hungarian algorithm. The computational complexity of the Hungarian algorithm is estimated by the relation O(n4). …”
    Get full text
    Article
  8. 268
  9. 269

    Dynamic analysis and comparison of the performance of linear and nonlinear controllers applied to a nonlinear non-interactive and interactive process by José M. Campos-Salazar, Pablo Lecaros, Rodrigo Sandoval-García

    Published 2024-09-01
    “…The LQR design employed optimal control theory, minimizing a quadratic cost function to derive the state feedback gain matrix, ensuring system stability by shifting the eigenvalues of the closed-loop system matrix into the left half of the complex plane. …”
    Get full text
    Article
  10. 270
  11. 271

    Deep learning models reveal the link between dynamic brain connectivity patterns and states of consciousness by Chloé Gomez, Lynn Uhrig, Vincent Frouin, Edouard Duchesnay, Béchir Jarraya, Antoine Grigis

    Published 2024-12-01
    “…We demonstrated the model’s efficiency in summarizing consciousness-specific information encoded in key inter-areal connections, as described in the global neuronal workspace theory of consciousness. The proposed framework advocates the possibility of developing an interpretable computational brain model of interest for disorders of consciousness, paving the way for a dynamic diagnostic support tool.…”
    Get full text
    Article
  12. 272

    TIE‐GCM ROPE ‐ Dimensionality Reduction: Part I by Piyush M. Mehta, Richard J. Licata

    Published 2025-01-01
    “…Abstract Physics‐based models of the ionosphere‐thermosphere system have been touted as the next big thing in the context of drag modeling and space operations for decades. However, the computational complexity of such models have primarily kept them being used operationally. …”
    Get full text
    Article
  13. 273

    The Principle of Mathematical Induction: Applications in Physical Optics by Joseph Ivin Thomas

    Published 2022-01-01
    “…In theoretical computer science, it bears the pivotal role of developing the appropriate cognitive skills necessary for the effective design and implementation of algorithms, assessing for both their correctness and complexity. …”
    Get full text
    Article
  14. 274

    Some Aspects of Sensitivity Analysis in Variational Data Assimilation for Coupled Dynamical Systems by Sergei Soldatenko, Peter Steinle, Chris Tingwell, Denis Chichkine

    Published 2015-01-01
    “…However, the exploration of VDA requires considerable computational resources. For simple enough low-order models, the computational cost is minor and therefore models of this class are used as simple test instruments to emulate more complex systems. …”
    Get full text
    Article
  15. 275

    Survey of code-based digital signatures by Yongcheng SONG, Xinyi HUANG, Wei WU, Haixia CHEN

    Published 2021-08-01
    “…The rapid development of quantum computing theory and practice brings great uncertainty to the security of cryptography based on hard problems in number theory.Code-based hard problem is recognized as NP-complete problem, the complexity increases exponentially, and there is currently no threat of quantum computing to code-based cryptographic algorithm.Therefore, code-based algorithm can resist the quantum algorithm attack, which is one of the main directions of quantum-resistant cryptography.It is still an open problem to design secure and efficient code-based signatures.For many years, international researchers use classical and new methods to construct code-based signatures, but existing constructions are weak in security or poor in performance.Code-based signatures were comprehensively summarized and analyzed, and future research directions were indicated.…”
    Get full text
    Article
  16. 276

    Adaptive Hierarchical Collocation Method for Solving Fractional Population Diffusion Model by Linqiang Yang, Yafei Liu, Hongmei Ma, Xue Liu, Shuli Mei

    Published 2023-01-01
    “…This paper presents an adaptive hierarchical collocation method for solving this model, enhancing the efficiency of algorithms based on Low-Complexity Shannon-Cosine wavelet derived from combinatorial identity theory. …”
    Get full text
    Article
  17. 277

    Multi-threshold algorithm about image segmentation based on polynomial uniform approximation by Yan-jun WEI, Bo-qin FENG, Wei-guo WU

    Published 2016-10-01
    “…Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using Bernstein polynomial to uniformly approximate histogram curve.First,according to the approximation theory of Weierstrass to construct Bernstein polynomial for the histogram curve,then more difficult peak value calculating of the histogram was reduced to the Bernstein polynomial extremal generating,that was exported easily by the first and second derivative of Bernstein polynomial function,and finally obtain the actual peak value of the image histogram by picking up these extremes and polar values and filtering through classification algorithm,and finish multi-threshold image segmentation.Experimental results show that the algorithm is insensitive for histogram glitch interference,the overall is stable,the redundant computation and time complexity are smaller,with less time and high efficiency,the approximate performance and segmentation effect are better.…”
    Get full text
    Article
  18. 278

    Trust evaluation algorithm of IoT edge server based on cooperation reputation and device feedback by Lin ZHANG, Xinyan WEI, Xiping LIU, Haiping HUANG, Ruchuan WANG

    Published 2022-02-01
    “…Aiming at the security problem of edge server, a trust evaluation algorithm was proposed, which integrated server cooperation reputation and device user feedback to improve the security of edge computing context.In the process of interaction, a fusion algorithm based on objective information entropy theory was used to aggregate the cooperation reputation between servers, and a partial homomorphic encryption algorithm was used to prevent the leakage of user data in the process of interaction.After the interaction, the highly trusted device node was selected to calculate the feedback trust, which overcame the malicious feedback of the traditional mechanism.When calculating the global trust, the expected score of the server and the adaptive weight calculation method were considered, which overcame the limitations of the traditional trust scheme.The experimental results show that the proposed trust calculation scheme has low time complexity and spatial complexity, and can effectively resist the attack of malicious nodes.…”
    Get full text
    Article
  19. 279
  20. 280

    A Lightweight CNN-Transformer Implemented via Structural Re-Parameterization and Hybrid Attention for Remote Sensing Image Super-Resolution by Jie Wang, Hongwei Li, Yifan Li, Zilong Qin

    Published 2024-12-01
    “…The proposed approach achieves SR reconstruction for remote sensing images with fewer parameters and less computational overhead than those of traditional transformers and high-performance CNN models. …”
    Get full text
    Article