ppxscal/embedding_network huggingface dataset:
Module Size Distribution and Defect Density
Authors: Yashwant K. Malaiya, Jason Denton
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Data from several projects show a significant relationship between the size of a module and its defect density. Here we address implications of this observation. Does the overall defect density of a software project vary with its module size distribution? Even more interesting is the question- can we exploit this dependence to reduce the total number of defects? We examine the available data sets and propose a model relating module size and defect density. It takes into account defects that arise due to the interconnections among the modules as well as defects that occur due to the complexity of individual modules. Model parameters are estimated using actual data. We then present a key observation that allows use of this model for not just estimation the defect density, but also potentially optimizing a design to minimize defects. This observation, supported by several data sets examined, is that the module sizes often follow exponential distribution. We show how the two models used together provide a way of projecting defect density variation. We also consider the possibility of minimizing the defect density by controlling module size distribution.
Preemption-based admission control in multimedia multiparty communications
Authors: N. Shacham
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In multimedia, multiparty communications a typical participant receives and often generates multiple real-time streams. Network resources are dedicated to each stream and are dynamically allocated and released in response to changing users demands throughout the session. Admission control procedures, which prioritize users' requests for stream delivery, and decide which resources to allocate, are considered. Existing admission control schemes base their decisions on resources that are unused at the time of the request, and reject a request (or queue it) if there are insufficient unused resources. The paper presents a novel approach in which admission is based not only on the unused resources but also on the resources occupied by the streams that are currently received by the requestor. If sufficient unused resources to deliver a requested stream are not available, other streams that are delivered to the requestor are preempted and the resources they occupy are reallocated to satisfy the new request. The manner by which candidate streams for preemption are identified and resources are reallocated depends on the relative importance of the streams to the recipient and the topology of the paths leading to it. The effect of the routing used by the network on the topology of the paths leading to a multi-stream receiver is discussed and protocols for preemption-based reallocation are presented.
Exemplar-Based Prototype Selection for a Multi-Strategy Learning System
Authors: Patrick Njiwoua, Engelbert Mephu Nguifo
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Multi-strategy Learning (MSL) consists of combining at least two different learning strategies to bring out a powerful system, where the drawbacks of the basic algorithms are avoided. In this scope, instance-based learning (IBL) techniques are often used as the basic component. However one of the major drawback of IBL is the prototype selection problem which consists in selecting a subset of representative instances in order to reduce the classification process. This paper presents a novel approach which consists of three steps. The first one builds a set of lattice-based hypotheses that characterize the training data set. Given an unseen example, the second step selects a subset of training instances through the way they verify the same hypotheses as the unseen example. And finally the last step uses this subset of training instances as the prototypes for the classification of the unseen example. Results of experiments that we conducted show the effectiveness of our approach compared to standard ML techniques on different datasets.
Wave and Wait Protocol (WWP): An Energy-Saving Transport Protocol for Mobile IP-Devices
Authors: Vassilios Tsaoussidis, Hussein Badr, Rohit Verma
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

This work involves the development of an experimental transport-level protocol running on top of IP for small, mobile, wireless stations. The protocol does not aim to handle real-time traffic. Its central concern is to conserve battery-powered energy used for transmission, even at the expense of slower data throughput. It attempts to conserve energy expenditure by adjusting the amount of data transmitted, trying to keep it below perceived network congestion. The higher the detected congestion risk-level in the network the less it attempts to transmit, thereby minimizing the need for duplicate data retransmission due to congested routers losing packets and so on. We outline the protocol specification, mechanisms and implementation, as well as preliminary evaluation results that clearly demonstrate the energy-saving capabilities of the protocol.
Effective, Automatic Procedure Extraction
Authors: Raghavan Komondoor, Susan Horwitz
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Legacy code can often be made more understandable and maintainable by extracting out selected sets of statements to form procedures and replacing the extracted code with procedure calls. Sets of statements that are non-contiguous and/or include non-local jumps (caused by go-tos, breaks, continues, etc.) can be difficult to extract, and usually cause previous automatic-extraction algorithms to fail or to produce poor results.The chief contributions of this paper are a semantics-preserving algorithm for extracting "difficult" sets of statements, and a study that compares the algorithm both to an ideal extractor (a human) and to previously reported automatic approaches. We found that "difficult" examples do arise frequently in practice, and that our algorithm is a significant improvement over previous work, achieving ideal results on over 70% of the difficult cases.
Signature Verification: Benefits of Multiple Tries
Authors: Ramanujan Kashi, Winston Nelson
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This method describes the advantages of a signature verification or any other biometric methodology having multiple tries. Traditional verification techniques acquire a test sample and compare with a model and a decision is made as to whether the test sample is genuine or a forgery. While it is clear that allowing a second try will reduce the false rejects, it will also increase the false accepts. However, from our experiments, the increase in false accepts was small compared to the dramatic reduction in false rejects. At the 1% false rejection (FR) rate, the addition of the second try reduced the false acceptance (FA) rate from 4.7% to 1.3%. So, in applications where very low FR is required, allowing the signer a second try appears to be a good option.
Info-Plaza: A social information filtering system for the World-Wide Web
Authors: S. Hiraiwa, Y. Kohda
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

