ppxscal/embedding_network huggingface dataset:
A Framework to Support Alternative Paths to Provide the Better End-to-End Performance on the Internet
Authors: Takayuki Kushida
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

A common requirement to improve the end-to-end performance on the Internet is critical because the Internet becomes an infrastructure of our daily life. There have been many research studies to understand characteristics of the inside of the Internet and to try to improve the end-to-end performance with caching technologies in application programs. This paper proposes a new framework to improve the end-to-end performance on the Internet. The approach taken in this paper is to establish an alternative path between end-to-end hosts by the installation of relay hosts at the intermediate. The major advantage for previous caching studies can be easily applicable to all applications on a network path. The paper also describes the results of the experiment, which measured a path quality of the intermediate link to select the better alternative path than the original path. This framework can be easily extended to construct a virtual network for the better performance on the Internet. The network provides the better performance for all Internet users.
Applications of Transformed Curves
Authors: Bruce Land, R. Tsow
Venue:  (1994)

Ghosh and Jain [1] have developed a simple algebra of shapes with closed 2D curves. They use a Fourier series representation to represent the closed 2D curve and define binary composition operations to manipulate them. We explore this idea and propose some interesting ways of defining surfaces in 3D space.
An Architecturally-based Theory of Human Sentence Comprehension
Authors: Richard L Lewis
Venue:  (2001)

This thesis presents NL-Soar, a detailed computational model of human sentence comprehension that accounts for a broad range of psycholinguistic phenomena. NL-Soar provides in-depth accounts of structural ambiguity resolution, garden path effects, unproblematic ambiguities, parsing breakdown on difficult embeddings, unacceptable embeddings, immediacy of interpretation, and the time course of comprehension. The model explains a variety of both modular and interactive effects, and shows how learning can affect ambiguity resolution behavior. In addition to accounting for the qualitative phenomena surrounding parsing breakdown and garden path effects, NL-Soar explains a wide range of contrasts between garden paths and unproblematic ambiguities, and difficult and acceptable embeddings: the theory has been applied in detail to over 100 types of structures representing theses contrasts, with a success rate of about 90%. The account of real-time immediacy includes predictions about the time course of comprehension and a zero-parameter prediction about the average rate of skilled comprehension. Finally, the theory has been successfully applied to a suggestive range of cross-linguistic examples, including constructions from head-final languages such as Japanese. NL-Soar is based on the Soar theory of cognitive architecture, which provides the underlying control structure, memory structures, and learning mechanism. The basic principles of NL-Soar are a result of applying these architectural mechanisms to the task of efficiently comprehending language in real-time. Soar is more than an implementation language for the system: it plays a central theoretical role and accounts for many of the model''s novel empirical predictions.
Optimal Pruning in Parametric Differential Equations
Authors: Micha Janssen, Pascal Van Hantenryck, Yves Deville
Venue:  (2001)

Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numerical methods do not apply. This paper considers a constraint satisfaction approach that enhances traditional interval methods with a pruning component which uses a relaxation of the ODE and Hermite interpolation polynomials. It solves the main theoretical and practical open issue left in this approach: the choice of an optimal evaluation time for the relaxation. As a consequence, the constraint satisfaction approach is shown to provide a quadratic (asymptotical) improvement in accuracy over the best interval methods, while improving their running times. Experimental results on standard benchmarks confirm the theoretical results.
Dynamical Distributed Memory Systems
Authors: Kazuhiro Kojima, Koji Ito
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

