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

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

作者： Yan Gu Richard Fujimoto Computational Science and Engineering Division College of Computing Georgia Institute of Technology Atlanta GA USA

Network emulation has been widely used to aid in the development and evaluation of real time applications. Traditional emulation tools based on a single node machine or a cluster of machines cannot satisfy today's requirements for testing real time applications distributed over wide area networks. ROSENET is a novel network emulation system that exploits a remote high fidelity simulation to provide scale and accuracy for a low fidelity emulator serving a locally executing real time application. The distributed emulators and simulators in the ROSENET system coordinate by periodically updating their simulation/emulation status using network models. We evaluate the performance of an implementation of ROSENET using the NIST Net emulator and GTNetS simulator. Results show that ROSENET provides a promising approach to network emulation supporting accuracy and scale while meeting real-time constraints. We also illustrate the procedures using ROSENET to evaluate a contemporary real-time distributed application Skype and present experimental results.

关键词： Emulation computational modeling Real time systems Telecommunication traffic Traffic control Application software Computer networks Predictive models Scalability Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Searching using probabilistic hints in unstructured peer-to-peer networks

Searching using probabilistic hints in unstructured peer-to-...

引用

19th IASTED International Conference on Parallel and Distributed computing and Systems

作者： Li, Xiuqi Wu, Jie Xu, Jun Department of Computer Science and Engineering Florida Atlantic University Boca Raton FL 33431 United States College of Computing Georgia Institute of Technology Atlanta GA 30332 United States

ISBN: (纸本)9780889867048

Peer-to-peer (P2P) networking is designed for sharing resources at the edge of the Internet. Searching in file-sharing P2P networks has been an important research topic, and it has drawn significant attention recently. Hints can be utilized to improve query success rates. Determining how to efficiently and effectively propagate hints is a challenging issue. In this paper, we propose a searching protocol called HS-SDBF (Hint-based Search by Scope Decay Bloom Filter) that addresses this issue. HS-SDBF uses a data structure named SDBF (Scope Decay Bloom Filter) to represent and propagate probabilistic hints. Compared to existing proactive schemes, HS-SDBF can answer many more queries successfully at a lower amortized cost considering both the query traffic and hint propagation traffic. The experimental results support the performance improvement of our protocol.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Reducing Data Loss in Optical Burst-Switched Networks Using Adaptive Burst Cloning

Reducing Data Loss in Optical Burst-Switched Networks Using ...

引用

International Conference on Advanced computing and Communications (ADCOM)

作者： N. Sreenath N. Devendra Balaji Palanisamy Department of Computer Science & Engineering Pondicherry Engineering College Pondicherry India College of Computing Georgia Institute of Technology USA

In this paper, we introduce a loss reduction scheme, Adaptive Burst cloning, as a technique to ensure service-guarantees in optical burst-switched (OBS) networks. The basic idea is to replicate a burst and send its duplicate copies through the network in parallel. Incase the original burst gets lost, the cloned burst may still be able to reach the destination. Unlike the existing burst cloning techniques, Adaptive Burst Cloning selects the clone node and the number of cloned bursts dynamically. Due to dynamic selection of the clone node and the number of cloned bursts, utilization of network resources is considerably low, and as a consequence, burst loss due to resource contention is significantly reduced. We develop a network level simulation model to investigate the proposed Adaptive Burst Cloning loss recovery mechanism and compare its performance with the existing static burst cloning technique. Our results show that the proposed mechanism significantly reduces the packet loss in an optical burst-switched network with relatively lesser resource utilization. Keywords: Optical Burst Switched Networks, Burst Cloning, Burst loss, Adaptive Routing.

关键词： Optical losses Adaptive optics Optical fiber networks Adaptive systems Cloning Optical buffering Optical wavelength conversion Optical packet switching Computer networks Optical computing

来源：评论

学校读者我要写书评

暂无评论

Synthesizing goal-directed actions from a library of example movements

Synthesizing goal-directed actions from a library of example...

引用

IEEE-RAS International Conference on Humanoid Robots

作者： Ales Ude Marcia Riley Bojan Nemec Andrej Kos Tamim Asfour Gordon Cheng Jožýef Stefan Institute Department of Automatics Biocybernetics and Robotics Ljubljana Slovenia Department of Humanoid Robotics and Computational Neuroscience ATR Computational Neuroscience Laboratories Kyoto Japan College of Computing Georgia Institute of Technology Atlanta GA USA Institute of Computer Science and Engineering c/o Technologiefabrik University of Karlsruhe Karlsruhe Germany Japan Science and Technology Agency ICORP Computational Brain Project Kawaguchi Saitama Japan

