bluuebunny/crossref_metadata_2025 huggingface dataset:
Empirical results on locality in database referencing
Authors: Verkamo A. Inkeri
Published: January 2007

Database referencing behaviour is analyzed with respect to locality features. The analysis is based on database reference strings collected from several runs of typical batch programs accessing a real database. Locality of reference is measured by the stack distance probability distribution, the number of block faults, and a locality measure based on the memory reservation size.

In all the experiments, locality of reference is observed, but it is found to be weaker than in code referencing or even in some previous studies on database referencing. The phase/transition concept used in virtual memory systems is not well applicable to database referencing, since a large part of the locality set is constantly changing. The disruption of the phases is predominantly due to random referencing of data blocks. The references to index blocks show stronger locality. In some special cases, sequentiality is observed in the use of the data blocks. In general, neither replacement strategies developed for virtual memory systems nor prefetching techniques seem adequate for performance improvement of database referencing.
Performance of integrated services (voice/data) CSMA/CD networks
Authors: Chlamtac I. , Eisinger M.
Published: January 2007

We consider a voice/data integrated local area communication system. Due to the high suitability of CSMA/CD protocols for data communication and the existence of real time voice delay constraints we consider a hybrid TDM/CSMA/CD protocol. This model fundamentally differs from the very well documented voice/data integrated systems in point to point networks in which both voice and data users are assigned fixed duration time slots for transmission. The TDM/CSMA/CD integrated system performance is analysed and basic performance tradeoffs in the system design are manifested.
An analytic model of the hyperchannel network using multiple channel architecture
Authors: Chlamtac I. , Eisinger M.
Published: January 2007

The HYPERchannel communication network configured around one to four channels is considered. We develop a queueing model which characterizes the network performance as a function of the number of channels, the channel load and the number of stations in the network. The model is used to analyze the multichannel system performance and to evaluate the effect of the channel selection mechanism, as implemented by the HYPERchannel station interface units, on the performance.

It is shown that the network bandwidth utilization is directly related to the channel selection process and that it varies with network configuration and load. These observed relations are especially significant since they are most pronounced in networks with small number of stations, the typical configuration in the majority of operational HYPERchannel networks.
On the applicability of using multiprogramming level distributions
Authors: Dowdy Lawrence W. , Chopra Manvinder S.
Published: January 2007

A computer system's workload is represented by its multiprogramming level, which is defined as the number of tasks (jobs, customers) which actively compete for resources within the system. In a product-form queuing network model of the system, the workload is modeled by assuming that the multiprogramming level is either fixed (i.e., closed model) or that the multiprogramming level depends upon an outside arrival process (i.e., open model). However, in many actual systems, closed and open models are both inappropriate since the multiprogramming level is neither fixed nor governed by an outside arrival process.

In an actual system., the multiprogramming level varies due to features such as task spawning, killing, blocking, parallel processing, and/or simultaneous resource possession. The multiprogramming level is a random variable with an associated distribution. This paper demonstrates that improved models can result from using this multiprogramming level distribution information. Several examples relative to open versus closed models, subsystem models, actual system models, and blocking models are given which demonstrate the applicability of using multiprogramming level distributions. This applicability, shown via the examples, is the main contribution of the paper. The examples also motivate interesting theoretical results relating to open models, closed models, and subsystem models.
On the stochastic structure of parallelism and synchronization models for distributed algorithms
Authors: Plateau Brigitte
Published: January 2007

In this paper a new technique to handle complex Markov models is presented. This method is based on a description using stochastic automatas and is dedicated to distributed algorithms modelling. One example of a mutual exclusion algorithm in a distributed environment is extensively analysed. The mathematical analysis is based on tensor algebra for matrices.
Modelling of centralized concurrency control in a multi-system environment
Authors: Yu Philip S. , Dias Daniel M. , Robinson John T. , Iyer Balakrishna R. , Cornell Douglas
Published: January 2007

The performance of multiple systems sharing a common data base is analyzed for an architecture with concurrency control using a centralized lock engine. The workload is based on traces from large mainframe systems running IBM's IMS database management system. Based on IMS lock traces the lock contention probability and data base buffer invalidation effect in a multi-system environment is predicted. Workload parameters are generated for use in event-driven simulation models that examine the overall performance of multi-system data sharing, and to determine the performance impact of various system parameters and design alternatives. While performance results are presented for realistic system parameters, the emphasis is on the methodology, approximate analysis technique and on examining the factors that affect multi-system performance.
Using APL expressions in database operations
Authors: Mansour Paul S. , Mansour Stephen M.
Published: January 2007

