检索结果-内蒙古大学图书馆

EVALUATION OF THE PRONUNCIATION OF TAJWEED RULES BASED ON DNN AS A STEP TOWARDS INTERACTIVE RECITATION LEARNING

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Shaiakhmetov, Dim Gimaletdinova, Gulnaz Cankurt, Selcuk Momunov, Kadyrmamat Department of Computer Science Ala-Too International University Bishkek Kyrgyzstan Department of Applied Math Ala-Too International University Bishkek Kyrgyzstan Department of Computer Engineering Vistula University Warsaw Poland Department of Engineering and Natural Sciences Suleyman Demirel University Almaty Kazakhstan

Proper recitation of the Quran, adhering to the rules of Tajweed, is crucial for preventing mistakes during recitation and requires significant effort to master. Traditional methods of teaching these rules are limited by the availability of qualified instructors and time constraints. Automatic evaluation of recitation can address these challenges by providing prompt feedback and supporting independent practice. This study focuses on developing a deep learning model to classify three Tajweed rules—separate stretching (Al Mad), tight noon (Ghunnah), and hide (Ikhfaa)—using the publicly available QDAT dataset, which contains over 1,500 audio recordings. The input data consisted of audio recordings from this dataset, transformed into normalized mel-spectrograms. For classification, the EfficientNet-B0 architecture was used, enhanced with a Squeeze-and-Excitation attention mechanism. The developed model achieved accuracy rates of 95.35%, 99.34%, and 97.01% for the respective rules. An analysis of the learning curves confirmed the model’s robustness and absence of overfitting. The proposed approach demonstrates high efficiency and paves the way for developing interactive educational systems for Tajweed study. Copyright © 2025, The Authors. All rights reserved.

关键词： Transfer learning

Reliable Extrapolation of Deep Neural Operators Informed by Physics or Sparse Observations

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Zhu, Min Zhang, Handi Jiao, Anran Karniadakis, George Em Lu, Lu Department of Chemical and Biomolecular Engineering University of Pennsylvania PhiladelphiaPA19104 United States Graduate Group in Applied Mathematics and Computational Science University of Pennsylvania PhiladelphiaPA19104 United States Department of Computer and Information Science University of Pennsylvania PhiladelphiaPA19104 United States Division of Applied Mathematics Brown University ProvidenceRI02912 United States School of Engineering Brown University ProvidenceRI02912 United States

Deep neural operators can learn nonlinear mappings between infinite-dimensional function spaces via deep neural networks. As promising surrogate solvers of partial differential equations (PDEs) for real-time prediction, deep neural operators such as deep operator networks (DeepONets) provide a new simulation paradigm in science and engineering. Pure data-driven neural operators and deep learning models, in general, are usually limited to interpolation scenarios, where new predictions utilize inputs within the support of the training set. However, in the inference stage of real-world applications, the input may lie outside the support, i.e., extrapolation is required, which may result to large errors and unavoidable failure of deep learning models. Here, we address this challenge of extrapolation for deep neural operators. First, we systematically investigate the extrapolation behavior of DeepONets by quantifying the extrapolation complexity via the 2-Wasserstein distance between two function spaces and propose a new strategy of bias-variance trade-off for extrapolation with respect to model capacity. Subsequently, we develop a complete workflow, including extrapolation determination, and we propose five reliable learning methods that guarantee a safe prediction under extrapolation by requiring additional information-the governing PDEs of the system or sparse new observations. The proposed methods are based on either fine-tuning a pre-trained DeepONet or multifidelity learning. We demonstrate the effectiveness of the proposed framework for various types of parametric PDEs. Our systematic comparisons provide practical guidelines for selecting a proper extrapolation method depending on the available information, desired accuracy, and required inference speed. © 2023, The Authors. All rights reserved.

关键词： Extrapolation

