ppxscal/embedding_network huggingface dataset:
A proposed hardware fault simulation engine
Authors: Daniel Cock, Andy Carpenter
Venue: Proceedings of the conference on European design automation (1991)

Fault simulation is an essential part of the design cycle and for large circuits it can be very time consuming. This paper examines the possibility of hardware acceleration of this process, especially that of sequential circuits. In order to achieve this, the architecture of a pipelined hardware simulation accelerator, the MANchester Simulation Engine (MANSE), is examined. Finally the modifications necessary to make MANSE capable of fault simulation are considered.
Evolutionary optimization within an intelligent hybrid system for design integration
Authors: D. Su, M. Wakelam
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

An intelligent hybrid approach has been developed to integrate various stages in total design, including formulation of product design specifications, conceptual design, detail design, and manufacture. The integration is achieved by blending multiple artificial intelligence (AI) techniques and CAD/CAE/CAM into a single environment. It has been applied into power transmission system design. In addition to knowledge-based systems and artificial neural networks, another AI technique, genetic algorithms (GAs), are involved in the approach. The GA is used to conduct optimization tasks: (1) searching the best combination of design parameters to obtain optimum design of gears, and (2) optimization of the architecture of the artificial neural networks used in the hybrid system. In this paper, after a brief overview of the intelligent hybrid system, the GA applications are described in detail.
Interval-based clock synchronization with optimal precision
Authors: Ulrich Schmid, Klaus Schossmaier
Venue: Information and Computation (2003)

We present description and analysis of a novel optimal precision clock synchronization algorithm (OP), which takes care of both precision and accuracy with respect to external time. It relies upon the generic interval-based algorithm of Schmid and Schossmaier [Real-Time Syst. 12 (2) (1997) 173] and utilizes a convergence function based on the orthogonal accuracy algorithm of Schmid [Chicago J. Theoret. Comput. Sci. 3 (2000) 3]. As far as precision is concerned, we show that OP achieves optimal worst case precision, optimal maximum clock adjustment, and optimal rate, as does the algorithm of Fetzer and Cristian [Proceedings of the 10th Annual IEEE Conference on Computer Assurance, Gaithersburg, MD, 1995]. However, relying upon a perception-based hybrid fault model and a fairly realistic system model, our results are valid for a wide variety of node and link faults and apply to very high-precision applications as well: Impairments due to clock granularity and discrete rate adjustment cannot be ignored here anymore. Our accuracy analysis focuses on the nodes' local accuracy interval, which provides the atop running application with an on-line bound on the current deviation from external time. We show that this bound could get larger than twice the necessary lower bound ("traditional accuracy"), hence OP is considerably suboptimal in this respect.
Survey on QoS Management of VoIP
Authors: Xiuzhong Chen, Chunfeng Wang, Dong Xuan, Zhongcheng Li, Yinghua Min, Wei Zhao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we present a survey on management mechanisms used for ensuring the Quality-of-Services for Voice-over-IP applications. We first address the motivations of QoS management for VoIP. We then partition the system into two management planes: data plane and control plane, and describe mechanisms in each plane respectively. In data plane, we cover several important techniques including packet classifier, buffer management, scheduling, loss recovery, and error concealment. In control plane, we describe admission control, resource provisioning, traffic engineering, and connection management etc. As we will see, admission control plays a critical role in QoS for VoIP. Thus, we will discuss methodologies used in admission control in detail. Specifically, we examine parameter-based and measurement-based admission control algorithms, and their use in VoIP. Finally, we discuss limitations of current technologies and future research issues in providing QoS to VoIP applications.
Global software piracy revisited
Authors: Seung Kyoon Shin, Ram D. Gopal, G. Lawrence Sanders, Andrew B. Whinston
Venue: Communications of the ACM (2004)

Determining why the roots of the disparity in national piracy levels lie beyond economics.
Application coordination infrastructure for ubiquitous computing rooms
Authors: Armando Fox
Venue:  (2003)

