ppxscal/embedding_network huggingface dataset:
A Configurable Logic Architecture for Dynamic Hardware/Software Partitioning
Authors: Roman Lysecky, Frank Vahid
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In previous work, we showed the benefits and feasibility of having a processor dynamically partition its executing software such that critical software kernels are transparently partitioned to execute as a hardware coprocessor on configurable logic -- an approach we call warp processing. The configurable logic place and route step is the most computationally intensive part of such hardware/software partitioning, normally running for many minutes or hours on powerful desktop processors. In contrast, dynamic partitioning requires place and route to execute in just seconds and on a lean embedded processor. We have thereforedesigned a configurable logic architecture specifically for dynamic hardware/software partitioning. Through experiments with popular benchmarks, we show that by specifically focusing on the goal of software kernel speedup when designing the FPGA architecture, rather than on the more general goal of ASIC prototyping, we can perform place and route for our architecture 50 times faster, using 10,000 times less data memory, and 1,000 times less code memory, than popular commercial tools mapping to commercial configurable logic. Yet, we show that we obtain speedups (2x on average, and as much as 4x) and energy savings(33% on average, and up to 74%) when partitioning even just one loop, which are comparable to commercial tools and fabrics. Thus, our configurable logic architecture represents a goodcandidate for platforms that will support dynamic hardware/software partitioning, and enables ultra-fast desktop tools for hardware/software partitioning, and even for fast configurable logic design in general.
On the fault coverage of delay fault detecting tests
Authors: Ankan K. Pramanick, Sudhakar M. Reddy
Venue: Proceedings of the conference on European design automation (1990)

Existing methodologies for determining gate delay fault coverages are shown to have certain deficiencies. A new and more realistic delay model is presented with the ultimate goal of ensuring error-free circuit operation through obtaining true fault coverages that extend upto the actual slacks. Methods are given that achieve such coverages when possible. Results of experiments performed to evaluate the practical benefits of the proposed methods over previous approaches are given. The proposed method over previous approaches are given. The proposed method based on varying the sampling time of the circuit outputs during testing is seen to produce very high delay fault coverages upto the actual circuit slacks, as opposed to methods based on fixed output sampling times.
A clock-tuning circuit for system-on-chip
Authors: Yaron Elboim, Avinoam Kolodny, Ran Ginosar
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

System-on-chip (SoC) design depends heavily on effective reuse of semiconductor intellectual property (IP). Clock distribution has become a problem for integrating IP cores into a single synchronous SoC, because of different clock delays in the IP cores. We propose an onchip clock-tuning circuit, which enhances design flexibility. Programmable delays are inserted in the clock distribution network, such that clock alignment and synchronization are achieved. Design iterations are eliminated with the use of the tuning circuit, saving design effort, and cost. The method is also applicable to compensating for unbalanced clock trees. Hierarchical clock tuning can be implemented and can take advantage of the hierarchical structure of the SoC. Skew analysis has shown that the added programming unit outperforms other clock design options. The method was implemented in a commercial chip, and demonstrated good functionality with high productivity of the design flow.
Smart Debugging Software Architectural Design in SDL
Authors: W. Eric Wong, Tatiana Sugeta, Yu Qi, Jose C. Maldonado
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Statistical data show that it is much less expensive tocorrect software bugs at the early design stage rather thanthe late stage of the development process when the finalsystem has already been implemented and integratedtogether. The use of slicing and execution histories as anaid in software debugging is well established forprogramming languages like C and C++; however, it israrely applied in the field of software design specification.We propose a solution by applying the source code leveltechnologies to debugging software designs represented ina high-level specification and description language such asSDL. More specifically, we extend execution slice-basedheuristics from source code-based debugging to thesoftware design specification level. Suspicious locations inan SDL specification are prioritized by their likelihood ofcontaining faults. Locations with a higher priority shouldbe examined first rather than those with a lower priority asthe former are more likely to contain the faults. Adebugging tool, SmartDSDL, with user-friendly interfaceswas developed to support our method. An illustration isprovided to demonstrate the feasibility of using ourmethod to effectively debug an architectural design.
The distribution of symmetric matrix quotients
Authors: A. K. Gupta, D. G. Kabe
Venue: Journal of Multivariate Analysis (2003)

