ppxscal/embedding_network huggingface dataset:
A Cooperative Approach for Information Recommendation and Filtering
Authors: Claudia Lage Rebello da Motta, Marcos R. S. Borges
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Teams are more efficient than groups of individuals, especially when the team adopts a cooperative approach. However, a high level of communication and an established culture are required in order to obtain the benefits of team work. An information system is described that attempts to increase the potential of the team by supporting group communication and interaction. The work focuses on the cooperative filtering of the information used by the group to support the performance of its tasks. The information system aims at reducing the difficulties of group work and increasing the information selection level. Some validation is carried out by means of a couple of experiments with small groups of people working as a team.
Infobusiness Issues in ROC
Authors: Lung-Lung Liu
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The infobusiness operation has been popular for many years in the ROC. Management information systems in the government, military, and enterprise were the original applications, and then came the information service requirement from various kinds of users. Computer networks, database systems, and information providers together proposed the draft infobusiness environment. Closed systems are still the ones that major infobusiness operations provide to their customers. Issues in the infobusiness development include: (1) closed systems limited the infobusiness opportunity. (2) Chinese character handling and the inconvenient localized environment blocked the user and the vendor in information service applications. (3) Public computer networks are not popular, hence the add-on value of infobusiness is invisible. (4) Large database handling experience is not available. These issues concern techniques, standards, and even laws. For example, the open system concept is generally acceptable, but it is usually too vague for the public. Open databases still do not talk smoothly to one another, especially when different operating systems on networks are trying to exchange Chinese information. Another factor is that the total number of standard Chinese characters is still in negotiation internationally although applications have been practised for 20 years on computers. In order to unify the number of Chinese characters, there is discussion about whether laws are necessary to define a formal discipline for creating new Chinese characters.
Conflict-Free Access to Multiple Single-Ported Register Files
Authors: Silvia M. Mueller, Uzi Vishkin
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The paper presents a novel static algorithm for mapping values to multiple register files. The algorithm is based on the edge-coloring of a bipartite graph. It allows the migration of values among the register files to keep the number of RAMs as small as possible.By comparison with the register file design used in the Cydra 5 mini-supercomputer, our approach substantially reduces the number of RAMs. This reduction actually grows with the issue rate. For a system with an issue rate of 6 instructions per cycle, the cost (gate count) of the register files are already cut by half. On a numerical workload, like the Livermore Loops, both designs achieve roughly the same performance.
Record Subtyping in Flexible Relations by Means of Attribute Dependencies
Authors: Christian Kalus, Peter Dadam
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is presented by using a single, generic scheme constructor. In each model supporting structural variants the shape of some part of a heterogeneous scheme may be determined by the contents of some other part of the scheme. We formalize this relationship by a certain kind of integrity constraint we have called "attribute dependency" (AD). We motivate how ADs can be used, besides their application in type and integrity checking, to incorporate record subtyping into our extended relational model. Moreover, we show that ADs yield a stronger assertion than the traditional record subtyping rub as they consider interdependencies among refinements. We discuss how ADs are related to query processing and how they may help to identify redundant operations.
NERV: a parallel processor for standard genetic algorithms
Authors: Rainer Hauser, Reinhard Männer, Mikhail Makhaniok
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The paper describes the implementation of a standard genetic algorithm (GA) on the MIMD multiprocessor system NERV. It discusses the special features of the NERV hardware which can be utilized for an efficient implementation of a GA without changing the structure of the algorithm. The NERV multiprocessor is a system which has been originally designed for the efficient simulation of neural networks.
Experience of Using COTS Components for Deep Space Missions
Authors: Savio N. Chau
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

