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

International Conference on Pattern Recognition

作者： M. Jogan A. Leonardis H. Wildenauer H. Bischof Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Pattern Recognition and Image Processing Group Institute for Computer Aided Automation University of Technology Vienna Vienna Austria Institute for Computer Graphics and Vision Graz University of Technology Graz Austria

Methods for mobile robot localization that use eigenspaces of panoramic snapshots of the environment are in general sensitive to changes in the illumination of the environment. Therefore, we propose an approach which achieves a reliable localization under severe illumination conditions. The method uses gradient filtering of the eigenspace. After testing the approach on images obtained by a mobile robot, we show that it outperforms the standard eigenspace-based recognition method.

关键词： Mobile robots Lighting computer vision Filter bank Image recognition Indoor environments Pattern recognition Image processing computer graphics Information science

来源：评论

学校读者我要写书评

暂无评论

HAMILTONIAN PROPERTIES OF FAULTY RECURSIVE CIRCULANT GRAPHS

引用

Journal of Interconnection Networks 2002年第3N04期3卷 273-289页

作者： CHANG-HSIUNG TSAI JIMMY J. M. TAN YEN-CHU CHUANG LIH-HSING HSU Department of Computer Science and Information Engineering Dahan Institute of Technology Hualien Taiwan 971 R.O.C Department of Computer and Information Science National Chiao Tung University Hsinchu Taiwan 300 R.O.C Correspondence to: Professor L. H. Hsu Department of Computer and Information Science National Chiao Tung University Hsinchu Taiwan 300 R.O.C.

We present some results concerning hamiltonian properties of recursive circulant graphs in the presence of faulty vertices and/or edges. The recursive circulant graph G(N, d) with d ≥ 2 has vertex set V(G) = {0, 1, …, N - 1} and the edge set E(G) = {(v, w)| ∃ i, 0 ≤ i ≤ ⌈ log d N⌉ - 1, such that v = w + d i ( mod N)}. When N = cd k where d ≥ 2 and 2 ≤ c ≤ d, G(cd k , d) is regular, node symmetric and can be recursively constructed. G(cd k , d) is a bipartite graph if and only if c is even and d is odd. Let F, the faulty set, be a subset of V(G(cd k , d)) ∪ E(G(cd k , d)). In this paper, we prove that G(cd k , d) - F remains hamiltonian if |F| ≤ deg (G(cd k , d)) - 2 and G(cd k , d) is not bipartite. Moreover, if |F| ≤ deg (G(cd k , d)) - 3 and G(cd k , d) is not a bipartite graph, we prove a more stronger result that for any two vertices u and v in V(G(cd k , d)) - F, there exists a hamiltonian path of G(cd k , d) - F joining u and v.

关键词： k-hamiltonian hamiltonian connected recursive circulant graphs interconnection networks fault-tolerant

来源：评论

学校读者我要写书评

暂无评论

Enabling active flow manipulation in silicon-based network forwarding engines

Enabling active flow manipulation in silicon-based network f...

引用

DARPA Active Networks Conference and Exposition

作者： T. Lavian P. Wang F. Travostino S. Subramanian R. Duraraj Doan Hoang V. Sethaput D. Culler Candidate at the Computer Science Division University of California Berkeley USA Department of Computer Systems University of Technology University of California Sydney Australia Advanced Technology Nortel Networks Corp. Division of Engineering and Applied Sciences North Carolina State University USA Visiting research professor at Advanced Technology Nortel Networks Corporation Australia Computer Science Division University of California at Berkeley Nortel Networks Corp. Computer Science Division University of California Berkeley USA

A significant challenge arising from today's increasing Internet traffic is the ability to flexibly incorporate intelligent control in high performance commercial network devices. The paper tackles this challenge by introducing the active flow manipulation (AFM) mechanism to enhance traffic control intelligence of network devices through programmability. With AFM, customer network services can exercise active network control by identifying distinctive flows and applying specified actions to alter network behavior in real-time. These services are dynamically loaded through Openet by the CPU-based control unit of a network node and are closely coupled with its silicon-based forwarding engines, without negatively impacting forwarding performance. AFM is exposed as a key enabling technology of the programmable networking platform Openet. The effectiveness of our approach is demonstrated by four active network services on commercial network nodes.

关键词： Intelligent networks computer science IP networks Web and internet services Silicon Permission Read only memory Search engines Communication system traffic control

