ppxscal/embedding_network huggingface dataset:
VLSI design of densely-connected array processors
Authors: Eric Y. Chou, Bing J. Sheu, Tony H. Wu, Robert C. Chang
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Paralleled array processors based on cellular neural networks (CNNs) are very useful in high-speed, real-time signal and image processing because of its simplicity for problem mapping and high potential computational bandwidth. Local interconnection and simple synaptic operators are the most attractive features of the cellular neural network (CNN) for VLSI implementation. A computing architecture for CNN processing engine which can be applied for several challenging VLSI hardware design problems, such as CNN accelerator design for heterogeneous computing, is presented. This continuous-time CNN processing engine with digital-programmable synapses and flexible digital interface is designed and prototyped using the current-mode CMOS circuits. A prototyping 5/spl times/5 array processor chip is designed and fabricated in 2.0 /spl mu/m CMOS technology. Measurement results of this prototype chip and its building blocks for array processor design are presented. Experimental results of edge detection operation of this prototype chip are also given.
Knowledge Exploration in Historical Artefact Record Keeping
Authors: Kamil Matousek, Zdenek Kouba
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This article presents a modern generation of information systems in the area of historical artefact record keeping, based on ontology modelling techniques. The weaknesses of classical database-oriented systems are described and compared with ontology-based solutions. Advanced knowledge exploration based on knowledge technologies like operational knowledge processing languages enable to perform tasks that were unachievable by the former approaches. Practical domain modelling discussion and examples are included,as well as a suggested future research topics.
The 3-XORSAT Threshold
Authors: Olivier Dubois, Jacques Mandler
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove the existence of the 3-XORSAT threshold, establishing its value as a function of the root of a transcendental equation.
Software Black Box Mechanism: A Pragmatic Method for Software Crash Diagnosis and Usage Maintenance Testing
Authors: Zhonglin He, Geoff Staples, Margaret Ross, Ian Court
Venue: Proceedings of the International Conference on Software Maintenance (1997)

In the aviation industry, each aircraft is equipped with flight recorders. The scheme of this paper is that the same idea can be introduced in each copy software. Once a software black box mechanism incorporated into a copy of a software product, the data used for software maintenance can be collected in real-time. The software black box information can be fed back to the producer at any time when needed, especially after the beta test period, when the software has experienced several crashes or problems, and before new release. The analysis of the black box data can provide information for software crash diagnosis, and software usage maintenance testing.
Write buffer design for cache-coherent shared-memory multiprocessors
Authors: Farnaz Mounes-Toussi, David J. Lilja
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We evaluate the performance impact of two different write-buffer configurations (one word per buffer entry and one block per buffer entry) and two different write policies (write-through and write-back), when using the partial block invalidation coherence mechanism in a shared-memory multiprocessor. Using an execution-driven simulator, we find that the one word per entry buffer configuration with a write-back policy is preferred for small write-buffer sizes when both buffers have an equal number of data words, and when they have equal hardware cost. Furthermore, when partial block invalidation is supported, we find that a write-through policy is preferred over a write-back policy due to its simpler cache hit detection mechanism, its elimination of write-back transactions, and its competitive-performance when the write-buffer is relatively large.
A CAM-Based VLSI Architecture for Shared Buffer ATM Switch with Fuzzy Controlled Buffer Management
Authors: Chie Dou, Ming-Der Shieh
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

