ppxscal/embedding_network huggingface dataset:
Concurrent Application of Compaction and Compression for Test Time and Data Volume Reduction in Scan Designs
Authors: Ismet Bayraktaroglu, Alex Orailoglu
Venue: IEEE Transactions on Computers (2003)

A test pattern compression scheme for test data volume and application time reduction is proposed. While compression reduces test data volume, the increased number of internal scan chains due to an on-chip, fixed-rate decompressor reduces test application time proportionately. Through on-chip decompression, both the number of virtual scan chains visible to the ATE and the functionality of the ATE are retained intact. Complete fault coverage is guaranteed by constructing the decompression hardware deterministically through analysis of the test pattern set.
A Comprehensive and Systematic Methodology for Client-Server Class Integration Testing
Authors: L. C. Briand, Y. Labiche, Y. Wang
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

This article is a first attempt towards a comprehensive,systematic methodology for class interface testing in thecontext of client/server relationships. The proposedapproach builds on and combines existing techniques. Itfirst consists in selecting a subset of the method sequencesdefined for the class testing of the client class, based onan analysis of the interactions between the client and theserver methods. Coupling information is then used todetermine the conditions, i.e., values for parameters anddata members, under which the selected client methodsequences are to be executed so as to exercise theinteraction. The approach is illustrated by means of anabstract example and its cost-effectiveness is evaluatedthrough a case study.
VSLI Based Analog Power System Emulator for Fast Contingency Analysis
Authors: Stephen P. Carullo, Michael Olaleye, Chika O. Nwankpa
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

This paper is concerned with the development of a fast, programmable, and reconfigurable power system emulator using an analog/mixed-signal VLSI microchip. The proposed microchip is capable of emulating behaviors of large power system networks under various conditions with faster than real-time computation time that is independent of the size of the power system network. The proposed model will focus on static security analysis, where the main objective is to access the existing operating state of the system. If the state is found to be secure, contingency analysis will be performed to evaluate system vulnerability and time necessary to obtain such results. This time will be compared to traditional computational techniques to evaluate static security of a power system. This paper discusses the design methodology of the proposed microchip and describes a smaller scale prototype of the analog emulator that is currently being developed on printed circuit boards (PCBs).
Can competitive analysis be made competitive?
Authors: Allan Borodin
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Competitive Analysis provides a relatively new perspective for studying the performance of online algorithms and, more generally, performance in any algorithmic setting based on "incomplete knowledge." In an online setting, the competitive ratio measures the worst case (over-all request sequences) performance of an online algorithm relative to an optimal offline algorithm that has complete knowledge of the entire request sequence. As such, competitive analysis avoids assumptions about this input distribution and a rather elegant and challenging mathematical theory is being developed. But to what extent does such a theory have relevance to a "real" algorithmic design? For example, can it be used profitably in the context of data migration and replication problems, or in the context of financial investment strategies?
Graduate programs in project management
Authors: Daniel Brandon
Venue: Technologies & methodologies for evaluating information technology in business (2003)

Presented in this chapter is research regarding graduate programs in the relatively new academic area of Project Management. A number of professional organizations have developed around the world to address and foster this specific discipline. Several universities also recognized the fact that Project Management involves distinct skills, and that the traditional degree programs and courses in business schools and other schools do not adequately cover and integrate these skills. The particulars of the research information concern degree and certificate offerings, program and course organization, delivery mechanisms, and the organizational location of the program within the university. The author's university is interested in developing a graduate Project Management program, and research conclusions toward this interest are presented.
A machine learning approach for designing dna sequence assembly algorithms
Authors: Mark Goldberg
Venue:  (2003)

We present two separate algorithms for solving the DNA sequence assembly problem. The sequence assembly problem is the reconstruction of a large sequence of DNA from a set of subsequences called fragments. Fragments are created by breaking, at random intervals, copies of the original DNA sequence. This creates a system of fragments in which many of the fragments overlap with each other. Identifying these overlapping fragments is the key to reforming the original strand. The first algorithm first identifies a &ldquo;correct&rdquo; series of fragment merges which would result in producing the original sample from which they were obtained. It enters each series into a database of solutions, which is then used to sequence DNA different than those used to create the database. The second algorithm uses a k-mer based approach to identifying overlapping regions in fragments. The method is an improvement over the first algorithm in two ways: (1) it is designed to sequence real fragments, which are different in composition from simulated fragments; (2) it can be used to sequence much longer strands of DNA. For both algorithms, parameters of computation are learned through experimentation with sequences of previously assembled DNA. Our experiments show that the parameters of computation generated by learning on a set of DNAs can be used to successfully sequence a separate set of DNA sequences.
Algorithm 828: DNSPLIN1: discrete nonlinear spline interpolation
Authors: Robert J. Renka
Venue: ACM Transactions on Mathematical Software (TOMS) (2003)