In recent years, NASA has adopted a faster, better, and cheaper philosophy for space exploration. This philosophy mandates space missions to be accomplished with much lower cost, shorter development cycle, and more capabilities than ever. In order to meet these challenges, starting 1998, NASA's Office of Space Science has initiated the Advanced Deep Space Systems Technology Program, also known as X2000, to develop advanced technologies for future deep-space exploration missions. One of the focus technology development areas is advanced avionics, which is being developed by the Center for Integrated Space Microsystems (CISM) at the Jet Propulsion Laboratory. Under X2000 and CISM, a breakthrough multi-mission avionics system is being developed. This avionics system employs low cost hardware and software products that are widely available in the commercial market. By using COTS through out the system, we expect to significantly reduce both the development cost as well as the recurring cost of the system, and thus be able to meet the faster, better, cheaper challenges. On the other hand, COTS are not specifically developed for applications such as deep-space missions. Therefore, the real challenges are: How to select COTS technologies How to overcome their shortcomings in space applications.
Revealing the hidden Markov recognizer
Authors: C. Aufmuth
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The article describes a tool for visualizing hidden Markov recognizers (HMR) which allows the developer to get a detailed view of the recognition process. Improvements are suggested for a hidden Markov recognizer using an appropriate processing and visualization tool.
Robust Multifont OCR System from Gray Level Images
Authors: Frank LeBourgeois
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a general robust OCR system designed for practical use and suited to unconstrained gray-level images grabbed from a CCD camera. The system works with minimum assumptions on font , text location, size, color and the background scene. To avoid the threshold problems with text segmentation and feature extraction, which depend on character binarization, we propose to process the full gray level image directly. The text blocks localization in complex scenes using a specific filter which enhances any text from the backgound without binarization. A special stage is designed to separate characters, even touched, by using gray-level information. We also extract gray-level features which make the algorithm more reliable, in particular under poor printing conditions or bad contrast digitization.
Robust Approximation of Offsets and Bisectors of Plane Curves
Authors: João Batista S. de Oliveira, Luiz Henrique de Figueiredo
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

