ppxscal/embedding_network huggingface dataset:
Study for Fusion of Different Sources to Determine Relevance
Authors: Chi-Hung Chi, Chen Ding, Kwok-Yan Lam
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The relevance of a web document could be measured not only by its text content, but also by some other factors such as the link connectivity, the usage pattern. In previous data fusion researches, the text is the only source to determine the relevance, and just the different runs (e.g. by different retrieval models, different query or document representations) on this same source are combined. It is the purpose of this paper to investigate whether the different sources could be combined to determine the relevance with a better accuracy than any single source. We conducted a preliminary experiment to test its feasibility and effectiveness and obtained a positive result.
Fail-Safe PVM: A Portable Package for Distributed Programming with Transparent Recovery
Authors: Juan Leon, Allan L. Fisher, Peter Steenkiste
Venue:  (1993)

Many scientific problems benefit from computations that are parallel at a coarse grain. Collections loosely-coupled, heterogeneous computers are increasingly being applied to these problems. While individual computers are designed to be relatively reliable, a collection of several autonomous machines necessarily has a greater rate of failure. As data networks improve, and larger multicomputers are being used, rates of failure will increase. PVM (Parallel Virtual Machine) is a popular software framework that facilitates message-passing network programming. We present enhancements to PVM to mask fail-stop, single-node failures from the application. Fail-safe PVM uses checkpoint and rollback to recover from such failures. Both checkpoints and rollbacks are transparent to the application if the application does not depend on real-time events. Recovery occurs without wait for repair of the failed computer. The system does not rely on shared stable storage and does not require modifications to the operating system. We describe the design and implementation of fail-safe PVM, present measurements of checkpoint costs, and briefly discuss shortcomings and potential avenues for improvement.
A New Method for Solving Systems of Nonlinear Equations in Circuit Simulation
Authors: James Wilkes
Venue:  (1994)

\newcommand{\nlem}{{\sl NlEm}} % nlem, name of method \newcommand{\cz}{{\em CAzM}} % CAzM Efficient analog simulation of integrated circuits continues to be an important step in the design of integrated circuits. The heart of this simulation is solving systems of nonlinear equations that are derived from a description of the circuit. Most of the current solvers for these systems are based on Newton-type methods with enhancements for dealing with the convergence problems that these methods are known to encounter. However, current solvers continue to experience convergence difficulties. In this study, we introduce a new technique for dealing with one of the convergence problems that damped Newton methods encounter. The method is motivated by problems in which the convergence of a damped Newton method is initially slow with no evidence of ill-conditioning or singularity. The new method is termed \nlem\ (en-lem), short for nonlinear elimination. Issues relevant to the implementation of the algorithm in the context of circuit simulation are discussed. This discussion is based on an implementation of \nlem\ in the circuit simulator \cz. \nlem\ is then compared to the damped Newton solver currently used in \cz. Using a variety of circuit examples, the comparison shows improved convergence behavior using \nlem. The study concludes by developing a general nonlinear solver that uses a heuristic to combine \nlem\ with a damped Newton method. The technique used to combine the methods simply monitors the rate of convergence and switches to a new solve method when convergence is deemed slow. Despite the simplicity of this approach, results show that the new solver compares favorably with the existing solver in \cz.
Communication-efficient algorithms on reconfigurable array of processors with spanning optical buses
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attention from the research community. By taking advantage of the unique properties of optical signal transmissions, the RASOB provides flexible reconfiguration and strong connectivities with low hardware and control complexities. In this paper, we first discuss the reconfiguration methods and communication capabilities of this architecture. Then, we demonstrate the power of this architecture, RASOB, through efficient implementation of fundamental parallel algorithms namely semi-group computations and Gaussian eliminations.
Representation and Visualization of Terrain Surfaces at Variable Resolution
Authors: Paolo Cignoni, Enrico Puppo, Roberto Scopigno
Venue:  (1996)

We present a new approach for managing the representation of discrete topographic surfaces at variable resolution, which is based on a unified model encoding a history of either refinement or simplification of a triangulation decomposing a plane domain. An efficient data structure is pro-posed, which is obtained by interpreting the model containing all triangles of the history as a cell complex embedded in three-dimensional space. A major feature of the model is the ability to pro-vide efficiently a representation of the surface at resolution variable over the domain, according to an application-dependent threshold function. Experimental results on real world data are pre-sented, and applications to flight simulation are discussed. EMAIL:: r.scopigno@cnuce.cnr.it
Efficient and provable security amplifications
Authors: Ronald J.F. Cramer, Torben P. Pedersen
Venue:  (1995)