We proposes an autonomous dynamical pattern recognition and learning system. It is demonstrated that, first, when the embedded pattern, i.e., known pattern, is given to the network, the firing pattern of the network immediately goes to the relevant embedded pattern and the network state reduces to the oscillatory state at once. Second, when no embedded pattern, i.e., unknown pattern, is given to the network, the network state oscillates chaotically. It is considered as I don't know state proposed by Freeman and coworkers. Finally, when Hebb rule is applied to the network under the external stimuli that are unknown patterns, the internal state of the network is inversely bifurcated from the chaotic state to the periodic state according to the progress of learning. By using this phase transition as an index of the progress of learning, the network can learn new patterns without any external observers.
A Parallel Scalable Infrastructure for OLAP and Data Mining
Authors: Sanjay Goil, Alok Choudhary
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The multi-dimensional aspects of a business can be naturally expressed using a multi-dimensional data model. Data analysis and data mining on these warehouses pose new challenges for traditional database systems. OLAP and data mining operations require summary information on these multi-dimensional data sets. Query processing for these applications require different views of data for analysis and effective decision making. Data mining techniques can be applied in conjunction with OLAP for an integrated business solution. As data warehouses grow, parallel processing techniques have been applied to enable the use of larger data sets and reduce the time for analysis, thereby enabling evaluation of many more options for decision making.In this paper we address (1) scalability in multi-dimensional systems for OLAP and multi-dimensional analysis, (2) integration of data mining with the OLAP framework, and (3) high performance by using parallel processing for OLAP and data mining. We describe our system PARSIMONY - Parallel and Scalable Infrastructure for Multidimensional Online analytical processing. This platform is used both for OLAP and data mining. Sparsity of data sets is handled by using sparse chunks using a bit-encoded sparse structure for compression, which enables aggregate operations on compressed data. Techniques for effectively using summary information available in data cubes for data mining are presented for mining Association rules and decision-tree based Classification. These take advantage of the data organization provided by the multidimensional data model.Performance results for high dimensional data sets on a distributed memory parallel machine (IBM SP-2) show good speedup and scalability.
A Fair Queuing Algorithm for Multiple-Streams Delay-Bounded Services
Authors: Mingshou Liu, Lih-Chyau Wuu, Longsong Lin, C. Y. Tsai
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In this paper, we propose a resource reservation and scheduling algorithm which guarantees the end-to-end delay constraints for the processing of single-source multiple-streams delivery. User applications initiate the requests by specifying the tolerable delay and priorities reflecting the preference for each stream. In order to provide efficient flow scheduling subject to the fairness and delay constraints, we consider a mechanism in which the resource reservation and scheduling are integrated into a framework so that the queuing delay can be taken into the consideration at reservation phase. Packets are scheduled in a packet-by-packet base, the fairness characteristics in each scheduler is approximated by emulating the max-min fair discipline in the corresponding GPS server. Instead of tracking the fair utilization before the packet can be served in WFQ, the bandwidth share is monitored after the packet is sent. This approach can significantly reduce the computational complexity resulting from WFQ while maintaining the long-term fairness. The end-to-end delay is derived from the latency in each link and the worst-case waiting time at each scheduler. Examples are illustrated to show the performance, the results lead to high satisfaction in terms of delay and fairness.
How to Do Everything with Dreamweaver MX, 2 edition
Authors: Michael Meadhra, Michael O'Mara
Venue:  (2002)

:Now you can dream big when it comes to Web site development and design. How to Do Everything with Dreamweaver MX covers everything from first contact with the interface to publishing your site. Take a tour of the application, then dive into information, examples, and lessons on formatting text, adding images, using frames and tables, and creating forms. Learn to work with Fireworks and other external applications, and add sound, video, and Flash movies. Clearly defined chapters work equally well for readers who prefer to learn sequentially in a tutorial fashion, or for those who need a quick reference to a specific task or feature.
Concurrent Exception Handling in a Distributed Object-Oriented Computing Environment
Authors: Shin-ichi Tazuneki, Takaichi Yoshida
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In a distributed object-oriented computing environment, many exceptions would occur because many objects run concurrently on several computers connected by a network. Therefore, exceptions in distributed applications will be more complex than those in ordinary (not distributed) applications.In this paper, we introduce an exception-handling framework into our distributed object-oriented computing environment (DOOCE). In particular, we focus on handling the multiple exceptions, which are propagated from concurrent active objects in our system. The exception handling in DOOCE provides two models; termination model and resumption model and can handle the occurring multiple exceptions. Programmers have the flexibility of either handling all exceptions individually or grouping all exceptions together and handling them as a single. Furthermore, we propose a ¿notification message¿ as an approach to perform an exception occurred during the parallel computation.
Analysis of Guaranteed Service Times of Distributed Real-Time Objects
Authors: K. H. (Kane) Kim
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

As the demands for real-time distributed systems increase, the needs for programming tools useful in development of such application systems are becoming increasingly acute. An issue that the research community has long recognized as an important technological challenge but has not shown much progress in meeting the challenge is to guarantee response times of real-time distributed systems. Two basic problems must be solved to effectively meet this challenge: (1) To establish the distributed real-time program structure and the system infrastructure structure, i.e., the structure of the operating system (OS) and the communication infrastructure, that enable systematic analysis of the worst-case time behavior of the application systems; and(2) To establish a tool which performs automated analysis of the worst-case time behavior while leaving only minimal work to the designers.The problem area (1) has been recognized as a research area for a long time but only in recent years, a skeleton of a usable technical foundation started emerging. In other words, there has long been the lack of fully general and yet easily analyzable distributed real-time program structures and also the lack of useful OS timing models. However, on the basis of the skeleton emerged, a rapid progress is expected in the future toward establishment of a full technical foundation. Therefore, time seems ripe also for launching new larger-scale attacks on the problem (2) on the basis of those recent developments in handling the problem (1). 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
On Elementary Unitary and $\Phi$-Unitary Transformations
Authors: Xiaobai Sun
Venue:  (1995)

