ppxscal/embedding_network huggingface dataset:
Behavioral IP Specification and Integration Framework for High-Level Design Reuse
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Intellectual Property (IP) reuse approaches are known as the better way to bridge the gap between performance and time-to-market for the design of entire systems on a single chip (SoC). Despite standardization efforts and recent advances in design reuse methodology, a lot of challenges have to be addressed to make design-reuse methodology come-of-age. It is now accepted that a SoC will be synthesized from a high-level functional description using a common language. Specifying the IP at the behavioral level appears as the most promising solution to achieve a real efficiency of design reuse. In this paper we propose a methodology to specify and use Behavioral Level IP (BL-IP). Thus, IP designer tasks are easier due to the unified representation offered by this level of abstraction. The genericity of a behavioral IP permits efficient optimizations and make application context adaptations a reality. We propose a unified framework to define an IP at the behavioral level and to tune a particular block according to designer needs. Therefore, we define the IP generator tool and the Universal High Level Synthesis concept.
Scalability of Parallel Algorithm Implementation
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

In this paper, we discuss scalability of parallel systems from three aspects and point out some of the weakness of several existing main schemes for scalability. As an extension to the isoefficiency metric and isospeed metric , we present and define scalability of parallel algorithm implementation, and analyze some relevant theoretical perspectives.
Systematic derivation of operational requirements using the ECSAM method
Authors: J. Z. Lavi, J. Kudish
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

ECSAM is a method for modeling and analysis of embedded computer systems and their software and the generation of their requirements. Previous ECSAM papers described its application to the conceptual modeling of systems' internals, providing white box models. The paper extends the use of ECSAM to the systematic derivation of systems' external specifications taking into consideration the behaviour of the environmental systems. The application of the method described in the paper results in a black box external model which provides the operational specifications of the system in terms of system modes and behavioral processes. The resulting external and internal system models are inherently consistent. The external specifications are translatable into operational scenarios, which can successively be transformed into operational and test requirements. The approach is demonstrated by an external analysis of a simplified home alarm system. The approach lends itself to the automatic derivation of operational and test requirements from the black box external model using CAS/sup 2/E tools.
A Tool for Algorithm Visualization on the Reconfigurable Mesh
Authors: Jacir Luiz Bordim, Tomoo Watanabe, Koji Nakano, Tatsuya Hayashi
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Many parallel algorithms on the reconfigurable mesh have been developed so far. However, it is hard to understand the behavior of these algorithms, because the bus topology is dynamically changing during the execution.This paper describes VMesh, a tool for visualizing parallel algorithms on the Reconfigurable Mesh. The purpose of the VMesh is to provide a comprehensive environment for development, visualization and debugging of algorithms. This system has proven to be useful for studying and understanding the behavior of parallel algorithms on the reconfigurable mesh.
Information Architecture with XML: A Management Strategy
Authors: Peter Brown
Venue:  (2002)

:XML has been introduced into many enterprises by stealth, through the IT back door and with little management overview or buy-in. This book proposes an alternative: a management-driven strategy. Its emphasis is on ends (information management) rather than means (technology). It focuses on the need for high-level co-operation between all business units and services within an organisation and shows how XML can be both a technology and business integrator. The benefits it can bring are high levels of interoperability, not only between data and text but also between application processes, business logic and entire information systems. 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
Dr. Mac: The OS X Files, 2 edition
Authors: Bob LeVitus
Venue:  (2003)

:Totally updated, enhanced and expanded for OS X Jaguar, Panther, and beyond, this book picks up where the bestselling first edition left off and offers advice, suggestions, diagnoses, prescriptions, and cures for Mac OS X users.
Flits: Pervasive Computing for Processor and Memory Constrained Systems
Authors: William Majurski, Alden Dima, Mary Laamanen
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Many pervasive computing software technologies are targeted for 32-bit desktop platforms. However, innumerable 8, 16, and 32-bit microcontroller and microprocessor-based embedded systems do not support the resource requirements of these technologies. We describe ongoing research that explores the feasibility of creating a portable runtime-environment capable of executing across a wide-variety of 8, 16, and 32-bit processors and that offers mobile code and high-level language support. Our solution adapts a version of the language Forth called FCode and its environment to fit these needs. We introduce the concept of a ¿flit¿, a software construct similar to an applet but tailored to the needs of lower resource solutions to pervasive computing. We also describe work currently in progress.
ASML: Automatic Site Markup Language 1.03
Authors: Charles B. Owen, Fillia Makedon, Glen Frank, Michael Kenyon
Venue:  (1997)