Architectures for Heterogeneous Quantum Error Correction Codes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Stein, Samuel Xu, Shifan Cross, Andrew W. Yoder, Theodore J. Javadi-Abhari, Ali Liu, Chenxu Liu, Kun Zhou, Zeyuan Guinn, Charles Ding, Yufei Ding, Yongshan Li, Ang Pacific Northwest National Laboratory RichlandWA United States Departments of Applied Physics Yale University New HavenCT United States Yale Quantum Institute Yale University New HavenCT United States Department of Computer Science Yale University New HavenCT United States IBM Quantum IBM T. J. Watson Research Center Yorktown HeightsNY United States Department of Physics Princeton University PrincetonNJ United States Department of Computer Science & Engineering University of Califronia San Diego San DiegoCA United States Department of Electrical & Computer Engineering University of Washington WashingtonWA United States

Quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is becoming increasingly evident that there are significant advantages to designing architectures using multiple codes. Heterogeneous architectures provide a clear path to universal logical computation as well as the ability to access different resource trade offs. To address this, we propose integrating the surface code and gross code using an ancilla bus for inter-code data movement. This approach involves managing trade-offs, including qubit overhead, a constrained instruction set, and gross code (memory) routing and management. While our focus is on the gross-surface code architecture, our method is adaptable to any code combination and the constraints generated by that specific architecture. Motivated by the potential reduction of physical qubit overhead, an ever important feature in the realization of fault tolerant computation, we perform the first full system study of heterogeneous error-correcting codes, discovering architectural trade-offs and optimizing around them. We demonstrate physical qubit reductions of up to 6.42× when executing an algorithm to a specific logical error rate, at the cost of up to a 3.43× increase in execution time. Copyright © 2024, The Authors. All rights reserved.

关键词： Qubits

Network Traffic Co-Movement Assessment via Oriented Basis Signal Processing and Ensemble Decision Trees

学校读者我要写书评

暂无评论

Network Traffic Co-Movement Assessment via Oriented Basis Si...

International Conference on Intelligent Transportation

作者： Mohammad Reza Mohebbi Mohammad Javad Hassan Zada Majid Rostami-Shahrbabaki Mario Döller Iuliia Yamnenko Josef Ressel Center Vision2Move project University of Applied Sciences Kufstein Tirol Austria Department of Computer Science University of Passau Germany Chair of Traffic Engineering and Control Technical University of Munich Germany Department of Electronic Devices and Systems National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” Kyiv Ukraine

ISBN: (数字)9798331505929

ISBN: (纸本)9798331505936

Accurate short-term network-wide traffic prediction is essential to guarantee high service quality in urban traffic control systems. Nevertheless, traffic state time series represent network-scale spatiotemporal co-movement patterns and location-specific features. Therefore, hybrid statistical machine learning (ml) algorithms could be utilized to accommodate the aforementioned characteristics. In this paper, a hybrid random forest (rf) and extreme gradient boosting tree (XGBoost) model is introduced for network-wide traffic prediction. Moreover, a multi-noise oriented basis wavelet transform (OBT) filter is employed to pre-process the original time series, and improve the predictive accuracy. The RF model captures the traffic co-movements and the XGBoost extracts the local information. Comparative analysis of the hybrid algorithm and deep learning-based benchmarks indicate better performance of the proposed methodology in hourly traffic state prediction of 30 loop detectors, located in the paris city center. Hence, the hybrid decision-tree-based mechanism is a useful framework for real-time network traffic forecasting offering fewer trainable (hyper-)parameters, and thus, lower computational cost.

关键词： Wavelet transforms Radio frequency Accuracy Machine learning algorithms Urban areas Signal processing algorithms Detectors Prediction algorithms Decision trees Random forests

Extremal Chemical Graphs for the Arithmetic-Geometric Index

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hertz, Alain Bonte, Sébastien Devillez, Gauvain Dusollier, Valentin Mélot, Hadrien Schindl, David Department of Mathematics and Industrial Engineering Polytechnique Montréal - Gerad Montréal Canada Computer Science Department - Algorithms Lab University of Mons Mons Belgium Faculty of Mathematics and Physics University of Ljubljana Ljubljana Slovenia Haute école de gestion de Genève University of Applied Sciences Western Switzerland Genève Switzerland