The Collateral Analysis System (CAS) is an analytic database written in
Dyalog APL
which combines the flexibility of a database with the power of a sophisticated analysis package. Much of the power and flexibility of CAS comes from the ability of users to create their own selection statements, calculations, and summary expressions.An expression is a combination of
constants, fields
and
user functions
which can form a selection statement, new field calculation, or frequency report specification.Users can generate tailor-made reports without programming. They simply enter expressions and format data and save the information with the database. Then, with the touch of a button, they can generate reports quickly and easily. CAS Expressions are merely APL expressions in disguise.
Turtle graphics
Authors: Rama Hendrik
Published: January 2007

Twenty-five years ago Martin Gardner wrote an article in "Mathematical Games" of the Scientific American with the title
Fantastic patterns traced by programmed "Worms"
[Gar 1]. Later on these worms were called "turtles". These turtle graphics are well known from the LOGO-system [Ab/diS].These graphics are also vector graphics not made by setting absolute coordinates but by setting relative increments of distances and angles. With tiny APL2 idioms I have developed many 2D-graphics. It has happened in a short time in a normal manner and as a dialogue form. My top is "
one-liner as eye liner
"
Writing a compilers compiler in APL
Authors: Alfonseca Enrique
Published: January 2007

This paper describes the special capabilities of APL2 for the construction of compilers and translator writing systems (TWS). To that purpose, a TWS has been written in APL2, which takes as input a complete description of a language including an attribute grammar, in extended Backus normal form, and the semantic function associated to each rule of the grammar, written in APL2. The output of the TWS is a compiler, generated directly inside the workspace and ready to compile source code written in the provided language.
First flight
Authors: Halasz Steven J.
Published: January 2007

This paper discusses a proposed beginner-level APL tutorial program that can be delivered as an APL program or as an internet web site. The need for developing automated APL learning is presented, and cognitive as well as constructivist instructional design issues are reviewed. Implementation issues are discussed for APL-only and for combined APL and HTML approaches.
Unified method for determining canonical forms of a matrix
Authors: de Olazábal J. M.
Published: January 2007

Let
K
be a field and
A
a matrix with entries in
K.
It is well known that if det(
xI - A
) splits in
K,
there exists a regular matrix
P
with entries in
K,
such that
P
-1
AP
is a diagonal matrix of Jordan blocks. Two problems arise that have been well treated in the literature. What should be done if the roots of
xI - A
do not belong to
K?
How can one compute
P?
In this note, I answer these questions in a unified way.
Measuring Web performance in the wide area
Authors: Barford Paul , Crovella Mark
Published: January 2007

One of the most vexing questions facing researchers interested in the World Wide Web is why users often experience long delays in document retrieval. The Internet's size, complexity, and continued growth make this a difficult question to answer. We describe the Wide Area Web Measurement project (WAWM) which uses an infrastructure distributed across the Internet to study Web performance. The infrastructure enables simultaneous measurements of Web client performance, network performance and Web server performance. The infrastructure uses a Web traffic generator to create representative workloads on servers, and both active and passive tools to measure performance characteristics. Initial results based on a prototype installation of the infrastructure are presented in this paper.
The UI design process
Authors: McInerney Paul , Sobiesiak Rick
Published: January 2007

The root cause of many user interface (UI) design deficiencies is not a lack of knowledge about human-computer interaction principles nor a lack of information on user needs. Rather, many UI deficiencies arise because the UI design process is ad hoc and the design is not communicated successfully to the programmers who will implement it. Many UI designers are seeking and discovering ways to plan, manage, and document UI design work more effectively. This workshop provided an opportunity for participants to share lessons learned and obtain advice from other participants.In the weeks leading up to the workshop, participants selected the specific topics that were of prime concern to them. As a result, we narrowed the focus of the workshop to the following topics:• Division of UI design activities into stages• Division of labor and interdisciplinary collaboration• Collaborating in geographically-dispersed projects• Writing the UI specification• Defining the maturity of the UI design process.The following sections summarize the results of the workshop activities for each of these topics.
Teaching CSCW in developing countries through collaboration
Authors: Thatcher Andrew , Katz Lesley-Anne , Trepess David
Published: January 2007

Teaching technical subjects in developing countries has proven to be a challenge. This is due to deficiencies in technology and knowledge resources, such as a lack of expertise in a field and a lack of up to date literature. These deficiencies have a major impact on the teaching of subjects such as HCI and CSCW, and have caused universities in developing countries to expand the scope of their teaching resources to form collaborations with other universities through distance leaning technology. This report will focus on experiences of a collaborative project between the University of the Witswatersrand (Wits) in South Africa and Staffordshire University (Staffs) in the UK. The aim of the project was to provide experiential knowledge of CSCW issues through establishing communication channels between the UK and South Africa.
Web design and maintenance
Authors: Berkman Jerry
Published: January 2007

