ppxscal/embedding_network huggingface dataset:
Recognition of Handwritten Dates on Bank Checks using an HMM Approach
Authors: Marisa E. Morita, Edouard Letelier, Abdenaim El Yacoubi, Flávio Bortolozzi, Robert Sabourin
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The article presents the first results of our system applied to the automatic recognition of handwritten dates on Brazilian bank checks. Considering the omni-writer context, we detail our recognition module dedicated to processing the month field. This module is based on the combination of holistic and analytical approaches with a fixed lexicon. Both approaches operate with a single explicit segmentation technique to provide a grapheme sequence for the purposed hidden Markov models of each recognizer. We show significant improvements when combining both modules to get a satisfactory recognition rate considering the small database images we work with. Finally, we present various perspectives for future work.
Correlation Clustering
Authors: Nikhil Bansal, Avrim Blum, Shuchi Chawla
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u; v) is labeled either + or - depending on whether u and v have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as much as possible with the edge labels. That is, we want a clustering that maximizes the number of + edges within clusters, plus the number of - edges between clusters (equivalently, minimizes the number of disagreements: the number of - edges inside clusters plus the number of + edges between clusters). This formulation is motivated from a document clustering problem in which one has a pairwise similarity function f learned from past data, and the goal is to partition the current set of documents in a way that correlates with f as much as possible; it can also be viewed as a kind of "agnostic learning" problem.An interesting feature of this clustering formulation is that one does not need to specify the number of clusters k as a separate parameter, as in measures such as k-median or min-sum or min-max clustering. Instead, in our formulation, the optimal number of clusters could be any value between 1 and n, depending on the edge labels. We look at approximation algorithms for both minimizing disagreements and for maximizing agreements. For minimizing disagreements, we give a constant factor approximation. For maximizing agreements we give a PTAS. We also show how to extend some of these results to graphs with edge labelsin [-1, +1] and give some results for the case of random noise.
Application of data-centered approach to Year 2000 problem
Authors: Wei-Tek Tsai
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The data-centered approach uses variable classifications, dependence analysis, generalised program slicing and ripple effect analysis. In the Year 2000 problem, this approach can be useful. Variable classification is used to identify all input and output variables, and once the initial set of variables that are Year 2000 related is identified, dependence analysis can be used to identify all the variables that are potentially affected by the initial set of variables. The second set of variables is then examined to see if they are Year 2000 related. This process is repeated until all the Year 2000 related variables are identified. This process is essentially ripple effect analysis and uses generalized program slicing and dependence analysis. Once Year 2000 related variables are identified, generalized program slicing is performed to identify all the statements that potentially need to be changed. Once a statement is changed, it may induce additional changes. Ripple effect analysis can be used to ensure that all the parts that need to modified are examined. Finally, the changed software should be validated and regression testing can be used in this stage. Ripple effect analysis can be used in this stage by identifying the relevant test cases that needed to evaluated. This is done by maintaining traceability links between the software and its test cases.
PACK/UNPACK on Coarse-Grained Distributed Memory Parallel Machines
Authors: Seungjo Bae, Sanjay Ranka
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

PACK/UNPACK are Fortran 90/HPF array construction functions which derive new arrays from existing arrays. We present algorithms for performing these operations on coarse-grained parallel machines. Our algorithms are relatively architecture independent and can be applied to arrays of arbitrary dimensions with arbitrary distribution along every dimension. Experimental results are presented on the CM-5.
Distributed End-to-End Testing Management
Authors: Xiaoying Bai, W. T. Tsai, Techeng Shen, Bing Li, Ray Paul
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Testing is the primary means for quality assurance for enterprise systems, and integration testing is often the most time consuming and expensive part of testing. Recently Department of Defense proposed an End-to-End (E2E) integration testing process to address the challenge of testing large integrated information systems. The E2E testing activities include test thin-thread tree construction, condition tree specification, test configuration management, risk analysis, regression testing, ripple effect analysis, test scenario/case generation, rest result analysis, statistical analysis, and project management. A tool has been developed to support this E2E testing on J2EE using EJB and XML with Cloudscape relational database management system. This web-based tool also allows distributed collaboration and remote project management by the E2E testing participants including project managers, contractors, designers and testers.
Access order to avoid inter-vector-conflicts in complex memory systems
Authors: A. M. del Corral, José M. Llabería
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The performance of a vector processor accessing vectors is strongly dependent on the conflicts produced in the memory subsystem. The concurrent memory access of several vector streams causes inter-conflicts between the references of different vectors. In a complex memory system (several memory modules are mapped in every bus) the number of conflicts increases because the bus must be shared by the vector streams. This paper proposes a method that allows a concurrent access to several vector streams reducing the average memory access time in vector processors with complex memory systems.
Regression Containment through Source Change Isolation
Authors: Brian Ness, Viet Ngo
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Effective regression containment is an important factor in the design of development and testing processes for large software projects, especially when many developers are doing concurrent work on a common set of sources. Source change isolation provides an inexpensive, mechanical alternative to analytical methods for identifying the cause of software regressions. It also provides the advantage of enabling regressions to be eliminated by reversing the effect of source changes that introduced errant behavior, without the need to write new code, and without halting other development work on the same software. Deliverability is also improved.
Heterogeneous Component Coordination: The CLF Approach
Authors: Damián Arregui, François Pacull, Michel Riviere
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

