ppxscal/embedding_network huggingface dataset:
Eigenmodes of Isospectral Drums
Authors: Tobin A. Driscoll
Venue:  (1995)

Recently it was proved that there exist nonisomeric planar regions that have identical Laplace spectra. That is, one cannot "hear the shape of a drum." All known examples of such regions are bounded by polygons with reentrant corners. While the isospectrality can be proven mathematically, analytical techniques are unable to produce eigenvalues themselves. Furthermore, standard numerical methods for computing the eigenvalues, such as adaptive finite elements, are highly inefficient. Physical experiments have been performed to measure the spectra, but the accuracy and flexibility of this method are limited. We describe an algorithm due to Descloux and Tolley that blends finite elements with domain decomposition, and show that, with a modification that doubles its accuracy, this algorithm can be used to compute efficiently the eigenvalues for polygonal regions. We present results accurate to twelve digits for the most famous pair of isospectral drums, as well as results for another pair.
Precision Imaging and Control for Machine Vision Research at Carnegie Mellon University
Authors: Reg Willson, Steven A. Shafer
Venue:  (1992)

In a perfect world we would be able to use the many possible degrees of freedom in a camera system to do many useful things, such as accommodating for changes or differences in the scenes being imaged, correcting for camera behaviour that isn''t quite ideal, or measuring properties of the scene by noting how the scene''s image changes as the camera''s parameters are varied. Unfortunately the parameters that control the formation of the camera''s images often interact in complex and subtle ways that can cause unforeseen problems for machine vision tasks. To be able to effectively use multi degree of freedom camera systems we need to know how variations in the camera''s control parameters are going to cause changes in the produced images. For this we need to have good mathematical models describing the relationships between the control parameters and the parameters of the resulting images. Ideally we would like to base the form of the models on an understanding of the underlying physical processes involved, but in many cases these are either unknown or are just too complex to model. In these situations experimentation and generalized modeling techniques are necessary. To perform the experiments needed to develop and validate models and to obtain calibration data for the models we need precise automated imaging systems. In this report we describe the camera systems developed for Carnegie Mellon University''s Calibrated Imaging Lab and show how these systems have been used to develop methods for using computer-controlled cameras and lenses.
An Overview of Triangulation Algorithms for Simple Polygons
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. Different techniques for triangulating simple polygon were designed. The first part of the paper is an overview of triangulation algorithms based on diagonal inserting. In the second part we present algorithms based on Delaunay triangulation. The basic ideas and approach for each algorithm are presented in this paper. The last part of the paper some representative algorithm by its efficiency are compared.
Not All Planar Digraphs Have Small Cycle Separators
Authors: Ming Kao, Fang Wan
Venue:  (1990)

Kao recently proved that all {\em general directed} graphs have directed cycle separators of any size. In contrast, Miller proved that {\em planar undirected} graphs with {\em n} vertices and maximum face size {\em d} have 0($\sqrt{\em dn}$)-size undirected cycle separators. Therefore it is important to investigate whether a planar directed graph has a small-size directed cycle separator. This paper shows that certain important classes of planar directed graphs have no sublinear-size directed cycle separators.
On the M/G/1 queue with heavy-tailed service time distributions
Authors: J. W. Cohen
Venue:  (1997)

In present teletraffic applications of queueing theory service time distributions $B(t)$ with a heavy tail occur, i.e. $1-B(t) \sim t^{-\nu}$ for $t \rightarrow \infty$ with $\nu < 1$. For such service time distributions not much explicit information is available concerning the tail probabilities of the inherent waiting time distribution $W (t)$. In the present study the waiting time distribution is studied for a stable $M/G/1$ model for a class of service time distributions with $1 > \nu > 2$. For $\nu =1\, \frac{1}{2}$ the explicit expression for $Q(t)$ is derived. For rational $\nu$ with $1> \nu > 2$, an asymptotic series for the tail probabilities of $W(t)$ is derived.
Overview of Interference Cancellation for CDMA Wireless Systems
Authors: Aris Papasakellariou
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The paper gives an overview of interference cancellation (IC) methods, in terms of implementation and performance, for third generation CDMA communications systems. The signal processing of each method is outlined and the advantages and challenges are discussed. An exemplary IC application at the mobile receiver and its performance are presented for the WCDMA system setup. 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
Protected Resource Access for Mobile Agent-based Distributed Computing
Authors: Anand Tripathi, Neeran Karnik
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