Creation of large and complex World Wide Web sites is hampered by the "page at a time" approach of many tools and the programming knowledge and custom software development required for automated solutions. This report describes the development of the Automatic Site Markup Language (ASML). ASML is a new markup language designed to produce large, complicated web sites which can include dynamic content. ASML extends HTML with new, high-level features while still preserving complete compatibility with common browser and server technologies. It has powerful indexing and searching facilities, and enables the automatic translation of document formats. Most importantly, ASML provides HTML-like features at the site level rather than just the page level
Choir: A Real-Time Middleware Architecture Supporting Benefit-Based Proactive Resource Allocation
Authors: Peng Li, Binoy Ravindran, Jinggang Wang, Glenn Konowicz
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Asynchronous real-time distributed systems are inherently non-deterministic. To deal with suchnon-determinism's, we have developed a family of proactive resource management algorithms that support benefit-function based, end-to-end QoS management. This paper describes a middleware implementation of these algorithms, called Choir. The Choir middleware allows the user express the task end-to-end timeliness requirements using Jensen's benefit functions. Furthermore, the middleware system can transparently replicate, and possibly migrate the computational subtasks to conquer uncertainties such as workload fluctuations, changes of system resources, so that the system aggregate benefit is maximized. Initial experimental results suggest the effectiveness the Choir middleware.
A compositional model for confluent dynamic data-flow networks
Authors: Frank S. Boer, Marcello M. Bonsangue
Venue:  (2000)

We introduce a state-based language for programming dynamically changing networks which consist of processes that communicate asynchronously. For this language we introduce an operational semantics and a notion of observable which includes both partial correctness and absence of deadlock. Our main result is a compositional characterization of this notion of observable for a confluent sub-language.
Optimizing Static Job Scheduling in a Network of Heterogeneous Computers
Authors: Xueyan Tang, Samuel T. Chanson
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper investigates static job scheduling schemes that distribute workload in a network of computers with different speeds. Static schemes involve very low overhead and complexity compared to dynamic schemes, but can still provide significant performance improvement over the case of no load balancing. Optimization techniques are proposed for workload allocation and job dispatching. Workload allocation is modeled as a non-linear optimization problem and solved mathematically. It is shown that allocating a disproportionately high percentage of jobs to the more powerful computers improves system performance. The proposed job-dispatching algorithm is an extension of the traditional round-robin scheme. The objective is to reduce burstiness in the job arrival stream to each computer. The schemes are evaluated by simulation experiments. Performance results verify their effectiveness in terms of mean response time, mean response ratio, and fairness. The Optimized Round-Robin (ORR) strategy, which combines both techniques, outperforms other static scheduling algorithms examined.
The External Storage Facility in SICStus Prolog
Authors: Hans Nilsson
Venue:  (1991)

The SICStus Prolog External Database implements an efficient way of storing possibly non-ground Prolog terms on disk with indexing on user specified parts of the terms. The model and the implementation are described and some performance data are given.
Analyzing Cache Performance for Video Servers
Authors: Sun-Euy Kim, Anand Sivasubramaniam, Chita R. Das
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

Video-on-demand (VOD) is expected to become one ofthe most important and successful services to be offered onemerging technologies. There is not just an interest in thedelivery of digital video for home entertainment purposes,but there are also several educational and commercial benefitsfrom this service. However, for this service to becomeviable, it is important that the video servers meet thedemanding data rates and real-time performance requirementsimposed by video. Interval caching has been proposedas a cost-effective way of improving the throughputof a server, but all previous studies on interval caching haveused simulation. With numerous parameters and their complexinterplay affecting the performance of interval caching,it is infeasible to consider a full-factorial experiment withsimulation.This paper presents an analytical model for intervalcaching on video servers. The model has been extensivelyvalidated over a range of client requests, video data andserver parameters. In addition, the model has been generalizedto accommodate variable lengths of video data storedat the server. Using this model, the impact of different parametershas been studied on the performance of intervalcaching scheme.
Explicit Rate Abr Schemes Using Traffic Load as Congestion Indicator
Authors: F. M. Chiussi, A. Arulambalam, Y. Xia, X. Chen
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

