ppxscal/embedding_network huggingface dataset:
Fault Coverage and Fault Efficiency of Transistor Shorts using Gate-Level Simulation and Test Generation
Authors: Yoshinobu Higami, Kewal K. Saluja, Hiroshi Takahashi, Yuzo Takamatsu
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper proposes a theory of transistor short faults and their detection in logic test environment. We define transistor short models, and reveal the characteristics of equivalent faults and redundant faults. Also, we present a stuck-at fault simulation method and a test generation method that uses only the gate-level description of the circuits while dealing with transistor short faults. We present experimental results for ISCAS benchmark circuits to demonstrate the effectiveness of the methodology proposed in this paper.
Full tunable digital heterodyne IIR filters
Authors: K. E. Nelson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A new digital heterodyne filter is proposed that allows a prototype IIR or FIR filter to be shifted through the entire range of digital frequencies from DC to the Nyquist frequency. The unique properties of this new tunable filter are the range of tunability and the fact that all images created by the heterodyne process are cancelled. The proposed heterodyne filter is suitable both as a tunable filter and for use with standard adaptive algorithms to design adaptive digital filters-especially adaptive notch filters.
Dynamic Tree Bitmap for IP Lookup and Update
Authors: Sartaj Sahni, Haibin Lu
Venue: Proceedings of the Sixth International Conference on Networking (2007)

We propose a data structure-dynamic tree bitmap- for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tree bitmap is able to support updates at the same rate as lookups and is very competitive with other structures-tree bitmap and BaRT-proposed earlier for dynamic tables. Although the dynamic tree bitmap requires more memory than is required by the tree bitmap and BaRT structures, the required memory remains reasonable. The real value of our structure is its ability to support a very high update rate.
SkipNet: a scalable overlay network with practical locality properties
Authors: Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practice, such systems have two disadvantages: They provide no control over where data is stored and no guarantee that routing paths remain within an administrative domain whenever possible. SkipNet is a scalable overlay network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names. SkipNet allows for both fine-grained and coarse-grained control over data placement: Content can be placed either on a pre-determined node or distributed uniformly across the nodes of a hierarchical naming sub-tree. An additional useful consequence of SkipNet's locality properties is that partition failures, in which an entire organization disconnects from the rest of the system, can result in two disjoint, but well-connected overlay networks.
Automatic articulatory annotation of multi-sensor speech database
Authors: N. Parlangeau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Speech production is a complex process relying on coordinated gestures, but the acoustic signal does not depict its underlaying organization. Accepting that articulatory gestures are directly recognized through the coarticulation process, our proposal is to investigate the correlations between acoustic and articulatory information and to assess gestural phonetic theory. We present the framework for this investigation, the automatic labelling of the multi-sensor speech database ACCOR on French and English sentences.
New undergraduate and graduate degree programs in electrical power and control engineering
Authors: A. Zaky
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Because of the increasing complexity and advancements in all areas of the electrical power industry (generation, transmission, distribution, control, protection, reliability, economics, etc), there is a growing need for graduates to be specialists in the fields of power and control engineering. To meet such needs the Arab Academy for Science and Technology (AAST) has developed a new department of Electrical and Control Engineering which combines electric power systems, electric drives and automatic control in one degree program. This paper gives details of both undergraduate and graduate programs, which have been designed principally to meet the present day needs of industry and engineering utilities in developing and rapidly industrializing countries. In drawing up the curriculum the proposals of the IEEE Subcommittee on Power Engineering Curricula have been used as a guide and the undergraduate degree plan in particular is structured to meet the requirements of the Supreme Council for Universities of Egypt and ABET requirements.
Fanout Inference from Link Count
Authors: Cedric Fortuny, Olivier Brun, Jean-Marie Garcia
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

The traffic matrix is the fundamental input data in network planning, simulation and traffic engineering. However, it is often unknown and its direct measurement with devices such as Netflow is a too heavy process for large high-speed networks. The estimation of the traffic matrix from link counts appears as the best alternative approach. Recent works assume that prior information do not allow alone an accurate estimation of the traffic matrix so they are using Netflow measures to calibrate their model. These models assume spatial and temporal relations between different instants of measure. We show in this paper that we can obtain similar error rates without this costly calibration phase thanks to a spatial and temporal relation introduced in [6].
A 4 kbps adaptive fixed code-excited linear prediction speech coder
Authors: R. Heidari
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