In the last few years, there has been a transformation from publishing documentation on paper to publishing online on the Web. Unlike publishing on paper, we do not have a wealth of experience in publishing via the Web. This paper discusses some guidelines for making Web publishing more valuable.
The multiple container packing problem
Authors: Raidl Günther R.
Published: January 2007

This paper presents a genetic algorithm (GA) approach to the problem of choosing
C
disjoint subsets of
n
items to be packed into distinct containers, such that the total value of the selected items is maximized, without exceeding the capacity of each of the containers. This so-called multiple container packing problem (MCPP) has applications in naval as well as financial management. It is a hard combinatorial optimization problem comprising similarities to the knapsack problem and the bin packing problem.A novel technique for encoding MCPP solutions is used within the GA: The genotype is a vector of numerical weights associated with the items of the problem. The corresponding phenotype is obtained by temporarily modifying the original problem according to these weights and applying a greedy decoding heuristic for the MCPP to the new problem. This solution is then evaluated using the original problem data again. Two different techniques for biasing the original problem and four decoding heuristics are discussed. They were tested in a weight-coded steady-state GA on a variety of MCPP instances. One biasing technique and one decoding heuristic turned out to be clearly more effective than the others, and the GA using them found solutions of significantly higher quality than direct-encoded and order-based GAs from a previous work.
Proportional-share scheduling in single-server and multiple-server computing systems
Authors: Epema D. H. J. , de Jongh J. F. C. M.
Published: January 2007

Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.
Plans for the TREC-9 web track
Authors: Hawking David
Published: January 2007

In recent years, TREC has broadened its scope to include many more facets of the Web searching process. In TREC-8 (1999), the Web special interest track evaluated link-based retrieval methods investigated differences between Web and traditional TREC ad hoc documents, and studied efficiency and effectiveness tradeoffs on large data sets. In addition, although neither used Web data, both the Cross-Lingual track and the Question & Answer track studied issues of considerable importance to everyday Web search.In TREC-9, the main Web track task will use a larger set of Web documents than last year and will use search topics derived from search engine logs. This task will be the closest approximation in TREC-9 to the traditional TREC Ad Hoc retrieval task.
Collaborative Web caching based on proxy affinities
Authors: Yang Jiong , Wang Wei , Muntz Richard
Published: January 2007

With the exponential growth of hosts and traffic workloads on the Internet, collaborative web caching has been recognized as an efficient solution to alleviate web page server bottlenecks and reduce traffic. However, cache discovery, i.e., locating where a page is cached, is a challenging problem, especially in the fast growing World Wide Web environment, where the number of participating proxies can be very large. In this paper, we propose a new scheme which employs proxy affinities to maintain a dynamic distributed collaborative caching infrastructure. Web pages are partitioned into clusters according to proxy reference patterns. All proxies which frequently access some page(s) in the same web page cluster form an “information group”. When web pages belonging to a web page cluster are deleted from or added into a proxy's cache, only proxies in the associated information group are notified. This scheme can be shown to greatly reduce the number of messages and other overhead on individual proxies while maintaining a high cache hit rate. Finally, we employ trace driven simulation to evaluate our web caching scheme using three web access trace logs to verify that our caching structure can provide significant benefits on real workloads.
Neural networks and survival analysis (abstract only)
Authors: Wong Helen
Published: January 2007

Estimate the survival function and predicting the event occurrence has been the center of interest in medical statistic area. Currently, a set of 1,616 breast cancer patients was given by Manchester Christie hospital. Here we investigate different methods, which able to estimate the survival rate of patients after surgery for 5 years accurately, in a way to improve their quality of life and also detect the important factors, which may affect the prognosis accuracy. Cox regression, known as the
proportional hazard model
, is the most conventional and widely used method for censored survival data. Censorship is a feature of survival data, the endpoint of individuals are not the event of interest. Neural network model has been considered as an alternative model to handle survival data. It has been used for regression and classification problem in several areas, such as engineering, biomedicine, etc. Breast cancer is one of the deadly diseases for women from the last century. In this study, we demonstrated how the neural networks handle censorship, overcome over-fitting problem and avoid significant bias that introduced when using Bayesian framework in stewed data condition. Patients were grouped into different prognostic groups using prognostic indexes and estimate their survival rate for each groups. The result of neural network model was comparable to the Cox regression.
Effective homology of a classifying space
Authors: Dousson Xavier
Published: January 2007

