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

Answering reachability queries with ordered label constraints over labeled graphs

Frontiers of Computer science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Scalable Data Pipeline for Multiclass Attack Classification in Large-Scale IoT Networks

引用

Big Data Mining and Analytics 2024年第2期7卷 500-511页

作者： Selvam Saravanan Uma Maheswari Balasubramanian Department of Computer Science and Engineering Amrita School of ComputingAmrita Vishwa VidyapeethamBengaluru 560035India

The current large-scale Internet of Things(IoT)networks typically generate high-velocity network traffic *** use IoT devices to create botnets and launch attacks,such as DDoS,Spamming,Cryptocurrency mining,Phishing,*** service providers of large-scale IoT networks need to set up a data pipeline to collect the vast network traffic data from the IoT devices,store it,analyze it,and report the malicious IoT devices and types of ***,the attacks originating from IoT devices are dynamic,as attackers launch one kind of attack at one time and another kind of attack at another *** number of attacks and benign instances also vary from time to *** phenomenon of change in attack patterns is called concept ***,the attack detection system must learn continuously from the ever-changing real-time attack patterns in large-scale IoT network *** meet this requirement,in this work,we propose a data pipeline with Apache Kafka,Apache Spark structured streaming,and MongoDB that can adapt to the ever-changing attack patterns in real time and classify attacks in large-scale IoT *** concept drift is detected,the proposed system retrains the classifier with the instances that cause the drift and a representative subsample instances from the previous training of the *** proposed approach is evaluated with the latest dataset,IoT23,which consists of benign and several attack instances from various IoT *** classification accuracy is improved from 97.8%to 99.46%by the proposed *** training time of distributed random forest algorithm is also studied by varying the number of cores in Apache Spark environment.

关键词： Internet of Things(IoT) concept drift Apache Spark MongoDB Apache Kafka streaming

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

引用

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1539-1556页

作者： Weihao Song Zidong Wang Zhongkui Li Jianan Wang Qing-Long Han IEEE the State Key Laboratory for Turbulence and Complex Systems Department of Mechanics and Engineering ScienceCollege of Engineering Peking University the Department of Computer Science Brunel University London the School of Aerospace Engineering Beijing Institute of Technology the School of Science Computing and Engineering Technologies Swinburne University of Technology

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical *** main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber ***, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

关键词： Communication constraints maximum correntropy filter networked nonlinear filtering particle filter sample-based approximation unscented Kalman filter

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Hypergraph Embedding for Node Classification in Dynamic Networks

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第11期5卷 5465-5477页

作者： Hayat, Malik Khizar Xue, Shan Wu, Jia Yang, Jian Macquarie University School of Computing Faculty of Science and Engineering SydneyNSW2113 Australia

Graphs are a foundational way to represent scenarios where objects interact in pairs. Recently, graph neural networks (GNNs) have become widely used for modeling simple graph structures, either in homogeneous or heterogeneous graphs, where edges represent pairwise relationships between nodes. However, many real-world situations involve more complex interactions where multiple nodes interact simultaneously, as observed in contexts such as social groups and gene-gene interactions. Traditional graph embeddings often fail to capture these multifaceted nonpairwise dynamics. A hypergraph, which generalizes a simple graph by connecting two or more nodes via a single hyperedge, offers a more efficient way to represent these interactions. While most existing research focuses on homogeneous and static hypergraph embeddings, many real-world networks are inherently heterogeneous and dynamic. To address this gap, we propose a GNN-based embedding for dynamic heterogeneous hypergraphs, specifically designed to capture nonpairwise interactions and their evolution over time. Unlike traditional embedding methods that rely on distance or meta-path-based strategies for node neighborhood aggregation, a k-hop neighborhood strategy is introduced to effectively encapsulate higher-order interactions in dynamic networks. Furthermore, the information aggregation process is enhanced by incorporating semantic hyperedges, further enriching hypergraph embeddings. Finally, embeddings learned from each timestamp are aggregated using a mean operation to derive the final node embeddings. Extensive experiments on five real-world datasets, along with comparisons against homogeneous, heterogeneous, and hypergraph-based baselines (both static and dynamic), demonstrate the robustness and superiority of our model. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