This paper describes the mobile agent paradigm for distributedcomputing, and outlines the security-related issuesencountered in supporting it. One of the major requirementsis the provision of access control mechanisms for server resources.Several possible designs are discussed, and onesuch proxy-based design, which we have developed in conjunctionwith the Ajanta mobile agent system, is describedin detail. Extensions of this mechanism which allow accountingof usage and selective revocation of access privilegesare discussed. The Java security model is also described,since the security of the proxy mechanism dependson it.
A Supervisory Tool for Real-Time Industrial Automation Systems
Authors: Wilson Pardi Junior, Carlos Eduardo Pereira
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Object-oriented techniques have been increasingly used during the development of real-time industrial automation systems, both in modeling and simulation frameworks used in problem domain analysis and requirements engineering, as well as for implementing SCADA (Supervisory Control And Data Acquisition) systems. However, mostly commercial available CASE (Computer Aided Software Engineering) tools do not supports the automatic code generation for SCADA systems. This paper proposes an architecture for integrating supervisory tools into object-oriented frameworks for industrial automation applications. Theideas proposed have been implemented and integrated with an object-oriented framework for real-time industrial automation applications. Real case studies have been developed, including the supervisory control of a chemical plant's prototype and the development of man-machine interfaces for food industry (pork processing plant).
Flash MX Actionscript: The Designer's Guide, 1 edition
Authors: J. Scott Hamlin, Jennifer S. Hall
Venue:  (2002)

:Get the Edge on Flash ActionScript from the Designer's Perspective As a professional web designer you want to use ActionScript to add interactivity to your Flash creations. But previous books on ActionScript have assumed you have a programming background, leaving out key details in order to cover a lot of ground. In the process many designers and other professionals new to programming have been left behind. Flash MX ActionScript: The Designer's Edge fills these gaps, using a consistently visual approach that emphasizes conceptual illustrations and color charts. These are complemented by interactive tutorials on the book's companion website. Best-selling author J. Scott Hamlin and multimedia instructor Jennifer S. Hall make everything from fundamentals to high-end techniques accessible by truly teaching you how ActionScript works, not just presenting code. Key topics you'll learn about include: The Flash MX interface to ActionScript Programming mouse interactivity Writing and reusing ActionScript Coding core animation techniques Working with text fields Doing the math: Creating curving paths with trig functions Handling object collisions and other gaming techniques ActionScript drawing techniques Encapsulating reusable code with ActionScript components Debugging and troubleshooting your ActionScript About the AuthorJ. Scott Hamlin is author and co-author of several best-selling books, including Flash 5 Magic: with ActionScript, Flash 4 Magic, and Effective Web Animation: Advanced Techniques for the Web. He is the director of Eyeland Studio, whose clients include Nabisco, Procter & Gamble, Sun, Nokia, and Nickelodeon. He has also written more than 100 articles for industry periodicals such as AV Video Multimedia Producer Magazine, InterActivity Magazine, Web Review, and Web Techniques Magazine. Jennifer S. Hall is an experienced multimedia programmer and a contributor to Flash 5 Magic: with ActionScript. Much of her work has focused on the development of educational materials for adults and for children. Her clients include Disney, Prentice Hall, and the Austin Children's Museum.
Quality of Service Support in High Speed, Wormhole Routing Networks
Authors: M. Gerla, B. Kannan, B. Kwan, P. Palnati, S. Walton, E. Leonardi, F. Neri
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Wormhole routing networks have become increasingly popular for low latency, highspeed interconnection of supercomputer and workstation clusters. An example is the Supercomputer SuperNet (SSN) at UCLA, which interconnets supercomputer across campus and metropolitan area distances. SSN employs a two-level network architecture in which an optical backbone network interconnets several high- speed, wormhole-routing local area networks (Myrinets). SSN applications such a scientific visualization and rendering require that the networks support reliable delivery of traffic characterized by Quality of Service (QoS) parameters. Motivated by this requirement, we investigate QoS support in Myrinet-like high- speed, wormhole routing networks. Since native Myrinet protocols do not provide QoS support, we explore several novel strategies including (a) the use of a separate subnet for carrying such traffic (along with source pacing), (b) the overlay of a virtual synchronous system on the asynchronous network, and (c) the introduction of virtual channels. We discuss the tradeoffs among the different options and evaluate them via selected simulation experiments.
Evaluating the Impact of the Programming Model on the Performance and Complexity of Software DSM Systems
Authors: Cristiana Bentes Seidel, Ricardo Bianchini, Claudio Luis Amorim
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper we evaluate the impact of the programming model on the performance and complexity of Entry Consistency-based software distributed shared-memory systems (software DSMs). We study three novel software DSMs that can all take advantage of lock-style primitives but impose different variations of the shared-memory programming model.The first variation is a plain shared-memory model based on barriers and mutual exclusion locks, where the association between shared data and lock variables is determined transparently by the system. The second model dictates that all accesses to shared data must be delimited by lock/unlock-type primitives (with or without mutual exclusion), even though the lock-data association is still performed transparently by the system. The third model requires that all shared data accesses be delimited by lock/unlock-type primitives and the association between locks and data is specified explicitly by the programmer.A comparison of our different software DSMs shows that increasing the model complexity simplifies the systems substantially. Our results also show that the second model can perform significantly worse than the first model, while the third model improves performance by 25% and 27% on average compared to the first and second models, respectively. We conclude that increasing the burden on the programmer is not necessarily a good option for software DSMs; only the most elaborate model we study achieves performance that justifies its programming complexity.
A C++/Linda model for distributed objects
Authors: R. Drucker, A. Frank
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