We describe a new method and a Fortran-77 code for constructing discrete approximations to nonparametric interpolating nonlinear spline curves. Our approach consists of minimizing the discretized strain energy by a descent method with a Sobolev gradient in place of the standard gradient. It serves as a demonstration of the Sobolev gradient method, which is much more generally applicable. The effectiveness of the method in rapidly producing smooth interpolatory curves is demonstrated by test results for several challenging data sets.
Video query processing in the VDBMS testbed for video database research
Authors: Walid Aref, Moustafa Hammad, Ann Christine Catlin, Ihab Ilyas, Thanaa Ghanem, Ahmed Elmagarmid, Mirette Marzouk
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content-based query and retrieval of video data. Video query processing presents significant research challenges, mainly associated with the size, complexity and unstructured nature of video data. A video query processor must support video operations for search by content and streaming, new query types, and the incorporation of video methods and operators in generating, optimizing and executing query plans. In this paper, we address these query processing issues in two contexts, first as applied to the video data type and then as applied to the stream data type. We first present the query processing functionality of the VDBMS video database management system as a framework designed to support the full range of functionality for video as an abstract data type. We describe two query operators for the video data type which implement the rank-join and stop-after algorithms. As videos may be considered streams of consecutive image frames, video query processing can be expressed as continuous queries over video data streams. The stream data type was therefore introduced into the VDBMS system, and system functionality was extended to support general data streams. From this viewpoint, we present an approach for defining and processing streams, including video, through the query execution engine. We describe the implementation of several algorithms for video query processing expressed as continuous queries over video streams, such as fast forward, region-based blurring and left outer join. We include a description of the window-join algorithm as a core operator for continuous query systems, and discuss shared execution as an optimization approach for stream query processing.
Ontological shape-description, a new method for visual information retrieval
Authors: Alberto Chávez-Aragón, Oleg Starostenko
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

There is a growing need for efficient visual informationretrieval systems which take into account particularfeatures of images, in order to avoid nonsense results. Inthis paper we propose a new method for content-based imageretrieval, which can be divided into two main parts. 1)Automatic segmentation and extraction of shapes from imagesub-regions. 2) Ontological descriptions of shapescontained in images. Our method allows users to performsketch queries; these are simple drawings whichrepresent the main idea of something the user is expectingto retrieve from the results. Once the user introduces asketch, it is simplified using discrete curve evolution, then,it is turned into a tangent space representation. Similaritymeasures based on turning functions are used to recoversimilar images. An ontology reduces the proportion of non-senseresults since the ontology permits the recovery ofimages related semantically, even if they do not have similarshapes
Incremental switch-level simulation with zero/integer-delay
Authors: Larry G. Jones
Venue: Proceedings of the conference on European design automation (1991)

We present the methods used in the implementation of an incremental zero/integer--delay switch--level logic simulator for MOS circuits based on the MOSSIM II switch--level model. Zero--delay timing reduces spurious reevaluations caused by minor changes to signal timing that do not affect logic, while integer--delay timing, a generalization of unit--delay methods, provides an ability to model race conditions that do affect the logic. The incremental simulator is embedded within a fully-integrated capture--compile--simulate tool. Modifications to the design at any level in the structural design hierarchy are automatically mapped into (possibly many) changes in the underlying transistor netlist and the incremental simulator is triggered to quickly resimulate only the affected regions of the circuit.
The MARKOV system of production rules: a universal Braille translator
Authors: Wolfgang A. Slaby
Venue: Issue 15 (March 1975) (1975)

It is the goal of this report to present the concept of MARKOV algorithm as a universal translator into Braille, which is applicable to every language and every definition of the respective (Grade 1 or Grade 2) Braille and to which all the language-dependent components are supplied as parameters.This report describes in detail the concept of MARKOV algorithm and attempts to make evident that this concept is an adequate general formalization of the translation process of inkprint into Braille.
Computer graphics for the blind
Authors: Harold E. Wefold
Venue: Issue 18 (January 1976) (1976)

