ppxscal/embedding_network huggingface dataset:
Using test data to improve IC quality and yield
Authors: Anne Gattiker
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The complexity of interactions in today's manufacturing processes makes test structures and experiments inadequate as sole drivers of yield-learning and design-for-manufacturing [DfM]. They must be driven by product impact. Product-impact-oriented test-based learning provides insight into the nature of model-hardware mismatches and variability that exist on and impact real products. That insight can be used to drive both parametric and defect-oriented process actions and DfM.
Logic of knowledge and discovery via interacting agents - Decision algorithm for true and satisfiable statements
Authors: Vladimir Rybakov
Venue: Information Sciences: an International Journal (2009)

In this paper we study logical properties of the operation chance discovery (CD) via structures based on special Kripke/Hintikka models. These models use as bases partially ordered sets of indexes (indexes of steps in a computation, or ones indicating time points in a time flow), and clusters of states associated to each index. The language chosen to build the logical formulas includes modal/temporal operations, operations for the agents' knowledge, local and global operations for CD, operation of local common knowledge, and an operation for chance of discovery via agents' interactions. We introduce and study a logic (of knowledge and discovery via interaction of agents), LDK"a, which is defined by semantics, as the set of all formulas that are valid in all suggested models. The paper provides an algorithm to recognize logical laws (and satisfiable formulas) of LDK"a. The algorithm replaces a formula with a rule in a special, so-called reduced normal form, and, then it verifies the validity of this rule in specific models of exponential size in the size of the rule. We show that the problem of computing the true logical laws of LDK"a is decidable.
Circularity, composition, and decomposition results for pebble macro tree transducers
Authors: Zoltán Fülöp, Loránd Muzamel
Venue: Journal of Automata, Languages and Combinatorics (2008)

The pebble tree transducer is a model for XML query languages while the macro tree transducer is a well-known model for syntax-directed semantics. We consider their combination, called pebble macro tree transducer (using outside-in semantics). We define weakly circular, circular and strongly circular pebble macro tree transducers and show that each of these circularity problems for pebble tree macro transducers are decidable. We consider composition and decomposition of pebble macro tree transformations. We show that (1) every not weakly circular deterministic n-pebble macro tree transformation can be decomposed into a noncircular deterministic n-pebble tree transformation and a partial deterministic yield tree transformation and (2) every not weakly circular context-linear n-pebble macro tree transformation can be decomposed into a noncircular n-pebble tree transformation and a partial deterministic yield tree transformation. We use these results to give a partial solution to an open problem. Namely, we show that (1) the class of not weakly circular deterministic 0-pebble macro tree transformations is a subset of the two-fold composition of the class of noncircular deterministic 0-pebble tree transformations and (2) the class of not weakly circular context-linear 0-pebble macro tree transformations is a subset of the two-fold composition of the class of noncircular 0-pebble tree transformations. Finally, we show that the compositions of pebble tree transformations and yield tree transformations are pebble macro tree transformations.
Nutrient transport model in CHAHNIMEH manmade reservoirs
Authors: Seyyed Ahmad Mirbagheri, Seyyed Arman Hashemi Monfared
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

A Model for predicting nutrient transport to CHAHNIMEH reservoir is developed in this paper. Nitrogen and phosphorous have been simulated as the important parameters in evaluating water quality in the reservoir. Solar radiation and wind flow are considered in the model. Model uses mass balance equation to predict a one year period of changing concentrations. Results show the relative of different types of nitrogen to each other and similar behavior of phosphorous. Also results show the relative concentration of algal biomass with nitrogen and phosphorus changes in different times.
Large Scale Distributed Virtual Environments on the Grid: Design, Implementation, and a Case Study
Authors: Congfeng Jiang, Xianghua Xu, Jian Wan, Wanqing Li, Xindong You
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Distributed Virtual Environments (DVEs) are geographically distributed computing systems which allow multiple users to interact simultaneously in computer-generated, shared virtual environments. DVEs are widely applied in many fields, such as online role playing games, synthesis military simulations, virtual cities, and virtual shopping malls. To support large-scale DVEs with high fidelity and satisfied interactive performance among various distributed clients, massive computing resources, storage resources, and highly efficient distributed server architectures are needed. In this paper, the key techniques of the system design and implementation for large scale Distributed Virtual Environment on the Grid (DVE-G) are discussed and a hierarchical architecture of DVE-G is proposed. Some aspects of DVE-G, such as resource management, massive data management, scene synchronization, and fault-tolerance are also discussed. A work-in-progress DVE-G prototype (e.g., the Virtual Hangzhou Dianzi University tourism system) is provided as a testbed scenario and the present evaluation results show that the architecture of DVE-G is feasible and scales well.
An approach to the definition and implementation of a software development environment
Authors: James F. Elwell
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