We propose an adaptive fixed code-excited linear prediction (AF-CELP) speech coder operating at 4 kbps. By exploiting the fact that a fixed codebook contribution to the speech signal is also periodic as the corresponding adaptive codebook contribution, the adaptive fixed codebook model efficiently represents excitation signals. In order to overcome the quality degradation caused by the coarse quantization of excitation, a paired pulse algebraic codebook structure is also applied to the excitation model. Additionally, a pitch prefiltering, a noise spreading, and a harmonic enhancement technique are adopted in the decoding process. The spectrogram reading and informal listening tests proved that the AF-CELP reproduces high quality speech. 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
Interactive presentation: Feasibility of combined area and performance optimization for superscalar processors using random search
Authors: S. van Haastregt, P. M. W. Knijnenburg
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

When designing embedded systems, one needs to make decisions concerning the different components that will be included in a microprocessor. An important issue is the chip area vs. performance trade-off. In this paper we investigate the relationship between chip area and performance for superscalar microprocessors. We investigate the feasibility to obtain a suitable configuration by searching. We show that our approach gives a good configuration after 100 to 150 iterations using a simple random search algorithm. This shows the feasibility of our approach, in particular when more sophisticated search algorithms are employed as we plan in future work.
Fitted virtual shadow maps
Authors: Markus Giegl, Michael Wimmer
Venue: Proceedings of Graphics Interface 2007 (2007)

Too little shadow map resolution and resulting undersampling artifacts, perspective and projection aliasing, have long been a fundamental problem of shadowing scenes with shadow mapping. We present a new smart, real-time shadow mapping algorithm that virtually increases the resolution of the shadow map beyond the GPU hardware limit where needed. We first sample the scene from the eye-point on the GPU to get the needed shadow map resolution in different parts of the scene. We then process the resulting data on the CPU and finally arrive at a hierarchical grid structure, which we traverse in kd-tree fashion, shadowing the scene with shadow map tiles where needed. Shadow quality can be traded for speed through an intuitive parameter, with a homogenous quality reduction in the whole scene, down to normal shadow mapping. This allows the algorithm to be used on a wide range of hardware.
Worst Cases of a Periodic Function for Large Arguments
Authors: Guillaume Hanrot, Vincent Lefevre, Damien Stehle, Paul Zimmermann
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approximated by a polynomial. This is one of the last few issues that prevents from guaranteeing an efficient computation of correctly rounded transcendentals for the whole IEEE-754 double precision format. The first non-naive algorithm for that problem is presented, with a heuristic complexity of O(20.676p) for a precision of p bits. The efficiency of the algorithm is shown on the largest IEEE-754 double precision binade for the sine function, and some corresponding bad cases are given. We can hope that all the worst cases of the trigonometric functions in their whole domain will be found within a few years, a task that was considered out of reach until now.
A new algorithm for EEG feature selection using mutual information
Authors: M. Deriche
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

An EEG feature selection technique for the purpose of classification is developed. The technique selects those features that have maximum mutual information with the specified classes of interest (two classes in this case). Obviously, the simplest way is to consider all possible feature subsets (M out of N). However, even with a small number of features, this procedure is computationally impossible and can not be used in practice. Given the fact that most features used to represent the EEG signal are sets of features (such as AR parameters), our technique considers a trade off between computational cost and chosen feature combination. This contrasts other techniques which select features individually. The classification accuracy of features obtained by applying our technique outperforms those obtained by applying individual feature selection methods when applied to EEG signals.
Fire Simulation Model Based on Particle System and Its Application in Virtual Reality
Authors: Shumin Zhou, Yamin Sun, Ling Lu, Zhifeng Chen
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The occurrence and spread of the fire is a complicated and stochastic process. The paper introduce a fire simulation model based on the particle system and discussed the rule of occurrence and spread in the fire hazard. The fire particle system is implemented by VRML. In order to monitor the spread of the fire, a JAVA Applet is developed to show the fire data by External Authoring Interface. This model is adopted by the firefighting virtual reality system that used to help people find out the rule of the fire and defend the fire hazard.
Visual simulation of chemical gardens
Authors: X. Wei, F. Qiu, W. Li, S. Yoakum-Stover
Venue: Proceedings of the Computer Graphics International 2005 (2005)

