检索结果-南通市图书馆

Ensemble Approach Combining Deep Residual Networks and BiGRU with Attention Mechanism for Classification of Heart Arrhythmias

引用

computers, Materials & Continua 2024年第7期80卷 341-359页

作者： Batyrkhan Omarov Meirzhan Baikuvekov Daniyar Sultan Nurzhan Mukazhanov Madina Suleimenova Maigul Zhekambayeva department of information Systems Al-Farabi Kazakh National UniversityAlmaty050040Kazakhstan department of Mathematical and computer Modeling International Information Technology UniversityAlmaty050040Kazakhstan department of Software Engineering Satbayev UniversityAlmaty050013Kazakhstan

This research introduces an innovative ensemble approach,combining Deep Residual Networks(ResNets)and Bidirectional Gated Recurrent Units(BiGRU),augmented with an Attention Mechanism,for the classification of heart *** escalating prevalence of cardiovascular diseases necessitates advanced diagnostic tools to enhance accuracy and *** model leverages the deep hierarchical feature extraction capabilities of ResNets,which are adept at identifying intricate patterns within electrocardiogram(ECG)data,while BiGRU layers capture the temporal dynamics essential for understanding the sequential nature of ECG *** integration of an Attention Mechanism refines the model’s focus on critical segments of ECG data,ensuring a nuanced analysis that highlights the most informative features for arrhythmia *** on a comprehensive dataset of 12-lead ECG recordings,our ensemble model demonstrates superior performance in distinguishing between various types of arrhythmias,with an accuracy of 98.4%,a precision of 98.1%,a recall of 98%,and an F-score of 98%.This novel combination of convolutional and recurrent neural networks,supplemented by attention-driven mechanisms,advances automated ECG analysis,contributing significantly to healthcare’s machine learning applications and presenting a step forward in developing non-invasive,efficient,and reliable tools for early diagnosis and management of heart diseases.

关键词： CNN BiGRU ensemble deep learning ECG arrhythmia heart disease

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

AMachine Learning Approach to User Profiling for Data Annotation of Online Behavior

引用

computers, Materials & Continua 2024年第2期78卷 2419-2440页

作者： Moona Kanwal Najeed AKhan Aftab A.Khan computer Science and information Technology department NED University of Engineering and TechnologyKarachiPakistan computer Engineering department Sir Syed University of Engineering and TechnologyKarachiPakistan College of Education Health and Human ServicesLongwood UniversityFarmvilleVAUSA

The user’s intent to seek online information has been an active area of research in user *** profiling considers user characteristics,behaviors,activities,and preferences to sketch user intentions,interests,and *** user characteristics can help capture implicit and explicit preferences and intentions for effective user-centric and customized content *** user’s complete online experience in seeking information is a blend of activities such as searching,verifying,and sharing it on social ***,a combination of multiple behaviors in profiling users has yet to be *** research takes a novel approach and explores user intent types based on multidimensional online behavior in information *** research explores information search,verification,and dissemination behavior and identifies diverse types of users based on their online engagement using machine *** research proposes a generic user profile template that explains the user characteristics based on the internet experience and uses it as ground truth for data *** feedback is based on online behavior and practices collected by using a survey *** participants include both males and females from different occupation sectors and different *** data collected is subject to feature engineering,and the significant features are presented to unsupervised machine learning methods to identify user intent classes or profiles and their *** techniques are evaluated,and the K-Mean clustering method successfully generates five user groups observing different user characteristics with an average silhouette of 0.36 and a distortion score of *** average is computed to identify user intent type *** user intent classes are then further generalized to create a user intent template with an Inter-Rater Reliability of 75%.This research successfully extracts different user types based on th

关键词： User intent cluster user profile online search information sharing user behavior search reasons

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Towards kernelizing the classifier for hyperbolic data

引用

Frontiers of computer Science 2024年第1期18卷 17-31页

