ppxscal/embedding_network huggingface dataset:
Building parsers with Java
Authors: Steven John Metsker
Venue:  (2001)

Parser building is a powerful programming technique that opens a world of opportunity for designing how users interact with applications. By creating mini-languages, you can precisely address the requirements of your application development domain. Writing your own parsers empowers you to access a database more effectively than SQL to efficiently control the movement of an order through its workflow, to command the actions of a robot, and to control access privileges to transactions in a system. The repertoire of today's professional programmer should include the know-how to create custom languages.Building Parsers with Java™ shows how to create parsers that recognize custom programming languages. This book and its accompanying CD provide an in-depth explanation and clearly written tutorial on writing parsers, following the Interpreter Design Pattern. An easy-to-follow demonstration on how to apply parsers to vital development tasks is included, using more than a hundred short examples, numerous UML diagrams, and a pure Java parser toolkit to illustrate key points.You will learn How to design, code, and test a working parser How to create a parser to read a data language, and how to create new computer languages with XML How to translate the design of a language into code How to accept an arithmetic formula and compute its result How to accept and apply matching expressions like th* one How to use tokenizers to define a parser in terms of logical nuggets instead of individual characters How to build parsers for a custom logic language like Prolog How to build parsers for a custom query language that goes beyond SQL How to construct an imperative language that translates text into commands that direct a sequence of actionsThe CD contains all of the examples and the parser toolkit, including more than three hundred Java classes and their corresponding javadoc. The CD also provides example programs for the new logic, query, and imperative languages that this book introduces.With the information, methods, and tools in this book/CD package, you can create new computer languages that exactly fit your domain. You can nestle a new language into any niche, defining how your users interact with computers. 0201719622B04062001
An extension of Fibonaccian search to several variables
Authors: P. Krolak, L. Cooper
Venue: Communications of the ACM (1963)

A technique which uses Fibonaccion search concepts has been developed to solve optimization problems involving unimodal functions of several variables. The technique has not been proven to be optimal in the sense that the one-dimensional Fibonaccion search is. However, it is valuable for certain kinds of calculations.
Shuffle languages, Petri nets, and context-sensitive grammars
Authors: Jay Gischer
Venue: Communications of the ACM (1981)

Flow expressions have been proposed as an extension of the regular expressions designed to model concurrency. We examine a simplification of these flow expressions which we call shuffle expressions. We introduce two types of machines to aid in recognizing shuffle languages and show that one such machine may be equivalent to a Petri Net. In addition, closure and containment properties of the related language classes are investigated, and we show that one machine type recognizes at least a restricted class of shuffle languages. Finally, grammars for all shuffle languages are generated, and the shuffle languages are shown to be context-sensitive.
Assembly language through the Java virtual machine
Authors: Carl Bredlau, Dorothy Deremer
Venue: ACM SIGCSE Bulletin (2001)

Student understanding of choices and design decisions about instruction formats, addressing, instruction types, and flow of control is developed through the assembly level. We propose the Java Virtual Machine (JVM) as the architecture for teaching assembly language. The paper describes how to use the JVM as a teaching tool for a sophomore level Assembly Language and Computer Architecture course.
CIS, ITS, and the library resource network: collaborations and partnerships
Authors: Karen Ruddy
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

This paper describes the Library Resource Network's FIRST Center, a Faculty Innovation and Resource Service for Technology production facility where online courses and multi-media unis are produced. Participants in the program are: the Library Resource Network (LRN), the Amarillo College CIS Department, Computer Information Services (CIS), Information Technology Services (ITS), and the External Learning Experience (ELE) Student Apprenticeship Program. One-on-one assistance for time-pressed faculty who need immediate, individualized attention in the development of online units and courses is provided on demand in the FIRST Center. Previous reports examining the convergence in services of the library and the computing center, lay the foundation for the new collaborations developed in this initiative.1 2.
Representing and querying XML with incomplete information
Authors: Serge Abiteboul, Luc Segoufin, Victor Vianu
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

