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

On the nonlinearity of some T-functions

Journal of Information and Computational Science 2011年第11期8卷 2231-2237页

作者： Wang, Yan Hu, Yupu Li, Shunbo Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China Department of Mathematics Xi'an University of Architecture and Technology Xi'an 710055 China

Single cycle T-functions are newly proposed components in stream cipher. In order to verify if such function is suitable for cipher design, the cryptographic properties of single cycle T-function are discussed. Nonlinearity of the kth coordinate function of single cycle T-functions are studied according to the properties of single cycle T-function and the Walsh transform. Lower bounds and upper bounds are given at different situations. The results show that a single cycle T-function itself have 0 nonlinearity, but the most significant coordinate function can get high nonlinearity. © 2011 Binary Information Press.

关键词： Walsh transforms

来源：评论

学校读者我要写书评

暂无评论

Novel Differentiated Service Methodology Based on Constrained Allocation of Resources for Transparent WDM Backbone networks

Novel Differentiated Service Methodology Based on Constraine...

引用

Brazilian Symposium on computer networks and Distributed Systems (SBRC)

作者： Joana Sócrates-Dantas Regina Melo Silveira Davide Careglio José Roberto Amazonas Josep Solé-Pareta Wilson Vicente Ruggiero Laboratory of Computer Networks and Architecture (LARC) Laboratory of Communications and Signal (LCS) Escola Politécnica da Universidade de São Paulo (EPUSP) São Paulo Brazil Department of Computer Architecture (DAC) Technical University of Catalonia (UPC) Barcelona Spain

Current Internet traffic comprises diverse service requirements. Service providers differentiate connections characteristics according to demand's requirements and pricing policy. In this paper we propose a differentiated service methodology that implements constrained resources allocation according to demand's priority level for WDM networks. With our proposed mechanism higher priority connections are guaranteed a larger amount of resources, still, lower priority demands are guaranteed a minimum level of service.

关键词： Bandwidth WDM networks Multiprotocol label switching Resource management Proposals Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Improving QoS of web service composition by dynamic configuration

引用

Information Technology Journal 2010年第3期9卷 422-429页

作者： Yang, Huaizhou Li, Zengzhi Institute of Computer Architecture and Networks Xi'an Jiaotong University Xi'an 710049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In order to achieve self-adaptation to run-time environment and self-management of Web service composition, an extended hierarchical Petri net is presented to reflect the feasible configuration scheme of composite service. Being different from related works, the dynamic configuration scheme and execution process of Web service composition can be reflected together in the extended model. Furthermore, a rapid QoS calculation strategy of composite service is presented. Some important QoS calculation formulas are presented and proved. Based on the extended model and the QoS calculation strategy, a configuration with optimal QoS can be selected dynamically. The QoS of composite service is improved. The soundness and correctness of the dynamic configuration method are proved by simulation results and corresponding analysis. © 2010 Asian Network for Scientific Information.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Known User Continuous Authentication System for Consumer Application Software

Known User Continuous Authentication System for Consumer App...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Ines Brosso Graca Bressan Wilson V. Ruggiero College of Computation and Informatics Mackenzie Presbyterian University Sao Paulo Brazil Laboratory of Computer Architecture and Networks Department of Computer and Digital System Engineering Polytechnic of São Paulo University Brazil

This paper presents KUCAS (Known User Continuous Authentication System), a work-in-progress security system, that has a continuous authentication mechanism of users/consumers. The KUCAS system makes use of environmental context information, users behavior analysis, the behavior theories of Skinner and the Mathematical Confidence of Dempster-Shafer Evidences Theory, that establishes trust levels to authenticate the user by his behavior analysis, during an application software, in a specific domain of the computer networks, in a period of time. The dynamics of enclosed management in this system compares the current behavior with the user's previous behaviors description and with the trust restrictions. In case of indications of changes in the user's behavior, the system provides the behavior analysis of the user using database restrictions information. If there are uncertainties and divergences, mechanisms of security and alert signals are triggered.

关键词： Authentication Application software Information security Information analysis Data security computer security Humans computer networks Peer to peer computing History

来源：评论

学校读者我要写书评

暂无评论

Extended GSPN modeling and reduction algorithms for rapid performance analysis of service composition system

Extended GSPN modeling and reduction algorithms for rapid pe...

引用

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)

作者： Huaizhou Yang Zengzhi Li State Key Laboratory of Networking and Switching Beijing University of Posts and Telecommunications Beijing China Institute of Computer Architecture & Networks Xi''an Jiaotong University Xi'an China

ISBN: (纸本)9781424447374;9781424447541

A service composition system can be constructed via integration and collaboration of many component services. The system performance needs to be obtained rapidly for the purpose of dynamic and adaptive management. An EGSPN (extended generalized stochastic Petri net) model is presented to reflect the service composition system with complex timing constraints in a compact and comprehensible manner. The various categories of timing constraints are associated to place, transition and arc of EGSPN respectively. Furthermore, in order to accelerate the calculation of system performance and to avoid the explosion of state space, a set of model reduction rules are presented. The corresponding reduction algorithms are designed to achieve automatic model reduction. The experiments based on multiform models indicate that a large model can be reduced within satisfying period. The algorithms can help to make rapid performance analysis of service composition system.

关键词： Performance analysis System performance Timing Reduced order systems Collaboration Stochastic systems Acceleration Explosions State-space methods Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An Adaptive UAV Scheduling Process to Address Dynamic Mobile Network Demand Efficiently

