ppxscal/embedding_network huggingface dataset:
Modeling Adaptive and Evolvable Software Product Lines Using the Variation Point Model
Authors: Hassan Gomaa, Diana L. Webber
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The product line approach provides a systematic approach for software reuse. A challenge with modeling adaptive and evolvable software product lines is how to model variability. This paper describes four different approaches to modeling variability, modeling variability using parameterization, modeling variability using information hiding, modeling variability using inheritance, and modeling variability using variation points. The Variation Point Model (VPM) is used to demonstrate the fourth approach. VPM allows a reuser or application engineer to extend components at pre-specified variation points. For this to be possible, a variation point must be modeled such that the reuser has enough knowledge to build a variant.
Adaptive wavelet representation and differentiation on block-structured grids
Authors: M. O. Domingues, S. M. Gomes, L. M. A. Díaz
Venue: Applied Numerical Mathematics (2003)

This paper considers a new adaptive wavelet solver for two-dimensional systems based on an adaptive block refinement (ABR) method that takes advantage of the quadtree structure of dyadic blocks in rectangular regions of the plane. The computational domain is formed by non-overlapping blocks. Each block is a uniform grid, but the step size may change from one block to another. The blocks are not predetermined, but they are dynamically constructed according to the refinement needs of the numerical solution. The decision over whether a block should be refined or unrefined is taken by looking at the magnitude of wavelet coefficients of the numerical solution on such block. The wavelet coefficients are defined as differences between values interpolated from a coarser level and known function values at the finer level. The main objective of this paper is to establish a general framework for the construction and operation on such adaptive block-grids in 2D. The algorithms and data structure are formulated by using abstract concepts borrowed from quaternary trees. This procedure helps in the understanding of the method and simplifies its computational implementation. The ability of the method is demonstrated by solving some typical test problems.
Re-Configurable Bus Encoding Scheme for Reducing Power Consumption of the Cross Coupling Capacitance for Deep Sub-Micron Instruction Bus
Authors: Siu-Kei Wong, Chi-Ying Tsui
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In very deep sub-micron designs, cross coupling capacitances become the dominant factor of the total bus loading and have a significant impact on the power consumption. In this paper, we propose two reconfigurable bus encoding schemes, which are based on the correlation among the bit lines, to reduce the power consumption at the cross coupling capacitances of the instruction buses. The instruction is encoded by flipping and reordering the bit lines during compilation time to reduce the total switching capacitances. A crossbar is used to map back the data to the original instruction code before sending to the instruction decoder. The reordering can be re-configured during run-time by using different configurations in the crossbar. We propose two types of re-configuration, static and dynamic. Static coding uses afix flipping and re-configuring pattern after the corresponding program is compiled. Dynamic coding allows different re-configuring patterns during program execution. Experimental results show that by using the proposed schemes, significant energy reduction, 17-23%, can be achieved. Comparisons with existing bit lines reordering encoding scheme have also been made and on average more than 15% reduction can be obtained using our method.
Testing Criteria for Data Flow Software
Authors: Thanh Binh Nguyen, Michel Delaunay, Chantal Robach
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In this paper, we propose the use of accessibility measuresin some testing strategies to specify testing objectivesbased on a functional model. The functional model, whichis founded on the information transfer within software, wasused with success to analyze testability for data-flow software.The testing strategies based on this model allow specificationof testing objectives in relation to faults diagnostic,i.e. they allow not only faults to be detected but also to belocated in the software. The approach is applied on a data-flowdesign provided by THALES Avionics to specify testingobjectives.
PROOFS: a super fast fault simulator for sequential circuits
Authors: Wu-Tung Cheng, Janak H. Patel
Venue: Proceedings of the conference on European design automation (1990)

This paper describes PROOFS, a super fast fault simulator for synchronous sequential logic circuits. PROOFS achieves high performance by combining all the advantages in differential fault simulation, single fault propagation, and parallel fault simulation to minimize the memory requirements, to reduce events that need to be simulated, and to simplify the complexity of the software implementation. The experimental results of PROOFS and other available fault simulators on 20 benchmark circuits showed that PROOFS is the best.
Distributed knowledge worker (DKW): a personal conferencing system
Authors: Rich Helms
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

