ppxscal/embedding_network huggingface dataset:
FAST PARAMETERS EXTRACTION OF GENERAL THREE-DIMENSION INTERCONNECTS USING GEOMETRY INDEPENDENT MEASURED EQUATION OF INVARIANCE
Authors: Weikai Sun, Wei Hong, Wayne W Dai
Venue:  (1995)

Measured Equation of Invariance(MEI) is a new concept in computational electromagnetics. It has been demonstrated that the MEI technique can be used to terminate the meshes very close to the object boundary and still strictly preserves the sparsity of the FD equations. Therefore, the final system matrix encountered by MEI is a sparse matrix with size similar to that of integral equation methods. However, complicated Green''s function and disagreeable Sommerfeld integrals make the traditional MEI very difficult, if not impossible, to be applied to analyze multilayer and multiconductor interconnects. In this paper, we propose the Geometry Independent MEI(GIMEI) which substantially improved the original MEI method. We use GIMEI for capacitance extraction of general three-dimension VLSI interconnect. Numerical results are in good agreement with published data and those obtained by using FASTCAP from MIT, while GIMEI are generally an order of magnitude faster than FASTCAP with much less memory usage.
Segmentation of structures into planar elements: an error-tolerant computation method
Authors: S. P. Manikandan, B. Emmanuel
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A computer-based algorithm is developed to identify the planar segments in complex structures without the help of physical scale models and painstaking manual inspection. The methodology, based on planarity checks using a fourth order determinant, is complicated by errors in the structure data (of unknown magnitude and location) which require the incorporation of error models to make the algorithm error-tolerant. Novel error models are advanced and validated by applying the segmentation algorithm to three toy structures with data errors. The power of this error-tolerant algorithm is also illustrated by using it to segmentize a real off-shore structure.
On Riccati Equations and Reproducing Kernel Spaces
Authors: H. Dym
Venue:  (2000)

A class of finite dimensional reproducing kernel Krein spaces of vector valued rational functions \Mscr>sub<X>/sub< with an indefinite inner product that is defined in terms of a singular Hermitian matrix X is analyzed. It is shown that if X is positive semidefinite, then \Mscr>sub<X>/sub< is a reproducing kernel Hilbert space of the kind that originates in the work of L.&#x00A0;de Branges if and only if X is a solution of an associated Riccati equation and a certain invariance condition (which is automatically fulfilled in some cases) is met. Analogous conclusions are obtained for the case when X is Hermitian and \Mscr>sub<X>/sub< is a Krein space. 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
Collocation for Singular Perturbation Problems II
Authors: Uri Ascher, R. Weiss
Venue:  (1982)

We consider singularly perturbed linear boundary value problems for ODES, with variable coefficients, but without turning points. Convergence results are obtained for collocation schemes based on Gauss and Lobatto points, showing that highly accurate numerical solutions for these problems can be obtained at a very reasonable cost using such schemes, provided that appropriate meshes are used. The implementation of the numerical schemes and the practical construction of corresponding meshes are discussed. .br These results extend those of a previous paper which deals with systems with constant coefficients.
Highly non-linear encoders for Current Mode Multiple-Valued Logic
Authors: C. Clarke, Graham R. Nudd
Venue:  (1994)

This paper describes the use of highly non-linear encoders to provide low power Current Mode Multiple Valued Logic (CMMVL) circuits. A maximum function is shown, that consumes much less power than previously reported circuits. The encoding system is based upon using a single transistor between the encoder output and ground to provide a ''very negative'' signal that overrides any other connection to the output node.
The Application of Concurrent Object-Oriented Techniques to Reactive Systems
Authors: Dennis G. Kafura, Gregory R. Lavender
Venue:  (1992)

A language and system model combining concurrency, abstract communication and an object orientation offers several advantages in the design and implementation of large-scale reactive systems. An object-orientation captures the abstraction and variety of entities inhabiting the environment while the autonomy of actual entities is clearly reflected by expressions of concurrency in the program of the reactive system. Abstract communication is necessary to achieve data sharing among heterogeneous systems. However, attempts to design and implement a paradigm unifying these three features have encountered unexpected difficulties. These difficulties include the interference between concurrency control (synchronization) and inheritance, inadequate application-oriented communication abstractions, the absence of a useful model of exception handling for concurrent object-oriented applications, and the lack of a powerful and useful theory of computation based on asynchrony.
Constraint Satisfaction from a Deductive Viewpoint
Authors: Wolfgang Bibel
Venue:  (1987)