The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the connected chemical graphs that reach the bound. We also prove that the removal of the constraint that extremal chemical graphs must be connected does not allow to increase the upper bound. © 2024, CC BY.

关键词： Graphic methods

A computer-aided feature-based encryption model with concealed access structure for medical Internet of Things

学校读者我要写书评

暂无评论

Decision Analytics Journal 2023年 7卷

作者： Vaidya, Sumit Suri, Ashish Batla, Vishnu Keshta, Ismail Ajibade, Samuel-Soma M. Safarov, Giyosiddin Department of Electronics and Communication Engineering Medicaps University AB Road Pigdambar Rau Madhya Pradesh Indore 453331 India School of Electronics and Communication Engineering Shri Mata Vaishno Devi University Katra India Computer Science and Engineering Department Motilal Nehru National Institute of Technology Allahabad (MNNIT Allahabad) Uttar Pradesh Prayagraj India Computer Science and Information Systems Department College of Applied Sciences AlMaarefa University Riyadh Saudi Arabia Department of Computer Engineering Istanbul Ticaret University Istanbul Turkey Tashkent Institute of Finance Tashkent Uzbekistan

One of the Internet of Things (IoT) security issues is the secure sharing and granular management of data access. This study recommends a feature-based encryption scheme with a hidden access structure for medical IoT data security. While establishing fine-grained access control of ciphertext data, the system can guarantee clinical client data privacy. First, it is recommended to convert identity-based encryption (IBE) into a feature-based encryption model (FBEM) using a universal conversion technique that supports multi-valued attributes and gates. IBE characteristics could be inherited by the converted FBEM. The conversion method is then used to change the receiver anonymous IBE scheme into the FBEM scheme with concealed access structure. The FBEM model is then used to construct the IoT scenario for the smart medical application. Theoretical analysis and experimental findings reveal that the suggested system provides advantages over prominent systems regarding computing efficiency, storage load, and security when the access structure is disguised. © 2023 The Author(s)

关键词： Clinical consumer Data privacy Feature-based encryption model Internet of Things (IoT) Smart healthcare

FedMonitor: An Implementation Architecture for Monitoring of Resources and Events'Notifications on Federated Cloud Computing Infrastructures

学校读者我要写书评

暂无评论

FedMonitor: An Implementation Architecture for Monitoring of...

International Conference on Emerging Trends in Networks and computer Communications (ETNCC)

作者： Emmanuel Adetiba Uche Nnaji John S. Wejin Festus Ojesanmi Matthew B. Akanle Priscilla O. Ajayi Faith O. Sweetwiliams Surendra C. Thakur Ezekiel F. Adebiyi Department of Electrical and Information Engineering and Covenant Applied Informatics & Communication African Center of Excellene(CApIC-ACE) Covenant University Ota Nigeria HRA Institute for Systems Science Durban University of Technology Durban South Africa Department of Computer and Information Science & CApIC-ACE Covenant University Ota Nigeria Department of Electrical and Information Engineering & CApIC-ACE Covenant University Jalingo Nigeria Department of Computer Science Tareba State University Jalingo Nigeria Covenant Applied Informatics & Communication African Center of Excellene(CApIC-ACE) Covenant University Ota Nigeria Department of Electrical and Information Engineering Covenant University & CApIC-ACE Covenant University Ota Nigeria Center for Systems and Information Services & CApIC-ACE Covenant University Ota Nigeria Department of Information Technology and KZN e-Skills Co-Laboratory Durban University of Technology Durban South Africa Covenant University Bioinformatics Research (CUBRe) Covenant University Ota Ogun State Nigeria African Center of Excellence in Bioinformatics & Data Intensive Science Makerere University Kampala Uganda

ISBN: (数字)9798350353266

