ppxscal/embedding_network huggingface dataset:
A natural language understanding system for medical applications: U. of Vienna, Austria
Authors: Ernst Buchberger, Ingeborg Steinacker, Robert Trappl, Harald Trost, Elisabeth Leinfellner
Venue: Issue 79 (January 1982) (1982)

The system is designed to engage in dialogues in German. Due to our focus of interest in methodology of representation we chose an approach independent of the domain in which the system can be used. Its designated area of application will be medicine.
The GAMS classification scheme for mathematical and statistical software
Authors: Ronald F. Boisvert, Sally E. Howe, David K. Kahaner
Venue: ACM SIGNUM Newsletter (1983)

An extensive tree-structured problem-oriented scheme for classifying mathematical and statistical software is presented. The scheme is a substantially modified version of a scheme proposed by Bolstad, which was based on the widely-used SHARE system. It is an attempt to reflect more accurately the current state of mathematical and statistical software. Our changes resulted from using the Bolstad scheme as the basis for the NBS Guide to Available Mathematical Software (GAMS), which provides NBS scientists information about subprograms in the IMSL, NAG, and PORT libraries, and in dozens of public-domain subprogram packages.
Discriminant Analysis with Tensor Representation
Authors: Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xiaoou Tang, Hong-Jiang Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a Discriminant Tensor Criterion (DTC), whereby multiple interrelated lower-dimensional discriminative subspaces are derived for feature selection. Then, a novel approach called k-mode Cluster-based Discriminant Analysis is presented to iteratively learn these subspaces by unfolding the tensor along different tensor dimensions. We call this algorithm Discriminant Analysis with Tensor Representation (DATER), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes; 2) for classification problems involving higher-order tensors, the DATER algorithm can avoid the curse of dimensionality dilemma and overcome the small sample size problem; and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in generalized eigenvalue decomposition. We provide extensive experiments by encoding face images as 2nd or 3rd order tensors to demonstrate that the proposed DATER algorithm based on higher order tensors has the potential to outperform the traditional subspace learning algorithms, especially in the small sample size cases.
An evaluation of MProlog by Logicware
Authors: Alex Bykat
Venue: Issue 95 (January 1986) (1986)

The following is a brief report of our experience with MProlog version 1.5 produced by Logicware Inc. Although much of what we report applies probably to all (or at least most) implementations of MProlog by that firm, our experience is with but two of their implementations running on:1. Tektronix 4404 AI Workstation, and2. VM/CMS version running on our IBM-4381 mainframe.We have used MProlog (1.5) in various projects as well as in construction of an intelligent operating system consultant and tutor (OSCAT). OSCAT is a large project which requires nontrivial facilities; this experience undoubtedly affected our evaluation of the MProlog product. Most of what follows is based on our interaction with MProlog for the VM/CMS system.
Large scale testing of a descriptive phrase finder
Authors: Hideo Joho, Ying Ki Liu, Mark Sanderson
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes an evaluation of an existing technique that locates sentences containing descriptions of a query word or phrase. The experiments expand on previous tests by exploring the effectiveness of the system when searching from a much larger document collection. The results showed the system working significantly better than when searching over smaller collections. The improvement was such, that a more stringent definition of what constituted a correct description was devised to better measure effectiveness. The results also pointed to potentially new forms of evidence that might be used in improving the location process.
An Interactive Molecular Visualization System for Education in Immersive Multi-Projection Virtual Environment
Authors: Yanlin Luo, Ping Guo, Shoichi Hasegawa, Makoto Sato
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, our initial work on the use of visualization and virtual reality for education especially for providing three-dimensional concepts of molecular structure was presented. Our system is composed of a hybrid screen, multi-projectors, PC cluster, 6DOF haptic device etc. It offers a channel to reach into the molecular space in an immersive environment, allows user to employ an intuitive 6DOF haptic device Spidar-G to control the perspective. For educators, it can serve as a good instructional aid for helping students to understand molecular structure through effective visual representation and interactive manipulation.
Silence on the Wire: A Field Guide to Passive Reconnaissance and Indirect Attacks
Authors: Michal Zalewski
Venue:  (2005)

