41278807
The European Declarative System (EDS) as a platform for parallel logic programming
The overall architecture of the European Declarative System (EDS), ESPRIT II Project 2025 is briefly described. The aim of the project is to design and implement both the hardware and software for a parallel information server. The final system will be used to develop advanced business information systems. The EDS machine is designed to be a high speed backend accelerator, primarily for data/knowledge base applications, serving a range of host computers. It is a message passing multiprocessor with a distributed store, commonly referred to as a shared nothing architecture. Whilst shared nothing architectures are not novel, their application to declarative/symbolic languages is relatively new. The authors describe the EDS software activities at ECRC. A conclusion reporting the current status of the project is given.<<ETX>>
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.
7493579
CLARE—a Prolog database machine
The CLAuse Retrieval Engine (CLARE) is a coprocessor system which based on two-stage filtering, for handling large sets of disc resident clauses in Prolog database applications. The overall architecture and the timing measurements of the first stage CLARE hardware are reported. The timing measurements shows that the first stage CLARE hardware can perform search operations on data transferring at a rate up to 4.5 million double bytes per second.
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.
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.
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.
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.
17549193
Accurate 3-D Motion Tracking with an Application to Super-Resolution
Many of the existing image processing applications, in particular the construction of super-resolution videos, require an accurate high-speed motion tracking algorithm. This paper proposes an efficient recursive approach that recovers 3D motion from a stereo image sequence with high precision based on the trifocal tensor. In the computation process, neither the 3D structure of the scene nor its reconstruction is necessary. The validity of the proposed algorithm is demonstrated by applying it to upgrade the resolution of real stereo images. Empirical comparisons show that our novel approach outperformed traditional work in terms of both the accuracy of motion estimation and the quality of super-resolved images
10398473
Structural Redocumentation: A Case Study
Most software documentation typically describes the program at the algorithm and data-structure level. For large legacy systems, understanding the system's architecture is more important. The authors propose a method of reverse engineering through redocumentation that promises to extend the useful life of large systems. >
6619418
The Software Bookshelf
Legacy software systems are typically complex, geriatric, and difficult to change, having evolved over decades and having passed through many developers. Nevertheless, these systems are mature, heavily used, and constitute massive corporate assets. Migrating such systems to modern platforms is a significant challenge due to the loss of information over time. As a result, we embarked on a research project to design and implement an environment to support software migration. In particular, we focused on migrating legacy PL/I source code to C++, with an initial phase of looking at redocumentation strategies. Recent technologies such as reverse engineering tools and World Wide Web standards now make it possible to build tools that greatly simplify the process of redocumenting a legacy software system. In this paper we introduce the concept of a software bookshelf as a means to capture, organize, and manage information about a legacy software system. We distinguish three roles directly involved in the construction, population, and use of such a bookshelf: the builder, the librarian, and the patron. From these perspectives, we describe requirements for the bookshelf, as well as a generic architecture and a prototype implementation. We also discuss various parsing and analysis tools that were developed and integrated to assist in the recovery of useful information about a legacy system. In addition, we illustrate how a software bookshelf is populated with the information of a given software project and how the bookshelf can be used in a program-understanding scenario. Reported results are based on a pilot project that developed a prototype bookshelf for a software system consisting of approximately 300K lines of code written in a PL/I dialect.
16104056
Performance analysis and design of a logic simulation machine
The high costs associated with logic simulation of large VLSI circuits has led to the need for new computer architectures tailored to the simulation task. Such architectures have the potential for significant speed-ups over software-based logic simulators executing on standard sequential computers. This paper presents a model of one class of multiprocessor simulation architectures and compares the performance of some of these machines using data obtained from simulations of VLSI circuits. In addition, we discuss the implications of our results on machine design and examine the sensitivity of the model to variations in circuit characteristics.