ppxscal/embedding_network huggingface dataset:
Building Software Recovery Assertions from a Fault Injection-based Propagation Analysis
Authors: Jeffrey M. Voas
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

We have investigated a fault injection-based tech- nique for undermining the ability of software compo- nents to produce undesirable outputs into the state of the system. Undesirable outputs are any class of out- puts that a component must not release into the state of the system given its current environment. Software components are said to be \failure-tolerant" if they release desirable outputs regardless of the program- mer faults, potential malicious input data directed against the component, and other non-malicious but corrupted input data. Our technology assesses the failure tolerance of software components after simu- lated program state corruptions are injected into the components as they execute. Based on the types of outputs that result from fault injection, our technique knows where "recovery assertions" (which act some- what like antibodies do in an organism) should be in- jected into software components to ensure desirable system outputs; the second part of our approach then suggests what the assertions should be. 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
Tree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks
Authors: Vara Varavithya, Prasant Mohapatra
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks (MINs). We first analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asynchronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The serialization is done using a technique based on grouping of the switching elements. The preliminary simulation results are encouraging as it lowers the latency by almost a factor of 4 when compared with the software multicasting approach proposed earlier.
Efficient Detection of Abnormalities in Large OCR Databases
Authors: Thien M. Ha
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Building large Optical Character Recognition (OCR) databases is a time-consuming and tedious work. Moreover, the process is error-prone due to the difficulity in segmentation and the uncertainty in labelling. When the database is very large, say one million patterns, human errors due to fatigue and inattention become a critical factor. This paper discusses one method to alleviate the burden caused by these problems. Specifically, the method allows an automatic detection of abnormalities, e.g. mislabelling, and thus may contribute to clean up a labelled database. The method is based on the recently proposed optimum class-selective rejection rule. As a test case, the method is applied to the NIST databases containing nearly 300'000 handwritten numerals.
A Component-Based Groupware Development Methodology
Authors: Cléver Ricardo Guareis de Farias, Luís Ferreira Pires, Marten van Sinderen
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