Phillips (J. Multivariate Anal. 16 (1985) 157) generalizes Cramer's (Mathematical Methods of Statistics, Princeton University Press, Princeton, NJ, 1946) inversion formula for the distribution of a quotient of two scalar random variables to the matrix quotient case. However, he gives the result for the asymmetric matrix quotient case. This note extends Phillips' (1985) result to the symmetric matrix quotient case.
Towards an Information Filtering System in the Web Integrating Collaborative and Content Based Techniques
Authors: José de J. Pérez-Alcázar, Maritza L. Calderón-Benavides, Cristina N. González-Caro
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

The amount of information currently available, the different media and presentation formats joined with the little time availability of the researchers and people in general, make necessary the implementation of automated tools selecting and evaluating information, aiming at not only optimizing resources but also obtaining useful and personalized results that optimize the dailywork of its users. A technique known as Information Filtering could be seen as a solution to this problem. Within an information filtering system, a user introduces a profile in the System which represents his/her information needs; then, the system works to display the relevantinformation. This article contains a sample of the research carried out by us in this important area, focusing the work towards two of its most representative techniques: "Content Based filtering" and "Collaborative filtering." These techniques have been studied from different points of view, allowing to create a solid framework which involves the necessary criteria for designing and creating a tool using the most outstanding characteristics of each technique. They provide a view to facilitate the work of people devoted to the search, depuration and distribution of information.
A short note on scanning signed integers
Authors: James R. Low
Venue: ACM SIGPLAN Notices (1979)

The "common sense" algorithm for translating from signed decimal representation to the two's complement binary representation doesn't always work. A correct algorithm (reinvented or discovered many times by various people) is presented. The presentation will hopefully encourage use of the correct algorithm and discourage use of the "common sense" algorithm.
A Note on Sequential Selection from Permutations
Authors: Alexander V. Gnedin
Venue: Combinatorics, Probability and Computing (2000)

The maximum expected length of an increasing subsequence which can be selected by a non-anticipating policy from a random permutation of 1, &hellip;, n is known to be asymptotic to &radic;2n. We give a new proof of this fact and demonstrate a policy which achieves this value.
The adoption of web-based services in organizations: a multilevel contextual analysis
Authors: Pamila Sunderdass Dembla
Venue:  (2003)

Few studies have attempted a holistic examination of the factors affecting an organization's decision to adopt such services for communication, information search, transaction processing, and information dissemination despite the increasing pervasiveness of web-based services. The purpose of this study was to determine how contextual factors such as Information System (IS) maturity of the organization, organizational factors, and environmental characteristics affect the adoption of web-based services by organizations. Four research models and 54 hypotheses were developed, based on a review of literature. Data were collected while using a questionnaire. The sample used for the main study was randomly selected from a federal government website called Pro- Net, http://pronet.sba.gov, an internet-based database containing information about more than 122,836 small, disadvantaged, 8(a), HUBZone, and women-owned businesses. Structural Equation Modeling was performed to test the goodness of fit of the data and the hypotheses. The four models suggested a moderate fit of the data. Of the 54 hypotheses, 21 were supported. Organizational innovation theory studies have not considered perceived usefulness of technologies as a factor in their adoption, but this study suggests that its perceived usefulness may be the most important reason why an organization adopts a specific technology. This study also shows other important factors to be the IS maturity of a company, the firm's performance, and the budget allocated for IS by leaders of the organization.
Rigorous EBNF-based Definition for a Graphic Modeling Language
Authors: Yong Xia, Martin Glinz
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Today, the syntax of visual specification languages suchas UML is typically defined using meta-modelling techniques.However, this kind of syntax definition has drawbacks.In particular, graphic meta-models are not powerfulenough, so they must be augmented by a textual constraintlanguage.As an alternative, we present in this paper, a text-basedtechnique for the syntax definition of a graphic specificationlanguage. We exploit the fact that in a graphic specificationlanguage, most syntactic features are independent ofthe layout of the graph. So we map the graphic elements totextual ones and define the context-free syntax of this textuallanguage in EBNF. Using our mapping, this grammar alsodefines the syntax of the graphic language. Simple spatialand context-sensitive constraints are then added by attributingthe context-free grammar. Finally, for handling complexstructural and dynamic information in the syntax, we give aset of operational rules that work on the attributed EBNF.We explain our syntax definition technique by applyingit to the modelling language ADORA which is being developedin our research group. We also briefly discuss the applicationof our technique to the syntax definition of UML.At last we mention the advantages of our method overthe metamodeling techniques.
Foreground object detection from videos containing complex background
Authors: Liyuan Li, Weimin Huang, Irene Y. H. Gu, Qi Tian
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes both gradual and sudden "once-off" changes. A Bayes decision rule for classification of background and foreground from selected feature vectors is formulated. Under this rule, different types of background objects will be classified from foreground objects by choosing a proper feature vector. The stationary background object is described by the color feature, and the moving background object is represented by the color co-occurrence feature. Foreground objects are extracted by fusing the classification results from both stationary and moving pixels. Learning strategies for the gradual and sudden "once-off" background changes are proposed to adapt to various changes in background through the video. The convergence of the learning process is proved and a formula to select a proper learning rate is also derived. Experiments have shown promising results in extracting foreground objects from many complex backgrounds including wavering tree branches, flickering screens and water surfaces, moving escalators, opening and closing doors, switching lights and shadows of moving objects.
Learning computer graphics by programming: linking theory and practice
Authors: Vladimir Nodelman
Venue: ACM SIGCSE Bulletin (2003)

