ppxscal/embedding_network huggingface dataset:
An anecdote about ML type inference
Authors: Andrew Koenig
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

ML strongly supports functional programming; its programmers tend to avoid operations with side effects. Thus, for example, instead of mutable arrays, ML programmers usually use lists. These lists behave much like those in Lisp, with the added requirement that all elements have the same type.1 ML lists are not themselves mutable, although the individual elements can be of a (uniform) mutable type. In Lisp terms, ML lists can optionally support RPLACA but not REPLACD. Although it is possible to define a type in ML that would support REPLACD as well, ML programmers usually don't do this unless they need it.
The application of nearest neighbor algorithm on creating an adaptive on-line learning system
Authors: Bih-Yaw Shih
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The purpose of this research is the development of an online learning system by the application of nearest neighbor algorithm for providing adaptive learning materials on the course of introduction to computer networks. There are three major tasks included in the research: (1) categorization of the materials of computer networks; (2) application of the nearest neighbor algorithm for retrieving the most adequate materials for different students when they are learning via the World Wide Web (WWW); and (3) identification of changes in thought of students' knowledge on computer networks after taking the on-line course. Compared with previous research into adaptive learning, the application of the nearest neighbor algorithm could retrieve more adequate materials from the library based on previous similar cases. Therefore, the learning performance of each individual could be improved.
Discriminative classifiers for deterministic dependency parsing
Authors: Johan Hall, Joakim Nivre, Jens Nilsson
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Deterministic parsing guided by treebank-induced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systematic comparison of memory-based learning (MBL) and support vector machines (SVM) for inducing classifiers for deterministic dependency parsing, using data from Chinese, English and Swedish, together with a variety of different feature models. The comparison shows that SVM gives higher accuracy for richly articulated feature models across all languages, albeit with considerably longer training times. The results also confirm that classifier-based deterministic parsing can achieve parsing accuracy very close to the best results reported for more complex parsing models.
Multi-resolution bitmap indexes for scientific data
Authors: Rishi Rakesh Sinha, Marianne Winslett
Venue: ACM Transactions on Database Systems (TODS) (2007)

