bluuebunny/crossref_metadata_2025 huggingface dataset:
The text REtrieval conference (TREC)
Authors: Voorhees Ellen M. , Harman Donna
Published: January 2007

Text retrieval systems have historically been refined through experimentation on test collections. In 1990 NIST was asked to build a very large test collection for use in evaluation of text retrieval technology in the DARPA TIPSTER project. This collection was to be on the order of 1 million full-text documents: a magnitude about 100 times larger than any existing non-proprietary test collection. The following year NIST proposed that this collection be made available to the full research community by the formation of the Text REtrieval Conference (TREC). The first conference took place in September, 1992 with 25 participating groups including most of the leading text retrieval research groups. Although scaling their research algorithms to handle this near-operational amount of text (for 1992) was a Herculean task, groups joined TREC to get the test data and to take part in the first major cross-system search engine evaluation. Participation in TREC has since increased each year. The most recent TREC (TREC-8 held in November, 1999) had 66 participating groups representing 16 different countries.This paper serves as a general introduction to TREC. Detailed information about TREC including the complete Proceedings for each workshop, instructions for obtaining test collections, and the Call for Participation for TREC-9 can be found on the TREC web site at http://trec.nist.gov. Task descriptions for some of the tasks to be done in TREC-9 follow in this issue. To participate in TREC-9, follow the instructions given in the Call for Participation.
A case for end system multicast (keynote address)
Authors: Chu Yang-hua , Rao Sanjay G. , Zhang Hui
Published: January 2007

The conventional wisdom has been that IP is the natural protocol layer for implementing multicast related functionality. However, ten years after its initial proposal, IP Multicast is still plagued with concerns pertaining to scalability, network management, deployment and support for higher layer functionality such as error, flow and congestion control. In this paper, we explore an alternative architecture for small and sparse groups, where end systems implement all multicast related functionality including membership management and packet replication. We call such a scheme End System Multicast. This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP Multicast. However, the key concern is the performance penalty associated with such a model. In particular, End System Multicast introduces duplicate packets on physical links and incurs larger end-to-end delay than IP Multicast. In this paper, we study this question in the context of the Narada protocol. In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. In addition, Narada attempts to optimize the efficiency of the overlay based on end-to-end measurements. We present details of Narada and evaluate it using both simulation and Internet experiments. Preliminary results are encouraging. In most simulations and Internet experiments, the delay and bandwidth penalty are low. We believe the potential benefits of repartitioning multicast functionality between end systems and routers significantly outweigh the performance penalty incurred.
Implications of proxy caching for provisioning networks and servers
Authors: Raunak Mohammad S. , Shenoy Prashant , Goyal Pawan , Ramamritham Krithi
Published: January 2007

In this paper, we examine the potential benefits of web proxy caches in improving the effective capacity of servers and networks. Since networks and servers are typically provisioned based on a high percentile of the load, we focus on the effects of proxy caching on the tail of the load distribution. We find that, unlike their substantial impact on the average load, proxies have a diminished impact on the tail of the load distribution. The exact reduction in the tail and the corresponding capacity savings depend on the percentile of the load distribution chosen for provisioning networks and servers—the higher the percentile, the smaller the savings. In particular, compared to over a 50% reduction in the average load, the savings in network and server capacity is only 20-35% for the 99
th
percentile of the load distribution. We also find that while proxies can be somewhat useful in smoothing out some of the burstiness in web workloads; the resulting workload continues, however, to exhibit substantial burstiness and a heavy-tailed nature. We identify large objects with poor locality to be the limiting factor that diminishes the impact of proxies on the tail of load distribution. We conclude that, while proxies are immensely useful to users due to the reduction in the average response time, they are less effective in improving the capacities of networks and servers.
Cluster reserves
Authors: Aron Mohit , Druschel Peter , Zwaenepoel Willy
Published: January 2007

In network (e.g., Web) servers, it is often desirable to isolate the performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimal proportion of server resources are available for a class of requests, independent of the load imposed by other requests. Recent work demonstrates how to achieve this performance isolation in servers consisting of a single, centralized node; however, achieving performance isolation in a distributed, cluster based server remains a problem.

This paper introduces a new abstraction, the cluster reserve, which represents a resource principal in a cluster based network server. We present a design and evaluate a prototype implementation that extends existing techniques for performance isolation on a single node server to cluster based servers.

In our design, the dynamic cluster-wide resource management problem is formulated as a constrained optimization problem, with the resource allocations on individual machines as independent variables, and the desired cluster-wide resource allocations as constraints. Periodically collected resource usages serve as further inputs to the problem.

