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

IEEE International Symposium on Industrial Electronics (ISIE)

作者： R. Antonic Z. Vukic O. Kuljaca Faculty of Maritime Studies University of Split Split Croatia Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia Department of Advanced Technology School of Agriculture and Applied Sciences Alcorn State University USA

来源：评论

学校读者我要写书评

暂无评论

Data burst grooming in optical burst-switched networks

Data burst grooming in optical burst-switched networks

引用

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

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Revisiting distributed simulation and the grid: a panel

Revisiting distributed simulation and the grid: a panel

引用

International Workshop/Symposium on Distributed Simulation and Real-Time Applications (DS-RT)

作者： S.J.E. Taylor J.M. Puller G. Fox R. Fujimoto D.J. Roberts G.K. Theodoropoulos Centre for Applied Simulation Modeling Brunei University Uxbridge Middlesex UK Community Grids Laboratory Indiana University Bloomington IN USA Centre for Virtual Environments Business House University of Sanford Manchester UK College of Computing Georgia Institute of Technology Atlanta GA USA Midlands e-Science Centre University of Binningham Birmingham UK

Summary form only given. The grid, or grid computing, provides a new and unrivalled technology for large scale distributed simulation as it enables collaboration and the use of distributed computing resources. Last year at DS-RT 2004 a panel was convened to consider the impact of the grid on distributed simulation. Four members presented their views of this area and together they tried to identify the main research issues involved in applying grid technology to distributed simulation and the key future challenges that need to be solved to achieve this goal. These challenges included not only technical ones, but also social ones such as management methodology and the development of standards. This year we revisit this fast changing technology and ask the questions: 1) What major changes has grid computing had over the past year?; 2) How can distributed simulation and related applications benefit from grid computing?; 3) What are the barriers to this?; 4) Are there alternative new technologies that would be a better ROI for distributed simulation than grid computing?.

关键词： Computational modeling Grid computing USA Councils Distributed computing Laboratories Educational institutions Virtual environment Large-scale systems Collaboration Standards development

来源：评论

学校读者我要写书评

暂无评论

Venus: A system for novelty detection in video streams with learning

Venus: A system for novelty detection in video streams with ...

引用

Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2004

作者： Gaborski, Roger S. Vaingankar, Vishal S. Chaoji, Vineet S. Teredesai, Ankur M. Laboratory for Applied Computing Rochester Institute of Technology 102 Lomb Memorial Drive Rochester NY 14623

ISBN: (纸本)1577352017

Novelty detection in video is a rapidly developing application domain within computer vision. The motivation behind this paper is a learning based framework for detecting novelty within video. Since, humans have a general understanding about their environment and possess a sense of distinction between what is normal and abnormal about the environment based on our prior experience;any aspect of the scene that does not fit into this definition of normalcy tends to be labeled as a novel event. In this paper, we propose a computational learning based framework for novelty detection and provide the experimental evidence to describe the results obtained by this framework. To begin with the framework extracts low-level features from scenes, based on the focus of attention theory and then combines unsupervised learning techniques such as clustering with habituation theory to emulate the cognitive aspect of learning.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Efficient web change monitoring with page digest

Efficient web change monitoring with page digest

引用

Thirteenth International World Wide Web Conference Proceedings, WWW2004

作者： Buttler, David Rocco, Daniel Liu, Ling Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94550 College of Computing Georgia Institute of Technology Atlanta GA 30332

ISBN: (纸本)158113844X

The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is increasingly difficult for individuals to keep abreast of fresh information. In this paper we describe an approach for building a system for efficiently monitoring changes to Web documents. This paper has three main contributions. First, we present a coherent framework that captures different characteristics of Web documents. The system uses the Page Digest encoding to provide a comprehensive monitoring system for content, structure, and other interesting properties of Web documents. Second, the Page Digest encoding enables improved performance for individual page monitors through mechanisms such as short-circuit evaluation, linear time algorithms for document and structure similarity, and data size reduction. Finally, we develop a collection of sentinel grouping techniques based on the Page Digest encoding to reduce redundant processing in large-scale monitoring systems by grouping similar monitoring requests together. We examine how effective these techniques are over a wide range of parameters and have seen an order of magnitude speed up over existing Web-based information monitoring systems.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Progress in adjoint error correction for integral functionals

引用

computing and Visualization in Science 2004年第2-3期6卷 113-121页

作者： Giles, Michael B. Pierce, Niles Süli, Endre Oxford University Computing Laboratory Oxford OX1 3QD United Kingdom Applied and Computational Mathematics California Institute of Technology Pasadena CA 91125 United States

When approximating the solutions of partial differential equations, it is a few key output integrals which are often of most concern. This paper shows how the accuracy of these values can be improved through a correction term which is an inner product of the residual error in the original p.d.e. and the solution of an appropriately defined adjoint p.d.e. A number of applications are presented and the challenges of smooth reconstruction on unstructured grids and error correction for shocks are discussed. © Springer-Verlag 2004.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

Efficient web change monitoring with page digest 04

Efficient web change monitoring with page digest

引用

13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

作者： Buttler, David Rocco, Daniel Liu, Ling Lawrence Livermore National Laboratory Center for Applied Scientific Computing LivermoreCA94550 United States College of Computing Georgia Institute of Technology AtlantaGA30332 United States

ISBN: (纸本)1581139128

The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is increasingly difficult for individuals to keep abreast of fresh information. In this paper we describe an approach for building a system for efficiently monitoring changes toWeb documents. This paper has three main contributions. First, we present a coherent framework that captures different characteristics of Web documents. The system uses the Page Digest encoding to provide a comprehensive monitoring system for content, structure, and other interesting properties of Web documents. Second, the Page Digest encoding enables improved performance for individual page monitors through mechanisms such as short-circuit evaluation, linear time algorithms for document and structure similarity, and data size reduction. Finally, we develop a collection of sentinel grouping techniques based on the Page Digest encoding to reduce redundant processing in large-scale monitoring systems by grouping similar monitoring requests together. We examine how effective these techniques are over a wide range of parameters and have seen an order of magnitude speed up over existing Web-based information monitoring systems.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

Semantic model for artificial intelligence based on molecular computing

Semantic model for artificial intelligence based on molecula...

引用

8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2004

作者： Tsuboi, Yusei Ibrahim, Zuwairie Ono, Osamu Control System Laboratory Institute of Applied DNA Computing Graduate School of Science & Technology Meiji University 1-1-1 Higashimita Tama-ku Kawasaki-shiKanagawa214-8671 Japan

ISBN: (纸本)9783540301325

In this work, a new DNA-based semantic model is proposed and described theoretically. This model, referred to as ‘semantic model based on molecular computing’ (SMC) has the structure of a graph formed by the set of all attribute-value pairs contained in the set of represented objects, plus a tag node for each object. Attribute layers composed of attribute values then line up. Each path in the network, from an initial object-representing tag node to a terminal node represents the object named on the tag. Application of the model to a reasoning system was proposed, via virtual DNA operation. On input, objectrepresenting dsDNAs will be formed via parallel self-assembly, from encoded ssDNAs representing (value, attribute)-pairs (nodes), as directed by ssDNA splinting strands representing relations (edges) in the network. The computational complexity of the implementation is estimated via simple simulation, which indicates the advantage of the approach over a simple sequential model. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Self assembly

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：