Abstract:In this paper, Agent based architecture has been introduced into GIS for interactability and scalability. The authors have developed an interface agent to interactively assist the user with the query formation process. The interface agent has a capability of offering domain knowledge that is associated with a given query. Also the agent records user s troubleshooting experience and shows it to the same user and other user as hints. Further, the authors also have developed the Agent based architecture with a 2-tier mediator model in GIS to meet the meeds for interoperability among diverse application domains and integration of heterogeneous informa-tion source.The broker agent provides a matchmaking service to other agent,As a result,qualitative and quan-titative data can be integrated into GIS.Finally a prototype system-GXGIS,using agent-based technology is described.

Abstract:This paper provides a denotational semantics to a subset of Timed RAISE Specification Language (RSL) using Extended Duration Calculus (EDC) model. It adds some novel features into the EDC model and explore their algebraic laws which play the vital role in formalising real time programs and verification of real time properties. Some algebraic laws of Timed RSL are presented, which can be proved from the denotational semantics, and be used in program transformation and optimization.

Abstract:In this paper, based on the mass assignment theory proposed by J.F. Baldwin et al. , the new mass assignment based fuzzy CMAC is presented. Accordingly, its learning rules are also investigated. The theoretical research results reveal that this new mass assignment based fuzzy CMAC is a universal approximator, and has its learning convergence. Therefore, this new fuzzy CMAC has very important potentials of applications.

Abstract:Techniques of parallelizing object oriented language have had great progress in recent years. The authors introduce these new techniques in the aspects of parallel execution model, parallel facilities, optimization and runtime support mainly based on Mentat, CC++, pC++, HPC++, ICC++. Analysis and evaluation of these techniques are described and the problems that should be resolved in the future are pointed out.

Abstract:Data compression is an effective approach to improve the data wharehouses. On line analysis processing (OLAP) is the most important application on the data warehouses, and Cube is one of the most operators in OLAP. Thus, it is a big challenge to develop efficient algorithms for compressed data warehouses. Although many algorithms to compute Cube have been developed recently, there is little to date in the literatures about Cube algorithms for compressed data warehouse. To the authors' knowledge, there is only one paper that presented a Cube algorithm for compressed data warehouses with a special compression method called chunk-offset. A set of Cube algorithms for very large and compressed data warehouses are proposed in this paper. These algorithms operate directly on compressed datasets without the need of decompressing them first. They are applicable to a variety of data compression methods. The datail analysis of I/O and CPU cost are also given, and compared with the existed algorithms by experiment. The analytical and experimental results show that algorithms proposed in this paper are more efficient than other existed ones.

Abstract:A simple script language, GSCRIPT, which integrates distributed object systems of COM and CORBA is presented in this paper. The language manages COM objects and CORBA objects on network by using automation programming interface and dynamic invocation interface respectively. GSCRIPT is platform independent, one GSCRIPT program runs on many operating systems and hardware platforms. The architecture of GSCRIPT interpreter and the mechanism to support event service are introduced in detail, which enables the platform-independence of GSCRIPT.

Abstract:In this paper,the authors analyze the activities of WWW users and present a series of concepts about optimization of WWW navigating path. Furthermore,an algorithm of optimization of WWW navigating path is given,that is based on user access pattern and other related works are compared with.

Abstract:Many practical pattern recognition problems, such as recognition of handwritten Chinese characters belong to the pattern recognition problems of large scale. Now conventional ANN (artificial neural network) algorithms cannot solve this set of problems efficiently. In this paper, a neural network algorithm based on the sphere neighborhood model is introduced, aiming at enhancing the neural network's ability to solve the pattern recognition problems of large scale. The performance of the algorithm is tested with the handwritten Chinese character recognition problem. Experimental result show that the proposed algorithm is competent and has well prospects to this set of problems.

Abstract:A 3D Morphing algorithm based on distance field interpolation is presented in this paper. This method uses analytic distance field to implement 3D Morphing, which makes the smoothness of the transformation shapes not depending on the discrete accuracy of original models. The interactive Morphing algorithm based on some constrained points and Morphing influence shapes is also given in this paper, which allows users to control Morphing procedures intuitively and conveniently. Several Morphing examples show that this algorithm can generate the controllable transformation shapes between any two oriented manifold models.

Abstract:In CSCW community, group awareness model and its application are an important research field. A role-based group awareness model on the basis of previous research is presented in this paper. Through task disassociation and role subdivision, this model can be used to divide role based user actions collection. By calculating the difference of roles, the authors can get the awareness strength between user and action. Finally, the implementation mechanism, application and some related questions in the future research are discussed.