Experimental results show that cluster reserves are effective in providing performance isolation in cluster based servers. We demonstrate that, in a number of different scenarios, cluster reserves are effective in ensuring performance isolation while enabling high utilization of the server resources.
The content and access dynamics of a busy Web server (poster session)
Authors: Padmanabhan Venkata N. , Qiu Lili
Published: January 2007

We study the MSNBC Web site, one of the busiest in the Internet today. We analyze the dynamics of content creation and modification as well as client accesses. Our key findings are (a) files tend to change little upon modification, (b) a small set of files get modified repeatedly, (c) file popularity follows a Zipf-like distribution with an α much larger than reported in previous, proxy-based studies, and (d) there is significant temporal stability in file popularity but not much stability in the domains from which popular content is accessed. We discuss implications of these findings.
The incremental deployability of RTT-based congestion avoidance for high speed TCP Internet connections
Authors: Martin Jim , Nilsson Arne , Rhee Injong
Published: January 2007

Our research focuses on end-to-end congestion avoidance algorithms that use round trip time (RTT) fluctuations as an indicator of the level of network congestion. The algorithms are referred to as
delay-based congestion avoidance
or DCA. Due to the economics associated with deploying change within an existing network, we are interested in an incrementally deployable enhancement to the TCP/Reno protocol. For instance, TCP/Vegas, a DCA algorithm, has been proposed as an incremental enhancement. Requiring relatively minor modifications to a TCP sender, TCP/Vegas has been shown to increase end-to-end TCP throughput primarily by avoiding packet loss. We study DCA in today's best effort Internet where IP switches are subject to thousands of TCP flows resulting in congestion with time scales that span orders of magnitude. Our results suggest that RTT-based congestion avoidance may not be reliably incrementally deployed in this environment. Through extensive measurement and simulation, we find that when TCP/DCA (i.e., a TCP/Reno sender that is extended with DCA) is deployed over a high speed Internet path, the flow generally experiences degraded throughput compared to an unmodified TCP/Reno flow. We show (1) that the congestion information contained in RTT samples is not sufficient to predict packet loss reliably and (2) that the congestion avoidance in response to delay increase has minimal impact on the congestion level over the path when the total DCA traffic at the bottleneck consumes less than 10% of the bottleneck bandwidth.
Efficient performance prediction for modern microprocessors
Authors: Ofelt David , Hennessy John L.
Published: January 2007

Generating an accurate estimate of the performance of a program on a given system is important to a large number of people. Computer architects, compiler writers, and developers all need insight into a machine's performance. There are a number of performance estimation techniques in use, from profile-based approaches to full machine simulation. This paper discusses a profile-based performance estimation technique that uses a lightweight instrumentation phase that runs in order number of dynamic instructions, followed by an analysis phase that runs in roughly order number of static instructions. This technique accurately predicts the performance of the core pipeline of a detailed out-of-order issue processor model while scheduling far fewer instructions than does full simulation. The difference between the predicted execution time and the time obtained from full simulation is only a few percent.
An analytical model of the working-set sizes in decision-support systems
Authors: Karlsson Magnus , Stenström Per
Published: January 2007

This paper presents an analytical model to study how working sets scale with database size and other applications parameters in decision-support systems (DSS). The model uses application parameters, that are measured on down-scaled database executions, to predict cache miss ratios for executions of large databases.

By applying the model to two database engines and typical DSS queries we find that, even for large databases, the most performance-critical working set is small and is caused by the instructions and private data that are required to access a single tuple. Consequently, its size is not affected by the database size. Surprisingly, database data may also exhibit temporal locality but the size of its working set critically depends on the structure of the query, the method of scanning, and the size and the content of the database.
Stable Internet routing without global coordination
Authors: Gao Lixin , Rexford Jennifer
Published: January 2007

The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, BGP permits ASes to have conflicting policies that can lead to routing instability. This paper proposes a set of guidelines for an AS to follow in setting its routing policies, without requiring coordination with other ASes. Our approach exploits the Internet's hierarchical structure and the commercial relationships between ASes to impose a partial order on the set of routes to each destination. The guidelines conform to conventional traffic-engineering practices of ISPs, and provide each AS with significant flexibility in selecting its local policies. Furthermore, the guidelines ensure route convergence even under changes in the topology and routing policies. Drawing on a formal model of BGP, we prove that following our proposed policy guidelines guarantees route convergence. We also describe how our methodology can be applied to new types of relationships between ASes, how to verify the hierarchical AS relationships, and how to realize our policy guidelines. Our approach has significant practical value since it preserves the ability of each AS to apply complex local policies without divulging its BGP configurations to others.
Tune to Lambda patching
Authors: Griwodz Carsten , Liepert Michael , Zink Michael , Steinmetz Ralf
Published: January 2007