During the past two decades, a marked increase in software costs has been seen. The ingredients are now present to define and implement a software development environment which provides an increase in programmer productivity. The methods used by TRW to identify the goals of such an environment and define the components of the environment are discussed. The resultant TRW Software Office Of The Future is presented and its current status given. Observations relevant to this process are made.
Triple selection diversity over exponentially correlated Nakagami-m fading channels desired signal and cochannel interference
Authors: Mihajlo Stefanovic, Dragana Krstic, Stefan Panic, Aleksandar Mosic
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In this paper, system performances of selection combining over correlated Nakagami-m channels are analyzed. Selection diversity based on the signal to interference ratio (SIR) is a very efficient technique that reduces fading and cochannel interference influence. Fading between the diversity branches and between interferers is correlated and Nakagami-m distributed with exponential correlation model. Very useful closed-form expressions for the output SIR's probability density function (PDF), cumulative distribution function (CDF), and outage probability are obtained, which is main contribution of this paper.
Overcoming controllability problems with fewest channels between testers
Authors: R. M. Hierons, H. Ural
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

When testing a system that has multiple physically distributed ports/interfaces it is normal to place a tester at each port. Each tester observes only the events at its port and it is known that this can lead to additional controllability problems. While such controllability problems can be overcome by the exchange of external coordination messages between the testers, this requires the deployment of an external network and may thus increase the costs of testing. The problem studied in this paper is finding a minimum number of coordination channels to overcome controllability problems in distributed testing. Three instances of this problem are considered. The first problem is to find a minimum number of channels between testers in order to overcome the controllability problems in a given test sequence to be applied in testing. The second problem is finding a minimal set of channels that allow us to overcome controllability problems in any test sequence that may be selected from the specification of the system under test. The last problem is to find a test sequence that achieves a particular test objective and in doing so allows fewest channels to be used.
Local proofs for global safety properties
Authors: Ariel Cohen, Kedar S. Namjoshi
Venue: Formal Methods in System Design (2009)

This paper explores locality in proofs of global safety properties of concurrent programs. Model checking on the full state space is often infeasible due to state explosion. A local proof, in contrast, is a collection of per-process invariants, which together imply the desired global safety property. Local proofs can be more compact than global proofs, but local reasoning is also inherently incomplete. In this paper, we present an algorithm for safety verification that combines local reasoning with gradual refinement. The algorithm gradually exposes facts about the internal state of components, until either a local proof or a real error is discovered. The refinement mechanism ensures completeness. Experiments show that local reasoning can have significantly better performance over the traditional reachability computation. Moreover, for some parameterized protocols, a local proof can be used as the basis of a correctness proof over all instances.
Topology optimization with optimality criteria and transmissible loads
Authors: G. Chiandussi, M. Codegone, S. Ferrero
Venue: Computers Mathematics with Applications (2009)

The paper describes how to take into consideration the presence of transmissible loads in a topology optimization method based on optimality criteria. The optimization problem has been defined as a total potential energy maximization problem with stress, displacement or stiffness constraints. The final volume of the optimal structural configuration has not to be specified a priori and is a consequence of the imposed structural constraints. The implementation of the proposed method is quite simple and leads to the identification of well defined optimal structures. The results obtained by solving several benchmark problems are shown.
Process Diagnostics: A Method Based on Process Mining
Authors: Melike Bozkaya, Joost Gabriels, Jan Martijn van der Werf
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

