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

作者： Jang, Justin Wonka, Peter Ribarsky, William Shaw, Christopher D. Georgia Institute of Technology GVU Center College of Computing Atlanta GA 30332 United States Arizona State University PRISM Dept. of Computer Science and Engineering Tempe AZ 85287 United States UNC Charlotte CS Dept. Charlotte Visualization Center Charlotte NC 28223 United States Simon Fraser University Surrey School of Interactive Arts and Technology 14-660 Central City Tower 13450 102 Ave Surrey BC V3T 5X3 Canada Graphics Visualization and Usability Center Georgia Institute of Technology PRISM Lab. ASU Department of Information Technology UNC Charlotte Charlotte Visualization Center IEEE Visualization and Graphics Technical Committee School of Interactive Arts and Technology Simon Fraser University Surrey

We present a simplification algorithm for manifold polygonal meshes of plane-dominant models. Models of this type are likely to appear in man-made environments. While traditional simplification algorithms focus on generality and smooth meshes, the approach presented here considers a specific class of man-made models. By detecting and classifying edge loops on the mesh and providing a guided series of binary mesh partitions, our approach generates a series of simplified models, each of which better respects the semantics of these kinds of models than conventional approaches do. A guiding principle is to eliminate simplifications that do not make sense in constructed environments. This, coupled with the concept of "punctuated simplification", leads to an approach that is both efficient and delivers high visual quality. Comparative results are given.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A theory of enterprise transformation

引用

Systems engineering 2005年第4期8卷 279-295页

作者： Rouse, William B. Tennenbaum Institute Georgia Institute of Technology Atlanta GA 30332 Tennenbaum Institute Georgia Institute of Technology College of Computing School of Industrial and Systems Engineering National Academy of Engineering Institute for Operations Research and Management Science Human Factors and Ergonomics Society

The information technology revolution has driven the pace of competition and rapid globalization. Consequently, enterprises increasingly need to consider and pursue fundamental change - transformation - to maintain or gain competitive advantage. This need raises important research issues concerning how transformation is best understood and pursued. This paper outlines a theory of enterprise transformation to guide research on these issues. The theory focuses on why and how transformation happens, as well as ways in which transformation is addressed and pursued in terms of work processes and the architecture of these processes. A variety of industry and corporate vignettes is used to illustrate the theory. A portfolio of research initiatives are discussed in terms of how they can advance the proposed theory, while also enhancing practices of enterprise transformation. © 2005 Wiley Periodicals, Inc.

关键词： Information technology

来源：评论

学校读者我要写书评

暂无评论

Hybrid search schemes for unstructured peer-to-peer networks

Hybrid search schemes for unstructured peer-to-peer networks

引用

IEEE INFOCOM 2005

作者： Gkantsidis, Christos Mihail, Milena Saberi, Amin College of Computing Georgia Institute of Technology Atlanta GA 30332 United States Institute for Computational and Mathematical Engineering Management Science and Engineering Department Stanford University Stanford CA 94305 United States

ISBN: (纸本)0780389689

We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead and replication. We consider both regular topologies and topologies with supernodes. We introduce a general search scheme, of which flooding and random walks are special instances, and show how to use locally maintained network information to improve the performance of searching. Our main findings are: (a)A small number of supernodes in an otherwise regular topology can offer sharp savings in the performance of search, both in the case of search by flooding and search by random walk, particularly when it is combined with 1-step replication. We quantify, analytically and experimentally, that the reason of these savings is that the search is biased towards nodes that yield more information. (b)There is a generalization of search, of which flooding and random walk are special instances, which may take further advantage of locally maintained network information, and yield better performance than both flooding and random walk in clustered topologies. The method determines edge criticality and is reminiscent of fundamental heuristics from the area of approximation algorithms. ©2005 IEEE.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

BOUNDARY INTEGRAL FORMULA OF ELASTICPROBLEMS IN CIRCLE PLANE

引用

Applied Mathematics and Mechanics(English Edition) 2005年第5期26卷 604-608页