One of the problems in teaching and studying Computer Graphics is actual linking between theory and practice: theoretical issues are complex and difficult to visualize while using programming techniques like OpenGL without a deep understanding of the theoretical basis prevents from exploiting the full potential of these powerful aids.Existing Computer Graphics courses are varying from pure theory, via using ready programs for demonstrations and illustrations up to systematic use of programming elements as the important component of a course.This presentation describes the implementation of two of these strategies, used by the author is his computer graphics courses, in order to enhance the links between theory and practice
Cadena: enabling CCM-based application development in Eclipse
Authors: Venkatesh Prasad Ranganath, Adam Childs, Jesse Greenwald, Matthew B. Dwyer, John Hatcliff, Gurdip Singh
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

To support the trend toward component-based systems, the Cadena project aims to provide an Eclipse-based development environment that includes support for design, behavior modeling, formal reasoning, and automated code synthesis for systems built using the CORBA Component Model. In this paper, we describe the basic functionality of the Cadena tool, and summarize how it is currently being evaluated by industrial partners for use in developing high-assurance avionics applications.
A Filter Flow Visual Querying Language and Interface for Spatial Databases
Authors: A. J. Morris, A. I. Abdelmoty, B. A. El-Geresy, C. B. Jones
Venue: Geoinformatica (2004)

In this paper a visual approach to querying in spatial databases is presented. A filter flow methodology is used to consistently express different types of queries in these systems. Filters are used to represent operations on the database and pictorial icons are used throughout the language for filters, operators and spatial relations. Different granularities of the relations are presented in a hierarchical fashion for spatial constraints. The language framework and functions are described and examples are used to demonstrate its capabilities in representing different levels of queries, including spatial joins and composite spatial joins. Here, the primary focus is on the query language itself but an overview of the implemented interface of the language is also provided.
Integrating product models with engineering analysis applications: Two case studies
Authors: J. Andrew Arnold, John C. Kunz
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Current methods to develop standard Architecture, Engineering, Construction (AEC) product models focus on the definition of product model semantics without concurrent and formal consideration of the engineering analyses that such models must support, or formal consideration of the requirements for sharing information between applications. We present two case studies that demonstrate a service to extract data from product models and provide inputs to component analysis applications. The service was validated in a proof-of-concept application called the Internet Broker for Engineering Services (IBES) that extracts information for component analysis from product models that are external to the application and accessed across the Internet. IBES was tested for two research cases. The product model for the first case, control valve selection is based on STEP Application Protocol 227. The product model for the second case, control valve diagnosis, specifies additional semantics that support the operations and maintenance (O&M) phase of the facility life cycle. The cases offer evidence that large standard data models can support routine analyses for control valves. However, the amount of shared information between the case applications is small and is largely dependent upon the concurrence of component behaviors that are necessary to model analysis. The IBES reference model and reasoning to support information extraction was consistent for both cases. This consistency suggests that it is possible to define a general set of computational methods that integrate project information models with external component analysis applications across the product life cycle. We argue that enabling a web-based link between product models and applications requires a set of capabilities, including bi-directional communication between separated data and analysis nodes, query generation, data translation, and validation of data extracted from semistandard models. We discuss the tentative implication that minimal shared information calls into question the assumption that large core product models will work effectively in practice.
Electronic whiteboard in kindergarten: opportunities and requirements
Authors: Saila Ovaska, Pentti Hietala, Marjatta Kangassalo
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

