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

A Voice Assistive Mobile Application Tool to Detect Cardiovascular Disease Using Machine Learning Approach

Biomedical Materials and Devices 2024年第2期2卷 1246-1257页

作者： Uddin, Khandaker Mohammad Mohi Dey, Samrat Kumar Babu, Hafiz Md. Hasan Department of Computer Science and Engineering Southeast University School of Science and Technology Bangladesh Open University Department of Computer Science and Engineering University of Dhaka

Many people all around the world suffer from heart disease, which is regarded as a severe illness. In healthcare, especially cardiology, it is crucial to accurately and quickly diagnose cardiac problems. In this research, we proposed an accurate and efficient mobile application-based system for diagnosing cardiac disease based on machine learning approaches. The developed mobile application is voice assistive, which makes the proposed application more user-friendly. Numerous machine learning methods have been examined in this study to predict and diagnose cardiovascular disease (CVD). A detailed comparative study was also drawn using eighteen (18) classification algorithms such as Support Vector Machines, Logistic Regression, Linear SVC, K-Nearest Neighbors, Naive Bayes, Stochastic Gradient Descent, Gradient Boosting, Ridge, Bagging, Random Forest, Decision Tree, XGB, LGBM, Extra Trees Perceptron, and Voting Classifier (hard or soft voting). Sixty-eight thousand nine hundred seventy-five (68,975) samples from various patients were used to test the performance of each approach. According to the study, Random Forest and Decision Trees have the best accuracy levels at 99.9%. However, the Support Vector Machine classifier had the lowest performance, barely achieving 60% accuracy. © The Author(s), under exclusive licence to Springer science+Business Media, LLC 2024.

关键词： Cardiovascular heart disease Detection Healthcare informatics Machine learning Mobile application

来源：评论

学校读者我要写书评

暂无评论

JPEG Reversible Data Hiding via Block Sorting Optimization and Dynamic Iterative Histogram Modification

引用

IEEE Transactions on Multimedia 2025年 27卷 3729-3743页

作者： Li, Fengyong Wang, Qiankuan Cheng, Hang Zhang, Xinpeng Qin, Chuan Shanghai University of Electric Power College of Computer Science and Technology Shanghai201306 China Fuzhou University School of Mathematics and Statistics Fuzhou Fujian350108 China Fudan University School of Computer Science Shanghai200433 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China

JPEG reversible data hiding (RDH) refers to covert communication technology to accurately extract secret data while also perfectly recovering the original JPEG image. With the development of cloud services, a large number of private JPEG images can be efficiently managed in cloud platforms by embedding user ID or authentication labels. Nevertheless, data embedding operations may inadvertently disrupt the encoding sequence of the original JPEG image, resulting in severe distortion of the host image when it is re-compressed to JPEG format. To address this problem, this paper proposes a new JPEG RDH scheme based on block sorting optimization and dynamic iterative histogram modification. We firstly design a block ordering optimization strategy by combining the number of zero coefficients and the quantization table values of non-zero coefficients in a DCT block. Subsequently, a dynamic iterative histogram modification scheme is proposed by considering the local features and embedding capability of histograms generated from different texture images. According to the given payloads, we introduce different parameters to control the iterations of two-dimensional histogram and then adaptively generate the optimal histogram modification mapping, which can realize low JPEG file size increments by guaranteeing most of the AC coefficients unchanged as much as possible. Numerous experiments have shown that our scheme can achieve an effective balance among embedding capacity, visual quality, file size increment, computational complexity, and outperforms the state-of-the-arts in terms of the above metrics. © 1999-2012 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Automatic Transportation Mode Classification Using a Deep Reinforcement Learning Approach With Smartphone Sensors

引用

IEEE Access 2024年 12卷 514-533页

作者： Taherinavid, Siavash Moravvej, Seyed Vahid Chen, Yen-Lin Yang, Jing Ku, Chin Soon Yee, Por Lip Iran University of Science and Technology School of Civil Engineering Tehran13114-16846 Iran Isfahan University of Technology Department of Electrical and Computer Engineering Isfahan84156-83111 Iran National Taipei University of Technology Department of Computer Science and Information Engineering Taipei106344 Taiwan Universiti Malaya Faculty of Computer Science and Information Technology Department of Computer System and Technology Kuala Lumpur50603 Malaysia Universiti Tunku Abdul Rahman Department of Computer Science Kampar31900 Malaysia