Distributed systems have many advantages over centralized systems. The authors focus on the novel Linda Tuple Space (TS) model designed for generative coordination in a distributed shared memory model. Currently, the object-oriented programming (OOP) model is considered a most suitable model for handling complex computer-based systems. Among the OOP languages, the C++ language is a de-facto standard for developing advanced systems. The paper takes these two orthogonal computational models and combines them in a new way to form a C++/Linda model that supports transparent distributed objects. The idea is to create an integrated model that builds on the advantages of both models while complementing whatever is missing in each one alone. A prototype of the C++/Linda model was implemented and several distributed programs were successfully run on it.
Context Compass
Authors: Riku Suomela, Juha Lehikoinen
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

We present an easy and natural method for accessing contextual data shown on an electronic map in a wearable computer. The information is stored as virtual objects in a known network database. The objects are retrieved from a point of interest database and visualized on a head-worn display of a wearable computer. Our method uses the familiar compass metaphor to present information in the real world. Simply looking at it can activate any object visible on the map. Only the objects belonging to the user's current context are shown. The process is composed of four parts: a point of interest database, the user accessing the database, a user interface, and content viewing. In this paper, all these parts are presented.
Analysis of Mouse Movement Time based on Varying Control to Display Ratios using Fitts'' Law
Authors: Joseph J. LaViola,  Jr.
Venue:  (1997)

This paper describes an experiment that attempts to determine what impact different control to display ratios will have on movement time of a mouse in a set of static tasks. The experiment shows that an increasing control to display ratio will actually increase the time it takes to perform a given task with a mouse. Linear regression models were built using Fitts'' law to get a correlation between the five different control to display ratios that were used. A discussion of how the experiment was conducted and analysis of the results will be provided.
Rough mereology: a rough set paradigm for unifying rough set theory and fuzzy set theory
Authors: Lech Polkowski
Venue: Fundamenta Informaticae (2002)

In this work, we would like to discuss rough inclusions defined in Rough Mereology - a paradigm for approximate reasoning introduced by Polkowski and Skowron [20] - as a basis for common models for rough as well as fuzzy set theories. We would like to adhere to the point of view that tolerance (or, similarity) is the leading motif common to both theories and in this area paths between the two lie. To this end, we demonstrate that rough inclusions (which represent a hierarchy of tolerance relations) induce rough set theoretic approximations as well as partitions and equivalence relations in the sense of fuzzy set theory. For completeness sake, we also discuss granulation mechanisms based on rough inclusions with applications to Rough-Neuro Computing and Computing with Words. These considerations are also carried out in specialized cases of Menger's as well as Lukasiewicz's rough inclusions introduced in the paper.
DSatz: A Directional SAT Solver for Planning
Authors: Mark Iwen, Amol Dattatraya Mali
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

