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

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

MLFuse: Multi-Scenario Feature Joint Learning for Multi-Modality Image Fusion

引用

IEEE Transactions on Multimedia 2025年

作者： Lei, Jia Li, Jiawei Liu, Jinyuan Wang, Bin Zhou, Shihua Zhang, Qiang Wei, Xiaopeng Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Dalian University of Technology School of Mechanical Engineering Dalian116024 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1010 New Zealand Ulster University Intelligent Systems Research Center LondonderryBT52 1SA United Kingdom

Multi-modality image fusion (MMIF) entails synthesizing images with detailed textures and prominent objects. Existing methods tend to use general feature extraction to handle different fusion tasks. However, these methods have difficulty breaking fusion barriers across various modalities owing to the lack of targeted learning routes. In this work, we propose a multi-scenario feature joint learning architecture, MLFuse, that employs the commonalities of multi-modality images to deconstruct the fusion progress. Specifically, we construct a cross-modal knowledge reinforcing network that adopts a multipath calibration strategy to promote information communication between different images. In addition, two professional networks are developed to maintain the salient and textural information of fusion results. The spatial-spectral domain optimizing network can learn the vital relationship of the source image context with the help of spatial attention and spectral attention. The edge-guided learning network utilizes the convolution operations of various receptive fields to capture image texture information. The desired fusion results are obtained by aggregating the outputs from the three networks. Extensive experiments demonstrate the superiority of MLFuse for infrared-visible image fusion and medical image fusion. The excellent results of downstream tasks (i.e., object detection and semantic segmentation) further verify the high-quality fusion performance of our method. The code is publicly available at https://***/jialei-sc/MLFuse. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Quantitative and qualitative forecasting applied to supply-chain inventory

Quantitative and qualitative forecasting applied to supply-c...

引用

2010 2nd International Conference on MultiMedia and Information Technology, MMIT 2010

作者： Shao, Chenxi Wang, Lizhong Computer Science and Technology School of University of Science and Technology of China Hefei China Anhui Province Key Laboratory Software in Computing and Communication Hefei 230027 China MOE-Microsoft Key Laboratory Multimedia Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9780769540085

In the process of supply chain (SC) management, time inventory management problem is extremely important. In terms of academic methods, quantitative methods are very popular as the researchers could calculate the inventory if they got the historic data of some SC. However, based on quantitative methods and the results cannot too be convincible. This paper considered a supply chain system includes several kinds of products. As to the historic suppliers' demand data of this SC system, firstly we applied a quantitative forecasting analysis method to it;secondly we made a qualitative analysis to improve the complex system's inventory management performance. According to the comparison between quantitative method and the method used in this paper, we find that the accuracy is more perfect. Not only the inventory cost is lower, also the forecasting accuracy is better. © 2010 IEEE.

关键词： Supply chain management

来源：评论

学校读者我要写书评

暂无评论

Instability of Standing Wave for the Klein–Gordon–Hartree Equation

引用

Acta Mathematica Sinica,English Series 2014年第5期30卷 861-871页

作者： Xiao Guang LI Jian ZHANG Yong Hong WU Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Sichuan Normal University College of Mathematics and Software Science Sichuan Normal University Department of Mathematics and Statistics Curtin University of Technology

The instability property of the standing wave uω（t, x） = eiωtφ（x） for the Klein–Gordon– Hartree equation is investigated. For the case N≥3 and w2 〈2/N＋4-γ,it is shown that the standing wave eiwtφ（x） is... 详细信息

关键词： Klein–Gordon–Hartree equation standing waves strong instability

来源：评论

学校读者我要写书评

暂无评论

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection against Multipath Routing

引用

IEEE Journal on Selected Areas in communications 2025年

作者： Zhao, Ziming Li, Zhaoxuan Xie, Xiaofei Liu, Zhipeng Li, Tingting Yu, Jiongchi Zhang, Fan Chen, Binbin School of Software Technology Zhejiang University Ningbo315100 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China ZJU-Hangzhou Global Scientific and Technological Innovation Center 311200 China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province 310027 China Jiaxing Research Institute Zhejiang University 314000 China Zhengzhou Xinda Institute of Advanced Technology Zhengzhou450001 China Singapore State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security UCAS Beijing100049 China School of Computing and Information Systems Singapore Management University Singapore188065 Singapore Advanced Digital Sciences Center Singapore138632 Singapore Singapore University of Technology and Design SingaporeB96049 Singapore

With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multi-path routing phenomenon that exists in practice. In this paper, we reveal practical challenges in the context of enabling line-speed model inference in the network dataplane. Furthermore, we propose FCPlane, the forwarding and computing integrated dataplane for zero-trust intrusion detection that aims to enable efficient load balancing while providing reliable traffic analysis results, even against multipath routing. The core idea is to reconcile forwarding and computation to the flowlet level, for which a tailor-made Markov chain model is designed. Based on two public traffic datasets, we evaluate seven state-of-the-art in-network traffic analysis models deployed in four types of topologies (three with multipath routing and one without) to explore performance impact and demonstrate the effectiveness of our proposal. © 1983-2012 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

