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

International Conference on Broadband Networks (BroadNets)

作者： F. Farahmand Q. Zhang J.P. Jue Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT USA Mathematical Sciences and Applied Computing Arizona State University USA Department of Computer Science University of Texas Dallas Richardson TX USA

In this paper we address the problem of data burst grooming in optical burst-switched (OBS) networks. In OBS networks IP packets with the same edge node destination are assembled into larger packets called data bursts. Depending on the core node's switching technology, data bursts are required to have a minimum length. On the other hand, each IP packet in a burst has a time delay constraint, called maximum end-to-end delay, which determines the upper time limit before which the packet must reach its destination. Thus, a data burst cannot wait indefinitely until sufficient number of IP packets are assembled and the minimum burst length requirement is met. In order to satisfy the packet maximum end-to-end delay requirement, many bursts will be timed out and released before they reach the minimum length requirement. Under such circumstances, padding overhead must be added to these short bursts, called sub-bursts. Excessive padding results in high overhead and high data burst blocking probability. One approach to minimize the amount of padding overhead, while maintaining the end-to-end delay requirement of IP packets, is to groom multiple sub-bursts together. That is, sub-bursts with different destinations are aggregated together at the edge node and transmitted as a single burst until they are separated at some downstream node. In this paper we present an edge node architecture enabling burst grooming capability. We also develop two basic grooming approaches, namely no-routing-overhead (NoRO) and minimum-total-overhead (MinTO). Through a comprehensive simulation study we show that, in general, our proposed grooming algorithms can significantly improve the performance compared to the case of no grooming. However, careful considerations must be given to network loading condition and the number of sub-bursts allowed to be groomed together. We show that although simple greedy algorithms can reduce network overhead, they may alter the traffic characteristics and increase it

关键词： Intelligent networks Optical fiber networks Assembly Optical network units Delay effects Optical packet switching Computer networks Optical computing Telecommunication traffic Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A closed-loop rate-based contention control for optical burst switched networks

A closed-loop rate-based contention control for optical burs...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： F. Farahmand Qiong Zhang J.P. Jue Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT USA Mathematical Sciences and Applied Computing Arizona State University USA Department of Computer Science University of Texas Dallas Richardson TX USA

In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability

关键词： Optical control Optical fiber networks Optical feedback Optical network units Optical packet switching Optical losses Optical buffering Computer networks Optical computing Switches

来源：评论

学校读者我要写书评

暂无评论

An integrated and adaptive decision-support framework for high-tech manufacturing and service networks

An integrated and adaptive decision-support framework for hi...

引用

Simulation Winter Conference

作者： P. Lendermann M.Y.H. Low Boon Ping Gan N. Julka Lai Peng Chan S.J. Turner Wentong Cai Xiaoguang Wang Loo Hay Lee T. Hung S.J.E. Taylor L.F. McGinnis S. Buckley Singapore Institute of Manufacturing Technology Singapore Singapore Parallel and Distributed Computing Centre Nanyang Technological University Singapore Singapore Department of Industrial and Systems Engineering National University of Singapore Singapore Institute of High Performance Computing Singapore Singapore Centre for Applied Simulation Modelling School of Information Systems Computing and Maths Brunei University Uxbridge Middlesex UK School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta GA USA

This article describes the results of one of the ten pilot programmes under the integrated manufacturing and service systems (IMSS) initiative pursued by the Agency for Science, technology and Research (A* STAR) in Singapore. The objective of this particular programme is to investigate how design, analysis, enhancement and implementation of critical business processes in a manufacturing and service network can be realised using one single simulation/application framework. The overall architecture of the framework outlines how commercial simulation packages and Web-service based business process application components would have to be connected through a commercial application framework to achieve maximum leverage and re-usability of the applications involved. In the pilot phase of this programme, research issues were also addressed with regard to mechanisms for interoperation between commercial simulation packages, symbiotic interaction between simulation-based decision support components and physical systems, and simulation speed-up through multi-objective optimal computing budget allocation techniques on a grid infrastructure.

关键词： Business Logistics Computational modeling Job shop scheduling Manufacturing processes Virtual manufacturing Packaging Drives Distributed computing Computer industry

来源：评论

学校读者我要写书评

暂无评论

Convergence conditions for random quantum circuits

