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

Generalized Extended Welch Bound for Multi-Cell Non-Orthogonal Sequence Sets

IEEE Communications Letters 2025年第6期29卷 1176-1180页

作者： Shen, Bingsheng Liu, Kaiqiang Gu, Zhi Yang, Yang Zhou, Zhengchun Southwest Jiaotong University School of Information Science and Technology Chengdu China Southwest Jiaotong University School of Mathematics Chengdu China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong

Sequence sets with minimum total squared correlation (TSC) have important application in communications. In a multi-cell system, due to the difference in channel strength between the home cell and the neighboring cells, the TSC can be expressed as the sum of squares of weighted correlations among sequences. In this letter, we obtain a closed-form expression for the lower bound of weighted TSC under multi-cell systems which can be regarded as a generalization of the extended Welch bound, namely generalized extended welch bound (GEWB). Moreover, we find a class of sequence sets whose parameters can achieve the theoretical lower bound of the weighted TSC, indicating that the derived GEWB is tight. © 1997-2012 IEEE.

关键词： Plant cell culture

来源：评论

学校读者我要写书评

暂无评论

Analysis of environmental impact factors in urban road traffic accidents: logistic regression model

Advances in Transportation Studies

引用

Advances in Transportation Studies 2024年第SPECIAL ISSUE期3卷 39-50页

作者： Zhao, X.J. Li, S.Y. Guan, H.B. College of Mathematics and Information Science Anyang institute of Technology Anyang455000 China School of Computer Science and Information Engineering Anyang Institute of Technology Anyang455000 China College of Mathematics and Information Science Zhengzhou University of Light Industry Zhengzhou450002 China

The traditional methods for analyzing environmental impact factors in urban road traffic accidents suffer from issues such as low recall, poor precision, and time-consuming processes. To address these challenges, a novel analysis method based on the logistic regression model is proposed. This method utilizes the MIFP-Apriori algorithm to collect urban road traffic accident data and incorporates the EM algorithm for data filling and processing. Principal component analysis is then employed to screen the environmental impact factors in urban road traffic accidents. These selected factors are input into the logistic regression model to conduct a comprehensive analysis. The results reveal that environmental impact factors like road conditions and meteorological factors have a significant influence on traffic accidents. Experimental results show that the proposed method achieves an average recall rate of 96.98%, an average precision rate of 97.66%, and the analysis time for environmental factors ranges from 0.12s to 0.52s. © 2024, Aracne Editrice. All rights reserved.

关键词： Environmental impact factors Logistic regression model Mifp-apriori algorithm Principal component analysis method Traffic accident Urban road

来源：评论

学校读者我要写书评

暂无评论

Accurate threat hunting in industrial internet of things edge devices

引用

Digital Communications and Networks 2023年第5期9卷 1123-1130页

作者： Abbas Yazdinejad Behrouz Zolfaghari Ali Dehghantanha Hadis Karimipour Gautam Srivastava Reza M.Parizi Cyber Science Lab School of Computer ScienceUniversity of GuelphOntarioCanada Department of Electrical and Software Engineering University of CalgaryAlbertaCanada Department of Mathematics and Computer Science Brandon UniversityBrandonCanada College of Computing and Software Engineering Kennesaw State UniversityGAUSA Research Center for Interneural Computing China Medical UniversityTaichungTaiwanChina Department of Computer Science and Mathematics Lebanese American UniversityBeirut1102Lebanon

Industrial Internet of Things(IIoT)systems depend on a growing number of edge devices such as sensors,controllers,and robots for data collection,transmission,storage,and *** kind of malicious or abnormal function by each of these devices can jeopardize the security of the entire ***,they can allow malicious software installed on end nodes to penetrate the *** paper presents a parallel ensemble model for threat hunting based on anomalies in the behavior of IIoT edge *** proposed model is flexible enough to use several state-of-the-art classifiers as the basic learner and efficiently classifies multi-class anomalies using the Multi-class AdaBoost and majority *** evaluations using a dataset consisting of multi-source normal records and multi-class anomalies demonstrate that our model outperforms existing approaches in terms of accuracy,F1 score,recall,and precision.

关键词： IIoT Threat hunting Edge devices Multi-class anomalies Ensemble methods

来源：评论

学校读者我要写书评

暂无评论

Physical Layer Security for CR-NOMA Network with Cooperative Jamming

引用

Tsinghua science and Technology 2025年第2期30卷 708-720页

作者： Meiling Li Peng Xue Hu Yuan Yuxing Han School of Electronics Information Engineering Taiyuan University of Science and TechnologyTaiyuan 030024China School of Computer Science and Mathematics Kingston UniversityLondonKT12EEUK Shenzhen International Graduate School Tsinghua UniversityShenzhen 518055China

