ppxscal/embedding_network huggingface dataset:
Elimination of false aggressors using the functional relationship for full-chip crosstalk analysis
Authors: Jae-Seok Yang, Jeong-Yeol Kim, Joon-Ho Choi, Moon-Hyun Yoo, Jeong-Taek Kong
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

As the portion of coupling capacitance increases insmaller process geometries, accurate coupled noiseanalysis is becoming more important in current designmethodologies. We propose a method to determinewhether aggressors can potentially switch simultaneouslywith the victim or not. The functional information is usedto classify the aggressors. Our functional pruningalgorithm inspects the conflict of the net states usingCNF(Conjunction Normal Form) and BDD(BinaryDecision Diagram). We present the experimental resultson several industrial circuits. In the experiments, 6.4% oftotal aggressors are false and the accuracy of delaycalculation can be improved up to 36.6%.
Chromatic Index Critical Graphs of Orders 11 and 12
Authors: Gunnar Brinkmann, Eckhard Steffen
Venue:  (1997)

A chromatic-index-critical graph $G$ on $n$ vertices is non-trivial if it has at most $\Delta \lfloor \frac{n}{2} \rfloor$ edges.
NC Algorithms for Computing the Number of Perfect Matchings in $K_{3,3}$-free Graphs and Related Problems
Authors: Vijay V. Vazirani
Venue:  (1987)

We show that the problem of computing the number of perfect matchings in $K_{3,3}$-free graphs is in $NC$. This stands in striking contrast with the #P-completeness of counting the number of perfect matchings in arbitrary graphs. As corollaries we obtain $NC$ algorithms for checking if a given $K_{3,3}$-free graph has a perfect matching and if it has an EXACT MATCHING. Our result also opens up the possibility of obtaining an $NC$ algorithm for finding a perfect matching in $K_{3,3}$-free graphs.
Reconfigurable Fast Memory Management System Design for Application Specific Processors
Authors: S. Kagan Agun, Morris Chang
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents the design and implementationof the new Active Memory Manager Unit (AMMU)designed to be embedded into System-on-Chip CPUs. Theunit is implemented using VHDL in Field ProgrammableGate Array (FPGA) technology. The modified buddy system is used as the hardware algorithm for memory management. The RISC compatible open-source CPU isdeployed with the memory management unit to demonstrate the feasibility of implementation. The results indicate that the proposed AMMU achieves high performancein memory allocation and deallocation for software systems.
Partial Translation
Authors: Peter Magnusson
Venue:  (1993)

Traditional simulation of a target architecture by interpreting object code can be improved by translating the object code to an intermediate format. This approach is called interpretive translation. Despite a substantial performance improvement over traditional interpretation, a large part of the overhead is unnecessary. An alternative approach is block translation, where one or more simulated instructions are translated to directly executable code. This approach has several drawbacks. We discuss the problems with block translation, analyse the overhead of interpretive translation, and describe a hybrid approach-partial translation-that combines the benefits of both approaches. Partial translation implements an intermediate format that supports the addition of run-time generated code whenever appropriate. The perfor- mance limit (slowdown) of interpetive translation is around 15, and real implementations have achieved 20-30. Partial translation will perform considerably better. Finally, we present results from an aggressive implementation of interpretive translation, and results from a proof-of-concept implementation of partial translation.
Multiconnection over multichannels
Authors: Ming Chen, N. D. Georganas
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Studies a multiconnection problem, in multichannel networks and proposes an effective multiconnection protocol for establishing and releasing connections with dynamic bandwidth requirement. Each originating station in the network is allowed to set up connections to several terminating stations, and send packets to these terminating stations in different slots in a TDM fashion. Similarly, each terminating station is allowed to keep connections with several originating stations, and receive packets from these originating stations in different slots in a TDM fashion. Effective slot allocation schemes for multiple connections at the same station, as well as conditions for strict-sense acceptance and rearrangeable acceptance are given.
Recognizing Safety and Liveness
Authors: Bowen Alpern, Fred B. Schneider
Venue:  (1986)

Formal characterizations for safety properties and liveness properties are given in terms of the structure of the Buchi automaton that specifies the property. The characterizations permit a property to be decomposed into a safety property and a liveness property whose conjunction is the original. The characterizations also give insight into techniques required to prove a large class of safety and liveness properties.
Typability is Undecidable for F+Eta
Authors: J. B. Wells
Venue:  (1996)

