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

7th International Conference on Computational Science (ICCS 2007)

作者： Xu, Kaihua Wang, Ya Liu, Yuhua Cent China Normal Univ Coll Phys Sci & Technol Wuhan 430079 Peoples R China Cent China Normal Univ Dept Comp Sci Wuhan 430079 Peoples R China

ISBN: (纸本)9783540725879

This paper computes the optimum number of cluster heads based on power first, and then proposes the clustering algorithm for WSNs, at last estimates its performances by our emulator. On analysis, clustering time complexity is dependent on the network diameter and it is suitable for small or medium networks. The simulation results show that using this clustering algorithm can generate network topology of optimum number of clusters, the nodes energy is reduced greatly and the lifetime of networks is extended.

关键词： clustering topology WSN generation algorithm cluster heads node energy

来源：评论

学校读者我要写书评

暂无评论

A method for generating reliable atomistic models of amorphous polymers based on a random search of energy minima

引用

COMPUTER PHYSICS COMMUNICATIONS 2005年第1-3期169卷 335-338页

作者： Curcó, D Casanovas, J Roca, M Alemán, C Univ Politecn Catalunya ETS Engn Ind Barcelona Dept Engn Quim E-08028 Barcelona Spain Univ Barcelona Fac Quim Dept Engn Quim E-08028 Barcelona Spain Univ Lleida Escola Politecn Super Dept Quim E-25001 Lleida Spain

A method for generating atomistic models of dense amorphous polymers is presented. The method is organized in a two-steps procedure. First, structures are generated using an algorithm that minimizes the torsional strain. After this, a relaxation algorithm is applied to minimize the non-bonding interactions. Two alternative relaxation methods, which are based simple minimization and Concerted Rotation techniques, have been implemented. The performance of the method has been checked by simulating polyethylene, polypropylene, nylon 6, poly(L,D-lactic acid) and polyglycolic acid. (c) 2005 Elsevier B.V. All rights reserved.

关键词： amorphous polymers atomistic simulation Monte Carlo generation algorithm relaxation algorithm ConRot SuSi

来源：评论

学校读者我要写书评

暂无评论

A method for generating reliable atomistic models of amorphous polymers based on a random search of energy minima

A method for generating reliable atomistic models of amorpho...

引用

Europhysics Conference on Computational Physics

关键词： amorphous polymers atomistic simulation Monte Carlo generation algorithm relaxation algorithm ConRot SuSi

来源：评论

学校读者我要写书评

暂无评论

A generic algorithm for generating closed sets of a binary relation

引用

3rd International Conference on Formal Concept Analysis (ICFCA 2005)

作者： Gély, A Univ Clermont Ferrand F-63170 Clermont Ferrand France

ISBN: (纸本)3540245251

In this paper we propose a "divide and conquer" based generating algorithm for closed sets of a binary relation. We show that some existing algorithms are particular instances of our algorithm. This allows us to compare those algorithms and exhibit that the practical efficiency relies on the number of invalid closed sets generated. This number strongly depends on a choice function and the structure of the lattice. We exhibit a class of lattices for which no invalid closed sets are generated and thus reduce time complexity for such lattices. We made several tests which illustrate the impact of the choice function in practical efficiency.

关键词： generation algorithm closure operator galois or concept lattice

来源：评论

学校读者我要写书评

暂无评论

The application of chaos and fractal in graphics & image processing and pattern recognition

The application of chaos and fractal in graphics & image pro...

引用

International Conference on Intelligent Mechatronics and Automation

作者： He, J Xu, H Wang, QT Chengdu Univ Informat Technol Dept Comp Chengdu Peoples R China

ISBN: (纸本)0780387481

The idea and some methods of chaos and fractal to generate the 3D graphics and image are introduced at the beginning of this paper. Then we take the generation of a ball graphic as the example to analyses the shortcoming of the traditional algorithm on the computer. A new algorithm based on fractal theory was constructed to make up this shortcoming. What's more, some application of chaos in the generation of graphics and image processing in computer area are mentioned. Base on that, the way of terrain generation by the fractal theory is discussed in detail. On the above, the generation method of terrain is expressed and herein we make some advanced research on the application of chaos theory and fractal technology in pattern recognition area. Some characteristic points were selected from a terrain picture and used as seeds. Then we recognize and simulate the terrain by the generation algorithm of terrain.