Sergeraert defines in [9] a method to solve the main problems of Constructivism in
Algebraic Topology.
The first resulting computer program, E.A.T., showed this method is a usable concrete framework for a Constructive Algebraic Topology implementation [8].Rubio and Sergeraert solved in this way an important but particular problem: computing the homology of iterated loop spaces. The application field of the EAT program is rather limited, despite its interesting results. Implementation of mathematical categories in Lisp has met real difficulties and it looked unreasonable to plan a general Constructive Algebraic Topology program along the same line.The OOP Lisp implementation CLOS (Common Lisp Object System) provides a powerful means of implementing these categories. The new program Kenzo also implements Sergeraert's method for Constructive Algebraic Topology, but the scope is considerably larger [11]. In particular the Kenzo program allows one to compute the first homotopy groups of an
arbitrary
simplicial set. It is the first computer program able to solve this problem; new homotopy groups have been calculated in this way.
PRINCIPLES FOR THE DESIGN OF MANUALS
Authors: Catrambone Richard
Published: January 2007

PAC is an implementation model that attempts to bridge the gap between the abstract sphere of theoretical models such as GOMS [Card 83], and the practical affairs of building user interfaces. The foundation for PAC is the distinction promoted by some theoretical models between the semantic and the lexical aspects of the human-computer interaction [Foley 82, Norman 84, Shneiderman 87]. However, PAC stresses the fact that these notions do not form strict monolithic layers but instead, are distributed across various levels of abstraction.
EXPERIMENTUS INTERRUPTUS
Authors: Field Graeme E.
Published: January 2007

Increased use of information databases has not been reflected in research in the field of HCI. Experiments that have been conducted often relate to abstract tasks rather than to tasks that users will actually perform. Twelve subjects completed realistic tasks in a nested hierarchical experimental design that used two conditions, Selective Retreat or Restricted Retreat, with two task types, Simple or Complex, that were either Interrupted or Not Interrupted. Results indicated that: the provision of a trace of selections significantly enhanced navigation; active search time was very variable; and Interruptions
do
affect users behaviour in the post interruption period. The small number and type of subject in this pilot study necessitates a cautions interpretation of the results. However, an interesting area of research with direct application to everyday use of computer systems has been broached. Some of the implications of this study and suggestions for future research are discussed.
INTELLIGENT SYSTEMS DESIGN
Authors: Lamberti Donna M.
Published: January 2007

This research examines knowledge presentation to support expert system users' information processing strategies for problem solving. A framework for a systematic research program for evaluating the effectiveness of expert system user interfaces is proposed. Based on this framework, the research examines the impact of knowledge presentation format (procedural vs. declarative) for system explanation facilities, user skill level, level of task uncertainty, and decision-making process on the decision-making performance of system users. Empirical assessment of a computer diagnostic expert system, developed using the Expert System Environment (ESE) shell, and implemented within an international computer manufacturer, is conducted. Theoretical and practical generalizations are drawn regarding the requirements of intelligent interfaces from a behavioral viewpoint.
Classification of dialog techniques
Authors: Nielsen Jakob
Published: January 2007

Program designers invent new dialog techniques all the time, but these techniques are often not documented in formal scientific papers. Several years of this has led to the current state where very few people would be able to list, say all the different kinds of menus. The CHI+GI'87 workshop on classification of dialog techniques was intended to remedy this problem somewhat by coming up with a classification scheme according to which existing and new dialog techniques could be cataloged.
OpenMath
Authors: Dewar Mike
Published: January 2007

OpenMath is a standard for representing mathematical data in as unambiguous a way as possible. It can be used to exchange mathematical objects between software packages or via email, or as a persistent data format in a database. It is tightly focussed on representing semantic information and is not intended to be used directly for presentation, although tools exist to facilitate this. Since 1997 its development has been partially funded by the European Union under a multimedia ESPRIT project.The original motivation for OpenMath came from the Computer Algebra community. Computer Algebra packages were getting bigger and more unwieldy, and it seemed reasonable to adopt a generic "plug and play" architecture to allow specialised programs to be used from general purpose environments. There were plenty of mechanisms for connecting software components together, but no common format for representing the underlying data objects. It quickly became clear that any standard had to be vendor-neutral and that objects encoded in OpenMath should not be too verbose. This has led to the design outlined below.In 1998, the Worldwide Web Consortium (W3C) produced its first recommendation for the Extensible Markup Language (XML) [11], intended to be a universal format for representing structured information on the worldwide web. It was swiftly followed by the first MathML recommendation [10] which is an XML application oriented mainly towards the presentation (i.e. the rendering) of mathematical expressions. Both these developments were significant for OpenMath in different ways as shall be described later in this article and elsewhere in this issue of SIGSAM.The formal definition of OpenMath is contained within
The OpenMath Standard
[7] and its accompanying documents, and the reader is referred there for more details.
JOME, a software component for interactive and distributed mathematics
Authors: Dirat Laurent
Published: January 2007