There are many ways that a potential attacker can intercept information, or learn more about the sender, as the information travels over a network. Silence on the Wire uncovers these silent attacks so that system administrators can defend against them, as well as better understand and monitor their systems. Silence on the Wire dissects several unique and fascinating security and privacy problems associated with the technologies and protocols used in everyday computing, and shows how to use this knowledge to learn more about others or to better defend systems. By taking an indepth look at modern computing, from hardware on up, the book helps the system administrator to better understand security issues, and to approach networking from a new, more creative perspective. The sys admin can apply this knowledge to network monitoring, policy enforcement, evidence analysis, IDS, honeypots, firewalls, and forensics.
Development of Concurrent Systems through Coordination
Authors: Chia-Chu Chiang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

We are presenting an approach to developing concurrent systems through coordination. A specification language is used to describe system behaviors. The specification is then analyzed to create a coordination description that is a data structure describing the properties of the coordination among processes. Our language mapping approach allows a coordination description automatically created in any target programming language. Developers can then write a program in the target language to include the coordination description for execution. A familiar programming model will be provided to support implicit communication, concurrency, synchronization, and parallelism in systems through an implicit coordinationoriented approach. In other words, developers do not have to explicitly express communication, concurrency, synchronization, and parallelism when they are developing concurrent systems.
A Time for Reflection
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2005)

Software reflection, a technique or approach that makes software self-aware, is similar to human reflection, although not as subjective or complicated. Proper use of software reflection can produce flexible, adaptable applications. In a sense, reflective applications, like reflective people, are capable of dynamic self-improvement.
SmartRestaurant: mobile payments in context-aware environment
Authors: Janne Lukkari, Jani Korhonen, Timo Ojala
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Mobility, context-awareness and payment combined provide a customer with a completely new setting of consuming services at any time and any place. We introduce SmartRestaurant service, which allows customers to use mobile devices for ordering and paying lunches from a nearby campus restaurant beforehand. Further, SmartRestaurant provides the restaurant with means of adjusting the sales with production capacity and prior knowledge of upcoming orders. We present a user evaluation of the system in form of a field trial in the real environment of use.
Locality and Information Transfer in Quantum Operations
Authors: Benjamin Schumacher, Michael D. Westmoreland
Venue: Quantum Information Processing (2005)

We investigate the situation in which no information can be transferred from a quantum system B to a quantum system A, even though both interact with a common system C.
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
Authors: Songting Chen, Elke A. Rundensteiner
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot and unpivot. Typically, such queries are fairly complex and are often executed over huge volumes of data. The solution in practice is to use materialized views to reduce the query cost. Utilizing materialized views that incorporate not just traditional simple SELECT-PROJECT-JOIN operators but also complex OLAP operators such as pivot and unpivot is crucial to improve the OLAP query performance but as of now unexplored topic. In this work, we demonstrate that the efficient maintenance of views with pivot and unpivot operators requires the definition of more generalized operators, which we call GPIVOT and GUNPIVOT. We propose rewriting rules, combination rules and propagation rules for such operators. We also design a novel view maintenance framework for applying these rules to obtain an efficient maintenance plan. Our query transformation rules are thus dual purpose serving both view maintenance and query optimization. This paves the way for the inclusion of the GPIVOT and GUNPIVOT into any DBMS engine.
Extracting content from accessible web pages
Authors: Suhit Gupta, Gail Kaiser
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Web pages often contain clutter (such as ads, unnecessary animations and extraneous links) around the body of an article, which distracts a user from actual content. This can be especially inconvenient for blind and visually impaired users. The W3C's Web Accessibility Initiative (WAI) has defined a set of guidelines to make web pages more compatible with tools built specifically for persons with disabilities. While this initiative has put forth an excellent set of principles, unfortunately many websites continue to be inaccessible as well as cluttered. In order to address the clutter problem, we have developed a framework that employs a host of heuristics in the form of tunable filters for the purpose of content extraction. Our hypothesis is that automatically filtering out selected elements from websites will leave the base content that users are interested in and, as a side-effect, render them more accessible. Although our heuristics are intuition-based, rather than derived from the W3C accessibility guidelines, we imagined however that they would have little impact on web pages that are fully compliant with the accessibility guidelines. We were wrong: some (technically) accessible web pages still include significant clutter. This paper discusses our content extraction framework and its application to accessible web pages.
Using name-internal and contextual features to classify biological terms
Authors: Manabu Torii, Sachin Kamboj, K. Vijay-Shanker
Venue: Journal of Biomedical Informatics (2004)

