This paper introduces an automatically reasoning system for inferring linear and quadratic surface solids from incomplete three views. The method is based on human reasoning. Initially, quadratic surface primitives are recognized and extracted according to possibility computation. Then, the data relative only to quadratic surface primitives are removed from the given three views and polyhedrons are constructed based on the remaining data. The final solid is constructed by assembling all the generated quadratic surface primitives and the polyhedrons. The system has been implemented in C and OpenGL on Windows NT. The constructed solid can be observed at any angle by rotating it using the keyboard. Many examples are tested and the experimental results show that the system is very robust, and can accurately and effectively construct a suitable solid composed of linear and quadratic surfaces from incomplete three views.

Pen-based user interfaces which leverage the affordances of the pen provide users with more flexibility and natural interaction. However, it is difficult to construct usable pen-based user interfaces because of the lack of support for their development. Toolkit-level support has been exploited to solve this problem, but this approach makes it hard to gain platform independence, easy maintenance and easy extension. In this paper a context-aware infrastructure is created, called WEAVER, to provide pen interaction services for both novel pen-based applications and legacy GUI-based applications. WEAVER aims to support the pen as another standard interactive device along with the keyboard and mouse and present a high-level access interface to pen input. It employs application context to tailor its service to different applications. By modeling the application context and registering the relevant action adapters, WEAVER can offer services, such as gesture recognition, continuous handwriting and other fundamental ink manipulations, to appropriate applications. One of the distinct features of WEAVER is that off-the-shelf GUI-based software packages can be easily enhanced with pen interaction without modifying the existing code. In this paper, the architecture and components of WEAVER are described. In addition, examples and feedbacks of its use are presented.

To solve the problems of the interleaving assumption and the single resource in PUNITY (Petri net and UNITY) and Petri net respectively, this paper proposes a set of mapping rules from PUNITY to UniNet. Based on these rules, problems of one field can be transformed to problems of the other field and powerful tools of Petri net and UNITY can be used. The paper gives a sketch of the mapping rules and applies the rules to an example. Meanwhile, the mapping rules can help computer to translate PUNITY to UniNet easily.

In this paper, the computational complexity of propositional clause set counterfactuals is discussed. It is shown that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and that the computational complexity of propositional Horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore, some polynomial algorithms are presented for some special propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time.

In this paper, an equivalence condition for deciding whether a default theory is an auto-compatible default one is presented. Under the condition, the existence of extension of an auto-compatible default theory is a natural result. By introducing a well-ordering over the set D of default rules, the extensions of an auto-compatible default theory (D,W) can be computed directly. The condition represents clearly the characterization of an auto-compatible default theory, and some properties about auto-compatible default theory, such as semi-monotonicity, become natural corollaries. Based on the characterization, the revision of default beliefs is discussed to ensure the existence of extension of the default theory, and the method is applied to investigate stable models of a general logic program.

The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer. However, most existing proxy signature schemes do not support nonrepudiation. In this paper, two secure nonrepudiable proxy multi-signature schemes are proposed that overcome disadvantages of the existing schemes. The proposed schemes can withstand public key substitution attack. In addition, the new schemes have some other advantages such as proxy signature key generation and updating using insecure channels. This approach can also be applied to other ElGamal-like proxy signature schemes.

In this paper, a system is presented where documents are no longer identified by their file names. Instead, a document is represented by its semantics in terms of descriptor and content vector. The descriptor of a document consists of a set of attributes, such as date of creation, its type, its size, annotations, etc. The content vector of a document consists of a set of terms extracted from the document. In this paper, a semantic document management system XBASE is designed and implemented based on the semantics and the functions of three main modules, X-Loader, X-Explorer and X-Query.

Cluster analysis is a process to classify data in a specified data set. In this field, much attention is paid to high-efficiency clustering algorithms. In this paper, the features in the current partition-based and hierarchy-based algorithms are reviewed, and a new hierarchy-based algorithm PHC is proposed by combining advantages of both algorithms, which uses the cohesion and the closeness to amalgamate the clusters. Compared with similar algorithms, the performance of PHC is improved, and the quality of clustering is guaranteed. And both the features were proved by the theoretic and experimental analyses in the paper.

A Petri net approach to determining the conditions for stability of a re-entrant system with buffer priority scheduling policy is described in this paper. The concept of buffer boundedness based on the dynamic behavior of the markings in the system model is emphasized. The method is used to demonstrate the stability of the first buffer first served (FBFS) and the last buffer first served (LBFS) scheduling policies. Finally a sufficient condition for instability of systems with a positive feedback loop (PFL) is established, and an example is given.

This paper presents an introduction to the initial design of the Structured Hypertext Transfer Protocol (STTP), a compatible extension to the HTTP. It includes a new message set for the control of resource transmission, and the Structured Hypertext Markup Language (STML) for describing the structural information of Web pages. Experimental tests show that STTP can be significantly faster than HTTP, with the improvement of transmission time being around 70% to 400% and the same magnitude of packet savings, which is among the best performance improvement ever reported. The paper discusses the basic idea and major design considerations of these components, as well as a few important issues in developing STTP servers and clients.