Even, Goldreich and Micali showed at Crypto''89 that the existence of signature schemes secure against known message attacks implies the existence of schemes secure against adaptively chosen message attacks. Unfortunately, this transformation leads to a rather impractical scheme. We exhibit a similar security amplification, which takes the given scheme to a new signature scheme that is not even existentially forgeable under adaptively chosen message attacks. Additionally, however, our transformation will be practical: The complexity of the resulting scheme is twice that of the original scheme. The principles of both transformations carry over to block encryption systems. It is shown how they can be used to convert a block encryption system secure against known plaintext attacks to a system secure against chosen plaintext attacks. For both schemes it is shown that if the transformed scheme can be broken given a number, $T$, of encryptions of adaptively chosen plaintexts, then the original scheme can be broken given encryptions of $T$ uniformly chosen plaintexts. In this case, however, the application of the technique of Even, Goldreich and Micali leads to the more efficient scheme. The transformed scheme has the same key length as the original, and ciphertexts are doubled in length. As an example, when applied to DES the transformed scheme is secure against differential cryptanalysis, which relies on the ability to get encryptions of plaintext pairs with proper differences.
Analyzing Statistical Timing Behavior of Coupled Interconnects Using Quadratic Delay Change Characteristics
Authors: Tom Chen, Amjad Hajjar
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

With continuing scaling of CMOS process, process variationsin the form of die-to-die and within-die variations become significantwhich cause timing uncertainty. This paper proposes amethod of analytically analyzing statistical behavior of multiplecoupled interconnects with an uncertain signal arrival time ateach interconnect input (aggressors and the victim). The methodutilizes delay change characteristics due to changes in relative arrivaltime between an aggressor and the victim. The results showthat the proposed method is able to accurately predict delay variationsthrough a coupled interconnect.
EMI Common-Mode Current Dependence on Delay Skew Imbalance in High Speed Differential Transmission Lines Operating at 1 Gigabit/second Data Rates
Authors: J. L. Knighten, N. W. Smith, L. O. Hoeft, J. T. DiBene Ii
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

EMI-related common-mode currents in a high-speed differential transmission line circuit can be generated by delay imbalance (skew) at a rate almost directly proportional to the amount of skew imbalance. Delay skew was shown to generate common-mode currents at a rate of four times that of slew rate skew. Radiated EMI levels were shown to follow increasing common-mode currents. Attention to delay skew imbalance should be an important design consideration at the chip level, the transmission line level and at the load in order to produce high-speed differential circuits with low emission characteristics. While models using idealized waveforms predict common-mode waveform harmonics that include only even harmonics, measurements with real devices indicate the presence of all harmonics due to waveform asymmetries such as duty cycle distortion and rise/fall time asymmetries.
DESIGN, FABRICATION, AND CHARACTERIZATION OF SINGLE CRYSTAL SILICON LATCHING SNAP FASTENERS FOR MICRO ASSEMBLY
Authors: Rama Prasad, Karl F. Bohringer, Noel C. MacDonald
Venue:  (1995)