Software development in general and groupware applications in particular can greatly benefit from the reusability and interoperability aspects associated with software components. Component-based software development enables the construction of software artefacts by assembling prefabricated, configurable and independently evolving buildings blocks, called software components. This paper presents a methodology for the development of groupware applications using a set of composable software components. This methodology consists of splitting the software development process according to four abstraction levels, viz., enterprise, system, component and object, and three different views, viz., structural, behavioural and interactional. The use of different abstraction levels and views allows a better control of the development process. We illustrate this methodology using a chat application as a case study.
Using Pattern-Join and Purchase-Combination for Mining Web Transaction Patterns in an Electronic Commerce Environment
Authors: Ching-Huang Yun, Ming-Syan Chen
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper, we explore the data mining capability, which involves mining Web transaction patterns for an electronic commerce (EC) environment. To better reflect the customer usage patterns in the EC environment, we propose a mining model that takes both the traveling patterns and purchasing behavior of customers into consideration. We devise two efficient algorithms (MTSPJ and MTSPC) for determining the frequent transaction patterns, which are termed large transaction patterns in this paper. In addition, algorithm WTM devised in our prior work, is used for comparison purposes. By utilizing the path-trimming technique, which is developed, to exploit the relationship between traveling and purchasing behaviors, MTSPJ and MTSPC are able to generate the large transaction patterns very efficiently. A simulation model for the EC environment is developed and a synthetic workload is generated for performance studies.
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
Authors: Uriel Feige, Michael Langberg, Gideon Schechtman
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector k-colorable, and that for constant k, graphs that are vector k-colorable can be colored by roughly \Delta ^{1 - {2 \mathord{\left/ {\vphantom {2 k}} \right. \kern-\nulldelimiterspace} k}} colors. Here \Delta is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring and for maximal independent set.We showthat for every positive integer k there are graphs that are vector k-colorable but do not have independent sets significantly larger than {n \mathord{\left/ {\vphantom {n {\Delta ^{1 - 2k} }}} \right. \kern-\nulldelimiterspace} (and hence cannot be colored with significantly less that {\Delta ^{1 - 2k} }} colors). For k = 0({{\log n} \mathord{\left/ {\vphantom {{\log n} {\log n)}}} \right. \kern-\nulldelimiterspace} {\log n)}} we show vector k-colorable graphs that do not have independent sets of size(\log n)^c for some constant c. This shows that the vector chromatic number does not approximate the chromatic number within factors better than n/polylogn.As part of our proof, we analyze "property testing" algorithms that distinguish between graphs that have an independent set of size n/k, and graphs that are "far" from having such an independent set. Our bounds on the sample size improve previous bounds of Goldreich, Goldwasser and Ron (JACM 1998) for this problem.
An Effective Memory--Processor Integrated Architecture for Computer Vision
Authors: Youngsik Kim, Tack-Don Han, Shin-Dug Kim, Sung-Bong Yang
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper an effective memory-processor integrated architecture, called memory_based processor array (MPA), for computer vision is proposed. The MPA can be easily attached into any host system via memory interface. In order to measure the impact of the memory interface structure an analytical model is derived. The performance improvement on the proposed model for the memory interface architecture of the MPA system can be 6% - 40% for vision tasks consisting of sequential and data parallel tasks. The asymptotic time complexities of the mapping algorithms are evaluated to verify the cost-effectiveness and the efficiency of the MPA system.
Dependent Rounding in Bipartite Graphs
Authors: Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We combine the pipage rounding technique of Ageev & Sviridenko with a recent rounding method developed by Srinivasan, to develop a new randomized rounding approachfor fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications:richer random-graph models for graphs with a given degree-sequence;improved approximation algorithms for: (i) throughput-maximization in broadcast scheduling, (ii) delay-minimization in broadcast scheduling, and (iii) capacitated vertex cover;fair scheduling of jobs on unrelated parallel machines.A useful feature of our method is that it lets us prove certain (probabilistic) per-user fairness properties.
Web services and data integration
Authors: Serge Abiteboul, Omar Benjelloun, Tova Milo
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

The developments of XML [4] and Web services [3] arechanging radically the art of data integration. We brieflydescribe Web services and consider some of their impacton data integration. We argue that XML and Web servicesprovide the proper infrastructure for data integration at theWeb scale. This is illustrated by some work going on atINRIA on Active XML, that is XML extended by allowingthe embedding of calls to Web services.
Generating a Pattern-Based Application Development Environment for Enterprise JavaBeans
Authors: Imed Hammouda, Kai Koskimies
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Enterprise JavaBeans (EJB) is Java's component architecture for server-side distributed enterprise applications. The architecture of EJB applications is based on well-established solutions common to most distributed business systems. To utilize the architecture in an optimal way, proven EJ specific design solutions have been identified and collected as a set of design patterns. The use of these EJB design patterns as a tightly interconnected pattern system can significantly ease the development process of EJB based applications and improve the quality of the produced software. We will study in this paper how a general architectural tool (Fred) can be used to generate an EJB programming environment, when given the specifications of the EJB design patterns as input. This environment can be viewedas an architecture-centric wizard that guides the user through the development of the application, following the EJ design patterns.
Popularity-Independent Multimedia-on-Demand Server Model
Authors: Mohammad A. Mikki, Kangbin Yim, Gihyun Jung
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper we develop a VHDL-based popularity-independent multimedia-on-demand distributed server model. The three server subsystems: The control subsystem, the communication subsystem and the storage subsystem are modeled. The communication subsystem is designed as an interconnection network with meshed-pipe structure and delivers packets to their destination through the sub-optimal shortest path. A model for the video traffic generated at the server side for modeling the data sent to the users is also presented. We use simulation experiments to validate our modeling approach and compare the results with those obtained using OPNET simulation tool. The comparison results show that our approach is accurate compared to the simulation results. Our modeling approach also shows that using VHDL (Very high-speed integrated circuits Hardware Description Language) in modeling digital systems is powerful and accurate.
Unsatisfiable Random Formulas Are Hard to Certify
Authors: Albert Atserias
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We prove that every property of 3CNF formulas that implies unsatisfiability and is expressible in Datalog has asymptotic probability zero when formulas are randomly generated by taking 6n non-trivial clauses of exactly three literals uniformly and independently. Our result is a consequence of designing a winning strategy for Duplicator in the existential k-pebble game on the structure that encodes the 3CNF formula and a fixed template structure encoding a satisfiable formula. The winning strategy makes use of certain extension axioms that we introduce and hold almost surely on a random 3CNF formula. An interesting feature of our result is that it brings the fields of Propositional Proof Complexity and Finite Model Theory together. To make this connection more explicit, we show that Duplicator wins the existential pebble game on the structure encoding the Pigeonhole Principle and the template structure above. Moreover, we also prove that there exists a 2k-Datalog program expressing that an input 3CNF formula has a Resolution refutation of width k. As a consequence to our result andthe known size-width relationship in Resolution, we obtain new proofs of the exponential lower bounds for Resolution refutations of random 3CNF formulas and the Pigeonhole Principle.
Computerized Tomography Image Compression: FIC/spl times/WTC
Authors: Robinson Pizzio, Paulo R. G. Franco
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

