ppxscal/embedding_network huggingface dataset:
Generation of Hazard Identification Functions
Authors: Maria K. Michael, Spyros Tragoudas
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

We study the problem of identifying the complete set ofpairs of input patterns that can cause different types of hazardsto appear at a circuit line. A novel methodology toimplicitly identify all possible input configurations is proposed.The technique is based on a systematic derivationof the conditions for the occurrence of static and dynamichazards at a line, which are subsequently formulated asBoolean functions defined over variables representing theprimary input signals. Our experimental results demonstratethat the proposed approach is very promising andoutperforms existing approaches. In addition, they showthat a proposed solution for the decision problem of hazardexistence at a circuit line is very efficient.
On Coefficients of Powers of Functions
Authors: Daniele Gardy
Venue:  (1991)

We study the $n^{th}$ coefficient of a function $f(z)^d \psi(z)$ with real positive coefficients under the conditions that $d \rightarrow + \infty$ and $n=o(d)$.
Obstruction-Free Synchronization: Double-Ended Queues as an Example
Authors: Maurice Herlihy, Victor Luchangco, Mark Moir
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We introduce obstruction-freedom, a new nonblockingproperty for shared data structure implementations. Thisproperty is strong enough to avoid the problems associatedwith locks, but it is weaker than previous nonblockingproperties-specifically lock-freedom and wait-freedom-allowing greater flexibility in the design of efficient implementations.Obstruction-freedom admits substantially simplerimplementations, and we believe that in practice itprovides the benefits of wait-free and lock-free implementations.To illustrate the benefits of obstruction-freedom, wepresent two obstruction-free CAS-based implementations ofdouble-ended queues (deques); the first is implemented on alinear array, the second on a circular array. To our knowledge,all previous nonblocking deque implementations arebased on unrealistic assumptions about hardware supportfor synchronization, have restricted functionality, or haveoperations that interfere with operations at the opposite endof the deque even when the deque has many elements init. Our obstruction-free implementations have none of thesedrawbacks, and thus suggest that it is much easier to designobstruction-free implementations than lock-free and wait-freeones. We also briefly discuss other obstruction-freedata structures and operations that we have implemented.
Partial orders generalizing the weak order on Coxeter groups
Authors: Curtis D. Bennett, Rieuwert J. Blok
Venue: Journal of Combinatorial Theory Series A (2003)

We define a new family of partial orders generalizing the weak order on Coxeter groups called T-orders, where T is a set of reflections determining the covers in this order. We show that the Grassmann and Lagrange orders on the Coxeter groups of type An and Bn introduced by Bergeron and Sottile are in fact T-orders. These partial orders were used to compute certain products in the cohomology ring of the flag manifolds associated to the complex Chevalley groups of these types. We exhibit T-orders generalizing these orders to partial orders for the Coxeter groups of type Dn, E6, and E7.
A System for Automatic Recording and Prediction of Design Quality Metrics
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

We present recent extensions to METRICS [10] infrastructure that allow optimization of design processes at the flow level, rather than only at the individual tool level. As previously reported, METRICS infrastructure allows automatic recording of design and process information. Our extensions include (i) the collection of design flow information for use in flow optimization, and (ii) integration with datamining tools to allow automatic generation of design and flow QOR predictors. Our flow optimization experiments try to optimize incremental multilevel FM partitioner runs in an incremental (ECO-oriented) design flow. We also demonstrate QOR predictors that are generated automatically from the METRICS data warehouse by the Cubist datamining tool for industry placement, clock tree generation, and routing tools. 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
Supporting impact analysis: a semi-automated technique and associated tool
Authors: S. Barros, T. Bodhuin, A. Escudie, J. P. Queille, J. F. Voidrot
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The paper presents a technique, and associated tool, for supporting the analysis of the impacts of changes on software systems. The approach is to exploit the dependencies that exist within the software system to be modified, modelled as a graph of objects and links. Changes are modelled as events that are propagated upon the graph according to predefined propagation rules. To cover situations in which a deeper analysis is required, it is possible to define potential propagation rules; the impacts of such rules are then declared as potential and a human decision is required to check whether they are real or not. The associated tool encompasses a propagation engine, which implements the automatic propagation of impacts, and a set of user oriented features supporting the control of the propagation engine and providing an highly interactive user interface for analysing the results of the automatic propagation.
ABR service for applications with non-linear bandwidth utility functions
Authors: Zhiruo Cao, E. W. Zegura
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