作者：董正筑李顺才余德浩 College of Science China University of Mining & TechnologyXuzhou 221008 Jiangsu Province P.R.China .Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy of Sciences Beijing 100080 P.R.China College of Polytechnology Xuzhou Normal University Xuzhou 221011 Jiangsu Province P.R.China Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy of Sciences Beijing 100080 P.R.China

By bianalytic functions, the boundary integral formula of the stress function for the elastic problem in a circle plane is developed. But this integral formula includes a strongly singular integral and can not be directly calculated. After the stress function is expounded to Fourier series, making use of some formulas in generalized functions to the convolutions, the boundary integral formula which does not include strongly singular integral is derived further. Then the stress function can be got simply by the integration of the values of the stress function and its derivative on the boundary. Some examples are given. It shows that the boundary integral formula of the stress function for the elastic problem is convenient.

关键词： elastic problem in circle plane bi-harmonic equation stress function boundary integral formula

来源：评论

学校读者我要写书评

暂无评论

Software engineering 2004: ACM/IEEE-CS guidelines for undergraduate programs in engineering

Software engineering 2004: ACM/IEEE-CS guidelines for underg...

引用

27th International Conference on Software engineering, ICSE05

作者： Atlee, Joanne M. Leblanc Jr., Richard J. Lethbridge, Timothy C. Sobel, Ann Thompson, J. Barrie School of Computer Science University of Waterloo Canada College of Computing Georgia Institute of Technology School of Information Technology and Engineering University of Ottawa Canada School of Engineering and Applied Science Miami University School of Computing and Technology University of Sunderland CCSE Steering Committee

This paper is an overview of Software engineering 2004, the Software engineering volume of the computing Curricula 2001 project. We briefly describe the contents of the volume, the process used in developing the volum... 详细信息

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

An intrusion-tolerant and self-recoverable network service system using a security enhanced chip multiprocessor

An intrusion-tolerant and self-recoverable network service s...

引用

2nd International Conference on Autonomic computing, ICAC 2005

作者： Shi, Weidong Lee, Hsien-Hsin S. Gu, Guofei Falk, Laura Mudge, Trevor N. Ghosh, Mrinmoy School of Electrical and Computer Engineering College of Computing Georgia Institute of Technology Atlanta GA 30332 Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109

ISBN: (纸本)0769522769

This paper proposes a novel system design using a chip multiprocessor (CMP) to provide intrusion tolerance and self-recovery for server applications. Our platform provides three major advantages over previously proposed approaches, 1) security insulation from remote exploits and attacks;2) close coupling between processor cores in a CMP to ensure immediate logging, fine-grained inspection and fast recovery;3) concurrent and fine-grained inspection, logging and recovery techniques that are off of the critical path. We have designed a multi-point defense and recovery system to defeat remote exploits. We used a checkpoint based approach to recover server applications under attack. It takes a snapshot of the application's context and memory state before it handles the next request. If the request turns out to be malicious, the system can discard the malicious request and rollback the application's state to a known good one through checkpointing. We have also designed an rapid recovery system for kernel space rootkit attacks. Our intrusion survivable and self-recovery design provides reliable production services that System Administrators are seeking.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

Hybrid search schemes for unstructured peer-to-peer networks

Hybrid search schemes for unstructured peer-to-peer networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： C. Gkantsidis M. Mihail A. Saberi College of Computing Georgia Institute of Technology Atlanta GA USA Institute for Computational and Mathematical Engineering and Management Science and Engineering Department University of Stanford Stanford CA USA

We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead and replication. We consider both regular topologies and topologies with supernodes. We introduce a general search scheme, of which flooding and random walks are special instances, and show how to use locally maintained network information to improve the performance of searching. Our main findings are: (a) a small number of supernodes in an otherwise regular topology can offer sharp savings in the performance of search, both in the case of search by flooding and search by random walk, particularly when it is combined with 1-step replication. We quantify, analytically and experimentally, that the reason of these savings is that the search is biased towards nodes that yield more information. (b) There is a generalization of search, of which flooding and random walk are special instances, which may take further advantage of locally maintained network information, and yield better performance than both flooding and random walk in clustered topologies. The method determines edge critically and is reminiscent of fundamental heuristics from the area of approximation algorithms.

