ppxscal/embedding_network huggingface dataset:
DeEPs: A New Instance-Based Lazy Discovery and Classification System
Authors: Jinyan Li, Guozhu Dong, Kotagiri Ramamohanarao, Limsoon Wong
Venue: Machine Learning (2004)

Distance is widely used in most lazy classification systems. Rather than using distance, we make use of the frequency of an instance's subsets of features and the frequency-change rate of the subsets among training classes to perform both knowledge discovery and classification. We name the system DeEPs. Whenever an instance is considered, DeEPs can efficiently discover those patterns contained in the instance which sharply differentiate the training classes from one to another. DeEPs can also predict a class label for the instance by compactly summarizing the frequencies of the discovered patterns based on a view to collectively maximize the discriminating power of the patterns. Many experimental results are used to evaluate the system, showing that the patterns are comprehensible and that DeEPs is accurate and scalable.
Investigating Java Type Analyses for the Receiver-Classes Testing Criterion
Authors: Pierre-Luc Brunelle, Ettore Merlo, Giuliano Antoniol
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

This paper investigates the precision of three linear-complexitytype analyses for Java software: Class HierarchyAnalysis (CHA), Rapid Type Analysis (RTA) and VariableType Analysis (VTA). Precision is measured relative toclass targets. Class targets results are useful in the contextof the receiver-classes criterion, which is an object-orientedtesting strategy that aims to exercise every possible classbinding of the receiver object reference at each dynamiccall site. In this context, using a more precise analysis decreasesthe number of infeasible bindings to cover, thus itreduces the time spent on conceiving test data sets. Thispaper also introduces two novel variations to VTA, calledthe iteration and intersection variants. We present experimentalresults about the precision of CHA, RTA and VTA ona set of 17 Java programs, corresponding to a total of 600kLOC of source code. Results show that, on average, RTAsuggests 13% less bindings than CHA, standard VTA suggests23% less bindings than CHA, and VTA with the twovariations together suggests 32% less bindings than CHA.
Lipschitz Continuity of Optimal Controls for State Constrained Problems
Authors: Grant N. Galbraith, Richard B. Vinter
Venue: SIAM Journal on Control and Optimization (2003)

This paper provides new conditions under which optimal controls are Lipschitz continuous for dynamic optimization problems with functional inequality constraints, a control constraint expressed in terms of a general closed convex set and a coercive cost function. It is shown that the linear independence condition on active state constraints, present in the earlier literature, can be replaced by a less restrictive, positive linear independence condition that requires linear independence merely with respect to nonnegative weighting parameters. Smoothness conditions on the data, imposed in earlier work, are also relaxed. The new conditions for Lipschitz continuity of optimal controls are obtained by a detailed analysis of the implications of first order optimality conditions in the form of a nonsmooth maximum principle.
Prediction of interconnect net-degree distribution based on Rent's rule
Authors: Tao Wan, Malgorzata Chrzanowska-Jeske
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

In this paper, we derived two new net-degree distribution models: exponential model and weighted exponential model based on the Rent's rule. Numerical evaluations showed that the weighted exponential model is more accurate than any other currently available net-degree distribution model. Moreover, for the first time, it was observed that the internal fraction factor f, similarly to the Rent's rule, also exhibits Region II and Region III. With a refined value of f, our models and Stroobandt's model can provide even more accurate estimation on the net-degree distribution.
Retrieving collocations from text: Xtract
Authors: Frank Smadja
Venue: Computational Linguistics (1993)

Natural languages are full of collocations, recurrent combinations of words that co-occur more often than expected by chance and that correspond to arbitrary word usages. Recent work in lexicography indicates that collocations are pervasive in English; apparently, they are common in all types of writing, including both technical and nontechnical genres. Several approaches have been proposed to retrieve various types of collocations from the analysis of large samples of textual data. These techniques automatically produce large numbers of collocations along with statistical figures intended to reflect the relevance of the associations. However, none of these techniques provides functional information along with the collocation. Also, the results produced often contained improper word associations reflecting some spurious aspect of the training corpus that did not stand for true collocations.In this paper, we describe a set of techniques based on statistical methods for retrieving and identifying collocations from large textual corpora. These techniques produce a wide range of collocations and are based on some original filtering methods that allow the production of richer and higher-precision output. These techniques have been implemented and resulted in a lexicographic tool, Xtract. The techniques are described and some results are presented on a 10 million-word corpus of stock market news reports. A lexicographic evaluation of Xtract as a collocation retrieval tool has been made, and the estimated precision of Xtract is 80%.
A characterization of Thompson digraphs
Authors: Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi
Venue: Discrete Applied Mathematics (2004)

