检索结果-南通市图书馆

Selection of unitary operations in quantum secret sharing without entanglement

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第9期54卷 1837-1842页

作者： XU Juan 1,CHEN HanWu 1,LIU WenJie 1,2.& LIU ZhiHao 1 1 School of computer {2. and engineering,southeast University,nanjing 210096,china 2.School of computer and Software,nanjing University of Information {2. and Technology,nanjing 2.0044,china School of computer {2. and engineering Southeast University School of computer and Software Nanjing University of Information Science and Technology

We propose a substitute-Bell-state attack strategy for quantum secret sharing schemes without entanglement,as well as a definition of the minimum failure probability of such attack strategy.A quantitative analysis of security degrees corresponding to different unitary operations is also provided,when the secret sharing schemes without entanglement are stricken by substitute-Bell-state *** a result,the relation between the selection of unitary operations and the effect of substitute-Bell-state attack is shown,which can serve as an important guidance for the selection of unitary operations in designing and implementing quantum secret sharing schemes.

关键词： quantum secret sharing substitute-Bell-state attack unitary operation minimum failure probability

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science in china(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2.& WU Cheng3 1 School of computer {2. & engineering, southeast University, nanjing 210096, china 2.Key Laboratory of computer Network and Information Integration (southeast University), Ministry of Education, nanjing 210096, china 3 Department of Automation, Tsinghua University, Beijing 100084, china School of computer {2. & engineering Southeast University Key Laboratory of computer Network and Information Integration (southeast University) Ministry of Education Department of Automation Tsinghua University

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

A Feedback-Based Web Search Engine

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2004年第5期9卷 561-568页

作者： ZHANG Wei-feng 1,2.3 , XU Bao-wen 2.3,4 , ZHOU Xiao-yu 2.3,4 1. Department of computer science and {2., nanjing University of Posts and Telecommunications, nanjing 2.0003, Jiangsu, china 2. Department of computer science and {2., southeast University, nanjing 210096, Jiangsu, china 3. Jiangsu Institute of Software Quality, nanjing 210096 Jiangsu, china 4. The State Key Laboratory of Software {2., Wuhan University, Wuhan 430072. Hubei, china Department of computer science and {2. Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Department of computer science and {2. Southeast University Najing Jiangsu China Jiangsu Institute of Software Quality Nanjing Jiangsu China The State Key Laboratory of Software engineering Wuhan University Wuhan Hubei China

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected by them. Since the selections of the search results cannot affect the future ones, they may not cover most people’s interests. In this paper, feedback information produced by the user’s accessing lists will be represented by the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability. Key words WWW - search engine - query reconstruction - feedback CLC number TP 311. 135.4 Foundation item: Supported by the National Natural science Fundation of china (60373066). National Grand Fundamental Research 973 Program of china (2.02.B312.0). Opening Foundation of State Key Laboratory of Software engineering in Wuhan University, Opening Foundation of Jiangsu Key Laboratory of computer Information Processing Technology in Soochow UniversityBiography: ZHANG Wei-feng (1975-), male, Ph.D. research direction: artificial intelligence, search engine, data mining, network language.

关键词： WWW search engine query reconstruction feedback

Web Application Comprehension Based on Dependence Analysis

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2004年第5期9卷 731-734页

作者： WU Jun-hua 1,2., XU Bao-wen 1 , JIANG Ji-xiang 1 1.Department of computer science and {2., southeast University, nanjing 210096, Jiangsu, china 2.College of computer science and {2., nanjing University of Technology, nanjing 2.0009, Jiangsu , china Department of computer science and {2. Southeast University Nanjing Jiangsu China College of computer science and {2. Najing University of Technology Nanjing Jiangsu China

Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and difficult task. Insufficient design, illogical code structure, short documents will enhance the comprehensive difficulty. Developing Web application is usually a process with quick implementation and delivery. In addition, generally a Web application is coded by combining mark language statements with some embedded applets. Such programming mode affects comprehension of Web applications disadvantageously. This paper proposes a method to improving understanding Web by dependence analysis and slice technology. Key words Web application comprehension - program dependence - hyper graph - pogram slicing CLC number TP 311 Foundation item: Supported in part by the Young Scientist’s Fund of NSFC (60373066, 6030302.). National Grand Fundamental Research 973 Program of china (2.02.B312.00) and National Research Foundation for the Doctoral Program of Higher Education of chinaBiography: WU Jun-hua (1965-), female, Ph. D. research direction: software {2..

关键词： Web application comprehension program dependence hyper graph pogram slicing

Non-blocking message total ordering protocol

在线全文

学校读者我要写书评

暂无评论

science in china(Series F) 2008年第12期51卷 1919-1934页

作者： WANG Yun & WANG JunLing School of computer {2. & engineering, southeast University Key Lab of computer Network & Information Integration, MOE, nanjing 210096, china School of computer {2. & engineering Southeast University Key Lab of computer Network & Information Integration MOE

Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.

关键词： total ordering protocol non-blocking active replication fault tolerance token ring

Constructing Three-Dimension Space Graph for Outlier Detection Algorithms in Data Mining

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2004年第5期9卷 585-589页

作者： ZHANG Jing 1,2., SUN Zhi-hui 1 1.Department of computer science and {2., southeast University, nanjing 210096, Jiangsu, china 2.Department of Electricity and Information {2., Jiangsu University, Zhenjiang 2.2.01, Jiangsu, china Department of computer science and {2. Southeast University Nanjing 210096 Jiangsu China

Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory. Key words outlier - detection - three-dimensional space graph - data mining CLC number TP 311. 13 - TP 391 Foundation item: Supported by the National Natural science Foundation of china (70371015)Biography: ZHANG Jing (1975-), female, Ph. D, lecturer, research direction: data mining and knowledge discovery.

关键词： outlier detection three-dimensional space graph data mining

Predicting the Maintainability of Open Source Software Using Design Metrics

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2008年第1期13卷 14-20页

作者： ZHOU Yuming1,2. XU Baowen1,3 1. School of computer {2. and engineering, southeast University, nanjing 210096, Jiangsu,china 2. Department of Computing, Hong Kong Polytechnic University, Hong Kong, china 3. Jiangsu Institute of Software Quality, nanjing 210096, Jiangsu,china School of computer {2. and engineering Southeast University Nanjing China Department of Computing Hong Kong Polytechnic University Hong Kong China Jiangsu Institute of Software Quality Nanjing China

This paper empirically investigates the relationships between 15 design metrics and maintainability of 148 Java open source software. The results show that size and complexity metrics are strongly related to the maintainability of open source software. However, cohesion and coupling, as currently captured by existing metrics, do not seem to have a significant impact on maintainability. When used together, these metrics can predict system maintainability fairly accurately （mean MREs below 30%）.

关键词： open source: object-oriented maintainability metric prediction regression

Dependence Analysis Based on Dynamic Slicing for Debugging

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2001年第Z1期6卷 398-404页

作者： Chen Zhen qiang 1, Xu Bao wen 1,2.1 Department of computer science & {2., southeast University, nanjing 210096, china 2.State Key Laboratory of Software {2., Wuhan University, Wuhan 430072. china Department of computer science & {2. Southeast University Nanjing 210096 China

Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually affect the variables in the slicing criterion. This paper proposes a dynamic slicing method based on static dependence analysis. It uses the program dependence graph and other static information to reduce the information needed to be traced during program execution. Thus, the efficiency is dramatically improved while the precision is not depressed. The slicing criterion is modified to fit for debugging. It consists of file name and the line number at which the statement is.

关键词： program slice slicing criterion program dependence graph

Evolving Objects for Software engineering

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2001年第Z1期6卷 263-267页

作者： Wang xiao\|ling, Dong yi\|sheng Department of computer science and {2. southeast university, nanjing 2.0018,china Department of computer science and {2. southeast university Nanjing 210018 China

This paper is concerned with evolving objects method for software design that can adapt to the changing environments and requirements automatically. We present system architecture with objects library, where there are objects based on domain ontologies. We define some genetic operators for objects, and discuss how to apply these genetic operators on objects to get new objects, which can satisfy new requirements.

关键词： object oriented ontology evolving objects meta object genetic operator mutation operator crossover operator