This paper reports the result of testing the author''s proof techniques on the class of constraint satisfaction problems (CSP). This experiment has been successful in the sense that a completely general proof technique turns out to behave well also for this special class of problems which itself has received considerable attention in the community. So at the same time the paper happens to present a new (deductive) mechanism for solving constraint satisfaction problems that is of interest in its own right. This mechanism may be characterized as a bottom-up, lazy-evaluation technique which reduces any such problem to the problem of evaluating a database expression typically involving a number of joins. A way of computing such an expression is proposed.
The Set Conceptual Model and the Domain Graph Method of Table Design
Authors: Paul C. Gilmore
Venue:  (1987)

A purely set-based conceptual model SET is described along with a specification/query language DEFINE. SET is intended for modelling all phases of database design and data processing. The model for an enterprise is its set schema, consisting of all the sets that are declared for it. The domain graph method of table design translates the set schema for an enterprise into a table schema in which each table is a defined user view declared as a set in DEFINE. But for one initial step, the method can be fully automated. The method makes no use of normalization. Two kinds of integrity constraints are supported in the SET model. Although these constraints take a simple form in the set schema for an enterprise, they can translate into referential integrity constraints for the table schema of a complexity not previously considered. The simplicity of the constraints supported in the SET model, together with the simplicity of the domain graph table design method, suggests that a conceptual view of an enterprise provided by the SET model is superior to the lower level data presentation view provided by the relational model.
A parallel genetic algorithm for optimizing morphological filters oninhomogenous workstation clusters
Authors: P. Kraft, Michael Nolle, Gerald Schreiber, S. Marshall, Hans Burkhardt
Venue:  (1995)

In this paper a modification of a standard parallel genetic algorithm (SPGA) is introduced which can be run efficiently on different types of parallel computers. The purpose of the algorithm is to find optimal morphological filters for grey scale image processing tasks. The structure of the developed General Parallel Genetic Algorithm (GPGA) is based on a new subpopulation model which uses an integral load balancing and soft synchronization mechanism. It is designed to lead to good parallelization efficiencies even on distributed workstation clusters with multi-user operating systems. This is especially important for user groups which have no access to massively parallel computers to speed up their algorithms. Run time results from tests on a massively parallel computer and a workstation cluster are shown.
Application Scheduling on the Information Power Grid
Authors: Dmitrii Zagorodnov, Francine Berman, Rich Wolski
Venue:  (2000)

One of the compelling reasons for developing the Information Power Grid (IPG) is to provide a platform for more rapid development and execution of simulations and other resource-intensive applications. However, the IPG will ultimately not be successful unless users and application developers can achieve execution performance for their codes. In this paper, we describe a performance-efficient approach to scheduling applications in dynamic multiple-user distributed environments such as the IPG. This approach provides the basis for application scheduling agents called {\bf AppLeS}. We describe the AppLeS methodology and discuss the lessons learned from the development of AppLeS for a variety of distributed applications. In addition, we describe an AppLeS-in-progress currently being developed for NASA''s INS2D code, a distributed "parameter sweep" application.
Conceptual architecture for the assessment and improvement of software maintenance
Authors: Félix García, Francisco Ruiz, Mario Piattini, Macario Polo
Venue: Enterprise information systems IV (2003)

The management of software processes is a complex activity due to the great number of different aspects to be considered. For this reason it is useful to establish a conceptual architecture which includes all the aspects necessary to be able to manage this complexity. The fundamental element in all conceptual architecture is constituted by meta-data, which, organized in different levels of modeling, can be used to manage effectively the complexity of the software processes and especially the maintenance process (Pigosky, 1996). In this study we present a conceptual architecture of 4 levels to represent and manage the assessment and improvement of software process by means of the definition of the appropriate models and meta-models. This architecture is based on the standard MOF (Meta object Facility) proposed by the Object Management Group (OMG,2000). In particular this architecture includes all the necessary aspects for carrying out the assessment and improvement of the Software Maintenance Process (SMP) and allows us to represent the different data and meta-data used in its management by means of the modeling of concepts at different levels of abstraction: meta-models of generic processing, models of software processes, concrete software processes (in our case, that of the assessment of other processes) and instances of carrying out a specific process. As a support to this architecture we present MANTIS- Metamod, a tool for the modeling of software processes based on the concepts discussed previously. MANTIS- Metamod is a component of MANTIS, an integral environment for the management of the SMP, including its assessment and improvement.
Paraperspective ? Affine
Authors: R. Basri
Venue:  (1994)