An automated ectopic pregnancy prediction system using ultrasound images with the aid of a deep learning technique: An automated ectopic pregnancy prediction…: L. R. Suresh, L. S. Kumar

引用

Soft computing 2024年第21期28卷 12451-12475页

作者： Suresh, Lakshmi R. Kumar, L. Sathish School of Computing Science and Engineering VIT Bhopal University Madhya Pradesh Bhopal466114 India Department of Gaming Division School of Computing Science and Engineering VIT Bhopal University Madhya Pradesh Bhopal466114 India

Ectopic pregnancy is a complex condition that happens when the fertilized egg implants outside of the uterus. It is a significant cause of maternal morbidity and mortality. The diagnosis and treatment of ectopic pregnancy can be challenging, and there is a need for accurate and efficient prediction systems to aid in its detection and management. Ultrasound imaging is commonly used to diagnose ectopic pregnancy, but the current diagnostic methods using ultrasound images suffer from several drawbacks, including low accuracy and reliability, making it difficult for medical experts to initiate appropriate treatments. To address these challenges, this paper proposes a clinical decision support system that integrates deep learning techniques to aid medical experts in making informed decisions for initial treatment. The proposed system leverages an improved spiking neural network with a seagull optimization algorithm (ISNN-SOA) for predicting ectopic pregnancy. To enhance the accuracy of the proposed approach, the system incorporates pre-processing techniques using a median filter and segmentation using an improved Canny algorithm. Our proposed method outperforms previous techniques with DC of 93.4%, JI of 89.6%, Sen of 94.5%, and PPV of 88.25%. Also, our proposed method achieves an impressive classification performance with a precision of 98.4%, accuracy of 98.5%, recall of 98.3%, F-measure of 98.1%, and a loss of 1.5. These results demonstrate the potential of our system to aid medical experts in making suitable initial treatments and improve the overall management of ectopic pregnancy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Median filters

来源：评论

学校读者我要写书评

暂无评论

Quantum speedup and limitations on matroid property problems

引用

Frontiers of Computer science 2024年第4期18卷 189-196页

作者： Xiaowei HUANG Jingquan LUO Lvzhou LI Institute of Quantum Computing and Computer Theory School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China

Matroid theory has been developed to be a mature branch of mathematics and has extensive applications in combinatorial optimization,algorithm design and so *** the other hand,quantum computing has attracted much attention and has been shown to surpass classical computing on solving some computational ***,crossover studies of the two fields seem to be missing in the *** paper initiates the study of quantum algorithms for matroid property *** is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits(bases,flats,hyperplanes)of a matroid,and for the decision problem of deciding whether a matroid is uniform or Eulerian,by giving a uniform lower boundΩ■on the query complexity of all these *** the other hand,for the uniform matroid decision problem,an asymptotically optimal quantum algorithm is proposed which achieves the lower bound,and for the girth problem,an almost optimal quantum algorithm is given with query complexityO■.In addition,for the paving matroid decision problem,a lower boundΩ■on the query complexity is obtained,and an O■ quantum algorithm is presented.

关键词： quantum computing matroid quantum algorithm quantum query complexity

来源：评论

学校读者我要写书评

暂无评论

Research Progress in Solar Flare Prediction Methods

引用

Research in Astronomy and Astrophysics 2025年第3期25卷 280-309页

作者： Ke Han Zhen Liu Xian-Yi Zhao Yi-Fei Li De-Quan Zheng Jie Wan School of Computer and Information Engineering Harbin University of Commerce Faculty of Computing Harbin Institute of Technology School of Energy Science and Engineering Harbin Institute of Technology

Solar flares are one of the strongest outbursts of solar activity,posing a serious threat to Earth’s critical infrastructure,such as communications,navigation,power,and ***,it is essential to accurately predict solar flares in order to ensure the safety of human ***,the research focuses on two directions:first,identifying predictors with more physical information and higher prediction accuracy,and second,building flare prediction models that can effectively handle complex observational *** terms of flare observability and predictability,this paper analyses multiple dimensions of solar flare observability and evaluates the potential of observational parameters in *** flare prediction models,the paper focuses on data-driven models and physical models,with an emphasis on the advantages of deep learning techniques in dealing with complex and high-dimensional *** reviewing existing traditional machine learning,deep learning,and fusion methods,the key roles of these techniques in improving prediction accuracy and efficiency are *** prevailing challenges,this study discusses the main challenges currently faced in solar flare prediction,such as the complexity of flare samples,the multimodality of observational data,and the interpretability of *** conclusion summarizes these findings and proposes future research directions and potential technology advancement.

