ppxscal/embedding_network huggingface dataset:
Analysis of the MED Oscillation Problem in BGP
Authors: Timothy Griffin, Gordon T. Wilfong
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement "cold potato routing" between autonomous systems. However, the use of MED in practice has led to BGP persistent oscillation. The MED oscillation problem has been described with example configurations and complicated, step-by-step evaluation of dynamic route computations performed at multiple routers. Our work presents the first rigorous analysisof the MED oscillation problem. We employ the Stable Paths Problem (SPP) formalism that allows a static analysis of the interaction of routing policies. We give a formal definition of MED Induced Routing Anomalies (MIRA) and show that, in general, they can span multiple autonomous systems. However, if we assume that the BGP configurations between ASesfollows a common model based on customer/provider and peer/peer relationships, then we show that the scope of any MIRA is always contained within a single autonomous system.Contrary to widely held assumptions, we show that a MIRA can occur even in a fully meshed IBGP configuration. We also show that a stable BGP routing may actually violate the stated semantics of the MED attribute.
A high performance bus and cache controller for PowerPC multiprocessing systems
Authors: Michael S. Allen, W. Kurt Lewchuk, J. D. Coddington
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The PowerPC 620 microprocessor introduces a new integrated secondary cache controller and system bus interface. The secondary cache interface is 128 bits wide, supports L2 sizes from 1 MB to 128 MB, is ECC protected, can transfer 2.0 GB/sec at 133 MHz and supports an optional co-processor mode. The 620 bus is optimized for server-class systems requiring significant multiprocessing capability and supports the 64-bit PowerPC architecture with a 40-bit physical address bus and a separate 128-bit data bus. Address transfer rates of up to 33 M Addresses/sec at 66 MHz are achieved by pipelining the address snoop response with the address bus. The address and data buses are explicitly tagged allowing data transfers to be reordered with respect to the addresses. The data bus can transfer up to 1.0 GB/sec at 66 MHz. The bus protocol and the integrated L2 controller presented support the snoop-based MESI cache coherency protocol and direct cache-to-cache data transfers.
HMM Word Recognition Engine
Authors: Didier Guillevic, Ching Y. Suen
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We describe a Hidden Markov Model (HMM) based word recognition engine currently being developed to be integrated with the CENPARMI Bank Cheque Processing System. The various modules are described in detail, and preliminary results are compared with our previous global feature recognition scheme. The engine is tested on words from a database of over 4,500 cheques of 1,400 writers.
An Incremental Approach to Text Representation, Categorization, and Retrieval
Authors: Paul O'Neil
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Efficient and accurate information retrieval is a goal of just about everyone. Whether you are looking for information on the Internet, a book or article in the library, satellite imagery of missile silos, or a recipe for dinner, finding exactly what you want or need, even if you know exactly what you are looking for, can be an imposing and most difficult task. Many current techniques require an intimate understanding of the actual processes involved. The method presented in this paper provides for an automatic representation of text data by vectors, which can then be manipulated to categorize and organize the data. Information can be retrieved without knowledge of the underlying process. The user can ask for information using normal discourse. This technology can also be applied to data mining and visualization. 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
Towards a Refinement Calculus for Object Systems
Authors: He Jifeng, Liu Zhiming, Li Xiaoshan
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