Recent experience at Vitro Laboratories points to automated Braille graphics as an effective analytical tool for blind persons. The writer has developed a generalized system in which plot commands are captured on a "Macro tape". The plot thus defined can be placed on a pen plotter, electrostatic printer, CRT or line-printer without reprogramming. An option to the line-printer module allows lines to be displayed with dots and symbols to be displayed in Braille. An elastic strap, which fits on any printer, causes the dots to be raised. With automatic rescaling and scissoring the plots can be blown up to any size. This system is being regularly used to make plots of engineering data for a blind engineer at Vitro, with extensive savings in analysis time. Maps, mathematical curves, block diagrams, and perspective plots have also been generated which show great potential for educational purposes.
A design-plan-oriented methodology for applying case-based adaptation to engineering design
Authors: Talal Al-Shihabi, Ibrahim Zeid
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Adaptation of design cases is usually the most challenging part in building any case-based reasoning design system. The success of the adaptation process in finding a solution for a new design problem determines the success of the entire case-based reasoning (CBR) system. The techniques used for generating design solutions have many common aspects among the various engineering design classes that make them amenable to be captured in a generic framework for an acceptable level of abstraction. This paper proposes a design-plan-oriented methodology for adapting design cases to produce a solution to a new design problem in the domain of engineering design. The proposed methodology uses multicase adaptation and case built-in adaptation knowledge to produce a design plan for a new design problem. We first define the model of case representation to work with the proposed methodology. We then define the overall structure of the procedural framework of this methodology and its subprocesses. The system is then demonstrated through an application from the structural engineering domain.
Cell rotation graphs of strongly connected orientations of plane graphs with an application
Authors: Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu
Venue: Discrete Applied Mathematics (2003)

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is defined. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(G), denoted by T-, thus (T,T-) is called a pair of in-trees of D(G); G is Eulerian if and only if D(G) has an odd number of components (all Eulerian orientations of G induce the same component of D(G)); the width and height of T are equal to that of T-, respectively. Further it is shown that the pair of directed tree structures on the perfect matchings of a plane elementary bipartite graph G coincide with a pair of in-trees of D(G). Accordingly, such a pair of in-trees on the perfect matchings of any plane bipartite graph have the same width and height.
An integrated framework for formal development of open distributed systems
Authors: Issa Traoré, Demissie B. Aredo, Hong Ye
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper contributes to the discussion on issues related to the formal development of open distributed systems (ODS). The deficiencies of traditional formal notations in this setting are highlighted. We argue that there is no single formalism exhibiting all the features required to capture properties of ODSs. As a solution, we propose an integrated development framework that involves two notations: the Unified Modeling Language (UML) and the Prototype Verification System (PVS). We discuss the motivation for the choice of these notations, provide an overview of a CASE tool we have developed to support the proposed framework, and present a case study to demonstrate our approach.
Toward analysis tools for the engineering process
Authors: Raymond E. Levitt
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Rapid development and delivery of high-performance, high-quality new products is the key to survival and success for many firms in today's high technology, global marketplace. However, shrinking time to market for complex, high technology products can be extremely difficult and costly. Even the most successful engineering managers have experienced the escalating costs of overtime, coordination and rework that are so common in fast-track, high technology, product development efforts; and they know the quality problems that can result when coordination breaks down in the face of aggressive&mdash;often &ldquo;impossible&rdquo;&mdash;development schedules.
Addressing requirements issues within a conceptual modeling environment
Authors: Sol Greenspan, Mark Feblowitz, Chandra Shekaran, Jim Tremlett
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

This paper takes the position that research on how to formalize informal requirements information is not enough. One must actually identify what tasks the requirements analyst is undertaking, identify the types of knowledge that are being interrelated, and work out the desired relationships, or correspondences, between the various views. To do this, a conceptual modeling environment (ACME) is needed to define the various modeling viewpoints. An example is the definition of functional and architectural requirements and the assertion/retraction of design decisions that assign functions to components.
Enhancing the quality of multimedia data transmission over wireless links
Authors: Margaritis Margaritidis
Venue:  (2003)

