OpenRaiser/Intern-Atlas huggingface dataset:
Higher-Order Pattern Complement and the Strict Lambda-Calculus
Venue: arXiv cs.LO 2001
Year: 2001

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a finite set of patterns. We therefore generalize the simply-typed lambda-calculus to include an internal notion of strict function so that we can directly express that a term must depend on a given variable. We show that, in this more expressive calculus, finite sets of patterns without repeated variables are closed under complement and intersection. Our principal application is the transformational approach to negation in higher-order logic programs.
ICANN and Antitrust
Venue: arXiv cs.CY 2001
Year: 2001

The Internet Corporation for Assigned Names and Numbers (ICANN) is a private non-profit company which, pursuant to contracts with the US government, acts as the de facto regulator for DNS policy. ICANN decides what TLDs will be made available to users, and which registrars will be permitted to offer those TLDs for sale. In this article we focus on a hitherto-neglected implication of ICANN's assertion that it is a private rather than a public actor: its potential liability under the U.S. antitrust laws, and the liability of those who transact with it. ICANN argues that it is not as closely tied to the government as NSI and IANA were in the days before ICANN was created. If this is correct, it seems likely that ICANN will not benefit from the antitrust immunity those actors enjoyed. Some of ICANN's regulatory actions may restrain competition, e.g. its requirement that applicants for new gTLDs demonstrate that their proposals would not enable competitive (alternate) roots and ICANN's preventing certain types of non-price competition among registrars (requiring the UDRP). ICANN's rule adoption process might be characterized as anticompetitive collusion by existing registrars, who are likely not be subject to the Noerr-Pennington lobbying exemption. Whether ICANN has in fact violated the antitrust laws depends on whether it is an antitrust state actor, whether the DNS is an essential facility, and on whether it can shelter under precedents that protect standard-setting bodies. If (as seems likely) a private ICANN and those who petition it are subject to antitrust law, everyone involved in the process needs to review their conduct with an eye towards legal liability. ICANN should act very differently with respect to both the UDRP and the competitive roots if it is to avoid restraining trade.
Value of Usage and Seller's Listing Behavior in Internet Auctions
Venue: arXiv cs.CY 2001
Year: 2001

In this paper, we aim to empirically examine the value of website usage and sellers' listing behavior in the two leading Internet auctions sites, eBay and Yahoo!Auctions. The descriptive data analysis of the seller's equilibrium listing behavior indicates that a seller's higher expected auction revenue from eBay is correlated with a lager number of potential bidders measured by website usage per listing. Our estimation results, based on the logarithm specifications of sellers' expected auction revenues and potential bidders' website usage, show that in a median case, (i) 1 percent increase of the unique visitors (page views) per listed item induces 0.022 (0.007) percent increase of a seller's expected auction revenue; and (ii) 1 percent increase of sellers' listings induces 1.99 (4.74) percent increase of the unique visitors (page views). Since increased expected auction revenues will induce more listings, we can infer positive feedback effects between the number of listings and website usage. Consequently, Yahoo!Auctions, which has substantially less listings, has greater incentives to increase listings via these feedback effects which are reflected in its fee schedules.
E PLURIBUS ENUM: Unifying International Telecommunications Networks and Governance
Venue: arXiv cs.CY 2001
Year: 2001

ENUM effectively bridges the telephone and Internet worlds by placing telephone numbers from the ITU Rec. E.164 public telecommunication numbering plan into the Internet Domain Name System (DNS) as domain names. ENUM potentially presents significant public policy issues at both the domestic and international levels. Ultimately, it should not matter whether ENUM is approached as a telecommunications issue or an Internet issue because: (1) they are becoming the same thing technically, and (2) they engage the same global public interests. For the same reasons as apply to traditional telecommunications, and even to the Internet itself, public oversight of ENUM naming, numbering, and addressing resources is justified both by technical necessity and the interests of consumer protection (particularly personal privacy) and competition at higher service layers. A single, coordinated global DNS domain for at least Tier 0 (the international level) of the ENUM names hierarchy should be designated by public authorities. Many of the technical characteristics and policy considerations relevant at the ENUM Tier 0 and 1 zones are also directly applicable to the Internet's IP address space and DNS root (or Tier 0) zone - key shared elements of the Internet's logical infrastructure. Despite the fundamentally international nature of the Internet's logical infrastructure layer, and the purported privatization of administration of its IP address space and the DNS, Internet governance is not yet truly international. The ENUM policy debate illustrates the need for authoritative international public oversight of public communications network logical infrastructure, including that of traditional telecommunications, the Internet, and ENUM.
Competition and Globalization Brazilian Telecommunications Policy at Crossroads
Venue: arXiv cs.CY 2001
Year: 2001