This paper proposes a CAM-based shared buffer ATM switch-on-a-chip architecture that takes network-element internal congestion control into consideration. This internal congestion control includes selective cell discard, priority service scheduling, and fuzzy controlled buffer management. To provide "fair" access to the network resources for all users, the SMXQ buffer control scheme is adopted. The SMXQ scheme assumes a queue length threshold is chosen for the logical queue pertaining to each output port, and if the queue length exceeds the threshold, the arriving cells are discarded. Selective cell discard is performed per port basis when the shared buffer is full or the queue length of a particular output port exceeds its threshold. For each output port, {CLP=1} cells will be discarded before any {CLP=0} cell is discarded. The set of chosen queue length thresholds are computed directly by an on-chip fuzzy congestion controller (FCC) in sub microsecond intervals.
On-Line Confidence Machines Are Well-Calibrated
Authors: Vladimir Vovk
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Transductive Confidence Machine (TCM) and its computationally efficient modification, Inductive Confidence Machine (ICM), are ways of complementing machine-learning algorithms with practically useful measures of confidence. We show that when TCM and ICM are used in the on-line mode, their confidence measures are well-calibrated, in the sense that predictive regions at confidence level 1 - \delta will be wrong with relative frequency at most \delta (approaching \delta in the case of randomised TCM and ICM) in the long run. This is not just an asymptotic phenomenon: actually the error probability of randomised TCM and ICM is \delta at every trial and errors happen independently at different trials.
Proposal for a Text-Indicated Writer Verification Method
Authors: Yasushi Yamazaki, Naohisa Komatsu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We propose an on-line writer verification method to improve the reliability of verifying a specific system user. In the proposed method, a different text including ordinary characters is used on every verification process. This text can be selected automatically by the verification system so as to reflect the specific writer's features. A specific writer is accepted only when the same text, which is indicated by the verification system, is written, and the system can verify the writer's personal features from the written text. The proposed method makes it more difficult to disguise writer himself with forged handwriting data than the previous methods using only signatures.
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
Authors: David Kempe, Jon M. Kleinberg
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise underlying distributed gossip is very simple: in each time step, each node v in the system selects some other node w as a communication partner ¿ generally by a simple randomized rule ¿ and exchanges information with w ; over a period of time, information spreads through the system in an "epidemic fashion".A fundamental issue which is not well understood is the following: how does the underlying low-level gossip mechanism ¿ the means by which communication partners are chosen ¿ affect one's ability to design efficient high-level gossip-based protocols? We establish one of the first concrete results addressing this question, by showing a fundamentallimitation on the power of the commonly used uniform gossip mechanism for solving nearest-resource location problems. In contrast, very efficient protocols for this problem can be designed using a non-uniform spatial gossip mechanism, as established in earlier work with Alan Demers.We go on to consider the design of protocols for more complex problems, providing an efficient distributed gossip-based protocol for a set of nodes in Euclidean space to construct an approximate minimum spanning tree. Here too, we establish a contrasting limitation on the power of uniform gossip for solving this problem. Finally, we investigate gossip-based packet routing as a primitive that underpins the communication patterns in many protocols, and as away to understand the capabilities of different gossip mechanisms at a general level.
Indexing and Classification of TV News Articles Based on Telop Recognition
Authors: Yasuo Ariki, T. Teranishi
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In accumulating and retrieving multi-media information such as images, speech and text, it is necessary to compress and retrieve the information efficiently and accurately. The purpose of this paper is to construct a database of TV news images based on telop character recognition toward multi-media database. The first step is to detect telop frames and to segment the characters by differentiating the telop frames based on the fact that character regions have high brightness and the character edges are clear. The second step is the telop character recognition. It is performed by a subspace method using direction histogram features. The third step is indexing by extracting noun words after morphological analysis of the recognized telop characters. These noun words correspond with key words and are given to TV news articles as their indices. Finally TV news articles are classified into 10 topics such as politics, economics, culture, amusements, sports and so on based on the extracted indices. We employed index-topics table to classify the articles using indices. The telop character recognition rate was 65.7% and the article classification rate was 67.3%.
Ensuring the Capability of COTS Products
Authors: John C. Dean
Venue: 23rd International Computer Software and Applications Conference (1999)

The question of how a systems integrator can acquire a reasonable level of confidence in the robustness and applicability of any COTS product is one of the key concerns of researchers dealing with COTS based software systems. This assurance must be gained before the COTS product is selected for inclusion in the final system.In this position paper I propose that we examine three main areas of interest dealing with COTS selection. I argue that direct, detailed examination provides the most practical, timely data that will allow integrators to verify that particular COTS products can perform the tasks that are required within the overall system context.
An Experimental Comparison of the Maintainability of Object-Oriented and Structured Design Documents
Authors: Lionel C. Briand, Christian Bunse, John W. Daly, C. Differding
Venue: Proceedings of the International Conference on Software Maintenance (1997)