This paper presents a concrete experiments in assembling components from different "protocol-aware" component frameworks such as Java/Jini (Sun), Corba 3.0 (Object Management Group), Enterprise JavaBeans (Sun) and our own framework called CLF (Coordination Language Facility). We describe how the CLF coordinator can be used to negotiate and perform distributed transactions across several components belonging to the previously cited frameworks, taking advantage of the native transactional capabilities they provide. Since the classical two-phase commit protocol ensures not only serializability but also linearizability, we are able to combine operations in a linearizable way on the whole set of components and thus enforce the serializability of the resulting transaction. We illustrate this approach through a showcase application implementing the coordination of heterogeneous components.
Efficient testability enhancement for combinational circuit
Authors: Yu Fang, Alexander Albicki
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We propose a novel testability enhancement scheme based on XOR Chain Structure. The structure is effective for improving both controllability and observability. The insertion points are selected by fast testability analysis and random pattern resistant node source tracking. Experiments with ISCAS85 benchmark circuits show that the scheme is effective. The incurred hardware overhead and performance penalty is relatively low.
An assessment of COMA multiprocessors
Authors: Gyungho Lee
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

In Cache Only Memory Architecture (COMA) for distributed shared memory multiprocessors, the physical location of a datum is completely decoupled from its address by organizing the memory local to each node as a cache for shared address space. As in traditional cache-coherent multiprocessors, the overhead involved in coherence enforcement strongly affects the performance. The overhead seems more pronounced in a COMA machine than the traditional multiprocessors because of its relatively huge size of the local memory acting as cache and the level of memory hierarchy at which coherence needs to be enforced. Using trace driven simulations of the Perfect Club Benchmark Suite, this paper studies the change in the miss ratio and the network traffic with the two coherence policies, update and invalidate. Our study shows that the two policies provide distinct characteristics which reveal different opportunity of improving COMA multiprocessors for different choice of coherence policy.
A New Performance Analysis Model of the Local Switching System
Authors: Tien-Chen Ho, Shang-Juh Kao
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

We study and present a new performance analysis model of the local switching system with three calling modes : incoming to line, line to line and line outgoing. In M/M/R/R queueing model, only incoming trunks and outgoing trunks are regarded as customers and servers respectively. This model is suited for simplified toll switches. In our model, lines are treated as either customers when calls are originated from or servers when calls are destinated to. In this paper, we derive an analytic steady-state solution and a loss formula for the new model and provide the comparisons of traffic between values from Erlang B formula and from our simulation results. From the comparisons, we conclude that traffic carried by the simulation is even larger than that by Erlang B formula. And M/M/R/R model is a special case of our new model.
A Service Framework Specification for Dynamic e-Services Interaction
Authors: Ravi Balakrishnan
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

This paper presents an overview of the concepts involved in implementing a totally inter-operable ecosystem of e-services encompassing both the business-to-business and business-to-consumer domains. These ecosystems integrate such things as supply chain automation, e-procurement, collaborative e-commerce, trading exchanges and personalized business-to-consumer interactions. This paper details the e-speak Service Framework Specification (SFS) and its core API that form the foundation for intelligent interaction amongst e-services in the ecosystem defined above. This paper also addresses some of the cardinal elements of a truly inter-operable ecosystem such as compliance with XML based business process schemas defined by RosettaNet and CommerceNet.
Distributed Object-Oriented Real-Time Simulation of Ground Transportation Networks with the TMO Structuring Scheme
Authors: K. H. Kim, Juqiang Liu, Masaki Ishida, Inho Kim
Venue: 23rd International Computer Software and Applications Conference (1999)

