In today's Internet computing world, illegal activities by crackers pose a serious threat to computer security. It is well known that computer viruses, Trojan horses and other intrusive programs may cause severe and often catastrophic consequences. This paper proposes a novel secure computer architecture based on security-code. Every instruction/data word is added with a security-code denoting its security level. External programs and data are automatically added with security-code by hardware when entering a computer system. Instruction with lower security-code cannot run or process instruction/data with higher security level. Security-code cannot be modified by normal instruction. With minor hardware overhead, the new architecture can effectively protect the main computer system from destruction or theft by intrusive programs such as computer viruses. For most PC systems, it includes an increase of word-length by 1 bit on registers, the memory and the hard disk.

In this paper, a computationally effective algorithm based on tabu search for solving the satisfiability problem (TSSAT) is proposed. Some novel and efficient heuristic strategies for generating candidate neighborhood of the current assignment and selecting variables to be flipped are presented. Especially, the aspiration criterion and tabu list structure of TSSAT are different from those of traditional tabu search. Computational experiments on a class of problem instances show that, TSSAT, in a reasonable amount of computer time, yields better results than Novelty which is currently among the fastest known. Therefore, TSSAT is feasible and effective.

This paper presents an automatic image-based approach for converting greyscale images to pencil sketches, in which strokes follow the image features. The algorithm first extracts a dense direction field automatically using Logical/Linear operators which embody the drawing mechanism. Next, a reconstruction approach based on a sampling-and-interpolation scheme is introduced to generate stroke paths from the direction field. Finally, pencil strokes are rendered along the specified paths with consideration of image tone and artificial illumination. As an important application, the technique is applied to render portraits from images with little user interaction. The experimental results demonstrate that the approach can automatically achieve compelling pencil sketches from reference images.

The star networks, which were originally proposed by Akers and Harel, have suffered from a rigorous restriction on the number of nodes. The general incomplete star networks (GISN) are proposed in this paper to relieve this restriction. An efficient labeling scheme for GISN is given, and routing and broadcasting algorithms are also presented for GISN. The communication diameter of GISN is shown to be bounded by 4n-7. The proposed single node broadcasting algorithm is optimal with respect to time complexity O(n\log_2 n).

Automatic reconstruction of 3D objects from 2D orthographic views has been a major research issue in CAD/CAM. In this paper, two accelerating techniques to improve the efficiency of reconstruction are presented. First, some pseudo elements are removed by depth and topology information as soon as the wire-frame is constructed, which reduces the searching space. Second, the proposed algorithm does not establish all possible surfaces in the process of generating 3D faces. The surfaces and edge loops are generated by using the relationship between the boundaries of 3D faces and their projections. This avoids the growth in combinational complexity of previous methods that have to check all possible pairs of 3D candidate edges.

The pronunciation variability is an important issue that must be faced with when developing practical automatic spontaneous speech recognition systems. In this paper, the factors that may affect the recognition performance are analyzed, including those specific to the Chinese language. By studying the INITIAL/FINAL (IF) characteristics of Chinese language and developing the Bayesian equation, the concepts of generalized INITIAL/FINAL (GIF) and generalized syllable (GS), the GIF modeling and the IF-GIF modeling, as well as the context-dependent pronunciation weighting, are proposed based on a well phonetically transcribed seed database. By using these methods, the Chinese syllable error rate (SER) is reduced by 6.3% and 4.2% compared with the GIF modeling and IF modeling respectively when the language model, such as syllable or word N-gram, is not used. The effectiveness of these methods is also proved when more data without the phonetic transcription are used to refine the acoustic model using the proposed iterative forced-alignment based transcribing (IFABT) method, achieving a 5.7% SER reduction.

Routing protocols play an important role in the Internet and the test requirements are running up. To test routing protocols more efficiently, several enhancing techniques are applied in the protocol integrated test system described in this paper. The Implementation Under Test is modeled as a black box with windows. The test system is endowed with multiple channels and multiple ports to test distributed protocols. The test suite and other related aspects are also extended. Meanwhile, the passive testing is introduced to test, analyze and manage routing protocols in the production field, which is able to perform the conformance test, the interoperability test and the performance test. The state machine of peer sessions is tested with the state synchronization algorithm, and the routing information manipulation and other operations are checked and analyzed with the methods like the topology analysis and the internal process simulation. With both the active testing and the passive testing, the routing protocol test is going further and more thoroughly and helps a lot in the development of routers.

Hardware and software co-design is a design technique which delivers computer systems comprising hardware and software components. A critical phase of the co-design process is to decompose a program into hardware and software. This paper proposes an algebraic partitioning algorithm whose correctness is verified in program algebra. The authors introduce a program analysis phase before program partitioning and develop a collection of syntax-based splitting rules. The former provides the information for moving operations from software to hardware and reducing the interaction between components, and the latter supports a compositional approach to program partitioning.

In recent years, we have been developing a new framework for acquiring medical knowledge from Encyclopedic texts. This framework consists of three major parts. The first part is an extended high-level conceptual language (called HLCL 1.1) for use by knowledge engineers to formalize knowledge texts in an encyclopedia. The other part is an HLCL 1.1 compiler for parsing and analyzing the formalized texts into knowledge models. The third part is a set of domain-specific ontologies for sharing knowledge.

In this paper, a new effective method is proposed to find class association rules (CAR), to get useful class association rules (UCAR) by removing the spurious class association rules (SCAR), and to generate exception class association rules (ECAR) for each UCAR. CAR mining, which integrates the techniques of classification and association, is of great interest recently. However, it has two drawbacks: one is that a large part of CARs are spurious and maybe misleading to users; the other is that some important ECARs are difficult to find using traditional data mining techniques. The method introduced in this paper aims to get over these flaws. According to our approach, a user can retrieve correct information from UCARs and know the influence from different conditions by checking corresponding ECARs. Experimental results demonstrate the effectiveness of our proposed approach.

Singularity analysis is an important subject of the geometric constraint satisfaction problem. In this paper, three kinds of singularities are described and corresponding identification methods are presented for both under-constrained systems and over-constrained systems. Another special but common singularity for under-constrained geometric systems, pseudo-singularity, is analyzed. Pseudo-singularity is caused by a variety of constraint matching of under-constrained systems and can be removed by improving constraint distribution. To avoid pseudo-singularity and decide redundant constraints adaptively, a differentiation algorithm is proposed in the paper. Its correctness and efficiency have been validated through its practical applications in a 2D/3D geometric constraint solver CBA.

A study has been conducted on the algorithm of solving generalized optimal set of discriminant vectors in this paper. This paper proposes an analytical algorithm of solving generalized optimal set of discriminant vectors theoretically for the first time. A lot of computation time can be saved because all the generalized optimal sets of discriminant vectors can be obtained simultaneously with the proposed algorithm, while it needs no iterative operations. The proposed algorithm can yield a much higher recognition rate. Furthermore, the proposed algorithm overcomes the shortcomings of conventional human face recognition algorithms which were effective for small sample size problems only. These statements are supported by the numerical simulation experiments on facial database of ORL.

In this paper, a control integration method based on agent cooperation, called ASOJI, is proposed, which designs the architecture of integrated application systems in distributed computation environments as an agent community composed of nested agent federations in three aspects: architecture style, agent cooperation, and composition semantics. Through defining activity-sharing-oriented joint intention in the way of stepwise refinement, ASOJI can not only support the transparent specification of the architecture for software composition, but also eliminate the gap between agent theory and the engineering realization of control integration.