34037807
EDS: A Parallel Computer System for Advanced Information Processing
The European Declarative System (EDS) is a high performance computer server designed for developing advanced information processing systems (e.g. extended database systems, knowledge based systems, ... etc.). One major application target of EDS is to serve the needs of existing and future commercial and business professionals; and the application domain ranges from simple data-intensive on-line transaction processing to complex computation-intensive decision support systems. To achieve high performance, parallelism is exploited extensively in both the hardware and the software. In this paper, an overview of the EDS architectures and the advanced commercial applications running on the EDS system are described.
45209699
A Workflow Model for Chinese Business Processes
This paper proposes a new workflow model (MAWM) targeted at Chinese business processing. The cultural dependent characteristics of Chinese business processes are identified and taken into account in the MAWM model. MAWM adopts a decentralized modeling style based on the conventional business perspective on labor division and cooperation. This idea is reflected in the concept of agent-workflow. Activity-based and communication-based modeling methods are integrated in the process model. They are used to model different types of business activities. In addition, the model is formalized using Process Algebra and a simplified algorithm is proposed for safety verification of workflow processes.
690242
Improving Quality of Email Categorization with Tournament Methods
The tournament text classification methods are proposed in this article to perform the task of email categorization, in which the essence is to break down the multi-class categorization process into a set of binary classification tasks. We implement the methods of elimination and Round Robin tournament to classify emails within 15 folders. Substantial experiments are conducted to compare the effectiveness and robustness of the tournament methods against the n-way classification method and the voting method. The experimental results show that the tournament methods outperform the n-way method by 11.7% and the voting method by 4.1% regarding precision, and the Round Robin performs slightly better than the Elimination tournament on average.
37472111
Extending the superimposed codeword indexing scheme to handle incomplete information
In order to use Prolog as a basis for database applications, techniques are required for rapid retrieval of clauses from large data sets. Various researchers have contributed to the development of indexing strategies for this purpose. One such strategy is known as superimposed codeword+mask bits (SCW+MB). One extension of Prolog which is useful in the development of deductive databases is the ability to handle incomplete information. A form of incomplete information based on sets has been introduced and used in a deductive database system. In order to provide efficient access to clauses containing incomplete information, existing strategies need to be adapted accordingly. This paper presents an extension to the SCW+MB algorithm to cover incomplete information, and describes how this can be realized in hardware.
16840924
Improving Transliteration with Precise Alignment of Phoneme Chunks and Using Contextual Features
Automatic transliteration of foreign names is basically regarded as a diminutive clone of the machine translation (MT) problem. It thus follows IBM's conventional MT models under the source-channel framework. Nonetheless, some parameters of this model dealing with zero-fertility words in the target sequences, can negatively impact transliteration effectiveness because of the inevitable inverted conditional probability estimation. Instead of source-channel, this paper presents a direct probabilistic transliteration model using contextual features of phonemes with a tailored alignment scheme for phoneme chunks. Experiments demonstrate superior performance over the source-channel for the task of English-Chinese transliteration.
12876616
A Design of Temporal Event Extraction from Chinese Financial News
This paper presents an information system for Chinese Information Extraction from Financial news (CHIEF). The ultimate target of the system is to extract information concerning the occurrence time and places of the financial activities in the different companies from a local Hong Kong newspaper, namely (Tao Kung Pao). To facilitate event extraction purpose, two groups of templates were defined, i.e. the company related and company restructuring templates. They are used to select the desired information for each type of financial activities, such as (bankruptcy) or (merge). Each specific event is then represented using a frame-based knowledge structure. Two types of slots are embedded in each frame: they are the activity- and time-related slots. Based on these slots, multiple activities are interconnected according to their entity relations, temporal relations or the deduced relations. Effectively, CHIEF is a question-answering system designed for handling the company related queries, event based queries, temporal queries and complex queries in a finance domain.
12936831
On designing an experiment to evaluate a reverse engineering tool
The Rigi reverse engineering system is designed to analyze and summarize the structure of large software systems. Two contrasting approaches are available for visualizing software structures in the Rigi graph editor. The first approach displays the structures through multiple, individual windows. The second approach, simple hierarchical multi-perspective (SHriMP) views, employs fisheye views of nested graphs. The paper describes the design of an experiment to evaluate these alternative user interfaces. Various results from a preliminary pilot study to test the experiment design are reported.
6918962
Head Model Acquisition from Silhouettes
This paper describes a practical system developed for generating 3D models of human heads from silhouettes alone. The input to the system is an image sequence acquired from circular motion. Both the camera motion and the 3D structure of the head are estimated using silhouettes which are tracked throughout the sequence. Special properties of the camera motion and their relationships with the intrinsic parameters of the camera are exploited to provide a simple parameterization of the fundamental matrix relating any pair of views in the sequence. Such a parameterization greatly reduces the dimension of the search space for the optimization problem. In contrast to previous methods, this work can cope with incomplete circular motion and more widely spaced images. Experiments on real image sequences are carried out, showing accurate recovery of 3D shapes.
1805653
Domain-retargetable reverse engineering
A user programmable approach to reverse engineering is described. The approach uses a scripting language that enables users to write their own routines for these activities, making the system domain-retargetable. The environment supported by this programmable approach subsumes existing reverse engineering systems by being able to simulate facets of each one and provides a smooth transition from semi-automatic to automatic reverse engineering.<<ETX>>
53788593
A fast recursive 3D model reconstruction algorithm for multimedia applications
A recursive two-step method to recover structure and motion from image sequences based on Kalman filtering is described in this paper. The algorithm consists of two major steps. The first step is an extended Kalman filter for the estimation of the object's pose. The second step is a set of extended Kalman filters, one for each model point, for refining the positions of the model features in the 3D space. The initial guess is a planar model formed under the assumption of orthographic projection on the first image. These two steps alternate from frames to frames. The planar model converges to the final structure as the image sequence is scanned sequentially. The performance of the algorithm is demonstrated with both synthetic data and real world objects. Comparisons with different approaches have been performed and show that our method is more efficient.
61655346
Statistics on Logic Simulation
The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architectures have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy needs in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the design of simulation engines, and then presenting such data. The data contained in the paper includes information on subtask times found in standard discrete event simulation algorithms, event intensities, queue length distributions and simultaneous event distributions.