ppxscal/embedding_network huggingface dataset:
Iterative schedule optimization for voltage scalable distributed embedded systems
Authors: Marcus T. Schmitz, Bashir M. Al-Hashimi, Petru Eles
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

We present an iterative schedule optimization for multirate system specifications, mapped onto heterogeneous distributed architectures containing dynamic voltage scalable processing elements (DVS-PEs). To achieve a high degree of energy reduction, we formulate a generalized DVS problem, taking into account the power variations among the executing tasks. An efficient heuristic is presented that identifies optimized supply voltages by not only "simply" exploiting slack time, but under the additional consideration of the power profiles. Thereby, this algorithm minimizes the energy dissipation of heterogeneous architectures, including power-managed processing elements, effectively. Further, we address the simultaneous schedule optimization toward timing behavior and DVS utilization by integrating the proposed DVS heuristic into a genetic list scheduling approach. We investigate and analyze the possible energy reduction at both steps of the co-synthesis (voltage scaling and scheduling), including the power variations effects. Extensive experiments indicate that the presented work produces solutions with high quality.
Preference programming: Advanced problem solving for configuration
Authors: Ulrich Junker, Daniel Mailharro
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

Configuration problems often involve large product catalogs, and the given user requests can be met by many different kinds of parts from this catalog. Hence, configuration problems are often weakly constrained and have many solutions. However, many of those solutions may be discarded by the user as long as more interesting solutions are possible. The user often prefers certain choices to others (e.g., a red color for a car to a blue color) or prefers solutions that minimize or maximize certain criteria such as price and quality. In order to provide satisfactory solutions, a configurator needs to address user preferences and user wishes. Another important problem is to provide high-level features to control different reasoning tasks such as solution search, explanation, consistency checking, and reconfiguration. We address those problems by introducing a preference programming system that provides a new paradigm for expressing user preferences and user wishes and provides search strategies in a declarative and unified way, such that they can be embedded in a constraint and rule language. The preference programming approach is completely open and dynamic. In fact, preferences can be assembled from different sources such as business rules, databases, annotations of the object model, or user input. An advanced topic is to elicit preferences from user interactions, especially from explanations of why a user rejects proposed choices. Our preference programming system has successfully been used in different configuration domains such as loan configuration, service configuration, and other problems.
Analysis of a Nonsymmetric Discontinuous Galerkin Method for Elliptic Problems: Stability and Energy Error Estimates
Authors: Mats G. Larson, A. Jonas Niklasson
Venue: SIAM Journal on Numerical Analysis (2004)

In this paper we analyze a nonsymmetric discontinuous Galerkin method for elliptic problems proposed by Oden, Babuska, and Baumann. Our main results are a complete inf-sup stability analysis and, as a consequence, error estimates in a mesh dependent energy norm allowing variable meshsize and order of polynomials. The analysis is carried out in two spatial dimensions on an unstructured triangulation.
Evaluation of delay fault testability of LUTs for the enhancement of application-dependent testing of FPGAs
Authors: Andrzej Krasniewski
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

Testing delay faults in FPGAs differs significantly from testing delay faults in circuits whose combinational sections are represented as gate networks. Based on delay fault testability conditions, formulated in a form suitable for analysis of LUT-based FPGAs, a new method for the evaluation of delay fault testability of LUT functions has been developed. It relies on an indicator called delay fault activation profile. The proposed method supports an analysis and comparison of different procedures for the enhancement of detectability of FPGA delay faults that rely on transformations of user-defined functions of LUTs in the section under test. The effectiveness of the method is demonstrated by applying it to prove the efficiency and to optimize a specific procedure for the transformation of user-defined LUT functions.
The Interplay of Power Management and Fault Recovery in Real-Time Systems
Authors: Rami Melhem, Daniel Mossé, Elmootazbellah (Mootaz) Elnozahy
Venue: IEEE Transactions on Computers (2004)