It is shown that the set of all paraperspective images with arbitrary reference point and the set of affine images of a 3-D object are identical. Consequently, all uncalibrated paraperspective images of an object can be constructed from a 3-D model of the object by applying an affine transformation to the model and every affine image of the object represents some uncalibrated paraperspective image of the object. It follows that the paraperspective images of an object can be expressed as linear combinations of any two non-degenerate images of the object. When the image position of the reference point is given the parameters of the affine transformation (and, likewise, the coefficients of the linear combinations) satisfy two quadratic constraints. Conversely, when the values of parameters are given the image position of the reference point is determined by solving a bi-quadratic equation.
The ambient wood journals: replaying the experience
Authors: Mark J. Weal, Danius T. Michaelides, Mark K. Thompson, David C. DeRoure
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

The Ambient Wood project aims to facilitate a learning experience using an adaptive infrastructure in an outdoor environment. This involves sensor technology, virtual world orchestration, and a wide range of devices ranging from hand-held computers to speakers hidden in trees.Whilst performing user trials of the Wood, the activities of children participating in the experiments were recorded in detailed log files. An aim of the project has been to replay these log files using adaptive hypermedia techniques to enable the children to further reflect on their experience back in the classroom environment.
Strategies and Techniques: Reusable Artifacts for the Construction ofDatabase Management Systems
Authors: Andreas Geppert, Klaus R. Dittrich
Venue:  (1995)

Abstraction, selection, and integration of reusable artifacts are still open problems in reuse-based software construction. We investigate how these problems can be solved for one sample domain of system software: database management systems.
Towards Distributed Object Design
Authors: U. Uzun
Venue:  (1998)

Today''s object-oriented (OO) software development methodologies use a number of graphical notations in analysis and design stages. There is an increasing research interest in incorporating distribution issues into these development methods. Allocation of objects and tasks, object replication and migration, remote interactions, multiple threads of control as well as network topologies are important issues in distributed object systems. In this report, ways to add distribution related issues to the object-oriented design methods (especially UML based methods) are discussed. 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 Theory of Multi-Scale, Curvature- and Torsion-Based Shape Representation for Space Curve
Authors: Farzin Mokhtarian
Venue:  (1990)

This paper introduces a novel and new multi-scale shape representation technique for space curves which satisfies several criteria considered necessary for any shape representation method. This property makes the representation suitable for tasks which call for recognition of a noisy curve at any scale or orientation. \n The method rests on the concept of describing a curve at varying levels of detail using features that are invariant with respect to transformations which do not change the shape of the curve. Three different ways of computing the representation are described in this paper. These three methods result in the following representations: the curvature and torsion scale space images, the renormalized curvature and torsion scale space images, and the resampled curvature and torsion scale space images. \n The process of describing a curve at increasing levels of abstraction is referred to as the evolution of that curve. Several evolution properties of space curves are described in this paper. Some of these properties show that evolution is a physically plausible operation and characterize possible behaviours of space curves during evolution. Some show that the representations proposed in this paper in fact satisfy the required criteria. Others impose constraints on the location of a space curve as it evolves. Together, these evolution properties provide a theoretical foundation for the representation methods introduced in this paper.
Evaluating Emerging Software Development Technologies: Lessons Learned from Assessing Aspect-oriented Programming
Authors: Gail C. Murphy, Robert J. Walker, Elisa L.A. Baniassad
Venue:  (1998)

Two of the most important and most difficult questions one can ask about a new software development technique are whether the technique is useful and whether the technique is usable. Various flavours of empirical study are available to evaluate these questions, including surveys, case studies, and experiments. These different approaches have been used extensively in a number of domains, including management science and human-computer interaction. A growing number of software engineering researchers are using experimental methods to statistically validate hypotheses about relatively mature software development aids. Less guidance is available for a developer of a new and evolving software development technique who is attempting to determine, within some cost bounds, if the technique shows some usefulness. We faced this challenge when assessing a new programming technique called aspect-oriented programming. To assess the technique, we chose to apply both a case study approach and a series of four experiments because we wanted to understand and characterize the kinds of information that each approach might provide when studying a technique that is in its infancy. Our experiences suggest some avenues for further developing empirical methods aimed at evaluating software engineering questions. For instance, guidelines on how different observational techniques can be used as multiple sources of data would be helpful when planning and conducting a case study. For the experimental situation, more guidance is needed on how to balance the precision of measurement with the realism necessary to investigate programming issues. In this paper, we describe and critique the evaluation methods we employed, and discuss the lessons we have learned. These lessons are applicable to researchers attempting to assess other new programming techniques that are in an early stage of development.
The Shortest Disjunctive Normal Form of a Random Boolean Function
Authors: Nicholas Pippenger
Venue:  (2001)

