ppxscal/embedding_network huggingface dataset:
Signal Integrity - Simplified
Authors: Eric Bogatin
Venue:  (2003)

: The complete guide to understanding and designing for signal integrity Suitable for even non-specialists, Signal Integrity-Simplified offers a comprehensive, easy-to-follow look at how physical interconnects affect electrical performance. World-class engineer Eric Bogatin expertly reviews the root causes of the four families of signal integrity problems and offers solutions to design them out early in the design cycle. Coverage includes: * An introduction to signal integrity and physical design * A fundamental understanding of what bandwidth, inductance, and characteristic impedance really mean * Analysis of resistance, capacitance, inductance, and impedance * The four important practical tools used to solve signal integrity problems: rules of thumb, analytic approximations, numerical simulation, and measurements * The effect of the physical design of interconnects on signal integrity * Solutions that do not hide behind mathematical derivations * Recommendations for design guidelines to improve signal integrity, and much more Unlike related books that concentrate on theoretical derivation and mathematical rigor, this book emphasizes intuitive understanding, practical tools, and engineering discipline. Specially designed for everyone in the electronics industry, from electrical engineers to product managers, Signal Integrity-Simplified will prove itself an invaluable resource for helping you find and fix signal integrity problems before they become problems. ABOUT THE AUTHOR ERIC BOGATIN, Chief Technology Officer at GigaTest Labs, has over 23 years of experience in the microelectronics industry. Before joining GigaTest, he worked with AT T Bell Labs, Raychem Corporation, Sun Microsystems, and other leading microelectronics manufacturers. He received his B.S. degree in physics at MIT and his M.S. and Ph.D. degrees from the University of Arizona, Tucson, in 1980. Over the years, he has taught over 3,000 engineers and authored over 100 technical articles and books on signal integrity and interconnect design.
Numerical study of nonlinear ferromagnetic materials
Authors: Marián Slodiča, Ivan Cimrák
Venue: Applied Numerical Mathematics (2003)

We consider Maxwell's equations together with a nonlinear dissipative magnetic law described by Landau-Lifshitz-Gilbert equation. We suggest two new numerical schemes (linear and nonlinear) for a time discretization of the nonlinear equations describing a quasi-static electromagnetic field in a ferromagnetic material. Both are designed in such a way that they conserve the quantities natural for the continuous model. Assuming a bounded magnetic field we derive the error estimates for both approximation algorithms.
Curve Designing Using a Rational Cubic Spline with Point and Interval Shape Control
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A rational cubic C2 spline curve is described which has interval and point tension weights for manipulating the shape of the curve. The spline is presented in a local support basis form, and the effect of the weights on these representations is analyzed. Subsequently this work has been extended for the modeling of interpolatory curves through B-spline formulation.
Examples of Program Composition Illustrating the Use of Universal Properties
Authors: Michel Charpentier, K. M Chandy
Venue:  (1999)

This paper uses a theory of composition based on existential and universal properties. Universal properties axe useful to describe components interactions through shared variables. However, some universal properties do not appear directly in components specifications and they must be constructed to prove the composed system. Coming up with such universal properties often requires creativity. The paper shows through two examples how this construction can be achieved. The principle used is first presented with a toy example and then applied to a more substantial problem.
Merging Visible and Invisible: Two Camera-Augmented Mobile C-Arm (CAMC) Applications
Authors: N. Navab, A. Bani-Hashemi, M. Mitschke
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