A hybrid particle swarm optimization for high-dimensional dynamic optimization 11th

A hybrid particle swarm optimization for high-dimensional dy...

引用

11th International Conference on Simulated Evolution and Learning, SEAL 2017

作者： Luo, Wenjian Yang, Bin Bu, Chenyang Lin, Xin Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui230027 China

ISBN: (纸本)9783319687582

High-Dimensional Dynamic Optimization Problems (HDDOPs) commonly exist in real-world applications. In evolutionary computation field, most of existing benchmark problems, which could simulate HDDOPs, are non-separable. Thus, we give a novel benchmark problem, called high-dimensional moving peaks benchmark to simulate separable, partially separable, and non-separable problems. Moreover, a hybrid Particle Swarm Optimization algorithm based on Grouping, Clustering and Memory strategies, i.e. GCM-PSO, is proposed to solve HDDOPs. In GCM-PSO, a differential grouping method is used to decompose a HDDOP into a number of sub-problems based on variable interactions firstly. Then each sub-problem is solved by a species-based particle swarm optimization, where the nearest better clustering is adopted as the clustering method. In addition, a memory strategy is also adopted in GCM-PSO. Experimental results show that GCM-PSO performs better than the compared algorithms in most cases. © Springer International Publishing AG 2017.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Multi-question negative surveys 3rd

Multi-question negative surveys

引用

3rd International Conference on Data Mining and Big Data, DMBD 2018 held in conjunction with the 9th International Conference on Swarm Intelligence, ICSI 2018

作者： Jiang, Hao Luo, Wenjiang Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui230027 China

ISBN: (纸本)9783319938028

The negative survey is an emerging method of collecting sensitive information. It could obtain the distribution of sensitive information while preserving the personal privacy. When collecting sensitive information, several questions are often provided together to the respondents. However, when reconstructing positive survey results of multiple questions, previous reconstruction methods have some shortcomings. In this paper, we propose a new reconstruction method for multi-question negative surveys. Experimental results show that our method could obtain more reasonable results. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Chaos-based estimation method for software reliability

Chaos-based estimation method for software reliability

引用

2nd International Conference on Networks Security, Wireless communications and Trusted computing, NSWCTC 2010

作者： Shao, Chenxi Huang, Chao MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei Anhui China Computer Science Department University of Science and Technology of China Hefei Anhui China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui China

ISBN: (纸本)9780769540115

Reliability is one of the essential attributes of the dependable software, and an important factor for quantitatively characterizing software quality. Conventional methodology is software Reliability Growth Model (SRGM), which specifies the form of a random process that describes the behavior of software failures with respect to time. In this paper, we propose that the behavior of software failures possesses determinacy as well as randomness. So we apply chaos theory to software reliability assessment. Based on chaos theory, we can estimate software reliability according to the objective law hidden in the data, unlike the SRGM which usually makes a number of assumptions. This approach avoids the subjectivity in the SRGM. Also, we analyze the actual software failures data sets with the add-weighted one-rank localregion method (AOLM) based on chaos theory and compare the results with the conventional stochastic SRGM JM (Jelinsky-Moranda) model and NHPP (nonhomogeneous poisson process) mode. Comparison results show that the proposed method fits better than the stochastic ones. © 2010 IEEE.

关键词： software reliability

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

Stochastic prefix-based fault tolerant source routing algorithm for network on chip

Stochastic prefix-based fault tolerant source routing algori...

引用

2012 International Conference on Computer and Information Science, ICCIS 2012 - A Conference of World Engineering, Science and Technology Congress, ESTCON 2012

作者： Xu, Gengchun Ren, Kaixin Gu, Naijie Anhui Province Key Laboratory of Computing and Communication Software Hefei China USTC-SICT Joint Laboratory on Network and Communication Hefei China School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781467319386

In this paper, a novel fault-tolerant source routing algorithm for Network on Chip (NOC) called Stochastic Prefix-based Source Routing (SPSR) is proposed. Compared to non-source routing algorithms, it releases the intermediate node from complicated decision-making or routing table maintenance. Unlike the traditional source routing algorithms which use broadcast packets to record the YD of every intermediate node in Route Discovery, it predetermine prospective routes, which can greatly reduces the packets generated and forwarded in the Route Discovery phase, and therefore reduces the power consumption. The proposed routing algorithm is implemented on the open source simulator Nirgam [14], incorporating Orion [15] to estimate the power consumption. Experiment results show that the proposed algorithm can greatly reduce the power consumption in the route discovery and the latency of SPSR is comparable with that of the broadcasting mechanism. © 2012 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：