It is the time to explore the fundamentals of DDT testing when extensive work has been done for DDT testing since it was proposed. This paper precisely defines the concept of average transient current DDT of CMOS digital ICs, and experimentally analyzes the feasibility of DDT test generation at gate level. Based on the SPICE simulation results, the paper suggests a formula to calculate DDT by means of counting only logical up-transitions, which enables DDT test generation at logic level. The Bayesian optimization algorithm is utilized for DDT test generation. Experimental results show that about 25% stuck-open faults are with DDT testability larger than 2.5, and likely to be DDT testable. It is also found that most DDT testable faults are located near the primary inputs of a circuit under test. DDT test generation does not require fault sensitization procedure compared with stuck-at fault test generation. Furthermore, some redundant stuck-at faults can be detected by using DDT testing.

The paper proposes a novel ATPG (Automatic Test Pattern Generation) method based on RTL (Register Transfer Level) behavioral descriptions in HDL (Hardware Description Language). The method is simulation-based. Firstly, it abstracts RTL behavioral descriptions to Process Controlling Trees (PCT) and Data Dependency Graphs (DDG), which are used for behavioral simulation and data tracing. Transfer faults are extracted from DDG edges, which compose a fault set needed for test generation. Then, simulation begins without specifying inputs in advance, and a request-echo strategy is used to fix some uncertain inputs if necessary. Finally, when the simulation ends, the partially fixed input sequence is the generated test sequence. The proposed request-echo strategy greatly reduces unnecessary backtracking, and always tries to cover uncovered transfer faults. Therefore, the proposed method is very efficient, and generates tests with good quality. Experimental results demonstrate that the proposed method is better than ARTIST in three aspects: (1) the CPU time is shorter by three orders of magnitude; (2) the test length is shorter by 52%; and (3) the fault coverage is higher by 0.89%.

Placement is a critical step in VLSI design because it dominates overall speed and quality of design flow. In this paper, a new fast and stable placement algorithm called FaSa is proposed. It uses quadratic programming model and Lagrange multiplier method to solve placement problems. And an {incremental LU factorization method} is used to solve equations for speeding up. The experimental results show that FaSa is very stable, much faster than previous algorithms and its total wire length is comparable with other algorithms.

For an n-variable Boolean function, there are 2^n fixed polarity Reed-Muller (FPRM) forms. In this paper, a frame of power dissipation estimation for FPRM functions is presented and the polarity conversion is introduced to minimize the power for FPRM functions. Based on searching the best polarity for low power dissipation, an optimal algorithm is proposed and implemented in C. The algorithm is tested on seven single output functions from MCNC benchmark circuits. The experimental results are shown in this paper.

In this paper, a new dynamical evolutionary algorithm (DEA) is presented based on the theory of statistical mechanics. The novelty of this kind of dynamical evolutionary algorithm is that all individuals in a population (called particles in a dynamical system) are running and searching with their population evolving driven by a new selecting mechanism. This mechanism simulates the principle of molecular dynamics, which is easy to design and implement. A basic theoretical analysis for the dynamical evolutionary algorithm is given and as a consequence two stopping criteria of the algorithm are derived from the principle of energy minimization and the law of entropy increasing. In order to verify the effectiveness of the scheme, DEA is applied to solving some typical numerical function minimization problems which are poorly solved by traditional evolutionary algorithms. The experimental results show that DEA is fast and reliable.

This paper presents a distributed and scalable admission control scheme to provide end-to-end statistical QoS guarantees in IP network. The basic idea of the scheme is that the ingress routers make admission control decisions according to the network status information obtained by sending probing packets along the selected routing path. Each router passively monitors the arriving traffic and marks the probing packets with its network status. The performance of the presented scheme is evaluated with a variety of traffic models, QoS metrics and network topologies. The simulation results show that the proposed scheme can accurately control the admissible region and effectively improve the utilization of network resource.

Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given, where each of those two automata has the output set of each state with the same size. And for a weakly invertible finite automaton $M$ with delay 2 satisfying the properties mentioned in this paper, two weakly invertible finite automata with delay 1 are constructed such that $M$ is equivalent to a sub-finite-automaton of the composition of those two. So a method to decompose this a kind of weakly invertible finite automata with delay 2 is presented.

Pen-based user interfaces which leverage the affordances of the pen provide users with more flexibility and natural interaction. However, it is difficult to construct usable pen-based user interfaces because of the lack of support for their development. Toolkit-level support has been exploited to solve this problem, but this approach makes it hard to gain platform independence, easy maintenance and easy extension. In this paper a context-aware infrastructure is created, called WEAVER, to provide pen interaction services for both novel pen-based applications and legacy GUI-based applications. WEAVER aims to support the pen as another standard interactive device along with the keyboard and mouse and present a high-level access interface to pen input. It employs application context to tailor its service to different applications. By modeling the application context and registering the relevant action adapters, WEAVER can offer services, such as gesture recognition, continuous handwriting and other fundamental ink manipulations, to appropriate applications. One of the distinct features of WEAVER is that off-the-shelf GUI-based software packages can be easily enhanced with pen interaction without modifying the existing code. In this paper, the architecture and components of WEAVER are described. In addition, examples and feedbacks of its use are presented.