This paper presents the basic concept of Camera- Augmented Mobile C-arm (CAMC) and a set of its possible applications. A CCD camera is attached to a mobile C-arm fluoroscopy X-ray system. Both optical and X-ray imaging systems are calibrated in the same coordinate system in an off-line process. The new system is able to provide X-ray and optical images simultaneously. This system was first used for on-line estimation of X-ray projection geometry for low cost mobile C-arms, which do not guarantee the reproducibility of their motion [8]. The CAMC framework has great potentials for medical augmented reality.In this paper we introduce two new CAMC applications. They are quite different and could be subject of two separate detailed papers for a medical conference. Here we only aim at briefly introducing these two new concepts to the Augmented Reality (AR) research community.The first application aims at merging video images with pre-computed tomographic reconstruction of 3D volume of interest. This is a logical continuation of our work on 3D reconstruction using a CAMC [8]. The second approach is a totally new CAMC design where using a double mirror system and an appropriate calibration procedure the X-ray and optical images are merged in real-time [1]. This new system enables the user to see optical image, X-ray image, or an augmented image where visible and invisible are combined in real-time.The paper is organized in two more or less independent sections describing each of the above. Experimental results are provided at the same time as the methods and apparatus are described for each section. 1 Overlay of pre-computed 3D reconstruction volume and optical images
An Indirect Control Method for Sustainable Society
Authors: Kouji Yokoyama, Takayuki Shiose, Toshibharu Taura
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Recently, we are attempting to solve environmental problems.However, the difficulty ofpredicting the behavior of a sustainable social system due to its very large and complexitymakes it difficult to realize effective methods of solving environmental problems.In thisstudy, a hierarchical model which is composed of a logistics layer and a decision layer isproposed, and an indirect control method of focusing on a tax is studied based on thismodel.The purpose of this study is to investigate the efficiency of indirect controlapproaches in the resources circulation system.Finally this paper discuss and conclude the effectiveness of indirect control method.
Active networking and the end-to-end argument
Authors: S. Bhattacharjee, K. L. Calvert, E. W. Zegura
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Active networking is the placement of user-controllable computing functionality in the switching nodes of a network. The end-to-end argument states that functions should be placed "in" the network only if they can be cost-effectively implemented there. We argue that active networking is a natural consequence of the end-to-end argument, because certain functions can be most effectively implemented with information that is only available inside the network. We propose a performance model for quantifying the benefit of implementing a particular functionality solely in the end system versus implementing it through a combination of end system and network support. We show how the model applies to specific services, including congestion control and reliable multicast.
A decision making procedure for collaborative planning
Authors: Timothy W. Rauenbusch, Barbara J. Grosz
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set includes the choice of recipes and parameters as well as the determination of responsibilities for each agent. This work formally defines a search problem with search operators that correspond to the team planning decisions. It defines rationality for a collaborative team and ensures that a team will abandon performance of a complex task if it is ultimately in its economic best interest to do so. The model respects the constraints on mental states specified by the SharedPlans theory of collaboration.
Cost of Software Design Diversity: An Empirical Evaluation
Authors: Karama Kanoun
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

This paper analyzes data related to working hours that have been recorded over seven years, during the development of a real-life software system. The software under consideration is composed of two diverse (dissimilar) units, called variants. The second variant is used for self-checking. The results of the two variants are compared: in case of agreement, the outputs of the principal variant are transmitted and in case of discrepancy an error is reported. For each development phase, we evaluate the cost overhead induced by the development of the second variant with respect to the cost of the principal variant, considered as a reference. The results show that the cost overhead varies from 25 % to 134 % according to the development phase.
Logarithmically scalable routing algorithms in large optical networks
Authors: Zhensheng Zhang, Duanyang Guo, A. Acampora
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

In this paper, we present three logarithmically scalable routing algorithms for very large optical networks. The algorithms are based on a hierarchical approach. Each algorithm requires a different amount of information to be stored at each node, and results in a different efficiency. The network capacity provided by each algorithm is compared with that provided by the global shortest path algorithm (which is not scalable). It is found that the network capacities of the three algorithms are almost the same as that of the global shortest path algorithm. For fixed routing algorithms, we use an approximate analysis from which the blocking probability at a fixed network load can iterately be obtained (we use call blocking probability as our quality objective and compare network capacity by observing the difference in the offered load which produces the same blocking probability). The approximate analysis is validated through simulation and is found to be very accurate. Scalable, quasi-dynamic routing algorithms are also studied. Numerical results show that, when the node-capacity is equal to the capacity of a single wavelength and the bandwidth required per call is large ( greater than 24% of the link capacity), the capacity provided by the quasi-dynamic routing algorithm is very close to that of an infinite capacity centralized switch (lowest possible call blocking caused exclusively by congestion on the finite capacity user input/output links, never by the switch fabric itself). In all the examples considered, the improvement of the quasi-dynamic routing algorithm over the fixed routing algorithm is significant.
Evaluating Architecture Implementation Alternatives Bsed on Adaptability Concerns
Authors: Mehmet Aksit, Bedir Tekinerdogan
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Software is rarely designed for ultimate adaptability, performance or reusability but rather it is a compromise of multiple considerations. Even for a simple architecture specification, one may identify many alternative implementations. This paper makes an attempt to depict the space of implementation alternatives of architectures, and to define rules for selecting them. The applicability of this approach is illustrated by means of a simple design problem.
Approximate Similarity Retrieval with M-trees
Authors: Giuseppe Amato, Fausto Rabitti, Pasquale Savino, Pavel Zezula
Venue:  (1998)