We have prototyped a social information filtering system based on personal interests. The system is called Info-Plaza and is accessed via the World-Wide Web. Info-Plaza helps people to get new URLs which likely point to interesting web pages. Info-Plaza is a client-server system, which consists of XPlaza and Plaza-Server. XPlaza is a GUI-editor to create and arrange URL-Maps. The URL-Maps are used to register interesting web pages with the server. Plaza-Server has a database of URL-Maps collected from many users. It receives a URL-Map from a user, makes a new URL-Map based on similarities between the URL-Map, and the database entries, and then returns the new URL-Map, to the user. Thus users can exchange interesting URLs through Plaza-Server. Users are expected to edit the returned URL-Map, leaving useful URLs and removing unnecessary URLs. After repeating this process several times, the user will have a URL-Map that contains many links to interesting sites.
A Decision-Theoretic Approach to Resource Allocation in Wireless Multimedia Networks
Authors: Zygmunt Haas, Joseph Y. Halpern, Li Li, Stephen Wicker
Venue:  (2000)

The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in terms of decision theory. We propose a scheme that takes decision-theoretic concerns (like preferences) into account and discuss the difficulties and subtleties involved in applying standard techniques from the theory of Markov Decision Processes (MDPs) in constructing an algorithm that is decision-theoretically optimal. As an example of the proposed framework, we construct such an algorithm under some simplifying assumptions. Additionally, we present analysis and simulation results that show that our algorithm meets its design goals. Finally, we investigate how far from optimal one well-known heuristic is. The main contribution of our results is in providing insight and guidance for the design of near-optimal admission-control policies.
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Authors: Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes
Venue: Theoretical Computer Science (2003)