The increasing dependence on smartphones with advanced sensors has highlighted the imperative of precise transportation mode classification, pivotal for domains like health monitoring and urban planning. This research is motivated by the pressing demand to enhance transportation mode classification, leveraging the potential of smartphone sensors, notably the accelerometer, magnetometer, and gyroscope. In response to this challenge, we present a novel automated classification model rooted in deep reinforcement learning. Our model stands out for its innovative approach of harnessing enhanced features through artificial neural networks (ANNs) and visualizing the classification task as a structured series of decision-making events. Our model adopts an improved differential evolution (DE) algorithm for initializing weights, coupled with a specialized agent-environment relationship. Every correct classification earns the agent a reward, with additional emphasis on the accurate categorization of less frequent modes through a distinct reward strategy. The Upper Confidence Bound (UCB) technique is used for action selection, promoting deep-seated knowledge, and minimizing reliance on chance. A notable innovation in our work is the introduction of a cluster-centric mutation operation within the DE algorithm. This operation strategically identifies optimal clusters in the current DE population and forges potential solutions using a pioneering update mechanism. When assessed on the extensive HTC dataset, which includes 8311 hours of data gathered from 224 participants over two years. Noteworthy results spotlight an accuracy of 0.88±0.03 and an F-measure of 0.87±0.02, underscoring the efficacy of our approach for large-scale transportation mode classification tasks. This work introduces an innovative strategy in the realm of transportation mode classification, emphasizing both precision and reliability, addressing the pressing need for enhanced classification mechanisms in an eve

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

VivID: A Visually Improved GIF Encoding Network Design

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年第6期35卷 6101-6113页

作者： Wang, Yifei Liu, Gaozhi Zhu, Zhiying Zhang, Xinpeng Qian, Zhenxing Fudan University Department of School of Computer Science Shanghai200433 China East China University of Science and Technology Department of China School of Information Science and Engineering Shanghai200237 China

Graphics Interchange Format (GIF) encoding is the art of reproducing an image with limited colors. Existing GIF encoding schemes often introduce unpleasant visual artifacts such as banding artifact, dotted-pattern noise and color shift, especially when the palette size is small. To address the issues above, we propose VivID, a Visually Improved GIF Encoding Network Design, which is compatible with exiting GIF decoders. VivID consists of three modules and two of them provide the functionality within the GIF encoding pipeline. Firstly, in order to reduce the color shift introduced by color quantization, we design the multi-palette extractor to create a GIF image with minimal distortion by extracting a near-optimal palette. This module can significantly improve the image fidelity and gains adaptability to multiple palette sizes after only one-time training. Furthermore, to reduce banding artifact and the dotted-pattern noise caused by dithering process, we propose banding remover which can randomize quantization error to neighbourhood by utilizing a learnable dithering pattern. Moreover, to further eliminate the banding artifacts, we design the banding scorer module, which is a novel metric for evaluating banding artifact and it correlates well with subjective perception. We adopt it as a customized loss for training dithering module. Extensive experiments across various aspects demonstrate that VivID produces visually pleasing results even when the palette size is extremely small, outperforming both traditional and existing learning based GIF encoding methods. © 1991-2012 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

FeBT: A Feature Balancing Transformer for Corporate ESG Forecasting

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 4063-4074页

作者： Li, Yawen Zhuang, Mengyu Ye, Guanhua Li, Yan Wang, Junheng Zhou, Jinyi Zhang, Pengfei Beijing University of Posts and Telecommunications School of Economics and Management Beijing China Beijing University of Posts and Telecommunications School of Computer Science National Pilot School of Software Engineering Beijing China University of Electronic Science and Technology of China School of Management and Economics Chengdu China University of Science and Technology Beijing School of Economics and Management Beijing China The University of Queensland School of Electrical Engineering and Computer Science Brisbane Australia

Environmental, social, and governance (ESG) serves as a crucial indicator for evaluating firms in terms of sustainable development. However, the existing ESG evaluation systems suffer from limitations, such as narrow coverage, subjective bias, and lack of timeliness. Therefore, there is a pressing need to leverage machine learning methods to predict the ESG performance of firms using their publicly available data. Traditional machine learning models encounter the feature imbalance problem due to the heterogeneity in ESG-related features. Common approaches typically involve unfolding all features, thereby granting highdimensional folding features greater exposure and accessibility to downstream models, which results in the neglect of lowdimensional features. To fill the research gap regarding fully using the heterogeneous features of enterprises to enhance AIbased ESG prediction performance, we propose the Feature Balancing Transformer (FeBT), a model based on autoencoders and Transformer blocks. FeBT incorporates a novel feature balancing technique that compresses and enhances high-dimensional features from imbalanced data into low-dimensional representations, thereby ensuring a more balanced impact of high-dimensional and low-dimensional features on the model's performance in the downstream ESG forecasting module. Extensive experiments verified the superior performance of FeBT compared with stateof-the-art methods in real-world ESG-related datasets and evidenced that our feature balancing module provides significant insights from high-dimensional folding features. © 1989-2012 IEEE.