A recent paper by Hua, Cai and Sheu [7] describes
Patching
as a technique for reducing server load in a true video-on-demand (TVoD) system. It is a scheme for multicast video transmissions, which outperforms techniques such as Batching in response time and Piggybacking in bandwidth savings for titles of medium popularity, and probably in user satisfaction as well. It achieves TVoD performance by buffering part of the requested video in the receiving end-system.In a further study, the authors give analytical and simulation details on optimized patching windows under the assumptions of the Grace and Greedy patching techniques. In our view, this does not exploit fully the calculation that was performed in that study. We state that temporal distance between two multicast streams for one movie should not be determined by a client policy or simulation. Rather, it can be calculated by the server on a per video basis, since the server is aware of the average request interarrival time for each video. Since we model the request arrivals as a Poisson process, which is defined by a single variable that is historically called λ, we call this variation "λ Patching". Furthermore, we present an optimization option "Multistream Patching" that reduces the server load further. We accept that some near video-on-demand-like traffic is generated with additional patch streams, and achieve additional gains in server load.
Resource management policies for e-commerce servers
Authors: Menaséc Daniel A. , Fonseca Rodrigo , Almeida Virgilio A. F. , Mendes Marco A.
Published: January 2007

Quality of service of e-commerce sites has been usually managed by the allocation of resources such as processors, disks, and network bandwidth, and by tracking conventional performance metrics such as response time, throughput, and availability. However, the metrics that are of utmost importance to the management of a Web store are revenue and profits. Thus, resource management schemes for e-commerce servers should be geared towards optimizing business metrics as opposed to conventional performance metrics. This paper introduces a state transition graph called Customer Behavior Model Graph (CBMG) to describe a customer session. It then presents a family of priority-based resource management policies for e-commerce servers. Priorities change dynamically as a function of the state a customer is in and as a function of the amount of money the customer has accumulated in his/her shopping cart. A detailed simulation model was developed to assess the gain of adaptive policies with respect to policies that are oblivious to economic considerations. Simulation results show that the adaptive priority scheme suggested here can increase, during peak periods, business-oriented metrics such as revenue/sec by as much as 43% over the non priority case.
Web-based multimedia courseware on knee anatomy
Authors: Gallon Nick
Published: January 2007

This project aimed at developing an interactive Web-based multimedia courseware on the anatomy of the knee. A first prototype has been developed by Mr Nick Gallon in 1998/1999. We are currently looking for funding to help build on the prototype by making major additions and improvements. This project is a collaborative effort between the School of Medicine at Liverpool University and the School of Computing and Mathematical Sciences at Liverpool John Moores University. The motivation of the project stems from the fact that there are many in-depth research studies and courseware on the anatomy of the human body in general, but there are no such studies specialising in the Knee Anatomy. We believe such a resource is needed for both people working in the medical field and also as an educational package to the public. Some of the topics covered in the courseware are included in this article.
Invariants of binary forms
Authors: Gordan P.
Published: January 2007

The system of binary forms is finite. I proved this theorem and Mr. Hilbert extended it to forms in
n
variables. In this note, a theorem is given which implies the others.
The Bioperl project
Authors: Stajich Jason , Birney Ewan
Published: January 2007

This paper describes motivation, basic structure, and usage of the Bioperl project. As an open source project, all Bioperl modules are freely available for use and contribution from the bioinformatics community. The project's goal is to produce high quality software for managing and manipulating biological information. The bioperl web site (
http://bio.perl.org
) provides news and information as well as access to source code and details about joining the project [3].
The use and implementation of interval data types in Fortran
Authors: Walster G. William
Published: January 2007

The use and implementation of interval data types in Fortran are examined. In particular, the innovations introduced in the intrinsic support for intervals in Forte
TM
Developer 6 Fortran 95 from Sun Microsystems Inc. are described and justified. Implications for future extensions to the Fortran language are also described.
HMIPv6
Authors: Castelluccia Claude
Published: January 2007

The IETF Mobile IPv6 protocol has been developped to manage global (macro) mobility. It is not adapted to local (micro) mobility since it does not support any kind of hierarchy. This paper presents a hierarchical protocol, built on top of Mobile IPv6, that separates local mobility (within a site) from global mobility (across sites) management. Local handoffs are managed locally and transparently to a mobile node' correspondent hosts while global mobility is managed with Mobile IPv6. Our scheme is flexible (several levels of hierarchy can be used), scalable, interworks with Mobile IPv6 and can be deployed gradually.
A personal view of APL
Authors: Iverson K. E.
Published: January 2007