The unique characteristics of scientific data and queries cause traditional indexing techniques to perform poorly on scientific workloads, occupy excessive space, or both. Refinements of bitmap indexes have been proposed previously as a solution to this problem. In this article, we describe the difficulties we encountered in deploying bitmap indexes with scientific data and queries from two real-world domains. In particular, previously proposed methods of binning, encoding, and compressing bitmap vectors either were quite slow for processing the large-range query conditions our scientists used, or required excessive storage space. Nor could the indexes easily be built or used on parallel platforms. In this article, we show how to solve these problems through the use of multi-resolution, parallelizable bitmap indexes, which support a fine-grained trade-off between storage requirements and query performance. Our experiments with large data sets from two scientific domains show that multi-resolution, parallelizable bitmap indexes occupy an acceptable amount of storage while improving range query performance by roughly a factor of 10, compared to a single-resolution bitmap index of reasonable size.
Parallel Cache Simulation on Multiprocessor Workstattions
Authors: Luis Barriga, Rassul Ayani
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Trace-driven simulation is the most widely used method to evaluate caches. This demands large amounts of storage and computer time. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. However, little has been done to exploit parallelism. In this paper, we present some efficient parallel simulation techniques that exploit set-partitioning as the main source of parallelism. We show that a straightforward implementation does not give much speedup as one might expect. We develop more efficient parallel simulation techniques by introducing more knowl edge into the cache simulator. The techniques presented here can be efficiently used on multiprocessor worksta tions.
Web Engineering Security: Essential Elements
Authors: William Bradley Glisson, Ray Welland
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Security is an elusive target in today's high-speed and extremely complex, Web enabled, information rich business environment. This paper presents the idea that there are essential, basic organizational elements that need to be identified, defined and addressed before examining security aspects of a Web Engineering Development process. These elements are derived from empirical evidence based on a Web survey and supporting literature. This paper makes two contributions. The first contribution is the identification of the Web Engineering specific elements that need to be acknowledged and resolved prior to the assessment of a Web Engineering process from a security perspective. The second contribution is that these elements can be used to help guide Security Improvement Initiatives in Web Engineering.
Extraction of semantic description of events using Bayesian networks
Authors: A. Ekin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We use Bayesian belief networks to statistically model the trends for event detection. We automatically detect non-rigid object trajectories for object motion units. Then, we use dominant and secondary trajectories of a single object in several consecutive motion units to understand semantic actions or those of more than one object to recognize semantic interactions between objects. We demonstrate sample Bayesian networks to detect events and extract the event descriptions, such as "catch the ball", "throw the ball" and "walk".
High accuracy 2D angle estimation with extended aperture vector sensor arrays
Authors: K. T. Wong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A novel ESPRIT-based 2D angle estimation scheme is proposed involving the use of a right-triangular array of three vector sensors spaced much farther apart than a half-wavelength. A vector sensor is composed of six co-located antennas distinctly measuring all six electromagnetic field components of a multi-component incident wavefield. Information on each source's respective electromagnetic field components is obtained by decoupling the signal eigenvectors via lower dimensional eigenvectors derived from TLS-ESPRIT. This facilitates estimation of each source's respective Poynting vector thereby enabling one to resolve the phase ambiguities in ESPRIT's eigenvalues when the intervector-sensor spacing is greater than a half-wavelength. Simulations are presented showing the sample variance of the direction cosine estimates decreasing linearly on a log-log scale as the intervector-sensor spacing is increased from a half-wavelength to 30 wavelengths, with a factor of 80 reduction in the latter case relative to the former case. The proposed scheme and attendant vector sensor array also outperform a uniformly-spaced array of scalar sensors with the same aperture and same number of component antennas whenever the intervector sensor spacing in the former case is greater than 3 half-wavelengths.
Kawa: compiling dynamic languages to the Java VM
Authors: Per Bothner
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Many are interested in Java for its portable bytecodes and extensive libraries, but prefer a different language, especially for scripting. People have implemented other languages using an interpreter (which is slow), or by translating into Java source (with poor responsiveness for eval). Kawa uses an interpreter only for "simple" expressions; all non-trivial expressions (such as function definitions) are compiled into Java bytecodes, which are emitted into an in-memory byte array. This can be saved for later, or quickly loaded using the Java ClassLoader. Kawa is intended to be a framework that supports multiple source languages. Currently, it only supports Scheme, which is a lexically-scoped language in the Lisp family. The Kawa dialect of Scheme implements almost all of the current Scheme standard (R5RS), with a number of extensions, and is written in a efficient object-oriented style. It includes the full "numeric tower", with complex numbers, exact infinite-precision rational arithmetic, and units. A number of extensions provide access to Java primitives, and some Java methods provide convenient access to Scheme. Since all Java objects are Scheme values and vice versa, this makes for a very powerful hybrid Java/Scheme environment. An implementation of ECMAScript (the standardized "core" of JavaScript) is under construction. Other languages, including Emacs Lisp, are also being considered. Kawa home page: http://www.cygnus.com/ ~bothner/kawa.html.
Processes in KaffeOS: isolation, resource management, and sharing in java
Authors: Godmar Back, Wilson C. Hsieh, Jay Lepreau
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Single-language runtime systems, in the form of Java virtual machines, are widely deployed platforms for executing untrusted mobile code. These runtimes provide some of the features that operating systems provide: inter-application memory protection and basic system services. They do not, however, provide the ability to isolate applications from each other, or limit their resource consumption. This paper describes KaffeOS, a Java runtime system that provides these features. The KaffeOS architecture takes many lessons from operating system design, such as the use of a user/kernel boundary, and employs garbage collection techniques, such as write barriers. The KaffeOS architecture supports the OS abstraction of a process in a Java virtual machine. Each process executes as if it were run in its own virtual machine, including separate garbage collection of its own heap. The difficulty in designing KaffeOS lay in balancing the goals of isolation and resource management against the goal of allowing direct sharing of objects. Overall, KaffeOS is no more than 11% slower than the freely available JVM on which it is based, which is an acceptable penalty for the safety that it provides. Because of its implementation base, KaffeOS is substantially slower than commercial JVMs for trusted code, but it clearly outperforms those JVMs in the presence of denial-of-service attacks or misbehaving code.
Accurate Multiple-Precision Gauss-Legendre Quadrature
Authors: Laurent Fousse
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

