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

IEEE international Conference on Computer-Aided Design and Computer Graphics

作者： Xiaotian Yin Miao Jin Xianfeng Gu Computer Science Department State University of New York Stony Brook Stony Brook NY USA

Summary form only given. In this paper we generalize the shortest path algorithm to the shortest cycles in each homotopy class on a surface with arbitrary topology, utilizing the universal covering space (UCS) in algebraic topology. In order to store and handle the UCS, we propose a two-level data structure which is efficient for storage and easy to process. We also pointed several practical applications for our shortest cycle algorithms and the UCS data structure.

关键词： Topology data structures Computer science USA Councils

来源：评论

学校读者我要写书评

暂无评论

Scalable user data management in multi-tenant cloud environments

Scalable user data management in multi-tenant cloud environm...

引用

international Conference on Network and Service Management

作者： Pieter-Jan Maenhaut Hendrik Moens Veerle Ongenae Filip De Turck Dept. of Information Technology Gaston Crommenlaan Ghent University Belgium Dept. of Industrial Technology and Construction Valentin Vaerwyckweg Ghent University Ghent Belgium

the rise of cloud computing and its elastic, on-demand resource provisioning introduces the need for a flexible and scalable multi-tenant architecture. In a multi-tenant application every tenant (client) makes use of shared application instances, but each tenant typically has its own user data. the shared application instance behaves like a private instance by guaranteeing both data separation and performance separation for every tenant. As the number of tenants increases, the amount of data grows. A scalable solution for the storage is needed, allowing tenant data to be divided over multiple database instances, but taking into account performance isolation and custom data assurance policies. In this paper we introduce an abstraction layer for achieving high scalability for the storage of tenant data. this layer uses data allocation algorithms to determine an acceptable allocation of tenant data to different databases. We describe a mathematical model for the allocation of tenant data which can be optimized using existing linear programming techniques, and introduce the BDAA-n and FDAA, two algorithms that will find an optimal allocation of data by iterating over the possible permutations. the proposed solutions are evaluated based on their flexibility, complexity and efficiency. the flexibility of the BDAA and FDAA makes them easy to customize and extend to fit most scenarios, but the algorithms will achieve best results for tenants with a limited number of subtenants. Linear programming is an alternative for tenants with a higher number of subtenants, but the customizability of the algorithm for specific use cases is limited due to the need for linear functions.

关键词： Resource management databases Scalability Computer architecture Elasticity Cost function Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Decomposing polygon meshes by means of critical points

Decomposing polygon meshes by means of critical points

引用

international Conference on Multimedia Modeling (MMM)

作者： Yinan Zhou Zhiyong Huang Department of Computer Science School of Computing National University of Singapore Singapore

ISBN: (纸本)0769520847

Polygon mesh is among the most common data structures used for representing objects in computer graphics. Unfortunately, a polygon mesh does not capture high-level structures, unlike a hierarchical model. In general, high-level abstractions are useful for managing data in applications. In this paper, we present a method for decomposing an object represented in polygon meshes into components by means of critical points. the method consists of steps to define the root vertex of the object, define a function on the polygon meshes, compute the geodesic tree and critical points, decide the decomposition order, and extract components using backwards flooding. We have implemented the method. the preliminary results show that it works effectively and efficiently. the decomposition results can be useful for applications such as 3D model retrieval and morphing.

关键词： Shape Computer vision Geophysics computing Floods Humans Partitioning algorithms Computer science data structures Computer graphics Application software

来源：评论

学校读者我要写书评

暂无评论

YANG2UML: Bijective transformation and simplification of YANG to UML

YANG2UML: Bijective transformation and simplification of YAN...

引用

international Conference on Network and Service Management

作者： Mario Golling Robert Koch Peter Hillmann Rick Hofstede Frank Tietze Department of Computer Science Universität der Bundeswehr München Neubiberg Germany

Specifically designed to exchange configuration information from a management platform to network components, the XML-based NETCONF protocol has become widely used. In combination with NETCONF, YANG is the corresponding protocol that defines the associated data structures, supporting virtually all network configuration protocols. YANG itself is a semantically rich language, which - in order to facilitate familiarization with the relevant subject - is often visualized using UML to involve other experts or developers and to support them by their daily work (writing applications which make use of YANG/NETCONF). To support this process, this paper presents an novel approach to optimize and simplify YANG data models, as current solutions tend to produce very complex UML diagrams. therefore, we have (i) defined a bidirectional mapping of YANG to UML, (ii) developed a strategy to reduce the numbers of objects, and (iii) created a tool that renders the created UML diagrams, closing the gap between technically improved data models and their human readability.

关键词： Unified modeling language data models XML Containers Semantics Protocols data visualization

来源：评论

学校读者我要写书评

暂无评论

the extended binary tree representation of binary image and its application to engineering drawing entry

The extended binary tree representation of binary image and ...

引用

international Conference on Pattern Recognition

作者： Bin Yu Xinggang Lin Image Processing Division Department of Electronic Engineering Tsinghua University Beijing China

A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. the traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.< >

关键词： Binary trees Engineering drawings Image processing Tree data structures Tree graphs Computational complexity Least squares approximation Application software Pixel Joining processes

来源：评论

学校读者我要写书评

暂无评论

Counterexample-guided abstraction refinement

Counterexample-guided abstraction refinement

引用

international workshop on Temporal Representation and Reasoning (TIME)

