检索结果-南通市图书馆

Genetic Algorithm for Chinese Postman Problems

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2003年第S1期8卷 316-318页

作者： Jiang Hua, Kang Li-shanstate key laboratory of software {4., wuhan university,wuhan 430072,hubei, china wuhan university State Key Laboratory of Software Engineering Wuhan Hubei China (GRID:grid.49470.3e) (ISNI:***)

Chinese Postman Problem is an unsettled graphic problem. It was approached seldom by evolutionary computation. Now we use genetic algorithm to solve Chinese Postman Problem in undirected graph and get good results. It could be extended to solve Chinese postman problem in directed graph. We make these efforts for exploring in optimizing the mixed Chinese postman problem.

关键词： Chinese postman problem Eularian graph genetic algorithm evolutionary computation

A hybrid matching method for geospatial services in a composition-oriented environment

在线全文

学校读者我要写书评

暂无评论

Science china(Technological Sciences) 2010年第S1期53卷 213-220页

作者： LUO An 1,2,WANG YanDong 1,2 & CHEN ShengHua 2 1 state key laboratory of software {4.,wuhan university,wuhan 430072,china 2 state key laboratory of Information {4. in Surveying,Mapping and Remote Sensing,wuhan university,wuhan 4.0079,china 1. state key laboratory of software {4. Wuhan University Wuhan 430072 China 2. state key laboratory of Information engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430079 China

With the development of Internet and GIS,large volumes of spatial data,powerful computing resources and many spatial data processing functions are published in the form of Web *** suitable geospatial services in the composition-oriented environment is a crucial *** semantic Web provides a kind of technology to find and compose various service resources automatically through the *** paper proposes a hybrid method for the semantic matching of geospatial *** method includes two *** 1 puts forward a multi-level semantic matching approach,which matches single geospatial service at four levels:classification,input/output,precondition/effect and the quality of service(QoS).This multi-level matching approach makes single service matching quicker and more *** 2 puts forward a matching algorithm for a geospatial service chain based on the *** algorithm adopts a trace algorithm,taking account of the effect of the *** restricts the input/output parameters of the current service by the input/output parameters of service chain,pre-service and *** matches the atomic service dynamically in a composition-oriented environment,and accurately converts the abstract model of geospatial services into an executable geospatial service chain.A case study of the flood analysis for the Poyang Lake illustrates the effectiveness of our context-based matching method for geospatial services.

关键词： geospatial services semantic context composition service match

Singularity of Some software Reliability Models and Parameter Estimation Method

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2000年第1期5卷 35-40页

作者： XU Ren-zuo ZHOU Rui YANG Xiao-qing (state key laboratory of software {4., wuhan university, wuhan 430072, china) wuhan university State Key Laboratory of Software Engineering Wuhan China (GRID:grid.49470.3e) (ISNI:***)

According to the principle, “The failure data is the basis of software reliability analysis”, we built a software reliability expert system (SRES) by adopting the artificial intelligence technology. By reasoning out the conclusion from the fitting results of failure data of a software project, the SRES can recommend users “the most suitable model” as a software reliability measurement model. We believe that the SRES can overcome the inconsistency in applications of software reliability models well. We report investigation results of singularity and parameter estimation methods of experimental models in SRES.

关键词： software reliability measurement models software reliability expert system singularity parameter estimation method path following method maximum likelihood ML-fitting algorithm

Gradient Gene Algorithm: a Fast Optimization Method to MST Problem

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2001年第Z1期6卷 535-540页

作者： Zhang Jin bo, Xu Jing wen, Li Yuan xiang state key laboratory of software {4., wuhan university, wuhan 430072, china state key laboratory of software {4. Wuhan University Wuhan China

The extension of Minimum Spanning Tree(MST) problem is an NP hard problem which does not exit a polynomial time algorithm. In this paper, a fast optimization method on MST problem——the Gradient Gene Algorithm is introduced. Compared with other evolutionary algorithms on MST problem, it is more advanced: firstly, very simple and easy to realize; then, efficient and accurate; finally general on other combination optimization problems.

关键词： combination optimization minimum spanning tree problem extension of minimum spanning tree problem gradient gene algorithm

Code Component Reuse Supporting Environment (CCRSE) and Its Design Strategy

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2003年第2A期8卷 363-367页

作者： Ying Shi, Xu Gang,Yuan Sheng-qiong, Chen Haostate key laboratory of software {4., wuhan university, wuhan 430072, hubei, china wuhan university

Code Component Reuse Supporting Environment (CCRSE), which has been developed by us, is an integrated development environment. CCRSE can provide comprehensive supports for the whole process of reusing code component in the manner of dynamic composition. The architecture and functionality of CCRSE are introduced. The key achievement is giving the three strategies that are vital to successfully design CCRSE. The three strategies include: (1) according to the three pivotal technologies (encapsulation, composition and management) for supporting composition reuse of code component, design three tools respectively. (2) keep tool for supporting code component development independent of tool for supporting code component composition. (3) strictly restrict code component specification, provide the strong plug and play support for code component composition reuse, and furthest provide transparence to strictly restricted specification of code component in development of component itself.

关键词： Codes (symbols) Design Management

An efficient method for detecting concurrency errors in object-oriented programs

在线全文

学校读者我要写书评

暂无评论

Science china(Information Sciences) 2012年第12期55卷 2774-2784页

作者： HE YanXiang 1,2,WU Wei 2 & CHEN Yong 2 1 School of Computers,wuhan university,wuhan 430072,{4. 2 state key laboratory of software engineering,wuhan university,wuhan 430072,{4. 1. School of Computers Wuhan University Wuhan 430072 China2. State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

Multicore and multi-threaded processors have become the norm for modern ***,concurrent programs have become more and more prevalent despite being difficult to write and *** errors are highly likely to appear in concurrent code,conventional error detection methods such as model checking,theorem proving,and code analysis do not scale smoothly to concurrent *** is an indispensable technique for detecting concurrency errors,but it involves a great deal of manual work and is *** paper presents an automatic method for detecting concurrency errors in classes in object-oriented *** method uses a heuristic algorithm to automatically generate test cases that can effectively trigger ***,each test case is executed automatically and a fast method is adopted to identify the actual concurrency error from anomalous run *** have implemented a prototype of the method and applied it to some typical Java *** shows that our method is more effective and faster than previous work.

关键词： concurrency error dynamic test data race atomicity violations test case generation

Cell Evolutionary Algorithm: a New Optimization Method on Ground-state Energy of the Atomic

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2000年第4期5卷 425-430页

作者： Liu Lian-jun, Xu Jing-wen, Mao You-dong, Li Yuan-xiang Department of Physics, wuhan university, wuhan 430072,china state {4. laboratory of software engineering,wuhan university, wuhan 430072, china wuhan university Department of Physics Wuhan China (GRID:grid.49470.3e) (ISNI:***) wuhan university State Key Laboratory of Software Engineering Wuhan China (GRID:grid.49470.3e) (ISNI:***)

The purpose of this paper is to present a new general approach to solve ground-state energies of the double-electron systems in a uniform magnetic field, in which the basic element of evolution is the set in the solution space, rather than the point. The paper defines the Cell Evolutionary Algorithm, which implements such a view of the evolution mechanism. First, the optimal set in which the optimal solution may be obtained. Then this approach applies the embedded search method to get the optimal solution. We tested this approach on the atomic structure, and the results show that it can improve not only the efficiency but also the accuracy of the calculations as it relates to this specific problem.

关键词： key words double electron systems ground state energy variational principle cell evolutionary algorithm evolutionary algorithm

New Refinement Relations of Z Specifications for Multiple Viewpoints Oriented Requirements Method

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2001年第Z1期6卷 304-312页

作者： He Yan xiang, Song Qiang, Huang Qian School of Computer, state key laboratory of software {4. wuhan university, wuhan 430072, china School of Computer State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

In this paper we develop several new refinement relations of Z for multiple viewpoints oriented requirements method (MVORM). The original motivation is that we found the standard Z refinement relation is not adequate or correct when considering specifications that have temporal relationships of operations. The concept of temporal state variables is introduced into Z. Then new implementation relations are defined and new refinement relations are deduced, mainly for temporal state variables to process temporal relationships of operations. We use state transition systems to abstract the temporal state transitions. A simple example is used to show the procedures of MVORM. Finally some directions of further work are forwarded.

关键词： temporal state variable formal description language state transition system implementation relation refinement relation multiple viewpoints oriented requirements method

An Inversion Evolutionary Algorithm on How to Convert FDP to TSP

在线全文

学校读者我要写书评

暂无评论

wuhan university Journal of Natural Sciences 2001年第Z1期6卷 589-592页

作者： Xu Jing wen, Zhang Jin bo, Li Yuan xiang state key laboratory of software {4.,wuhan university, wuhan 430072, china state key laboratory of software {4. Wuhan University Wuhan China

The Film Copy Deliverer Problem (FDP),much more difficult than TSP,is a new problem in the combination optimization. In this paper,a new algorithm is introduced. First,the FDP is converted to TSP. Then an evolutionary algorithm based on inversion operator is adopted. Compared with other Genetic Algorithms,it is not only more simple and easier to realize but also faster and more accurate.

关键词： film copy deliverer problem (FDP) traveling salesman problem (TSP) evolutionary algorithm inversion operation