Whiteboards have proven valuable for informal note-taking and sketching. Different electronic and also interactive whiteboards are becoming available for children and their teachers at all school levels. We describe the first experiences of children at a day care centre when using an electronic whiteboard for creative letter recognition in small groups. Though the usability of the tool used in this task was not optimal for smooth drawing together, the constraints the tool posed for the children's group work were also a motive for fruitful dialogue and new learning opportunities. Based on our observations of the groups, we outline opportunities as well as requirements for interactive whiteboards to empower children's collaborative learning at the kindergarten level.
Goal oriented slicing enumeration through shape function clipping
Authors: Georg Sigl, Ulf Schlichtmann
Venue: Proceedings of the conference on European design automation (1991)

Two new methods for efficient enumeration of slicing structures useful for macro cell and sea-of-gates final placement are presented. Contrary to existing approaches a further preorder traversal of the slicing tree is added, which allows elimination of unnecessary shapes in an early design phase. Applying this look ahead strategy, memory and computation time requirements have been reduced drastically. Better placements have been achieved by using the saved resources to enlarge the search space for enumeration.
New tools and practices for electronic music distribution
Authors: Francis Rousseaux, Alain Bonardi
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Apart from the traditional uses of computing in the fields of music and musicology, human-computer systems are emerging in reaction to this tradition, which is already effective, though still young.Whereas these unique systems operate in the usual fields of music' s expansion, they cannot be systematically referred to known musicological categories. On the contrary, the experiments made possible by these systems inaugurate new uses where listening, composing and music transmission are merged in a gesture sometimes described as "music-ripping".We will show how music-ripping practices provoke traditional musicology, whose canonical categories are powerless for our purpose.To achieve this purpose, we will:- give an explicit minimal set of categories sufficient to underlie the usual models of computer assisted music;- do the same thing for human-computer (anti-musicological?) systems which existence is disturbing to us;- examine the conditions necessary to reduce the second set of categories to the first;- conclude on the nature of music-ripping.
Why i care about programming and how to teach it
Authors: Owen Astrachan
Venue: ACM SIGCSE Bulletin (2004)

This is the thirty-fifth SIGCSE conference. Off-by-one bugs notwithstanding, it seems safe to assume that the members of the SIGCSE community have been teaching programming for at least 35 years. Have we improved the teaching of programming in that time? We have changed languages, we have occasionally changed paradigms, and the platform we use to teach programming is effectively infinitely more powerful than it was 35 years ago. However, if we use the SIGCSE proceedings as a snapshot of the state-of-the-art in teaching programming, it's possible to take a view that "the more things change the more they remain the same." In this talk I'll review what the community has had to say about teaching programming and what it is saying today. The community does not always speak in one voice, but there are established trends that illuminate what we as a community view as important. In 1974 David Gries discussed how we should teach programming and used this analogy: "Suppose you attend a course in cabinet making. The instructor briefly shows you a saw, a plane, a hammer, and a few other tools, letting you use each one for a few minutes. He next shows you a beautifully-finished cabinet. Finally, he tells you to design and build your own cabinet and bring him the finished product in a few weeks. You would think he was crazy!" As part of this talk I will demonstrate how I teach program-building and why I think that if we do not program in front of our students we cannot effectively teach programming. I hope to convince you that programming should be taught by demonstration and that I am not crazy.
A Learning Algorithm of CMAC Based on RLS
Authors: Ting Qin, Zonghai Chen, Haitao Zhang, Sifu Li, Wei Xiang, Ming Li
Venue: Neural Processing Letters (2004)

Conventionally, least mean square rule which can be named CMAC-LMS is used to update the weights of CMAC. The convergence ability of CMAC-LMS is very sensitive to the learning rate. Applying recursive least squares (RLS) algorithm to update the weights of CMAC, we bring forward an algorithm named CMAC-RLS. And the convergence ability of this algorithm is proved and analyzed. Finally, the application of CMAC-RLS to control nonlinear plant is investigated. The simulation results show the good convergence performance of CMAC-RLS. The results also reveal that the proposed CMAC-PID controller can reject disturbance effectively, and control nonlinear time-varying plant adaptively.