We introduce a simple uniform structure of elementary $\Phi$-unitary matrices. Elementary $\Phi$-unitary transformations are the extentions of Householder transformations in real and complex spaces with a definite or an indefinite inner product induced by a nonsingular signature matrix $\Phi$. The extentions are found useful in the computations of complex matrices or special structured matrices. For two (complex) vectors $a$ and $b$, we present the sufficient and necessary conditions on the existence of an elementary $\Phi$-unitary transformation $U$ such that $Ua = b$. And we discuss some impacts of the theory on matrix computations involving $\Phi$-unitary transformations. 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
Visualizing a tennis match
Authors: Liqun Jin, D. C. Banks
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

This paper describes our work on visualizing the information of a tennis match. We use competition trees to organize the information of a tennis match and visualize the competition trees by the top-nesting layered maps with translucent colored layers. We create iconic representations to describe the detailed information of athletic events in an intuitive manner. Specialized views of the information are displayed by applying multiple Magic Lens filters on the top-nesting layered maps. The dynamic nature of the tennis match is depicted by the time-varying display. The approach we present in this paper can be used to visualize other sports information, information with competition property, or information with hierarchical structure.
An all-optical wavelength-division meshed-ring packet-switching network
Authors: I. Rubin, Hsing-Kuo Hua
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Introduces an all-optical wavelength-division packet-switching meshed-ring local/metropolitan area communication network. This architecture, known as SMARTNet (scalable multi-channel adaptable ring terabit network), allows the proposed network to offer a significant increase in the throughput capacity realized by any local/metropolitan area shared-medium network. The SMARTNet architecture is ATM capable and fits naturally with, and takes best advantage of, the kinds of high speed optoelectronic and optical components that can actually be constructed. For certain meshed-ring regular physical topologies, an upper bound on the network's throughput efficiency is derived. Specific network configurations are demonstrated which achieve a throughput efficiency level which is close to 90% of this bound. Such network structures exhibit a throughput capacity level which is 80% higher than that realized by traditional (non-meshed) ring networks.
Error-Based Pruning of Decision Trees Grown on Very Large Data Sets Can Work!
Authors: Lawrence O. Hall, Richard Collins, Kevin W. Bowyer, Robert Banfield
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

It has been asserted that, using traditional pruning methods, growing decision trees with increasingly larger amounts of training data will result in larger tree sizes even when accuracy does not increase. With regard to error-based pruning, the experimental data used to illustrate this assertion have apparently been obtained using the default setting for pruning strength; in particular, using the default certainty factor of 25 in the C4.5 decision tree implementation. We show that, in general, an appropriate setting of the certainty factor for error-based pruning will cause decision tree size to plateau when accuracy is not increasing with more training data.
Ray Shooting and Parametric Search
Authors: K P Agarwal, Jiri Matousek
Venue:  (1991)

\indent We present efficient algorithms for the {\em ray shooting} problem: Given a collection $\Gamma$ of objects in ${\bf R}^{d}$, build a data structure so that, for a query ray, one can quickly determine the first object of $\Gamma$ hit by the ray. Using the parametric search technique, we reduce this problem to the {\em segment emptiness} problem. For various ray shooting problems, we achieve space/query time tradeoffs of the following type: for some integer $b$ and a parameter $m \, (n \leq m \leq n^{b})$ the queries are answered in time $O(\frac{n}{m^{1/b}}\, \mbox {log} ^{O(1)}n)$, with $O(m^{1+ \epsilon })$ space and preprocessing time $(\varepsilon < 0$ is arbitrarily small but fixed constant). We get $b = \lfloor d/2 \rfloor $ for ray shooting in a convex $d$-polytope defined as an intersection of $n$ half-spaces, $b = d$ for an arrangement of $n$ hyperplanes in ${\bf R}^{d}$ and $b = 3$ for an arrangement of $n$ half-planes in ${\bf R}^{3}$. Our approach also yields fast procedures for finding the first $k$ objects hit by a query ray, for searching nearest and farthest neighbors, and for the hidden surface removal. All the data structures can be maintained dynamically in amortized time $O(m^{1+ \epsilon }/n)$ per insert/delete operation.
Neutrality and self-adaptation
Authors: Christian Igel, Marc Toussaint
Venue: Natural Computing: an international journal (2003)