Abstract System F is the well-known polymorphically-typed lambda calculus with universal quantifiers. F+eta is System F extended with the eta rule, which says that if term M can be given type tau and M eta-reduces to N , then N can also be given the type tau. Adding the eta rule to System F is equivalent to adding the subsumption rule using the subtyping (containment) relation that Mitchell defined and axiomatized [Mit88]. The subsumption rule says that if M can be given type tau and tau is a subtype of type sigma, then M can be given type sigma. Mitchell''s subtyping relation involves no extensions to the syntax of types, i.e., no bounded polymorphism and no supertype of all types, and is thus unrelated to the system "F-sub". Typability for F+eta is the problem of determining for any term M whether there is any type tau that can be given to it using the type inference rules of F+eta. Typability has been proven undecidable for System F [Wel94] (without the eta rule), but the decidability of typability has been an open problem for F+eta. Mitchell''s subtyping relation has recently been proven undecidable [TU95,Wel95b], implying the undecidability of "type checking" for F+eta. This paper reduces the problem of subtyping to the problem of typability for F+eta, thus proving the undecidability of typability. The proof methods are similar in outline to those used to prove the undecidability of typability for System F, but the fine details differ greatly.
Efficient damage assessment and repair in resilient distributed database systems
Authors: Peng Liu, Xu Hao
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

Preventive measures sometimes fail to defect malicious attacks. With cyber attacks on data-intensive applications becoming an ever more serious threat, intrusion tolerant database systems are a significant concern. The main objective of intrusion tolerant database systems is to detect attacks, and to assess and repair the damage caused by the attacks in a timely manner such that the database will not be damaged to such a degree that is unacceptable or useless. This paper focuses on efficient damage assessment and repair in resilient distributed database systems. The complexity of distributed database systems caused by data partition, distributed transaction processing, and failures makes damage assessment and repair much more challenging than in centralized database systems. This paper identifies the key challenges and presents an efficient algorithm for distributed damage assessment and repair.
Using Run-Time Data for Program Comprehension
Authors: Thomas Gschwind, Johann Oberleitner, Martin Pinzger
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Traditional approaches for program comprehension use static program analysis or dynamic program analysis in the form of execution traces. Our approach, however, makes use of runtime-data such as parameter and object values. Compared to traditional program comprehension techniques, this approach enables fundamentally new ways of program analysis which we have not seen so far. Reflection analysis which allows engineers to understand programs making use of reflective (dynamic) method invocations is one such analysis. Another is object tracing which allows engineers to trace and track the use of a given instance of a class within the program to be understood. In this paper, we present these techniques along with a case study to which we have applied them.
Xml a Traves de Ejemplos
Authors: Abraham Gutierrez Rodriguez, Raul Martinez
Venue:  (2002)

:Este libro cubre las tecnologias basadas en el lenguaje XML que se utilizan mayoritariamente para la creacion de sitios Web. Se explica el lenguaje XML y su relacion con HTML. El lenguaje XSL es utilizado para mostrar de forma grafica los documentos XML y poder asi crear paginas Web dinamicas que muestren contenidos XML; tambien se incluyen capitulos sobre SAX y DOM, tecnologias que nos permiten manejar los documentos XML desde distintos enfoques o modos de trabajo. Para poder crear aplicaciones Web profesionales es necesario conocer y combinar las diversas tecnologias de programacion de paginas Web. Los sitios Web mas potentes y vistosos combinan el dinamismo e interactividad que proporcionan las paginas Web dinamicas en cliente con la increible capacidad para la transmision de contenidos que nos permite XML, dotando de esta manera de informacion "util" al sitio Web, que permite a las computadoras "conocer" la informacion que manejan y actuar en consecuencia. Con el fin de facilitar el aprendizaje de estas materias, se proporciona una gran cantidad de ejemplos de programacion convenientemente ilustrados y presentados ordenadamente segun su grado de dificultad. De hecho, todos los capitulos contienen una cantidad adecuada de ejemplos practicos que el usuario podra probar utilizando el CD-ROM proporcionado en el libro para comprender, a medida que se van leyendo, las explicaciones incluidas en cada apartado.
Computional Learning of Languages
Authors: Shyam Kapur
Venue:  (1991)