The current pattern of competition in the Brazilian telecommunications market was defined by a regulatory reform implemented in the second half of the nineties. The telecommunications regulatory reform discussed in the paper promoted the privatization of Telebras System and fostered competition in the Brazilian market under the stricted supervision of the new regulator Anatel. Notwithstanding, the regulatory Brazilian scheme is at a crossroads. From 2002 on an open market approach will be implemented in telecom arena. We analyse the main aspects of those change, from the firms perspective and also in a broad scenario under influence of the World Trade Organization system
Efficient Choice, Inefficient Democracy? The Implications of Cable and Internet Access for Political Knowledge and Voter Turnout
Venue: arXiv cs.CY 2001
Year: 2001

This paper explains why, despite a marked increase in available political information on cable television and the Internet, citizens' levels of political knowledge have, at best, remained stagnant (Delli Carpini & Keeter, 1996). Since the availability of entertainment content has increased too, the effect of new media on knowledge and vote likelihood should be determined by people's relative preferences for entertainment and information. Access to new media should increase knowledge and vote likelihood among people who prefer news. At the same time, it is hypothesized to have a negative effect on knowledge and turnout for people who prefer entertainment content. Hypotheses are tested by building a measure of Relative Entertainment Preference (REP) from existing NES and Pew survey data. Results support the predicted interaction effect of media environment (cable and/or Internet access) and motivation (REP) on political knowledge and turnout. In particular, people who prefer entertainment to news and have access to cable television and the Internet are less knowledgeable and less likely to vote than any other group of people.
Algorithmic Self-Assembly of DNA Tiles and its Application to Cryptanalysis
Venue: arXiv cs.CR 2001
Year: 2001

The early promises of DNA computing to deliver a massively parallel architecture well-suited to computationally hard problems have so far been largely unkept. Indeed, it is probably fair to say that only toy problems have been addressed experimentally. Recent experimental development on algorithmic self-assembly using DNA tiles seem to offer the most promising path toward a potentially useful application of the DNA computing concept. In this paper, we explore new geometries for algorithmic self-assembly, departing from those previously described in the literature. This enables us to carry out mathematical operations like binary multiplication or cyclic convolution product. We then show how to use the latter operation to implement an attack against the well-known public-key crypto system NTRU.
Information retrieval in Current Research Information Systems
Venue: arXiv cs.IR 2001
Year: 2001

In this paper we describe the requirements for research information systems and problems which arise in the development of such system. Here is shown which problems could be solved by using of knowledge markup technologies. Ontology for Research Information System offered. Architecture for collecting research data and providing access to it is described.
The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine
Venue: arXiv cs.OH 2001
Year: 2001

Conception, design, and implementation of cDNA microarray experiments present a variety of bioinformatics challenges for biologists and computational scientists. The multiple stages of data acquisition and analysis have motivated the design of Expresso, a system for microarray experiment management. Salient aspects of Expresso include support for clone replication and randomized placement; automatic gridding, extraction of expression data from each spot, and quality monitoring; flexible methods of combining data from individual spots into information about clones and functional categories; and the use of inductive logic programming for higher-level data analysis and mining. The development of Expresso is occurring in parallel with several generations of microarray experiments aimed at elucidating genomic responses to drought stress in loblolly pine seedlings. The current experimental design incorporates 384 pine cDNAs replicated and randomly placed in two specific microarray layouts. We describe the design of Expresso as well as results of analysis with Expresso that suggest the importance of molecular chaperones and membrane transport proteins in mechanisms conferring successful adaptation to long-term drought stress.
A Symmetric Strategy in Graph Avoidance Games
Venue: arXiv cs.DM 2001
Year: 2001

In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to a forbidden graph F loses. A symmetric strategy of the second player ensures that, independently of the first player's strategy, the blue and the red subgraph are isomorphic after every round of the game. We address the class of those graphs G that admit a symmetric strategy for all F and discuss relevant graph-theoretic and complexity issues. We also show examples when, though a symmetric strategy on G generally does not exist, it is still available for a particular F.
Teaching Parallel Programming Using Both High-Level and Low-Level Languages
Venue: arXiv cs.DC 2001
Year: 2001