Motivated by the urgent needs to improve efficiency of similarity queries, approximate similarity retrieval is investigated in the environment of a metric tree index called the M-tree. Three different approximation techniques are proposed -- distinguishing in the principle how to give up the query precision for the sake of improved performance. Measures, able to quantify the improvements of performance efficiency and the quality of approximations are defined and the proposed approximation techniques tested on different synthetic and real-life files. The evidence obtained from the experiments confirms the initial hypothesis that a high quality approximated similarity search can be obtained at much lower cost than that which is needed to get the exact results. Future research directions as well as extensions of the proposed approximation techniques to the environments of other similarity search indexes are also discussed. Possible applications of the approach to practical data and index management problems are discussed. EMAIL:: savino@iei.pi.cnr.it
Region Segmentation via Deformable Model-Guided Split and Merge
Authors: Lifeng Liu, Stan Sclaroff
Venue:  (2000)

Abstract An improved method for deformable shape-based image segmentation is described. Image regions are merged together and/or split apart, based on their agreement with an a priori distribution on the global deformation parameters for a shape template. The quality of a candidate region merging is evaluated by a cost measure that includes: homogeneity of image properties within the combined region, degree of overlap with a deformed shape model, and a deformation likelihood term. Perceptually-motivated criteria are used to determine where/how to split regions, based on the local shape properties of the region group''s bounding contour. A globally consistent interpretation is determined in part by the minimum description length principle. Experiments show that the model-based splitting strategy yields a significant improvement in segmention over a method that uses merging alone.
The 'Logic Assurance (LA)' System - A Tool for Testing and Controlling Real-Time Systems
Authors: Ofer Shtrichman, Ron Goldring
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

The Logic Assurance System (LA) combines testing, debugging, monitoring and control of real-time systems. It is capable of improving system's reliability and development productivity. This is achieved by enabling the developer to describe parts of the specification with logic and temporal logic assertions. The assertions, which are written in the LA Language and describe parts of the specification, are automatically compared to the actual behavior of the system under development (SUD) and its environment. Information about the SUD's behavior is represented by informative events and states. This information is transferred to LA from different resources, including from inside the tested software, by using special directives inserted inside the code (an approach we call informative box). When an assertion is violated, an informative message is given so that bugs can be detected and focused on. In addition to the message, a user function can be called. This can be used for real-time control and monitoring either while testing the system or after it has already been launched (for example, when testing assertions regarding safety). The informative box method enables one to perform smart, pin-pointed tests and temporal tests, neither of which can be performed by using standard black-box techniques. This is why LA can assist in the testing and integration of real-time embedded systems, reactive systems, and particular, in the testing of multiprocessor systems running cooperative processes. It is anticipated that considerable time and effort can be saved by using LA throughout the development process. Moreover, it has the capability to detect erroneous situations that otherwise would be more difficult to notice, as was proven when used to handle several communication protocol simulations.
Designing a Computer-Aided-Learning Application Using Multimedia to Train Inexperienced Building Surveyors in Building Pathology
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Computer Aided / Assisted Learning (CAL) systems aim to provide learners with both a rich set of learning resources and tools to help them navigate through such structures. The advent of high quality graphics and multimedia has enabled learning styles that were previously impractical to be developed and supported by state of the art CAL systems. This paper will concentrate on how multimedia can be used as a Computer-Aided-Learning medium in training inexperienced Surveyors in Building Pathology.
A Constant Queue Partial Permutation Routing Algorithm for Cube-Connected-Cycles Multicomputer Systems
Authors: Gene Eu Jan, Albert Chao, Deron Liang, Ming-Bo Lin
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, a general routing paradigm is considered and then applied to the routing and partial permutation routing problems on CCC (n, 2 n) networks. The major idea of the general routing paradigm is based on the binary radix-sorting scheme in which each bit of keys (i.e., destination addresses) from MSB is separated in sequence until reached the LSB. The result is a sorted sequence. Based on this scheme, the partial permutation routing problem on CCC (n, 2 n) networks can be solved in O (n 2) time with O (1) buffers for each node, where n is the dimension of CCC (n, 2 n) networks.
Using dynamic proxy agent replicate groups to improve fault-tolerance in multi-agent systems
Authors: Alan Fedoruk, Ralph Deters
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Despite the considerable effort spent researching and developing multi-agent systems the actual number of deployed systems is still surprisingly small. One of the reasons for the significant gap between developed and deployed systems is their brittleness. Multi-agent systems are susceptible to all of the same faults as any distributed system, they lack centralized control components, which makes it difficult to detect and treat failures of individual agents, and the agents making up the system are social, thus risking fault-propagation These faults can impact system performance and lead to overall system failure. Multi-agent systems must be made more dependable before they will be deployed on a large scale. Using redundancy by replication of individual agents within a multi-agent system is one possible approach for improving fault-tolerance, and hence improving reliability and availability-two key components of dependability. Having a group of agents, a replicate group, act like an individual agent leads to increased complexity and system load, and it introduces new challenges to system construction. Using a message proxy, to handle communication for the group, and passive replication strategies effectively deals with the complexity and overhead issues. This paper presents an architecture for implementing agent replicate groups using a message proxy and passive replicate group management. Experimentation and application testing using an implementation of the architecture is presented. The architecture is demonstrated to be a viable technique for increasing dependability in multi-agent systems.
On a two-level finite element method for the incompressible Navier-Stokes equations
Authors: A. Nesliturk, L. P. Franca
Venue:  (2000)