An Adaptive UAV Scheduling Process to Address Dynamic Mobile...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Ruide Cao Jiao Ye Jin Zhang Qian You Chao Tang Yan Liu Yi Wang Institute of Future Networks DET of Heyuan School of Architecture and Urban Planning SZU Department of Computer Science and Engineering Peng Cheng Laboratory School of Design SUSTech

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Benefiting from high flexibility and probability of line-of-sight, deploying unmanned aerial vehicles (UAV s) as aerial access points has emerged as a promising solution for ensuring reliable wireless connectivity in crowded events. This paper introduces a UAV scheduling process adaptive to dynamic mobile network demand, including three phases. In the sensing phase, the user distribution is sensed, and user number thresholds are set to determine whether UAV assistance is needed. The planning phase presents an enhanced mean shift algorithm to find suitable locations to deploy UAVs with a dynamic bandwidth derived from the user distribution, the UAV's maximum capacity, and the UAV's maximum throughput. The deploying phase dispatches and recalls UAV s based on planning results. Comprehensive simulation experiments are conducted on OMNeT ++ using real-world data. Results show that the proposed process shows great adaptivity, with an efficiency increase of 18.7% and a fairness increase of 28.9 % compared to the existing related works on average.

关键词： Adaptive scheduling Adaptive systems Heuristic algorithms Bandwidth Autonomous aerial vehicles Dynamic scheduling Throughput

来源：评论

学校读者我要写书评

暂无评论

An Efficient Pricing Based Protocol for Broadcasting in Wireless Ad hoc networks

An Efficient Pricing Based Protocol for Broadcasting in Wire...

引用

International Conference on Communication Systems Software and Middleware (COMSWARE)

作者： N.R. Suri Y. Narahari D. Manjunath Department of Computer Science and Automation Indian Institute of Science Bangalore India Networks Architecture Laboratory Electrical and Communications Engineering Indian Institute of Science Bangalore India

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called immediate predecessor node pricing mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol

关键词： Pricing Wireless application protocol Broadcasting Mobile ad hoc networks Game theory Power system reliability Intelligent networks Costs Distributed computing Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Mean Shift Based Collaborative Localization with Dynamically Clustering for Wireless Sensor networks

Mean Shift Based Collaborative Localization with Dynamically...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Quan Zhou Xiaowei Li Yongjun Xu Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China Institute of Computing Technology Laboratory of Sensor Networks Chinese Academy and Sciences Beijing China

Mean shift is a nonparametric method to estimate the density gradient, which iteratively computes the mean of observations and shifts to the centroid until reach a predefined end condition. This paper proposes a mean shift based scheme for localization and tracking in wireless sensor *** shift is a generalized framework, and range-free centroid and range-based W-Centrod are both the special cases of this generalized framework. A dynamically clustering protocol is proposed to support the generalized framework. Analysis and simulation results show that the communication overhead and jitter are reduced to 1/3 of traditional algorithms. The positioning accuracy of proposed algorithm with optimal weight increases 28% and 11% in comparison to Centroid and W-Centroid.

关键词： Wireless sensor networks computer networks Clustering algorithms Laboratories Protocols Equations Mobile communication Mobile computing International collaboration computer architecture

来源：评论

学校读者我要写书评

暂无评论

Experimental investigation of multi-wavelength clock recovery based on a quantum-dot SOA at 40 Gb/s

Experimental investigation of multi-wavelength clock recover...

引用

Signal Processing in Photonic Communications, SPPCom 2010

作者： Spyropoulou, M. Bonk, R. Hillerkuss, D. Pleros, N. Vallaitis, T. Freude, W. Tomkos, I. Leuthold, J. Aristotle University of Thessaloniki Department of Informatics Computer Architecture and Communications Laboratory Thessaloniki 54142 Greece Institute of Photonics and Quantum Electronics Karlsruhe Institute of Technology Engesserstr. 5 76131 Karlsruhe Germany Athens Information Technology High speed networks and optical communications Markopoulou Av. 19002 Peania-Attica Greece

We study single and multi-wavelength clock recovery functionality based on a fabry-pérot filter followed by a quantum-dot SOA at 40 Gb/s and we demonstrate its performance for various pseudo-random binary sequenc... 详细信息

ISBN: (纸本)9781557528964

关键词： Nanocrystals

来源：评论

学校读者我要写书评

暂无评论

Smallest Enclosing Circle Based Localization Approach for Wireless Sensor networks

Smallest Enclosing Circle Based Localization Approach for Wi...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Quan Zhou Xiaowei Li Yongjun Xu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China Laboratory of Sensor Networks Institute of Computing Technology Chinese Academy and Sciences Beijing China

A novel range-free localization approach, smallest enclosing Circle based Localization (SECL), has been proposed. This approach uses the center of smallest enclosing circle of neighboring anchor nodes to estimate the position of target. Comparing to centroid, SECL considers the geometrical coverage of anchors rather than the mass center of them. Consequently, SECL is robust to imperfect topology, especially when the topology of anchors is depolyed unevenly. Simulation results show that SECL outperforms Centroid by an average of 10%, and even better when the topology is not uniform.

关键词： Wireless sensor networks Network topology computer networks Laboratories Robustness Computational modeling Equations Hardware Mobile communication Mobile computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：