Cooperative jamming can effectively combat eavesdropping in physical layer security communication without affecting the legal receiver and improve the security performance of the *** paper introduces cooperative jamming to cognitive radio(CR)networks with non-orthogonal multiple access(NOMA)*** secure performance of the considered CR and NOMA(CR-NOMA)network is evaluated using two modes:non-cooperative jamming and cooperative *** particular,the secrecy outage probabilities(SOPs)of the primary user(PU)in the two modes are derived under Rician fading channels,based on which,the influences of the transmission signal-to-noise ratio(SNR)of secondary users(SUs),the number of SUs,the secrecy rate,and the power allocation coefficient on the SOPs of PU are analyzed *** analysis and simulation results show that cooperative jamming effectively prevents eavesdropping behaviour,which reduces the SOP of PU compared to non-cooperative *** also show that the transmission SNR,the number of SUs,the secrecy rate,and the power distribution coefficients greatly influence performance improvement.

关键词： cognitive radio non-orthogonal multiple access physical layer security cooperative jamming

来源：评论

学校读者我要写书评

暂无评论

Analyzing Artificial Intelligence Based Intrusion Detection System in Detecting DDoS Attack 1

引用

4th International Conference on Smart IoT Systems: Innovations and Computing, SSIC 2023

作者： Kurra, Sai Suchith Rayana, Likhitha Yoosuf, Mohamed Sirajudeen School of Computer Science and Engineering VIT-AP University Andhra Pradesh Amaravati India Department of Mathematics and Computer Science Modern College of Business and Science Muscat Oman

ISBN: (数字)9789819752003

ISBN: (纸本)9789819751990

With the increasing complexity of the cyber-attacks, traditional intrusion systems have become inadequate in effectively detecting and preventing network attacks. Modern machine learning techniques have the capability of preventing sophisticated and aggressive cyber-attacks and have emerged as a promising approach to enhance the accuracy and efficiency of the intrusion detection. This research paper provides a comprehensive analysis and evaluation of the integration of machine learning and deep learning algorithms into intrusion detection system with respect to the Distributed Denial of Service (DDoS) attack. The study begins by presenting an overview of intrusion detection systems, highlighting their importance and significance in safeguarding network infrastructure. Subsequently, it explores supervised machine learning algorithms and deep learning models, such as Random Forest tree, Support Vector Machines (SVM), ResNet and TabNet. The paper presents the pros and cons of existing IDS models with respect to real-time processing, scalability, false positive and false negative results, and IDS vulnerabilities. The above-mentioned algorithms have been trained and evaluated with CICIDS-2017 dataset. The performance metrics used to evaluate the IDS models are accuracy, precision, F1 score, training time of each model, and adaptability to evolving attack patterns. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

nPGSAO: A Hybrid Particle Swarm Optimization and Genetic Algorithm with Niching Technology for Edge Server Placement

引用

IEEE Internet of Things Journal 2025年第12期12卷 19370-19383页

作者： Wang, Bo Zhang, Zhifeng Song, Ying Chen, Ming Liu, Dongqing Software Engineering College Zhengzhou University of Light Industry Zhengzhou China Computer School Beijing Information Science and Technology University Beijing China School of Mathematics and Computer Science Tongling University Tongling China National Engineering Laboratory for Internet Medical Systems and Applications the First Affiliated Hospital of Zhengzhou University Zhengzhou China

In this paper, we focus on the edge server placement problem (ESPP). ESPP is to decide positions (edge stations) where purchased edge servers (ESs) are placed when a service provider builds or upgrades its edge computing solution. The decision of ESPP largely determines the overall service quality and resource efficiency. We aim at providing ESPP solutions for optimizing the service quality in terms of the system response time, given a set of purchased ESs. To achieve this aim, we first deduce the optimal request dispatch for each edge station based on queue theory and Binomial theorem. Then, based on the deduced result, we formulate ESPP into a discrete nonlinear constrained optimization model. Because ESPP is NP-hard and generally multi-modality, we designed a hybrid metaheuristic algorithm to combine advantages of particle swarm optimization (PSO) and genetic algorithm (GA) as well as the niching technology, which is named nPGSAO. The basic idea of nPGSAO is grouping similar individuals into a niche and finding the niche best. Then, nPGSAO evolves each individual by integrating the swarm intelligence of PSO into the evolutionary process of GA based on its personal and niching best. To evaluate the performance of nPGSAO, we conducted extensive simulated experiments. The results show that nPGSAO achieves 5.78%–40.4% better response time with varied ESPP scale, compared to 11 up-to-date algorithms, and has a linear time complexity with the ESPP scale. These confirm the superior performance and scalability of nPGSAO. © 2014 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2 40