The Shortest Disjunctive Normal Form of a Random Boolean Function Nicholas Pippenger This paper gives a new upper bound for the average length l(n) of the shortest disjunctive normal form for a random Boolean function of n arguments, as well as new proofs of two old results related to this quantity. We consider a random Boolean function of n arguments to be uniformly distributed over all 2^{2^n} such functions. (This is equivalent to considering each entry in the truth-table to be 0 or 1 independently and with equal probabilities.) We measure the length of a disjunctive normal form by the number of terms. (Measuring it by the number of literals would simply introduce a factor of n into all our asymptotic results.) We give a short proof using martingales of Nigmatullin''s result that almost all Boolean functions have the length of their shortest disjunctive normal form asymptotic to the average length l(n). We also give a short information-theoretic proof of Kuznetsov''s lower bound l(n) <= (1+o(1)) 2^n / log n log log n. (Here log denotes the logarithm to base 2.) Our main result is a new upper bound l(n) >= (1+o(1)) H(n) 2^n / log n log log n, where H(n) is a function that oscillates between 1.38826... and 1.54169.... The best previous upper bound, due to Korshunov, had a similar form, but with a function oscillating between 1.581411... and 2.621132.... The main ideas in our new bound are (1) the use of Ro"dl''s "nibble" technique for solving packing and covering problems, (2) the use of correlation inequalities due to Harris and Janson to bound the effects of weakly dependent random variables, and (3) the solution of an optimization problem that determines the sizes of "nibbles" and larger "bites" to be taken at various stages of the construction.
Organization of Smooth Image Curves at Multiple Scales
Authors: David G. Lowe
Venue:  (1989)

While edge detection is an important first step for many vision systems, the linked lists of edge points produced by most existing edge detectors lack the higher level of curve description needed for many visual tasks. For example, they do not specify the tangent direction or curvature of an edge or the locations of tangent discontinuities. In this paper, a method is presented for describing linked edge points at a range of scales by selecting intervals of the curve and scales of smoothing that are most likely to represent the underlying structure of the scene. This multi-scale analysis of curves is complementary to any multi-scale detection of the original edge points. A solution is presented for the problem of shrinkage of curves during Gaussian smoothing, which has been a significant impediment to the use of smoothing for practical curve description. The curve segmentation method is based on a measure of smoothness minimizing the third derivative of Gaussian convolution. The smoothness measure is used to identify discontinuities of curve tangents simultaneously with selecting the appropriate scale of smoothing. The averaging of point locations during smoothing provides for accurate subpixel curve localization. This curve description method can be implemented efficiently and should prove practical for a wide range of applications including correspondence matching, perceptual grouping, and model-based recognition.
Whiggism in Computer Science: Views of the Field
Authors: John A. N. Lee
Venue:  (1992)

The teaching of any science is not complete without the inclusion of those elements that constitute the foundations of the field. While the history of computing is an element of those fundamentals in computer science, history should not be taught merely as a diversion from the technology but as a series of case studies supporting scholarship from ethics to virtual reality. Understanding the successes of the field provides only a biased view of the technology and hides the true nature of pioneers; understanding failures provides direction and guidance, and occasionally new insights that were ahead of their time and whose time has come. 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
Eliminating Virtual Function Calls in C++ Programs
Authors: Gerald Aigner, Urs Holzle
Venue:  (1996)

We have designed and implemented an optimizing source-to-source C++ compiler that reduces the frequency of virtual function calls. This technical report describes our preliminary experience with this system. The prototype implementation demonstrates the value of OO-specific optimization of C++. Despite some limitations of our system, and despite the low frequency of virtual function calls in some of the programs, optimization improves the performance of a suite of two small and six large C++ applications totalling over 90,000 lines of code by a median of 20% over the original programs and reduces the number of virtual function calls by a median factor of 5. For more call-intensive versions of the same programs, performance improved by a median of 40% and the number of virtual calls dropped by a factor of 21. Our measurements indicate that inlining does not necessarily lead to large increases in code size, and that for most programs, the instruction cache miss ratio does not increase significantly.