This paper presents a controlled experiment focusing on the following issues (i) are object-oriented design documents easier to understand and modify than structured design documents?, (ii) must they comply with quality design principles such as the ones provide by Coad and Yourdon?, and (iii) what is the impact of such design principles on the understandability and modifiability of design documents? Results strongly suggest that such design principles have a beneficial effect on the maintainability of object-oriented design documents. However, there is no strong evidence regarding the alleged higher maintainability of object-oriented design documents over structured design documents. Furthermore, results suggest that object-oriented design do cuments are more sensitive to poor design practices, in part because their cognitive complexity becomes increasingly unmanageable. However, as our ability to generalise these results is limited, they should be considered as preliminary, i.e., it is very likely that they can only be generalised toprogrammers with little object-oriented training. Such programmers can, however, be commonly found on maintenance projects.
Processing Queries with Expensive Predicates by Filtering
Authors: Hanxiong Chen, Toshiro Ohno, Nobuo Ohbo
Venue: 23rd International Computer Software and Applications Conference (1999)

There has been increasing interest in the application of abstract data type (ADT) of database technology to other fields. However, processing queries including ADT is always computationally expensive. In this paper, we formalize a query processing scheme for selection operation which involves a computationally expensive predicate. Our approach is based on "filtering". In the method, an expensive predicate is decomposed into simpler ones successively evaluated. Each of such simpler predicate is either a necessary or a sufficient condition of the initial predicate, and is used to reject or accept an object as the answer of the query without evaluating the initial predicate.Iterative reduction of an operand set of objects can significantly lessen the total cost of estimation of the initial predicate. A cost model is provided and an algorithm is proposed to determine an optimal query evaluation plan. Experiments on spatial queries illustrate the effect.
Font Recognition and Contextual Processing for More Accurate Text Recognition
Authors: Hongwei Shi, Theo Pavlidis
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper font recognition and contextual processing are developed as two components that enhance the recognition accuracy of a text recognition system presented in a previous paper. Font information is extracted from two sources: one is the global page properties, the other one is the graph matching result of recognized short words such as "it" and "of" etc.. Contextual processing is done by first composing word candidates from the recognition results and then check each candidate with a dictionary through a spelling checker. Positional binary trigrams and word affixes are used to prune the search for word candidates.
Pattern Classification Method by Integrating Interval Feature Values
Authors: Takahiko Horiuchi
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Pattern classification based on Bayesian statistical decision theory needs a complete knowledge of the probability laws to perform the classification. In the actual pattern classification, however, it is generally impossible to get the complete knowledge as constant feature values by the influence of noise. In this paper, a pattern classification theory using feature values defined on closed interval is formalized in the framework of Dempster-Shafer measure. Then, in order to make up lacked information, a new integration algorithm is proposed.
Cost Framework for COTS Evaluation
Authors: Norman F. Schneidewind
Venue: 23rd International Computer Software and Applications Conference (1999)

We focus on factors that the user should consider when deciding whether to use COTS software. We take the approach of using the common denominator cost. This is done for two reasons: First, cost is obviously of interest in making such decisions and second a single metric - cost in dollars - can be used for evaluating the pros and cons of using COTS.
Resource Placement in Torus-Based Networks
Authors: Myung M. Bae, Bella Bose
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper investigates methods to locate system resources, such as expensive hardware or software modules, to provide the most effective cost / performance tradeoffs in a torus parallel machine. This paper contains some solutions to perfect distance-t and perfect / quasi-perfect j-adjacency placement in a k-ary n-cube and a torus using Lee distance error-correcting codes.*This work is supported in part by the National Science Foundation and the Oregon Advanced Computing Institute under grant MIP-910852.
Data Distribution Analysis and Optimization for Pointer-Based Distributed Programs
Authors: Jenq Kuen Lee, Dan Ho, Y. C. Chuang
Venue: Proceedings of the international Conference on Parallel Processing (1997)