来源：评论

学校读者我要写书评

暂无评论

QuadTIN: quadtree based triangulated irregular networks

QuadTIN: quadtree based triangulated irregular networks

引用

IEEE Conference on Visualization

作者： R. Pajarola M. Antonijuan R. Lario Computer Graphics Laboratory Information & Computer Science Department University of California Irvine USA School of Engineering Multimedia Technology Integration Center School of Engineering Departmento Arquitectura de Computadores y Automática Faculty de CC. Físicas Universidad Complutense de Madrid Spain

Interactive visualization of large digital elevation models is of continuing interest in scientific visualization, GIS, and virtual reality applications. Taking advantage of the regular structure of grid digital elevation models, efficient hierarchical multiresolution triangulation and adaptive level-of-detail (LOD) rendering algorithms have been developed for interactive terrain visualization. Despite the higher triangle count, these approaches generally outperform mesh simplification methods that produce irregular triangulated network (TIN) based LOD representations. In this project we combine the advantage of a TIN based mesh simplification preprocess with high-performance quadtree based LOD triangulation and rendering at run-time. This approach, called QuadTIN, generates an efficient quadtree triangulation hierarchy over any irregular point set that may originate from irregular terrain sampling or from reducing oversampling in high-resolution grid digital elevation models.

关键词： Tin Digital elevation models Data visualization computer graphics Geographic Information Systems Virtual reality Rendering (computer graphics) Strips computer science Application software

来源：评论

学校读者我要写书评

暂无评论

Weight-biased edge-crossover in evolutionary algorithms for two graph problems 01

Weight-biased edge-crossover in evolutionary algorithms for ...

引用

2001 ACM Symposium on Applied Computing, SAC 2001

作者： Julstrom, Bryant A. Raidl, Günther R. Department of Computer Science St. Cloud State University 720 Fourth Avenue South St. CloudMN56301 United States Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstraße 9-11/1861 Vienna1040 Austria

ISBN: (纸本)1581132875

Many optimization problems on weighted graphs seek a subset of the graph's edges that has minimum weight and satisfies the problem's constraints. Two examples are the traveling salesman problem (TSP) and the degree-constrained minimum spanning tree problem (d-MSTP). Heuristics like evolutionary algorithms often construct candidate solutions to such problems iteratively, repeatedly including an edge selected from those currently eligible. Not surprisingly, low-weight edges usually predominate in good and optimal solutions, an observation we confirm empirically for the TSP and the d-MSTP. This suggests that any process that builds candidate solutions should, with higher probability, select edges of lower weight. We incorporate into crossover operators and compare in a genetic algorithm four edge-selection techniques: random, greedy, according to probabilities inversely proportional to the edges' weights, and 2-tournament. Tests on instances of the TSP and the d-MSTP indicate that with the weight-biased techniques, the GA identifies better solutions faster than with random edge-selection. © 2001 ACM.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A flexible polygon representation of multiple overlapping regions of interest for wavelet-based image coding

A flexible polygon representation of multiple overlapping re...

引用

IEEE International Conference on Image Processing

作者： U. Rauschenbach R. Rosenbaum H. Schumann Corporate Technology SIEMENS AG Munich Germany Computer Science Department Institute of Computer Graphics. University of Rostock Rostock Germany

Image transmission over low-bandwidth channels can be speeded up if the image coding mechanism supports regions of interest (RoIs). By such a scheme, image parts not belonging to RoIs can be encoded at a lower bitrate. This paper describes a flexible dynamic RoI scheme which supports the definition of arbitrarily-shaped RoIs before the start of the transmission process and the refinement of a partially transmitted image by the definition of new RoIs at any time during image transmission. The overhead to represent RoIs is kept as small as possible by exploiting a polygon-based RoI representation. Span arithmetic on a multiresolution grid is used to support the redundancy-free transmission of overlapping RoIs.

关键词： Image coding Image communication Shape Arithmetic Wavelet coefficients computer science computer graphics Computed tomography Bit rate Lapping

来源：评论

学校读者我要写书评

暂无评论

Treating computer science as science as: An experiment with sorting (poster session) 01

Treating computer science as science as: An experiment with ...

引用

Proceedings of the 6th annual conference on Innovation and technology in computer science education

作者： Cary Laxer Professor of Computer Science Rose-Hulman Institute of Technology Terre Haute Indiana