As organizations change, their information systems can evolve from simple systems to complex systems, which are hard to understand, and therefore hard to maintain or extend. Process mining can help organizations in trying to understand the information systems by analyzing the system.In this paper we propose a methodology to perform process diagnostics, based on process mining. Given an event log of an information system within an organization, process diagnostics gives a broad overview of the organization's process(es) within a short period of time. In the process diagnostics methodology, several perspectives of the process are highlighted. The outcome covers the control flow perspective, the performance perspective and the organizational perspective. We used the methodology on a case study for a Dutch governmental organization.
Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing
Authors: Ke-Ren Dai, Wen-Hao Liu, Yih-Lang Li
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The increasing complexity of interconnection designs has enhanced the importance of research into global routing when seeking high-routability (low overflow) results or rapid search paths that report wire-length estimations to a placer. This work presents two routing techniques, namely adaptive pseudorandom net-ordering routing and evolution-based rip-up and reroute using a two-stage cost function in a high-performance congestion-driven 2-D global router. We also propose two efficient via-minimization methods, namely congestion relaxation by layer shifting and rip-up and re-assignment, for a dynamic programming-based layer assignment. Experimental results demonstrate that our router achieves performance similar to the first two winning routers in ISPD 2008 Routing Contest in terms of both routability and wire length at a 1.42X and 25.84X faster routing speed. Besides, our layer assignment yields 3.5% to 5.6% fewer vias, 2.2% to 3.3% shorter wirelength and 13% to 27% less runtime than COLA.
Resource management and task partitioning and scheduling on a run-time reconfigurable embedded system
Authors: Radha Guha, Nader Bagherzadeh, Pai Chou
Venue: Computers and Electrical Engineering (2009)

There are many design challenges in the hardware-software co-design approach for performance improvement of data-intensive streaming applications with a general-purpose microprocessor and a hardware accelerator. These design challenges are mainly to prevent hardware area fragmentation to increase resource utilization, to reduce hardware reconfiguration cost and to partition and schedule the tasks between the microprocessor and the hardware accelerator efficiently for performance improvement and power savings of the applications. In this paper a modular and block based hardware configuration architecture named memory-aware run-time reconfigurable embedded system (MARTRES) is proposed for efficient resource management and performance improvement of streaming applications. Subsequently we design a task placement algorithm named hierarchical best fit ascending (HBFA) algorithm to prove that MARTRES configuration architecture is very efficient in increased resource utilization and flexible in task mapping and power savings. The time complexity of HBFA algorithm is reduced to O(n) compared to traditional Best Fit (BF) algorithm's time complexity of O(n^2), when the quality of the placement solution by HBFA is better than that of BF algorithm. Finally we design an efficient task partitioning and scheduling algorithm named balanced partitioned and placement-aware partitioning and scheduling algorithm (BPASA). In BPASA we exploit the temporal parallelism in streaming applications to reduce reconfiguration cost of the hardware, while keeping in mind the required throughput of the output data. We balance the exploitation of spatial parallelism and temporal parallelism in streaming applications by considering the reconfiguration cost vs. the data transfer cost. The scheduler refers to the HBFA placement algorithm to check whether contiguous area on FPGA is available before scheduling the task for HW or for SW.
The number of pessimistic guesses in Generalized Mastermind
Authors: Gerold Jäger, Marcin Peczarski
Venue: Information Processing Letters (2009)

Mastermind is a famous two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible. The code consists of 4 pegs, each of which is one of 6 colors. In Generalized Mastermind a general number p of pegs and a general number c of colors is considered. Let f(p,c) be the pessimistic number of questions for the generalization of Mastermind with an arbitrary number p of pegs and c of colors. By a computer program we compute ten new values of f(p,c). Combining this program with theoretical methods, we compute all values f(3,c) and a tight lower and upper bound for f(4,c). For f(p,2) we give an upper bound and a lower bound. Finally, combining results for fixed p and c, we give bounds for the general case f(p,c).
Affective Space Exploration for Impressionism Paintings
Authors: Cheng-Te Li, Man-Kwan Shan
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we explore the affective contents of Impressionism paintings. While past analysis of artworks concentrated on artistic concept annotation, like styles and periods, a more perceptual aspect is to investigate the emotions artists projected into. We propose affective space to fuse all affective factors from features. Since the combination of colors is more sensitive and intuitive to emotions, a meta-level feature, color harmony, is introduced to bridge the semantic gaps. By considering the correlation relationships among features and emotions, the affective space is explored through multiple-type latent semantic analysis. Experimental results show the effectiveness of harmonic feature and affective space via multi-label emotion annotation. Some potential applications are demonstrated based on affective space as well, including painting emotionalization and emotion-based slideshow system.
An elementary social information foraging model
Authors: Peter Pirolli
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