引用

Physical Review A 2005年第6期72卷 060302(R)-060302(R)页

作者： Joseph Emerson Etera Livine Seth Lloyd Institute for Quantum Computing and Department of Applied Math University of Waterloo 200 University Avenue West Waterloo Ontario Canada N2L 3G1 Perimeter Institute for Theoretical Physics 31 Caroline Street North Waterloo Ontario Canada N2L 2Y5 Department of Mechanical Engineering Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge Massachusetts 02139 USA

Efficient methods for generating pseudorandomly distributed unitary operators are needed for the practical application of Haar-distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudorandom ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group, though the rate for uniform convergence must decrease exponentially with the number of qubits. We describe how the rate of convergence for test functions associated with specific randomization tasks leads to weaker convergence conditions that may allow efficient random circuit constructions.

关键词： Networks (circuits)

来源：评论

学校读者我要写书评

暂无评论

Grid portal interface for interactive use and monitoring of high-throughput proteome annotation

引用

First International Workshop on Life Science Grid, LSGRID 2004 - Grid computing in Life Science

作者： Shahab, Atif Chuon, Danny Suzumua, Toyotaro Li, Wilfred W. Byrnes, Robert W. Tanaka, Kouji Ang, Larry Matsuoka, Satoshi Bourne, Philip E. Miller, Mark A. Arzberger, Peter W. Bioinformatics Institute 30 Biopolis Street #07-01 Matrix Singapore 138671 Singapore Dept. of Mathematical and Computing Sciences 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Global Scientific Information and Computing Center 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan Research and Development for Applied Advanced Computational Science and Technology Japan Science and Technology Agency 4-1-8 Honcho Kawaguchi Saitama 332-0012 Japan Department of Pharmacology San Diego Supercomputer Center University of California San Diego 9500 Gilman Drive San Diego CA 92093 United States Life Sciences Initiatives San Diego Supercomputer Center University of California San Diego 9500 Gilman Drive San Diego CA 92093 United States

ISBN: (纸本)3540252088