This essay portrays a personal view of the development of several influential dialects of APL: APL2 and J. The discussion traces the evolution of the treatment of arrays, functions, and operators, as well as function definition, grammar, terminology, and spelling.
A USER INTERFACE DESIGN TOOL
Authors: England David
Published: January 2007

This paper discusses a user interface design tool for use in the Alvey ECLIPSE project. ECLIPSE is a second-generation integrated project support environment for medium to large software projects. Currently tool user interfaces in ECLIPSE are written in the Format Description Language (FDL) which defines the objects the user sees on the screen and how he/she interacts with them. FDL is interpreted at run time by a user interface management system. However, a language-based approach makes it difficult to visualise the user interface. A more direct approach is required (especially for the graphical interfaces used in Eclipse) to assist rapid prototyping and permit more user involvement in design. This paper looks at a tool for the "Direct Manipulation" [1] of interface objects and the methodology surrounding the tool. The tool is the centre of a design-prototype-evaluate iterative loop.
AN ADAPTIVE GRAPHICS ANALYZER AS A PREFERENCE-ORIENTED INTERFACE
Authors: Holynski Marek , Garneau Robert , Lu Michael
Published: January 2007

Computer graphics presentations should be tailored to the user's needs and on-the-spot applications. The manner in which an architect perceives a picture of a building could be dramatically different from the way an artist views the same structure. An architect must be a conceptualizer who observes the basic elements of design, historical style, materials and engineering techniques. In observing a structure an architect must think about functionality and plausibility of design, while an artist may care little about anything other than appearance. Computer images, therefore, should reflect visual preference, knowledge, application and perception constraints of a particular user or group of users.
AN ICON DESIGN MANUAL PAGE FOR THE USER INTERFACE OF A CAD/CAM/CAE WORKSTATION
Authors: Marcus Aaron , Arent Michael , Browne Bruce , Jacobsen Carl
Published: January 2007

The poster describes a simple procedure for evaluating the potential usability of a user interface at the earliest stages of product design. A black-box model of the user interface is generated which can be examined for inconsistency, unnecessary complexity and unpredictability.
REFINING EARLY DESIGN DECISIONS WITH A BLACK-BOX MODEL
Authors: Monk Andrew
Published: January 2007

For all the modules of Computervision's computer-aided design, engineering and manufacturing workstation, the CADDS station, the number of icons representing the various applications and tools is greater than 5000, with the new icon designs being added daily. This number of symbols is greater than the number of characters in the basic Chinese system of ideograms, according to one introduction to the language. Computervision had no icon design manual to ensure legibility, readability, and consistency among these signs, which were being developed by software groups in four different countries.
ON-LINE DOCUMENTATION AND TUTORIALS FOR AN INTEGRATED GRAPHICAL AND DATA ANALYSIS SYSTEM
Authors: Stein David M.
Published: January 2007

The Atmospheric Environment Service is the branch of the Canadian government responsible for studying and monitoring atmospheric phenomena. One of its responsibilities is the production of weather forecasts. The Forecast Research Division of AES is currently developing a prototype system to render a variety of weather forecasts in digital/graphical form. It is our intention to demonstrate what we have accomplished to date on the graphics features of this prototype. It is hoped that this demonstration will illustrate some new treatments of relatively conventional graphics input/output techniques.
GRAPHICAL ENTRY OF WEATHER FORECASTS
Authors: Trafford R. K. R.
Published: January 2007

GRAFSTAT is a software application system containing a rich and integrated set of tools for the scientist or engineer that is used widely in IBM. It runs on an IBM System/370 processor. It allows a user to• explore data interactively• create graphics• analyze data using functions of applied statistics
Transforming a company with OOP
Authors: Rinaldi Andrea
Published: January 2007

The object-oriented software development paradigm has reached the mainstream application market very soon after its boom in research institutions. However, the lack of an organized work plan has spelt the doom of those who jumped on corporate object orientation without a precise growth plan. Many are the choices that have to be undertaken in such an environment, and some of them affect the fabric of software development in the very core of the business. Object orientation, however, promises to relieve the company from the ever-increasing necessity to adapt every product as soon as a requirement change occurs, by limiting the changes to a restricted number of well-identified code fragments.This paper presents an account of how object-oriented software development was introduced in our company, the foundation of our understanding object orientation, and the hurdles we overcame in the process of building a reusable application framework.
JAVA Phrasebooks for computer algebra and automated deduction
Authors: Caprotti Olga , Cohen Arjeh M. , Riem Manfred
Published: January 2007