A finite-state machine is called a Thompson machine if it can be constructed from an empty-free regular expression using the construction of Thompson as modified by Hopcroft and Ullman. We call the underlying digraph of a Thompson machine a Thompson digraph. We characterize Thompson digraphs and we give an algorithm that generates an equivalent regular expression from a Thompson machine that has size linear in the total number of states and transitions. Although the algorithm is simple, it is novel in that the usual constructions of equivalent regular expressions from finite-state machines produce regular expressions that have size exponential in the size of the given machine, in the worst case. The algorithm provides a tentative first step in the construction of small expressions from finite-state machines.
Improved speed and accuracy for archaeological site scanning
Authors: Kevin Cain, Min Yu, Youda He
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

During viewpoint framing for long-range laser scanning, nearly all current scan control software assumes a uniform bounding box selection (parametric UxV) within an XYZ world. Here we suggest a new system of scanner control that does not make this assumption, but instead uses active parsing of incoming points to enable automated, "subdivided" scan viewpoint framing.
The frequency spectrum of pulse width modulated signals
Authors: Zukui Song, Dilip V. Sarwate
Venue: Signal Processing (2003)

The determination of the frequency spectrum of a pulse width modulated (PWM) signal with general band-limited input x(t) has been an open problem for many years. We describe a new approach that gives exact analytical expressions for the spectra of uniform-sampling PWM signals and natural-sampling PWM signals with single-edge as well as with double-edge modulation. For the special case of single tone modulating signals, our results reduce to those obtained previously using a double Fourier series method. We also show that if the maximum magnitude of the derivative of x(t) is smaller than twice the carrier frequency, then a PWM signal consists of a baseband signal y(t) together with y(t) phase-modulated onto each carrier harmonic, where, for uniform-sampling PWM, y(t) is a nonlinear function of the modulating signal x(t), while for natural-sampling PWM, y(t) is just x(t) itself, that is, there is no distortion in the baseband when natural sampling is used.
PreSense: interaction techniques for finger sensing input devices
Authors: Jun Rekimoto, Takaaki Ishizawa, Carsten Schwesig, Haruo Oba
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

Although graphical user interfaces started as imitations of the physical world, many interaction techniques have since been invented that are not available in the real world. This paper focuses on one of these "previewing", and how a sensory enhanced input device called "PreSense Keypad" can provide a preview for users before they actually execute the commands. Preview important in the real world because it is often not possible to undo an action. This previewable feature helps users to see what will occur next. It is also helpful when the command assignment of the keypad dynamically changes, such as for universal commanders. We present several interaction techniques based on this input device, including menu and map browsing systems and a text input system. We also discuss finger gesture recognition for the PreSense Keypad.
WebSOGO: a global ontology for describing Web sources
Authors: Edna Ruckhaus, María-Esther Vidal
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Based on the limitations raised by existing approaches in the context of the Semantic Web, we propose a formalism, Web Sources Global Ontology (WebSOGO), a data meta-model for the description of Web sources in terms of content, query-processing capabilities, service and navigation information. WebSOGO is formalized in the Object-Oriented paradigm using the Unified Modeling Language (UML). We also describe WebSOGO-S, a multi-layered system that will allow agents to discover, execute and compose Web sources through queries against a WebSOGO catalog of source ontologies. The UML specification of WebSOGO has been mapped to the Object-Relational (OR) model in Oracle; we define an Oracle cartridge with a list of types and methods that allow the specification of SQL queries against the WebSOGO catalog. By using the JDBC and ODBC drivers provided by Oracle, any agent or application will be able to contact WebSOGO-S.
A Computational Model for Periodic Pattern Perception Based on Frieze and Wallpaper Groups
Authors: Yanxi Liu, Robert T. Collins, Yanghai Tsin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--We present a computational model for periodic pattern perception based on the mathematical theory of crystallographic groups. In each N-dimensional Euclidean space, a finite number of symmetry groups can characterize the structures of an infinite variety of periodic patterns. In 2D space, there are seven frieze groups describing monochrome patterns that repeat along one direction and 17 wallpaper groups for patterns that repeat along two linearly independent directions to tile the plane. We develop a set of computer algorithms that "understand¿ a given periodic pattern by automatically finding its underlying lattice, identifying its symmetry group, and extracting its representative motifs. We also extend this computational model for near-periodic patterns using geometric AIC. Applications of such a computational model include pattern indexing, texture synthesis, image compression, and gait analysis.
Power Minimization in a Backlit TFT-LCD Display by Concurrent Brightness and Contrast Scaling
Authors: Wei-Chung Cheng, Yu Hou, Massoud Pedram
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a Concurrent Brightness and Contrast Scaling (CBCS) technique for a cold cathode fluorescent lamp (CCFL) backlit TFT-LCD display. The proposed technique aimsat conserving power by reducing the backlight illumination while retaining the image fidelity through preservation of the image contrast. First, we explain how CCFL works and show how to model the non-linearity between its backlight illumination and power consumption. Next, we propose the contrast distortion metric to quantify the image quality loss after backlight scaling.Finally, we formulate and optimally solve the CBCS optimization problem with the objective of minimizing the fidelity and power metrics. Experimental results show that an average of 3.7Xpower saving can be achieved with only 10% of contrast distortion.
Value at your fingertips: converting a decision support system's knowledge into business value
Authors: Lorne Olfman
Venue:  (2003)