This paper describes Distributed Knowledge Worker (DKW): a prototype multi-point desktop conferencing system that enables users to initiate and conduct business meetings using an ordinary computer and standard communications hardware. We present a statement of the problem that led to the development of DKW; the research strategy undertaken; a brief review of the literature; a description of the selected market segment; and a discussion of how the project was designed and implemented.
Rescue robotics for homeland security
Authors: Robin R. Murphy
Venue: Communications of the ACM (2004)

Applying hard-earned lessons to improve human-robot interaction and information gathering.
Action research as a tool for promoting teacher awareness of students' conceptual understanding
Authors: Bruria Haberman, Ela Lev, Dorothy Langley
Venue: ACM SIGCSE Bulletin (2003)

Assimilating a new CS curriculum requires appropriate inservice training. The emphasis in the new CS curriculum upon conceptual understanding requires teachers to become aware of characteristic ways in which students construct their knowledge and of common student difficulties. In this paper we describe a regional CS teacher workshop in which action research was used to trigger changes in teachers' knowledge and approach and especially to promote awareness of students' conceptual understanding. The favorable teacher evaluation of the workshop, and the action research products indicate that the workshop design promoted the beginning of a teacher change necessary for assimilating the new CS curriculum and establishing a collaborative community of teachers.
Representation & modelling of electronic patient records
Authors: Kami Sivagurunathan, Panagiotis Chountas, Elia El-Darzi
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This paper is an attempt to provide an XML based framework for modelling and representing multi-source electronic patient records (EPR) as part of an integrated single source environment. The main focus of this framework is to capture the dynamic features of EPR data sources for further analysis and knowledge discovery with the aid of OLAP and data mining.
A multigranular spatiotemporal data model
Authors: Elena Camossi, Michela Bertolotto, Elisa Bertino, Giovanna Guerrini
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

A large percentage of data managed by a variety of different application domains has spatiotemporal characteristics. Unfortunately, traditional geographical information systems do not allow for an easy representation of temporal aspects of spatial data. Moreover, they do not usually support the representation of data at multiple levels of granularity. In this paper we present a multigranular spatiotemporal data model. Our model extends the ODMG model with multiple spatial and temporal granularities. In particular, the model allows for an uniform management of two kinds of spatiotemporal objects: moving entities (e.g. cars, planes, etc.) and temporal maps (i.e., maps representing the change over time of a given geographic area). It also provides a framework for mapping the movement of an entity such as a car onto an underlying geographic area. The model we propose relies on a standard definition of temporal granularity. On the other hand, the representation of spatial entities at multiple granularities is obtained by applying model oriented map generalization principles. In particular, we consider a set of generalization operators that guarantee topological consistency.
Resilient Peer-to-Peer Streaming
Authors: Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

We consider the problem of distributing "live" streaming media content to a potentially large and highly dynamic population of hosts. Peer-to-peer content distribution is attractive in this setting because the bandwidth available to serve content scales with demand. A key challenge, however, is making content distribution robust to peer transience. Our approach to providing robustness is to introduce redundancy, both in network paths and in data. We use multiple, diverse distribution trees to provide redundancy in network paths and multiple description coding (MDC) to provide redundancy in data.We present a simple tree management algorithm that provides the necessary path diversity and describe an adaptation framework for MDC based on scalable receiver feedback. We evaluate these using MDC applied to real video data coupled with real usage traces from a major news site that experienced a large flash crowd for live streaming content. Our results show very significant benefits in using multiple distribution trees and MDC, with a 22 dB improvement in PSNR in some cases.
Mining spatio-temporal patterns and knowledge structures in multimedia collection
Authors: Shih-Fu Chang
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

Detection and recognition of semantic events has been a major research challenge for multimedia indexing. An emerging direction in this field has been <u>unsupervised discovery (mining) of patterns</u> in spatial-temporal multimedia data. Patterns are recurrent, predictable occurrences of one or more entities that satisfy associative, statistical, or relational conditions. Patterns at the feature level may signify the occurrence of events (e.g., passing pedestrians). At the event level, patterns may represent multi-event transitions, e.g., play-break alternations in sports. Patterns in an annotated image collection may indicate collocations of related semantic concepts and perceptual clusters.Mining of patterns of different types at different levels offers rich benefits, including automatic discovery of salient events in a new domain, automatic alert generation from massive real-time data (such as surveillance data in a new environment), and discovery of novel event relationships.Many challenging issues emerge. What are the adequate representations and statistical models for patterns that may exist at different levels and different time scales? How to handle patterns that may have relatively sparse occurring frequencies? How do we evaluate the accuracy and quality of mining results given its unsupervised nature?In this talk, we will present results of our preliminary attempts in mining patterns in structured video sequences (such as sports and surveillance video) and large annotated image collections. Specifically, we will discuss the potential of statistical models like Hierarchical HMM for video mining, and the integrative exploration of electronic knowledge (such as WordNet) and statistical clustering for image knowledge mining.
The role of localized states in the degradation of thin gate oxides
Authors: Gennadi Bersuker, Anatoli Korkin, Leonardo Fonseca, Andrey Safonov, Alexander Bagatur'yants, Howard R. Huff
Venue: Microelectronic Engineering (2003)