We discuss the developments within the
OpenMath
framework regarding programs that make it possible for a software package to interact with other packages or agents, namely
Phrasebooks.
Recently, several implementations of
Phrasebooks
have come about; we shall describe some of them. Most of the software is freely available, so, by downloading it and inspecting implemented examples, builders of software packages can pick up the examples and provide the mathematical community with further computational servers that can easily be interfaced.
Consistency and locking for distributing updates to web servers using a file system
Authors: Burns Randal C. , Long Darrell D. E. , Rees Robert M.
Published: January 2007

Distributed file systems are often used to replicate a Web site's content among its many servers. However, for content that needs to be dynamically updated and distributed to many servers, file system locking protocols exhibit high latency and heavy network usage. Poor performance arises because the Web-serving workload differs from the assumed workload. To address the shortcomings of file systems, we introduce the
publish consistency
model well suited to the Web-serving workload and implement it in the
producer-consumer
locking protocol. A comparison of this protocol against other file system protocols by simulation shows that producer-consumer locking removes almost all latency due to protocol overhead and significantly reduces network load.
An overview of the wireless information network laboratory (WINLAB) at Rutgers University, NJ, USA
Authors: Yates Roy
Published: January 2007

Founded in 1989 by Dr. David Goodman at Rutgers University, WINLAB (the Wireless Information Network Laboratory) has grown to be among the oldest and most respected Centers of its kind and is sponsored by more than 20 companies from the US, Europe and Asia. It is globally recognized as a resource for technology creation, technology evaluation, education, and information exchange/technology transfer. With professors from electrical engineering and computer science, and with industrial as well as academic experience, WINLAB is able to take the broadest view of emerging technologies and gaps, and to focus its research on the key issues that will enable the Wireless Internet.
Book review: Theoretical Aspects of Reasoning about Knowledge
Authors: Iberall Thea , Morelli Ralph
Published: January 2007

This volume is a collection of 25 papers and four abstracts presented at an interdisciplinary conference held at Monterery, California in March, 1986. To their credit, the conference organizers selected high quality papers that cover a range of topics affected by knowledge reasoning. The fields represented at the conference included philosophy, linguistics, artificial intelligence (Al), economics, and theoretical computer science.
Arrays and assignment in prolog
Authors: Wong William G.
Published: January 2007

This note describes a very simple modification to Prolog's Definite Clause Grammar
1
(DCG) formalism which allows a menu system with the flavor of Texas Instruments' NLMenus
2
to be easily implemented.
Profile based methods for genomic sequence retrieval
Authors: Liu Donglin , Singh Gautam B.
Published: January 2007

The number of biological sequences in the genomic databases, such as the GenBank, have exponentially increased during the past decade. Sequence retrieval systems are required to quickly and efficiently find sequences, that are related to a query sequence. Several comparison algorithms that generally rely upon the existence of local string similarities between the query and the database sequences have been widely utilized and accepted as the basis for bio-sequence retrieval from DNA sequences databases. In this paper we describe a new method for sequence comparison based on
k-mer
word frequency profiles. In this algorithm, the distribution of the
k-mer
words found on the two sequences, defined as sequences' profiles, are treated as the signatures of sequences. This representation enables us to perform a comparison of sequence similarity using Shannon's entropy based divergence measures. The profile based search of the primate section of GenBank (GB-PRI, comprising of approximately 114,000 DNA sequences) was performed using this approach. The results obtained have established the significance and validity of a profile based genomic sequence retrieval algorithm.
GPRS and UMTS release 2000 A11-IP option
Authors: Soininen Jonne
Published: January 2007

This article will describe to the reader the Universal Mobile Telecommunications System (UMTS) packet switched architecture and the UMTS release currently under specification --- Release 2000. The article will discuss the relevant features of the Release 1999 architecture in order to give the reader the background knowledge to understand the Release 2000 IP Multimedia architecture. Aspects of the Release 2000 are described in greater detail when the topic is especially interesting and revolutionary. For instance, why and how the Third Generation Partnership Project (3GPP) ended up mandating the Internet Protocol version 6.
Global internet roaming with ROAMIP
Authors: Turányi Zoltán R. , Szabó Csanád , Kail Eszter
Published: January 2007

Reachability and session continuity represent two distinct services that global mobility protocols should provide. Reachability is the possibility for Internet hosts to initiate sessions to mobile users. Session continuity refers to mechanisms that ensure that active transport or application layer sessions are not broken due to mobility. We present ROAMIP, a global mobility architecture that uses application layer solutions for global reachability and reuses transparent Mobile IP tunnelling mechanisms to ensure session continuity. ROAMIP eliminates long triangular routes, yet it is compatible with mobility unaware correspondent hosts. It is applicable to IPv6 as well as IPv4 networks. The ROAMIP architecture naturally lends itself to easy, gradual deployment and can reuse existing Mobile IP or SIP message formats. We conclude the paper by showing example traces from an experimental implementation.
Improving object-oriented methods by using fuzzy logic
Authors: Marcelloni Francesco , Aksit Mehmet
Published: January 2007