User interfaces and information systems have become increasingly social in recent years, aimed at supporting the decentralized, cooperative production and use of content. A theory that predicts the impact of interface and interaction designs on such factors as participation rates and knowledge discovery is likely to be useful. This paper reviews a variety of observed phenomena in social information foraging and sketches a framework extending Information Foraging Theory towards making predictions about the effects of diversity, interference, and cost-of-effort on performance time, participation rates, and utility of discoveries.
Combining predicate and numeric abstraction for software model checking
Authors: Arie Gurfinkel, Sagar Chaki
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Predicate (PA) and Numeric (NA) abstractions are the two principal techniques for software analysis. In this paper, we develop an approach to couple the two techniques tightly into a unified framework via a single abstract domain called NumPredDom. In particular, we develop and evaluate four data structures that implement NumPredDom but differ in their expressivity and internal representation and algorithms. All our data structures combine BDDs (for efficient propositional reasoning) with data structures for representing numerical constraints. Our technique is distinguished by its support for complex transfer functions that allow two way interaction between predicate and numeric information during state transformation. We have implemented a general framework for reachability analysis of C programs on top of our four data structures. Our experiments on non-trivial examples show that our proposed combination of PA and NA is more powerful and more efficient than either technique alone.
Evolutionary Antenna Design via Modified Normalized GT Algorithm
Authors: Yuanyuan Fan, Qingzhong Liang, Zhenhua Cai, Hui Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Jason Lohn and his workmates in NASA Ames Research Center have evolved an X-band antenna for NASA's Space Technology 5 (ST5) mission which is the first evolved hardware in space. However their approach did not put too much attention on the efficiency of the evolutionary algorithm. Owing to the flaw we employ GT Algorithm to tackle constraints and balance multi-objective via normalization which makes evolution more efficient. Moreover we adopt a kind of linear real-values code to describe the structure of antenna so that it is easier to carry out genetic operations and control the size of the antenna. We have evolved a wire antenna successfully via this approach and all the targets have been meted.
Practical UML Statecharts in C/C++, Second Edition: Event-Driven Programming for Embedded Systems, 2 edition
Authors: Miro Samek
Venue:  (2008)

Practical UML Statecharts in C/C++ Second Edition bridges the gap between high-level abstract concepts of the Unified Modeling Language (UML) and the actual programming aspects of modern hierarchical state machines (UML statecharts). The book describes a lightweight, open source, event-driven infrastructure, called QP that enables direct manual coding UML statecharts and concurrent event-driven applications in C or C++ without big tools.This book is presented in two parts. In Part I, you get a practical description of the relevant state machine concepts starting from traditional finite state automata to modern UML state machines followed by state machine coding techniques and state-machine design patterns, all illustrated with executable examples. In Part II, you find a detailed design study of a generic real-time framework indispensable for combining concurrent, event-driven state machines into robust applications. Part II begins with a clear explanation of the key event-driven programming concepts such as inversion of control (Hollywood Principle), blocking versus non-blocking code, run-to-completion (RTC) execution semantics, the importance of event queues, dealing with time, and the role of state machines to maintain the context from one event to the next. This background is designed to help software developers in making the transition from the traditional sequential to the modern event-driven programming, which can be one of the trickiest paradigm shifts. The lightweight QP event-driven infrastructure goes several steps beyond the traditional real-time operating system (RTOS). In the simplest configuration, QP runs on bare-metal microprocessor, microcontroller, or DSP completely replacing the RTOS. QP can also work with almost any OS/RTOS to take advantage of the existing device drivers, communication stacks, and other middleware. The accompanying website to this book contains complete open source code for QP, ports to popular processors and operating systems, including 80x86, ARM Cortex-M3, MSP430, and Linux, as well as all examples described in the book.*Focuses on core concepts rather than tools which are always changing allowing the reader to continue to use this information with various projects*Provides a complete, ready-to-use, open source software architecture for small and large embedded systems*Includes an extensive example using the ARM Cortex-M3 throughout the book highlighting issues programmers and architects encounter in everyday life
Multi agent system based service architectures for service level agreement in cellular networks
Authors: Nupur Giri, Siddharth Mundle, Arpita Ray, Shrikant Bodhe
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

To provide Service Level Agreement (SLA) in wireless cellular network the network provider needs to do resource management through call admission and channel allocation strategies. Also if the SLA is unsatisfactory it has to react rapidly to reinstate the promised quality of service (QoS), provide alternatives or do congestion control. Our Paper proposes two Multi Agent System based, Centralized and Distributed, Service Architectures for SLA management. We extend the SHUFFLE model by introducing Network Provider Cell Agent (NPCA) which works in collaboration with Network Resource Provider Agent. Dynamic Call Admission is implemented using NPCA - NPCA interaction to accommodate real time traffic. The Agent are implemented using open source Java Agent DEevelopment Framework (JADE). The results of Multi agent and Non agent based connection level parameters are compared to understand the overhead characteristics of the systems.