Neutral genotype-phenotype mappings can be observed in natural evolution and are often used in evolutionary computation. In this article, important aspects of such encodings are analyzed.First, it is shown that in the absence of external control neutrality allows a variation of the search distribution independent of phenotypic changes. In particular, neutrality is necessary for self-adaptation, which is used in a variety of algorithms from all main paradigms of evolutionary computation to increase efficiency.Second, the average number of fitness evaluations needed to find a desirable (e.g., optimally adapted) genotype depending on the number of desirable genotypes and the cardinality of the genotype space is derived. It turns out that this number increases only marginally when neutrality is added to an encoding presuming that the fraction of desirable genotypes stays constant and that the number of these genotypes is not too small.
Employing Electrical Field Sensing for Detecting Static Thumb Position Using the Finger-Joint Gesture Keypad Input Paradigm
Authors: Mikael Goldstein, Orlando Baez, Peter Danielsson
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

A wearable ubiquitous fragmentized mobile terminal concept, the Finger-Joint Gesture Keypad paradigm (FJGK), utilizing the 12 finger phalanges as telephone keypad keys and the thumb as operator, was implemented in a prototype. Isolated digit-gesture recognition of the static thumb position of the 12-character telephone keypad vocabulary (1-9, (, 0 and #) entered 50 times without replacement by a single user was recorded using electric field sensing. A simple threshold-based algorithm for classifying the various channel-input readings was used. Mean detection rate was 78% for a 4-channel electrode configuration where the electrodes were placed next to each other in one plane. Character detection rates varied between 18-100%. Detection rates were lowest for digit 5 (18%), 2 (50%) and 6 (66%). In a context where portability issues are at stake, the FJGK ubiquitous terminal concept may provide a viable alternative.
A Symplectic Method for Approximating All the Eigenvalues of a Hamiltonian Matrix
Authors: Charles Van Loan
Venue:  (1982)

A fast method for computing all the eigenvalues of a Hamiltonian matrix M is given. The method relies on orthogonal symplectic similarity transformations which preserve structure and have desirable numerical properties. The algorithm is about four times faster than the standard Q-R algorithm. The computed eigenvalues are shown to be the exact eigenvalues of a matrix M+E where $\Vert E \Vert$ depends on the square root of the machine precision. The accuracy of a computed eigenvalue depends on its condition and its magnitude, larger eigenvalues typically being more accurate.
Significantly Lower Entropy Estimates for Natural DNA Sequences
Authors: David Loewenstern, Peter N. Yianilos
Venue:  (1996)

If DNA were a random string over its alphabet {A,C,G,T},96-50.html an optimal code would assign 2 bits to each nucleotide. We imagine DNA to be a highly ordered, purposeful molecule, and might therefore reasonably expect statistical models of its string representation to produce much lower entropy estimates. Surprisingly this has not been the case for many natural DNA sequences, including portions of the human genome. We introduce a new statistical model (compression algorithm), the strongest reported to date, for naturally occurring DNA sequences. Conventional techniques code a nucleotide using only slightly fewer bits (1.90) than one obtains by relying only on the frequency statistics of individual nucleotides (1.95). Our method in some cases increases this gap by more than five-fold (1.66) and may lead to better performance in microbiological pattern recognition applications. One of our main contributions, and the principle source of these improvements, is the formal inclusion of inexact match information in the model. The existence of matches at various distances forms a panel of experts which are then combined into a single prediction. The structure of this combination is novel and its parameters are learned using Expectation Maximization (EM). Experiments are reported using a wide variety of DNA sequences and compared whenever possible with earlier work. Four reasonable notions for the string distance function used to identify near matches, are implemented and experimentally compared. We also report lower entropy estimates for coding regions extracted from a large collection of non-redundant human genes. The conventional estimate is 1.92 bits. Our model produces only slightly better results (1.91 bits) when considering nucleotides, but achieves 1.84-1.87 bits when the prediction problem is divided into two stages: i) predict the next amino acid based on inexact polypeptide matches, and ii) predict the particular codon. Our results suggest that matches at the amino acid level play some role, but a small one, in determining the statistical structure of non-redundant coding sequences.