Method Invocation

十二月的文章介绍了control flow,这些control flow语句(statement)必须被放在method之内。基本上来说,method可以被视为有意义的程序组成单元中最基本者。本次文章介绍了method及其相关的主题,包括了call stack与递归。为了语句上的连贯性,我们从循环开始说起。     

Forward-Backward Search Method

In order to simulate the process of man's“thinking forward and backward”,this paperdescribes a new search method-forward-backward search.The relationship between this searchmethod and two others,namely,statespace search and problem-reduction search,is alsodiscussed.Some examples of using forward-backward search are given,from which thecharacteristics and efficiency of this method can be seen.     

Method and device for authentication

The present invention allows even small-size verificationdevices to authenticate rights and qualifications without leakingauthentication characteristic information to third parties A ticketissuance device computes document private information mufrom a private function f of an interaction device owned by auser and document m to be transferred to the interaction device when generating interaction,and issues ticket t generated fromauthentication characteristic information x and the documentprivate information .mu. to the user.The interaction device,when document m is input,generates document private infor-mation mu using a private function f specific to the interactiondevice,and performs interaction based on the document privateinformation.The interaction comprises output of commitment r.input of challenge chi,output of response .sigma.,andmessage M output.The user converts interaction(r, .chi.,M,.sigma.)into interaction(r,.chi.,M,s)using ticket t toperform Guillou-Quisquater authentication.     

Nonuniform B-spline Mesh Fairing Method

A method for fairing a surface composed of a set of discrete data points distributed in anonrectangular topological mesh is presented.All curves are expressed by nonuniform cubic B-splinecurves.The fairing method is minimizing the elastic strain energy of mesh curves and of springs at-tached to the data points.The fairing surface can be generated by interpolating through the meshcurves.The generation and fairing of a ship hull surface is given as an example.     

A Three-Stage Knowledge Acquisition Method

This paper presents and analyzes three fundamental problems in knowledge acquisition,and proposes a general method for tackling them.The method divides the whole process of knowledge acquisition into a set of almost independent pieces,each of which can be finished by knowledge engineers,experts and assistants,respectively.     

Method to Test Online Help

This paper describes briefly common features for online help, introduces methods to test and fix errors in Search, Index, Bookmark, Contents, Links, Help UI and Graphics in online help detailedly; also describes common errors for online help UI and gives constructive solution based on the analysis of current process.     

Documentum系统中自定义Method应用

EMC Documentum是业界领先的内容管理平台.介绍中石化宁波工程公司(SNEC)在应用Documentum系统管理工程项目文档资料过程中,如何开发、部署、应用Documentum自定义Method的方法和过程,为今后进一步的开发提供借鉴.     

Implementing the Davis–Putnam Method

The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis–Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis–Putnam method efficiently using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the Davis–Putnam method can work better when unit subsumption is not used. We illustrate the performance of our programs on some quasigroup problems. The efficiency of our programs has enabled us to solve some open quasigroup problems.     

Fast Theorem-Proving and Wu s Method

In this paper,the possibility of fast algorithm is discussed for mechanical theorem proving,where the degeneracy condition are considered in designing of these algorithms.It is found that all of the methods depend seriously on some principles appearing in Wu‘s Method.In other worsd,some principles in Wu‘s Method are the instinctive properties in these new fast algorithms of theorem proving.     

A New Method for Reasoning about Action

Reasoning about action is an important aspect of common sense reasoning and planning.It gives rise to three classical problems:the frame problem,the qualification problem and the ramification problem.Existing approaches cannot deal with these problems efficiently.This paper presents a new method which uses the stratified ATMS for reasoning about action to overcome the limitations of these approaches.     

The Software Implementation Method of PWM Signal

This paper introduces the method of producing PWM signal in microcomputer control system.The specific calculation metod and a typical application is given in different condition.     

A New Method for Generating Conic Sections

This paper presents a difference method for computing vertices of the polygon inscribed in a conic section.It can be applied to computer graphic package or to plotter to generate conic sections.This metho is simpler and more efficient than traditional ones,and its form remains invariant under homogeneous affine transformations.The stability of the metho and its relationship with its matrix counterpart are also discussed.     

How Fast Is the k-Means Method?

We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyds method) for k-means clustering. Our upper bounds are polynomial in the number of points, number of clusters, and the spread of the point set. We also present a lower bound, showing that in the worst case the k-means heuristic needs to perform (n) iterations, for n points on the real line and two centers. Surprisingly, the spread of the point set in this construction is polynomial. This is the first construction showing that the k-means heuristic requires more than a polylogarithmic number of iterations. Furthermore, we present two alternative algorithms, with guaranteed performance, which are simple variants of the k-means method. Results of our experimental studies on these algorithms are also presented.     

A Method for Integrating Modelling with Decomposition

１ＩｎｔｒｏｄｕｃｔｉｏｎＷｉｔｈｔｈｅｉｎｔｒｏｄｕｃｔｉｏｎｏｆｃｏｍｐｕｔｅｒｓｉｎｔｏｍａｉｎｓｔｒｅａｍｍａｎｕｆａｃｔｕｒｉｎｇａｃｔｉｖｉｔｉｅｓ，ｆｅａｔｕｒｅ－ｂａｓｅｄｇｅｏｍｅｔｒｉｃａｌｍｏｄｅｌｈａｓｂｅｃｏｍｅｔｈｅｋ...     

Robust Segmentation Method for Doorplate Recognition System

Robot navigation based on character recognition is an effective vision method for com- pensating the disadvantage of ultrasonic and infrared sensors.A typical example of character recog- nition for mobile robot navigation is the doorplate recognition system.The captured doorplate images contain unexpected noise from irregular illumination conditions,various imaging angles,dif- ferent imaging distances,etc.The unexpected noise may still exist after segmentation step.In this paper,a robust segmentation method based on speculating the candidates of the characters and feeding back the classification result to the segmentation process is presented.If the candidates of doorplate characters cannot be determined at the segmentation step,a speculation according to known knowledge is executed.The threshold for character extraction from candidates is adjusted when the corresponding character is rejected after classification.The experimental results indicate that the recognition results are effectively improved with the proposed segmentation method.     

Some Hard Examples for the Resolution Method

Given n propositional variables,let Kn(i,j),0≤i≤j≤n,be the set(or disjunction)of all conjunctions of i literals of which exactly j literals are negative.Dunham and Wang conjectured that it may require exponential time to decide that every disjunction Kn(i,j)is not valid by the resolution metho.This paper gives a proof of the conjecture and then exhibits a new counterexample to the feasibility of the resolution or consensus method.     

A New Formal Method for Communication Protocol Specification

A new formal method for communication protocol specification is presented.FSM,CSP and ADT are mixed and the best features of these approaches can be offered in the fomal method.First,we briefly describe the formal techniques of communication protocol.We then put forward the hybrid method of protocol specification.Finally,an example,i.e.,IEEE 802.3 MAC protocol for LAN described by the proposed formal method,is given.The results of studies show that this hybrid formal method for protocol specification is a correct,unambiguous and complete approach.     

A New Concept Lattice and Incremental Construction Method

Concept lattice is an efficient formal tool for data analysis and knowledge extraction. However, the present research presumes that all the intensions of concept lattice are equally important. In order to make the best use of concept lattice for analyzing data, extracting knowledge and effectively guiding the decision-making management, the weight value is introduced into the intension of the concept lattice and a new concept lattice, a weighted concept lattice （WCL） is presented, which develops the concept lattice structure. Then one FWCL （Frequent Weighted Concept Lattice） incremental construction method is offered and relative analysis together with an example is presented to illustrate its efficiency and feasibility.