The productivity paradox of investments in information technology has been the subject of debate for some time. The discussions surrounding the outcomes of technology investments do not provide a clear answer to the potential paradox, but they do demonstrate the difficulties of evaluating the returns on information technology investments. Even though the literature provides some high level assessments of potential causes of investment failures there is little guidance on how to ensure the achievement of the benefits of a new system. This is especially true for decision support systems. This dissertation explores the process of converting information technology investments into business value in the context of the design, development, implementation, installation and use of a forecasting system to support stock reorders in a medium-size retail business. It describes the value conversion process and contribution and examines the potential causal explanations of the results obtained. The theoretical explanations are taken from an array of literatures including decision support systems, individual learning, organizational learning, incentive systems, and value accrual economics. They formed the basis for a theoretical framework used to collect data for analysis.The project followed a longitudinal and embedded multiple-case design with each subject (wholesale buyers) constituting one case. The units of analysis involved were the factors that influence the individuals' perceptions of value and the relative importance of these factors; the buyers' decision-making processes and use of the system; the productivity gains generated; the buyers' learning processes; and the related incentive systems. The subjects comprised the company's wholesale buyers and their managers. Data collection relied on multiple sources including interviews, archival records and databases, direct-observation, and participant-observation. Data analysis followed an explanation building approach, starting from a set of conceptual propositions and revising them in lieu of the research findings and cross-case analysis. The findings suggest that when individuals work under time constraints, the lack of objective (organizational) incentives to promote the changes required for improving process effectiveness is the most relevant factor in limiting the potential contributions; but not in improving process efficiency. This implies a possible trend of diminishing returns for investments in decision support systems.
A widget framework for augmented interaction in SCAPE
Authors: Leonard D. Brown, Hong Hua, Chunyu Gao
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

We have previously developed a collaborative infrastructure called SCAPE - an acronym for Stereoscopic Collaboration in Augmented and Projective Environments - that integrates the traditionally separate paradigms of virtual and augmented reality. In this paper, we extend SCAPE by formalizing its underlying mathematical framework and detailing three augmented Widgets constructed via this framework: CoCylinder, Magnifier, and CoCube. These devices promote intuitive ways of selecting, examining, and sharing synthetic objects, and retrieving associated documentary text. Finally we present a testbed application to showcase SCAPE's capabilities for interaction in large, augmented virtual environments.
Design of reconfigurable access wrappers for embedded core based SoC test
Authors: Sandeep Koranne
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Testing of embedded core based system-on-chip (SoC) ICs is a well known problem, and the upcoming IEEE P1500 Standard on Embedded Core Test (SECT) standard proposes DfT solutions to alleviate it. One of the proposals is to provide every core in the SoC with test access wrappers. Previous approaches to the problem of wrapper design have proposed static core wrappers, which are designed for a fixed test access mechanism (TAM) width. We present the first report of a design of reconfigurable core wrappers which allow for a dynamic change in the width of the TAM executing the core test. Analysis of the corresponding scheduling problem indicates that good approximate schedules can be achieved without significant computational effort. Specifically, we derive a O(Nc2B) time algorithm which can compute near optimal SoC test schedules, where Nc is the number of cores and B is the number of top level TAMs. Experimental results on benchmark SoCs are presented which improve upon integer programming based methods, not only in the quality of the schedule, but also significantly reduce the computation time.
How universal is good design for older users?
Authors: Dan Hawthorn
Venue: Proceedings of the 2003 conference on Universal usability (2003)

This paper attempts to illustrate the way in which multiple considerations influence interface design decisions when designing for older users. The arguments are supported by examination of issues that arose during the design of a successful email system for older users. The point is also made that while the interface design decisions made in the example do assist older users, they limit the power of an application to serve younger, more able and more demanding users. The argument is made that while it is possible to increase accessibility, the most obvious ways of doing this limit the universality of the resulting application.
Type-checking injective pure type systems
Authors: Gilles Barthe
Venue: Journal of Functional Programming (1999)

