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

9th International Conference on Communication and network Security, ICCNS 2019

作者： Liu, Huajun Liu, Zhanghui Liu, Yanhua Gao, Xiaoling College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

As the network evolves, cyber-attacks become more and more diverse. In the process of detecting network traffic, the most complicated but also the most important task is to find unknown abnormal network traffic data in time. In the existing abnormal network traffic detection method based on Extended Isolation Forest, there are limitations such as unbalanced detection accuracy and insufficient generalization ability. An improved abnormal network traffic detection method EIF-LNDR is proposed for the above problems. Based on the leaf node density ratio, the anomaly score of the instance can be calculated differently for each iTree. The experiments show that EIF-LNDR has significant improvement in precision, false negative rate, and detector efficiency compared with Extended Isolation Forest and LOF methods. © 2019 Association for computing Machinery.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

Analogical Learning for Cross-Scenario Generalization: Framework and Application to intelligent Localization

arXiv

引用

arXiv 2025年

作者： Chen, Zirui Zhang, Zhaoyang Xing, Ziqing Li, Ridong Yang, Zhaohui Jin, Richeng Huang, Chongwen Yang, Yuzhi Debbah, Mérouane College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multi-modal Communication Networks and Intelligent Information Processing Hangzhou310027 China College of Computing and Mathematical Sciences Khalifa University Abu Dhabi999041 United Arab Emirates

Existing learning models often exhibit poor generalization when deployed across diverse scenarios. It is mainly due to that the underlying reference frame of the data varies with the deployment environment and settings. However, despite the data of each scenario has its distinct reference frame, its generation generally follows the same underlying physical rule. Based on these findings, this article proposes a brand-new universal deep learning framework named analogical learning (AL), which provides a highly efficient way to implicitly retrieve the reference frame information associated with a scenario and then to make accurate prediction by relative analogy across scenarios. Specifically, an elegant bipartite neural network architecture called Mateformer is designed, the first part of which calculates the relativity within multiple feature spaces between the input data and a small amount of embedded data from the current scenario, while the second part uses these relativity to guide the nonlinear analogy. We apply AL to the typical multi-scenario learning problem of intelligent wireless localization in cellular networks. Extensive experiments show that AL achieves state-of-the-art accuracy, stable transferability and robust adaptation to new scenarios without any tuning, and outperforming conventional methods with a precision improvement of nearly two orders of magnitude. All data and code are available at https://***/ziruichen-research/ALLoc. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A new 2D graphical representation of protein sequence and its application

引用

International Journal of Biomathematics 2015年第5期8卷 201-213页

作者： Lei Wang Hui Peng Jinhua Zheng Yanzi Qiu College of Information Engineering Xiangtan University Xiangtan 411105 P. R. China Key Laboratory of Intelligent Computing Information Processing Ministry of Education Xiangtan 411105 P. R. China

Graphical representation is a very efficient tool for visual analysis of protein sequences. In this paper, a novel 2D graphical representation scheme is proposed on the basis of a newly introduced concept, named characteristic model of the protein sequences. After obtaining the 2D graphics of protein sequences, two numerical characterizations of them is designed as descriptors to analyze the nine DN5 protein sequences, simulation and analysis results show that, comparing with existing methods, our method is not only visible, intuitional, and simple, but also has no circuit or degeneracy, and even more important, since the storage space required by our method is constant and has nothing to do with the length of protein sequences, then it can keep excellent visual inspection for long protein sequences.

关键词： 2D graphical representation protein sequence similarity/dissimilarity ana-lysis characteristic model visual analysis.

来源：评论

学校读者我要写书评

暂无评论

Temperature Uniformity of Wafer on a Large-Sized Susceptor for a Nitride Vertical MOCVD Reactor

引用

Chinese Physics Letters 2012年第3期29卷 52-55页

作者： LI Zhi-Ming JIANG Hai-Ying HAN Yan-Bin LI Jin-Ping YIN Jian-Qin ZHANG Jin-Cheng Shandong Provincial Key Laboratory of Network-Based Intelligent Computing School of Information Science and EngineeringUniversity of Ji’nanJi’nan 250022 Key Laboratory of Fundamental Science for National on Wide Band-Gap Semiconductor Technology School of MicroelectronicsXidian UniversityXi’an 710071