This paper presents a refinement calculus for object systems with visibility, dynamic binding and mutual dependency. The intention is to support effective use of a relational model for specifying and reasoning in activities of an object system development process. The semantics framework will define the meaning of the combinators in the exactly same way as their counterparts in the imperative programming languages. This makes the approach more accessible to the users who are already familiar with the algebraic laws and the verifiation tools developed for these languages. The paper also provides a set of transformation rules in support of object system refinement.
Artificial Neural Network for Discrete Cosine Transform and Image Compression
Authors: K. S. Ng, L. M. Cheng
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An efficient adaptive image compression using structured artificial neural network (ANN) is described. An image is first divided into a series of sub-block with size 8x8 pixels. Then each of them is transformed by a Discrete Cosine Transform (DCT) using a structured ANN. Then, all the sub-block are sorted into 4 classes using another layers of structured ANN according to their level of activity within each sub-block. Adaptivity is provided by assigning bits between classes. The neural network used is a structured one instead of a fully connected so that convergency and speed of learning are dramatically improved. Each subnetwork is trained and tested independently. Excellent performance is achieved when it compares with traditional fully connected neural network image compression methods.
Boundary Normalization for Recognition of Non-Touching Non-Degraded Characters
Authors: Maurice Szmurlo
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a new approach to recognition of non-touching non-degraded characters. Our methods works on boundary functions of characters, and attempts to normalize these functions to orientation and size variations of the symbols. This allows to apply any one-dimensional transform in order to extract invariant features. We validated this approach by performing several experiments on both printed and hand written characters. The tests show that our method compares favorably to other methods described in the literature both from recognition accuracy and processing speed points of view.
On the Hardness of Optimal Auctions
Authors: Amir Ronen, Amin Saberi
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We study a fundamental problem in micro economics called optimal auction design: A seller wishes to sell an item to a group of self-interested agents. Each agent i has a privately known valuation vi for the object. Given a distribution on these valuations, the goal is to construct an optimal auction, i.e. a truth revealing protocol that maximizes the seller's expected revenue.We study this problem from a computational perspective and show several lower bounds. In particular we prove that no deterministic polynomial time ascending auction can achieve an approximation ratio better than \frac{3}{4}. The probability distribution constructed in our example has sensitive dependencies among the agents. On the flip side, we show that if the dependency between the agents' valuations is bounded, the problem can be approximated with a factor close to 1.
Assurance-Based Y2K Testing
Authors: Wei-Tek Tsai, Weiguang Shao, Sanjai Rayadurgam, Jinbao Li, Raymond Paul
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

This paper describes assurance techniques for Y2K testing. The Y2K problem is an important issue in the computer industry today and testing is still the main technique for quality assurance. There is a need to ensure that the software is reasonably safe from Y2K faults after testing. This paper uses a statistical model for ensuring this, and it explicitly models Y2K faults as well as the ripples induced by Y2K modifications. This paper then describes two processes to use the model in practice: a bottom-up process that can be used together with software development, and a top-down process that can be used when the project is almost completed. These processes can be easily embedded in an existing testing process with minimal changes and extra effort.
Defining Basic Units for Knowledge Interchange
Authors: Tang-Ho Lê, Luc Lamontagne
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper, we present a software tool allowing for knowledge interchange between people. With this tool, domain knowledge is represented as a number of knowledge networks, each of them consisting of several knowledge units and links. At its core, knowledge units are modeled as semi-structured entities to favor their understanding by the users. Moreover, the tool can convey various resources (e.g. multimedia files) which are necessary for the understanding of procedural knowledge. We argue afterwards that the tool can support the creation of new knowledge and can help to construct a new domain ontology. We give then some pratical reasons which have lead us to define an appropriate scope for the basic units involved in the interchange of knowledge. In the context of permanent knowledge evolution, we explain how structured knowledge units (instead of individual keywords) as used. Finally, we report on some experimentation using this tool carried out by our team as part of an educational project.
On Embedding Various Networks into the Hypercube Using Matrix Transformations
Authors: Mounir Hamdi, Siang W. Song
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Various researchers have shown that the binary n-cube (or hypercube) can embed any r-ary m-cubes, having the same number of nodes, with dilation 1. Their construction method is primarily based on the reflected Gray code. We present a different embedding method based on matrix transformation schemes that achieves the same results. In addition, this method has a nice property that makes it suitable to be used in divide-and-conquer algorithms. Thus, it constitutes a useful tool for the design of parallel algorithms for the hypercube.
Support for Extensibility and Reusability in a Concurrent Object-Oriented Programming Language
Authors: Raju Pandey, James C. Browne
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In many concurrent programming languages programs are difficult to extend and modify. This is because changes in a concurrent program (either through modification or extension) require re-implementation of some or all components. This paper presents the design of a concurrent object-oriented programming language based upon separate specifications of computations and interactions of programs. Separate specification of computations and interactions allows each to be separately modified and extended. We show that separation also facilitates extension of other language composition mechanisms such as class, inheritance, and template in order to define concurrent program abstractions. The resulting language supports extensibility and modifiability of concurrent programs as well as reusability of specifications of computations and interactions.
Automatic Method for Assessment of Telangiectasia Degreeing by Mathematical Morphology
Authors: Franklin César Flores, Roberto de Alencar Lotufo, Stela Isernhagen, Leonardo Marques Rocha, Alexandre Gonçalves Silva, Eduardo Faccini Rocha
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This paper presents an automatic method to assess telangiectasia degreeing, by estimatingthe reduction of the varicose area from pre to post-treatment using digital image analysis techniques. First both images are geometrically transformed and color space reduced, in order to make them suitable for processing. Next, the varicose veins are segmented via watershed transform and the varicose areas in both images are detected. Finally, the assessment degreeing is done. The method was applied to twenty patients and the results were very consistent, according to the analysis of six vascular specialists.
Generating Human-Usable Textual Notations for Information Models
Authors: Jim Steel, Kerry Raymond
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: Existing techniques for the transfer of information in and out of model-based repositories, and in particular the XMI format, are designed for expedient machine processing, and have significant drawbacks for human users. This report describes a system that automatically generates a producer and consumer for a human-usable textual notation corresponding to a given information model. This HUTN system is based on the Meta-Object Facility, an OMG standard for the definition of information models and the subsequent mapping of these models to CORBA interfaces. The primary design goal of the system is human usability, and this is achieved through consideration of the successes and failures of common programming languages. The system uses an abstract base syntax that is applied to all models, and allows for user alteration of the language through the provision of several language customisations.
Equivalence between Priority Queues and Sorting
Authors: Mikkel Thorup
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present a general deterministic linear space reduction from priority queues to sorting implying that if we can sort up to n keys in S(n) time per key, then there is a priority queue supporting delete and insert in S(n)+O(1) time and find - min in constant time. Conversely, a priority queue can trivially be used for sorting: first insert all keys to be sorted, then extract them in sorted order by repeatedly deleting the minimum. Hence, asymptotically this settles the complexity of priority queues in terms of that of sorting.Besides nailing down the complexity of priority queues to that of sorting, and vice versa, we translate known sorting results into new results on priority queues for integers and strings in different computational models.
Venice - a Toolkit/Framework for Integration and Component-Based Computing
Authors: Serge Lubenec
Venue: 23rd International Computer Software and Applications Conference (1999)

