检索结果-南通市图书馆

An Aggregation Composition Compensation Method Based on Paired Net

在线全文

学校读者我要写书评

暂无评论

International Journal of Automation and computing 2012年第5期9卷 530-538页

作者： Xiao-Yong Mei 1,2 Yi-Yan Fan 2 Chang-Qin Huang 3 Ai-Jun Jiang 1 Shi-Xian Li 1 1 School of Information science and Technology,Sun Yat-sen university,Guangzhou 510006,China 2 School of computer science and Technology,Hunan university of Arts and science,Changde 415000,China 3 department of Electrical engineering and computer science,university of California,Irvine,CA,92697,USA 1. School of Information science and Technology Sun Yat-sen University Guangzhou 510006 China 2. School of computer science and Technology Hunan University of Arts and Science Changde 415000 China 3. department of Electrical engineering and computer science University of California Irvine CA 92697 USA

With regard to the failure and cancellation of business logic of web services composition(WSC),this paper propose a novel web services transaction compensation mechanism based on paired net which can dynamically establish agile compensation-triggered process(CSCP-Nets),and satisfy prospective compensation *** related execution semantics of five usual composition compensation patterns based on paired net are analyzed in the situations of successful execution,failure compensation and failure *** net based application of trip reservation process(TRP) shows that it is feasible.

关键词： Web services composition failure handling composition compensation execution semantic analysis paired net

Static Analysis of Java Bytecode

在线全文

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2001年第Z1期6卷 383-390页

作者： Jian\|jun Zhao department of computer science and engineering, Fukuoka Institute of Technology, Fukuoka 811 0295,Japan department of computer science and engineering Fukuoka Institute of Technology Fukuoka 811-0295 Japan

Understanding control flows in a computer program is essential for many software engineering tasks such as testing, debugging, reverse engineering, and maintenance. In this paper ,we present a control flow analysis technique to analyze the control flow in Java bytecode. To perform the analysis, we construct a control flow graph(CFG) for Java bytecode not only at the intraprocedural level but also at the interprocedural level. We also discuss some applications of a CFG in a maintenance environment for Java bytecode.

关键词： Control flow analysis Java virtual machine software testing software maintenance.

A Hybrid Genetic Algorithm for Reduct of Attributes in Decision System Based on Rough Set Theory

在线全文

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2002年第3期7卷 285-289页

作者： Dai Jian\|hua 1,2 , Li Yuan\|xiang 1,2 ,Liu Qun 3 1. State Key Laboratory of software engineering, Wuhan university, Wuhan 430072, Hubei,China 2. School of computer, Wuhan university, Wuhan 430072, Hubei, China 3. School of computer science, Wuhan university State Key Laboratory of Software Engineering Wuhan Hubei China (GRID:grid.49470.3e) (ISNI:***) Wuhan university School of Computer Wuhan Hubei China (GRID:grid.49470.3e) (ISNI:***) Chongqing university of Posts & Telecommunications School of Computer Science Chongqing China (GRID:grid.411587.e) (ISNI:***)

Knowledge reduction is an important issue when dealing with huge amounts of data. And it has been proved that computing the minimal reduct of decision system is NP-complete. By introducing heuristic information into genetic algorithm, we proposed a heuristic genetic algorithm. In the genetic algorithm, we constructed a new operator to maintaining the classification ability. The experiment shows that our algorithm is efficient and effective for minimal reduct, even for the special example that the simple heuristic algorithm can’t get the right result.

关键词： rough set reduction genetic algorithm heuristic algorithm

A verifiable low-level concurrent programming model based on colored Petri nets

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2011年第10期54卷 2013-2027页

作者： WANG ShengYuan & DONG Yuan department of computer science and Technology,Tsinghua university,Beijing 100084,China 1. department of computer science and Technology Tsinghua University Beijing 100084 China

Concurrent programs written in a machine-level language are being used in many areas,but the verification of such programs brings various new challenges to the programming language *** of existing contributions on verifying the safety properties of concurrent programs are for high-level languages,specifications,or calculi in the *** to the lack of abstraction at a low level,additional work is needed to extend these methods to machine-level *** paper describes an approach to integrate Petri nets into low-level concurrent programs to form a new programming model (abstract machine).A program in the programming model is a restricted version of colored Petri net,with transitions colored by assembly codes for machine-level threads,and places colored by shared data consisting of memory locations or *** analysis and verification approaches for usual Petri nets can be applied indirectly for such a low-level concurrent program.

关键词： low-level concurrent programs colored Petri nets abstract machine verification

Cluster based node scheduling method for wireless sensor networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2012年第4期55卷 755-764页

