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

International Conference on Multimedia Information networking and Security (MINES)

作者： Lian He Chanle Wu Jun Yue Shi Cheng Gang Ye Computer School Wuhan University of China Wuhan China National Engineering Research Center for Multimedia Soft The State Key Laboratory of Software Engineering Wuhan University of China Wuhan China

In the study of ALM, how to improve the performance of multicast system is a hotspot. Theoretical study shows that network coding can improve the performance of network multicast. In this paper, in accordance with the actual structure and features of HM-ALM, a cluster-oriented, and hybrid mesh ALM model, we select the deterministic linear coding strategy, and design the appropriate coding algorithm. The experimental results show that, using network coding in ALM system with hybrid mesh model can reduce transmission delay and enhance the system robustness with a certain amount of link redundancy.

关键词： network coding Robustness Encoding Vectors Application software computer networks Throughput Algorithm design and analysis Clustering algorithms Multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

pService: Towards Similarity Search on Peer-to-Peer Web Services Discovery

pService: Towards Similarity Search on Peer-to-Peer Web Serv...

引用

International Conference on Advances in P2P Systems (AP2PS)

作者： Gang Zhou Jianjun Yu National Digital Switching System Engineering and Technological Research and Development Center China State Key Laboratory of Software Development Environment Beihang University China Computer Network Information Center Chinese Academy and Sciences China

We present the design of pService system for P2P Web services discovery supporting similarity search with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC (Hilbert Space Filling Curve), and assigned to membership vector of the peer node. These two features help to support similarity search in two aspects: peer nodes with similar indexing keys would be distributed neighborly, peer nodes with similar indices will connect to each other through routing table. Our evaluation showed that the pService performs considerable Web services discovery efficiency.

关键词： Peer to peer computing Web services Indexing Routing Hilbert space Filling Search engines Data structures Switching systems Design engineering

来源：评论

学校读者我要写书评

暂无评论

An Improved Scheme for Delegation Based on Usage Control

An Improved Scheme for Delegation Based on Usage Control

引用

International Conference on Future Generation Communication and networking (FGCN)

作者： Yongming Jin Jinqiang Ren Huiping Sun Suming Li Zhong Chen School of Electronics Engineering and Computer Science Peking University Beijing China Key laboratory of High Confidence Software Technologies Ministry of Education Beijing China Information Security Research and Services Center State Information Center Beijing China School of Software and Microelectronics Peking University Beijing China

ISBN: (纸本)9781424440085

Usage control is a generalization of access control to cover obligations, conditions, continuity and mutability. However, the delegation component isn¿t discussed to the full. In this paper, an improved scheme for delegation based on the usage control model is proposed. The new model is not just expanding the UCON ABC model simply by increasing the delegation component as earlier literatures by Zhiyong Zhang et al (2005) . By analyzing the cross domain problem in the e-government environment, the delegation is proposed naturally and discussed deeply. The new model and the delegation characteristics are described from the different viewpoints, and the corresponding monitor and architecture are also proposed at last.

关键词： Access control Electronic government Communication system control computer science Laboratories Educational technology computer science education Continuing education Control engineering education Information security

来源：评论

学校读者我要写书评

暂无评论

Constrained optimization by the evolutionary algorithm with lower dimensional crossover and gradient-based mutation

Constrained optimization by the evolutionary algorithm with ...

引用

Congress on Evolutionary Computation

作者： Qing Zhang Sanyou Zeng Rui Wang Hui Shi Guang Chen Lixin Ding Lishan Kang Huanggang Normal University Hubei China School of Computer Science Technology Research Center for Spacece Science & Technology and The State Key Laboratory of Geological Processes and Mineral Resources China University of Geoscience Wuhan China School of Computer Science Technology Research Center for Spacece Science& Technology and The State Key Laboratory of Geological Processes and Mineral Resources China University of Geoscience Wuhan China StateKey Laboratory of Software Engineering Wuhan University of China Wuhan Hubei China

This paper proposes a new evolutionary algorithm with lower dimensional crossover and gradient-based mutation for real-valued optimization problems with constraints. The crossover operator of the new algorithm searches a lower dimensional neighbor of the parent points where the neighbor center is the barycenter of the parents, and therefore the new algorithm converges fast. The gradient-based mutation is used to converge fast for the problems with equality constraints and active inequality constraints. And the new algorithm is simple and easy to be implemented. We have used 24 constrained benchmark problems to test the new algorithm. The experimental results show it works better than or competitive to a known effective algorithm.