There has been considerable work done recently in recognizing named entities in biomedical text. In this paper, we investigate the named entity classification task, an integral part of the named entity extraction task. We focus on the different sources of information that can be utilized for classification, and note the extent to which they are effective in classification. To classify a name, we consider features that appear within the name as well as nearby phrases. We also develop a new strategy based on the context of occurrence and show that they improve the performance of the classification system. We show how our work relates to previous works on named entity classification in the biological domain as well as to those in generic domains. The experiments were conducted on the GENIA corpus Ver. 3.0 developed at University of Tokyo. We achieve f value of 86 in 10-fold cross validation evaluation on this corpus.
Stream engine: a new kernel interface for high-performance internet streaming servers
Authors: Jonathan Lemon, Zhe Wang, Zheng Yang, Pei Cao
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

As high-speed Internet connections and Internet streaming media become widespread, the demand for high-performance, cheap Internet streaming servers increases. In this paper, we look into the performance limitations of streaming server applications running on PC servers with Linux, and propose a new kernel optimization called "stream engine" that combines both copy elimination and context switch avoidance to double the streaming server throughput. Our experiments with stream engine show that for Internet streaming, eliminating context switches is just as important as eliminating data copying. Using profile data, we also project the benefits of TCP offloading hardware implementing part or all of the stream engine optimization.
Curvature-bounded traversals of narrow corridors
Authors: Sergey Bereg, David Kirkpatrick
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshold τ with the property that (a) all corridors of width at least τ admit a unit-curvature traversal and (b) for any width w < τ there exist corridors of width w with no such traversal. Applications to the design of short, but not necessarily shortest, and high clearance, but not necessarily maximum clearance, curvature-bounded paths in general polygonal domains, are also discussed.
REGoLive: Web Site Comprehension with Viewpoints
Authors: Grace Gui, Holger M. Kienle, Hausi A. Muller
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

This paper describes a demonstration of the REGoLive reverse engineering tool. REGoLive supports comprehension of Web sites with three distinct viewpoints: developer-view, server-view, and client-view. Each viewpoint provides unique information about a Web site, which is not contained in other viewpoints. REGoLive is built on top of the Go-Live Web authoring tool, which allows us to expose the developer-view of sites that have been built with GoLive. REGoLive shows a graph visualization of each viewpoint and allows the reverse engineer to navigate mappings between them. We believe that all three viewpoints are necessary to understand a Web site effectively.
A diagnostic method for detecting and assessing the impact of physical design optimizations on routing
Authors: Robert Lembach, Rafael A. Arce-Nazario, Donald Eisenmenger, Cory Wood
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, we describe a method to independently audit a physical design to identify inefficiencies detrimental to high quality routing. The method provides an exhaustive review of netlist structures having many possible equivalent solutions, such as buffer trees, as well as other structures with flexibility of implementation. In addition, the method provides a means to quantify the inefficiency, in terms of routing length and the impact to routing congestion. Lastly, the method gives physical design engineers a framework to quickly identify causes of routing congestion and identify structures that can be acted upon to enhance routing.
Table-driven rules in expert systems
Authors: Alexander Pasik, Marshall Schor
Venue: Issue 87 (January 1984) (1984)

The structure and organization of expert systems can be usefully modeled after corresponding human experts. Often this modeling degrades because of insufficient expressive power in production system languages. Relational table techniques provide additional abstraction capabilities and are useful in extending the expressiveness of production system rules; the resulting systems can be easier to build, understand and debug because they can reflect more accurately human methods of reasoning. The number of superfluous rules is reduced by organizing much of the problem domain knowledge in relations in working memory. The relational table methods also provide a tool for the interfacing of knowledge bases and databases.
Optimal Energy-Efficient Routing for Wireless Sensor Networks
Authors: Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Cheng, Yean-Fu Wen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The network lifetime for wireless sensor network plays an important role to survivability, Thus, we indicate the importance of routing protocol to network lifetime, and model the expected retransmission time as a convex function with respect to aggregate jlow on each sensor node. Thus we formulate the optimal energy-eficient routing as a non-linear min-max programming problem with convex productform, which can be optimally solved by optimal routing framework. Based on the optimal routing framework, we propose Lagrangean-based algorithm and primal optimal algorithm. By the combination of these two algorithms, we can optimally and efficiently get the routing assignment to maximize the network life in the sensor network. From experiments,we observe that when the optimal network lifetime increases as the number of sensor nodes increase. While the shortest path-based heuristic algorithm can only achieve about 48% network lifetime compared to our solution approach.
The microcomputer as a tool in numerical analysis
Authors: Kris Stewart
Venue: ACM SIGNUM Newsletter (1980)