Object-oriented methods create software artifacts through the application of a large number or rules. Rules are typically formulated in two-valued logic. There are a number of problems on how rules are defined and applied in current methods. First, two-valued logic can capture completely neither method developers' intuition nor software engineers' perception or artifact types. Second, artifacts are generally produced based only on a subset of relevant properties. Third, two-valued logic does not modal explicitly contextual factors, which can affect the validity of methodological rules. Fourth, no means is supplied to deal with multiple design alternatives and to measure the quality of each alternative during the development process. High loss of information, early elimination of artifacts and process iterations are some of possible fastidious effects. To reduce these problems, this paper proposes fuzzy logic-based methodological rules. Thanks to its ability to cope with uncertainty and imprecision, and to compute with real-world linguistic expressions, fuzzy logic appears to be a natural solution for improving current methods.
Enumerated data types
Authors: Giles Jim
Published: January 2007

The origins of many language features are hard to pin down. Not so with enumerated data types. These were invented by Niklans Wirth in the design of the Pascal programming language [1]. They permit convenience and greater safety in performing tasks that had to handled by mapping concepts to a subrange of the integers in previous languages. The feature is useful enough and easy enough to define and implement that no really modem language is without some form of it.The feature is still missing from Fortran. The proposed new standard for Fortran adds a version of the feature to the language [2]. However, it is present as part of a C-interoperability mechanism only. Unfortunately, it leaves out most of the aspects of the idea that make it useful to a programmer. And it is not even necessary for interoperation with C.This article describes the concept of enumerated data types and the properties the feature should include. It then describes the proposed version of the feature in Fortran. Some suggestions will be made about future directions.
Performance of a weakly consistent wireless web access mechanism
Authors: Chang Ming Feng , Lin Yi-Bing
Published: January 2007

In wireless web information access, long response may be experienced. To reduce the response times of wireless data access in a mobile network, caches are utilized in the wireless handheld devices or wireless proxy server. This paper proposes a wireless web data access algorithm for WAP (wireless application protocol) caching proxy to speed up data access. Our algorithm utilizes the access frequency to tune the data expiration time. The performance of the algorithm is investigated and is compared with existing TTL-based algorithms. Our study indicates that good performance is expected for the new algorithm.
Experimenting with an Ad Hoc wireless network on campus
Authors: Toh C.-K. , Chen Richard , Delwar Minar , Allen Donald
Published: January 2007

Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed on-the-fly, anytime and anywhere. User data is routed with the help of an ad hoc mobile routing protocol. Before the deployment of ad hoc mobile services, the communication performance of such networks has to be evaluated to demonstrate the practicality limits based on today's hardware and innovative communication software. This paper describes the realization of an ad hoc wireless testbed and the various experimental field trials performed on campus. In particular, throughput, end-to-end delay, route discovery time, and the impact of varying source packet size and beaconing intervals are examined.
An elementary solution of a minimax problem arising in algorithms for automatic mesh selection
Authors: Corless Robert M.
Published: January 2007

We fill in some details in the solution of a minimax problem arising in automatic mesh selection. We supply two proofs of a result that, while simple, deserves the attention, in particular because we will need it to establish the complexity of an algorithm for factorization of bivariate approximate polynomials in an upcoming paper.
Parametric Fourier image characterization toolkit
Authors: Alonso J. R. F.
Published: January 2007

A suite of APL programs is described for characterization of bounded images for on-line process control or for artificial intelligence recognition functions. Beginning with an acquired threshold and edge enhanced image, the programs:

detect the edges and close all bounded areas in the image

produce arrays with the (x,y) locations of the boundaries of each object (bounded area) in the field, allowing for touching, segmented, perforated, embedded objects (all reported as separate arrays of sequenced coordinate pairs)

compress the image using a quad tree procedure for archival or legal purposes

fit parametric polynomial, conventional Fourier or inner product-outer product - matrix inversion Fourier equations to the object boundaries, to any desired number of coefficient terms or number of boundary pixel points.

displays results and analyses of degree of fit in a windowed environment performs accept-reject-identify checks by comparison of the calculated Fourier coefficients from “perfect” objects or from a CAD system database.

The system is written in 500 lines of IBM APL/PC Version 2 for a PC/AT with 80287 co-processor, and it is presently being interfaced to Data Translation image grabber hardware and software, with 512x512 acquisition resolution.