This paper relates classes of finite automata under various feedback products to some well-known pseudovarieties of finite semigroups via a study of their irreducible divisors (in the sense of Krohn-Rhodes). In particular, this serves to relate some classical results of Krohn, Rhodes, Stiffler, Eilenberg, Letichevsky, Gécseg, Ésik, and Horváth. We show that for a finite automaton satisfaction of (1) the Letichevsky criterion for non-empty words, (2) the semi-Letichevsky criterion for non-empty words, or (3) neither criterion, corresponds, respectively, to the following properties of the characteristic semigroup of the automaton: (1) non-constructability as a divisor of a cascade product of copies of the two-element monoid with zero U, (2) such constructability while having U but no other non-trivial irreducible semigroup as a divisor, or (3) having no non-trivial irreducible semigroup divisors at all. The latter two cases are exactly the cases in which the characteristic semigroup is R-trivial.This algebraic characterization supports the transfer of results about finite automata to results about finite semigroups (and vice versa), and yields insight into the lattice of pseudovarieties of finite semigroups--or, equivalently via the Eilenberg correspondence, the lattice of +-varieties of regular languages--and the operators on these lattices that are naturally associated to various automata products with bounded feedback. In particular, all operators with non-trivial feedback are shown to be equivalent, and we characterize all pseudovarieties of finite semigroups closed under each type of feedback product either explicitly or by reducing the question to closure under the cascade product.
De Morgan Bisemilattices
Authors: J. A. Brzozowski
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We study de Morgan bisemilattices, which are algebras of the form (S, +, *, -, 1,0), where (S, +, *) is a bisemilattice, 1 and 0 are the unit and zero elements of S, and - is a unary operation, called quasi-complementation, that satisfies the involution law and de Morgan's laws. De Morgan bisemilattices are generalizations of de Morgan algebras, and have applications in multi-valued simulations of digital circuits. We present some basic observations about bisemilattices, and provide a set-theoretic characterization for a subfamily of de Morgan bisemilattices, which we call locally distributive de Morgan abilities.
Texture Synthesis by Non-Parametric Sampling
Authors: Alexei A. Efros, Thomas K. Leung
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A non-parametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated by querying the sample image and finding all similar neighborhoods. The degree of randomness is controlled by a single perceptually intuitive parameter. The method aims at preserving as much local structure as possible and produces good results for a wide variety of synthetic and real-world textures.
Animating multidimensional scaling to visualize N-dimensional data sets
Authors: C. L. Bentley, M. O. Ward
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Many techniques have been developed for visualizing multivariate (multidimensional) data. Most, if not all, are limited by the number of dimensions which can be effectively displayed. Multidimensional scaling (MDS) is an iterative non-linear technique for projecting n-D data down to a lower number of dimensions. This work presents extensions to MDS that enhance visualization of high-dimensional data sets. These extensions include animation, stochastic perturbation, and flow visualization techniques.
Match Virtual Machine: An Adaptive Runtime System to Execute MATLAB in Parallel
Authors: Malay Haldar, Anshuman Nayak, Abhay Kanhere, Pramod Joisha, Nagaraj Shenoy, Alok Choudhary, Prithviraj Banerjee
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

MATLAB is one of the most popular languages for desktop numerical computations as well as for signal and image processing applications. Applying parallel processing techniques to improve performance of MATLAB codes has been the goal of many recent works. Most current frameworks require the user to specify parallelism and/or information regarding type/shape of the variables, thereby sacrificing the user friendliness, which is one of the most popular MATLAB features. Other systems work on a restricted subset of MATLAB, thereby limiting the class of applications MATLAB can support. We present a runtime system capable of executing MATLAB code in parallel without any user intervention. The runtime system performs automatic parallelization and type/shape inference of the code at runtime. A unique feature of the runtime system is its capability to automatically adapt to changes in the underlying architecture, making it particularly useful for systems where predicting performance statically is difficult. We present experimental results obtained for the runtime system running on SGI Origin2000 shared memory multiprocessor.
Maintaining electronic commerce systems: the legal issues
Authors: M. Taylor
Venue: Journal of Software Maintenance: Research and Practice (2003)

Electronic commerce over the Internet is growing at an increasing pace worldwide. Maintenance of electronic commerce systems is thus becoming an increasingly important IT activity. In this paper the legal issues concerned with the maintenance of electronic commerce systems are examined based oil detailed case studies in two U.K.-based organizations, a marketing organization and a retail organization. Even seemingly trivial maintenance activities of electronic commerce systems such as changing Web site text can have legal implications due to the variety of advertising, consumer protection, data protection and other legislation and regulation that potentially applies to electronic commerce activities. In addition, the potentially global nature of electronic commerce activities implies that maintenance activities of electronic commerce systems need to comply not only with the legislation and regulation within the country of the seller, but also potentially with the legislation and regulation within the country of the consumer as well.
Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions
Authors: Hong Liu, R. E. Miller
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterministic and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that with only a few modifications, all the results established for cyclic protocols without nondeterministic and internal transitions still hold even if nondeterministic and internal transitions are allowed. We identify indefiniteness as a new type of logical error resulting from reachable internal execution cycles and show that it can also be detected for the class of cyclic protocols with finite fair reachable state spaces with finite extension
Algebraic Reasoning for Parallel Programming
Authors: Fabio Schifano
Venue:  (1997)