A snap fastener is a deformable device consisting of a pair of mating surfaces that ``snap'''' together during assembly. Because of the simple, linear assembly motion, such latching micro fasteners have a wide range of applications in micro assembly tasks, e.g.\ for devices with multiple or layered components, or micro opto-mechanical plugs. At the micro scale, conventional types of fasteners like screws and hinges are unlikely to work due to present fabrication constraints and large friction forces. Micro snap fasteners also have great potential to be used as sensors with memory.
Rupture simulation of three dimensional elastoplastic structures under dynamic loading
Authors: G. Leclère, A. Nême, J. Y. Cognard
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this study, a numerical approach of the rupture phenomenon in metallic bodies under low dynamic loading is presented. The implementation of an elastoplastic behaviour and the introduction of a new rupture criterion in a finite elements code (ABAQUS/Explicit) are the two major parts of this work. In the framework of standard Hencky-Mises plastic flow rules, two numerical schemes used to integrate the behaviour law are analysed within the second paragraph. The next paragraph deals with the description of rupture by means of the bifurcation equilibrium theory. Both of these two developments have been implemented in an Fortran ABAQUS user's subroutine. The fourth paragraph deals with the validation of the numerical implementations on simple tests (tension and simple shear). The computational times obtained with the different numerical integration schemes are compared via the simulation of the impact of a car part (steering knuckle). This particular application is described in the fifth paragraph. The main experimental results like the rupture-limit velocity and the fractures locations seem to be well predicted by the new rupture criterion.
Ramsey-type Results for Unions of Comparability Graphs
Authors: Dumitrescu Adrian, Toth Geza
Venue:  (1999)

It is well known that the comparability graph of any partially ordered set of $n$ elements contains either a clique or an independent set of size at least $\sqrt{n}$. In this note we show that any graph of $n$ vertices which is the union of two comparability graphs on the same vertex set, contains either a clique or an independent set of size at least $n^{1 \over 3}$. On the other hand, there exist such graphs for which the size of any clique or independent set is at most $n^{0.4118}$. Similar results are obtained for graphs which are unions of a fixed number $k$ comparability graphs. We also show that the same bounds hold for unions of perfect graphs.
Gene classification artificial neural system
Authors: C. H. Wu, Hsi-Lien Chen
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

A gene classification artificial neural system has been developed for rapid annotation of the molecular sequencing data being generated by the Human Genome Project. Three neural networks have been implemented, one full-scale system to classify protein sequences according to PIR (protein identification resources) superfamilies, one system to classify ribosomal RNA sequences into RDP (ribosomal database project) phylogenetic classes, and one pilot system to classify proteins according to Blocks motifs. The sequence encoding schema involved an n-gram hashing method to convert molecular sequences into neural input vectors, a SVD (singular value decomposition) method to compress vectors, and a term weighting method to extract motif information. The neural networks used were three-layered, feed-forward networks that employed backpropagation or counter-propagation learning paradigms. The system runs faster by one to two orders of magnitude than existing method and has a sensitivity of 85 to 100%. The gene classification artificial neural system is available on the Internet, and may be extended into a gene identification system for classifying indiscriminately sequenced DNA fragments.
Cut, paste and filter
Authors: Peggy Sullivan
Venue: Discrete Applied Mathematics (2003)

We study the combined and separate effects of three parts of finite multi-test-tube cut and paste DNA computing. First, we reformulate the ideas of Csuhaj-Varjú et al. (Comput. AI 15(2-3) (1996) 211), Freund (Pacific Symposium on Biocomputing, World Scientific Publishing Co., Singapore, 1997), and Priese et al. (in: L. Hunter, R.B. Altman, A. Kieth Dunker, T. Klein (Eds.), Pacific Symposium on Biocomputing, World Scientific Publishing Co., Singapore, 1998, pp. 547-558) about multi-test-tube splicing DNA computing in terms of cutting and pasting as in Pixton's work (Theoret. Comput. Sci. 234 (2000) 135). As Pixton shows (Discrete Appl. Math. 69 (1996) 101; Theoret. Comput. Sci. 234 (2000) 135) with just finite cutting and pasting only regular sets can be obtained from a finite set of initial molecules. The others cited above show that if filtering is allowed between a finite number of test-tubes in which finite splicing occurs then any recursively enumerable set can be obtained using finite sets of initial test-tube contents (Comput. AI 15(2-3) (1996) 211; in: Developments in Language Theory, Aachen, July 6-9, 1999, pp. 275-286; in: L. Hunter, R.B. Altman, A. Kieth Dunker, T. Klein (Eds.), Pacific Symposium on Biocomputing, World Scientific Publishing Co, Singapore, 1998, pp. 547-558). We confirm this result for cutting and pasting. Second, we show that when only finite pasting and filtering between tubes with finite initial contents are allowed then the result must be context free and that any context free language can be so obtained. Finally, we consider several forms of filtering and several ways of combining filtering with cutting, pasting or splicing and show that all are equivalent.
Upson''s Familiar Quotations. Fourth Edition. (1984 1985)
Authors: Al Gaulle
Venue:  (1985)

This report is a compilation of several hundred examples of context-free language and very irregular expressions. Contributions were submitted over the past several years by numerous computer science graduate students who collected these now immortal words in classes and seminars. We wish to express our gratitude to the faculty, guest lecturers, and students who provided the bulk of this work.
Optimal Control of a System Described by a Two-Dimensional Quartic Equation with Conjugation Conditions
Authors: I. V. Sergienko, V. S. Deineka
Venue: Cybernetics and Systems Analysis (2003)

New problems of optimal control of distributed systems described by partial differential two-dimensional quartic equations with conjugation conditions and quadratic cost functions are considered in the paper. The theorems of existence of unique optimal solutions are proved for every considered case.
Component Module Classification for Distributed Software Understanding
Authors: Nabor C. Mendonca, Jeff Kramer
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Effective analysis and evolution of existing distributed software systems rely to great an extent on the ability to recognise implemented `executable components', particularly their constituent modules. Traditionally, this information is obtained via manual examination of configuration files and the source code directory hierarchy. However, both types of artifact are limited in distinguishing which modules are used exclusively by each executable component. This exclusivity distinction is important in that it helps to understand the components' unique functionalities and their potential runtime behaviour.This paper presents a `module classification technique' that can facilitate automatic recognition of executable component modules in a distributed system. In contrast to existing approaches, the technique explicitly distinguishes component exclusive modules from modules shared by multiple components. The paper illustrates the benefits of the technique by reporting on the results of a case study where it has been useful to (a) revealing component exclusive modules in the source code for the Field distributed programming environment; and (b) investigating some aspects of an implicit-invocation model of Field described elsewhere. Applications of the technique to other software engineering tasks, such as change impact analysis, reuse and restructuring, are also discussed.
An empirical investigation of an object-oriented design heuristic for maintainability
Authors: Ignatios Deligiannis, Martin Shepperd, Manos Roumeliotis, Ioannis Stamelos
Venue: Journal of Systems and Software (2003)

This empirical study has two goals. First, to investigate the impact of a design heuristic on the maintainability of object-oriented designs, namely the 'god class' problem. In other words, we wish to better understand to what extent a specific design heuristic contributes to the quality of designs developed. The second goal is to investigate the relationship between that OO design heuristic and metrics. Namely, are we able to capture a specific design heuristic by applying a suitable subset of design metrics? The results of this study show that: (a) the investigated design heuristic significantly affects the performance of the participants; (b) it also affects the evolution of design structures; and (c) there is a considerable relationship between that design heuristic and metrics so that it could be feasible to conduct an assessment by using appropriate metrics.
Using Belief to Reason About Cache Coherence
Authors: Lily Mummert, Jeannete M. Wing, Mahadev Satyanarayanan
Venue:  (1994)

The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence in a distributed file system. To the best of our knowledge, this is the first formal analysis of this problem. We used an extended subset of a logic of authentication to help us analyze three cache coherence protocols: a validate-on-use protocol, an invalidation-based protocol and a new large granularity protocol for use in weakly connected environments. In this paper, we present two runs from the large granularity protocol. Using our variant of the logic of authentication, we were able to find flaws in the design of the large granularity protocol. We found the notion of belief not only intuitively appealing for reasoning about our protocols, but also practical given the optimistic nature of our system model.
On Urquhart's C Logic
Authors: Agata Ciabattoni
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we investigate the basic many-valued logics introduced by Urquhart in the two editions of the Handbook of Philosophical Logic, in the chapter devoted to many-valued logic. These logics are here referred to as C and Cnew, respectively.
Asynchronous Datapaths and the Design of an Asynchronous Adder
Authors: Alain J. Martin
Venue:  (1991)

This paper presents a general method for designing delay insensitive datapath circuits. Its emphasis is on the formal derivation of a circuit from its specification. We discuss the properties required in a code that is used to transmit data asynchronously, and we introduce such a code. We introduce a general method (in the form of a theorem) for distributing the evaluation of a function over a number of concurrent cells. This method requires that the code be "distributive." We apply the method to the familiar example of a ripple-carry adder, and we give a CMOS implementation of the adder.
Agent network topology and complexity
Authors: Xiaolong Jin, Jiming Liu
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different representations will make agent networks manifest different topologies. In one presentation, the resulting agent network show obviously small-world topologies. Generally speaking, a small-world topology will computationally harden a search process. Therefore, we propose a guiding design principle that to solve a search problem by a multi-agent system, it should avoid having small-worlds among agents and it should maintain balanced intra- and inter-agent computational complexity.
Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
Authors: George Cybenko, Charles Van Loan
Venue:  (1984)

A method for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix is given. It relies solely upon the Levinson-Durbin algorithm. The procedure involves a combination of bisection and Newton''s method. Good starting values are also shown to be obtainable from the Levinson-Durbin algorithm.
On-Line Detection of Short Circuits in Digital Devices and Systems
Authors: Adam Kristof
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Presented method of on-line detection of overloads and short circuits in digital devices and systems is based on inexpensive overload detectors built into integrated circuits. A prototype 0.8 µm CMOS ASIC successfully verifies this method.
From pure to approximate logic
Authors: T. Sales
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Helena Rasiowa could be described as an atypical mathematician since, being a pure theoretician in the first part of her scientific life (1945-70), she changed course swiftly, around 1970, by applying her own abstract methods to practically-motivated theoretical problems arising in computer science (the analysis of computer programs) and artificial intelligence (the logic of approximations). The reasons behind such a shift of emphasis and the invariant motivations she kept along her whole life are explored in this homage-rendering contribution.