Abstract--This paper describes how to exploit the scheduling slack in a real-time system to reduce energy consumption and achieve fault tolerance at the same time. During failure-free operation, a task takes checkpoints to enable recovery from failure. Additionally, the system exploits the slack to conserve energy by reducing the processor speed. If a task fails, it will restart from a saved checkpoint and execute at maximum speed to guarantee that the deadlines are met. The paper shows that the number of checkpoints and their placements interact in subtle ways with the power management policy. We study two checkpoint placement policies for aperiodic tasks and analytically derive the optimal number of checkpoints to conserve energy under each. This optimal number allows the CPU speed to be slowed down to the level that yields minimum energy consumption, while still guaranteeing recoverability of tasks under each checkpointing policy. The results show that traditional periodic checkpointing is not the best policy for the combined purpose of conserving energy and guaranteeing recovery. Instead, better energy savings are possible through a nonuniform distribution of checkpoints that takes into account the energy consumption and reliability factors. Depending on the amount of slack and the checkpointing overhead, energy can be reduced by up to 68 percent under nonuniform checkpointing. We also demonstrate the applicability of these checkpoint placement policies to periodic tasks.
Shape-Based 3D Model Retrieval
Authors: Jeong-Jun Song, Forouzan Golshani
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Two feature extraction methods for shape similarity based retrieval of 3D object models are presented. The proposed methods, which result in more effective and robust techniques for searching 3D models by similarity, support two essential query modes, namely, query by 3D model and query by 2D image. Our feature extraction scheme is inspired by observation ofhuman behavior in recognizing 3D objects in practice. The process of extracting spatial arrangement from a 3D object surface and 2D shape features from projection images are achieved by adopting curvature distribution of the model surfaces and Fourier descriptors of the projection images.
Appearance-Based Face Recognition and Light-Fields
Authors: Ralph Gross, Iain Matthews, Simon Baker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Arguably the most important decision to be made when developing an object recognition algorithm is selecting the scene measurements or features on which to base the algorithm. In appearance-based object recognition, the features are chosen to be the pixel intensity values in an image of the object. These pixel intensities correspond directly to the radiance of light emitted from the object along certain rays in space. The set of all such radiance values over all possible rays is known as the plenoptic function or light-field. In this paper, we develop a theory of appearance-based object recognition from light-fields. This theory leads directly to an algorithm for face recognition across pose that uses as many images of the face as are available, from one upwards. All of the pixels, whichever image they come from, are treated equally and used to estimate the (eigen) light-field of the object. The eigen light-field is then used as the set of features on which to base recognition, analogously to how the pixel intensities are used in appearance-based face and object recognition.
Navigational tools in hypertext information retrieval frames and an expandable table of contents
Authors: Rawiwan Tenissara
Venue: Computing information technology: the human side (2003)

Difficulties with navigation are common in hypertext documents. Many studies have examined techniques and design strategies to find the proper structure of a hyperdocument whereas others have investigated navigational tools such as overview diagrams, maps, menus, and/or tables of contents that help users navigate through complex hyperdocuments. This study has investigated the effects of table of contents and frames as user interface on user performance and user satisfaction. The result suggests several guidelines for designing complex hypertext information retrieval systems and creating on-line documentation.
Two-stage generalized simulated annealing for the construction of change-over designs
Authors: Yuk W. Cheng, Deborah J. Street, William H. Wilson
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

Kunert (1983) has found sufficient conditions for the optimal estimation of direct treatment effects from change-over designs. In this paper, a two-stage generalized simulated annealing algorithm uses these conditions to construct large change-over designs where t|p and t||n and where t||p and t|n.
Embedding Perl in MySQL
Authors: Brian Aker
Venue: Linux Journal (2003)

Hey! There's a mistake in this article--Perl code in the middle of an SQL SELECT! Don't you people even read this stuff? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Biophysical modelling of catchment-scale surface water and groundwater response to land-use change
Authors: W. R. Dawes, M. Gilfedder, G. R. Walker, W. R. Evans
Venue: Mathematics and Computers in Simulation (2004)

The effect of land-use change on salt and water-balances of catchments in Australia has been significant. Impacts of these changes are often masked by large time lags between the changes and their subsequent expression. Successful management relies on information that allows these changes to be understood and predicted. In the absence of detailed hydrogeological and hydrographic data, a simple approach is required. A logistic function model is introduced, which weights changes in recharge to changes in discharge according to a characteristic time-scale and a rate of change. This response function approach is used to estimate the time lags for individual groundwater flow systems (GFS), which can be aggregated to estimate whole catchment behaviour. Using this model, the predicted future effect of a range of afforestation strategies on catchment salt load has been simulated for sub-catchments of the mid-Macquarie (New South Wales, Australia).
The differential Lambda-calculus
Authors: Thomas Ehrhard, Laurent Regnier
Venue: Theoretical Computer Science (2003)

We present an extension of the lambda-calculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambda-calculus.
Information Sharing in a Supply Chain with Horizontal Competition
Authors: Lode Li
Venue: Management Science (2002)