Abstract:To overcome the Kerberos limitations caused by using symmetric algorithm, an improved way using Yaksha security system of ElGamal Public Key algorithm is presented based on the original protocol framework.

Abstract:Methods for improving performance in implementing encryption algorithms are described in this paper. Some results of using these methods to implement encryption algorithms are given.

Abstract:One Way functions play an important role in complexity theory of computation and public key cryptography. Inspired by the work of Grollmann and Selman, the work of Grollmann and Selman to the result of relativization and nonuniform complexity classes are generalized in this paper, the equivalence of the include relation of complexity class UP /poly, UP, P /poly and the existence of strongly relativization one way function, weakly relativization one way function are proved.

Abstract:In this paper, the authors summarize the results of network calculus, describe two fundamental network calculus tools, i.e. arrival curve and service curve. Some results including the bottleneck effect of service curves, the optimal and approximate deterministic end-to-end delay bounds, and the service curve for a network node offering guaranteed service are obtained in this paper. Finally, the authors compute the deterministic end-to-end delay bounds in guaranteed service with rate latency and PGPS (packetized generalized processor sharing) service curves.

Abstract:For software pipeling of loops with conditional statements, the worst-case path is a great abstacle. In such a loop, some data dependencies called flexible dependencies, may or may not have instances during execution of the loop. From this fact, flexible dependencies that severely limit parallelization of the loop are identified and replaced with less tight virtual dependencies. Then software pipelining is applied. If the schedule does not satisfy the original flexible dependencies, downpush transform is used to rectify. The resulting schedule is partly or completely free of the worst-case effects. This approac is a complement to the classical control speculation. It is characterized by a try-and-catch way: errors are first allowed to be present in the schedule, and then rectified.

Abstract:In this paper, six new attacks upon three authentication protocols are presented. Then the reasons resulting these attacks are analyzed, and the improvement schemas to the related authentication protocols are given.

Abstract:A novel speech codec of high quality and low complexity——PS ACELP (pre search algebraic code excited linear prediction) is presented in this paper, which is suitable for software based compressing and replaying speech on H/PC. The proposed codec is almost equal in speech quality with ITU T G.723.1 5.3kbps codec, but one third of the complexity of the latter, only around 7 MIPS. How to achieve the low computing complexity is described in detail in this paper. Due to the advantages of high speech quality, low complexity and low bit rate, PSACELP codec is suitable for software based compressing and replaying of speech, voice mail and Internet phone etc.

Abstract:In this paper, the authors analyze the measures of similarity between Vague sets given by Chen, and point out some problems in the measures. Then they revise them and propose a new kind of measures of similarity. With some good properties, the new measures are more rational and practical, thus providing a more useful way to measure the degree of similarity between Vague sets.

Abstract:According to the performance requirements of distributed applications, the load balancing is introduced into fault tolerance in this paper to reach tradeoff between active replication algorithm and primary backup algorithm. A dynamic fault tolerant algorithm RAWA (read-any-write-any) is presented in the paper for redundant servers to dynamically change quorum with variability of system load. It not only improves the processing speed of requests, but also implements load balancing in a more efficient and simplier way. Integrated with consistency and mutual mutual visiting mechanisms, RAWA algorithm can be applied to stateful servers and nested visting. The performance of RAWA algorithm is also analyzed, and through experiments on CORBA platform, the comparisons with other fault tolerant algorithms indicate that RAWA has effectively improved the performance of redundant servers without damaging system availability.

Abstract:Vector field visualization has been a focus of visualization research. Streamlines provide good representation of local information, and are also utilized to give global vision in 2-Dimension vector fields. In this paper, streamline based methods are analyzed in signal processing aspect, and their efficiency and inefficiency in frequency domain are pointed out. A new method, textured streamline, is proposed and analyzed. The new method has clearer meaning in frequency domain, and can be implemented more easily with lower cost.

Abstract:An algorithm for extracting road network by fusion of multi-band remote sensing images is presented in this paper. Firstly, straight lines and parallel lines are extracted from multi-band images and fused in order to overcome the uncertainty of the description of roads in the images. Secondly, the roads that fit well with the constraints of the model of road are recognized according to the local property of lines. Eventually, the roads that can not be fit well with the constraints of the model of road are recognized by suing the global connection constraints of road network. The algorithm is applied on 3-band remote sensing images, and the effectiveness is shown by the results.