作者： Meimei YANG Qiao LIU Xinkai SUN Na SHI Hui XUE School of computer Science and Engineering Southeast UniversityNanjing 210096China MOE Key Laboratory of computer Science and information Integration(Southeast University) Nanjing 210096China

Data hierarchy,as a hidden property of data structure,exists in a wide range of machine learning applications.A common practice to classify such hierarchical data is first to encode the data in the Euclidean space,and then train a Euclidean ***,such a paradigm leads to a performance drop due to distortion of data embedding in the Euclidean *** relieve this issue,hyperbolic geometry is investigated as an alternative space to encode the hierarchical data for its higher ability to capture the hierarchical *** methods cannot explore the full potential of the hyperbolic geometry,in the sense that such methods define the hyperbolic operations in the tangent plane,causing the distortion of data *** this paper,we develop two novel kernel formulations in the hyperbolic space,with one being positive definite(PD)and another one being indefinite,to solve the classification tasks in hyperbolic *** PD one is defined via mapping the hyperbolic data to the Drury-Arveson(DA)space,which is a special reproducing kernel Hilbert space(RKHS).To further increase the discrimination of the classifier,an indefinite kernel is further defined in the Krein ***,we design a 2-layer nested indefinite kernel which first maps hyperbolic data into the DA spaces,followed by a mapping from the DA spaces to the Krein *** experiments on real-world datasets demonstrate the superiority ofthe proposed kernels.

关键词： data hierarchy hyperbolic cgeometry drury-arveson space krein space

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

ContextAug:model-domain failing test augmentation with contextual information

引用

Frontiers of computer Science 2024年第2期18卷 43-60页

作者： Zhuo ZHANG Jianxin XUE Deheng YANG Xiaoguang MAO School of information Technology and Engineering Guangzhou College of CommerceGuangzhou 511363China School of computer and information Engineering Institute for Artificial IntelligenceShanghai Polytechnic UniversityShanghai 201209China College of computer National University of Defense TechnologyChangsha 410073China

In the process of software development,the ability to localize faults is crucial for improving the efficiency of *** speaking,detecting and repairing errant behavior at an early stage of the development cycle considerably reduces costs and development *** have tried to utilize various methods to locate the faulty ***,failing test cases usually account for a small portion of the test suite,which inevitably leads to the class-imbalance phenomenon and hampers the effectiveness of fault ***,in this work,we propose a new fault localization approach named *** obtaining dynamic execution through test cases,ContextAug traces these executions to build an information model;subsequently,it constructs a failure context with propagation dependencies to intersect with new model-domain failing test samples synthesized by the minimum variability of the minority feature *** contrast to traditional test generation directly from the input domain,ContextAug seeks a new perspective to synthesize failing test samples from the model domain,which is much easier to augment test *** conducting empirical research on real large-sized programs with 13 state-of-the-art fault localization approaches,ContextAug could significantly improve fault localization effectiveness with up to 54.53%.Thus,ContextAug is verified as able to improve fault localization effectiveness.

关键词： context fault localization test cases

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Video Summarization Approach Based on Binary Robust Invariant Scalable Keypoints and Bisecting K-Means

引用

computers, Materials & Continua 2024年第3期78卷 3565-3583页

作者： Sameh Zarif Eman Morad Khalid Amin Abdullah Alharbi Wail S.Elkilani Shouze Tang department of information Technology Faculty of Computers and InformationMenoufia UniversityMenoufia32511Egypt department of Artificial Intelligence Faculty of Artificial IntelligenceEgyptian Russian UniversityBader11829Egypt department of computer Science Community CollegeKing Saud UniversityRiyadh11362Saudi Arabia College of Applied computer Science King Saud UniversityAl-Muzahmiya19676Saudi Arabia School of Communication and information Engineering Chongqing University of Posts and TelecommunicationsChongqing400065China