This paper examines the incentives for firms to share information vertically in a two-level supply chain in which there are an upstream firm (a manufacturer) and many downstream firms (retailers). The retailers are engaged in a Cournot competition and are endowed with some private information. Vertical information sharing has two effects: "direct effect" due to the changes in strategy by the parties involved in sharing the information and "indirect effect" (or "leakage effect") due to the changes in strategy by other competing firms (who may infer the information from the actions of the informed parties). Both changes would affect the profitability of the firms. We show that the leakage effect discourages the retailers from sharing their demand information with the manufacturer while encouraging them to share their cost information. On the other hand, the direct effect always discourages the retailers from sharing their information. When voluntary information sharing is not possible, we identify conditions under which information can be traded and show how price should be determined to facilitate such information exchange. We also examine the impact of vertical information sharing on the total supply chain profits and social benefits.
Formal Methods in Embedded Design
Authors: Steven D. Johnson
Venue: Computer (2003)

The future benefits of using formal methods in embedded system design warrant investment in the underlying expertise.
Using AutoMed metadata in data warehousing environments
Authors: Hao Fan, Alexandra Poulovassilis
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

What kind of metadata can be used for expressing the multiplicity of data models and the data transformation and integration processes in data warehousing environments? How can this metadata be further used for supporting other data warehouse activities? We examine how these questions are addressed by AutoMed, a system for expressing data transformation and integration processes in heterogeneous database environments.
A service-learning program for computer science and software engineering
Authors: Panagiotis K. Linos, Stephanie Herman, Julie Lally
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper presents a service-learning educational program called EPICS (Engineering Projects In Community Service). It also describes our efforts and experiences from incorporating this program within a Computer Science and Software Engineering curriculum. Our paper concludes by discussing various key challenges and some early lessons learned while crafting such program.
Contention-Free Periodic Message Scheduler Medium Access Control in Wireless Sensor / Actuator Networks
Authors: Thomas W. Carley, Moussa A. Ba, Rajeev Barua, David B. Stewart
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

This paper presents a time division multiple accessmedium access control protocol for wireless sensor /actuator networks implemented with a contention-freemessage scheduler. A message scheduler is used todetermine which message has access to the medium atany time. A set of messages is contention-free if only onemessage is ready at a time. Otherwise, some othercriterion such as priority must be used to resolvecontention. In this case the message scheduler at eachnode in the network must schedule all messages in orderto resolve contention. If the schedule is contention-freehowever, then each node only schedules the messages thatinterest it. The key contribution of our contention-freescheduler protocol is scalability. Large wireless sensor /actuator networks may contain hundreds of nodesexchanging thousands of messages. Due to resourceconstraints it is infeasible that each node schedule everymessage. Our protocol scales by optimizing each node toschedule only the messages it is interested in.
Connectedness, Classes and Cycle Index
Authors: E. A. Bender, P. J. Cameron, A. M. Odlyzko, L. B. Richmond
Venue: Combinatorics, Probability and Computing (1999)

This paper begins with the observation that half of all graphs containing no induced path of length 3 are disconnected. We generalize this in several directions. First, we give necessary and sufficient conditions (in terms of generating functions) for the probability of connectedness in a suitable class of graphs to tend to a limit strictly between zero and one. Next we give a general framework in which this and related questions can be posed, involving operations on classes of finite structures. Finally, we discuss briefly an algebra associated with such a class of structures, and give a conjecture about its structure.
Making Scientific Applications as Web Services
Authors: Marlon Pierce, Geoffrey Fox
Venue: Computing in Science and Engineering (2004)

In past columns, the authors discussed Grid technology in e-Science (large-scale, distributed scientific research). Here, we make the ideas more concrete by describing how to convert (or build from scratch) a scientific resource (a software program) to a Web service. Modern Grids are built on top of Web services, with interesting refinements captured as open Grid services architecture (OGSA). You easily can extend the open Grid services infrastructure (OGSI) approach we present here to be OGSA compliant.
Slepian-Wolf Coded Nested Quantization (SWC-NQ) for Wyner-Ziv Coding: Performance Analysis and Code Design
Authors: Zhixin Liu, Samuel Cheng, Angelos D. Liveris, Zixiang Xiong
Venue: Proceedings of the Conference on Data Compression (2004)

This paper examines the high-rate performance of low-dimensional nested latticequantizers for the quadratic Gaussian Wyner-Ziv problem, using a pair of nestedlattices with the same dimensionality. As the rate increases, we observe an increasinggap between the performance of low-dimensional nested lattice quantizers and theWyner-Ziv rate-distortion function. We argue that this gap is due to the relativelyweak channel coding component (or coarse lattice) in the nested lattice pair. Toenhance the lattice channel code and boost the overall performance, Slepian-Wolfcoding is applied to the quantization indices to achieve further compression. Therebya Wyner-Ziv coding paradigm is introduced using Slepian-Wolf coded nested latticequantization (SWC-NQ). Theoretical analysis and simulation results show that, forthe quadratic Gaussian source and at high rate, SWC-NQ performs the same astraditional entropy-constrained lattice quantization with side information availableat both the encoder and decoder.
Reductions, intersection types, and explicit substitutions
Authors: Dan Dougherty, Pierre Lescanne
Venue: Mathematical Structures in Computer Science (2003)