We consider the Galerkin finite element method for the incompressible Navier-Stokes equations in two dimensions, where the finite-dimensional space(s) employed consist of piecewise polynomials enriched with residual-free bubble (RFB) functions. To find the bubble part of the solution, a two-level finite element method (TLFEM) is described and its application to the Navier-Stokes equation is displayed. Numerical solutions employing the TLFEM are presented for three benchmark problems. We compare the numerical solutions using the TLFEM with the numerical solutions using a stabilized method.
Criteria for Generating Specification-Based Tests
Authors: A Jefferson Offutt, Yiwei Xiong, Shaoying Liu
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

This paper presents general criteria for generating test inputs from state-based specifications. Software testing can only be formalized and quantified when a solid basis for test generation can be defined. Formal specifications of complex systems represent a significant opportunity for testing because they precisely describe what functions the software is supposed to provide in a form that can easily be manipulated. These techniques provide coverage criteria that are based on the specifications, and are made up of several parts, including test prefixes that contain inputs necessary to put the software into the appropriate state for the test values. The test generation process includes several steps for transforming specifications to tests. Empirical results from a comparative case study application of these criteria are presented.
Variational Analysis of Some Conjugate Gradient Methods
Authors: B D Szyld, B O Widlund
Venue:  (1989)

A number of conjugate gradient methods are considered for a class of linear systems of real algebraic equations. This class includes all symmetric and certain special nonsymmetric problems, which give rise to three-term recursions. All the algorithms are characterized variationally. This makes it possible to derive error estimates systematically in terms of certain polynomial approximation problems. Bounds are obtained, which are functions of the extreme eigenvalues of the basic iteration operator.
A Category Theoretic Analysis of Predicative Type Theory
Authors: Michael I. Schwartzbach
Venue:  (1986)

NOT AVAILABLE
Competition Graphs of Semiorders and the Conditions $C(p)$ and $C^*(p)$
Authors: Kim Suh-Ryung, Roberts Fred S.
Venue:  (2000)

Given a digraph $D$, its competition graph has the same vertex set and an edge between two vertices $x$ and $y$ if there is a vertex $u$ so that $(x,u)$ and $(y,u)$ are arcs of $D$. Motivated by a problem of communications, we study the competition graphs of the special digraphs known as semiorders. This leads us to define a conditions on digraphs called $C(p)$ and $C^*(p)$ and to study the graphs arising as competition graphs of acyclic digraphs satisfying conditions $C(p)$ or $C^*(p)$.
Internet-Based TSP Computation with Javelin++
Authors: Michael O. Neary, Peter Cappello
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Javelin++ is a Java-based infrastructure for Internet computing. This paper presents an extension of Javelin++ to solve the Traveling Salesman Problem (TSP), a computationally complex combinatorial problem. Javelin++'s piecework computational model is extended to support a branch-and-bound model that is applied to the TSP computation.This extension implements the pipelined RAM model of cache consistency. Like Javelin++'s piecework computational model, the underlying architecture of this branch-and bound model is based on clients and hosts coordinated by brokers.The paper presents: a branch-and-bound computational model, the implementation of a scalable task scheduler using distributed work-stealing, the design and implementation of fault tolerance and load balancing via eager scheduling, and the results of performance experiments which appear promising.The paper focuses on a scalable implementation of branch-and-bound (especially the ¿bound¿ part) on Inter-networked computers. Javelin++'s seamless integration of distributed work-stealing, bound propagation, and lazy, lightweight, eager scheduling is the principle contribution of this paper.