We discuss the use of both MPI and OpenMP in the teaching of senior undergraduate and junior graduate classes in parallel programming. We briefly introduce the OpenMP standard and discuss why we have chosen to use it in parallel programming classes. Advantages of using OpenMP over message passing methods are discussed. We also include a brief enumeration of some of the drawbacks of using OpenMP and how these drawbacks are being addressed by supplementing OpenMP with additional MPI codes and projects. Several projects given in my class are also described in this paper.
Applications of the Differential Calculus in the Study of the Timed Automata: the Inertial Delay Buffer
Venue: arXiv cs.LO 2001
Year: 2001

We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the R->{0,1} functions.
Intelligent Anticipated Exploration of Web Sites
Venue: arXiv cs.AI 2001
Year: 2001

In this paper we describe a web search agent, called Global Search Agent (hereafter GSA for short). GSA integrates and enhances several search techniques in order to achieve significant improvements in the user-perceived quality of delivered information as compared to usual web search engines. GSA features intelligent merging of relevant documents from different search engines, anticipated selective exploration and evaluation of links from the current result set, automated derivation of refined queries based on user relevance feedback. System architecture as well as experimental accounts are also illustrated.
The SDSS SkyServer, Public Access to the Sloan Digital Sky Server Data
Venue: arXiv cs.DL 2001
Year: 2001

The SkyServer provides Internet access to the public Sloan Digital Sky Survey (SDSS) data for both astronomers and for science education. This paper describes the SkyServer goals and architecture. It also describes our experience operating the SkyServer on the Internet. The SDSS data is public and well-documented so it makes a good test platform for research on database algorithms and performance.
First Experiences Integrating PC Distributed I/O Into Argonne's ATLAS Control System
Venue: arXiv cs.OH 2001
Year: 2001

First Experiences Integrating PC Distributed I/O Into Argonne's ATLAS Control System The roots of ATLAS (Argonne Tandem-Linac Accelerator System) date back to the early 1960s. Located at the Argonne National Laboratory, the accelerator has been designated a National User Facility, which focuses primarily on heavy-ion nuclear physics. Like the accelerator it services, the control system has been in a constant state of evolution. The present real-time portion of the control system is based on the commercial product Vsystem [1]. While Vsystem has always been capable of distributed I/O processing, the latest offering of this product provides for the use of relatively inexpensive PC hardware and software. This paper reviews the status of the ATLAS control system, and describes first experiences with PC distributed I/O.
Data Acquisition and Database Management System for Samsung Superconductor Test Facility
Venue: arXiv cs.DB 2001
Year: 2001

In order to fulfill the test requirement of KSTAR (Korea Superconducting Tokamak Advanced Research) superconducting magnet system, a large scale superconducting magnet and conductor test facility, SSTF (Samsung Superconductor Test Facility), has been constructed at Samsung Advanced Institute of Technology. The computer system for SSTF DAC (Data Acquisition and Control) is based on UNIX system and VxWorks is used for the real-time OS of the VME system. EPICS (Experimental Physics and Industrial Control System) is used for the communication between IOC server and client. A database program has been developed for the efficient management of measured data and a Linux workstation with PENTIUM-4 CPU is used for the database server. In this paper, the current status of SSTF DAC system, the database management system and recent test results are presented.
Distributed Computing for Localized and Multilayer Visualizations
Venue: arXiv cs.DC 2001
Year: 2001

The aim of this paper is to develop an approach to visualizations that benefits from distributed computing. Three schemes of process distribution are considered: parallel, pipeline, and expanding pipeline computations. Expanding pipeline structure synthesizes the advantages and traits of both parallel and pipeline computations. In expanding pipeline computing, a novel approach presented in this paper, a multiplicity of processes are concurrently developed in parallel and knotted processor pipelines. The theoretical foundations for expanding pipeline computing as a computational process are in the domains of alternating Turing machines, molecular computing, and E-machines. Expanding pipeline computing constitutes the development of the conventional pipeline architecture aimed at utilization of implicit parallel structures existing in algorithms. Such structures appear in various kinds of visualization. Image deriving and processing is a field that provides diverse opportunities for utilization of the advantages of distributed computing. The most relevant to the distributed architecture is stratified visualization with its two cases based on data localization and layer separation. Visualization is treated here as a special case of simulation. The conceptual approach to distributed computing developed in this paper have been applied to visualization in a computer support system, which is utilized in radiology and namely, for the noninvasive treatment of brain aneurysms.
Next Generation EPICS Interface to Abstract Data
Venue: arXiv cs.NI 2001
Year: 2001