Due to the exponential growth of video data,aided by rapid advancements in multimedia *** became difficult for the user to obtain information from a large video *** process of providing an abstract of the entire video that includes the most representative frames is known as static video *** method resulted in rapid exploration,indexing,and retrieval of massive video *** propose a framework for static video summary based on a Binary Robust Invariant Scalable Keypoint(BRISK)and bisecting K-means clustering *** current method effectively recognizes relevant frames using BRISK by extracting keypoints and the descriptors from video *** video frames’BRISK features are clustered using a bisecting K-means,and the keyframe is determined by selecting the frame that is most near the cluster *** applying any clustering parameters,the appropriate clusters number is determined using the silhouette *** were carried out on a publicly available open video project(OVP)dataset that contained videos of different *** proposed method’s effectiveness is compared to existing methods using a variety of evaluation metrics,and the proposed method achieves a trade-off between computational cost and quality.

关键词： BRISK bisecting K-mean video summarization keyframe extraction shot detection

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Target Detection Algorithm in Foggy Scenes Based on Dual Subnets

引用

computers, Materials & Continua 2024年第2期78卷 1915-1931页

作者： Yuecheng Yu Liming Cai Anqi Ning Jinlong Shi Xudong Chen Shixin Huang School of computer Science Jiangsu University of Science and TechnologyZhenjiang212100China information department China Merchants Heavy IndustryNantong226116China

Under the influence of air humidity,dust,aerosols,etc.,in real scenes,haze presents an uneven *** this way,the image quality and contrast will *** this case,It is difficult to detect the target in the image by the universal detection ***,a dual subnet based on multi-task collaborative training(DSMCT)is proposed in this ***,in the training phase,the Gated Context Aggregation Network(GCANet)is used as the supervisory network of YOLOX to promote the extraction of clean information in foggy *** the test phase,only the YOLOX branch needs to be activated to ensure the detection speed of the ***,the deformable convolution module is used to improve GCANet to enhance the model’s ability to capture details of non-homogeneous ***,the Coordinate Attention mechanism is introduced into the Vision Transformer and the backbone network of YOLOX is *** this way,the feature extraction ability of the network for deep-level information can be *** experimental results on artificial fog data set FOG_VOC and real fog data set RTTS show that the map value of DSMCT reached 86.56%and 62.39%,respectively,which was 2.27%and 4.41%higher than the current most advanced detection *** DSMCT network has high practicality and effectiveness for target detection in real foggy scenes.

关键词： Target detection fog target detection YOLOX twin network multi-task learning

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Mobile Crowdsourcing Task Allocation Based on Dynamic Self-Attention GANs

引用

computers, Materials & Continua 2024年第4期79卷 607-622页

作者： Kai Wei Song Yu Qingxian Pan School of computer and Control Engineering Yantai UniversityYantai264005China School of computer and information Science Southwest UniversityChongqing400715China

Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource *** traditional methods for task allocation can help reduce costs and improve efficiency,they may encounter challenges when dealing with abnormal data flow nodes,leading to decreased allocation accuracy and *** address these issues,this study proposes a novel two-part invalid detection task allocation *** the first step,an anomaly detection model is developed using a dynamic self-attentive GAN to identify anomalous *** to the baseline method,the model achieves an approximately 4%increase in the F1 value on the public *** the second step of the framework,task allocation modeling is performed using a twopart graph matching *** phase introduces a P-queue KM algorithm that implements a more efficient optimization *** allocation efficiency is improved by approximately 23.83%compared to the baseline *** results confirm the effectiveness of the proposed framework in detecting abnormal data nodes,enhancing allocation precision,and achieving efficient allocation.

关键词： Mobile crowdsourcing task allocation anomaly detection GAN attention mechanisms

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Local Differential Privacy Trajectory Protection Method Based on Temporal and Spatial Restrictions for Staying Detection

引用

Tsinghua Science and Technology 2024年第2期29卷 617-633页