Numerical integration is an operation that is frequently available in multiple precision numerical software packages. The different quadrature schemes used are considered well studied but the rounding errors that result from the computation are often neglected, and the actual accuracy of the results are therefore seldom rigorously proven. We propose an implementation of the Gauss-Legendre quadrature scheme with bounded error: given a bound on the derivatives of a function we are able to compute an interval containing the true value of the integral, in arbitrary precision. The error analysis is given as well as experimental error measurements and timings, and a complete quadrature example.
Using domain knowledge for text mining
Authors: Craig Nevill-Manning
Venue:  (2006)

Text mining concerns the automated analysis of textual data to store, retrieve, organize and extract useful information from textual data. Text mining systems usually rely on document collections or training data prepared for a particular application. However, in practice, external knowledge is also available in external databases, reference books, web pages and many other sources. This thesis concerns the use of external knowledge for text mining to improve the performance of text mining systems. First we focus on using domain knowledge for clustering and text retrieval for bioinformatics. We describe a method for clustering biological data by exploiting the inter-linked structure of biological data. By constructing a network of biological sequences, structures and literature with pairwise relationships, we infer clusters of related articles, sequences and structures by graph partitioning. The resulting clusters exhibit strong topicality, as measured by both a quantitative and qualitative manual evaluation on several biological domains. We also present one application of our approach to the problem of finding scientific papers that describe functions of particular genes. Finally, we study incorporating domain knowledge for text classification. We propose combining domain knowledge with training examples in a Bayesian framework. Domain knowledge is used to specify a prior distribution for parameters of a logistic regression model, and labeled training data is used to find the mode of the posterior distribution. We show experimentally on three text categorization data sets that this approach can produce effective classifiers, particularly when little training data is available.
An architecture for specification-based detection of semantic integrity violations in kernel dynamic data
Authors: Nick L. Petroni,  Jr., Timothy Fraser, AAron Walters, William A. Arbaugh
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