A central issue in congestion control for Available Bit Rate (ABR) services is the computation of the fair share for every connection at each switching node in the network. An important class of algorithms for the switch behavior computes the fair share according to the exact definition of max-min fairness, and uses it as the explicit rate conveyed to the sources. These algorithms may encounter difficulties due to the complex task of keeping track of active connections. In addition, since these schemes treat all connections equally, they lead to under-utilization of the link capacity when on-off sources are present in the network. To obviate these shortcomings, it has been proposed to use the traffic load to correct the computed fair share when setting the explicit rate. In this paper, first we show that using the traffic load as suggested in literature inherently perturbs rate allocation, and makes the schemes sensitive to the round-trip delay of the connections, leading to unfairness. Then, we introduce a scheme called the Enhanced Fast Max-Min Rate Allocation (E-FMMRA) algorithm, which solves the problem by keeping track of the maximum explicit rate over all backward RM cells. The same technique used in E-FMMRA can also be applied to the popular Explicit Rate Indication for Congestion Avoidance (ERICA) scheme to solve similar problems associated with the use of the traffic load.
Context-Aware, Adaptive Wearable Computers as Remote Interfaces to 'Intelligent' Environments
Authors: Gerd Kortuem, Zary Segall, Martin Bauer
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

This paper describes a wearable computing system for monitoring and controlling of 'intelligent' environments. The main components of the system are (1) an open, expandable service model for the description of functionality provided by environments; (2) a self-adapting wearable computer that can function as remote interface to a wide variety of services.
Implementation and evaluation of active agent repository for dynamic networking
Authors: Takahiro Uchiya, Takuo Suganuma, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we explain the implementation and evaluation of Active Agent Repository based multiagent framework to improve performance of the agent's cooperative works by using the behavioral history of each agent. We demonstrate the experimental results to show the effectiveness of the proposal method.
Applications and Services in Wireless Networks (Innovative Technology Series)
Authors: Hossam Afifi, Djamal Zeghlache
Venue:  (2003)

:Emerging wireless technologies for both public and private use have led to the creation of new applications, including the adaptation of current network management procedures and protocols and the introduction of unified open service architectures. Aspects such as accounting for multiple media access and QoS (Quality of Service) profiling must also be introduced to enable multimedia service offers, service management, and service control over the wireless internet. Also needed to foster the development of new services, are security and content production. Adaptable applications for variable bandwidth and variable costs will open new possibilities for ubiquitous communications. In this book the contributors, drawn from a broad international field, address these prospects from the most recent perspectives.
Weil descent of Jacobians
Authors: Steven D. Galbraith
Venue: Discrete Applied Mathematics (2003)

The technique of Weil restriction of scalars has significant implications for elliptic curve cryptography. In this paper we apply these ideas to the case of the discrete logarithm problem in the Jacobian of a curve of genus greater than one over a finite field Fqn where n > 1.
Knowledge and Economic Conduct: The Social Foundations of the Modern Economy
Authors: Nico Stehr
Venue:  (2002)

:"Examining the foundations of the modern capitalist economy from a broad social scientific perspective, this challenging work posits that changing economic circumstances - namely, an end to the primacy of labour and property as determinants of prosperity - have created a need for a new theoretical platform, one that transcends standard economic discourse." "In Nico Stehr's view, knowledge is now the most significant source of economic growth - the 'prime productive factor.' This shift to a knowledge-based society, however, is a source of some uncertainty and apprehension. Will it bring a more sustainable, less ecologically disruptive form of production, or escalating levels of unemployment? What are the practical social, political, and economic implications of the new technology? What are the possibilities for social action in a context where such possibilities are being limited? Stehr proposes that a new social science agenda is needed to address these and other urgent questions arising from the new economic realities." Knowledge and Economic Conduct is essential reading for students and social scientists with an interest in technology, globalization, and the changing economy, as well as for researchers and policy makers within both the public and private sectors. 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
PhotoShop 6 in Depth
Authors: David Xenakis, Benjamin Levisay
Venue:  (2002)