关键词： Evolutionary computation Optimization Equations Evolution (biology) Algorithm design and analysis Geology Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

A new technique for assessing the diversity of close-Pareto-optimal front

A new technique for assessing the diversity of close-Pareto-...

引用

Congress on Evolutionary Computation

作者： Sanyou Zeng Guang Chen Rui Wang Hui Li Hui Shi Lixin Ding Lishan Kang Department of Computer Science Technology Research Center for Space cience & Technology The State Key Laboratory of geological process and Mineral Resources China University of Geoscience Wuhan China School of Management Huazhong University of Science and Technology Wuhan Hubei China Statekey Laboratory of Software Engineering Wuhan University of China Wuhan Hubei China

The quality of an approximation set usually includes two aspects-- approaching distance and spreading diversity. This paper introduces a new technique for assessing the diversity of an approximation to an exact Pareto-optimal front. This diversity is assessed by using an ldquoexposure degreerdquo of the exact Pareto-optimal front against the approximation set. This new technique has three advantages: Firstly, The ldquoexposure degreerdquo combines the uniformity and the width of the spread into a direct physical sense. Secondly, it makes the approaching distance independent from the spreading diversity at the most. Thirdly, the new technique works well for problems with any number of objectives, while the widely used diversity metric proposed by Deb would work poor in problems with 3 objectives or over. Experimental computational results show that the new technique assesses the diversity well.

关键词： Evolutionary computation Approximation methods Distance measurement Optimization

来源：评论

学校读者我要写书评

暂无评论

The Geographic Information Grid System Based on Mobile Agent

引用

Wuhan University Journal of Natural Sciences 2006年第1期11卷 304-308页

作者： SHEN Zhi-dong TONG Qiang HUANG Xian-feng WANG Hua-min School of Computer Wuhan University Wuhan 430072 Hubei China Software College Northeastern University Shenyang 110004 Liaoning China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430072 Hubei China Research Center of Spatial Information and Digital Engineering Wuhan University Wuhan 430072 Hubei China

We analyze the deficiencies of current application systems, and discuss the key requirements of distributed Geographie Information serviee （GIS）, We construct the distributed GIS on grid platform. Considering the flexibility and efficiency, we integrate the mobile agent technology into the system. We propose a new prototype system, the Geographic Information Grid System （GIGS） based on mobile agent. This system has flexible services and high performance, and improves the sharing of distributed resources. The service strategy of the system and the examples are also presented.

关键词： grid geographic information system （GIS） spatial data mobile agent

来源：评论

学校读者我要写书评

暂无评论

A novel evolutionary algorithm based on an orthogonal design for dynamic optimization problems (ODEA)

A novel evolutionary algorithm based on an orthogonal design...

引用

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005

作者： Zeng, SanYou De Garis, Hugo He, Jun Kang, LiShan Dept. of Computer Science Zhuzhou Institute of Technology 412008 Zhuzhou China Research Center for Space Science and Technology China China University of Geosciences 430074 Wuhan China Dept. of Computer Science Utah State University Logan UT 84322 United States School of Computer Science University of Birmingham Birmingham B15 2TT United Kingdom State Key Laboratory of Software Engineering Wuhan University 430072 Wuhan China

ISBN: (纸本)0780393635

This paper introduces an orthogonal evolutionary algorithm for dynamic optimization problems with continuous variables (called ODEA). Its population does not consist of individuals, but rather of "niches". Each niche selects the best solution found so far as its representative. An orthogonal design method is employed to find a potentially good solution that may become the representative of the niche in the mutation operator. We employ a complex benchmark to test the new approach. Numerical experiments show that the ODEA algorithm performs a lot better than the SOS (Self Organizing Scouts) algorithm [1]. © 2005 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Study of Multi media Streams Dynamic Rate Control Based on Fuzzy Adaptive PID

引用

The Journal of China Universities of Posts and Telecommunications 2005年第4期12卷 75-79页