The common mode of interaction with a computer involves a single user using a mouse and keyboard in front of a single display. With the proliferation of mobile devices and the ability to embed large touch screens in workrooms, a new type of human computer interaction involving multiple machines and multiple people becomes possible. This research looks at the case of ubiquitous computing rooms, or interactive workspaces. These are device rich spaces where groups come together to collaborate on solving some problem. The nature of interaction in such a space will be with collections (or ensembles) of applications, and to date there is no clear model of how these applications should coordinate with one another at the application level. This dissertation addresses the need for a well-suited middleware infrastructure for application coordination in interactive workspaces. It consists of three main contributions. The first is a characterization of interactive workspaces and the requirements for a coordination infrastructure for such space. The second is the Event Heap coordination model, which is an extended version of the tuplespace model. It consists of a set of properties, of which the most key is decoupling applications to reduce interdependency and enhance failure tolerance, and a set of features that together define a coordination infrastructure suitable to the characteristics of interactive workspaces. The final contribution is a validation of the model through the development and use of a prototype implementation of the model in many interactive workspaces and applications over a three-year period and around the world. An evaluation of the validity of the model is also provided in the form of an overview of the applications and deployments, a survey of developers and administrators, and experimental measurement of the performance of the prototype implementation.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation).
Sink or Swim: Know When It's Time to Bail
Authors: Gordon Bell
Venue: Queue (2003)

There are endless survival challenges for newly created businesses. The degree to which a business successfully meets these challenges depends largely on the nature of the organization and the culture that evolves within it. That’s to say that while market size, technical quality, and product design are obviously crucial factors, company failures are typically rooted in some form of organizational dysfunction. To help investors recognize signs of trouble before catastrophe strikes, I started working more than a decade ago on the Bell-Mason Diagnostic, a quantitative evaluation method that includes a set of rules for examining a company and comparing it with an “ideal” organization.
A query scope agent for flood search routing protocols
Authors: John Sucec, Ivan Marsic
Venue: Wireless Networks (2003)

Flood-search on-demand routing has received considerable interest for its application to mobile ad hoc networks. To alleviate the effects of flooding the network with control packets to discover a route, the concept of an expanding ring search (ERS) has been proposed elsewhere for reducing the packet transmission overhead of the route discovery process. Essentially, ERS consists of incrementally increasing the allowable hop radius of the flood search until a route to the target node is returned. However, ERS incurs additional latency to successfully complete the route discovery procedure. This paper presents a query scope agent (QSA) that assists in the selection of an appropriate ERS. The QSA accepts as input, from the user or network application, a maximum allowable value for route discovery delay. The QSA then estimates network parameter values to determine an ERS approach that satisfies the delay requirement while reducing expected packet transmission overhead. Simulation results show that it successfully achieves this objective. Further, the QSA incurs little communication and computation overhead, and operates in a distributed and asynchronous fashion.
SmartKom: adaptive and flexible multimodal access to multiple applications
Authors: Norbert Reithinger, Jan Alexandersson, Tilman Becker, Anselm Blocher, Ralf Engel, Markus Löckelt, Jochen Müller, Norbert Pfleger, Peter Poller, Michael Streit, Valentin Tschernomas
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

The development of an intelligent user interface that supports multimodal access to multiple applications is a challenging task. In this paper we present a generic multimodal interface system where the user interacts with an anthropomorphic personalized interface agent using speech and natural gestures. The knowledge-based and uniform approach of SmartKom enables us to realize a comprehensive system that understands imprecise, ambiguous, or incomplete multimodal input and generates coordinated, cohesive, and coherent multimodal presentations for three scenarios, currently addressing more than 50 different functionalities of 14 applications. We demonstrate the main ideas in a walk through the main processing steps from modality fusion to modality fission.
Privacy protection by concealing persons in circumstantial video image
Authors: Suriyon Tansuriyavong, Shin-ichi Hanaki
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

A circumstantial video image should convey sufficient situation information, while protecting specific person's privacy information in the scene. This paper proposes a system which automatically identifies a person by face recognition, tracks him or her, and displays the image of the person in modified form such as silhouette with or without name, or only name in characters (i.e. invisible person). A subjective evaluation experiment was carried out in order to know how people prefer each modified video image either from observer or subject viewpoint. It turned out that the silhouette display with name list seems to be most appropriate from the balance between protecting privacy and conveying situation information in circumstantial video image.
Transforming quantities into qualities in assessment of software systems
Authors: G. Canfora, L. Cerulo, L. Troiano
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The assessment of software systems often requires to considertogether qualitative and quantitative aspects. Becauseof the different nature, measures belong to different domains.The main problem is to aggregate such information into aderived measure able to provide an overall estimation. Thisproblem has been traditionally solved trough the transformationof qualitative assessments into quantitative measures.Indeed, such a transformation implicitly assumes a conceptualequivalence between the terms quantitative and objectiveon one side, and qualitative and subjective on the otherside.An alternative approach is to consider logical aggregationmodels, able to infer the overall evaluation based on theassessment of individual attributes. This approach requiresan early transformation of quantitative measures in qualitativeassessments. Such a transformation is possible troughthe use of judgment functions. The aim of this paper is to introducethe judgment functions and to study their properties.
Circuit partitioning into small sets: a tool to support testing with further applications
Authors: S. Tragoudas, R. Farrell, F. Makedon
Venue: Proceedings of the conference on European design automation (1991)