Most methods for computing offsets and bisectors of parametric curves are based on a local formulation of the distance to a curve. As a consequence, the computed objects may contain spurious parts and components, and have to be trimmed. We approach these problems as global optimization problems, and solve them using interval arithmetic, thus generating robust approximations that need not be trimmed.
A Locally Adaptive Edge-Preserving Algorithm for Image Interpolation
Authors: Leízza Rodrigues, Díbio Leandro Borges, Luiz Marcos Gonçalves
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Digital image interpolation techniques are frequently used to enlarge pictures, i.e. zooming in, and they are upon increasingly demand for developing product applications using digital still cameras. One common difficulty with conventional interpolation techniques is that of preserving details, i.e. edges, and at the same time smoothing the data for not introducing spurious artifacts. A definitive solution to this is still an open issue, although there are working methods in the market, see e.g. Parker et. al. [6], Sakamoto et. al. [8] for recent surveys. In this paper we propose a locally adaptive edge-preserving algorithm for image interpolation, which deals with this problem, and different than other methods shows how to compute local thresholds preserving edges and not destroying smoothness at the same time.
Cascaded Execution: Speeding Up Unparallelized Execution on Shared-Memory Multiprocessors
Authors: Ruth E. Anderson, Thu D. Nguyen, John Zahorjan
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Both inherently sequential code and limitations of analysis techniques prevent full parallelization of many applications by parallelizing compilers. Amdahl's Law tells us that as parallelization becomes increasingly effective, any unparallelized loop becomes an increasingly dominant performance bottleneck.We present a technique for speeding up the execution of unparallelized loops by cascading their sequential execution across multiple processors: only a single processor executes the loop body at any one time, and each processor executes only a portion of the loop body before passing control to another. Cascaded execution allows otherwise idle processors to optimize their memory state for the eventual execution of their next portion of the loop, resulting in significantly reduced overall loop body execution times.We evaluate cascaded execution using loop nests from wave5, a Spec95fp benchmark application, and a synthetic benchmark. Running on a PC with 4 Pentium Pro processors and an SGI Power Onyx with 8 R10000 processors, we observe an overall speedup of 1.35 and 1.7, respectively, for the wave5 loops we examined, and speedups as high as 4.5 for individual loops. Our extrapolated results using the synthetic benchmark show a potential for speedups as large as 16 on future machines.
Implementation and Evaluation of the Complex Streamed Instruction Set
Authors: Ben H. H. Juurlink, Stamatis Vassiliadis, Dmitri Tcheressiz, Harry A. G. Wijshoff
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: An architectural paradigm designed to accelerate streaming operations on mixed-width data is presented and evaluated. The described Complex Streamed Instruction (CSI) set contains instructions that process data streams of arbitrary length. The number of bits or elements that will be processed in parallel is, therefore, not visible to the programmer, so no recompilation is needed in order to benefit from a wider datapath. CSI also eliminates many overhead instructions (such as instructions needed for data alignment and reorganization) often needed in applications utilizing media ISA extensions such as MMX and VIS by replacing them by a hardware mechanism. Simulation results using several multimedia kernels demonstrate that CSI provides a factor of up to 9.9 (4.0 on average) performance improvement when compared to Sun's VIS extension. For complete applications, the performance gain is 9% to 36% with an average of 20%.
The Complexity of First-Order and Monadic Second-Order Logic Revisited
Authors: Markus Frick, Martin Grohe
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic.We show that unless PTIME = NP, the model-checking problem for monadic second-order logic on finite words is not solvable in time f(k) ·p(n),for any elementary function f and any polynomial p. Here k denotes the size of the input sentence and n the size of the input word. We prove the same result for first-order logic under a stronger complexity theoretic assumption from parameterized complexity theory.Furthermore, we prove that the model-checking problems for first-order logic on structures of degree 2 and of bounded degree d\leqslant 3 are not solvable in time 2^(2^{0(k)}} ·p(n) (for degree 2), and 2^{2^{2^{0(k)}}} ·p(n) (for degree d) for any polynomial p, again under an assumption from parameterized complexity theory. We match these lower bounds by corresponding upper bounds.
1-Dimensional and Pseudo 2-Dimensional HMMs for the Recognition of German Literal Amounts
Authors: Rolf-Dieter Bippus
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Hidden Markov Models (HMMs) are fre-quently used in off-line cursive script recognition. In most cases the script is processed strictly from left to right, yielding a sequence of feature vectors fed into the HMM recognizer. In order to achieve good recognition results, more or less complex normalization has to be performed on the script beforehand to reduce the effects of writer variability. Taking the example of German literal amounts, especially ruler-line estimation and height normalization becomes a difficult task due to the often extremely long words. In many cases the assump-tion of straight ruler lines does not hold. Thus it would be advantageous to integrate normalization into the rec-ognition process. We present two approaches using regular one-dimensional HMMs in comparison to Pseudo two-dimensional HMMs (P2DHMM). Preprocessing is basically identical for both approaches. In the case of P2DHMMs, however, we use a much simpler ruler line estimation scheme. Under otherwise similar conditions, the P2DHMMs have proved to be slightly superior to the regular HMMs in first experiments. The performance could still be enhanced by combining the results from both recognizers.
Developing and Applying Component-Based Model-Driven Architectures in KobrA
Authors: Colin Atkinson, Barbara Paech, Jens Reinhold, Torsten Sander
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Component-based software engineering is widely expected to revolutionize the way in which software systems are developed and maintained. However, companies who wish to adopt the component paradigm for serious enterprise software development face serious migration obstacles due to the perceived incompatibility of components with traditional, commonly used development approaches. This perception is reinforced by contemporary methods and component technologies, which typically view components as merely "binary-level" modules with little relevance beyond the implementation and deployment phases of development. In this paper we present a method, known as KobrA, that embraces the component concept at all phases of the software life-cycle, and allows high-level components (described in the UML) to be implemented using conventional software development approaches as well as the latest component technologies (e.g. JavaBeans, CORBA, COM). The approach therefore provides a practical vehicle for applying he component paradigm within the context of a model driven architecture. After explaining the noteworthy features of the method, the paper briefly presents an example of its use in the development of an Enterprise Resource Planning System.
Parallel Multilevel Graph Partitioning
Authors: George Karypis, Vipin Kumar
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processor Cray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 parts, on a 128-processor Cray T3D in less than 3 seconds. This is at least an order of magnitude better than any previously reported run times on 128-processors for obtaining an 128-partition. This also makes it possible to use our parallel graph partitioning algorithm to partition meshes dynamically in adaptive computations. Furthermore, the quality of the produced partitions and orderings are comparable to those produced by the serial multilevel algorithm that has been shown to substantially outperform both spectral partitioning and multiple minimum degree.
pTCP: An End-to-End Transport Layer Protocol for Striped Connections
Authors: Hung-Yun Hsieh, Raghupathy Sivakumar
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The TCP transport layer protocol is designed for connections that traverse a single path between the sender and receiver. However, there are several environments in which multiple paths can be used by a connection simultaneously. In this paper we consider the problem of supporting striped connections that operate over multiple paths. We propose an end-to-end transport layer protocol called pTCP that allows connections to enjoy the aggregate bandwidths offered by the multiple paths, irrespective of the individual characteristics of the paths. We show that pTCP can have a varied range of applications through instantiations in three different environments: (a) bandwidth aggregation on multi-homed mobile hosts, (b) service differentiation using purely end-to-end mechanisms, and (c) end-systems based network striping. In each of the applications we demonstrate the applicability of pTCP and how its efficacy compares with existing approaches through simulation results.
Person Recognition through Eigeneyes Selection Based on Fuzzy Distance to Multiple Class Prototypes
Authors: Jishu Ashimine, Teófilo Emídio de Campos, Roberto Marcondes Cesar Junior, Isabelle Bloch
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper introduces a new criterion function to be used by feature selection algorithms based on fuzzy distances. Experiments using the introduced criterion function applied to the problem of face recognition are described.
Synthetic Parameters for Handwriting Classification
Authors: V. Bouletreau, Nicole Vincent, Robert Sabourin, Hubert Emptoz
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Viviane Bouletreau , Nicole Vincent, Robert Sabourin, and Hubert Emptoz In this paper, we present a new family of parameters for handwriting analysis based on the fractal behavior of writing. These parameter allow the classification of writing into different families which could be used as a preliminary step for recognition methods. They also constitute a way to quantify some legibility properties and we show that they can be useful for cognitive approaches of handwriting analysis.
Parallel Processing of Spatial Joins Using R-trees
Authors: Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Fachgebiet Informatik, Universität Marburg, Marburg, GermanyIn this paper, we show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so-called shared virtual memory which is well-suited for the design and implementation of parallel spatial join algorithms. We start with an algorithm that consists of three phases: task creation, task assignment and parallel task execution. In order to reduce CPU- and I/O-cost, the three phases are processed in a fashion that preserves spatial locality. Dynamic load balancing is achieved by splitting tasks into smaller ones and reassigning some of the smaller tasks to idle processors. In an experimental performance comparison, we identify the advantages and disadvantages of several variants of our algorithm. The most efficient one shows an almost optimal speed-up under the assumption that the number of disks is sufficiently large.
OCAM: A Collaborative System for Multimedia Applications
Authors: Hassan Mountassir, S. Serre
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Software engineering tasks as design and programming require the concurrent participation of multiple users, possibly geographically dispersed. But traditional software environments have not been designed to facilitate collaborative work. In this paper we present briefly a tool for communication among many persons in which users can elaborate documents with synchronous and asynchronous interaction modes.
Efficient algorithms for global data communication on the multidimensional torus network
Authors: Paraskevi Fragopoulou, Selim G. Akl
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Efficient interprocessor communication is crucial to increasing the performance of parallel multiprocessors. In this paper, a special framework is developed on the multidimensional torus, a network that is currently receiving considerable attention. Using this framework as the basic tool, or spanning graph with special properties, to fit various communication needs, is constructed on the network. The importance of this graph is demonstrated with the development of optimal algorithms for three fundamental communication problems, namely the multinode broadcasting and the single-node and multinode scattering under the store-and-forward, all-port communication model.
Small Induced-Universal Graphs and Compact Implicit Graph Representations
Authors: Stephen Alstrup, Theis Rauhe
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We show that there exists a graph G with n \cdot 2^{0(\log* n)} nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies existence of a graph with n^k 2^{0(\log* n)}nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of \Omega (n^k) for the size of such a graph. The upper bound is obtained through a simple labeling scheme for parent queries in rooted trees.