关键词： Peer to peer computing Floods Network topology Delay Performance analysis Computer networks Educational institutions Computer network management technology management engineering management

来源：评论

学校读者我要写书评

暂无评论

Testing COM components using software fault injection and mutation analysis, and its empirical study

Testing COM components using software fault injection and mu...

引用

4th International Workshop on Formal Approaches to Software Testing, FATES 2004

作者： Yoon, Hoijin Kim, Eunhee Seo, Joo Young Choi, Byoungju College of Computing Georgia Institute of Technology United States Software Center Samsung Electronics Co. Ltd. Korea Republic of Department of Computer Science and Engineering Ewha Women's University Korea Republic of

CBSD needs to customize and compose components. Customization and composition can cause faults which are hard to detect by existing testing techniques, since components have different structures from traditional programs. This paper proposes a testing technique for customization and composition, and then it tailors the technique to COM component architecture. Since CBSD aims to reduce development cost, testing should consider the cost of testing. Effective test data will help reduce testing cost. Therefore, an empirical study shows that the technique proposed in this paper selects effective test data. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Eliminating wire crossings for molecular quantum-dot cellular automata implementation

Eliminating wire crossings for molecular quantum-dot cellula...

引用

IEEE International Conference on Computer-Aided Design

作者： A. Chaudhary D.Z. Chen Xiaobo Sharon Hu K. Whitton M. Niemier R. Ravichandran Department of Computer Science & Engineering University of Notre Dame Notre Dame IN USA Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta GA USA

When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses on molecular quantum-dot cellular automata circuits. For these circuits, it is very difficult for chemists to fabricate wire crossings (at least in the near future). A novel technique is introduced to remove wire crossings in a given circuit to facilitate the self assembly of real circuits - thus providing meaningful and functional design targets for both physical and computer scientists. The technique eliminates all wire crossings with minimal logic gate/node duplications. Experimental results based on existing QCA circuits and other benchmarks are quite encouraging, and suggest that further investigation is needed.

关键词： Wire Quantum dots Quantum cellular automata Circuits Physics computing Binary decision diagrams CMOS technology Logic gates Chemical technology Logic devices

来源：评论

学校读者我要写书评

暂无评论

Design of adaptive overlays for multi-scale communication in sensor networks

Design of adaptive overlays for multi-scale communication in...

引用

First IEEE International Conference on Distributed computing in Sensor Systems, DCOSS 2005

作者： PalChaudhuri, Santashil Kumar, Rajnish Baraniuk, Richard G. Johnson, David B. Rice University Department of Computer Science Houston TX 77005-1892 United States Georgia Institute of Technology College of Computing Atlanta GA 30332-0280 United States Rice University Department of Electrical and Computer Engineering Houston TX 77005-1892 United States

In wireless sensor networks, energy and communication bandwidth are precious resources. Traditionally, layering has been used as a design principle for network stacks;hence routing protocols assume no knowledge of the application behavior in the sensor node. In resource-constrained sensor-nodes, there is simultaneously a need and an opportunity to optimize the protocol to match the application. In this paper, we design a network architecture that efficiently supports multi-scale communication and collaboration among sensors. The architecture complements the previously proposed Abstract Regions architecture for local communication and collaboration. We design a self-organizing hierarchical overlay that scales to a large number of sensors and enables multi-resolution collaboration. We design effective Network Programming Interfaces to simplify the development of applications on top of the architecture;these interfaces are efficiently implemented in the network layer. The overlay hierarchy can adapt to match the collaboration requirements of the application and data both temporally and spatially. We present an initial evaluation of our design under simulation to show that it leads to reduced communication overhead, thereby saving energy. We are currently building our architecture in the TinyOS environment to demonstrate its effectiveness. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：