关键词： Predictive Models Transformers Data Models Forecasting Accuracy Biological System Modeling Training Time Series Analysis Support Vector Machines Vectors ESG Forecasting Data Masking Time Series Forecasting Machine Learning Models Autoencoder High Dimensional Feature Transformer Block Time Series Support Vector Machine Time Series Data Linear Discriminant Analysis Air Quality Long Short Term Memory Recurrent Neural Network Attention Mechanism Final Prediction Transformer Model Word Embedding XG Boost Gated Recurrent Unit Linear Probe Air Quality Index Positional Encoding Multi Head Attention Mechanism Light GBM Traditional Transformation Compressed Representation Time Series Prediction Attention Heads Prediction Model K Nearest Neighbor Imbalance In Levels Latent Representation

来源：评论

学校读者我要写书评

暂无评论

Automatic emotion recognition using deep neural network

引用

Multimedia Tools and Applications 2025年 1-30页

作者： Sujatha, R. Chatterjee, Jyotir Moy Pathy, Baibhav Hu, Yu-Chen School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India Department of CSE Graphic Era University Dehradun India School of Electrical Engineering Vellore Institute of Technology Vellore India Department of Computer Science Tunghai University Taichung City Taiwan

Emotions are a vital semantic part of human correspondence. Emotions are significant for human correspondence as well as basic for human–computer cooperation. Viable correspondence between people is possibly achieved when both the importance and the emotion of the correspondence are perceived by all groups included. Understanding the significance of language has generally been concentrated on in natural language processing (NLP) as a semantic examination. In NLP, the text can be handled appropriately for classification. Emotion detection from facial emotion is the subfield of social signal processing applied in a wide assortment of regions, explicitly for human and PC collaboration. Many researchers have proposed various approaches, generally utilizing machine learning concepts. Automatic emotion recognition (AER) is significant for working with consistent intuitiveness between a person and a smart device toward fully acknowledging an intelligent society. Many researchers examined cross-lingual and multilingual speech emotion as a stage toward language-free emotion acknowledgment in natural speech. In the present work, we are proposing a deep learning-based AER system using four openly accessible datasets, namely Basic Arabic Vocal Emotions Dataset (BAVED), Acted Emotional Speech Dynamic Database (AESDD), Urdu written in Latin/Roman Script (URDU), and Toronto Emotional Speech Set (TESS), by utilizing the Jupyter notebook and a Python library for music and audio synthesis named Librosa. The experimental results exhibited that the proposed approach achieves better than the existing approaches, i.e., the accuracy of the proposed system with the URDU dataset is 96.24%, the TESS dataset is 99.10%, the AESDD dataset is 65.97%, and the BAVED dataset is 73.12%. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

E-voting system using cloud-based hybrid blockchain technology

引用

Journal of Safety science and Resilience 2024年第1期5卷 102-109页

作者： Beulah Jayakumari S Lilly Sheeba Maya Eapen Jani Anbarasi Vinayakumar Ravi A.Suganya Malathy Jawahar Department of Information Technology Tagore Engineering College Chennai India School of Computer Science and Engineering SRM Institute of Science and Technology Ramapuram ChennaiIndia Department of Information Technology Jerusalem College of Engineering ChennaiIndia School of Computer Science and Engineering Vellore Institute of Technology Chennai India Center for Artificial Intelligence Prince Mohammad Bin Fahd UniversityKhobarSaudi Arabia Leather Process Technology Division CSIR-Central Leather Research Institute ChennaiIndia

With the invention of Internet-enabled devices,cloud and blockchain-based technologies,an online voting system can smoothly carry out election *** pandemic situations,citizens tend to develop panic about mass gatherings,which may influence the decrease in the number of *** urges a reliable,flexible,transparent,secure,and cost-effective voting *** proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system,and it is carried out in three phases:the registration phase,vote casting phase and vote counting phase.A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting *** smart contracts,third-party interventions are eliminated,and the transactions are secured in the blockchain ***,to provide accurate voting results,the practical Byzantine fault tolerance(PBFT)consensus mechanism is adopted to ensure that the vote has not been modified or ***,the overall performance of the proposed system is significantly better than that of the existing *** performance was analyzed based on authentication delay,vote alteration,response time,and latency.