This thesis focuses on the Gold model of inductive inference from positive data. There are several aspects in which the model appears unsatisfactory for language learning: the class of families of learnable languages is highly restricted; even if a family is learnable, there exists no uniform method to obtain a learner for it, and the learner itself is complex. In this thesis, some such criticisms are being addressed. It is shown that no automatic synthesis of a learner from the description of a learnable family is possible. Nevertheless, in some special cases, this synthesis can be achieved and a general result is developed. In order to make the learner simpler, it is stipulated that the learner can change its guess only when the guess is inconsistent with the input evidence. Such a conservative learner never overgeneralizes. Exactly learnable families are characterized for prudent learners with the following types of constraints: (0) conservative, (1) conservative and consistent, (2) conservative and responsive, and (3) conservative, consistent and responsive. It is also shown that, when exactness is not required, prudence, consistency and responsiveness, even together, do not restrict the power of conservative learners. Conservative learners are simple in only one respect; even though it is easy to determine when to make a new guess, it is still hard to know what this guess should be. Finally, a learner that exploits pattern evident in the input is developed. Absence of a particular string over a suitable interval of the input can be viewed as a kind of ``indirect negative evidence''''. Now, the learning criterion needs to be weakened to allow limited failure. It is shown that any family of languages can be learned with probability 1 from stochastic input, provided something is known about the probability distribution according to which the input is presented. Given the family, the learner is uniformly constructible. Further, the behavior of the learner is simpler in many aspects. It is expected that a variety of other natural constraints can be imposed on this learner without additional cost.
Semirigidity Problems in k -Valued Logic
Authors: Masahiro Miyakawa
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

The study of semirigid sets arose from the classification of bases. In this complex problem - fully solved only for |A| = 2; 3 - one of the tasks is to find all minimal nontrivial intersections of systems of maximal clones. Most of the clones are determined by reflexive relations (binary or of higher arities) and so we need to determine subsets R of these relations such that every function preserving all relations in R is either constant or is a projection. In this paper we give a short overview of this problem for 1) isotone relations, 2) central relations and 3)quasi-linear relations. Finally we add some new results for 4) autodual clones.
Preventive Maintenance! Do We Know What It Is?
Authors: Mira Kajko-Mattsson
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Inconsistency exists within the software community surrounding the understanding of and the adherence to the IEEE definition of preventive maintenance, due to congruence between the IEEE definitions of perfective and preventive maintenance. A panel debate is advocated to discuss the definition and current state of preventive maintenance practice.
Fuzzy Decision Diagrams for the Representation, Analysis and Optimization of Rule Bases
Authors: K. Strehl, C. Moraga, K.-H. Temme, R. Stankovic
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

When no expert knowledge is available, fuzzy if-then rules may be extracted from examples of performance of a system. For this, an a priori decision on the number of linguistic terms of the linguistic variables may be required. This may induce a ¿rigid granularity¿, usually finer than that actually required by the system. Fuzzy Decision Diagrams are introduced as an efficient data structure to represent fuzzy rule bases and to systematically check their completeness and consistency. Moreover, if the hypothesis of rigid granularity holds, reordering of the variables of a Fuzzy Decision Diagram may lead to a compacter and more precise rule base. The concept of reconvergent subgraphs is introduced to support the search for effective reorderings.
A Semi-Formal Approach to Assist Software Design with Reuse
Authors: William C. Chu, C. P. Hsu, C. W. Lu, Xudong He
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Design with reuse has been accepted as a cost- effective way to software development. Software reuse covers the process of identification, representation, retrieval, adaptation, and integration of reusable software components. In this paper, we propose a semi-formal approach to software reuse. The approach consists of the following major steps: (1) software components are annotated with formal information, (2) the software components are then translated into predicate transition nets, and (3) consistency checking of the reusable and new components is carried out using the reachability analysis technique of predicate transition (PrT) nets. The approach is demonstrated through an example.
Color Correction for Avid Xpress DV 3.5
Venue:  (2002)

:As a serious filmmaker, you need to ensure that the color and lighting in each frame of your movie looks consistent and achieves the mood you want to convey. If you're using Avid Xpress DV 3.5 to edit your footage, but you've yet to master the software's color correction features, you need Color Correction for Avid Xpress DV 3.5. Based on the one-day course taught by Avid's own Authorized Education Centers, this official step-by-step guide shows you how to color correct video frames in Avid Xpress DV 3.5 by taking you through the three stages of color correction: restoring the original look of each shot, achieving shot-to-shot consistency, and creating a final look. In the process, you'll learn how to use video scopes—which graphically display color information about individual frames in a sequence—to achieve brightness and color levels that are within safe limits for broadcast, attain a good level of contrast, correct color casts, and match brightness and color in consecutive shots in a program. By the end of this short course, you'll be able to analyze an image for color correction problems using scopes, color correct segments in a program, adjust color for an entire program, and check that levels are within broadcast limits. A companion CD-ROM (Windows XP and Mac OS X compatible) includes the project and media files used in the book so you can get started using your new skills immediately. 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
A Survey on Testing Technique Empirical Studies: How Limited is our Knowledge
Authors: N. Juristo, A. M. Moreno, S. Vegas
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Engineering disciplines are characterised by the use of mature knowledge by means of which they can achieve predictable results. Unfortunately, the type of knowledge used in software engineering can be considered to be of a relatively low maturity, and developers are guided byreasoning based on intuition, fashion or market-speak rather than by facts or undisputed statements proper to an engineering discipline. This paper analyses the maturity level of the knowledge about testing techniques by examining existing empirical studies about these techniques. For this pu1pose, three categories of knowledge of increasing maturity have been presented and the results of these empirical studies have been placed in these three categories.
Segmentation of Brazilian Bank Check Logos without a Priori Knowledge
Authors: Andreia de Jesus, Jacques Facon
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper presents a method to locate and extract Brazilian bank check logos automatically by employing mathematical morphology. The objective is to minimize the number of heuristic parameters to obtain the most precise possible segmentation in every situation, thereby allowing this approach to be reused in other applications. Trials and results are presented.
Microsoft .NET and J2EE Interoperability Toolkit
Authors: Simon Guest
Venue:  (2003)

Bridge the gap between the Microsoft .NET Framework and Java 2 Enterprise Edition (J2EE) by implementing the best interoperability solutions available today-and by learning to build compatible solutions and workarounds of your own.
Group communication protocol for flexible distributed systems
Authors: H. Higaki, M. Takizawa
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

In large-scale distributed systems, the processes have to be upgraded to absorb the changes of user requirements and system environments. The system cannot be kept available by the conventional upgrading methods because multiple processes have to be suspended simultaneously. This paper discusses a new method where each process can invoke asynchronously the upgrading procedure. The key idea is that multiple versions of processes can be operated temporarily. Each pair of an old-version process and a new-version one are managed as one process group. The group communication protocol proposed supports the message transmission among the process groups. Moreover, the protocol detects protocol errors caused by the co-existence of multiple versions of processes. A checkpoint-rollback algorithm for resolving the protocol errors is proposed. By using the algorithm, the minimum number of processes are rolled back asynchronously. Hence, the system is highly available even if protocol error occurs.
Towards a Formal Semantics for an Integrated SA/RT & Z Specification Language
Authors: Dirk Scholz, Carsta Petersohn
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

On the one hand we consider in industry widely used Structured Analysis and Real-Time Methods (SA/RT). Their specifications are intuitively readable but often semi-formal. On the other hand we consider the formal specification language Z. Using Z for the specification of data and data processing leads already to an improvement of SA/RT methods. In this paper, we extend this integration by new features. Moreover, we give the main ideas for a formal semantics which models the dynamic behavior the system. This semantics adopts main principles of synchronous languages. This is illustrated by a simplified version of the game PacMan.
Visualising class cohesion with virtual worlds
Authors: Neville Churcher, Warwick Irwin, Ron Kriz
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

High cohesion, or module strength, indicates that a system has been well partitioned into components which have strong internal relationships. An understanding of cohesion is an important factor in software design. However, cohesion is difficult to define precisely and to quantify, particularly for object oriented (OO) software, and attempts to develop metrics have had limited success. We advocate the use of visualisation techniques to provide a richer view of cohesion than is possible with simple numeric values. Our approach, based on visualising the raw data, side-steps many of the difficulties associated with the formulation of precise definitions of cohesion phenomena, avoids the loss of information associated with existing aggregate cohesion metrics and supports exploratory analysis. The pipeline-based visualisations of class cohesion described in this paper use the ANGLE 3D graph layout engine and XSLT transformations both to select the ingredients for visualisations and to determine their presentation details. We discuss our experiences with the use of virtual worlds as a presentation medium both on the desktop and in immersive environments and report early results from ongoing empirical work.
Learn to Program with C#
Authors: John Smiley
Venue:  (2002)

:Sit down and join the lively classroom discussion occurring throughout this unique book for beginners. The tutorial classroom experience will show you why Professor Smiley is renowned for making learning fun and easy. Pencils up!
Distributed Manufacturing Architecture
Authors: Koichi Kishimoto
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Distribute Manufacturing Architecture is an implementation of ADS for factory automation which has been developed and maintained by a technical committee at MSTC/JOP in Japan. Its broadcast-type protocol enhances ease of construction, fault tolerance and maintainability of systems. MDA protocol is understood as observer pattern in the design-pattern point of view. The committee released second version of MDA protocol to enhance flexibility of message syntax. 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