关键词： Sun: activity Sun: flares (Sun:) sunspots Sun: magnetic fields magnetohydrodynamics (MHD)

来源：评论

学校读者我要写书评

暂无评论

Real-Time Speech Enhancement Based on Convolutional Recurrent Neural Network

引用

Intelligent Automation & Soft computing 2023年第2期35卷 1987-2001页

作者： S.Girirajan A.Pandian Department of Computer Science and Engineering School of ComputingSRM Institute of Science and EngineeringKattankulathurTamil NaduIndia

Speech enhancement is the task of taking a noisy speech input and pro-ducing an enhanced speech *** recent years,the need for speech enhance-ment has been increased due to challenges that occurred in various applications such as hearing aids,Automatic Speech Recognition(ASR),and mobile speech communication *** of the Speech Enhancement research work has been carried out for English,Chinese,and other European *** a few research works involve speech enhancement in Indian regional *** this paper,we propose a two-fold architecture to perform speech enhancement for Tamil speech signal based on convolutional recurrent neural network(CRN)that addresses the speech enhancement in a real-time single channel or track of sound created by the *** theﬁrst stage mask based long short-term mem-ory(LSTM)is used for noise suppression along with loss function and in the sec-ond stage,Convolutional Encoder-Decoder(CED)is used for speech *** proposed model is evaluated on various speaker and noisy environments like Babble noise,car noise,and white Gaussian *** proposed CRN model improves speech quality by 0.1 points when compared with the LSTM base model and also CRN requires fewer parameters for *** performance of the pro-posed model is outstanding even in low Signal to Noise Ratio(SNR).

关键词： Speech enhancement convolutional encoder-decoder long short-term memory noise suppression speech restoration

来源：评论

学校读者我要写书评

暂无评论

Adaptive pelican optimization with optimized mask RCNN for automatic lung cancer detection

引用

Multimedia Tools and Applications 2025年 1-21页

作者： Sudha, R. Maheswari, K.M. Uma Department of Computer Science and Engineering SRM Institute of Science and Technology Chengalpattu India Department of Computing Technologies SRM Institute of Science and Technology Chengalpattu India

Lung cancer is a prevalent and deadly disease worldwide, necessitating accurate and timely detection methods for effective treatment. Deep learning-based approaches have emerged as promising solutions for automated medical image analysis. This study proposes an enhanced Mask R-CNN framework tailored specifically for the automatic detection and severity analysis of lung cancer from CT images. The proposed approach consists of three stages namely, pre-processing, lung nodule detection, and segmentation using enhanced Mask R-CNN and severity analysis. Our framework employs a deep convolutional neural network architecture trained on a comprehensive dataset of annotated lung images. By incorporating a region-based convolutional neural network (R-CNN) with a mask prediction branch, our model accurately localizes lung tumors while providing precise pixel-level segmentation masks. To enhance the performance of mask RCNN, the parameter present in the classifier is optimally selected using the adaptive pelican optimization (APO) algorithm. The proposed framework detects lung tumors and provides a comprehensive severity analysis, enabling clinicians to assess cancer stage and progression accurately. Evaluation on a benchmark dataset demonstrates superior detection accuracy and robustness compared to existing methods. Our enhanced Mask R-CNN approach shows promise as a valuable tool for early diagnosis and severity assessment of lung cancer, potentially improving patient outcomes and healthcare efficiency. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

Global Solvability for a Predator-Prey Model with Prey-Taxis and Rotational Flux Terms

引用

Chinese Annals of Mathematics,Series B 2024年第2期45卷 297-318页

作者： Guoqiang REN Bin LIU School of Mathematics and Statistics Huazhong University of Science and Technology Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong Universityof Science and Technology

In this paper the author investigates the following predator-prey model with prey-taxis and rotational?ux terms■in a bounded domain with smooth *** presents the global existence of generalized solutions to the model... 详细信息

关键词： Predator-prey Prey-taxis Giopal existence Kotational flnux

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：