JOME
(Java OpenMath Editor) is a self-contained software component written in Java (as a Java Bean), dedicated to the visualisation and manipulation of mathematical formulæ. Conceptually based on the well-known
Model-View-Controller (MVC)
design pattern,
JOME
naturally consists of three different entities: the Model, the View and the Controller, each itself a Java Bean. Thus, it is easy to add different kinds of representations (instances of the View component) of a formula (the Model), and to provide different of ways editing it (instances of the Controller component). Moreover,
JOME
uses OpenMath, a platform-independent standard for the representation of semantically rich mathematical objects, enabling in a meaningful way the exchange of mathematical objects between various software tools. These two characteristics make
JOME
a useful component for interactive and distributed mathematics.
OpenMath
Authors: Strotmann Andreas , Kohout Ladislav
Published: January 2007

As a language for exchanging computer-"understandable" representations of mathematical formulas and concepts, OpenMath has a fairly standard syntactic structure for most of the mathematical notions that have so far been formalized in its "Content Dictionaries." The syntax for most operators is closely related to the well-known and decades-old LISP prefix notation for function application.For syntactic representations of a particular large class of mathematical operators, however, OpenMath takes a very unusual approach when compared with any of the existing Computer Algebra systems, say. This class contains integration and differentiation operators, sums and products, and other generalized quantifiers.In our paper we argue that OpenMath's novel approach to representing generalized quantifiers is superior to the classic representations. In particular, we show that this unusual feature of OpenMath has been designed to adhere to the Compositionality Principle[10], a design principle that classic representations, including older versions of OpenMath, have been violating[12].Having thus shown the importance of compositionality for the design of modern OpenMath, we then proceed to show that the Compositionality Principle is a fundamental research instrument in the Formal Semantics branch of linguistics[9], and argue that, like the use of this particular guiding principle for improvements in the design of a representation for generalized quantifiers, the study of the underlying structure of natural language as discovered by various branches of linguistics can provide many more suggestions for further improvements to OpenMath and to its sibling, MathML. We give some examples to substantiate our claim.
Crawler-Friendly Web Servers
Authors: Brandman Onn , Cho Junghoo , Garcia-Molina Hector , Shivakumar Narayanan
Published: January 2007

In this paper we study how to make web servers (e.g., Apache) more crawler friendly. Current web servers offer the same interface to crawlers and regular web surfers, even though crawlers and surfers have very different performance requirements. We evaluate simple and easy-to-incorporate modifications to web servers so that there are significant bandwidth savings. Specifically, we propose that web servers export meta-data archives decribing their content.
Providing a differentiated quality of service in a World Wide Web server
Authors: Vasiliou Nikolaos , Lutfiyya Hanan
Published: January 2007

This paper presents a strategy of extending a Web server to be able to differentiate between requests in different classes. This is required because most Web servers are unable to do this by themselves. We present our strategy and its design along with some initial performance results.
Bistro
Authors: Bhattacharjee Samrat , Cheng William C. , Chou Cheng-Fu , Golubchik Leana , Khuller Samir
Published: January 2007

Hot spots are a major obstacle to achieving scalability in the Internet. At the application layer, hot spots are usually caused by either (a) high demand for some data or (b) high demand for a certain service. This high demand for data or services, is typically the result of a
real-life event
involving availability of new data or approaching deadlines; therefore, relief of these hot spots may improve quality of life. At the application layer, hot spot problems have traditionally been dealt with using some combination of (1) increasing capacity; (2) spreading the load over time, space, or both; and (3) changing the workload.We note that the classes of solutions stated above have been studied mostly in the context of applications using the following types of communication (a) one-to-many, (b) many-to-many, and (c) one-to-one. However, to the best of our knowledge there is no existing work on making applications using
many-to-one
communication scalable and efficient (existing solutions, such as web based submissions, simply use many independent one-to-one transfers). This corresponds to an important class of applications, whose examples include the various
upload
applications such as submission of income tax forms, conference paper submission, proposal submission through the NSF FastLane system, homework and project submissions in distance education, voting in digital democracy applications, voting in interactive television, and many more. Consequently, the main focus of this paper is
scalable infrastructure design for relief of hot spots in wide-area upload applications
.The main contributions of this paper are as follows. We state (a) a new problem, specifically, the many-to-one communication, or
upload,
problem as well as (b) the (currently) fundamental obstacles to building scalable wide-area upload applications. We also propose a general framework, which we term the
Bistro
system, for a class of solutions to the upload problem. In addition, we suggest a number of open research problems, within this framework, throughout the paper.
Minimizing the impact of orphan requests in e-commerce services
Authors: Kraemer E. , Paixão G. , Guedes D. , Meira W. , Almeida V.
Published: January 2007