ISBN: (纸本)9781581133301

When I teach sorting algorithms in our introductory computer science class, I always wonder how I can convince the students of the efficiency of Ο (n log n) sorts, and their complex code, vs. the ease of writing Ο (n2) sorts. With today's personal computers, even bubble sorting an array of a few thousand items appears to occur instantaneously. In addition, most textbooks provide the program code for implementing most of the standard sorting algorithms, such as bubble sort, selection sort, and quick sort. Since our introductory course has a closed lab period each week, I looked for something to do with my students when it came to sorting. Making them type in the code that was in the book seemed a waste of time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optical solder bumps: a modular approach to monolithic optoelectronic integration

Optical solder bumps: a modular approach to monolithic optoe...

引用

International Symposium Semiconductor Device Research (ISDRS)

作者： C.G. Fonstad Vitesse Professor of Electrical Engineering Department of Electrical Engineering and Computer Science and Microsystems Technology Laboratory Massachusetts Institute of Technology Cambridge MA USA

ISBN: (纸本)0780374320

The monolithic integration of compound semiconductor devices with silicon CMOS ICs is complicated by two major factors: the large thermal expansion coefficient mismatch between silicon and other semiconductors, and the large mismatch in wafer diameters between silicon and other semiconductors. Hence, most integration of compound semiconductors and silicon is done a chip at a time using long-established hybrid bump-bonding techniques. While these methods are able to begin to satisfy many immediate application needs, they do not enjoy the economic advantages of wafer-scale, batch processing found in true monolithic integration, nor to they offer the advantages of reduced parasitics, robustness of structure and density of integration that can be obtained from monolithic integration. This paper will present a philosophy for doing monolithic heterogeneous integration called the optical solder bump concept which strives to achieve all of the economic, structural and performance advantages of true monolithic integration and to do so in a modular fashion building upon commercial silicon integrated circuit processes.

关键词： Integrated optics Monolithic integrated circuits Silicon Gallium arsenide Dielectric substrates Optical devices Semiconductor devices Epitaxial growth Wafer bonding CMOS technology

来源：评论

学校读者我要写书评

暂无评论

An OOP approach for mesh generation of multi-region models with NURBS

An OOP approach for mesh generation of multi-region models w...

引用

Brazilian Symposium on computer graphics and Image Processing (SIBGRAPI)

作者： W.M. Lira P.R. Cavalcanti L.C.G. Coelho L.F. Martha Department of Civil Engineering and Computer Graphics Technology Group Tecgraf Rio de Janeiro Rio de Janeiro Brazil Department of Computer Science Federal University of Rio de Janeiro Rio de Janeiro Rio de Janeiro Brazil

This paper presents an object-oriented approach for creating multi-region non-manifold models with NURBS. The main motivation is that the geometry and shape of realistic engineering objects are intrinsically complex, usually composed by several materials and regions. Therefore, automatic and/or adaptive meshing algorithms have become revealed themselves quite useful to increase the reliability of the procedures of a FEM numerical analysis. The present approach is concerned with two aspects of 3D FEM simulation: geometric modeling, with automatic multi-region detection, and support to automatic finite element mesh generation. The final objective is to use geometric models directly in numerical applications.

关键词： Mesh generation Object oriented modeling Solid modeling Spline Surface topography Surface reconstruction Geometry Shape Reliability engineering Numerical analysis

来源：评论

学校读者我要写书评

暂无评论

OPEN: a flexible OO/CBD process for software-intensive systems development, a UML exposition 01

OPEN: a flexible OO/CBD process for software-intensive syste...

引用

Proceedings of the 23rd International Conference on Software Engineering

作者： Houman Younessi Brian Henderson-Sellers Rensselaer Initiative in Software Engineering (RISE) Associate Professor of Computer Science Rensselaer Polytechnic Institute Rensselaer at Hartford Centre for Object Technology Applications and Research Professor of Information Systems Faculty of Information Technology University of Technology Sydney

ISBN: (纸本)9780769510507

Object technology is an approach that is increasingly being adopted for the development of quality software and software-intensive systems. Recent experience has demonstrated that it provides a sophisticated environment to support high quality software engineering practice. However, the use of object technology should not be restricted to languages but should encompass analysis, design, V&V and many such aspects belonging to the methodological dimension of the development life-cycle. Furthermore, it should also cover other issues belonging to the technological and contextual aspects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：