The set of externally visible properties associated with process variables in the Experimental Physics and Industrial Control System (EPICS) is predefined in the EPICS base distribution and is therefore not extensible by plug-compatible applications. We believe that this approach, while practical for early versions of the system with a smaller user base, is now severely limiting expansion of the high-level application tool set for EPICS. To eliminate existing barriers, we propose a new C++ based interface to abstract containerized data. This paper describes the new interface, its application to message passing in distributed systems, its application to direct communication between tightly coupled programs co-resident in an address space, and its paramount position in an emerging role for EPICS - the integration of dissimilar systems.
Upgrade of Spring-8 Beamline Network with Vlan Technology Over Gigabit Ethernet
Venue: arXiv cs.NI 2001
Year: 2001

The beamline network system at SPring-8 consists of three LANs; a BL-LAN for beamline component control, a BL-USER-LAN for beamline experimental users and an OA-LAN for the information services. These LANs are interconnected by a firewall system. Since the network traffic and the number of beamlines have increased, we upgraded the backbone of BL-USER-LAN from Fast Ethernet to Gigabit Ethernet. And then, to establish the independency of a beamline and to raise flexibility of every beamline, we also introduced the IEEE802.1Q Virtual LAN (VLAN) technology into the BL-USER-LAN. We discuss here a future plan to build the firewall system with hardware load balancers.
Large-Scale Corba-Distributed Software Framework for Nif Controls
Venue: arXiv cs.DC 2001
Year: 2001

The Integrated Computer Control System (ICCS) is based on a scalable software framework that is distributed over some 325 computers throughout the NIF facility. The framework provides templates and services at multiple levels of abstraction for the construction of software applications that communicate via CORBA (Common Object Request Broker Architecture). Various forms of object-oriented software design patterns are implemented as templates to be extended by application software. Developers extend the framework base classes to model the numerous physical control points, thereby sharing the functionality defined by the base classes. About 56,000 software objects each individually addressed through CORBA are to be created in the complete ICCS. Most objects have a persistent state that is initialized at system start-up and stored in a database. Additional framework services are provided by centralized server programs that implement events, alerts, reservations, message logging, database/file persistence, name services, and process management. The ICCS software framework approach allows for efficient construction of a software system that supports a large number of distributed control points representing a complex control application.
Open Source Real Time Operating Systems Overview
Venue: arXiv cs.OS 2001
Year: 2001

Modern control systems applications are often built on top of a real time operating system (RTOS) which provides the necessary hardware abstraction as well as scheduling, networking and other services. Several open source RTOS solutions are publicly available, which is very attractive, both from an economic (no licensing fees) as well as from a technical (control over the source code) point of view. This contribution gives an overview of the RTLinux and RTEMS systems (architecture, development environment, API etc.). Both systems feature most popular CPUs, several APIs (including Posix), networking, portability and optional commercial support. Some performance figures are presented, focusing on interrupt latency and context switching delay.
HyperPro An integrated documentation environment for CLP
Venue: arXiv cs.PL 2001
Year: 2001

The purpose of this paper is to present some functionalities of the HyperPro System. HyperPro is a hypertext tool which allows to develop Constraint Logic Programming (CLP) together with their documentation. The text editing part is not new and is based on the free software Thot. A HyperPro program is a Thot document written in a report style. The tool is designed for CLP but it can be adapted to other programming paradigms as well. Thot offers navigation and editing facilities and synchronized static document views. HyperPro has new functionalities such as document exportations, dynamic views (projections), indexes and version management. Projection is a mechanism for extracting and exporting relevant pieces of code program or of document according to specific criteria. Indexes are useful to find the references and occurrences of a relation in a document, i.e., where its predicate definition is found and where a relation is used in other programs or document versions and, to translate hyper-texts links into paper references. It still lack importation facilities.
A comparison of Zeroes and Ones of a Boolean Polynomial
Venue: arXiv cs.CC 2001
Year: 2001

In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2. The next case of degree 3 appears to be PP-complete under polynomial reductions in the class of promise problems. The proof is based on techniques of quantum computation.
Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication
Venue: arXiv cs.CL 2001
Year: 2001

In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars (CFGs), yielding the asympotically fastest (although not practical) CFG parsing algorithm known. We prove a dual result: any CFG parser with time complexity $O(g n^{3 - \epsilson})$, where $g$ is the size of the grammar and $n$ is the length of the input string, can be efficiently converted into an algorithm to multiply $m \times m$ Boolean matrices in time $O(m^{3 - ε/3})$. Given that practical, substantially sub-cubic Boolean matrix multiplication algorithms have been quite difficult to find, we thus explain why there has been little progress in developing practical, substantially sub-cubic general CFG parsers. In proving this result, we also develop a formalization of the notion of parsing.