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

2nd IEEE International Conference on Computer and Communications (ICCC)

作者： Pattanotai, Naravut Rajamangala Univ Technol Suvarnabhumi Fac Sci & Technol Suphanburi Campus Suphanburi Thailand

ISBN: (纸本)9781467390262

A class diagram is the heart of the object-oriented analysis and design. Understanding the meaning in class diagram is important for everyone who has involved in the software development project. This work proposes the method of automatically generating class description. The generation was done in two main steps. First, all class components in the class diagram input file are transformed into the tree data structure. Then, the system will generate the class description of that class components tree. This work proposes two types of the generation method according to the tree traversal method: top-down and level-order traversal. The example results show comprehensive class descriptions that can use in the future other works.

关键词： UML class diagram natural language generation tree data structure

来源：评论

学校读者我要写书评

暂无评论

A new FCA algorithm enabling analyzing of complex and dynamic data sets

引用

SOFT COMPUTING 2014年第4期18卷 683-694页

作者： Gajdos, Petr Snasel, Vaclav VSB Tech Univ Ostrava Dept Comp Sci Ostrava Czech Republic

Analyzing data with the use of Formal Concept Analysis (FCA) enables complex insights into hidden relationships between objects and features in a studied system. Several improvements in this research area, such as Fuzzy FCA or L-Fuzzy Concepts, bring the possibility to analyze data with a certain rate of indeterminacy. However, the usage of FCA on larger complex data brings several problems relating to the time-complexities of FCA algorithms and the size of generated concept lattices. The fuzzyfication of FCA emphasizes the mentioned problems. This article describes significant improvements of a selected FCA algorithm. The primary focus was given on the system of an effective data storage. The binary data was stored with the use of finite automata that leads to the lower memory consumption. Moreover, the better querying performance was achieved. Next, we focused on the inner process of the computation of all formal concepts. All improvements were integrated into a new FCA algorithm that can be used to analyze more complex data sets.

关键词： Formal concept analysis tree data structure Finite automata Fuzzy data

来源：评论

学校读者我要写书评

暂无评论

One billion points in the cloud - an octree for efficient processing of 3D laser scans

引用

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING 2013年第Feb.期76卷 76-88页

作者： Elseberg, Jan Borrmann, Dorit Nuechter, Andreas Jacobs Univ Bremen gGmbH Automat Grp Sch Engn & Sci D-28759 Bremen Germany

Automated 3-dimensional modeling pipelines include 3D scanning, registration, data abstraction, and visualization. All steps in such a pipeline require the processing of a massive amount of 3D data, due to the ability of current 3D scanners to sample environments with a high density. The increasing sampling rates make it easy to acquire Billions of spatial data points. This paper presents algorithms and data structures for handling these data. We propose an efficient octree to store and compress 3D data without loss of precision. We demonstrate its usage for an exchange file format, fast point cloud visualization, sped-up 3D scan matching, and shape detection algorithms. We evaluate our approach using typical terrestrial laser scans. (C) 2012 International Society for Photogrammetry and Remote Sensing, Inc. (ISPRS) Published by Elsevier B.V. All rights reserved.

关键词： Octree tree data structure data compression Frustum culling Ray casting RANSAC Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

The tree representation for the pickup and delivery traveling salesman problem with LIFO loading

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年第3期212卷 482-496页

作者： Li, Yongquan Lim, Andrew Oon, Wee-Chong Qin, Hu Tu, Dejian Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China City Univ Hong Kong Dept Management Sci Kowloon Tong Hong Kong Peoples R China Sun Yat Sen Univ Dept Comp Sci Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China

The feasible solutions of the traveling salesman problem with pickup and delivery (TSPPD) are commonly represented by vertex lists. However, when the TSPPD is required to follow a policy that loading and unloading operations must be performed in a last-in-first-out (LIFO) manner, we show that its feasible solutions can be represented by trees. Consequently, we develop a novel variable neighborhood search (VNS) heuristic for the TSPPD with last-in-first-out loading (TSPPDL) involving several search operators based on the tree data structure. Extensive experiments suggest that our VNS heuristic is superior to the current best heuristics for the TSPPDL in terms of solution quality, while requiring no more computing time as the size of the problem increases. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Traveling salesman Pickup and delivery Last-in-first-out loading tree data structure Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