The most common problem of an overloaded electronic-commerce server is an increase in the response time perceived by customers, who may restart their requests hoping to get a faster response, or simply abort them, giving up on the store. Both behaviors generate "orphan" requests: although they were received by the server, they should not be answered because their requestors have already abandoned them. Orphan requests waste system resources, since the server becomes aware of their cancellation only when it tries to send a response and finds out that the connection was closed. In this paper we propose a new kernel service, the Connection Sentry, which keeps track of requests being performed and notify processes about an eventual cancellation. Once notified, a process can interrupt the execution of the request, saving system resources and bandwidth. We evaluated the gains by using our proposal in a virtual bookstore, where we observed that the Connection Sentry reduced service latency by up to 31% and increased the throughput by 27% in overloaded servers.
On the power series solution of a system of algebraic equations
Authors: Moritsugu S.
Published: January 2007

This paper discusses the power series solution of a system of algebraic equations which is computed by the multivariate symbolic Newton's method. Applying Newton's method naively, we obtain a power series solution the coefficients of which are large rational function of the initial approximation. An algorithm is given to reduce the solution to the normal form by using Gröbner basis method.
Some problems arising out of the cross-disciplinary nature of information systems security
Authors: Wang Tung-chien
Published: January 2007

Information Systems Security has recently become an important issue. As this subject crosses three main academic fields and professions -- risk management, auditing and information systems -- three main kinds of problems arise: organization management problems, education problems, and research and development problems. This paper will propose the following:1. A new point in management theory -- that risk management departments are the appropriate location for the "information security risk manager" (ISRM) position with its professional standards.2. A new interdisciplinary course for managing information systems security.3. The establishment of data and knowledge bases for information security risk management to develop expert systems in a way that would fully incorporate currently diverse efforts to modify or correct past directions and to point out future directions.
An overview of the center for wireless information network studies at Worcester Polytechnic Institute, MA, USA
Authors: Pahlavan Kaveh
Published: January 2007

The Center for Wireless Information Network Studies (CWINS) is a well renowned compact wireless research laboratory with a successful history of research alliances with other industrial and academic groups. The center has performed research for government agencies and has close ties with the world-leading organizations in the wireless industry. The core competence of the center is in indoor radio channel propagation measurement modeling and in the development of testbeds and tools for design and performance monitoring of wireless indoor networks. For over a decade, by publishing an international periodical journal, organizing several workshops and participating in organizing a yearly international conference, the center has contributed significantly to information exchange among important sectors of the wireless industry.
An overview of the University of Texas at Dallas' center for advanced telecommunications systems and services (CATSS)
Authors: Chlamtac Imrich , Basagni Stefano , Gibbs Stephen
Published: January 2007

The University of Texas at Dallas' Center for Advanced Telecommunications Systems and Services (CATSS) was founded in January 1998 to satisfy the acute needs of the growing Dallas/Richardson telecommunications industry. Its mission is to foster a strong Industry-University partnership to advance local telecommunications industries to the next generation of systems and products. Composed of UTD faculty and industry researchers and managers, the Center's focus is exclusively telecommunications-related fields of study and research. The technical foci of the Center reflect the current needs of the telecommunications industry, including but not limited to wireless and optical networking. The Center's work spans the entire range of available technical expertise---hardware, communications, transmission modalities, algorithms, systems architecture, and applications. As part of its activities, the Center organizes workshops and conferences on topics solicited by industry and the community. It offers seminars and courses featuring talks from leading experts both from the public and private sectors, and publishes journals and magazines. By accomplishing this, CATSS serves as a clearing house for advanced telecommunications research and development in the short run, and incubates long term vision, enabling a continuation of the robust development and rapid expansion of the telecommunications industry.
Book reivew: Advanced Database Techniques by Daniel Martin (MIT Press 1986)
Authors: Lee Dik
Published: January 2007

This book was originally published in French in 1985. The author attempts to treat in details some topics which are often ignored in most standard database texts [1, 2]. In his book, Daniel Martin attempts to point out the weakness of the relational data model such as the uselessness of functional dependency and normal forms in practical DBMSs, and the lack of power in modeling the semantics of application problems [pp. 44, 52]. Much attention was paid on practical aspects such as physical design, the construction and use data dictionary, and functional specification and requirement analysis. The author presents a new data model, called Dynamic Model, in which a fourth schema, the dynamic schema, is introduced to model the processing requirements of the transactions. The book is divided into seven chapters as follows:
Book reivew: ARTIFICIAL INTELLIGENCE IN ECONOMICS AND MANAGEMENT. Edited by L. P. Pau (North-Holland 1986)
Authors: Tuggle Francis D.
Published: January 2007