Venice is both a toolkit and a framework to enable development and system integration using component-based computing. It has been used to support the integration of a Defense Advanced Research Projects Agency (DARPA) large system integration effort. A technical description is provided and future research directions are outlined.
EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems
Authors: Maurizio A. Bonuccelli, M. Claudia Clò
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously sent over the same input port, or received through the same output port, the packets undergo a collision and are damaged, needing to be retransmitted later. This causes a performance degradation in terms of both throughput and delay. So, collisions must be avoided. The special type of traffic to be scheduled by Earliest Due Date is a periodic hard-real time one, and the objective is to schedule all the packets within their individual due dates. We establish that EDD is always able to produce a schedule meeting this objective, whenever the so called link utilization is no more than 1/2, showing that this worst case performance bound is tight. Such a bound can be effectively used as a feasibility test before actually running the algorithm.
Curvature and Orientation Estimation by Neuronal Structures
Authors: Júlia Sawaki Tanaka, Edson Tadeu Monteiro Manoel, Luciano da Fontoura Costa
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The paper presents a simple model of curvature and orientation estimation by neural networks where a pair of neurons is used to approximate the partial differential operators needed for curvature and orientation estimation. The influence of neuronal morphometry in the estimation of curvature and orientation is investigated and discussed. In addition, the biological plausibility of the model is discussed, and simulation results are presented along a sequence of increasing plausibility and sophistication. Steerable filters are considered as a means to increase the model efficiency.
Collaboration Design Patterns: Conceptual Tools for Planning for The Wireless Classroom
Authors: Chris DiGiano, Louise Yarnall, Charles Patton, Jeremy Roschelle, Deborah G. Tatar, Matt Manley
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