High-throughput proteome annotation refers to the activity of extracting information from all proteins in a particular organism using bioinformatics software on a high performance computing platform such as the grid. The Encyclopedia of Life (EOL) project [1] aims to catalog all proteins in all species for public benefits using an Integrative Genome Annotation Pipeline [2] (iGAP). The intrinsic complexity of the pipeline makes iGAP an ideal life sciences application to drive grid software development. It is a flagship application for the TeraGrid project [3]. The deployment of iGAP on the grid using grid middleware and mediator software has been described previously [4]. The heterogeneous and distributed computing environment on the grid requires an interactive user interface where jobs may be submitted and monitored. Here we describe our international collaborative effort in creating a grid portal solution for grid computing in life sciences under the auspices of PRAGMA [5]. Specifically, the development of GridMonitor for interactive monitor of iGAP workflow, and the use of a GridSpeed [6] generated iGAP application portal are described. The portal solution was part of the EOL demonstration at Supercomputing 2003 (SC'03) [7], where resources from 6 institutions on 5 continents are utilized to annotate more than 36,000 proteins from various species. It is a testimony to the necessity and expediency for international collaboration in an increasingly global grid computational environment to advance life sciences research. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Interfaces (computer)

来源：评论

学校读者我要写书评

暂无评论

Study on optimization of agent initial positions in land combat simulation

引用

自然科学进展(英文版) 2004年第3期14卷 257-261页

作者： WU Chunguo LIANG Yanchun LEE Heow Pueh LU Chun Yang Xiaowei College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore Department of Applied Mathematics South China University of Technology Guangzhou 510640 China Centre for ACES Department of Mechanical Engineering National University of Singapore 119260 Singapore

The use of computational-intelligence-based techniques in the optimization of agent initial positions in land combat simulations is studied. A novel method for the reduction of support vectors in the support vector machine (SVM) is presented. The optimization on the width of the Gaussian kernel function and the combination of the SVM with the radial basis function neural network are performed in the proposed method. Simulation results show that the proposed method can improve the running efficiency drastically compared with that using the traditional SVM with the same precision. We also summarize and present some experiences and trends in the study on the optimization problem in land combat simulation.

关键词： multi-agent support vector machine radial basis function genetic algorithm regression

来源：评论

学校读者我要写书评

暂无评论

Estimate of error bounds in the improved support vector regression

引用

自然科学进展（英文版） 2004年第4期14卷 362-364页

作者： SUN Yanfeng LIANG Yanchun WU Chunguo Yang Xiaowei LEE Heow Pueh LIN Wu Zhong College of Computer Science and Technology Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Institute of High Performance Computing Singapore 117528Singapore Department of Applied Mathematics South China University of TechnologyGuangzhou 510640China Centre for ACES Department of Mechanical EngineeringNational University of Singapore119260Singapore Institute of High Performance Computing Singapore 117528Singapore

An estimate of a generalization error bound of the improved support vector regression(SVR)is provided based on our previous *** boundedness of the error of the improved SVR is proved when the algorithm is applied to t... 详细信息

关键词： support vector regression(SVR) generalization error approximation error estimation error

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to: Design and analysis of planar printed microwave and PBG filters using an FDTD method

引用

Microelectronics Journal 2005年第1期36卷 97-97页

作者： Ming-Sze Tong Yilong Lu Yinchao Chen Mingwu Yang Qunsheng Cao Viktor Krozer Rudiger Vahldieck School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue Singapore Singapore 639798 Department of Electrical Engineering Swearingen Engineering Center University of South Carolina Columbia SC 29208 USA Anhui Institute of Optics and Fine Mechanics Hefei China Department of Applied Physics Hefei University of Technology Hefei China Army High Performing Computing Research Center Institute of Technology University of Minnesota Minneapolis MN 55415 USA EMI/Ørsted Technical University Denmark Ørstedplads DK-2800 Kgs. Lyngby Denmark Institute of Field Theory and High Frequency Engineering Swiss Federal Institute of Technology CH-8092 Zurich Switzerland

来源：评论

学校读者我要写书评

暂无评论

EDGE stabilization: An interior penalty method for the incompressible navier-stokes equation

EDGE stabilization: An interior penalty method for the incom...

引用

European Congress on Computational Methods in applied Sciences and Engineering, ECCOMAS 2004

作者： Burman, Erik Fernández, Miguel A. Hansbo, Peter Institute of Analysis and Scientific Computing EPFL CH-f 015 Lausanne Switzerland INRIA-Rocquencourt Projet REO/BANG F-78153 Le Chesnay cedex France Department of Applied Mechanics Chalmers University of Technology SE-41296 Göteborg Sweden

In this paper we present an extension of the recently introduced continuous interior penalty method to the incompressible Navier-Stokes equations. The method consists of a standard Galerkin formulation using equal order interpolation for pressure and velocities. To counter instabilities due to the pressure/velocity coupling or due to high local Reynolds number we add a stabilization term giving L2-control of the jump of the gradient over element edges. Boundary conditions are imposed in a weak sense using a consistent penalty formulation due to Nitsche. We report on theoretical results, discuss the relation to existing methods, and give some numerical examples.

关键词： Stabilization

来源：评论

学校读者我要写书评

暂无评论

Enhancing performance of the IEEE 802.11 distributed coordination function via packet bursting

Enhancing performance of the IEEE 802.11 distributed coordin...

引用

IEEE Globecom Workshops

作者： V. Vitsas P. Chatzimisios A.C. Boucouvalas P. Raptis K. Paparrizos D. Kleftouris Department of Information Technology Technological Education Institute Thessaloniki Greece Multimedia Communications Research Group School of Design Engineering and Computing Bournemouth University Poole UK Department of Applied Informatics University of Macedonia Thessaloniki Greece

During the past few years, wireless local area networks (WLANs) have become extremely popular. The IEEE 802.11 protocol is the dominating standard for WLANs employing the distributed coordination function (DCF) as its essential medium access control (MAC) mechanism. This paper presents a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay and the packet drop probability for both the basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. The mathematical model is used to study the effectiveness of the RTS/CTS scheme at high data rates and the performance improvements of transmitting a burst of packets after winning the contention for medium access. Packet bursting considerably increases both throughput and packet delay performance but lowers the short-term fairness on medium access.

关键词： Media Access Protocol Throughput Delay Wireless LAN Access protocols Performance analysis Mathematical analysis Probability Analytical models Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：