We study the representation and querying of XML with incomplete information. We consider a simple model for XML data and their DTDs, a very simple query language, and a representation system for incomplete information in the spirit of the representations systems developed by Imielinski and Lipski for relational databases. In the scenario we consider, the incomplete information about an XML document is continuously enriched by successive queries to the document. We show that our representation system can represent partial information about the source document acquired by successive queries, and that it can be used to intelligently answer new queries. We also consider the impact on complexity of enriching our representation system or query language with additional features. The results suggest that our approach achieves a practically appealing balance between expressiveness and tractability. The research presented here was motivated by the Xyleme project at INRIA, whose objective it to develop a data warehouse for Web XML documents.
A reduce-based OpenMath ↔ MathML translator
Authors: Luis Alvarez Sobreviela
Venue: ACM SIGSAM Bulletin (2000)

The increase in importance of OpenMath and MathML as mathematical representations revealed the need for an interface relating them both transparently. An interface should offer the possibility of translating expressions from one standard to the other while remaining faithful to semantic meaning. Given that there is a distinction between MathML's and OpenMath's approach to encoding mathematics, such an interface would allow the user to benefit from the strong points of each standard.This issue motivated the design and implementation of my OpenMath/MathML Interface for REDUCE. The primary aim was to understand the differences and similarities between OpenMath and MathML, to assess their exchange-ability and develop a way of mapping one standard to the other. This analysis can be read in my project documentation which is available online at [2]. Finally, the objective was to produce an interface, which would translate OpenMath into MathML and vice versa fulfilling the requirements outlined above.This article intends to expose certain concerns encountered throughout the interface design and implementation, mainly the question of how to translate one standard into the other via an intermediate representation. I will assume the reader is familiar with OpenMath [1, 3], MathML [6] and REDUCE [4].
Enhanced topic distillation using text, markup tags, and hyperlinks
Authors: Soumen Chakrabarti, Mukul Joshi, Vivek Tawde
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Topic distillation is the analysis of hyperlink graph structure to identify mutually reinforcing authorities (popular pages) and hubs (comprehensive lists of links to authorities). Topic distillation is becoming common in Web search engines, but the best-known algorithms model the Web graph at a coarse grain, with whole pages as single nodes. Such models may lose vital details in the markup tag structure of the pages, and thus lead to a tightly linked irrelevant subgraph winning over a relatively sparse relevant subgraph, a phenomenon called topic drift or contamination. The problem gets especially severe in the face of increasingly complex pages with navigation panels and advertisement links. We present an enhanced topic distillation algorithm which analyzes text, the markup tag trees that constitute HTML pages, and hyperlinks between pages. It thereby identifies subtrees which have high text- and hyperlink-based coherence w.r.t. the query. These subtrees get preferential treatment in the mutual reinforcement process. Using over 50 queries, 28 from earlier topic distillation work, we analyzed over 700,000 pages and obtained quantitative and anecdotal evidence that the new algorithm reduces topic drift.
PARDI!
Authors: François Boulier, François Lemaire, Marc Moreno Maza
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We propose a new algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This differential algebra algorithm computes characteristic sets by change of ranking (ordering) for prime ideals. It identifies the purely algebraic subproblems which arise during differential computations and solves them algebraically. There are two improvements w.r.t. other approaches: formerly unsolved problems could be carried out; it is conceptually simple. Different variants are implemented.
Kava: a Java dialect with a uniform object model for lightweight classes
Authors: David F. Bacon
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

Object-oriented programming languages have always distinguished between &ldquo;primitive&rdquo; and &ldquo;user-defined&rdquo; data types, and in the case of languages like C++ and Java, the primitives are not even treated as objects, further fragmenting the programming model. The distinction is especially problematic when a particular programming community requires primitive-level support for a new data type, as for complex, intervals, fixed-pointed numbers, and so on. We present Kava, a design for a backward-compatible version of Java that solves the problem of programmable lightweight objects in a much more aggressive and uniform manner than previous proposals. In Kava, there are no primitive types; instead, object-oriented programming is provided down to the level of single bits, and types such as int can be explicitly programmed within the language. While the language maintains a uniform object reference semantics, efficiency is obtained by making heavy use of unboxing and semantic expansion. We describe Kava as a dialect of the Java language, show how it can be used to define various primitive types, describe how it can be translated into Java, and compare it to other approaches to lightweight objects.
Shape Similarity Measure Based on Correspondence of Visual Parts
Authors: Longin Jan Latecki, Rolf Lakämper
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

