检索结果-南通市图书馆

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 430074, china) 1. College of computer science Huazhong University of Science and Technology 430074 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

An architecture for mobile database management system

在线全文

学校读者我要写书评

暂无评论

Journal of university of science and technology Beijing 2002年第2期9卷 156-160页

作者： Dong Li and Yucai Feng computer School, huazhong university of science and technology, wuhan 430074, china computer School Huazhong University of Science and Technology Wuhan 430074 China

In order to design a new kind of mobile database management system (DBMS)more suitable for mobile computing than the existent DBMS, the essence of database systems in mobilecomputing is analyzed. An opinion is introduced that the mobile database is a kind of dynamicdistributed database, and the concept of virtual servers to translate the clients' mobility to theservers' mobility is proposed. Based on these opinions, a kind of architecture of mobile DBMS, whichis of versatility, is presented. The architecture is composed of a virtual server and a local DBMS,the virtual server is the kernel of the architecture and its functions are described. Eventually,the server kernel of a mobile DBMS prototype is illustrated.

关键词： mobile database dynamic distributed database DBMS architecture virtual server data region

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 430074,china 1. School of computer science and technology Huazhong University of Science and Technology Wuhan 430074 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 430074, china 1. School of computer science and technology Huazhong University of Science and Technology Wuhan 430074 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

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 430074, china College of computer science and technology Huazhong University of Science and Technology Wuhan 430074 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

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 430074, Hubei, china huazhong university of science and technology College of Computer Science and Technology Wuhan Hubei China (GRID:grid.33199.31) (ISNI:***)

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

Spiral waves in CIMA model and its LBGK simulation

在线全文

学校读者我要写书评

暂无评论

Communications in Nonlinear science and Numerical Simulation 2001年第2期6卷 68-73页

作者： Qing LI, Chuguang ZHENG and Nengchao WANG College of computer science and technology, huazhong university of science and technology, wuhan 430074, china e-mail: qingli @ public. *** State Key Laboratory of Coal Combustion, huazhong university College of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China State Key Laboratory of Coal Combustion Huazhong University of Science and Technology Wuhan 430074 China Parallel Computation Institute Huazhong University of Science and Technology Wuhan 430074 China

Two type of structures-Turing patterns and spiral waves-are obtained in chloride-iodide-malonic acid (CIMA) reaction-diffusion model by using lattice Bhatnagar-Gross-Krook (LBGK) method.

关键词： lattice Boltzmann method reaction-diffusion Turing patterns spiral waves

Broadcast Scheduling Strategy Based on the Priority of Real-Time Data in a Mobile Environment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

wuhan university Journal of Natural sciences 2003年第2A期8卷 368-372页

作者： Yang Jin-cai, Liu Yun-shengSchool of computer science and technology, huazhong university of science and technology , wuhan 430074, Hu-bei, china huazhong university of science and technology School of Computer Science and Technology Wuhan Hubei China (GRID:grid.33199.31) (ISNI:***)

Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel, scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels. In order to meet the requirement of real-time data disseminating and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.

关键词： mobile computing real-time timing constraint priority broadcast scheduling

A fast algorithm for color image enhancement with total variation regularization

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第9期53卷 1913-1916页

作者： LI Ming1,2 1School of computer science and technology,huazhong university of science and technology,wuhan 430074,china 2Key Laboratory of Education Ministry for Image Processing and Intelligent Control,wuhan 430074,china 1. School of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China2. Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan 430074 China

In this paper,a novel algorithm for color image enhancement is *** proposed method,which is based on Retinex theory and total variational framework,improves the original variational method by using a TV penalty term to force spatial smoothness on the reflectance *** split Bregman algorithm is employed to solve the proposed *** practical experiments,it is verified that our method obtains better enhancement performance and much better calculation efficiency.

关键词： color image enhancement Retinex theory total variational model split Bregman algorithm