An available bit rate (ABR) service allows applications to access a time-varying network capacity. In a basic ABR service the available network capacity is divided "fairly" amongst active connections, without regard to the utility that each application derives from the bandwidth allocation. The goal of this paper is to improve both the global and individual utility obtained by applications using ABR, as compared to standard max-min bandwidth allocation. The key to our novel ABR algorithm is to relax the requirement for short-term fair bandwidth allocation, allowing an allocation that trades bandwidth between applications to increase the overall utility. To increase the utility of each individual application, we also re-allocate the bandwidth on the usual ABR time interval. This re-allocation increases the long-term average utility obtained by each individual application; it also ensures that the longer term average bandwidth allocated to each application is equal to the max-min allocation.
An Introduction to ATM Networks
Authors: Harry G. Perros
Venue:  (2003)

:Asynchronous Transfer Mode (ATM) has revolutionized telecommunications, and has become an integral part of the networking infrastructure.This introductory well-structured text on ATM networks describes their development, architecture, congestion control, deployment, and signalling in an intuitive, accessible way. It covers extensive background information and includes exercises that support the explanations throughout the book.The networking expert Harry G. Perros explains ATM networks, including such hot topics as:ATM adaptation layer 2Quality of ServiceCongestion controlTag switching and MPLS (Multi-Protocol Label Switching)ADSL-based access networksSignallingPNNI (Private Network Node Interface)An Introduction to ATM Networks is a textbook for graduate and undergraduate students in electrical engineering and computer science as well as a reference work for networking engineers.
Accurate Solution of Weighted Least Squares by Iterative Methods
Authors: Elena Y. Bobrovnikova, Stephen A. Vavasis
Venue:  (1997)

We consider the weighted least-squares (WLS) problem with a very ill-conditioned weight matrix. Weighted least-squares problems arise in many applications including linear programming, electrnical networks, boundary value problems, and structures. Becuase of roundoff errors, standard iterative methods for solving a WLS problem with ill-conditioned wieghts may not give the correct answer. Indeed, the difference between the true and computed solution (forward error) may be large. We propose an iterative algorithm, called MINRES-L, for solving WLS problems. The MINRES-L method is the application of MINRES, a Krylov-space method due to Paige and Saunders, to a certain layered linear system. Using a simplified model of the effects of roundoff error, we prove that MINRES-L gives answers with small forward error. We present computational experiments for some applications.
The diameter of the generalized de Bruijn graph UG/sub B/(n,n(n/sup 2/+1))
Authors: L. R. Nochefranca, P. W. Sy
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, we shall show that the diameter of the generalized de Bruijn graph UG/sub B/(n, n(n/sup 2/+1)) is 4 for odd integer n/spl ges/3.
Investigation of the capacitance deviation due to metal-fills and the effective interconnect geometry modeling
Authors: Won-Seok Lee, Keun-Ho Lee, Jin-Kyu Park, Tae-Kyung Kim, Young-Kwan Park, Jeong-Taek Kong
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper, the influence of floating dummy metal-fillson interconnect parasitic is analyzed with the variationsof possible factors which can affect the capacitance.Recently proposed chip-level metal-fill modeling, replacingmetal-fill layer with effective high-k dielectric, hasbeen reviewed in detail. Using a systematized modelingflow, the property of the effective permittivity in the modeledgeometry is examined. Validation with the realistic3D structures clearly demonstrates the importance andcorrectness of the geometry modeling.
Question Answering in the Swedish Core Language Engine
Authors: Bjorn Gamback, Stefan Ljung
Venue:  (2001)