A cognitively motivated similarity measure is presented and its properties are analyzed with respect to retrieval of similar objects in image databases of silhouettes of 2D objects. To reduce influence of digitization noise, as well as segmentation errors, the shapes are simplified by a novel process of digital curve evolution. To compute our similarity measure, we first establish the best possible correspondence of visual parts (without explicitly computing the visual parts). Then, the similarity between corresponding parts is computed and aggregated. We applied our similarity measure to shape matching of object contours in various image databases and compared it to well-known approaches in the literature. The experimental results justify that our shape matching procedure gives an intuitive shape correspondence and is stable with respect to noise distortions.
Model for unistroke writing time
Authors: Poika Isokoski
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Unistrokes are a viable form of text input in pen-based user interfaces. However, they are a very heterogeneous group of gestures the only common feature being that all are drawn with a single stroke. Several unistroke alphabets have been proposed including the original Unistrokes, Graffiti, Allegro, T-Cube and MDITIM. Comparing these methods usually requires a lengthy study with many writers and even then the results are biased by the earlier handwriting experience that the writers have. Therefore, a simple descriptive model for predicting the writing time for an expert user on any given unistroke alphabet thus enabling sounder argumentation on the properties of different writing methods.
Polynomial manipulation with APL
Authors: Brian Billard
Venue: Communications of the ACM (1981)

A simple but effective method for the manipulation of polynomials of several variables in APL is presented. The method is especially advantageous in situations where more sophisticated symbolic computing systems such as SAC-1 and MACSYMA are not available. The method is shown to successfully solve a problem not readily resolved by other means.
Chimera: hypermedia for heterogeneous software development enviroments
Authors: Kenneth M. Anderson, Richard N. Taylor, E. James Whitehead,  Jr.
Venue: ACM Transactions on Information Systems (TOIS) (2000)

Emerging software development environments are characterized by heterogeneity: they are composed of diverse object stores, user interfaces, and tools. This paper presents an approach for providing hypermedia services in this heterogeneous setting. Central notions of the approach include the following: anchors are established with respect to interactive views of objects, rather than the objects themselves; composable, n-ary links can be established between anchors on different views of objects which may be stored in distinct object bases; viewers may be implemented in different programming languages; and, hypermedia services are provided to multiple, concurrently active, viewers. The paper describes the approach, supporting architecture, and lessons learned. Related work in the areas of supporing heterogeneity and hypermedia data modeling is discussed. The system has been employed in a variety of contexts including research, development, and education.
Contour Tracking in Clutter: A Subset Approach
Authors: Daniel Freedman, Michael S. Brandstein
Venue: International Journal of Computer Vision (2000)

A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of contour space. Greater complexity is added to the contour model by analyzing rigid and non-rigid transformations of contours separately. In the course of tracking, multiple contours may be observed due to the presence of extraneous edges in the form of clutter&semi; the learned model guides the algorithm in picking out the correct one. The algorithm, which is posed as a solution to a minimization problem, is made efficient by the use of several iterative schemes. Results applying the proposed algorithm to the tracking of a flexing finger and to a conversing individual's lips are presented.
Multiseeded Segmentation Using Fuzzy Connectedness
Authors: Gabor T. Herman, Bruno M. Carvalho
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Fuzzy connectedness has been effectively used to segment out an object in a badly corrupted image. We generalize the approach by providing a definition which is shown to always determine a simultaneous segmentation of multiple objects. For any set of seed points, the segmentation is uniquely determined by the definition. An algorithm for finding this segmentation is presented and its output is illustrated. The algorithm is fast as compared to other segmentation algorithms in current use. We also report on an evaluation of the accuracy and robustness of the algorithm based on experiments in which several users were repeatedly asked to identify the seed points for the algorithm in a number of images.
Assessing the need for training in IT professionals: a research model
Authors: Creggan Gjestland, J. Ellis Blanton, Richard Will, Rosann Collins
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Training is critical to hiring and retaining information technology professionals. In order to improve the efficiency of the training of these professionals, a research model is proposed as a basis for future research regarding the methods that exist for assessing training needs in information technology professionals.
An overview of the center for wireless information network studies at Worcester Polytechnic Institute, MA, USA
Authors: Kaveh Pahlavan
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

The Center for Wireless Information Network Studies (CWINS) is a well renowned compact wireless research laboratory with a successful history of research alliances with other industrial and academic groups. The center has performed research for government agencies and has close ties with the world-leading organizations in the wireless industry. The core competence of the center is in indoor radio channel propagation measurement modeling and in the development of testbeds and tools for design and performance monitoring of wireless indoor networks. For over a decade, by publishing an international periodical journal, organizing several workshops and participating in organizing a yearly international conference, the center has contributed significantly to information exchange among important sectors of the wireless industry.
Transporting a portable operating system: UNIX to an IBM minicomputer
Authors: Paul J. Jalics, Thomas S. Heines
Venue: Communications of the ACM (1983)