作者： Weiqi Zhang Zhenzhen Xie Akshita Maradapu Vera Venkata Sai Qasim Zia Zaobo He Guisheng Yin College of computer Science and Technology Harbin Engineering UniversityHarbin 150001China School of computer Science and Technology Shandong UniversityQingdao 266237China department of computer Science Georgia State UniversityAtlantaGA 30303USA College of information Science and Technology Jinan UniversityGuangzhou 510632China

The widespread availability of GPS has opened up a whole new market that provides a plethora of location-based ***-based social networks have become very popular as they provide end users like us with several such services utilizing GPS through our ***,when users utilize these services,they inevitably expose personal information such as their ID and sensitive location to the *** to untrustworthy servers and malicious attackers with colossal background knowledge,users'personal information is at risk on these ***,many privacy-preserving solutions for protecting trajectories have significantly decreased utility after *** have come up with a new trajectory privacy protection solution that contraposes the area of interest for ***,Staying Points Detection Method based on Temporal-Spatial Restrictions(SPDM-TSR)is an interest area mining method based on temporal-spatial restrictions,which can clearly distinguish between staying and moving ***,our privacy protection mechanism focuses on the user's areas of interest rather than the entire ***,our proposed mechanism does not rely on third-party service providers and the attackers'background knowledge *** test our models on real datasets,and the results indicate that our proposed algorithm can provide a high standard privacy guarantee as well as data availability.

关键词： local-differential privacy stay points detection trajectory data areas of interest temporal-spatial clustering

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Integrated Clustering and Routing Design and Triangle Path Optimization for UAV-Assisted Wireless Sensor Networks

引用

China Communications 2024年第4期21卷 178-192页

作者： Shao Liwei Qian Liping Wu Mengru Wu Yuan College of information Engineering Zhejiang University of TechnologyHangzhou 310014China State Key Laboratory of Internet of Things for Smart City University of MacaoMacaoChina department of computer and information Science University of MacaoMacaoChina

With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower ***,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery *** this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this ***,we use UAVs to assist the WSN in collecting *** the current UAV-assisted WSN,the clustering and routing schemes are determined ***,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and *** efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing *** the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing ***,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution *** point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor *** avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are *** emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of *** with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.

关键词： Monte-Las search strategy triangle path optimization unmanned aerial vehicles wireless sensor networks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Insider Attack Prevention:LAPUP—Lightweight Authentication Protocol Using PUF

引用

Journal of Communications and information Networks 2024年第2期9卷 192-206页

作者： Siranjeevi Rajamanickam Satyanarayana Vollala N.Ramasubramanian department of computer Engineering Government Polytechnic CollegeTiruchirappalli 620022India department of computer Science and Engineering Dr.Shyama Prasad Mukherjee International Institute of Information Technology-Naya RaipurChhattisgarh 493661India department of computer Science and Engineering National Institute of TechnologyTiruchirappalli 620015India

The incredible progress in technologies has drastically increased the usage of Web *** share their credentials like userid and password or use their smart cards to get authenticated by the application *** cards are handy to use,but they are susceptible to stolen smart card attacks and few other notable security *** prefer to use Web applications that guarantee for security against several security attacks,especially insider attacks,which is *** of several existing schemes prove the security pitfalls of the protocols from preventing security attacks,specifically insider *** paper introduces LAPUP:a novel lightweight authentication protocol using physically unclonable function(PUF)to prevent security attacks,principally insider *** PUFs are used to generate the security keys,challenge-response pair(CRP)and hardware signature for designing the *** transmitted messages are shared as hash values and encrypted by the keys generated by *** messages are devoid of all possible attacks executed by any attacker,including insider *** is also free from stolen verifier attacks,as the databases are secured by using the hardware signature generated by *** analysis of the protocol exhibits the strength of LAPUP in preventing insider attacks and its resistance against several other security *** evaluation results of the communication and computation costs of LAPUP clearly shows that it achieves better performance than existing protocols,despite providing enhanced security.

关键词： physically unclonable function(PUF) insiderattacks authenticationkeymanagementserver(AKMS) security

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：