作者： SUN Yan-fei ZHANG Shun-yi SHI Jin WANG Jiang-tao Jiangsu Province Engineering Research Center of Telecommunication dr Network Technology Nanjing University of Posts and TelecommunicationsNanjing 210003 P.y. China State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 P. R. China Department of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210003 P. R. China

A Multimedia streams dynamic rate control algorithm based on Fuzzy adaptive PID （MFPID） has been proposed to implement multimedia streams＇ end sending rate on-line self-regulating and smoothing, and to track system resources in time, so that it can avoid system＇s regulating oscillation and guarantee system＇s stability. And, some work has been done to analyze adaptive session model of multimedia streams, to implement future available bandwidth estimation of IP network, to achieve PID parameters＇ on-line self-tuning by fuzzy controlling. Simulation validated the theoretical results of MFPID.

关键词： multimedia transmission dynamic end sending rate PID adaptive regulating fuzzy parameter self-tuning

来源：评论

学校读者我要写书评

暂无评论

A novel evolutionary algorithm based on an orthogonal design for dynamic optimization problems (ODEA)

A novel evolutionary algorithm based on an orthogonal design...

引用

Congress on Evolutionary Computation

作者： San You Zeng H. de Garis Jun He LiShan Kang Research Center for Space Science & Technology China University of Geosciences Wuhan China Dept. of Computer Science Zhuzhou Institute of Technology Zhuzhou China School of Computer Science University of Birmingham Birmingham U. K State Key Laboratory of Software Engineering Wuhan University Wuhan China Dept. of Computer Science Utah State University Logan Utah USA Research Center for Space Science & Technology China University of Geoscience Wuhan China

This paper introduces an orthogonal evolutionary algorithm for dynamic optimization problems with continuous variables (called ODEA). Its population does not consist of individuals, but rather of "niches". Each niche selects the best solution found so far as its representative. An orthogonal design method is employed to find a potentially good solution that may become the representative of the niche in the mutation operator. We employ a complex benchmark to test the new approach. Numerical experiments show that the ODEA algorithm performs a lot better than the SOS (self organizing scouts) algorithm in Branke, Kaufler, Schmidt and Schmeck, (2000).

关键词： Evolutionary computation Algorithm design and analysis Design optimization Space technology Design methodology computer science Geology Genetic mutations Optimization methods Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Cost-Efficient Deep Neural network Placement in Edge Intelligence-Enabled Internet of Things

引用

ACM Transactions on Sensor networks 1000年

作者： Hao Tian Xiaolong Xu Hongyue Wu Qingzhan Zhao Jianguo Dai Maqbool Khan State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China Nanjing China School of Software Nanjing University of Information Science and Technology Nanjing Jiangsu China Nanjing China College of Intelligence and Computing Tianjin University Tianjin China Tianjin China Geospatial Information Engineering Research Center College of Information Science and Technology Shihezi University Shihezi Xinjiang China Shihezi China Department of IT and Computer Science Pak-Austria Fachhochschule Institute of Applied Sciences and Technology Haripur Pakistan Haripur Pakistan

Edge intelligence (EI) integrates edge computing and artificial intelligence empowering service providers to deploy deep neural networks (DNNs) on edge servers in proximity to users to provision intelligent applications (e.g., autonomous driving) for ubiquitous Internet of Things (IoT) in smart cities, which facilitates the quality of experience (QoE) of users and improves the processing and energy efficiency. However, considering DNN is typically computational-intensive and resource-hungry, conventional placement approaches ignore the influence of multi-dimensional resource requirements (processor, memory, etc.), which may degrade the real-time performance. Moreover, with the increasing scale of geo-distributed edge servers, centralized decision-making is still challenging to find the optimal strategies effectively. To overcome these shortcomings, in this paper we propose a game theoretic DNN placement approach in EI-enabled IoT. First, a DNN placement optimization problem is formulated to maximize system benefits, which is proven to be \(\mathcal {N}\mathcal {P}\)-hard and model the original problem as an exact potential game (EPG). Moreover, an EPG-based DNN model placement algorithm, named EPOL, is designed for edge servers to make sub-optimal strategies independently and theoretical analysis is possessed to guarantee the performance of EPOL. Finally, real-world dataset based experimental results corroborate the superiority and effectiveness of EPOL.

关键词： Edge intelligence DNN placement Game theory Internet of Things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：