We present a visualization and modeling system for the creation of chemical gardens. A chemical garden is a collection of plant-like structures formed when placing a soluble metal salt in an aqueous solution of sodium silicate. An accurate simulation of the chemical reaction of the metal salt and the physical behavior of the surrounding sodium silicate solution flow are complicated and time-consuming. Instead, in our system we use and propose a simplified 3D cellular automata (CA) approach to model the growing process of a chemical garden and its interaction with the solution flow. The input of our system is the shape and types of various soluble metal salts. Our program supports the visualization of the growth and formation of the chemical garden. The interactive rendering result on a texture mapping hardware also helps the user in observing and creating a desirable chemical garden.
Implementation and Evaluation Model for the Asynchronous Search Techniques: From a Synchronously Distributed System to an Asynchronous Distributed System
Authors: Ionel Muscalagiu, Hong Jiang, Popa Horia Emil
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The implementation of asynchronous search techniques can be done in any programming language allowing a distributed programming. Nevertheless, for the study of such techniques and for their evaluation, it is easier and more efficient to implement the techniques under certain distributed environments, which offer various facilities, such as NetLogo. The aim of this article is to introduce an as general as possible model of implementation and evaluation for the asynchronous search techniques in the two possible cases: synchronous and asynchronous. In the case of the synchronous model, a synchronization of the agents' execution is done after each computing cycle. This model, we believe, will allow the use of the NetLogo environment as a basic simulator for the study of asynchronous search techniques. This model can be used in the study of agents behavior in several situations, like the priority order of the agents, the behavior in the synchronous and asynchronous case and, therefore, leading to identify possible enhancements in the performances of asynchronous search techniques. A first set of experiments for two large families: the ABT family and the AWCS family, based on the two proposed models is presented in this article.
Combining description logic reasoning with ai planning for composition of web services
Authors: James Hendler
Venue:  (2006)

As Web Services become more prevalent---with the aim of achieving interoperability between heterogeneous, decentralized and distributed systems---the problem of selecting and composing services to accomplish a given task becomes more important. Using Web ontologies to describe different properties of Web Services provided by separate developers facilitates their integration. Automating the composition of Web Services is essential for various different subjects ranging from ordinary users performing tasks on the Web, businesses carrying out complex transactions, and scientists collaborating with each other on the computational Grid. In this thesis I present the HTN-DL formalism which combines Hierarchical Task Network (HTN) planning and Description Logics (DL) to automatically compose Web Services which are described with Web Ontology Language (OWL). The main contributions of this thesis are as follows: (1) The HTN-DL formalism, which couples Hierarchical Task Network (HTN) planning and Description Logics. HTN-DL combines the expressivity of Description Logics with the efficiency of HTN planning systems to solve Web Service composition problems. (2) A translation algorithm from the Semantic Web Service language OWL-S to HTN-DL. This translation algorithm shows that the control constructs used to describe the control flow of a Web Service workflow can be encoded in an HTN-DL domain. The translation also provides a semantics for OWL-S processes; and it is also shown that this semantics is compatible with the previously proposed Situation Calculusbased semantics of OWL-S. (3) Novel optimization techniques for DL reasoning which target nominals and large number of individuals. These optimization techniques allow the HTN-DL planner to efficiently reason with OWL-DL ontologies during planning. Our empirical analysis shows that these optimizations dramatically improve consistency checking, classification, and realization tasks. (4) Optimizations for conjunctive query answering w.r.t. DL knowledge bases. Inspired by some query optimization techniques used in relational databases, a cost-based model is presented to estimate the evaluation time of DL queries. (5) An implementation of the HTN-DL planning system that interacts directly with Web Services. The components of the planning system, OWL-DL reasoner Pellet and API for OWL-S services, are also released as stand-alone tools and have been incorporated into many systems.
A Reinforcement Learning Approach to Automatic Error Recovery
Authors: Qijun Zhu, Chun Yuan
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