Parameterization fitting accuracy is increased by considering not pixel center coordinates but intersection of boundary regression lines with pixel boundaries.

The user interface makes the suite of programs manageable by a competent technical user without programming or APL knowledge.
Statistics loves APL
Authors: Douglas J. B.
Published: January 2007

To call this paper 'STATISTICIANS LOVE APL' would be self-deluding. To call it 'SOME STATISTICIANS LOVE APL' though vague would be accurate. However a balance then might be desirable by appending '… AND SOME STATISTICIANS HATE APL'. But that title would be both too long and almost vacuous. Nevertheless, this brief historical record at a personal level of the prominent place APL has played, first in the research, second in the teaching, and third in the consultative, activities of the Department of Statistics at the University of New South Wales since 1970 will help to explain and justify such titles.

The affinity between Statistics and APL derives primarily from the correspondence between the mathematical structure of much statistical analysis and the structure of APL. Successful exploitation of this correspondence depends on how Statistics is learnt, taught and used. For example, at the teaching level an entirely theoretical course in Statistics which never does anything with numbers will only rarely make contact with computing. Similarly, a 'methods' or 'cookbook' course involving computing will depend on packages which if they use APL will typically do so invisibly. How the correspondence between mathematical structure and APL has been utilized at the University of New South Wales is sketched below.

Whilst I was on leave in 1969 from the University of New South Wales at Penn State University doing some heavy statistical computing, the Computing Center called me to say that IBM had given Penn State access to an APL interpreter for a couple of months. I had not heard of APL, but was told it was a splendid system for array manipulation, and that I could have a demonstration, and then some time for personal playing. It was enormously impressive to see how easily arrays could be processed, but because I saw no likelihood that on returning to N.S.W. I would still have access to APL I did not follow up the offer to use it. But before my return to Australia IBM (Aust.) had established the Systems Development Institute in Canberra, and was providing contracts for use of its facilities - amongst these was APL\360; and the School of Mechanical Engineering of the University of N.S.W. (via G. de Vahl Davis) was carrying out a project using APL in engineering education through W.N. Holmes of IBM.
A method for building knowledge bases with morphological semantics
Authors: Aoe Jun-ichi
Published: January 2007

This paper presents a strategy for building a morphological machine dictionary of English efficiently to infer meanings of derivatives from a simple word (hereafter a semantic stem) by considering morphological affixes and their semantic classifications. The basic concept is to group the derivatives into one frame and to restrict the derivatives, accessible to a knowledge base, to the semantic stem. This approach enables us to simplify the structures of a morphological dictionary and the representation of the knowledge base.
Pragmatic ECAD Data Integration
Authors: Kaufman G.
Published: January 2007

Data integration refers to the ability of applications to share data and the ease with which this data is shared. Data integration is one of the fundamental missing pieces of functionality in ECAD systems created with tools from multiple tool vendors. Current systems meet neither the user's nor the tool supplier's needs for sharing data.A data integration solution is composed of five parts: semantics, syntax, storage, translation, and mechanism. There are only a handful of data objects transferred among ECAD applications. The key to obtaining data integration is to develop a data model that is common to all applications for each of these objects.The goals for a data integration architecture are: use one data model, meet tool performance and resource requirements, provide an extensible model and format, accommodate tools from any supplier, provide a single data interface, and permit portability.An ECAD data integration architecture to meet these goals consists of: a system context data model, a data model for each system data object, one format and access method for each object (the canonical form), and a data controller to control access to and translation of the data objects.An initial implementation of this architecture might consist of a system context data model and data models and canonical forms for schematic capture symbols and simulation netlists. In the short term a very simple integration mechanism is acceptable; in the long term an object management facility holds the most promise as a flexible and general integration mechanism.
DA standards activities
Authors: Hefferan Patrick M.
Published: January 2007

For many contributors to the CFI, last year represented a significant turning point. Continued high levels of participation and a focus on solving practical tool integration problems have given members confidence in developing a workable set of guidelines. As a result, our mission was refined as follows. "To create a free market model for EDA tools and their supporting framework environments, via development of effective industry guidelines that remove barriers to integration." In keeping with this mission, key highlights of the past year are summarized below.
An empirical investigation of OR indexing
Authors: Glew Andy
Published: January 2007

This paper considers OR indexing as a substitute for, or an optimization of, addition in an addressing mode for a high speed processor. OR indexing is evaluated in the context of existing address streams, using time based sampling, and through compiler modifications.
1st ACM SIGForth industry survey
Authors: Montanez Irving
Published: January 2007