We consider a general partitioning problem, namely, how to partition the elements of a circuit into sets of size less than a small constant, so that the number of nets which connect elements in different sets is minimized. One application is in the design for testability of VLSI chips and printed circuit boards [7, 8]. We consider two different versions of a bottom-up iterative improvement approach. In the first version we present an efficient heuristic. In an alternative version, we use the heuristic as a subroutine to an approximation (provably good) algorithm, to result in comparably good solutions. We compare both approaches with the familiar top-down approach which uses a well known bisection heuristic [5] as a subroutine. Our solutions outperform the top-down partitioning approach.
A framework for rapid development of multimodal interfaces
Authors: Frans Flippo, Allen Krebs, Ivan Marsic
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Despite the availability of multimodal devices, there are very few commercial multimodal applications available. One reason for this may be the lack of a framework to support development of multimodal applications in reasonable time and with limited resources. This paper describes a multimodal framework enabling rapid development of applications using a variety of modalities and methods for ambiguity resolution, featuring a novel approach to multimodal fusion. An example application is studied that was created using the framework.
The VISTA architecture: experiencing stories through virtual storytelling agents
Authors: Elizabeth Figa, Paul Tarau
Venue: ACM SIGGROUP Bulletin (2002)

VISTAs (Virtual Interactive Story Telling Agents) interact with users through natural language query/answer patterns derived from the analysis of narrative content developed from multimedia. This paper describes the rationale for agent development, their software components, and the overall architecture for VISTAs, which are used as a form of high-level dialog manager to provide information retrieval for educational and entertainment purposes.
On Biased Positional Games
Authors: Małgorzata Bednarska
Venue: Combinatorics, Probability and Computing (1998)

Let TBin(N, n, q) be the game on the complete graph KN in which two players, the Breaker and the Maker, alternately claim one and q edges, respectively. The Maker's aim is to build a binary tree on n<N vertices in n&minus;1 turns while the Breaker tries to prevent him from doing so. It is shown that, for every constant ε>0, there exists n0 such that, for every n&ge;n0, the Breaker has a winning strategy in TBin(N, n, q) if q>(1+ε)N&#x002F;logn, while, for q<(1&minus;ε)N&#x002F;logn, the game TBin(N, n, q) can be won by the Maker provided that n=o(N).
Six models for the social accountability of computing
Authors: Rob Kling
Venue: ACM SIGCAS Computers and Society (1978)

This paper briefly examines six public policy strategies for including the "social accountability of computing". "Social accountability" denotes ways of organizing computer specialists, organized groups that develop, manufacture, sell or use computer-based systems, and their markets, so that the broader public is well served. The six models which are examined here include:1. Market arrangements2. Administrative authority3. Professional control4. Regulatory commissions to administer legislative acts5. Judical enforcement and review of legislative acts6. Citizen actionEach is applicable to a different context in which computer-based services are provided. And collectively, they span the set of policy instruments available in liberal democracies. While these models have been extensively developed and examined in a variety of settings, their appropriateness for computing is usually tacitly assumed, rather than grounded in careful analyses. Upon close inspection, each model is found to have severe problems in either its practical effectiveness or its appropriateness for computing.
Sensory design for virtual environments
Authors: J. F. Morie, K. Iyer, K. Valanejad, R. Sadek, D. Miraglia, D. Milam, J. Williams, D. P. Luigi, J. Leshin
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The Sensory Environments Evaluation (SEE) Project seeks to formulate a new design methodology for virtual environments that utilize multiple sensory inputs to induce presence. Deviating from virtual reality's twenty-year focus on photo-realism, our "feels-real" design alternative aims directly at understanding the interdependencies of sensory stimuli in their creation of mental constructs, and the subsequent degree of realism perceived.
Test bench for software development of object-oriented processor
Authors: Ryan W. S. Yu, Gary K. W. Hau, Anthony S. Fong
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

HISC (High-level Instruction Set Computer) is proposed to provide hardware support for OOP. It applies the concept of object-orientation in the architecture and provides special instructions for object manipulation. An operating system is under developing for HISC. It divided into several modules by using the object-oriented paradigm. It includes some special modules for object-manipulation such as object management and garbage collection which traditional operating system do not support.In order to do the functional verification of each module, a test bench is needed. Its aims are to ease the effort to written the testing program and to simulate the working environment. It can make it easier to evaluate if an algorithm is suitable for HISC or not. In this paper, we discuss the design of the test bench. The architecture of the system will be described, together with the implementation of the modules and the pluggable modules architecture.
Intelligent neural network and fuzzy logic control of industrial and power systems
Authors: Ognjen Kuljaca
Venue:  (2003)