A critical question remains open if the compiler can understand the distribution pattern of pointer-based distributed objects built by application programmers, and perform optimization as effectively as the HPF compiler does with distributed arrays. In this paper, we address this challenging issue. In our work, we first present a parallel programming model which allows application programmers to build pointer-based distributed objects at application levels. Next, we propose a distribution analysis algorithm which can automatically summarize the distribution pattern of pointer-based distributed objects built by application programmers. Our work, to our best knowledge, is the first work to attempt to address this open issue. Our distribution analysis framework employs Feautrier's parametric integer programming as the basic solver, and can always obtain precise distribution information from the class of programs written in our parallel programming model with static control. Experimental results done on a 16-node IBM SP-2 machine show that the compiler with the help of distribution analysis algorithm can significantly improve the performance of pointer-based distributed programs.
An Evaluation of Data-Parallel Compiler Support for Line-Sweep Applications
Authors: Daniel G. Chavarría-Miranda, John M. Mellor-Crummey
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Data parallel compilers have long aimed to equal the performance of carefully and-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has been particularly elusive. In the Rice dHPF compiler, we have developed a wide spectrum of optimizations that enable us to closely approach hand-coded performance for tightly-coupled line sweep applications including the NAS SP and BT benchmark codes. From lightly-modified copies of standard serial versions of these benchmarks, dHPF generates MPI-based parallel code that is within 4% of the performance of the hand-crafted MPI implementations of thesecodes for a 1023 problem size (Class B) on 64 processors.We describe and quantitatively evaluate the impact of partitioning, communication and memory hierarchy optimizations implemented by dHPF that enable us to approach hand-coded performance with compiler-generated parallel code.
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
Authors: Qian-Ping Gu, Hisao Tamaki
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths. This result implies that the hypercube can be made rearrangeable by virtually duplicating each edge through time-sharing (or through the use of two wavelengths in the case of optical connection), rather than by physically adding edges as in previous approaches. When our goal is to route as many source-destination pairs of the given permutation as possible by edge-disjoint paths, our result gives a 2-approximate solution which improves previous ones.
Variable Resolution 4-k Meshes
Authors: Luiz Velho, Jonas Gomes
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

We introduce variable resolution 4-k meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most properties of other related descriptions with several advantages, such as more flexibility and greater expressive power. The main unique feature of the 4-k mesh structure lies in its variable resolution capability, which is crucial for adaptive computation. We also give an overview of the different methods for constructing the hierarchical 4-k mesh representation, as well as the basic algorithms necessary to incorporate it in modeling and graphics applications.
Autocircuit: a clock edge general behavioral synthesis system with a direct path to physical datapath
Authors: H. Fatih Ugurdag, Thomas E. Fuhrman
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Autocircuit is a next-generation synthesis tool which makes fundamental contributions in high-level design. It accepts behavioral HDL input descriptions with multiple clock edges with no restrictions on where those edges may or may not be placed in relation to HDL operations or control constructs. It achieves this generality by novel representations and algorithms; its control and data-flow representations are called "raw-states" and "use-trees", respectively. AUTOCIRCUIT focuses on word-oriented synthesis and bypasses logic synthesis for word-oriented operators, registers, and muxes. It maps directly to physical datapath layout tools using a unique parameterized netlist representation in which net connections themselves have a parameterized size defined by an expression.
An Infrastructure to Support the Development of Collaborative Project-Based Learning Environments
Authors: Flávia Maria Santoro, Marcos R. S. Borges, Neide dos Santos
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

The area of CSCL is short of toolkits to support the construction of educational environments, since the developer of applications knows neither the education domain, nor the collaborative strategies applied to the teaching-learning process. The teacher needs a flexible environment supported by computing technology, and where he can configure different collaborative projects. The authors present a conceptual and computational infrastructure for the domain of collaborative learning based on development of projects, whose first stage was the definition of a collaboration model in the format of conceptual patterns. The requirements and the conceptual patterns gave support for the development of this infrastructure, composed by a collaborative environment, a tool framework, a database of projects, and a library of references.
On-line Handwritten Character Pattern Database Sampled in a Sequence of Sentences without any Writing Instructions
Authors: Masaki Nakagawa, Takao Higashiyama, Yukiko Yamanaka, Shin-ichi Sawada, Levan Higashigawa, Katsuhiko Akiyama
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a database of on-line handwritten character patterns sampled in a sequence of sentences without any instructions. The sentences according to which character patterns are collected have been picked up from newspaper to include 1,227 frequently appearing character categories with the result that they are composed of about 10,000 characters and include 1,537 JIS 1st level character categories. The rest of the JIS 1st level 1808 categories have been added at the end of the above text and written one by one. The total text has been commonly employed for collecting script patterns from a number of people. Patterns offered were inspected and omissions and wrong patterns were rewritten. We collected data from 80 people and made the 12,000 x 80 patterns available since February 1996. More patterns are being collected. This paper describes the characteristics of this database as well as several tools to collect patterns.