Injective pure type systems form a large class of pure type systems for which one can compute by purely syntactic means two sorts elmt(&Gamma;&mid;M) and sort(&Gamma;&mid;M), where &Gamma; is a pseudo-context and M is a pseudo-term, and such that for every sort s,formula to be displayed hereBy eliminating the problematic clause in the (abstraction) rule in favor of constraints over elmt(.&mid;.) and sort(.&mid;.), we provide a sound and complete type-checking algorithm for injective pure type systems. In addition, we prove expansion postponement for a variant of injective pure type systems where the problematic clause in the (abstraction) rule is replaced in favor of constraints over elmt(.&mid;.) and sort(.&mid;.).
Split-Perfect Graphs: Characterizations and Algorithmic Use
Authors: Andreas Brandstädt, Van Bang Le
Venue: SIAM Journal on Discrete Mathematics (2004)

Two graphs G and H with the same vertex set V are P4-isomorphic if every four vertices {a,b,c,d} \subseteq V$ induce a chordless path (denoted by P4) in G if and only if they induce a P4 in H. We call a graph split-perfect if it is P4-isomorphic to a split graph (i.e., a graph being partitionable into a clique and a stable set). This paper characterizes the new class of split-perfect graphs using the concepts of homogeneous sets and p-connected graphs and leads to a linear time recognition algorithm for split-perfect graphs, as well as efficient algorithms for classical optimization problems on split-perfect graphs based on the primeval decomposition of graphs. The optimization results considerably extend previous ones on smaller classes such as P4--sparse graphs, P4-lite graphs, P4--laden graphs, and (7,3)-graphs. Moreover, split-perfect graphs form a new subclass of brittle graphs containing the superbrittle graphs for which a new characterization is obtained leading to linear time recognition.
Diameter vulnerability of GC graphs
Authors: J. Gómez, I. Pelayo, C. Balbuena
Venue: Discrete Applied Mathematics (2003)

Concern over fault tolerance in the design of interconnection networks has stimulated interest in finding large graphs with maximum degree Δ and diameter D such that the subgraphs obtained by deleting any set of s vertices have diameter at most D', this value being close to D or even equal to it. This is the so-called (Δ,D,D',s)-problem. The purpose of this work has been to study this problem for s = 1 on some families of generalized compound graphs. These graphs were designed by Gómez (Ars Combin. 29-B (1990) 33) as a contribution to the (Δ,D)-problem, that is, to the construction of graphs having maximum degree Δ, diameter D and an order large enough. When approaching the mentioned problem in these graphs, we realized that each of them could be redefined as a compound graph, the main graph being the underlying graph of a certain iterated line digraph. In fact, this new characterization has been the key point to prove in a suitable way that the graphs belonging to these families are solutions to the (Δ,D,D + 1, 1)-problem.
Transmission gate delay models for circuit optimization
Authors: Veronika Eisele, Bernhard Hoppe, Oliver Kiehl
Venue: Proceedings of the conference on European design automation (1990)

Accurate macromodels for CMOS transmission gates are presented. Signal delay, area consumption and power dissipation are determined by a few technology dependent parameters. Different transistor widths, input waveforms and varying loading conditions are considered. The calculated delay times of CMOS circuits including transmission gates differ only 10 percent when compared with SPICE results. The presented macromodels can be incorporated into the CAD tool MOGLO for automatic transistor sizing in CMOS logic circuits. MOGLO determines optimal tradeoff solutions for CMOS circuitry at low computational cost taking into account conflicting criteria such as delay, area and power.
Identification of Software Instabilities
Authors: Jennifer Bevan, E. James Whitehead,  Jr.
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

As software evolves, maintenance practices require aprocess of accommodating changing requirements whileminimizing the cost of implementing those changes. Overtime, incompatibilities between design assumptions andthe operational environment become more pronounced,requiring some regions of the implementation to requirerepeated modification. These regions are considered tobe "unstable", and may benefit from targetedrestructuring efforts as a means of realigning theseassumptions and the environment.An analysis of these regions that identifies andclassifies these instabilities can be used to prioritize anddirect structural maintenance efforts. To this end, wepresent an identification approach that augments staticdependence graphs with data retrieved fromconfiguration management (CM) systems. This approachavoids the assumption that artifacts changing within thesame CM transaction are related, without requiringsophisticated change management data. We alsodescribe our work-to-date in validating the underlyingassumptions and identifying instabilities.
An Interview with Benjamin Kuipers: Making sense of common sense knowledge
Authors: Ubiquity staff
Venue: Ubiquity (2004)

Benjamin Kuipers on using commonsense reasoning to make useful conclusions, or, finding gold nuggets in a pan of sand.