作者： WANG Lei 1,2,WEI RuiZhong 2 & TIAN ZiHong 2,3 1 College of software,Hunan university,Changsha 410082,China 2 department of computer science,Lakehead university,Thunder Bay P7B 5E1,Canada 3 Mathematics and Information science College,Hebei Normal university,Shijiazhuang 050016,China 1. College of software Hunan University Changsha 410082 China2. Department of Computer Science Lakehead University Thunder Bay P7B 5E1 Canada3. Mathematics and Information Science College Hebei Normal University Shijiazhuang 050016 China

By researching on the node scheduling problem of m-covered and connected sensor networks,a new concept of two-hops-cluster is proposed in this paper,and based on it,a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k(k≤m) different groups {0,1,...,k 1} is designed,without requiring location *** algorithm guarantees that each group to be connected and maintains the coverage ratio with high *** analysis and simulation results show that it has better performance than previous randomized scheduling scheme,and can prolong the lifetime of the sensor network effectively.

关键词： node scheduling lifetime wireless sensor network two-hops-cluster

Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2005年第9期15卷 851-856页

作者： LI Shundong**, DAI Yiqi and YOU Qiyou(department of computer science and Technology, Tsinghua university, Beijing 100084, China) department of computer science and Technology Tsinghua University Beijing 100084 China

Secure multi-party computation is a focus of international cryptography in recent years. Protocols for Yao’s millionaires’ problem have become an important building block of many secure multi-party computation protocols. Their efficiency are crucial to the efficiency of many secure multi-party computation protocols. Unfortunately, known protocols for Yao’s millionaires’ problem have high computational complexity or communication complexity. In this study, based on the 1-out-of-m oblivious transfer and set-inclusion problem, we propose a new protocol to solve this problem. This new protocol is very efficient in terms of both computational and communication complexities. Its privacy-preserving property is also proved by simulation paradigm which is generally accepted in the study of secure multi-party computation. We also compare the information leakage of our new protocol and the known protocols.

关键词： secure multi-party computation Yao’s millionaires’ problem 1-out-of-m oblivious transfer set-inclusion problem.

Dynamic Slicing of Object Oriented Programs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2001年第Z1期6卷 391-397页

作者： Jian\|jun Zhao department of computer science and engineering, Fukuoka Institute of Technology, Fukuoka 811 0295, Japan department of computer science and engineering Fukuoka Institute of Technology Fukuoka 811-0295 Japan

Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.

关键词： program slicing dynamic dependence graph object oriented program software maintenance debugging testing

Structural Indexing for 3D Solid Digital Library

在线全文

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2001年第Z1期6卷 438-442页

作者： Han Shui\|hua, Lu Zheng\|ding, Chen Chuan\|bo department of computer engineering, Huazhong university of science and Teclonogy, Wuhan 430074,Chian department of computer engineering Huazhong University of Science and Teclonogy Wuhan Chian

In a very large digital library that support computer aided collaborative design, an indexing process is crucial whenever the retrieval process has to select among many possible designs. In this paper, we address the problem of retrieving important design and engineering information by structural indexing. A design is represented by a model dependency graph, therefor, the indexing problem is to determine whether a graph is present or absent in a database of model dependency graphs. we present a novel graph indexing method using polynomial characterization of a model dependency graph and on hashing. Such an approach is able to create an high efficient 3D solid digital library for retrieving and extracting solid geometric model and engineering information.

关键词： digital library computer aided design model dependency graphs hashing indexing

A new heuristic algorithm for the circular packing problem with equilibrium constraints

在线全文

学校读者我要写书评

暂无评论

science China(Information sciences) 2011年第8期54卷 1572-1584页

作者： LIU JingFa 1,2,LI Gang 3 & GENG HuanTong 1 1 School of computer and software,Nanjing university of Information science & Technology,Nanjing 210044,China 2 Network Information Center,Nanjing university of Information science & Technology, Nanjing 210044,China 3 School of Mathematics and Physics,Nanjing university of Information science & Technology,Nanjing 210044,China 1. School of computer and software Nanjing University of Information Science & Technology Nanjing 210044 China2. Network Information Center Nanjing University of Information Science & Technology Nanjing 210044 China3. School of Mathematics and Physics Nanjing University of Information Science & Technology Nanjing 210044 China

The circular packing problem with equilibrium constraints is an optimization problem about simplified satellite module layout design.A heuristic algorithm based on tabu search is put forward for solving this *** algorithm begins from a random initial configuration and applies the gradient method with an adaptive step length to search for the minimum energy *** jump out of the local minima and avoid the search doing repeated work,the algorithm adopts the strategy of tabu *** the process of tabu search,we improve the traditional neighboring solutions,tabu objects and the acceptance criteria of the current solution *** test two sets of benchmarks consisting of 11 representative instances from the current *** numerical results show that the proposed algorithm breaks the records in seven out of 11 instances,and obtains the optimal solutions for the other four instances.

关键词： equilibrium constraints packing problem heuristic algorithm tabu search layout optimization