The affordability of microcomputers makes them a practical tool for scientific computations and development of algorithms as well as a dramatic teaching aid. A package of mathematical software called SCRUNCH (1) is available to run in BASIC on moderate sized microcomputers (at least 8K and preferably 16K program space) to aid in the above tasks. SCRUNCH consists of translations of FORTRAN routines taken from three excellent sources:
FTC cracks down on spyware and PC hijacking, but not true lies
Authors: Richard H. Stern
Venue: IEEE Micro (2005)

The US Federal Trade Commission (FTC) recently sued an Internet marketing organization to make it stop infecting consumers' PCs with spyware. According to the FTC, Seismic Entertainment Productions developed a scheme that seized control of PCs nationwide, infected them with spyware and other malicious software, bombarded them with a barrage of pop-up advertising for Seismic's clients, exposed the PCs to security risks, and caused them to malfunction, slow down, and, at times, crash. Seismic then offered to sell the victims an "antispyware" program to fix the computers, and stop the popups and other problems that Seismic had caused.
A Hybrid Graphical Model for Robust Feature Extraction from Video
Authors: A. Taylan Cemgil, Wojciech Zajdel, Ben J. A. Krose
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We consider a visual scene analysis scenario where objects e.g., people, cars) pass through the viewingfield of a static camera and need to be detected and segmented from the background. For this purpose, we introduce a hybrid dynamic Bayesian network and derive an Expectation propagation (EP)algorithmfor robust estimation of object shapes and appearance statistics. We demonstrate the viability of the approximation on an object detection taskfrom real videos, where objectsý smooth shapes are segmented from the background. The model is readily extendible to multi-object multi-camera scenarios and can be coupled in a transparent and consistentway with a hierarchical model for object identification under uncertainty.
Photographic storage of AI information
Authors: Alan E. Filsinger
Venue: Issue 73 (October 1980) (1980)

As AI projects often use large amounts of storage, the development of high resolution for storing and retrieving data on photo-graphic film may in the future provide a contribution.
Platform-independent accessibility API: accessible document object model
Authors: Andres Gonzalez, Loretta Guarino Reid
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

This paper addresses the problem of supporting accessibility in applications that run in multiple operating environments. It analyzes the commonalities of existing platform-specific Accessibility APIs, and defines a platform-independent accessibility API, the Accessible DOM.The Accessible DOM encompasses the features of existing APIs and overcomes the limitations of existing APIs to express dynamic, complex document contents.The Accessible DOM can be used to support existing and future platform-specific accessibility APIs. It will also allow the development of platform-independent accessibility clients.
CORBA-based distributed and replicated resource repository architecture for hierarchically configurable home network
Authors: Jun Ho Park, Myung Jin Lee, Soon Ju Kang
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Home networks are typically ubiquitous computing networks consisting of various consumer devices and services. Although many middlewares have already been developed and used to implement partial services in home networks, none has yet emerged as a generic home network middleware architecture, as existing middlewares are designed to accommodate specific services, making them unable to cover all services or satisfy the desires of home users. Accordingly, the current paper presents a hierarchically configurable home network architecture as a generic and conceptual home network model, plus a middleware framework is proposed to realize the conceptual model. In the middleware framework, a distributed and replicated resource repository architecture is introduced to realize multi-services within a single home network platform. The proposed middleware was developed and implemented using CORBA within an IEEE1394-based home network, and its performance verified experimentally.
Multidimensional models: constructing data CUBE
Authors: Antoaneta Ivanova, Boris Rachev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The goal of this article is to depict algorithms and new approach of creating data cube efficiently and to set tasks for future work. In short, the paper has described it as a data abstraction that allows one to view aggregated data from a number of perspectives: 1) Conceptually, the cube consists of a base cuboid, surrounded by a collection of sub-cubes that represent the aggregation of the base cuboid along one or more dimensions; 2) The basic methods for computing a group-by: sort-based and hash-based. 3) Dynamic Data Cube, which provide efficient performance and allows for the data cube expansion in any direction. 4) OO Conceptual Model Data Cube - class definition of data cube.