The &ldquo;portable&rdquo; UNIX operating system was transported to an IBM Series/1 minicomputer. The process of transporting is described with emphasis on (1) adapting to the target machine architecture; (2) the selection of the approach taken to transporting; (3) a description of the problems encountered; (4) the degree of portability of the UNIX system; and (5) a summary of the portability lessons learned.
A knowledge level software engineering methodology for agent oriented programming
Authors: Paolo Bresciani, Anna Perini, Paolo Giorgini, Fausto Giunchiglia, John Mylopoulos
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Our goal in this paper is to introduce and motivate a methodology, called \emph{Tropos}, for building agent oriented software systems. Tropos is based on two key ideas. First, the notion of agent and all the related mentalistic notions (for instance: beliefs, goals, actions and plans) are used in all phases of software development, from the early analysis down to the actual implementation. Second, Tropos covers also the very early phases of requirements analysis, thus allowing for a deeper understanding of the environment where the software must operate, and of the kind of interactions that should occur between software and human agents. The methodology is illustrated with the help of a case study.
Automatic recommendation of hot topics in discussion-type newsgroups (poster session)
Authors: Hiromi Ozaku, Masao Utiyama, Masaki Murata, Kiyotaka Uchimoto, Hitoshi Ishara
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We are developing an intelligent network news reader intended to help people use discussion-type network news more effectively. It is called HISHO and will assist users to find whole threads in Japanese discussions that are relevant to the users' interests. When users read the network news, they are usually unaware of their intentions and their searches are usually vague. It is difficult for users to find even one article that fits their interests. In this paper we define &ldquo;Hot Topics&rdquo; that can be used to guide users to interesting information in discussion-type newsgroups and we describe a method for getting titles of such &ldquo;Hot Topics&rdquo; automatically.
Nonlinear System Identification Using Lyapunov Based Fully Tuned Dynamic RBF Networks
Authors: Li Yan, N. Sundararajan, P. Saratchandran
Venue: Neural Processing Letters (2000)

This paper presents a stable, on-line identification scheme for multivariable nonlinear dynamic system. Growing Gaussian Radial Basis Function (GRBF) network with all its parameters being adaptable is used to approximate an unknown nonlinear system. Based on a continuous-time framework, the parameter adjustment law is derived using Lyapunov synthesis approach, which guarantees the stability of the overall system. In addition, to ensure the convergence of the approximation error, a growing strategy for the network is selected and a dead zone is incorporated in the tuning law. Simulation studies on identifying a time-varying nonlinear missile dynamics illustrate the superior performance of the proposed scheme. The studies also indicate that stability and reduction in approximation error can be extended to a network with pruning strategy, thereby resulting in a Growing and Pruning (GAP) RBF network, which can implement a more compact network structure.
Algorithms for the computation of all Mathieu functions of integer orders
Authors: Fayez A. Alhargan
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

The article presents methods for the computation of all Mathieu functions of integer order, which cover a large range of n and h; previous algorithms were limited to small values of n. The algorithms are given in sufficient detail to enable straightforward implementation. The algorithms can handle a large range of the order n (0-200) and the parameter h (0-4n).
MultiJava: modular open classes and symmetric multiple dispatch for Java
Authors: Curtis Clifton, Gary T. Leavens, Craig Chambers, Todd Millstein
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

We present MultiJava, a backward-compatible extension to Java supporting open classes and symmetric multiple dispatch. Open classes allow one to add to the set of methods that an existing class supports without creating distinct subclasses or editing existing code. Unlike the "Visitor" design pattern, open classes do not require advance planning, and open classes preserve the ability to add new subclasses modularly and safely. Multiple dispatch offers several well-known advantages over the single dispatching of conventional object-oriented languages, including a simple solution to some kinds of "binary method" problems. MultiJava's multiple dispatch retains Java's existing class-based encapsulation properties. We adapt previous theoretical work to allow compilation units to be statically typechecked modularly and safely, ruling out any link-time or run-time type errors. We also present a n compilation scheme that operates modularly and incurs performance overhead only where open classes or multiple dispatching are actually used.