SAT-based planners have been characterized as disjunctive planners that maintain a compact representation of search space of action sequences. Several ideas from refinementplanners (conjunctive planners) have been used to improve performance of SAT-based planners or get a better understanding of planning as SAT. One important lesson from refinement planning is that backward search being goal directed can be more efficient than forward search. Another lesson is that bidirectional search is generally not efficient. This is because the forward and backward searches can miss each other. Though effect of direction of plan refinement (forward, backward, bidirectional etc.) on efficiency of plan synthesis has been deeply investigated in refinement planning, the effect of directional solving of SAT encodings is not investigated in depth. We solved several propositional encodings of benchmark planning problems with a modified form (DSatz) of the systematic SAT solver Satz. DSatz offers 21 options for solving a SAT encoding of a planning problem, where the options are about assigning truth values to action and/or fluent variables in forward or backward or both directions, in an intermittent or non-intermittent style. Our investigation shows that backward search on plan encodings (assigning values to fluent variables first, starting with goal) is very inferior. We also show bidirectional solving options and forward solving optionsturn out to be far more efficient than other solving options. Our empirical results show that the efficient systematic solver Satz which exploits variable dependencies can be significantly enhanced with use of our variable ordering heuristics which are also computationally very cheap to apply. Our main results are that directionality does matter in solving SAT encodings of planning problems and that certain directional solving options are superior to others.
Bayes Optimal Metasearch: A Probabilistic Model for Combining the Results of Multiple Retrieval Systems
Authors: Javed A. Aslam, Mark Montague
Venue:  (2000)

We introduce a new, probabilistic model for combining the outputs of an arbitrary number of query retrieval systems. By gathering simple statistics on the average performance of a given set of query retrieval systems, we construct a Bayes optimal mechanism for combining the outputs of these systems. Our construction yields a metasearch strategy whose empirical performance nearly always exceeds the performance of any of the constituent systems. Our construction is also robust in the sense that if ``good'''' and ``bad'''' systems are combined, the performance of the composite is still on par with, or exceeds, that of the best constituent system. Finally, our model and theory provide theoretical and empirical avenues for the improvement of this metasearch strategy.
Extracting Distributed Representations of Concepts and Relations from Positive and Negative Propositions
Authors: Alberto Paccanaro, Geoffrey E. Hinton
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Linear Relational Embedding (LRE) was introduced (Paccanaro and Hinton, 1999) as a means of extracting a distributed representation of concepts from relational data. The original formulation cannot use negative information and cannot properly handle data in which there are multiple correct answers. In this paper, we propose an extended formulation of LRE that solves both these problems. We present results in two simple domains, which show that learning leads to good generalization.
ANN modelling of the dynamic non-linear behaviour of concrete towers subjected to base excitation
Authors: M. Tehranizadeh, M. Safi
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Nonlinear system identification approach has been greatly spread among the researchers and engineers in the past few years. The neural network simulators as a non-parametric system identification approach present a robust and efficient way to simulate the nonlinear behavior of engineering systems.In this paper an artificial neural network simulator (ANNS), a general back error propagating perceptron, is used to model the nonlinear behavior of concrete structures, namely silos, when subjected to a base excitation shock and potential to be cracked and crashed. Through a parametric study, different geometries and loads of the structure are surveyed and the best network architecture for each case is obtained. The peak responses and phase delays are assumed to be the network outputs. The network is trained in a supervised manner by the data obtained from nonlinear finite element analyses. The study shows the efficiency and capability of the ANNS to model the observed nonlinear behavior.
The iFlow Design Factory: Evolving Chip Design from an Art to a Process, through Adaptive Resource Management, and Qualified Data Exchange
Authors: Gilles-Eric Descamps, Satish Bagalkotkar, Subramanian Ganesan, Sridhar Subramaniam, Hem Hingarh
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

With advancing semiconductor technology, growingdesign complexities, companies have turned to a globaldesign team to build their System on a Chip (SoC). Themajor challenge is the capacity to scale infrastructure andmethodology, along with ASIC design[23]. Silicon AccessNetworks recently shipped for revenue from first silicon, afamily of four high performance SoC products. Thesehigh-end networking products were designed in state-of-the-art 0.13µm process and collectively had about 750-million transistors and a variety of analog, digital andmemory functional blocks to provide the industry's highestperformance OC-192 Data Plane Processing solution.This paper describes some of the key aspects of SiliconAccess Networks' design methodology that enabled toaccomplish repeatable "first pass silicon" successes. Wegained predictability in our chip design cycle throughreal-time visibility of the processes. Quality enhancingstrategies were applied to the chip design cycles. Adaptiveresource management, and qualified data exchange werethe two main techniques. Multi site design teams workingin different time zones may be a pitfall, or may allow fortrue 24/7 operation, depending on whether the right dataand resources are available. Building such large designsin parallel requires efficient management of resources -machines, tools and users - in a transparent but trulyglobal environment.