We present a new learning framework for synthesizing goal-directed actions from example movements. The approach is based on the memorization of training data and locally weighted regression to compute suitable movements for a large range of situations. The proposed method avoids making specific assumptions about an adequate representation of the task. Instead, we use a general representation based on fifth order splines. The data used for learning comes either from the observation of events in the Cartesian space or from the actual movement execution on the robot. Thus it informs us about the appropriate motion in the example situations. We show that by applying locally weighted regression to such data, we can generate actions having proper dynamics to solve the given task. To test the validity of the approach, we present simulation results under various conditions as well as experiments on a real robot.

关键词： Libraries Humanoid robots Physics computing Hidden Markov models Orbital robotics Robotics and automation Cybernetics Laboratories Computer science Data engineering

来源：评论

学校读者我要写书评

暂无评论

Discovering Temporal Communities from Social Network Documents

Discovering Temporal Communities from Social Network Documen...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Ding Zhou Isaac Councill Hongyuan Zha C. Lee Giles Computer Science and Engineering Pennsylvania State University University Park PA USA Information Science and Technology Pennsylvania State University University Park PA USA College of Computing Georgia Institute of Technology Atlanta GA USA

This paper studies the discovery of communities from social network documents produced over time, addressing the discovery of temporal trends in community memberships. We first formulate static community discovery at a single time period as a tripartite graph partitioning problem. Then we propose to discover the temporal communities by threading the statically derived communities in different time periods using a new constrained partitioning algorithm, which partitions graphs based on topology as well as prior information regarding vertex membership. We evaluate the proposed approach on synthetic datasets and a real-world dataset prepared from the CiteSeer.

关键词： Social network services Communities Computer networks Partitioning algorithms Cost function Clustering algorithms Data mining Computer science Data engineering Information science

来源：评论

学校读者我要写书评

暂无评论

STATISTICAL SHAPE ANALYSIS OF BRAIN STRUCTURES USING SPHERICAL WAVELETS

STATISTICAL SHAPE ANALYSIS OF BRAIN STRUCTURES USING SPHERIC...

引用

IEEE International Symposium on Biomedical Imaging

作者： D. Nain M. Styner M. Niethammer J.J. Levitt M.E. Shenton G. Gerig A. Bobick A. Tannenbaum College of Computing Georgia Technology Research Institute Atlanta USA Department of Computer Science and Department of Psychiatry UNC Chapel Hill USA Department of Psychiatry Harvard Medical School VAMC-Brockton Boston USA Schools of Electrical & Computer and Biomedical Engineering Georgia Technology Research Institute Atlanta USA

ISBN: (纸本)9781424406715

We present a novel method of statistical surface-based morphometry based on the use of non-parametric permutation tests and a spherical wavelet (SWC) shape representation. As an application, we analyze two brain structures, the caudate nucleus and the hippocampus, and compare the results obtained to shape analysis using a sampled point representation. Our results show that the SWC representation indicates new areas of significance preserved under the FDR correction for both the left caudate nucleus and left hippocampus. Additionally, the spherical wavelet representation provides a natural way to interpret the significance results in terms of scale in addition to knowing the spatial location of the regions

关键词： Shape Brain Wavelet analysis Surface morphology Hippocampus Biomedical computing Psychiatry Biomedical imaging Surface waves Testing

来源：评论

学校读者我要写书评

暂无评论

The computing ontology-application in education 07

The computing ontology-application in education

引用

2007 Working Group Reports on ITiCSE on Innovation and technology in Computer science Education, ITiCSE-WGR 2007

作者： Cassel, Lillian N. Davies, Gordon Fone, William Hacquebard, Anneke Impagliazzo, John Leblanc, Richard Little, Joyce Currie McGettrick, Andrew Pedrona, Michela Department of Computing Sciences Villanova University VillanovaPA19085 1699 United States Department of Computing Engineering and Technology Staffordshire University Stafford StaffordshireST18 0DP United Kingdom Department of Informatics and Education Keppelseweg 34 Hummelo6999 AR Netherlands Department of Computer Science Hofstra University HempsteadNY11549 United States Georgia Institute of Technology College of Computing DawsonvilleGA30534 United States Department of Computer and Information Sciences Towson University United States Department of Computer and Information Sciences University of Strathclyde Glasgow United Kingdom Department of Software Engineering ETH Zentrum RZ J8 ZurichCH-8092 Switzerland