A Clique-Based Separator for Intersection Graphs of Geodesic...

引用

40th International Symposium on Computational Geometry, SoCG 2024

作者： Aronov, Boris de Berg, Mark Theocharous, Leonidas Department of Computer Science and Engineering Tandon School of Engineering New York University BrooklynNY United States Department of Mathematics and Computer Science TU Eindhoven Netherlands

ISBN: (纸本)9783959773164

Let d be a (well-behaved) shortest-path metric defined on a path-connected subset of R2 and let D = {D1, . . ., Dn} be a set of geodesic disks with respect to the metric d. We prove that G×(D), the intersection graph of the disks in D, has a clique-based separator consisting of O(n3/4+Ε) cliques. This significantly extends the class of objects whose intersection graphs have small clique-based separators. Our clique-based separator yields an algorithm for q-Coloring that runs in time 2O(n3/4+Ε), assuming the boundaries of the disks Di can be computed in polynomial time. We also use our clique-based separator to obtain a simple, efficient, and almost exact distance oracle for intersection graphs of geodesic disks. Our distance oracle uses O(n7/4+Ε) storage and can report the hop distance between any two nodes in G×(D) in O(n3/4+Ε) time, up to an additive error of one. So far, distance oracles with an additive error of one that use subquadratic storage and sublinear query time were not known for such general graph classes. © Boris Aronov, Mark de Berg, and Leonidas Theocharous.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

GRA: Graph Representation Alignment for Semi-Supervised Action Recognition

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第9期35卷 11896-11905页

作者： Huang, Kuan-Hung Huang, Yao-Bang Lin, Yong-Xiang Hua, Kai-Lung Tanveer, M. Lu, Xuequan Razzak, Imran National Taiwan University of Science and Technology Department of Computer Science and Information Engineering Taipei10607 Taiwan Indian Institute of Technology Indore Department of Mathematics Indore Simrol453552 India La Trobe University Department of Computer Science and IT MelbourneVIC3086 Australia University of New South Wales School of Computer Science and Engineering SydneyNSW2052 Australia

Graph convolutional networks (GCNs) have emerged as a powerful tool for action recognition, leveraging skeletal graphs to encapsulate human motion. Despite their efficacy, a significant challenge remains the dependency on huge labeled datasets. Acquiring such datasets is often prohibitive, and the frequent occurrence of incomplete skeleton data, typified by absent joints and frames, complicates the testing phase. To tackle these issues, we present graph representation alignment (GRA), a novel approach with two main contributions: 1) a self-training (ST) paradigm that substantially reduces the need for labeled data by generating high-quality pseudo-labels, ensuring model stability even with minimal labeled inputs and 2) a representation alignment (RA) technique that utilizes consistency regularization to effectively reduce the impact of missing data components. Our extensive evaluations on the NTU RGB+D and Northwestern-UCLA (N-UCLA) benchmarks demonstrate that GRA not only improves GCN performance in data-constrained environments but also retains impressive performance in the face of data incompleteness. © 2012 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

List Edge Colorings of Planar Graphs without Non-induced 7-cycles

引用

Acta Mathematica Sinica,English Series 2025年第3期41卷 1037-1054页

作者： Li Zhang Hajo Broersma You Lu Shenggui Zhang School of Mathematics and Computer Science Yan’an UniversityYan’an716000P.R.China School of Mathematics and Statistics Northwestern Polytechnical UniversityXi’an710129P.R.China Faculty of Electrical Engineering Mathematics and Computer ScienceUniversity of TwenteP.O.Box 2177500 AEEnschedeNetherlands Xi’an-Budapest Joint Research Center for Combinatorics Northwestern Polytechnical UniversityXi’an710129P.R.China

A graph G is edge-k-choosable if,for any assignment of lists L(e)of at least k colors to all edges e∈E(G),there exists a proper edge coloring such that the color of e belongs to L(e)for all e∈E(G).One of Vizing’s classic conjectures asserts that every graph is edge-(Δ+1)-*** is known since 1999 that this conjecture is true for general graphs withΔ≤*** recently,in 2015,Bonamy confirmed the conjecture for planar graph withΔ≥8,but the conjecture is still open for planar graphs with 5≤Δ≤*** confirm the conjecture for planar graphs withΔ≥6 in which every 7-cycle(if any)induces a C_(7)(so,without chords),thereby extending a result due to Dong,Liu and Li.

关键词： Planar graph list edge coloring edge-k-choosability Combinatorial Nullstellensatz discharging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：