The paper describes how the Swedish Core Language Engine (S-CLE), a general-purpose natural-language processing system was extended to process questions posed to a Prolog database. Previous work on the S-CLE has included processing up to the level of quasi-logical form (QLF); here we address the problems encountered when extending that processing to ``pure'''' logical form (LF) and translating the logical forms into questions to the SNACK-85 reginal database. We also show how some natural-language answers were generated from the original question-QLFs and the answers obtained from the database.
Mechanical properties of fibre-reinforced high strength concrete
Authors: M. B. H. Emara, S. F. M. Abd Elnaby, H. Amin, M. A. El-Demirdash
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The increased use of high strength concrete in structural applications dictates the need to enhance its brittle behaviour under compressive and tensile loads. An experimental programme has been conducted to investigate the effects of introducing polypropylene fibres into higher strength concrete applications. Different fibre volume fractions were used in the study. Three types of concrete grades were cast. Uni-axial compressive and splitting cylinder tests were conducted. Longitudinal, transverse and volumetric strains were monitored and reported at different stress levels during testing. Material properties including peak compressive stresses for both cylinders and cubes, splitting cylinder tensile strengths, elastic moduli and Poisson's ratios were determined.The study revealed that polypropylene fibres significantly enhanced the tensile properties of higher strength concretes, increased the ductility under compressive loads, reduced transverse deformations however reduced the peak attainable strength under compressive loads. A model for calculating the tensile strength of concrete as a function of both the concrete grade and the fibre volume fraction has been developed. The model shows excellent agreement with the experimental results.
What Every Teacher Should Know About Media and Technology
Authors: Donna E. Walker Tileston
Venue:  (2003)

:Find out how media can work for each of the student modalities!This slipcase collection of 10 compact volumes offers a complete training curriculum for teachers that covers all required essentials for teacher induction, mentoring, and support programs. The collection can be used for teacher certification and re-certification programs, as well as for fast-track alternative certification programs. Additional highlights embedded within each individual volume include assessment pre-tests and post-tests; resources; and content about urban learners, making this training program ideal for preparing highly qualified teachers for today's challenging classrooms, particularly in urban areas. 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
Elicitation of user preferences for multi-attribute negotiation
Authors: Yutao Guo, Jörg P. Müller, Christof Weinhardt
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents that act on behalf of users in electronic negotiations need to elicit the required information about their users' preference structures. Based on a multi-attri\-bute utility theoretic model of user preferences, we propose an algorithm that enables an agent to learn the utility function with flexibility to accept several types of information for learning. The method combines an evolutionary learning with the application of external knowledge and local search. Empirical tests show that the algorithm provides a good learning performance.
Exploitation of Latency Hiding on the KSR1 Case Study: The Barnes Hut Algorithm
Authors: Chaitanya Tumuluri, Alok N. Choudhary
Venue:  (1994)

This study is aimed at examining the performance of dynamic, irregular and loosely synchronous class of applications on the KSR1 distributed shared memory COMA system. The Barnes-Hut tree based algorithm for simulating galactic evolution [1], was chosen as a representative of this class of applications. The performance measures include the overall time-stepping loop execution time, the efficacy of the scaling rules (EES and RCTS) proposed in [2] as well as the computational load balance achieved by the CostZone data partitioning scheme [1] under these scaling rules. We define notions of geographical locality, transfer locality flux and partition locality flux to explain the sources of remote memory accesses in the application. The contributions of our study include two runtime latency hiding techniques PST and PREFH proposed for the effective and automatic utilization of the poststore and prefetch instructions to hide the latencies of remote memory accesses. The architectural support assumed, compiler analysis required and code instrumentation schemes for the implementation of the PST and PREFH techniques are presented in this paper. We also examine the scalability of our schemes under the aforementioned scaling rules. These schemes were tuned for a 32k particle simulation size on a 112 processor configuration, producing a reduction of 30% in the overall loop execution time of the simulation. Further, a combination of the schemes, PREPST, produced an overall reduction of 50% in the loop execution time of simulation. These improvements were traced to a reduction in the problems of locality fluxes which arose as the application was scaled under the EES and RCTS rules/ Interestingly, the problems of locality fluxes manifested themselves as load imbalance conditions in the application. We found that our schemes did not scale too well under EES scaling, but produced appreciable reductions in execution timings under RCTS scaling. It needs to be emphasized that our work involved the study of a whole application and on a 128 processor KSR1 machine, as opposed to most other work reported to date which examine performances of computational kernels on 32 or 64 processor configurations only.
Reinforcement Learning in Multiagent Systems: A Modular Fuzzy Approach with Internal Model Capabilities
Authors: Mehmet Kaya, Reda Alhajj
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Most of the methods proposed to improve the learning ability in multiagent systems are not appropriate to more complex multiagent learning problems because the state space of each learning agent grows exponentially in terms of the number ofpartners present in the environment. In this paper, we propose a novel and robust multiagent architecture to handle these problems. The architecture is based on a learning fuzzy controller whose rule base is partitioned into several different modules. Each module deals with a particular agent in the environment and the fuzzy controller maps the input fuzzy sets to the output fuzzy sets thatrepresent the state space of each learning module and the action space, respectively. Also, each module uses an internal model table to estimate the action of the other agents. Experimental results show the robustness and effectiveness of the proposed approach.
Writer Adaptation Techniques in Off-Line Cursive Word Recognition
Authors: Alessandro Vinciarelli, Samy Bengio
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This work presents the application of HMM adaptation techniques to the problem of Off-Line Cursive Script Recognition. Instead of training a new model for each writer, one first creates a unique model with a mixed database and then adapts it for each different writer using his own small dataset.Experiments on a publicly available benchmark database show that an adapted system has an accuracy higher than 80% even when less than 30 word samples are used duringadaptation, while a system trained using the data of the single writer only needs at least 200 words (the estimate is a lower bound) in order to achieve the same performance as the adapted models.
Delegating responsibility in a multiagent process management system
Authors: John Debenham
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In a multiagent process management system the distribution of work is achieved by negotiated delegation of responsibility for sub-processes by one agent to another. The responsibility delegation mechanism is based on a combination of estimates for subjective and objective payoff measures. This leads to estimates of the probability that one agent is a better choice than another. The probability of delegating responsibility to an agent is then expressed as a function of these probability estimates. This apparently convoluted probabilistic method is easy to compute and gives good results in process management applications even when successive payoff measurements are unpredictably varied.
Finite-Valued Approximations of Product Logic
Authors: Stefano Aguzzoli, Brunella Gerla
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we shall propose a method for the reduction of the problem of decidability in prepositional infinite-valued Product Logic to suitably determined finite-valued approximating logic. In order to do so, functions associated with formulas of Product logic are defined and their properties are exploited.
Class-Based Proxy Server for Mobile Computers
Authors: Jongkuk Lee, Myungchul Kim, Hee Yong Youn, Yusik Hahm, Dongman Lee
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

The role of proxy server is very important for mobile computers, which is mainly distilling original multimedia data. Conventional proxy servers distil image files into a fixed size regardless of the display characteristics of target mobile computer. In the paper we propose an enhanced proxy server called 'class-based proxy' that provides a mobile computer with image files distilled according to its display class. Implementation with HTTP 1.0 reveals that the proposed proxy significantly improves the transmission speed of the existing proxy servers through customized distillation, and provides mobile computer users with a homepage at comparable speed and quality to desktop PCs. It also allows mobile computers of the same display class to share the cached files, which results in higher cache hit ratio and thus improved efficiency and scalability.
MCSA/MCSE .NET JumpStart, 1 edition
Authors: Lisa Donald
Venue:  (2003)

:Interested in a career as Microsoft networking professional but don't know where to begin? The MCSA and MCSE certifications from Microsoft are two of the hottest IT certifications around, and the MCSA/MCSE .NET JumpStart from Sybex will provide you with the solid foundation in computer and networking basics you'll need before embarking on a comprehensive study program. The JumpStart series was developed in response to requests from technical trainers seeking to ensure a level starting point for students in their classrooms. The author is an experienced Microsoft instructor who provides simple, tangible explanations to make the world of computers and networking accessible to newcomers to the IT field. You'll learn about microprocessors and memory, hardware configurations, internetworking protocols, and get an introduction to Microsoft's new .NET Server product. When you're done with this book, you'll be ready to face the challenges of MCSA and MCSE certification preparation.
Using hierarchical fuzzy behaviors in the RoboCup domain
Authors: Alessandro Saffiotti, Zbigniew Wasik
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

An important reason for the popularity of the behavior-based paradigm in autonomous robotics is the possibility to design complex robot behaviors in an incremental way. We propose a fuzzy hierarchical behavior-based architecture, in which rules and meta-rules are used in a uniform way at all levels of the control hierarchy. This architecture has been successfully used in a number of robots performing autonomous navigation tasks. In this paper, we show the use of hierarchical fuzzy behaviors to implement a set of navigation and ball control behaviors for a Sony four-legged robot operating in the RoboCup domain. We also show that the logical structure of the rules and the hierarchical decomposition simplify the design of very complex behaviors, like the "GoalKeeper" behavior.