Wireless and mobile devices are beginning to offer stunning new technical capabilities for collaborative learning. Yet, researchers in this field must recognize the importance of complementing these technical advances with improved understanding of the patterns of classroom activity that most need support. Our approach is to create conceptual tools that help us think and talk about technology-supported collaborative learning. A particularlypowerful tool, we have found, is Collaborative Design Patterns, which capture common learning situations and tradeoffs in written form.
P-EDR: An Algorithm for Parallel Implementation of Parzen Density Estimation from Uncertain Observations
Authors: Pedro E. López-de-Teruel, José M. García, Manuel E. Acacio, Oscar Cánovas Reverte
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We have developed a parallel version of a new algorthim for nonparametric density estimation when the input samples are not directly known, or they have some noise. The algorithm is an extension of the Parzen method for exact observations, but management of uncertainty implies heavy computational loads in terms of both calculus and storage. Therefore, a parallel version of the algorithm is more adequate to solve this extended problem in a practical time, specially for samples of medium-large sizes. Our parallel algorithm has been designed in an SPMD style and implemented in a message-passing parallel environment. An efficient treatment of the distribution of the main data structure among processers, together with a low communication cost scheme results in a high scalability of the algorithm. Preliminary performance evaluations in a cluster of workstationsa show excellent speed-up results.
Data Access Reorganizations in Compiling Out-of-Core Data Parallel Programs on Distributed Memory Machines
Authors: Mahmut T. Kandemir, Rajesh Bordawekar, Alok N. Choudhary
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper describes optimization techniques for translating out-of-core programs written in a data parallel language to message passing node programs with explicit parallel I/O. We demonstrate that straightforward extension of in-core compilation techniques does not work well for out-of-core programs. We then describe how the compiler can optimize the code by (1) determining appropriate file layouts for out-of-core arrays, (2) permuting the loops in the nest(s) to allow efficient file access, and (3) partitioning the available node memory among references based on I/O cost estimation. Our experimental results indicate that these optimizations can reduce the amount of time spent in I/O by as much as an order of magnitude.
Optimal Scheduling for Normal and Interactive Operations in Parallel Video Servers
Authors: Min-You Wu, Wei Shu, Karthikeyan Samuthiram
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper presents scheduling algorithms for normal and interactive playout in parallel video servers. These algorithms include conflict-free scheduling, delay minimization, and request relocation for normal playout, as well as prefetching and grouping for interactive operations. Performance is presented for these algorithms.
Load Adaptive Algorithms and Implementations for the 2D Discrete Wavelet Transform on Fine-Grain Multithreaded Architectures
Authors: Ashfaq A. Khokhar, Gerd Heber, Parimala Thulasiraman, Guang R. Gao
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this paper we present a load adaptive parallel algorithm and implementation to compute 2D Discrete Wavelet Transform (DWT) on multithreading machines. In a 2D DWT computation, the problem sizes reduces at every decomposition level and the lengths of the emerging computation paths also vary. The parallel algorithm proposed in this paper, dynamically scales itself to the varying problem size. Experimental results are reported based on the implementations of the proposed algorithm on a 20 node multi-threading emulation platform, EARTH-MANNA. We show that multithreading implementations of the proposed algorithm are at least 2 times faster than the MPI based message passing implementations reported in the literature. We further show that the proposed algorithm and implementations scale linearly with respect to problem and machine sizes.
Motivational Factors for Bringing in and Demanding Contents from Knowledge Management Systems
Authors: Vesna Milijic
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This article refers to the fact that employees often cannot be motivated to use knowledge management (KM) systems. With respect to psychological studies and theories, it will be explained that employees behave "normal" considering the given circumstances. By identifying the factors that determine behaviour in the case of implementing KM systems, propositions can be derived, how to increase employees' motivation for bringing in the demanding contents from KM systems. 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
Procedural Butterfly Wing Patterns
Authors: Thompson P. Lied, Marcelo Walter
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We present a simple model for synthesis of butterfly wing patterns. The model simulates the formation of eyespots as are called the rounded circular arrangements which appear in many butterfly species. We illustrate our results with the examples of Diatheria clymena and Automeris io species.