The increasing complexity of modern computer systems makes fault detection and localization prohibitively expensive, and therefore fast recovery from failures is becoming more and more important. A significant fraction of failures can be cured by executing specific repair actions, e.g. rebooting, even when the exact root causes are unknown. However, designing reasonable recovery policies to effectively schedule potential repair actions could be difficult and error prone. In this paper, we present a novel approach to automate recovery policy generation with Reinforcement Learning techniques. Based on the recovery history of the original user-defined policy, our method can learn a new, locally optimal policy that outperforms the original one. In our experimental work on data from a real cluster environment, we found that the automatically generated policy can save 10% of machine downtime.
A Robust Class of Context-Sensitive Languages
Authors: Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines the operation on the stacks, and (b) any computation of the machine can be split into k stages, where in each stage, there is at most one stack that is popped. MVPLs are an extension of visibly pushdown languages that captures noncontext free behaviors, and has applications in analyzing abstractions of multithreaded recursive programs, signifi- cantly enlarging the search space that can be explored for them. We show that MVPLs are closed under boolean operations, and problems such as emptiness and inclusion are decidable. We characterize MVPLs using monadic second-order logic over appropriate structures, and exhibit a Parikh theorem for them.
Developing and implementing a successful research experience for undergraduates program: a roadmap designed by the Engineering Research Center for Particle Science and Technology
Authors: A. E. Donnelly
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Engineers recognize the importance of providing undergraduates with multidisciplinary research experiences as part of an engineering curriculum. The National Science Foundation (NSF) supports this endeavour through the Research Experience for Undergraduates (REU) Program. The NSF Engineering Research Center for Particle Science and Technology (ERC) at the University of Florida (UF) is committed to providing UF undergraduates with research opportunities, providing experiences to 350 students. The Center extended this program to non-UF students through the NSF REU program. Program goals include providing interdisciplinary laboratory experiences to undergraduates, improving student competence in a laboratory, and increasing the participation of women and minorities in engineering. The ERC has provided 30 students with a 10-week program for the past three years through the REU program and has developed a roadmap that can serve as a model to other institutions that would like to offer a similar program. This paper describes the program, from project selection, recruiting and logistics, to program management.
Improved First-Order Parameterized Statistical Timing Analysis for Handling Slew and Capacitance Variation
Authors: Ratnakar Goyal, Sachin Shrivastava, Harindranath Parameswaran, Parveen Khurana
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

With shrinking process node sizes, the inherent effect of process variations is playing an increasingly larger factor in defining the behavior of a circuit. Conventional static timing analysis (STA) using best case/worst case analysis (BCWC) is overly pessimistic in many cases, and could also be optimistic in some cases. This has resulted in the promotion of Statistical Static Timing Analysis (SSTA) as a method for estimating yield of a circuit in terms of timing activities. SSTA provides a robust and tractable framework where the variations of the process parameter space can be captured in one analysis and the results of the analysis can be used to predict the yield of the design (with respect to timing), along with other reports of interest such as the probability of a net being critical. A popular technique for SSTA is the first-order parameterized approach where sensitivities of the timing activities to process parameter variations are propagated through the circuit, and the probability distributions of timing activities are computed at points of interest based on these sensitivities. In this paper, we describe a methodology for taking into account the effect of input slew and output load sensitivities on path arrival sensitivities. In this paper we also describe how slew sensitivities can be propagated and provide analytical expressions for the same. We also provide experimental results to show the increase in accuracy obtained as compared with Monte-Carlo analysis.
A scalable, timing-safe, network-on-chip architecture with an integrated clock distribution method
Authors: Tobias Bjerregaard, Mikkel Bystrup Stensgaard, Jens Sparsø
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Growing system sizes together with increasing performance variability are making globally synchronous operation hard to realize. Mesochronous clocking constitutes a possible solution to the problems faced. The most fundamental of problems faced when communicating between mesochronously clocked regions concerns the possibility of data corruption caused by metastability. This paper presents an integrated communication and mesochronous clocking strategy, which avoids timing related errors while maintaining a globally synchronous system perspective. The architecture is scalable as timing integrity is based purely on local observations. It is demonstrated with a 90 nm CMOS standard cell network-on-chip design which implements completely timing-safe, global communication in a modular system.