The TMO (Time-triggered Message-Triggered Object) structuring scheme is aimed at facilitating real-time (RT) distributed software engineering in a form which software engineers in the vast business software field can adapt to with small efforts. It is a syntactically simple and natural but semantically powerful extension of the conventional object structuring approaches. In the course of developing a TMO-structured RT system engineering methodology, an attractively simple approach to parallel and distributed RT simulation has been produced. Also, we recently implemented a TMO execution engine based on the Windows NT platform and named it TMOSM/NT. As an effort for validation of both the execution engine TMOSM/NT and the TMO-structured RT simulation approach, a freeway automobile traffic simulator named distributed object-oriented freeway simulator (DOFS), has been constructed. In this paper, the design techniques and tools applied in development of DOFS are discussed.
A VLSI chip for image compression using variable block size segmentation
Authors: S. B. Aruru, N. Ranganathan, K. R. Namuduri
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

The paper describes a VLSI architecture for lossless image compression based on the Variable Block Size Segmentation (VBSS) scheme. The VBSS scheme segments the image into variable size blocks, extracts the redundancy features in them, and encodes the blocks using suitable coding techniques in order to obtain maximum compression. The scheme is computationally intensive and time consuming when implemented in software. The proposed architecture fully utilizes the principles of parallelism and pipelining in order to obtain high speed and throughput. It requires simple basic cells and regular nearest-neighbor communication making it suitable for VLSI implementation. A prototype CMOS VLSI chip implementing the image characteristics extraction subsystem has been designed and verified using the Cadence design tools at the University of South Florida. The chip can be used to process an image of 1024/spl times/ 1024 pixels in 1.3 ms operating at a frequency of 100 MHz.
Half-Pipe Anchoring: An Efficient Technique for Multiple Connection Handoff
Authors: Ravi Kokku, Ramakrishnan Rajamony, Lorenzo Alvisi, Harrick Vi
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We present half-pipe anchoring, a technique that enables multiple connection handoff mechanisms that are efficient and easy to implement. In a server cluster, these mechanismsresult in better resource utilization and improved scalability. More importantly, half-pipe anchoring supports the only connection handoff mechanism that operates efficiently in heterogeneous clusters composed of specialized nodes. The key idea behind our approach is to decouple the two unidirectional half-pipes that make up a TCP connection between a client and a cluster. We anchor the unidirectional half-pipe from the client to the cluster at a designated server while allowing the half-pipe from the cluster to the client to migrate on a per-request basis to an optimal server where the request is best serviced. We describe the design and implementation of a multiple connection handoff mechanism in the Linux kernel that demonstrates the benefits of our technique.
Developing Dynamic Decision Support: Opportunities, Issues and Approaches
Authors: E. Coupey, Pamplin Hall
Venue: 23rd International Computer Software and Applications Conference (1999)

As the speed increases with which Internet-related computer technologies develop, so do the pressures placed on human decision makers to leverage the new technologies to make better decisions, faster. Use of the vast information resources available through the Internet is changing from incidental, undirected acquisition to focused, outcome-oriented usage.This paradigm shift creates a concomitant need for decision support tools that enable users to amass data, extract information, apply knowledge to integrate the information, derive alternative courses of action, and assess outcome probabilities. We describe software research and development efforts to these ends.
Problems, Solutions and Information Systems Development
Authors: Dilip Patel
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

In this paper, we are adapting Pólya's work, which is based around solving mathematicalproblems to information systems development. We propose a generic reusable business objectmodel based on general systems theory. We also show how these approaches can be integrated to provide a strategy for understanding business problems and developing integrated solutions within a given industrial sector. We also briefly discuss cognitive informatics and its relevance to understanding problems and solutions.
Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database
Authors: Anton P. Karadimce, Susan Darling Urban
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We present the notion of refined triggering graphs (RTG) for analyzing termination of active rules in object-oriented databases (OODBs). The RTG method consists of mapping the possibility that one active rule can trigger another to the satisfiability of a well-defined logic formula called a triggering formula. The unsatisfiability of the triggering formula is then an indication that the rule triggering possibility is nil. We identify three increasingly more powerful types of triggering formulae and give pointers to the corresponding satisfiability procedures.
E Learning In 2001
Authors: Peter K. Wiesner
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