The ability of intruders to hide their presence in compromised systems has surpassed the ability of the current generation of integrity monitors to detect them. Once in control of a system, intruders modify the state of constantly-changing dynamic kernel data structures to hide their processes and elevate their privileges. Current monitoring tools are limited to detecting changes in nominally static kernel data and text and cannot distinguish a valid state change from tampering in these dynamic data structures. We introduce a novel general architecture for defining and monitoring semantic integrity constraints using a specification language-based approach. This approach will enable a new generation of integrity monitors to distinguish valid states from tampering.
DNA Computing Model for the Minimum Spanning Tree Problem
Authors: Aili Han, Daming Zhu
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V,E,W) by means of molecular biology techniques, we encode each vertex vi\inV using one recognition code of length l, l=max{log_4n,6}; we encode each edge e_ij\inE using two DNA strands of length 2p=2max{w_ij, l}; for any two adjacent edges e_ij,e_jk, we add one DNA strand s_aijk of length w_ij+w_jk as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems.
Bringing equations and formulas alive and making them more meaningful to students
Authors: W. H. Eggimann
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. Mathematical equations are the language for solving problems in engineering. This is particularly true for the student in the classroom and the worker on a research project. In general students have a very poor grasp of mathematical relations. Many lack the skill for simple manipulation, but even the good manipulators very seldom have more than a superficial insight of the meaning of an equation. The following issues are addressed: using symbols in equations, checking units, testing for limiting values, interpreting the results, obtaining a feeling for the numbers, using appropriate prefixes, using graphs, and estimating numerical values. 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
CATS: cycle accurate transaction-driven simulation with multiple processor simulators
Authors: Dohyung Kim, Soonhoi Ha, Rajesh Gupta
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper focuses on enhancing performance of cycle accurate simulation with multiple processor simulators. Simulation performance is determined by how often simulators exchange events with one another and how accurately simulators model their behavior. Previous techniques have limited their applicability or sacrificed accuracy for performance. In this paper, we notice that inaccuracy comes from events which arrive between event exchange boundaries. To solve the problem, we propose cycle accurate transaction-driven simulation which maintains event exchange boundaries at bus transactions but compensates for accuracy. The proposed technique is implemented in a publicly available CATS framework and our experiment with 64 processors achieves 1.2M processor cycles/s (200K instructions/s) which is faster than other cycle accurate frameworks by an order of magnitude.
Fundamental performance analysis for spoken dialogue systems based on a quantitative simulation approach
Authors: Bor-Shen Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The performance of dialogue systems is mostly measured based on the analysis of a large dialogue corpus. In this way, the dialogue performance can not be obtained before the system is on line, and the dialogue corpus should be recollected if the system is modified. Also, the effect of different factors, including system dialogue strategy, recognition and understanding accuracy or user response pattern, etc., on the dialogue performance can not be quantitatively identified because they can not be precisely controlled in different corpora. In this paper, a fundamental performance analysis scheme for dialogue systems based on a quantitative simulation approach is proposed. With this scheme the fundamental performance of a dialogue system can be predicted and analyzed efficiently without having any real spoken dialogue system implemented or having any dialogue corpus actually collected. How the dialogue performance varies with respect to each factor, from recognition accuracy to dialogue strategy, can be individually identified, because all such factors can be precisely controlled in the simulation. The quality of service for the spoken dialogue system can also be flexibly defined and the design parameters easily determined. This approach is therefore very useful for the design, development and improvement of spoken dialogue although the on-line system and real corpus will eventually be needed in the final evaluation and analysis of the system performance in any case.
Verifying cryptographic protocols for electronic commerce
Authors: Randall W. Lichota, Grace L. Hammonds, Stephen H. Brackin
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

This paper describes the Convince toolset for detecting common errors in cryptographic protocols, protocols of the sort used in electronic commerce. We describe using Convince to analyze confidentiality, authentication, and key distribution in a recently developed protocol proposed for incorporation into a network bill-payment system, a public-key version of the Kerberos authentication protocol. Convince incorporates a "belief logic" formalism into a theorem-proving environment that automatically proves whether a protocol can meet its goals. Convince allows an analyst to model a protocol using a tool originally designed for Computer-Aided Software Engineering (CASE).
Addressing Dynamic Contextual Adaptation with a Domain-Specific Language
Authors: Serena Fritsch, Aline Senart, Siobhan Clarke
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The increasing number of mobile devices and sensors equipped with wireless networking capabilities enable a new generation of pro-active applications. These applications make use of context to adapt their behaviour to better fit their current situation. To support unanticipated changes to application behaviour, mechanisms are needed to specify when and how to adapt an application during its runtime. Many dynamic platforms exist that achieve this to some extent, and that are built on general-purpose languages (GPLs). However, these approaches suffer from standard difficulties of GPLs relating to the lack of semantic expressiveness of their constructs. In this paper, we describe high-level declarative constructs that can be used to specify the adaptation of application behaviour to specific situations. The language is supported by a framework that enables the exchange and merge of behaviours on-the-fly. Our approach is evaluated against application scenarios in the domain of autonomous vehicles.
Front spreading on 3D surfaces
Authors: Y. Zhao, A. Kaufman
Venue: Proceedings of the Computer Graphics International 2005 (2005)

We present a method for simulating front propagation over 3D surfaces with arbitrary topology. Our approach, which can handle the simultaneous spreading of multiple fronts, is implemented by applying a level set method on the surface. A special data structure, called the surrounding grid, assists in advancing the fronts without triangulation or parameterization of the surface. The surrounding grid consists of discretized grid points in the vicinity of the surface. An enhanced distance field provides the bridge between the surrounding grid and the surfaces on which the fronts travel. By manipulating speed functions in the level set method, the front propagation dynamics can be conveniently controlled. We illustrate the applicability and flexibility of our method with three example applications: texture generation, water flooding, and fire propagation.