Will Forth be a living language in the year 2000, or will it be relegated to an exhibit at
The Computer Museum
in Boston as an interesting artifact of computer history? Based on the analysis of the 266 surveys that were returned, Forth will most certainly be alive and well in the year 2000 and beyond.
An RCA 1802 software simulator
Authors: Pasquale Alberto
Published: January 2007

Two years ago, the Houston FIG Chapter developed a microcomputer project for educational purposes. We set out to build a single board computer and then write a Forth system for it, to give the participants a first-hand experience with developing a hardware/software combination from scratch. For a variety of reasons, we selected the RCA 1802/1806 CMOS microprocessor.
Proceedings of the typography interest group ACM CHI'85
Authors: Rubinstein Richard , Bigelow Charles , Baudin Fernand , Lynch Eugene , Levy David
Published: January 2007

The ACM CHI '85 typography interest group meeting was conducted as a paper and discussion session. Richard Rubinstein moderated the session and edited this transcript. Charles Bigelow organized the session and designed and composed these proceedings.
OBJECT IDENTIFICATION BY LANGUAGE IN A USER INTERFACE USING LANGUAGE AND IMAGE INFORMATION
Authors: Hakata Akira , Takahashi Tomoichi , Kobayashi Yukio
Published: January 2007

We propose an advanced user interface which can identify an object in a picture indicated by natural language, hand pointing or both.
UNIXTUTOR: A MENU-BASED TRANSITIONAL INTERFACE
Authors: Jamison Wesley , Lewis C. Michael
Published: January 2007

We developed UNIXTUTOR as an aid to beginning users of the UNIX™ operating system. UNIXTUTOR uses the Maryland window and menu system (Lyle & Weiser, 1983) to create a visual interface on the character-based terminals commonly available to beginning users. With UNIXTUTOR, users build UNIX command strings by using the cursor to make selections for commands and options in menus and by typing arguments into argument windows. Figure 1 illustrates the UNIXTUTOR interface by showing one of the screens for choosing the commands and options needed to build a UNIX command to sort the entries in a file and remove duplicate file entries. To accomplish this task a user must select
sort
in the FILE menu followed by -

u

in the sort Options menu. Next the user must type the name of the file to be sorted in the argument window located below the FILE menu. Not shown in Figure 1 is the menu reminding users of the possibilities for redirecting input and output which is displayed after users make their choices for commands, options, and arguments. In the sort problem, output rediection might be used to store the results of the sort in a new file. A more complete description of UNIXTUTOR is available in Jamison and Lewis (1989).
COMPUTER-MEDIATED GROUP PROCESSES IN DISTRIBUTED COMMAND AND CONTROL
Authors: Linville J. M. , Obermayer R. W. , Fallesen J. J.
Published: January 2007

These studies investigate the effects of computer-mediated communications on distributed Command and Control (C2). The military C2 system presently is distributed functionally and geographically and will be distributed even more in the future. This distribution will enhance increased survivability and will increase the breadth of command and control. To support collaboration of distributed remote command staffs, computer- mediated communications may be needed to share information, provide supervision, coordinate objectives, perform analyses, and provide recommendations and decisions.
IDEA: FROM ADVISING TO COLLABORATION
Authors: Miller James R. , Hill William C. , McKendree Jean , McCandless Timothy P. , Terveen Loren
Published: January 2007

IDEA is an application independent environment for the development of intelligent advisory systems for a wide range of interactive computer interfaces. Our work on IDEA addresses two particular aspects of these systems:
DESIGNING COLLABORATIVE USER INTERFACES: LESSONS FROM WRITER/GRAPHIC DESIGNER INTERACTION
Authors: Wulff Wendie
Published: January 2007

Recent discussions about designing and building user interfaces for collaborative work have revealed a number of points. One of the most significant is that before we can concentrate on collaborative interfaces, we still have much to learn about the nature of collaboration itself. In particular, we need information from studies that have systematically looked at interdisciplinary collaboration in real contexts, with real people and problems. Thus, the goals of my research are to deeply understand one kind of interdisciplinary collaborative work -the activities of a document design team working on a client project - and then to produce guidelines for computer support of the interactions studied.
ABSTRACTS OF INTEREST
Authors: Humphrey Susanne M. , Shneiderman Ben
Published: January 2007

The following abstracts were selected from a computer search using the BRS Information Technologies retrieval services of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.Unless otherwise specified, paper or microform copies of dissertations may be ordered, using the UM order number, from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 488106; telephone for U.S. (except Michigan, Hawaii, or Alaska): 800/521-3042, for Canada: 800/268-6090. Price lists, ordering, and shipping information are in the introduction to the published DAI. An alternative source for copies is sometimes provided at the end of the abstract.The dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright 1985 by University Microfilms International), and may not be reproduced without their prior permission.