关键词： E-voting Cloud Blockchain Smart contract Consensus mechanism

来源：评论

学校读者我要写书评

暂无评论

ONLINE PRIMAL DUAL MEETS ONLINE MATCHING WITH STOCHASTIC REWARDS: CONFIGURATION LP TO THE RESCUE

引用

SIAM Journal on Computing 2024年第5期53卷 1217-1256页

作者： Huang, Zhiyi Zhang, Qiankun Department of Computer Science The University of Hong Kong Hong Kong School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Mehta and Panigrahi (FOCS 2012, IEEE, Piscataway, NJ, 2012, pp. 728-737) introduce the problem of online matching with stochastic rewards, where edges are associated with success probabilities and a match succeeds with the probability of the corresponding edge. It is one of the few online matching problems that have defied the randomized online primal dual framework by Devanur, Jain, and Kleinberg (SODA 2013, SIAM, Philadelphia, 2013, pp. 101-107) thus far. This paper unlocks the power of randomized online primal dual in online matching with stochastic rewards by employing the configuration linear program rather than the standard matching linear program used in previous works. Our main result is a 0.572 competitive algorithm for the case of vanishing and unequal probabilities, improving the best previous bound of 0.534 by Mehta, Waggoner, and Zadimoghaddam (SODA 2015, SIAM, Philadelphia, 2015, pp. 1388-1404) and, in fact, is even better than the best previous bound of 0.567 by Mehta and Panigrahi (FOCS 2012, IEEE, Piscataway, NJ, 2012, pp. 728-737) for the more restricted case of vanishing and equal probabilities. For vanishing and equal probabilities, we get a better competitive ratio of 0.576. Our results further generalize to the vertex-weighted case due to the intrinsic robustness of the randomized online primal dual analysis. © 2024 Society for Industrial and Applied Mathematics.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A color image encryption scheme based on a 2D coupled chaotic system and diagonal scrambling algorithm

引用

Chinese Physics B 2024年第7期33卷 233-243页

作者：苏静明方士辉洪炎温言 Anhui Mining Machinery and Electrical Equipment Coordination Innovation Center Anhui University of Science and TechnologyHuainan 232001China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.

关键词： color image encryption discrete cosine transform two-dimensional(2D)coupled chaotic system diagonal scrambling

来源：评论

学校读者我要写书评

暂无评论

An Investigation of Frequency-Domain Pruning Algorithms for Accelerating Human Activity Recognition Tasks Based on Sensor Data

引用

computers, Materials & Continua 2024年第11期81卷 2219-2242页

作者： Jian Su Haijian Shao Xing Deng Yingtao Jiang School of Computer Jiangsu University of Science and TechnologyZhenjiang212003China Department of Electrical and Computer Engineering University of NevadaLas VegasNV 89154USA

The rapidly advancing Convolutional Neural Networks(CNNs)have brought about a paradigm shift in various computer vision tasks,while also garnering increasing interest and application in sensor-based Human Activity Recognition(HAR)***,the significant computational demands and memory requirements hinder the practical deployment of deep networks in resource-constrained *** paper introduces a novel network pruning method based on the energy spectral density of data in the frequency domain,which reduces the model’s depth and accelerates activity *** traditional pruning methods that focus on the spatial domain and the importance of filters,this method converts sensor data,such as HAR data,to the frequency domain for *** emphasizes the low-frequency components by calculating their energy spectral density ***,filters that meet the predefined thresholds are retained,and redundant filters are removed,leading to a significant reduction in model size without compromising performance or incurring additional computational ***,the proposed algorithm’s effectiveness is empirically validated on a standard five-layer CNNs backbone *** computational feasibility and data sensitivity of the proposed scheme are thoroughly ***,the classification accuracy on three benchmark HAR datasets UCI-HAR,WISDM,and PAMAP2 reaches 96.20%,98.40%,and 92.38%,***,our strategy achieves a reduction in Floating Point Operations(FLOPs)by 90.73%,93.70%,and 90.74%,respectively,along with a corresponding decrease in memory consumption by 90.53%,93.43%,and 90.05%.

关键词： Convolutional neural networks human activity recognition network pruning frequency-domain transformation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：