:If you print or publish, Photoshop 6 In Depth shows you how to manage color for best possible reproduction. If color correction is your forte, you learn how to start with the best possible scan and how to work magic to produce better images. If you are a designer, you'll explore transformations, selections, filters, and new tools. If you work on the Web, you'll learn how to use Photoshop 6 and ImageReady 3 to produce the best-looking and best-sized images for your site.
Energy management for battery-powered embedded systems
Authors: Daler Rakhmatov, Sarma Vrudhula
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Portable embedded computing systems require energy autonomy. This is achieved by batteries serving as a dedicated energy source. The requirement of portability places severe restrictions on size and weight, which in turn limits the amount of energy that is continuously available to maintain system operability. For these reasons, efficient energy utilization has become one of the key challenges to the designer of battery-powered embedded computing systems.In this paper, we first present a novel analytical battery model, which can be used for the battery lifetime estimation. The high quality of the proposed model is demonstrated with measurements and simulations. Using this battery model, we introduce a new "battery-aware" cost function, which will be used for optimizing the lifetime of the battery. This cost function generalizes the traditional minimization metric, namely the energy consumption of the system. We formulate the problem of battery-aware task scheduling on a single processor with multiple voltages. Then, we prove several important mathematical properties of the cost function. Based on these properties, we propose several algorithms for task ordering and voltage assignment, including optimal idle period insertion to exercise charge recovery.This paper presents the first effort toward a formal treatment of battery-aware task scheduling and voltage scaling, based on an accurate analytical model of the battery behavior.
How Robust Are Distributed Systems?
Authors: Kenneth P. Birman
Venue:  (1989)

No abstract is available.
Quality assessment of knowledge-based software: some certification considerations
Authors: A. Vermesan
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Knowledge-based technology is being applied to complex problem-solving and critical tasks in many application domains. Concerns have naturally arisen as to the dependability of knowledge-base systems (KBSs). As with any software, attention to quality and safety must be paid throughout the development of a KBS, and rigorous verification and validation (V&V) techniques must be employed. Research in KBS V&V has emerged as a distinct field only in the last decade and is intended to address issues associated with KBS quality aspects and to credit such applications with the same degree of dependability as conventional applications. However, a major drawback of the current state of acceptance of KBS software is the lack of standardization. Although standards do exist for software, extensions are needed to cope with specific KBS software characteristics. This paper advocates the idea that, although quality assessment of KBS software is still a challenging issue, KBS software is not an impossible one. Some V&V techniques based on specific KBS software properties are described in this paper which aims at indicating KBS acceptability requirements may be specified and evaluated, being at the same time a good basis for certification.
The Complexity of TRMCS-like Spiral Specification
Authors: Tim Menzies
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

Modern software is often constructed using ¿spiral specification¿; i.e. the specification is a dynamic document that is altered by experience with the current version of the system. Mathematically, many of the sub-tasks within spiral specification belong to the NP-complete class of tasks. In the traditional view of computer science, such tasks are fundamentally intractable and only solvable using incomplete, approximate methods that can be undependable. This traditional view suggests that we should routinely expect spiral specification to always be performed very poorly. This paper is an antidote to such pessimism. Contrary to the traditional view, we can expect that spiral specification can usually be performed adequately, providing that analysts augment their current tools with random probing.
Some constructions of superimposed codes in Euclidean spaces
Authors: Danyo Danev
Venue: Discrete Applied Mathematics (2003)

We describe three new methods for obtaining superimposed codes in Euclidean spaces. With help of them we construct codes with parameters improving upon known constructions. We also prove that the spherical simplex code is not optimal as superimposed code at least for dimensions greater than 9.
Querying web site visitor trend data with coordinated nested bar and pie charts
Authors: Mark Sifer
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Bar charts and pie charts are traditional ways of displaying trends and proportions in a data set. However, static charts don't scale well. We introduce a technique which does scale, an interactive browser design which uses aggregation and zooming to support bar and pie charts with thousands of items. Further, once a chart has many elements a user needs to be able to explore subsets of the data. We use a second view of the data, shown as a second chart as a scalable filter for selecting subsets. We present our design and its implementation in the SGViewer tool, and demonstrate with visit data taken from a web site log.