The heterogeneity in Internet connectivity and the diversity in the existing multimedia applications motivated the work presented in this dissertation. Our research effort focuses on how to manage the available network resources in order to offer high quality performance and ubiquitous Internet connectivity to applications operating over mixed wired/wireless networks. The goal that we set is the maximization of the link efficacy subject to the specific constraints of the examined wireless link. The term efficacy defines the aggregate utility of all concurrent streams over a single wireless link. Our preliminary research revealed that the unconditional maximization of the link efficacy is an unacceptable solution in most wireless environments for various reasons. Instead, the design of an efficacy maximization algorithm must be done according to the specific constraints of each particular environment. We distinguish two categories, the single-user and the shared multi-user wireless environments. Each type of environment poses different and distinct constraints in the design and operation of a resource allocation algorithm. For the single-user wireless environment, we introduce MobiWeb, a proxy architecture designed to maximize the link efficacy, subject to the user's preferences. It features a dynamic prioritization scheme and a set of dynamically adjustable timers that provide high efficacy adaptation and protection from inter-stream interference and short-term link variations. Their presence allows MobiWeb to offer efficient utilization of the available resources and long-term operational stability to the demanding real-time streams. For the multi-user wireless environment, we introduce a resource allocation algorithm called Hyperbolic Fairness algorithm (H-F) that is designed to balance the maximization of the link efficacy with a notion of fairness. H-F's design is based on the hyperbolic fairness criterion, defined as equality in the product of bandwidth and utility for each stream. We present simulation results that show that H-F offers near maximum link efficacy while avoiding the starvation of any single stream. In addition, H-F is designed to conform to TCP-Friendly guidelines and has a sufficiently low computational complexity. This allows it to be implemented in most networking devices and to be deployed seamlessly in the current Internet infrastructure.
Homeland Security's Cyber Component: A Survey of Legal Issues
Authors: James B. Michael, Thomas C. Wingfield, Steven E. Roberts
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this panel we discuss the legal developments relatedto the cyber aspects of homeland security. Throughanalysis of statutes, Executive Orders, and case studies,we highlight the rapid development of a new body of lawand its consequences for the government, the privatesector, and the public at-large.
Various robust search methods in a Hungarian speech recognition system
Authors: Gábor Gosztolya, András Kocsor, László Tóth, László Felföldi
Venue: Acta Cybernetica (2003)

This work focuses on the search aspect of speech recognition. We describe some standard algorithms such as stack decoding, multi-stack decoding, the Viterbi beam search and an A* heuristic, then present improvements on these search methods. Finally we compare the performance of each algorithm, grading them according to their performance. We will show that our improvements can outperform the standard methods.
Tool Support for Generating Passive C++ Test Oracles from Object-Z Specifications
Authors: Jason McDonald, Paul Strooper, Dan Hoffman
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

A test oracel provides a means for determiningwhether an implementation behaves according to itsspecification.A passive test oracle checks that the correctbehaviour has been implemented, but does not implementthe behaviour itself.In previous work, we havepresented a method that allows us to derive passiveC++ test oracles from formal specifications written inObject-Z.In this paper, we describe the "Warlock" prototypetool that supports the method.Warlock is builton top on an existing Object-Z type checker and generatesoracle code for a substantial subset of the Object-Zlanguage.We describe the architecture of Warlock andits application to a number of Object-Z specifications.We also discuss its current limitations.
Comment on "Generating Scenario Trees for Multistage Decision Problems"
Authors: Pieter Klaassen
Venue: Management Science (2002)

In models of decision making under uncertainty, one typically has to approximate the uncertainties by a limited number of discrete outcomes. HÃ¸yland and Wallace (2001) formulate a nonlinear programming problem to generate sucha limited number of discrete outcomes while satisfying specified statistical properties. They have developed and employed this method for a stochastic multistage asset-allocation problem. When the method is applied to such financial optimization problems under uncertainty, we argue here that it does not suffice to match statistical properties. To obtain realistic outcomes, the (limited) description of the uncertainty in such models should also exclude arbitrage opportunities, and thereby be consistent with financial asset pricing theory. We illustrate that the method proposed by HÃ¸yland and Wallace can result in arbitrage opportunities in the scenario tree if only statistical properties are imposed. We show how one can check ex post for the presence of arbitrage opportunities in a scenario tree by checking for the existence of solutions to sets of linear equations. Arbitrage opportunities can also be precluded ex ante in the scenario tree by adding constraints to the nonlinear programming problem of HÃ¸yland and Wallace.