Studies the advantages and disadvantages of fractal image compression (FlC) compared to wavelet transform compression (WTC). Our results indicate that there is an advantage in FIC for high compression ratios when we take the image quality into account. Considering the compression speed we have a significant difference, which indicates that WTC is much faster than FIC.
The Performance of Coordinated and Independent Checkpointing
Authors: Luís Moura Silva, João Gabriel Silva
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basically divided into two main classes: coordinated and independent checkpointing. This paper presents an experimental study that compares the performance of these two classes of algorithms. The main conclusion of our study is that coordinated checkpointing is more efficient than independent checkpointing and all the arguments against the performance of coordinated algorithms were not verified in practice.
MOTION: A Peer-to-Peer Platform for Mobile Teamwork Support
Authors: Engin Kirda, Harald Gall, Pascal Fenkam, Gerald Reif
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Large, global enterprises are increasingly faced with the problem of supporting employees that are on the move. Employees need to share business documents, locate expertise and knowledge through distributed searches, access effective subscription/notification mechanisms, and they need any time, anywhere access to the company's informationresources. We address these problems and requirements in the MObile Teamwork Infrastructure for Organizations Networking (MOTION)1 project and aim to create an advanced Information and Communication Technology (ICT) infrastructure for mobile teamwork. This short paper gives a brief description of the MOTION peer-to-peer platform for mobile teamwork.
Local Search for DAG Scheduling and Task Assignment
Authors: Min-You Wu, Wei Shu, Jun Gu
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Scheduling DAGs to multiprocessors is one of the key issues in high-performance computing. Local search can be used to effectively improve the quality of a scheduling algorithm. In this paper, based on topological ordering, we present a fast local search algorithm which can improve the quality of DAG scheduling algorithms. This low complexity algorithm can effectively reduce the length of a given schedule.
Software Support for Virtual Memory-Mapped Communication
Authors: Cezary Dubnicki, Liviu Iftode, Edward W. Felten, Kai Li
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Virtual memory-mapped communication (VMMC) is a communication model providing direct data transfer between the sender's and receiver's virtual address spaces. This model eliminates operating system involvement in communication, provides full protection, supports user-level buffer management and zero-copy protocols, and minimizes software communication overhead. This paper describes system software support for the model including its API, operating system support, and software architecture, for two network interfaces designed in the SHRIMP project. Our implementations and experiments show that the VMMC model can indeed expose the available hardware performance to user programs. On two Pentium PCs with our prototype network interface hardware over a network, we have achieved user-to-user latency of 4.8 /spl mu/sec and sustained bandwidth of 23 MB/s, which is close to the peak hardware bandwidth. Software communication overhead is only a few user-level instructions.
Disconnected Handwritten Numeral Image Recognition
Authors: Luan Ling Lee, Natanael Rodrigues Gomes
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes a method for numeral character recognition. Initially the image of an unknown numeral is pre-processed and two feature sets were compiled and used for numeral character recognition. The first feature set is compounded by topological characteristics and by characteristics obtained from pictorial distribution analysis of numeral images. The second set of features is the proper numeral images, after being normalized. The classification process is divided into two stages. In the first stage, the classification is based on the first feature set. In the second stage of classification, Hopfield networks are used to find the most probable numeral class. Experimental results obtained from testing the laboratory prepared data and those handwritten numerals extracted from real Brazilian bank checks show that the recognition rates of 85% and 92.4% were achieved, respectively.
Ontology-Based Automatic Classification for the Web Pages: Design, Implementation and Evaluation
Authors: Rudy Prabowo, Mike Jackson, Peter Burden, Heinz-Dieter Knoell
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