FIVE GOOD REASONS TO USE THE HIERARCHICAL data FORMAT

引用

COMPUTING IN SCIENCE & ENGINEERING 2010年第5期12卷 84-90页

作者： Poinot, Marc Onera the French Aerosp. Labs. France

Practical experience migrating to HDF for a numerical simulation library illustrates the storage system's benefits as well as how numerical simulation codes contribute to an open system. In this article describe the hierarchical data format the computational fluid dynamics (CFD) data storage for the CFD General Notation Standard (CGNS).

关键词： CFD General Notation Standard CFD General Notation System (CGNS) Computational Fluid Dynamics HDF Hierarchical data Format (HDF) Numerical simulation computational fluid dynamic data storage computational fluid dynamics hierarchical data format mathematics computing numerical simulation codes numerical simulation library open system open systems open systems physics computing scientific computing storage system tree data structure tree data structures

来源：评论

学校读者我要写书评

暂无评论

An Elaborate Education of Basic Genetic Programming Using C plus

引用

COMPUTER APPLICATIONS IN ENGINEERING EDUCATION 2010年第3期18卷 434-448页

作者： Sahoo, Nirod C. Chin, Jeremy G. W. Multimedia Univ MMU Fac Engn & Technol FET Melaka 75450 Malaysia

Evolutionary search is a global search method based on natural selection In engineering curriculum, these techniques are taught in courses like Evolutionary Computation, Engineering Optimization, etc Genetic algorithm (GA) is popular among these algorithms Genetic programming (GP), developed by John Koza. is a powerful extension of GA where a chromosome/computer program (CP) is coded as a rooted point-labeled tree with ordered branches The search space is he space of all possible CPs (trees) consisting of functions and terminals appropriate to the problem domain GP uses. like GA. crossover and mutation for evolution Due to tree-structured coding of individuals, the initial population generation, genetic operators' use, and tree decoding for fitness evaluations demand careful computer programming This article describes the programming steps of GP implementation (using C++ language) for students easy understanding with pseudocodes for each step Two application examples are also illustrated (c) 2009 Wiley Periodicals. Inc Commit Appl Eng Educ 18 434-448, 2010, View this article online at wileyonlinelibrary com. DOI 10 1002/cae 20165

关键词： genetic programming tree data structure computer implementation C plus

来源：评论

学校读者我要写书评

暂无评论

ETE: a python Environment for tree Exploration

引用

BMC BIOINFORMATICS 2010年第1期11卷 1-7页

作者： Huerta-Cepas, Jaime Dopazo, Joaquin Gabaldon, Toni Ctr Genom Regulat CRG Comparat Genom Grp Bioinformat & Genom Programme Barcelona 08003 Spain Ctr Invest Principe Felipe Bioinformat Dept Valencia Spain

Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relationships among different biological entities, thus facilitating their analysis and interpretation. A number of standalone programs are available that focus on tree visualization or that perform specific analyses on them. However, such applications are rarely suitable for large-scale surveys, in which a higher level of automation is required. Currently, many genome-wide analyses rely on tree-like data representation and hence there is a growing need for scalable tools to handle tree structures at large scale. Results: Here we present the Environment for tree Exploration (ETE), a python programming toolkit that assists in the automated manipulation, analysis and visualization of hierarchical trees. ETE libraries provide a broad set of tree handling options as well as specific methods to analyze phylogenetic and clustering trees. Among other features, ETE allows for the independent analysis of tree partitions, has support for the extended newick format, provides an integrated node annotation system and permits to link trees to external data such as multiple sequence alignments or numerical arrays. In addition, ETE implements a number of built-in analytical tools, including phylogeny-based orthology prediction and cluster validation techniques. Finally, ETE's programmable tree drawing engine can be used to automate the graphical rendering of trees with customized node-specific visualizations. Conclusions: ETE provides a complete set of methods to manipulate tree data structures that extends current functionality in other bioinformatic toolkits of a more general purpose. ETE is free software and can be downloaded from http://***.