作者： E. Clarke School of Computer Science Carnegie Mellon University Pittsburgh USA

the main practical problem in model checking is the combinatorial explosion of system states commonly known as the state explosion problem. Abstraction methods attempt to reduce the size of the state space by employing knowledge about the system and the specification in order to model only relevant features in the Kripke structure. Counterexample-guided abstraction refinement is an automatic abstraction method where, starting with a relatively small skeletal representation of the system to be verified, increasingly precise abstract representations of the system are computed. the key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.

关键词： Explosions Concrete Contracts State-space methods data structures Computer science data mining Boolean functions Collaboration US Department of Defense

来源：评论

学校读者我要写书评

暂无评论

Crystal structure and diffraction data for a polymorph of voglibose (C₁₀H₂₁NO₇)

引用

POWDER DIFFRACTION 2010年第3期25卷 S28-S30页

作者： Zhang, G. Q. Lv, G. L. Zhejiang Sci Tech Univ Key Lab Adv Text Mat & Mfg Technol Hangzhou 310018 Zhejiang Peoples R China

X-ray powder diffraction data of voglibose are reported, and its crystal and molecular structures were determined by simulated annealing and rigid-body Rietveld refinement methods. Voglibose was found to be crystallized in triclinic symmetry with space group P-1. the lattice parameters were determined to be a=6.1974(6) angstrom, b=6.9918(5) angstrom, c=7.3955(9) angstrom, alpha=70.8628(3), beta=103.5312(4), gamma=94.3867(5), V=294.2(2) angstrom(3), and rho(cal)=1.495 g/cm(3). the crystal structure contains isolated C10H21NO7 molecular. (C) 2010 international Centre for Diffraction data. [DOI: 10.1154/1.3478418]

关键词： voglibose X-ray powder diffraction crystal structure

来源：评论

学校读者我要写书评

暂无评论

Measuring image structures using a multiscale orientation field

Measuring image structures using a multiscale orientation fi...

引用

international Conference on Pattern Recognition

作者： J.M. Coggins Center of Excellence in Space Data and Information Science NASA Goddard Space Flight Center USA Computer Science Department University of North Carolina Chapel Hill USA

A novel method for representing image orientation structure is used to measure the orientations of line segments in a series of increasingly blurred images. An algorithm for mapping filtered image data into an orientation feature space is defined. the algorithm is applied using four sets of filters. the results show that the algorithm effectively exploits redundancy in the feature values to yield robust inferences across a broad range of scales and through large amounts of blurring.< >

关键词： Filters Extraterrestrial measurements Distortion measurement Inference algorithms Robustness Visual system Image analysis Pixel Position measurement Computer science

来源：评论

学校读者我要写书评

暂无评论

the description of Bunraku puppet's motion in computer based on Labanotation

The description of Bunraku puppet's motion in computer based...

引用

IEEE international workshop on Robot and Human Communication (ROMAN)

作者： M. Hattori S. Nishizawa S. Tadokoro T. Takamori K. Yamada CS 11 Department of computer and Systems Engineering Fac. of Engineering Kobe University Japan Department of literature Doshisha University Japan

the authors are researching human and humanoid movement. they discuss the transformation system among the movement score, the movement description in computer and the body movement data which are used to generate computer graphics animation of humanoid movement. the proposed humanoid movement description method can describe not only the movement information which are described by Labanotation but also more detailed movement information. this movement description is called "movement MIDI based on Labanotaton" or "continuous Labanotation", and it exists between the Labanoation (which the choreographer can read but the computer cannot) and the humanoid movement data (which the computer can read but the choreographer cannot). It can be read by both the choreographer and the computer, and it is useful to modify the humanoid movement data in order to modify the CG animation, since the information of Labanotation is not sufficient to generate natural display of CG animation. We report the results of transformation from the humanoid motion captured data into the proposed movement description in computer.

关键词： Character generation Humans Animation Computer graphics Computer displays Linux Java Humanoid robots Animal structures Art

来源：评论

学校读者我要写书评

暂无评论

Parallel and scalable Dunn Index for the validation of big data clusters

引用

PARALLEL COMPUTING 2021年 102卷 102751-102751页

作者： Ben Ncir, Chiheb-Eddine Hamza, Abdallah Bouaguel, Waad Univ Jeddah Coll Business Jeddah Saudi Arabia Univ Tunis LARODEC Lab ISG Tunis Tunisia

Parallelizing data clustering algorithms has attracted the interest of many researchers over the past few years. Many efficient parallel algorithms were proposed to build partitioning over a huge volume of data. the effectiveness of these algorithms is attributed to the distribution of data among a cluster of nodes and to the parallel computation models. Although the effectiveness of parallel models to deal with increasing volume of data little work is done on the validation of big clusters. To deal with this issue, we propose a parallel and scalable model, referred to as S-DI (Scalable Dunn Index), to compute the Dunn Index measure for an internal validation of clustering results. Rather than computing the Dunn Index on a single machine in the clustering validation process, the new proposed measure is computed by distributing the partitioning among a cluster of nodes using a customized parallel model under Apache Spark framework. the proposed S-DI is also enhanced by a Sketch and Validate sampling technique which aims to approximate the Dunn Index value by using a small representative data-sample. Different experiments on simulated and real datasets showed a good scalability of our proposed measure and a reliable validation compared to other existing measures when handling large scale data.

关键词： Distributed and parallel computing Spark framework Sampling Big data analysis Clustering validity Dunn Index

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：