The main role played by neural network and fuzzy logic intelligent control algorithms today is to identify and compensate unknown nonlinear system dynamics. There are a number of methods developed, but often the stability analysis of neural network and fuzzy control systems was not provided. This work will meet those problems for the several algorithms. Some more complicated control algorithms included backstepping and adaptive critics will be designed. Nonlinear fuzzy control with nonadaptive fuzzy controllers is also analyzed. An experimental method for determining describing function of SISO fuzzy controller is given. The adaptive neural network tracking controller for an autonomous underwater vehicle is analyzed. A novel stability proof is provided. The implementation of the backstepping neural network controller for the coupled motor drives is described. Analysis and synthesis of adaptive critic neural network control is also provided in the work. Novel tuning laws for the system with action generating neural network and adaptive fuzzy critic are given. Stability proofs are derived for all those control methods. It is shown how these control algorithms and approaches can be used in practical engineering control. Stability proofs are given. Adaptive fuzzy logic control is analyzed. Simulation study is conducted to analyze the behavior of the adaptive fuzzy system on the different environment changes. A novel stability proof for adaptive fuzzy logic systems is given. Also, adaptive elastic fuzzy logic control architecture is described and analyzed. A novel membership function is used for elastic fuzzy logic system. The stability proof is proffered. Adaptive elastic fuzzy logic control is compared with the adaptive nonelastic fuzzy logic control. The work described in this dissertation serves as foundation on which analysis of particular representative industrial systems will be conducted. Also, it gives a good starting point for analysis of learning abilities of adaptive and neural network control systems, as well as for the analysis of the different algorithms such as elastic fuzzy systems.
Graphical models for iterative data detection
Authors: Keith M. Chugg
Venue:  (2002)

A graphical modelling is the art of system modelling originally developed in many areas, especially for inference problems in statistics and expert systems. Recently, the connection with decoding/detection algorithms in communications was discovered. Although this method is becoming prevalent tool in the coding community, it has received relatively little attention in many practical communication problems. In this thesis, graphical models are represented by junction graphs together with various types of message-passing algorithms (MPAs). The general sufficient conditions for well-defined marginalizing-combining operations of MPAs are proposed to account both continuous and discrete variables and three practical problems involving iterative data detection are considered. First, a full binary tree is introduced to the soft-input/soft-output (SISO) module in order to obtain a low-latency efficient parallel-processing implementation. In other words, the forward-backward-tree (FBT) SISO algorithm provides O(log 2 N) latency as opposed to O(N) latency from the standard forward-backward (FB) algorithm for the SISO module. Next, the general two-dimensional data detection is considered and is proven to be NP hard. Three types of loopy graphical models are investigated including the simple input-output (SIO) model, the serially concatenated (SC) model, and the novel grid model, along with standard and modified MPAs. Simulation results for the page-oriented optical memory system show that these iterative algorithms can provide near-optimal performance while the best performance can be obtained through the SC or grid models. Moreover, a reduced-complexity grid algorithm is proposed and applied to digital image halftoning with complexity and image quality comparable to the best techniques in the literature. Finally, the general structure of trellis-based reduced-state (RS) FB algorithms is proposed. This structured is described from ad hoc intuitive approach and then systematically developed based on the loopy overstructured graph (OSG) and a novel modified MPA. While maintaining the optimality in the absence of state reduction, the modified MPA provides a broad class of existing and novel practical RS-FB algorithms through applications of reduced-state techniques. Extensive numerical simulations are considered and it is demonstrated that in many cases the performance of RS-FB algorithms is close to that of the corresponding full-complexity algorithms.
Efficient use of code coverage in large-scale software development
Authors: Yong Woo Kim
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Due to the increasing growth in complexity and size of software being developed, and the nature of large-scale software development, performing code coverage analysis is not an easy task despite the benefits to quality improvement. Our goal is to find an efficient way to perform code coverage analysis for large industrial software systems using the results from defect distribution of previous releases and the release under current development. Empirical verification of several software metrics in large-scale software development were investigated to reduce efforts required for coverage analysis and to identify error-prone modules. The metrics examined were: • coarse coverage analysis versus detailed coverage analysis • block versus decision coverage • Pareto-like defect distribution by releases, and components • cyclomatic complexity versus defect and module size The results suggested that detailed coverage analysis of all modules is not desirable and it is not cost effective. Therefore, we present a systematic approach of coverage analysis based on the findings. It will minimize the amount of effort needed for coverage analysis while maximizing the possibility of catching bugs.