A model is proposed to address the effects of oxide electric field and anode bias, as well as the role of hydrogen, in the trap generation process. The oxide wear-out phenomenon is considered as a multi-step process initiated by the capture of injected electrons by localized states in SiO2. The captured electrons significantly weaken the corresponding Si-O bond, which becomes unstable with respect to the applied electric field and temperature. The hydrogen present in the oxide (due to the anode hydrogen release process) prevents restoration of the broken bonds and leads to the generation of neutral E' centers. The model describes the charge-to-breakdown dependence on the electron energy, electric field, temperature, and oxide thickness.
A lattice model for data display
Authors: William L. Hibbard, Charles R. Dyer, Brian E. Paul
Venue: Proceedings of the conference on Visualization '94 (1994)

In order to develop a foundation for visualization, we develop lattice models for data objects and displays that focus on the fact that data objects are approximations to mathematical objects and real displays are approximations to ideal displays. These lattice models give us a way to quantize the information content of data and displays and to define conditions on the visualization mappings from data to displays. Mappings satisfy these conditions if and only if they are lattice isomorphisms. We show how to apply this result to scientific data and display models, and discuss how it might be applied to recursively defined data types appropriate for complex information processing.
Teaching graphical interface programming in Java with the game of wari
Authors: Kirk Scott
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This poster gives an overview of a programming project that can be used in a course on object-orientation and graphical interface programming in Java.
Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces
Authors: Eric Klassen, Anuj Srivastava, Washington Mio, Shantanu H. Joshi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--For analyzing shapes of planar, closed curves, we propose differential geometric representations of curves using their direction functions and curvature functions. Shapes are represented as elements of infinite-dimensional spaces and their pairwise differences are quantified using the lengths of geodesics connecting them on these spaces. We use a Fourier basis to represent tangents to the shape spaces and then use a gradient-based shooting method to solve for the tangent that connects any two shapes via a geodesic. Using the Surrey fish database, we demonstrate some applications of this approach: 1) interpolation and extrapolations of shape changes, 2) clustering of objects according to their shapes, 3) statistics on shape spaces, and 4) Bayesian extraction of shapes in low-quality images.
Information analysis in UML and ORM: a comparison
Authors: Terry Halpin
Venue: Advanced topics in database research vol. 1 (2003)

Since its adoption by the Object Management Group as a language for object-oriented analysis and design, the Unified Modeling Language (UML) has become widely used for designing object-oriented code. However, UML has had only minimal adoption among practitioners for the purposes of information analysis and database design. One main reason for this is that the class diagrams used in UML for data modeling provide only weak, and awkward, support for the kinds of business rules found in data-intensive applications. Moreover, UML's graphical language does not lend itself readily to verbalization and multiple instantiation for validating data models with domain experts. These defects can be remedied by using a fact-oriented approach for information analysis, from which UML class diagrams may be derived. Object-Role Modeling (ORM) is currently the most popular fact-oriented modeling approach. This chapter examines the relative strengths and weaknesses of UML and ORM for conceptual data modeling, and indicates how models in one notation can be translated into the other.
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
Authors: Masahiro Fujita, Yusuke Matsunaga, Taeko Kakuda
Venue: Proceedings of the conference on European design automation (1991)

We have developed multi-level logic minimization programs using Binary Decision Diagram (BDD). Here we present variable ordering methods of BDD. The variable ordering algorithm for two-level circuits is based on cover patterns and selects most binate variables first, and the one for multi-level circutis is based on depth first traverse of circuits. In both cases, the acquired variable orderings are optimized by exchanging a variable with its neighbor in the ordering.
Exceptional syntax
Authors: Nick Benton, Andrew Kennedy
Venue: Journal of Functional Programming (2001)