ISBN: (纸本)9781450378420

Working Group 3 at ITiCSE 2007 continued the ongoing work of the Ontology of computing project. The working group brought several new people into the project and addressed areas of the ontology of particular interest to these participants. In particular, the group worked on the Ontology sections related to History of computing, computing Security and Social and Ethical issues. With the intention of applying the ontology to the support of curriculum development in mind, the group also reviewed and discussed proposed means of presenting a visual representation of the ontology. There was also some work on the present structure of the ontology and future possibilities.

关键词： History

来源：评论

学校读者我要写书评

暂无评论

Co-ranking Authors and Documents in a Heterogeneous Network

Co-ranking Authors and Documents in a Heterogeneous Network

引用

IEEE International Conference on Data Mining (ICDM)

作者： Ding Zhou Sergey A. Orshanskiy Hongyuan Zha C. Lee Giles Computer Science and Engineering Pennsylvania State University University Park PA USA Department of Mathematics Pennsylvania State University University Park PA USA College of Computing Georgia Institute of Technology Atlanta GA USA Information Sciences and Technology Pennsylvania State University University Park PA USA

Recent graph-theoretic approaches have demonstrated remarkable successes for ranking networked entities, but most of their applications are limited to homogeneous networks such as the network of citations between publications. This paper proposes a novel method for co-ranking authors and their publications using several networks: the social network connecting the authors, the citation network connecting the publications, as well as the authorship network that ties the previous two together. The new co-ranking framework is based on coupling two random walks, that separately rank authors and documents following the PageRankparadigm. As a result, improved rankings of documents and their authors depend on each other in a mutually reinforcing way, thus taking advantage of the additional information implicit in the heterogeneous network of authors and documents.

关键词： Social network services Joining processes Bibliometrics Performance evaluation Data mining Computer science Data engineering Computer networks Application software Web pages

来源：评论

学校读者我要写书评

暂无评论

Aurora: An approach to high throughput parallel simulation 06

Aurora: An approach to high throughput parallel simulation

引用

20th Workshop on Principles of Advanced and Distributed Simulation, PADS 2006

作者： Park, Alfred Fujimoto, Richard M. Computational Science and Engineering Division College of Computing Georgia Institute of Technology Atlanta GA 30332-0280 United States

ISBN: (纸本)0769525873

A master/worker paradigm for executing large-scale parallel discrete event simulation programs over network-enabled computational resources is proposed and evaluated. In contrast to conventional approaches to parallel simulation, a client/server architecture is proposed where clients (workers) repeatedly download state vectors of logical processes and associated message data from a server (master), perform simulation computations locally at the client, and then return the results back to the server. This process offers several potential advantages over conventional parallel discrete event simulation systems, including support for execution over heterogeneous distributed computing platforms, load balancing, efficient execution on shared platforms, easy addition or removal of client machines during program execution, simpler fault tolerance, and improved portability. A prototype implementation called the Aurora Parallel and Distributed Simulation System (Aurora) is described. The structure and interaction of the Aurora components is described. Results of an experimental performance evaluation are presented detailing primitive timings and application performance on both dedicated and shared computing platforms. © 2006 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Design space exploration for 3D architectures

引用

ACM Journal on Emerging Technologies in computing Systems 2006年第2期2卷 65-103页

作者： Xie, Yuan Loh, Gabriel H. Black, Bryan Bernstein, Kerry Pennsylvania State University Georgia Institute of Technology Intel Corporation IBM Corporation Computer Science and Engineering Department Pennsylvania State University University Park PA 16802 College of Computing Georgia Institute of Technology Atlanta GA 30332

As technology scales, interconnects have become a major performance bottleneck and a major source of power consumption for microprocessors. Increasing interconnect costs make it necessary to consider alternate ways of building modern microprocessors. One promising option is 3D architectures where a stack of multiple device layers with direct vertical tunneling through them are put together on the same chip. As fabrication of 3D integrated circuits has become viable, developing CAD tools and architectural techniques is imperative to explore the design space to 3D microarchitectures. In this article, we give a brief introduction to 3D integration technology, discuss the EDA design tools that can enable the adoption of 3D ICs, and present the implementation of various microprocessor components using 3D technology. An industrial case study is presented as an initial attempt to design 3D microarchitectures. © 2006 ACM.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：