This paper is part of a general programme of treating explicit substitutions as the primary &lambda;-calculi from the point of view of foundations as well as applications. We work in a composition-free calculus of explicit substitutions and an augmented calculus obtained by adding explicit garbage-collection, and explore the relationship between intersection-types and reduction.We show that the terms that normalise by leftmost reduction and the terms that normalise by head reduction can each be characterised as the terms typable in a certain system. The relationship between typability and strong normalisation is subtly different from the classical case: we show that typable terms are strongly normalising but give a counterexample to the converse. Our notions of leftmost and head reduction are non-deterministic, and our normalisation theorems apply to any computations obeying these strategies. In this way we refine and strengthen the classical normalisation theorems. The proofs require some new techniques in the presence of reductions involving explicit substitutions. Indeed, our proofs do not rely on results from classical &lambda;-calculus, which in our view is subordinate to the calculus of explicit substitution.
Sparse topologies with small spectrum size
Authors: R. Elsässer, R. Královič, B. Monien
Venue: Theoretical Computer Science (2003)

One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplace matrix. Determining this number is of theoretical interest as well as of practical impact. Sparse graphs with small spectra exhibit excellent structural properties and can act as interconnection topologies. In this paper, for any n we present graphs, for which the product of their vertex degree and the number of different eigenvalues is small. It is known that load balancing can be performed on such graphs in a small number of steps.
Electronic business adoption by European firms: a cross-country assessment of the facilitators and inhibitors
Authors: Kevin Zhu, Kenneth Kraemer, Sean Xu
Venue: European Journal of Information Systems (2003)

In this study, we developed a conceptual model for studying the adoption of electronic business (e-business or EB) at the firm level, incorporating six adoption facilitators and inhibitors, based on the technology-organization-environment theoretical framework. Survey data from 3100 businesses and 7500 consumers in eight European countries were used to test the proposed adoption model. We conducted confirmatory factor analysis to assess the reliability and validity of constructs. To examine whether adoption patterns differ across different e-business environments, we divided the full sample into high EB-intensity and low EB-intensity countries. After controlling for variations of industry and country effects, the fitted Iogit models demonstrated four findings: (1) Technology competence, firm scope and size, consumer readiness, and competitive pressure are significant adoption drivers, while lack of trading partner readiness is a significant adoption inhibitor. (2) As EB-intensity increases, two environmental factors - consumer readiness and lack of trading partner readiness - become less important, while competitive pressure remains significant. (3) In high EB-intensity countries, e-business is no longer a phenomenon dominated by large firms; as more and more firms engage in e-business, network effect works to the advantage of small firms. (4) Firms are more cautious in adopting e-business in high EB-intensity countries - it seems to suggest that the more informed firms are less aggressive in adopting e-business, a somehow surprising result. Explanations and implications are offered.
An evolutionary approach to elastic contact optimization of frame structures
Authors: Wei Li, Qing Li, Grant P. Steven, Y. M. Xie
Venue: Finite Elements in Analysis and Design (2003)

Many real structures are made up of trusses and beams as are their computational models. It may be important to the designer to consider such structures to be in contact and if so, then to ensure that such contact does not produce high localized stress. This study is concerned with such an issue in truss/beam structures involving a unilateral contact constraints. In this paper, the evolutionary structural optimization method is verified for the design of planar or three-dimensional structures that consist of truss or beam elements. An elastic frame in contact with a rigid foundation and two elastic frames in contact with either two-or three-dimensional structures have been studied. Since the truss and beam elements provide different structural responses, the difference of optimal frame designs between these two element types is also investigated in this paper.
Design of combinational logic circuits through an evolutionary multiobjective optimization approach
Authors: Carlos A. Coello Coello, Arturo Hernández Aguirre
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

In this paper, we propose a population-based evolutionary multiobjective optimization approach to design combinational circuits. Our results indicate that the proposed approach can significantly reduce the computational effort required by a genetic algorithm (GA) to design circuits at a gate level while generating equivalent or even better solutions (i.e., circuits with a lower number of gates) than a human designer or even other GAs. Several examples taken from the literature are used to evaluate the performance of the proposed approach.