This book is a collection of thirty-three of the papers written after the International Workshop on Al in Economics and Management, which was held March 12 - 14, 1985, in Zurich, Switzerland. The main sponsor was the International Federation of Automatic Control, with multiple co-sponsors (ACM, IEEE-CS, IFORS, IFIP, ECCAI, etc.). Being a collection of thirty-three papers spread out over 288 pages (plus xv), the papers are necessarily short: the shortest is four pages and the longest is eighteen pages, although the latter has one page of references and seven pages of figures. Seventeen of the papers are seven, eight, or nine pages in length; of the remaining sixteen, eight are shorter and eight are longer.
The OMG life sciences research domain task force
Authors: Benton David , Konnerth Karl , Markel Scott
Published: January 2007

The life sciences research community has long recognized the need for component-based software. Just as standard hardware interfaces make it possible to purchase the components of a hardware system from different vendors, component-based software allows system builders to choose components from a variety of vendors and assemble them to meet the unique needs of each researcher or project. Component-based software construction depends on the availability of components that perform the required functions and are accessed through standardized interfaces. The Life Sciences Research Domain Task Force of the Object Management Group was established as a forum for collaboratively specifying the requirements for software components for the life sciences research vertical domain and assisting the OMG in adopting technically excellent specifications for the standard interfaces that enable interoperation. In this paper, we describe the mission and status of this Task Force.
Open base situation transport (OBAST)architecture
Authors: Neumiller Phillip D. , Lei Peter L. , Needham Michael L.
Published: January 2007

This paper outlines the requirements for a set of open IP based protocols enabling seamless mobility across diverse radio access networks. We begin by stating some architectural tenets upon which the requirements for the OBAST protocol set are based. Furthermore, what the authors currently believe to be the eventual desirable wireless Internet architecture is described. This architecture is shown to enable a common protocol set that we refer to as the open base station transport (OBAST) protocol set.
Application-layer mobility using SIP
Authors: Schulzrinne Henning , Wedlund Elin
Published: January 2007

Supporting mobile Internet multimedia applications requires more than just the ability to maintain connectivity across subnet changes. We describe how the Session Initiation Protocol (SIP) can help provide terminal, personal, session and service mobility to applications ranging from Internet telephony to presence and instant messaging. We also briefly discuss application-layer mobility for streaming multimedia applications initiated by RTSP.
Software cost estimation with fuzzy models
Authors: Musílek Petr , Pedrycz Witold , Succi Giancarlo , Reformat Marek
Published: January 2007

Estimation of effort/cost required for development of software products is inherently associated with uncertainty. In this paper, we are concerned with a fuzzy set-based generalization of the COCOMO model (f-COCOMO). The inputs of the standard COCOMO model include an estimation of project size and an evaluation of other parameters. Rather than using a single number, the software size can be regarded as a fuzzy set (fuzzy number) yielding the cost estimate also in form of a fuzzy set. The paper includes detailed results with this regard by relating fuzzy sets of project size with the fuzzy set of effort. The analysis is carried out for several commonly encountered classes of membership functions (such as triangular and parabolic fuzzy sets). The issue of designer-friendliness of the f-COCOMO model is discussed in detail. Here we emphasize a way of propagation of uncertainty and ensuing visualization of the resulting effort (cost). Furthermore we augment the model by admitting software systems to belong partially to the three main categories (namely embedded, semidetached and organic) and discuss key implications of this generalization and highlight its links with a generalized sensitivity analysis. The experimental part of the study illustrates the approach and contrasts it with the standard numeric version of the COCOMO model.
Fortran programs on a personal computer
Authors: Guinier D.
Published: January 2007

Design and implementation of a one-pass FORTRAN 77 cleaner-translater to create source codes written in enhanced structured FORTRAN on large scale systems which can be directly used by personal computer compilers.
Comparing fortran compilers
Authors: Appleyard John
Published: January 2007

