Showing 301 - 320 results of 641 for search '"matrix multiplication"', query time: 0.82s Refine Results
  1. 301

    PyIRTAM: A New Module of PyIRI for IRTAM Coefficients by Victoriya V. Forsythe, Ivan Galkin, Sarah E. McDonald, Kenneth F. Dymond, Bruce A. Fritz, Angeline G. Burrell, Katherine A. Zawdie, Douglas P. Drob

    Published 2024-12-01
    “…PyIRI introduced a novel approach to the computation of the global and diurnal functions and their matrix multiplication with Consultative Committee on International Radio (CCIR) coefficients or the International Union of Radio Science (URSI) coefficients, that enabled this global approach for the density specification. …”
    Get full text
    Article
  2. 302

    Loops software pipelining on ARM platform by Roman Zhuykov, Dmitry Melnik, Ruben Buchatskiy

    Published 2018-10-01
    “…For x86-64 platform, performance results are mostly neutral, with exception of 2-3% improvement on matrix multiplication tests.…”
    Get full text
    Article
  3. 303

    Modelling capability factors of logistics industry based on ISM-MICMAC by Mohammad Kamrul Hasan, Xunping Lei, Arbia Hlali, Zixiang Bian

    Published 2024-11-01
    “…To define the interrelationships and interdependencies among LCFs, expert-based interpretive structural modeling (ISM) combined with cross-impact matrix multiplication applied to classification (MICMAC) is used. …”
    Get full text
    Article
  4. 304

    Privacy-preserving Naive Bayes classification based on secure two-party computation by Kun Liu, Chunming Tang

    Published 2023-10-01
    “…The modular design allows embedding different secure matrix multiplication techniques, making the framework adaptable. …”
    Get full text
    Article
  5. 305

    Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm by Rui LIU, Yong LI

    Published 2023-10-01
    “…Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have become the main bottleneck for updating the check nodes.Therefore, a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme, the channel probability was modeled by the master node as a matrix and it was segmented, and those sub-matrices were encoded into redundant ones.Then, all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT, and the results were sent back to the master node for the final decoding.By embedding redundant information, the proposed scheme resolved the straggling problem, improving the efficiency, and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes, the proposed scheme provides lower encoding complexity, higher numerical accuracy in decoding recovery, and maintains an efficient butterfly operation, effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme, significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance.…”
    Get full text
    Article
  6. 306

    A Novel Efficient Secure and Error-Robust Scheme for Internet of Things Using Compressive Sensing by Gajraj Kuldeep, Qi Zhang

    Published 2021-01-01
    “…In this paper, we propose a novel lightweight efficient secure error-robust scheme, ENCRUST, which is able to achieve these three functions using simple matrix multiplication. ENCRUST is built on the new theoretical foundation of projection-based encoding presented in this paper, by leveraging the sparsity inherent in the signal. …”
    Get full text
    Article
  7. 307

    Analysis and structural characterization of the vid-pisco market by Chiang Vegas Marco Esteban, Lam Araoz Rodrigo, Fernando Ruiz-Ruiz Marcos

    Published 2024-07-01
    “…Using a methodology with a non-experimental qualitative approach of exploratory and descriptive scope, a structural analysis was carried out with the support of a group of five experts familiar with the system studied and the Cross Impact Matrix Multiplication Applied to a Classification tool. The findings allowed us to identify the most influential and dependent factors of the system: the number of people identified with the vid-pisco as a Peruvian symbol, the number of liters of pisco consumed per person, and the percentage of market growth per person per year. …”
    Get full text
    Article
  8. 308

    Research on Key Risk Factors and Risk Transmission Path of Procurement in International Engineering Procurement Construction Project by Qing’e Wang, Jing Wang

    Published 2022-04-01
    “…Integrated Interpretative Structural Modelling (ISM) and Cross-Impact Matrix Multiplication Applied to Classification (MICMAC) method was used to establish the interrelationships between risk factors. …”
    Get full text
    Article
  9. 309

    SensiMix: Sensitivity-Aware 8-bit index & 1-bit value mixed precision quantization for BERT compression. by Tairen Piao, Ikhyun Cho, U Kang

    Published 2022-01-01
    “…Moreover, for fast inference, we apply FP16 general matrix multiplication (GEMM) and XNOR-Count GEMM for 8-bit and 1-bit quantization parts of the model, respectively. …”
    Get full text
    Article
  10. 310

    HILLMAIL: A SECURE EMAIL SYSTEM FOR ANDROID-BASED MOBILE PHONE USING HILL CIPHER ALGORITHM by Tita Karlita, Isbat Uzzin Nadhori, Mohammad Azis Khoirul Fata

    Published 2016-07-01
    “…Hill Cipher is a classic cryptography algorithm that uses matrix inverse and matrix multiplication operations to hide the message. The initial stage of the encryption process is forming ciphertext by multiplying the key matrix with plaintext matrix. …”
    Get full text
    Article
  11. 311

    CYK Parsing over Distributed Representations by Fabio Massimo Zanzotto, Giorgio Satta, Giordano Cristini

    Published 2020-10-01
    “…To this end, we introduce a version of the traditional Cocke–Younger–Kasami (CYK) algorithm, called distributed (D)-CYK, which is entirely defined over distributed representations. D-CYK uses matrix multiplication on real number matrices of a size independent of the length of the input string. …”
    Get full text
    Article
  12. 312

    Learning a Hierarchical Global Attention for Image Classification by Kerang Cao, Jingyu Gao, Kwang-nam Choi, Lini Duan

    Published 2020-10-01
    “…Different from nonlocal-based methods, the hierarchical global attention mechanism requires no matrix multiplication and can be flexibly applied in various modern network designs. …”
    Get full text
    Article
  13. 313

    Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm by Rui LIU, Yong LI

    Published 2023-10-01
    “…Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have become the main bottleneck for updating the check nodes.Therefore, a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme, the channel probability was modeled by the master node as a matrix and it was segmented, and those sub-matrices were encoded into redundant ones.Then, all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT, and the results were sent back to the master node for the final decoding.By embedding redundant information, the proposed scheme resolved the straggling problem, improving the efficiency, and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes, the proposed scheme provides lower encoding complexity, higher numerical accuracy in decoding recovery, and maintains an efficient butterfly operation, effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme, significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance.…”
    Get full text
    Article
  14. 314

    Key Enablers for the Evolution of Aerospace Ecosystems by José Junior Luna Andrade, Konstantinos Salonitis, Alexandra Brintrup

    Published 2021-06-01
    “…To this extent, key enablers are first identified and then categorised using interpretive structural modelling (ISM) and cross-impact matrix multiplication applied to classification (MICMAC) methodologies. …”
    Get full text
    Article
  15. 315

    Analysis of Super-Gentrification Dynamic Factors Using Interpretative Structure Modeling by Jiangang Shi, Kaifeng Duan, Quanwei Xu, Jiajia Li

    Published 2020-02-01
    “…The Cross Impact Matrix Multiplication Applied to a Classification (MICMAC) analysis is also conducted to determine the dependence power and driving power of these dynamic factors. …”
    Get full text
    Article
  16. 316

    Investigating macro factors affecting the technological innovation system (TIS): A case study of Iran's photovoltaic TIS by Mohammad Esmailzadeh, Siamak Noori, Hamidreza Nouralizadeh, Marcel L.A.M. Bogers

    Published 2020-11-01
    “…We used cross-impact matrix multiplication applied to classification or MICMAC analysis to better understand the dependence power and driver power of those variables. …”
    Get full text
    Article
  17. 317

    Homomorphic Model Selection for Data Analysis in an Encrypted Domain by Mi Yeon Hong, Joon Soo Yoo, Ji Won Yoon

    Published 2020-09-01
    “…Since this process requires a matrix calculation, we constructed the matrix multiplication and inverse of the matrix based on the bitwise operation. …”
    Get full text
    Article
  18. 318

    Accelerating Flow-Based Sampling for Large-𝑁 Gauge Theories by Zhang, Michael S.

    Published 2024
    “…We introduce an original architecture based on SU(2) matrix multiplication that allows for efficient Jacobian computation. …”
    Get full text
    Thesis
  19. 319
  20. 320

    Automatic refactoring of Fortran applications by Chandrasehar Rajaseharan.

    Published 2012
    “…Most sequential algorithms like matrix multiplication where the complexity is O(n3) can affect the overall execution time of a program when their size increases. …”
    Get full text
    Final Year Project (FYP)