关键词： chaos graphics and image generation algorithm fractal pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for generating nonisomorphic chord diagrams

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年第4期15卷 546-561页

作者： Sawada, J Univ Toronto Dept Comp Sci Toronto ON Canada

Using a new string representation, we develop two algorithms for generating nonisomorphic chord diagrams. Experimental evidence indicates that the latter of the two algorithms runs in constant amortized time. In addit... 详细信息

关键词： chord diagram generation algorithm enumeration necklace

来源：评论

学校读者我要写书评

暂无评论

algorithmS FOR TETRAHEDRAL NETWORK(TEN) generation

引用

Geo-Spatial Information Science 2000年第1期3卷 11-16页

作者： LI Qingquan LI Deren WTUSM

The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.

关键词： 3-D GIS tetrahedral network(TEN) generation algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms for generating maximum weight independent sets in circle graphs, circular-arc overlap graphs, and spider graphs

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1999年第8期E82A卷 1636-1640页

作者： Taki, M Hatakenaka, H Kashiwabara, T Nara Natl Coll Technol Dept Informat Engn Yamatokohriyama 6391080 Japan Osaka Univ Dept Informat & Comp Sci Toyonaka Osaka 5608531 Japan

In this paper we propose an algorithm for generating maximum weight independent sets in a circle graph, that is, for putting out all maximum weight independent sets one by one without duplication. The time complexity is O(n(3) + beta), where n is the number of vertices, beta output size, i.e., the sum of the cardinalities of the output sets. It is shown that the same approach can be applied for spider graphs and for circuiar-arc overlap graphs.

关键词： circle graph independent set generation algorithm intersection graph interval graph overlap graph spider graph circular-arc overlap graph

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms of Structural Fuzzy Reliability Index

引用

China Ocean Engineering 1998年第1期13卷 33-42页

作者： Hu, YC Li, XJ Zhang, LY Tianjin Univ Dept Ocean Engn & Naval Architecture Tianjin 300072 Peoples R China

In this paper the simple generation algorithms are improved. According to the geometric meaning of the structural reliability index, a method is proposed to deal with the variables in the standard normal space. With consideration of variable distribution, the correlation coefficient of the variables and its fuzzy reliability index, the feasibility and the reliability of the algorithms are proved with an example of structural reliability analysis and optimization.

关键词： structural fuzzy reliability index generation algorithm reliability analysis and optimization correlation coefficient normal space

来源：评论

学校读者我要写书评

暂无评论

A GENERAL-METHOD FOR GENERATING ODD-SHIFT ORTHOGONAL SEQUENCES

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 1995年第1期78卷 24-31页

作者： OHUE, K Member Faculty of Engineering Ehime University Matsuyama Japan 790

In general, it is difficult to derive a finite sequence which minimizes the sidelobe of the autocorrelation function. However, it is shown that there exist the even-shift orthogonal sequences, i.e., the finite sequences for which the even-shift autocorrelation function takes the zero value. The generation method also is shown. On the other hand, there has not been known the general method for generating the odd-shift autocorrelation takes the zero value. Neither have the properties of such sequences been analyzed. This paper presents the general method for deriving the odd-shift orthogonal sequences, using the complex function as the generating function and constructing the numerical sequences and odd-shift orthogonal real sequences are defined from their autocorrelation functions. Then, it is shown that those numerical sequences are odd-shift orthogonal sequences if they are skew-symmetrical sequences. Finally, the properties of the generating functions that derive those odd-shift orthogonal sequences are shown, together with the generation algorithm.

关键词： ODD-SHIFT ORTHOGONAL SEQUENCE AUTOCORRELATION FUNCTION GENERATING FUNCTION FOURIER EXPANSION generation algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：