Users of other, trendier, languages often assume that Fortran is an unused relic from a bygone age. However, evidence for its vitality may be found in the large and, apparently, growing number of Fortran compilers and tools. One can readily find half a dozen commercial Fortran 95 compilers for the Intel Windows platform, and nearly as many for Intel Linux. In addition, cheap or free Fortran 77 compilers are available from a number of sources.As a service to customers, Polyhedron Software (a UK-based developer and reseller of products for Fortran programmers) has produced a series of charts comparing the features of these compilers. The comparisons cover areas of interest to compiler users, including run-time performance, diagnostics, debugger capabilities, support from third-party libraries and tools, language extensions, GUI programming capabilities, and many others. In this short paper, I will describe some of these comparisons. Readers are referred to the Polyhedron Website (http://www.polyhedron.com) for the charts themselves.
Numerical monsters
Authors: Essex Christopher , Davison Matt , Schulzky Christian
Published: January 2007

When the results of certain computer calculations are shown to be not simply incorrect but
dramatically
incorrect, we have a powerful reason to be cautious about
all
computer-based calculations. In this paper we present a "Rogue's Gallery" of simple calculations whose correct solutions are obvious to humans but whose numerical solutions are incorrect in pathological ways. We call these calculations, which can be guaranteed to wreak numerical mayhem across both software packages and hardware platforms, "Numerical Monsters". Our monsters can be used to provide deep insights into how computer calculations fail, and we use them to engender appreciation for the subject of numerical analysis in our students. Although these monsters are based on well-understood numerical pathologies, even experienced numerical analysts will surprises in their behaviour and can use the lessons they bring to become even better masters of their tools.
APL2-a RISC business
Authors: Alfonseca M. , Selby D.
Published: January 2007

APL2 is one of the most exciting programming languages to evolve from IBM's original APL discovery. APL2 has been restricted to IBM 370 mainframe computers, due to the complexity of the interpreter required to implement all facets of the language.

This paper describes a joint research / feasibility study carried out by IBM's Madrid and Winchester Scientific Centres on generating a “Portable” Workstation APL2 interpreter.
An interactive simulation modeling system: DYNAGRAPH for multi-period planning on an APL spreadsheet
Authors: Aonuma T.
Published: January 2007

A Modeling System named DYNAGRAPH has been developed on the IBM 5550 Personal Computer with NEXUS 5500 Graphics to interactively build dynamic simulation models using APL functions. A model for the simulation is represented by APL expressions in the rows of an APL Spreadsheet. The modeling of dynamic systems is achieved by a state-variable method.

The paper introduces DYNAGRAPH and the underlying modeling method. Some of the modeling functions for dynamic simulations are presented. We claim that the method is suitable and convenient for modeling problems of moderate size, especially when using APL in teaching or business environments: DYNAGRAPH is useful as a training tool and an APL program generator to enhance APL applications in management science.
An introduction to function rank
Authors: Bernecky R.
Published: January 2007

This paper gives a simple introduction to the concepts of Function Rank and the Rank Operator as they are defined in SHARP APL, and presents examples of their use. It shows the benefits, both in language design and in practice, of these concepts. Comparisons are made with other APL implementations, which do not use these concepts.
APL object manager
Authors: Bykerk B.
Published: January 2007

In order to co-ordinate APL code written for the European Commission, which has several different computers (mainframes, minis and micros) and thus several different APL's, a comprehensive set of programming standards was developed. The standards outline, amongst other topics, how workspaces, APL objects and files should be structured, especially with respect to documentation. To aid the programmer to follow the standards, a development environment was produced and is now being used to develop systems written in DYALOG APL. The development environment guides the user through various programming tasks and organizes the documentation associated with each APL object. This paper discusses the concepts and facilities of the development environment with specific references to the standards.
APL in a development environment
Authors: Clayton L. O.
Published: January 2007

One environment in which APL has been strikingly successful is the APL system development group within I. P. Sharp Associates. The development of system programs requires a range of supporting applications for which APL is well suited. The usefulness of these APL applications can be directly related to certain properties derived from their APL implementation. These properties are discussed, and an application is explored to demonstrate how they make vital contributions to the development environment.
Application-sol interaction: an APL2 approach
Authors: Deerhake S.
Published: January 2007

This paper describes an APL2 application programmer tool which simplifies the development and implementation of APL2 applications which interact with SQL. The described tool consists of a suite of APL2 functions which provide a high level, easy-to-use, application-SQL interface. The interface extends the SQL concepts of tables and operations on tables into the APL2 workspace, providing a simple method of interaction between APL2 applications and SQL. This approach also provides a great deal of isolation between the APL2 code and the SQL code required for manipulating the application's data.

Besides simplifying the usage of SQL within APL2 applications, the tool provides a convenient means for “tuning” an application's use of SQL, particularly the SQL SELECT statements used by the application. It also provides a framework for exploring extensions to SQL statements and syntax. While still somewhat experimental, the described tool has been effectively used by inexperienced APL2 programmers with virtually no knowledge of SQL.
High powers of matrices
Authors: Dickey L. J.
Published: January 2007

At the conference APL87 held in Dallas, Dr. Tama Traberman referred to problems associated with Markov Processes. Her example showed a Markov matrix and gave an algorithm for finding powers of that matrix. In this paper we discuss two different ways of decreasing the amount of arithmetic necessary to arrive at the results.