In recent years, we have witnessed the continual growth inthe use of ontologies in order to provide a mechanism to enablemachine reasoning. This paper describes an automaticclassifier, which focuses on the use of ontologies for classifyingWeb pages with respect to the Dewey Decimal Classification(DDC) and Library of Congress Classification (LCC) schemes.Firstly, we explain how these ontologies can be built in amodular fashion, and mapped into DDC and LCC. Secondly,we propose the formal definition of a DDC-LCC and anontology-classification-scheme mapping. Thirdly, we explainthe way the classifier uses these ontologies to assistclassification. Finally, an experiment in which the accuracy ofthe classifier was evaluated is presented. The experiment showsthat our approach results an improved classification in terms ofaccuracy. This improvement, however, comes at a cost in a lowoverage ratio due to the incompleteness of the ontologies used. c
Reducing Matching Time for OPS5 Production Systems
Authors: Jeong A. Kang, Albert Mo Kim Cheng
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

A rule-based system must satisfy stringent timing con-straints when applied to a real-time environment. The most critical performance factor in the implementation of a pro-duction system is the condition-testing algorithm. We show an approach designed to reduce the response time of rule-based expert systems by reducing the matching time based on RETE.There are two steps in the method we propose: The first makes an index structure of the tokens to reduce the β-node-level join candidates. The second chooses the highest time tag for certain β-nodes to reduce the size of the β-memory and to keep the strategy of the RETE network. These steps reduce the amount of combinatorial match that is problem-atical in a real-time production system application.
Protecting Information in the Web - Position Paper
Authors: Elisa Bertino
Venue: 23rd International Computer Software and Applications Conference (1999)

The World Wide Web (Web for short) is allowing the deployment of a new generation of distributed information systems, whose communication platform is the Internet (or the Intranet), and whose architecture is broader client-server architecture, having potentially as set of clients the entire population of the Internet users and as servers all available Web servers. Such a new generation of global information systems has removed the technological barriers to the free circulation of information. Such a system allows clients to easily and transparently access data (e.g., documents, multimedia data, software) independently of their physical location, of their logical structure, and of the host operating system platform. Data can be also downloaded for local processing, modification and, in the case of software, execution. 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
Perceptually-Based Representation of Network Diagrams
Authors: Diana Galindo, Claudie Faure
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A pen-based interactive editor for network diagrams is proposed. The network diagrams are composed of geometrical figures and connecting lines. The user may hand-sketch a first diagram and then, modify it by adding new components or by erasing, replacing or moving the existing ones. The machine beautifies the draft and updates the whole structure of the diagram when the user produces local modifications. Graphic communication implies that the layout of the diagram follows principles which are grounded on visual perception. The machine must be able to detect perceptual constraints (alignments, equality of sizes etc.) for beautification and updating. A Perceptually Structured Representation (PSR) of the diagram is built automatically. A formal model of diagram perception is defined as a set of rules which are applied during the global analysis following the local analysis where the figures are detected and recognized.
On Validating a Physically-Based Deformable Surface Model
Authors: Shin-Ting Wu, Vanio Fragoso de Melo
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Preliminary results on the analysis of a physically-based model are presented.