The use of a functional language is an attractive and promising approach to parallel programming. The parallelism is expressed structurally using the Higher Order Function (HOF) and can be implemented efficiently on a wide range of machines, using a Skeleton-based compilation technique. The algebra of the language is used to transform and optimize the programs conserving their semantics, where it is the compiler that determines whether the implementation of one syntactic expression is to be preferred to another. We describe an approach based on transformations through equations using Backus'' FP, as a Skeleton-based host language. The equations of the algebra are classified with respect to the main parameters of parallel programming: processing granularity, degree of parallelism and communications, and used to rewrite the programs. The methodology proposed is then applied to two classical problems of parallel data programming. EMAIL:: schifano@iei.pi.cnr.it 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
A Flexible Tracking Concept Applied to Medical Scenarios Using an AR Window
Authors: Bernd Schwald, Helmut Seibert, Tanja Weller
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper presents an approach to use a semitransparent display as a kind of window into a patient in the context of medical Augmented Reality (AR) applications. Besides the presentation of the non-off-the-shelf display, the tracking aspects of such an application are in focus of the work presented. In order to allow augmentations of real objects by virtual ones on the display, the user (i.e. physician), the display, the object (i.e. patient) and optional instruments have to be tracked. If required, a tracking system consisting of more than one subsystem, e.g. optical tracking combined with electromagnetic tracking, is used to satisfy allthe needs of such a medical application.
Visual Basic .NET Complete, 1 edition
Venue:  (2002)

:Visual Basic .NET Complete is a one-of-a-kind book -- valuable both for its broad content and its low price. Because the new version of Visual Basic is radically different from VB6, this book delivers the essential skills you need to start programming with VB.NET -- including the basics of the new language and developing Windows applications with the new Visual Studio .NET tools. With Visual Basic .NET Complete, you'll learn everything you need to know for Web application development with ASP.NET and XML -- from working with Web Forms to building Web Services. You'll also learn how to build database applications with ADO.NET, the latest version of Microsoft's data access technology. Finally, you'll get the experience of creating real-world applications, including building an online store using .NET technologies. Visual Basic .NET Complete introduces you to the work of some of Sybex's finest authors, so you'll know where to go to learn even mere about Visual Basic .NET. 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
A Round-Robin Parallel Partitioning Algorithm
Authors: Doug W. Moore
Venue:  (1988)

We develop parallel heuristic algorithms for partitioning the vertices of a graph into many groups of roughly equal size so that few edges connect vertices in different groups. The algorithms are intended for a message passing multiprocessor such as a hypercube, but only require the processors to be connected as a ring. They are based on the Kernighan-Lin algorithm, which finds a small edge separator that divides a graph into two pieces of equal size. Each of the algorithms features a parameter that allows for a trade-off between the potentially conflicting goals of reducing the number of edges between different groups and keeping the sizes of the groups roughly the same. These algorithms are applied to the problem of parallel block oriented Cholesky factorization. For an efficient factorization, we need a graph partition in which few pairs of vertex groups are interconnected; that is, we desire the quotient graph induced by the partition to be sparse. We discuss how standard partitioning heuristics may fail to give sparse quotient graphs and how they can be modified to correct this.
Adaptive routing in k-ary n-cube multicomputers
Authors: C. S. Yang, Y. M. Tsai, Y. L. Tsai
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Wormhole routing makes the communication latency insensitive of the network diameter and reduces the buffer size of each router. It has been widely adopted in many new generation distributed memory multiprocessor systems (DMMPs). The concept of virtual system is invented for deadlock-free routing design. Using a great deal of virtual channels is quite expensive to be implemented in practice and is not limitless. In this paper experimental results are given to evaluate the tradeoff between network congestion delay and throughput. Some results show that the congestion delay does not reduce visibly when the number of virtual channels is greater than that of internal channels by 2. A reasonable number of virtual channels can be derived from the results. A virtual networks system using only four virtual networks, two virtual channels in each direction, is presented. It shows that the minimum number of virtual networks to support a partially adaptive, minimal and deadlock free routing in k-ary n-cubes is just four. It uses only four virtual networks but can get a high degree of adaptiveness and high traffic capacity. Simulation results are presented to verify the performance.
Multi-TAP Controller Architecture for Digital System Chips
Authors: Bart Vermeulen, Tom Waayers, Sjaak Bakker
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper describes an architecture for controlling multiple IEEE 1149.1 compliant TAP controllers on a single digital system chip. The key feature of this architecture is the compatibility with the IEEE 1149.1 standard, and existing debugger software. Results are presented, obtained from an experiment, in which the proposed architecture is mapped on an FPGA to control multiple existing designs with TAP controllers.