Showing 21 - 40 results of 107 for search '"complexity analysis"', query time: 0.09s Refine Results
  1. 21
  2. 22
  3. 23
  4. 24
  5. 25

    Comparison of Flow Solutions for Naturally Fractured Reservoirs Using Complex Analysis Methods (CAM) and Embedded Discrete Fracture Models (EDFM): Fundamental Design Differences and Improved Scaling Method by Aaditya Khanal, Ruud Weijermars

    Published 2020-01-01
    “…The present study compares flow paths in reservoirs with natural fractures, solved with Complex Analysis Methods (CAM), to those solved with Embedded Discrete Fracture Models (EDFM). …”
    Get full text
    Article
  6. 26
  7. 27
  8. 28

    A course in Mathematical Analysis / by Garling, D. J. H.

    Published 2013
    Table of Contents: “…Foundations and elementary real analysis -- v. 3. Complex analysis, measure and integration…”
    Cover image
    View in OPAC
    Book
  9. 29

    A course in mathematical analysis / by Garling, D. J. H.

    Published 2013
    Table of Contents: “…Foundations and elementary real analysis -- v. 3. Complex analysis, measure and integration…”
    View in OPAC
    Book
  10. 30

    A Multiscale Symbolic Dynamic Entropy Analysis of Traffic Flow by Zhanyou Cui, Gaoli Chen, Bing Liu, Deguang Li

    Published 2022-01-01
    “…The complexity analysis of traffic flow is important for understanding the property of traffic system. …”
    Get full text
    Article
  11. 31

    On The Modelling Of Complex Sociopsychological Systems With Some Reasoning About Kate, Jules, And Jim

    Published 2006-01-01
    “…A first approach to complexity analysis is proposed referring to both computational and modelling aspects.…”
    Get full text
    Article
  12. 32

    ID-based transitive signature schemes without random oracle by MA Xiao-long1, GU Li-ze1, CUI Wei4, YANG Yi-xian1, HU Zheng-ming1

    Published 2010-01-01
    “…Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s transitivity of the proposed scheme was reduced to the CDH assumption based on the bilinear pairing.A complexity analysis of the proposed scheme was thereafter presented.…”
    Get full text
    Article
  13. 33

    Turbo detection-decoding method for bit-interleavered random layered space-time codes by LI Xiao-wei, CHEN Fang-jiong, WEI Gang

    Published 2006-01-01
    “…Based on one kind of layered space-time code which used bit-interleavered and random-layered model,a joint detection-decoding method based on the Turbo principle was proposed.The new method used soft-interference canceller and SISO decoder and improved the exchange of soft information between them.By iterative procession it improved the performance of the whole system.The potential practice capability is proved by simulation results and computational complexity analysis.…”
    Get full text
    Article
  14. 34

    On the modelling of complex sociopsychological systems with some reasoning about Kate, Jules, and Jim by Nicola Bellomo, Bruno Carbonaro

    Published 2006-01-01
    “…A first approach to complexity analysis is proposed referring to both computational and modelling aspects.…”
    Get full text
    Article
  15. 35

    Analysis of the Perfect Table Fuzzy Rainbow Tradeoff by Byoung-Il Kim, Jin Hong

    Published 2014-01-01
    “…This work provides an accurate complexity analysis of the perfect table fuzzy rainbow tradeoff algorithm. …”
    Get full text
    Article
  16. 36

    Low-complexity variable step-size sign algorithm based on Weibull distribution function by Rui ZHANG, Guchen SHI, Banteng LIU, Yourong CHEN

    Published 2018-09-01
    “…The performance of the traditional second-order statistics based channel estimation methods degrade seriously in the presence of impulsive noises.In order to deal with this problem,a Weibull distribution function based variable step-size sign algorithm for channel estimation under impulsive noises was proposed.The proposed method was robust against impulsive noises and it could improve the convergence speed of the sign algorithm with the Weibull distribution function based variable step-size method.Computational complexity analysis and simulation results demonstrate that the proposed algorithm can achieve the same steady-state estimation error with faster convergence speed and lower computational complexity.…”
    Get full text
    Article
  17. 37

    Multiplierless discrete Fourier transform based on moments by LIU Zhen-bing, LIU Jian-guo, WANG Guo-you

    Published 2009-01-01
    “…A novel algorithm to perform Discrete Fourier Transform(DFT) multiplierlessly was proposed.First, by modular mapping and truncating Taylor series expansion, the DFT was expressed in the form of the product of the constants and discrete moments.Second, by performing appropriate bit operations and shift operations in binary system, the product could be transformed to some additions of integers.The proposed algorithm only involved integer additions and shifts because the discrete moments could be computed only by integer additions.The systolic VLSI was designed to perform the new algorithm, followed by complexity analysis.Compared with the state-of-the-art systolic structure, the proposed design was multiplierless and easier to implement with less hardware and time.The approach was also applicable to other discrete transforms.…”
    Get full text
    Article
  18. 38

    Optimizing low complexity encoding method for systematic polar code by Linhua MA, Shiping LIU, Xing HU, Tianyu HUANG, Bin XU

    Published 2018-07-01
    “…In order to solve the delay caused by step-by-step calculation and the computational complexity caused by iterative “exclusive-or” computation during the encoding process,a dimensionality reduction strategy was proposed and defined.Based on this,system polarization code parallel coding algorithm for cracking strategy was proposed.Simulation and computational complexity analysis were carried out on AWGN channel.The results show that the coding gain of the above algorithm is slightly better than the traditional one or almost the same,but the computational complexity is up to 80.92%,which is more suitable for hardware implementation and engineering application.It is more suitable for hardware implementation and has a certain practical value.…”
    Get full text
    Article
  19. 39

    Blockchain-based result-traceable searchable encryption scheme by Xinyao WENG, Lin YOU, Tingting LAN

    Published 2019-09-01
    “…In a searchable encryption scheme,whether it is a cloud server or a user,it may be deceptive.In order to solve the security problem,the definition of fairness security was given and a new searchable encryption scheme based on blockchain was proposed.Through the third-party trusted authority to verify the consistency of data during data transmission,the complete verification results were recorded on the blockchain to prevent tampering,and it could make all the related entities to reach the consistent security consensus and achieve the fairness security.The security and complexity analysis show that the proposed searchable encryption scheme was feasible.If it is combined with a searchable encryption scheme with its searched results verifiable,the proposed scheme can be effectively improved to be a blockchain-based searchable encryption scheme with its searched results verifiable and its security will be more strengthened.…”
    Get full text
    Article
  20. 40

    Optimization design and simplified decoding for short frame CCPM by Xiao-jie DAI, Ya-feng ZHAN

    Published 2013-05-01
    “…Considering the demand of burst communications,optimization and simplified decoding for coded GMSK sys-tem in short frame was focused on to give an optimum proposal of C<sup>2</sup>PPM system.Simplified demodulator,optimized generation polynomial of the convolution code and matched interleavers were discussed.Simulation results show that for coded GMSK system under AWGN,the performance is better than individual convolution code.Especially when BER is 1×10<sup>-5</sup>,it performs better than Turbo code and LDPC code with the same frame length,and there is no error floor occur-ring.Finally,complexity analysis shows that the coded GMSK system has lower implementation complexity in compari-son with the commonly used convolution code,Turbo code and LDPC code.…”
    Get full text
    Article