检索结果-南通市图书馆

A New Clustering Algorithm for Categorical Attributes

在线全文

学校读者我要写书评

暂无评论

International Journal of Minerals,Metallurgy and Materials 2000年第4期14卷 318-322页

作者： Songfeng Lu, Zhengding Lu (College of computer science and technology, huazhong university of science and technology, wuhan 4.0074. china) College of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China

In traditional data clustering, similarity of a cluster of objects is measured by distance between objects. Such measures are not appropriate for categorical data. A new clustering criterion to determine the similarity between points with categorical attributes is pre- sented. Furthermore, a new clustering algorithm for categorical attributes is addressed. A single scan of the dataset yields a good clus- tering, and more additional passes can be used to improve the quality further.

关键词： data mining clustering similarity Information

Quasi-physical global optimization method for solving the equal circle packing problem

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第7期54卷 1333-1339页

作者： HUANG WenQi & YE Tao school of computer science and technology,huazhong university of science and technology,wuhan 4.0074.china school of computer science and technology Huazhong University of Science and Technology Wuhan China

The equal circle packing problem is a well-known challenge in *** is also a natural,clear and fair test system for global *** paper presents a quasi-physical global optimization algorithm for solving the equal circle packing *** algorithm simulates two kinds of movements of N elastic disks: smooth movement driven by elastic pressures and violent movement driven by strong repulsive forces and attractive *** smooth movement makes the disks reach a locally optimal configuration,while the violent movement makes them jump out of the local optimum trap and reach a more promising *** algorithm is tested on the widely studied instances of N = 1,2,...,*** find better packings than the reported best-known ones on 37 instances and reproduce the best-known results on the remaining 113 instances.

关键词： equal circle packing global optimization quasi-physical method heuristic

A quasi-human algorithm for solving the three-dimensional rectangular packing problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第12期53卷 2389-2398页

作者： HE Kun & HUANG WenQi school of computer science and technology, huazhong university of science and technology, wuhan 4.0074. china school of computer science and technology Huazhong University of Science and Technology Wuhan China

Based on the concept of maximal rectangular space that can be filled at current time and the siege warfare tactics, we make several critical improvements on the quasi-human caving-degree approach to get a stronger algorithm ICDA for a classical NP hard problem: the three-dimensional rectangular packing problem. Within similar computing time, the new algorithm gained an average volume utilization of 90.92% on the natural and difficult 100 benchmarks, called BR15, where items to be packed are almost different in size. Compared with current best record just reported in the literature in 2010, our result makes an improvement by 0.54%.

关键词： NP hard three-dimensional packing quasi-human action space caving degree

A quasi-physical algorithm for solving the linear separation problem in n-dimensional space

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Central South university of technology 2001年第4期8卷 272-277页

作者： HUANG Jia yuan (College of computer science, huazhong university of science and technology, wuhan 4.0074. china) College of computer science Huazhong University of Science and Technology Wuhan China

A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional *** original idea of the quasi physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result,the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasi physical algorithm is about 10-50 times of the LMS algorithm’s for representative instances. A typical Boolean valued instance shows that it is hard for ETL algorithm but very easy for the quasi physical *** this instance, point set A and B is {000, 010, 011, 111} and {001,100}, respectively.

关键词： linear separation problem neural network algorithm quasi-physical method electrostatics

Numerical simulations and experimental investigations on transverse effects of two-wave mixing in a photovoltaic photorefractive crystal

在线全文

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2010年第5期53卷 856-863页

作者： CAI Xin1,2,LIU JinSong1 & WANG ShengLie1 1 wuhan National Laboratory for Optoelectronics,school of Optoelectronic science and Engineering,huazhong university of science and technology,wuhan 4.0074.china 2 school of science,wuhan university of technology,wuhan 430070,china wuhan National Laboratory for Optoelectronics School of Optoelectronic Science and Engineering Huazhong University of Science and Technology Wuhan China school of science Wuhan University of Technology Wuhan China

The transverse effects of two Gauss waves mixing in a photovoltaic photorefractive crystal,i.e.,the dynamical evolutions of signal beam with different parameters,are traced numerically and *** the one-dimensional numerical simulations and two-dimensional experimental investigations show that the self-focusing effect of signal beam becomes more obvious as the intensity of pump beam and the angle between the signal and pump beams *** accordance with these results,the state of two Gaussian waves mixing is controllable.

关键词： numerical simulation experimental investigation two-wave mixing transverse effects Gaussian distribution

Representation and Adaptive Transformation of Reusable Software Components

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural sciences 2001年第Z1期6卷 298-303页

作者： Xu Zheng quan, Palakiyem Wallah College of computer science and technology,huazhong university of science and technology, wuhan 4.0074. china College of computer science and technology Huazhong University of Science and Technology Wuhan China

The key ingredient for promoting software reuse in a repository base integrated development environment, is to provide support for the software developer who wants to search the repository to locate and retrieve suitable software components for reuse. This paper presents that reusable software components form a base to provide a flexible representation of component adaptability to any repository with a specific classification. As an alternative, it proposes to automatically identify and convert the component source code with all its information into a standard form, so that components can be transferred from one type of library to another.

关键词： reusable software component classification representation adaptability transfer

Corner occupying theorem for the two-dimensional integral rectangle packing problem

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第11期55卷 2466-2472页

作者： HUANG WenQi1,YE Tao1 & CHEN DuanBing2 1school of computer science and technology,huazhong university of science and technology,wuhan 4.0074.china 2Web sciences Center,school of computer science,university of Electronic science and technology of china,Chengdu 611731,china school of computer science and technology Huazhong University of Science and Technology Wuhan China Web sciences Center School of Computer Science University of Electronic Science and Technology of China Chengdu China

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem,stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping,then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the *** on this theorem,we might develop e?cient heuristic algorithms for solving the integral rectangle packing *** fact,as a vague conjecture,this theorem has been implicitly mentioned with different appearances by many people for a long time.

关键词： rectangle packing bottom-left corner occupying theorem NP hard

FRACTAL GEOMETRY STUDY OF CORRELATION BETWEEN IMPACT TOUGHNESS OF STEEL AND PARAMETERS OF FREE-CUTTING PHASE

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Metallurgica Sinica(English Letters) 1992年第4期5卷 250-255页

作者： JIANG Laizhu CUI Kun huazhong university of science and technology,wuhan,china huazhong Univ of science and Technology Wuhan China

Studies were made of the calculation of fractal dimension of transverse impact fracture sur- face,and of the correlation between impact toughness of steel and parameters of free-cutting phase by means of the developed fractal geometry model of crack *** is believed that the area fraction,f,of free-cutting phase is negligibly influential to the longitudinal im- pact toughness,as f1 .While the aspect ratio,saying ratio of length to width,of free-cut. ting phase is inversely influential to the transverse impact *** may .be the reason why the transverse impact toughness of free-cutting steel containing more rare earth contrast to sulphur is even higher than the low sulphur containing steel.

关键词： fractal geometry impact toughness free-cutting phase

File Assignment Policy in Network Storage System

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural sciences 2003年第4A期8卷 1075-1080页

作者： Cao Qiang, Xie Chang-sheng College of computer science and technology, huazhong university of science and technology, wuhan 4.0074. Hubei, china College of computer science and technology Huazhong University of Science and Technology Wuhan Hubei China

Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however, mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data placement in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.

关键词： file assignment network storage network attached disk