In 2001, distance education is coming of age thanks to the phenomenal growth of the infrastructure to support e learning for university courses and company training programs. Expectations are high. Universities are gearing up to using the Web to satisfy the perceived demand for ioeducation anytime, any place.l, Companies are looking to the Web as a flexible and cost-effective way to train their work force. A SWOT analysis is useful in providing a current snapshot of e learning. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance Enhancement of Web-Based Push Transmitter with Channel Scheduling
Authors: Hsing Mei, Chia-His Chang, Wen-Hsien Tseng
Venue: 24th International Computer Software and Applications Conference (2000)

Push provides the automated and personalized web information delivery. Users can subscribe their interested channels from content providers. These channels will be delivered to users automatically in each update. Among all the components involved in a push system, transmitter manages the deployment and maintenance of information channels. In this paper, a content-based channel scheduling mechanism for transmitters is designed and evaluated. Instead of push information by arriving order, transmitter takes three more factors into account, i.e. the channel update period, the size of content, and the waiting time of content in queue. Transmitter delivers channels by their calculated priorities. Study the results from our XML-based simulation system, the new channel scheduling algorithm not only improve the average responding time, but also decrease the average loss rate.
ECO: Efficient Collective Operations for Communication on Heterogeneous Networks
Authors: Bruce Lowekamp, Adam Beguelin
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections of point-to-point connections does not promote efficient communication---particularly collective communication. The Efficient Collective Operations package (ECO) contains programs which solve this problem by analyzing the network and establishing efficient communication patterns. This paper describes ECO and gives performance results of using ECO to implement the collective communication in CHARMM, a widely used macromolecular dynamics package. ECO substantially improves the performance of CHARMM on a heterogeneous network. ECO's approach gives a programmer the ability to use the available networks to their full potential without acquiring any knowledge of the network structure.
Neural Cells Synthesis Using L-System
Authors: Osvaldo Vargas Jaques, Regina Célia Coelho
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper presents the generation of realistic morphologically neural cells employing a modified L-System. These grammars incorporate functions that refer to the morphological features extracted from natural cells (e.g. branch dendritic, angle and size). A parser is used to generate the neural cells, which can be viewed by a 3D visualization software specifically developed to show the branching structures.
Combining Loop Fusion with Prefetching on Shared-memory Multiprocessors
Authors: Naraig Manjikia
Venue: Proceedings of the international Conference on Parallel Processing (1997)

The performance of programs consisting of parallel loops on shared-memory multiprocessors is limited by long memory latencies as processor speeds increase more rapidly than memory speeds. Two complementary techniques for addressing memory latency and improving performance are: (a) cache locality enhancement for latency reduction and (b) data prefetching for latency tolerance. This paper studies the benefit of combining loop fusion for locality enhancement with prefetching. Experimental results are reported for multiprocessors with support for prefetching. For a complete application on an SGI Power Challenge R10000, combining loop fusion with prefetching improves parallel speedup by 46%.
Design and Implementation of Ad Hoc Classroom and eSchoolbag Systems for Ubiquitous Learning
Authors: Chih-Yung Chang, Jang-Ping Sheu
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

This paper describes the design and implementation of a learning technology project. The purpose of this project is to develop advanced wireless technologies for building an Ad Hocclassroom in order to contrive a modern and new learning environment. A wireless platform isdeveloped for teacher and students to establish a classroom dynamically irrespective of location and time bounds. As supported in traditional classroom, we develop information technology to provide teacher with teaching aids, such as blackboard, board rubber, colored chalk, microphone, voice recorder, video recorder, and so on, for course teaching and discussions in an ad hoc classroom. In addition, we provide student with electronic Schoolbag (or eSchoolbag) which packs electronic book, notebook, parents contact book, pencil case,writing materials, sheets, calculator, address book, and so on. Taking lesson in a lively, vivid, and new learning environment, students are expected to enhance their learning performance without any burden like attending classes physically. Moreover students get more flexible scope of learning during their convenient time.