关键词： tree Node Cluster tree Hierarchical tree tree Partition tree data structure

来源：评论

学校读者我要写书评

暂无评论

Application of NBtree to Selection of Meteorological Variables in Wind Speed Prediction

Application of NBTree to Selection of Meteorological Variabl...

引用

Transmission and Distribution Conference and Exposition - Asia and Pacific

作者： Mori, Hiroyuki Umezawa, Yasushi Meiji Univ Dept Elect & Bioinformat Kawasaki Kanagawa 2148571 Japan

ISBN: (纸本)9781424452293

This paper proposes a new method for selecting meteorological variables in wind speed prediction. The proposed method is based on the regression tree of data mining. In recent years, the power market becomes more deregulated and competitive. As a result, the distribution generation is introduced in power systems. As clean energy, power utilities are quite interested in wind power generation. However, it is difficult to deal with wind power generation due to the uncertainty of the wind power output. In this paper, an efficient method is proposed to construct rules of data and forecast the wind speed. This paper makes use of NBtree as the prediction model. It is a hybrid model of C4.5 and Naive Bayes (NB). The proposed method is successfully applied to real data for wind speed.

关键词： data Mining data processing Wind power generation tree data structure Bayes procedures

来源：评论

学校读者我要写书评

暂无评论

Memory Efficient Hierarchical Lookup Tables for Mass Arbitrary-Side Growing Huffman trees Decoding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2008年第10期18卷 1335-1346页

作者： Wang, Sung-Wen Wu, Ja-Ling Chuang, Shang-Chih Hsiao, Chih-Chleh Tung, Yi-Shin Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan Hon Hai Precis Ind Co Ltd Taipei 106 Taiwan

This paper addresses the optimization problem of minimizing the number of memory access subject to a rate constraint for any Huffman decoding of various standard codecs. We propose a Lagrangian multiplier based penalty-resource metric to be the targeting cost function. To the best of our knowledge, there is few related discussion, in the literature, on providing a criterion to judge the approaches of entropy decoding under resource constraint. The existing approaches which dealt with the decoding of the single-side growing Huffman tree may not be memory-efficient for arbitrary-side growing Huffman trees adopted in current codecs. By grouping the common prefix part of a Huffman tree, in stead of the commonly used single-side growing Huffman tree, we provide a memory efficient hierarchical lookup table to speed up the Huffman decoding. Simulation results show that the proposed hierarchical table outperforms previous methods. A Viterbi-like algorithm is also proposed to efficiently find the optimal hierarchical table. More importantly, the Viterbi-like algorithm obtains the same results as that of the brute-force search algorithm.

关键词： Audio/video decoding Huffman decoding tree data structure

来源：评论

学校读者我要写书评

暂无评论

Representing financial time series based on data point importance

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2008年第2期21卷 277-300页

作者： Fu, Tak-chung Chung, Fu-lai Luk, Robert Ng, Chak-man Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Hong Kong Inst Vocat Educ Chai Wan Dept Comp & Informat Management Chaiwan Hong Kong Peoples R China

Recently, the increasing use of time series data has initiated various research and development attempts in the field of data and knowledge management. Time series data is characterized as large in data size, high dimensionality and update continuously. Moreover, the time series data is always considered as a whole instead of individual numerical fields, Indeed, a large set of time series data is from stock market. Stock time series has its own characteristics over other time series. Moreover, dimensionality reduction is an essential step before many dine series analysis and mining tasks. For these reasons, research is prompted to augment existing technologies and build new representation to manage financial time series data. In this paper, financial time series is represented according to the importance of the data points. With the concept of data point importance, a tree data structure, which supports incremental updating, is proposed to represent the time series and an access method for retrieving the time series data point from the tree, which is according to their order of importance, is introduced. This technique is capable to present the time series in different levels of detail and facilitate multi-resolution dimensionality reduction of the time series data. In this paper, different data point importance evaluation methods,,I new updating method and two dimensionality reduction approaches are proposed and evaluated by a series of experiments. Finally, the application of the proposed representation oil mobile environment is demonstrated.

关键词： financial time series representation multi-resolution visualization incremental updating Dimensionality reduction tree data structure mobile application

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：