The effect of coil location on wafer temperature is analyzed in a vertical MOCVD reactor by induction *** is observed that the temperature distribution in the wafer with the coils under the graphite susceptor is more uniform than that with the coils around the outside wall of the *** the case of coils under the susceptor,we find that the thickness of the susceptor,the distance from the coils to the susceptor bottom and the coil turns significantly affect the temperature uniformity of the *** optimization process is executed for a 3-inch susceptor with this kind of structure,resulting in a large improvement in the temperature uniformity.A further optimization demonstrates that the new susceptor structure is also suitable for either multiple wafers or large-sized wafers approaching 6 and 8 inches.

关键词： MOCVD optimization Vertical

来源：评论

学校读者我要写书评

暂无评论

Application of matlab/simulink in teaching course of communication principle

Application of matlab/simulink in teaching course of communi...

引用

2013 International Conference on Advanced information Engineering and Education Science, ICAIEES 2013

作者： Chang, Jing Li, Xiaohui Key Laboratory of Intelligent Computing and Singnal Processing School of Electronic Information Engineering Anhui University Anhui Province China

ISBN: (纸本)9789078677949

This paper applies Matlab software as an auxiliary method in teaching course of communication principle. Considering variety of abstract concepts in this course, such as digital modulation and demodulation, channel-coding, random signal analysis, we select Matlab aid to provide dynamical simulation for communication theory. This method is used both in class presentation and laboratory experiments, which is helpful for students to understand the theory knowledge, enhancing their practical skills. Moreover, it can also extend students' ability of programming. Compared to traditional teaching method, the teacher's interpretation written on blackboard is the main means, this method enables students to study actively and cultivate their scientific qualities. © 2013. The authors - Published by Atlantis Press..

关键词： Simulink

来源：评论

学校读者我要写书评

暂无评论

A Short Flows Fast Transmission Algorithm Based on MPTCP Congestion Control 6th

A Short Flows Fast Transmission Algorithm Based on MPTCP Con...

引用

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Zhong, Hua Dong, PingPing Tang, WenSheng Yang, Bo Xie, JingYun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030578831

With the development of cloud computing and big data technology, traffic in the network presents new features. Real-time online interactive applications are increasing, mainly including web services, instant messaging, online commerce, advertising systems. They have very stringent latency requirements. However, the data traffic generated by data backup, movie download, data mining require high bandwidth. When large and small flows are transmitted concurrently, a series of problems will arise. MPTCP treats long and short flows equally. In this way, packets of long flows will preempt bandwidth at the bottleneck link, fill the router’s whole queue buffer. This will cause the short flows transmission timeout. To solve these problems, we propose a novel algorithm named MPTCP-SPTA (MPTCP short flows fast transmission algorithm). The algorithm give high priority to short flows based on the congestion control algorithm, then introduce the Explicit Congestion Notification mechanism(ECN) in MPTCP. Through extensive network simulator (NS-3) simulations, we demonstrate that MPTCP-SPTA outperforms TCP and MPTCP in three typical network topology, which can significantly reduce the completion time of the small flow and effectively improving the total throughput of the network. © 2020, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

作者： keyu Zhong Fen Xiao Xieping Gao Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：评论

学校读者我要写书评

暂无评论

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

引用

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge 14th

Parameterized Algorithms for Fixed-Order Book Drawing with B...

引用

14th International Conference on Combinatorial Optimization and Applications, COCOA 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030648428

Given a graph G= (V, E) and a fixed linear order of V, the problem fixed-order book drawing with bounded number of crossings per edge asks whether there is a k-page book drawing of G such that the maximum number of crossings per edge is upper-bounded by an integer b. This problem was posed by Bhore et al. (GD 2019;J. Graph Algorithms Appl. 2020) and thought to be interesting for further investigation. In this paper, we study the fixed-parameter tractable algorithms for this problem. More precisely, we show that this problem parameterized by both the bounded number b of crossings per edge and the vertex cover number τ of the graph admits an algorithm running in time (b+2)O(τ3)·|V|, and this problem parameterized by both the bounded number b of crossings per edge and the pathwidth κ of the vertex ordering admits an algorithm running in time (b+2)O(κ2)·|V|. Our results provide a specifical answer to Bhore et al.’s question. © 2020, Springer Nature Switzerland AG.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：