ISBN: (纸本)9798350353273

In the evolving landscape of cloud computing, federated cloud infrastructures present unique challenges and opportunities for resource and application monitoring. Monitoring the diverse array of cloud resources and applications within a federated cloud environment is crucial for delivering consistent Quality of Service (QoS) and continuous oversight across various cloud applications and infrastructure. Despite the various successes documented in the literature on multi-cloud monitoring, existing frameworks have not fully explored or provided enough insights into centralized monitoring of resources, applications, and network devices in a federated cloud environment. This paper introduces FedMonitor, an implementation architecture designed to enhance the monitoring and notification capabilities in federated cloud environments by building on the theoretical ideals in our earlier work (i.e. FEDARGOS-V1). FedMonitor leverages Prometheus and Grafana to crawl, manage and visualize metrics from diverse software services, hardware resources, and network devices within a federated cloud environment. The results demonstrate hat FedMonitor improves the effectiveness of resource and application monitoring in federated cloud environments.

关键词： Measurement Cloud computing Visualization computer architecture Quality of service Production Software Real-time systems Stakeholders Monitoring

The Adaptive Spectral Koopman Method for Dynamical Systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Bian Ma, Yi-An Kutz, J. Nathan Yang, Xiu Department of Industrial and Systems Engineering Lehigh University BethlehemPA United States Halicioğlu Data Science Institute Department of Computer Science and Engineering University of California San Diego San DiegoCA United States Department of Applied Mathematics University of Washington SeattleWA United States

Dynamical systems have a wide range of applications in mechanics, electrical engineering, chemistry, and so on. In this work, we propose the adaptive spectral Koopman (ASK) method to solve nonlinear autonomous dynamical systems. This novel numerical method leverages the spectral-collocation (i.e., pseudo-spectral) method and properties of the Koopman operator to obtain the solution of a dynamical system. Specifically, this solution is represented as a linear combination of the multiplication of Koopman operator’s eigenfunctions and eigenvalues, and these eigenpairs are approximated by the spectral method. Unlike conventional time evolution algorithms such as Euler’s scheme and the Runge-Kutta scheme, ASK is mesh-free, and hence is more flexible when evaluating the solution. Numerical experiments demonstrate high accuracy of ASK for solving one-, two- and three-dimensional dynamical *** Codes 37L65 (primary) 65L60 (secondary) © 2022, CC BY.

关键词： Dynamical systems

A Review of Algorithms’s Complexities on Different Valued Sorted and Unsorted Data

学校读者我要写书评

暂无评论

A Review of Algorithms’s Complexities on Different Valued S...

IT and Industrial Technologies (ICIT), International Conference on

作者： Attia Shabbir Asad Majeed Mahnoor Iftikhar Raja Hashim Ali Usama Arshad Muhammad Zeeshan Shabbir Ali Zeeshan Ijaz Nisar Ali Ali Aftab Faculty of Computer Science & Engineering GIK Institute of Engg. Sciences & Technology Topi Pakistan Dept. of Technology & Software Engineering University of Europe for Applied Sciences Berlin Germany Department of Electrical Engineering University of Engineering & Technology (UET) Lahore Pakistan Faculty of Electronic Systems Engineering University of Regina Regina Canada

Sorting and searching are critical processes for effecttive data analysis. In this paper, we evaluate the performance of various sorting and searching algorithms and compare their time and space complexities on both sorted and unsorted data. The algorithms we analyzed include six common sorting algorithms (insertion, radix, bucket, merge, bubble, and quick sort) and three search algorithms (linear, binary, and jump search). The results of our study provide insights into the best algorithms to use for different input sizes and types of data. It was found that for small input sizes, all algorithms perform similarly, but for larger input sizes, insertion and radix sorts are better for time complexity while bubble sort is better for space complexity. Additionally, jump search outperformed linear and binary search algorithms in both time and space complexity. Besides, difference between time and space complexity of sorted and unsorted data was significant.

关键词：