From the points of view of programming pragmatics, rewriting and operational semantics, the syntactic construct used for exception handling in ML-like programming languages, and in much theoretical work on exceptions, has subtly undesirable features. We propose and discuss a more well-behaved construct.
An Efficient Functional Test for the Massively-Parallel C 'RAM Logic-Enhanced Memory Architecture
Authors: X. Sun, B. F. Cockburn, D. G. Elliott
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Computational RAM (C ¿RAM) is a logic-enhanced memory architecture that has already shown promise in several demanding applications. A C ¿RAM chip integrates a conventional memory array along with a linear array of bit-serial processing elements (PEs). The narrow PEs are pitch-matched to the columns of the memory array to access the high internal memory bandwidth and to produce an efficient layout. After a memory row has been accessed, the PEs can perform many thousands of bit-serial operations in parallel on the fetched bits as well as values stored locally in PE registers. We consider the problem of efficiently testing C ¿RAMs for functional faults in the PEs and the memory array. It is shown that the linear array of PEs is a powerful resource that can be used to generate standard memory test patterns. The test time for the PEs plus their local memories is much less than the test time of the memories alone.
Integer partitions and the Sperner property
Authors: E. Rodney Canfield
Venue: Theoretical Computer Science (2003)

The objectives of this paper are three-fold. First, we would like to call attention to a very attractive problem, the question of whether or not the poset of integer partitions ordered by refinement has the Sperner property. We provide all necessary definitions, and enough bibliography to interest a newcomer in the problem. Second, we prove four new theorems, two by exhaustive computation and two in the more traditional manner. Finally, we highlight the central role played by Larry Harper in the literature of this subject.
Data visualization using kernel density estimation to examine patterns of physician practice
Authors: Patricia B. Cerrito
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Studies have shown that examinations of physician practices and variation can improve patient care while reducing costs. However, most of the studies rely more on physician consensus than on data analysis. The existence of large hospital databases allows for the examination of the relationship between practice and outcome. Because it is generally not known beforehand which practice optimizes outcome, particularly given the variability in patient risk, data mining techniques are ideal to examine the relationship. In particular, this paper uses the data visualization technique of kernel density estimation to explore and define physician practices. Three physician practices were examined at a hospital during 2001--2002. The first physician practice identified was the administering of heparin to 100 patients as an anti-coagulant during angioplasty to open blocked coronary arteries. The second practice examined was two different open-heart procedures: one done on a cardiopulmonary bypass pump, the other done off bypass pump. The third physician practice examined the prescribing of antibiotics for patients undergoing open-heart surgery.
Some comments on ADA as a real-time programming language
Authors: Ahmed Mahjoub
Venue: ACM SIGPLAN Notices (1981)

This note contains comments on some of the aspects of the High Order Language ADA which are relevant to real-time programming. Design as well as implementation issues related to the construction of distributed real-time systems are addressed. The comments contained in this note are based on the ADA report printed in the June 1979 issue of the SIGPLAN Notices.
Classification of Features and Images using Gauss Mixtures with VQ Clustering
Authors: Ying-zong Huang, Deirdre B. O'Brien, Robert M. Gray
Venue: Proceedings of the Conference on Data Compression (2004)

Gauss mixtur (GM) models are frequently used for their ability to wellapproximate many densities and for their tractability to analysis. We proposenew classification methods built on GM clustering algorithms more often studied and used for vector quantization (VQ). One of our methods is an extensionof the 'codebook matching' idea to the specific case of classifying whole images. We apply these methods to a realistic supervised classification problemand empirically evaluate their performances compared with other classificationmethods.
Asymptotically Exact A Posteriori Error Estimators, Part II: General Unstructured Grids
Authors: Randolph E. Bank, Jinchao Xu
Venue: SIAM Journal on Numerical Analysis (2003)

In Part I of this work [SIAM J. Numer. Anal., 41 (2003), pp. 2294--2312], we analyzed superconvergence for piecewise linear finite element approximations on triangular meshes where most pairs of triangles sharing a common edge form approximate parallelograms. In this work, we consider superconvergence for general unstructured but shape regular meshes. We develop a postprocessing gradient recovery scheme for the finite element solution uh, inspired in part by the smoothing iteration of the multigrid method. This recovered gradient superconverges to the gradient of the true solution and becomes the basis of a global a posteriori error estimate that is often asymptotically exact. Next, we use the superconvergent gradient to approximate the Hessian matrix of the true solution and form local error indicators for adaptive meshing algorithms. We provide several numerical examples illustrating the effectiveness of our procedures.