bluuebunny/crossref_metadata_2025 huggingface dataset:
The devil and packet trace anonymization
Authors: Pang Ruoming , Allman Mark , Paxson Vern , Lee Jason
Published: February 2006

Releasing network measurement data---including packet traces---to the research community is a virtuous activity that promotes solid research. However, in practice, releasing anonymized packet traces for public use entails many more vexing considerations than just the usual notion of how to scramble IP addresses to preserve privacy. Publishing traces requires carefully balancing the security needs of the organization providing the trace with the research usefulness of the anonymized trace. In this paper we recount our experiences in (i) securing permission from a large site to release packet header traces of the site's internal traffic, (ii) implementing the corresponding anonymization policy, and (iii) validating its correctness. We present a general tool, tcpmkpub, for anonymizing traces, discuss the process used to determine the particular anonymization policy, and describe the use of metadata accompanying the traces to provide insight into features that have been obfuscated by anonymization
LTCP
Authors: Bhandarkar Sumitha , Jain Saurabh , Reddy A. L. Narasimha
Published: February 2006

In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP modifies the TCP flow to behave as a collection of virtual flows to achieve more efficient bandwidth probing. The number of virtual flows emulated is determined based on the dynamic network conditions by using the concept of
virtual layers
, such that the convergence properties and RTT-unfairness behavior is maintained similar to that of TCP. In this paper, we provide the intuition and the design for the LTCP protocol modifications and evaluation results based on ns-2 simulations and Linux implementation. Our results show that LTCP has promising convergence properties, is about an order of magnitude faster than TCP in utilizing high bandwidth links, employs few parameters and retains AIMD characteristics
Why flow-completion time is the right metric for congestion control
Authors: Dukkipati Nandita , McKeown Nick
Published: February 2006

Users typically want their flows to complete as quickly as possible. This makes Flow Completion Time (FCT) an im portant - arguably the most important - performance metric for the user. Yet research on congestion control focuses almost entirely on maximizing link throughput, utilization and fairness, which matter more to the operator than the user. In this paper we show that with typical Internet flow sizes, existing (TCP Reno) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary - often by one or two orders of magnitude. In contrast, we show how a new and practical algorithm - RCP (Rate Control Protocol) - enables flows to complete close to the minimum possible
Providing public intradomain traffic matrices to the research community
Authors: Uhlig Steve , Quoitin Bruno , Lepropre Jean , Balon Simon
Published: February 2006

This paper presents a new publicly available dataset from GÉANT, the European Research and Educational Network. This dataset consists of traffic matrices built using full IGP routing information, sampled Netflow data and BGP routing information of the GÉANT network, one per 15 minutes interval for several months. Potential benefits of publicly available traffic matrices comprise improving our understanding of real traffic matrices, their dynamics, and to make possible the benchmarking of intradomain traffic engineering methods
A region-based compilation technique for dynamic compilers
Authors: Suganuma Toshio , Yasue Toshiaki , Nakatani Toshio
Published: February 2006

Method inlining and data flow analysis are two major optimization components for effective program transformations, but they often suffer from the existence of rarely or never executed code contained in the target method. One major problem lies in the assumption that the compilation unit is partitioned at method boundaries. This article describes the design and implementation of a region-based compilation technique in our dynamic optimization framework, in which the compiled regions are selected as code portions without rarely executed code. The key parts of this technique are the region selection, partial inlining, and region exit handling. For region selection, we employ both static heuristics and dynamic profiles to identify and eliminate rare sections of code. The region selection process and method inlining decisions are interwoven, so that method inlining exposes other targets for region selection, while the region selection in the inline target conserves the inlining budget, allowing more method inlining to be performed. The inlining process can be performed for parts of a method, not just for the entire body of the method. When the program attempts to exit from a region boundary, we trigger recompilation and then use on-stack replacement to continue the execution from the corresponding entry point in the recompiled code. We have implemented these techniques in our Java JIT compiler, and conducted a comprehensive evaluation. The experimental results show that our region-based compilation approach achieves approximately 4% performance improvement on average, while reducing the compilation overhead by 10% to 30%, in comparison to the traditional method-based compilation techniques.
Layered unequal loss protection with pre-interleaving for fast progressive image transmission over packet-loss channels
Authors: Cai Jianfei , Li Xiangjun , Chen Chang Wen
Published: February 2006

Most existing unequal loss protection (ULP) schemes do not consider the minimum quality requirement and usually have high computation complexity. In this research, we propose a layered ULP (L-ULP) scheme to solve these problems. In particular, we use the rate-based optimal solution with a local search to find the average forward error correction (FEC) allocation and use the gradient search to find the FEC solution for each layer. Experimental results show that the executing time of L-ULP is much faster than the traditional ULP scheme but the average distortion is worse. Therefore, we further propose to combine the L-ULP with the pre-interleaving to have an improved L-ULP (IL-ULP) system. By using the pre-interleaving, we are able to delay the occurrence of the first unrecoverable loss in the source bitstream and thus improve the loss resilience performance. With the better loss resilience performance in the source bitstream, our proposed IL-ULP scheme is allowed to have a weaker FEC protection and allocate more bits to the source coding which leads to the improvement of overall performance. Experimental results show that our proposed IL-ULP scheme even outperforms the global optimal result obtained by any traditional ULP scheme while the complexity of IL-ULP is almost the same as L-ULP.
An analytical study of peer-to-peer media streaming systems
Authors: Tu Yi-Cheng , Sun Jianzhong , Hefeeda Mohamed , Prabhakar Sunil
Published: February 2006

Recent research efforts have demonstrated the great potential of building cost-effective media streaming systems on top of peer-to-peer (P2P) networks. A P2P media streaming architecture can reach a large streaming capacity that is difficult to achieve in conventional server-based streaming services. Hybrid streaming systems that combine the use of dedicated streaming servers and P2P networks were proposed to build on the advantages of both paradigms. However, the dynamics of such systems and the impact of various factors on system behavior are not totally clear. In this article, we present an analytical framework to quantitatively study the features of a hybrid media streaming model. Based on this framework, we derive an equation to describe the capacity growth of a single-file streaming system. We then extend the analysis to multi-file scenarios. We also show how the system achieves optimal allocation of server bandwidth among different media objects. The unpredictable departure/failure of peers is a critical factor that affects the performance of P2P systems. We utilize the concept of
peer lifespan
to model peer failures. The original capacity growth equation is enhanced with coefficients generated from peer lifespans that follow an exponential distribution. We also propose a failure model under arbitrarily distributed peer lifespan. Results from large-scale simulations support our analysis.
Effective Web browsing through content delivery adaptation
Authors: Harumoto Kaname , Nakano Tadashi , Fukumura Shinya , Shimojo Shinji , Nishio Shojiro
Published: February 2006

This article presents a Web content adaptation and delivery mechanism based on application-level quality of service (QoS) policies. To realize effective Web content delivery for users, two kinds of application-level QoS policies, transmission time and transmission order of inline objects, are introduced. Next, we define a language to specify these policies. We show that transmission order control can be implemented using HTTP/1.1 pipelined requests in which a client recognizes the transmission order description in a Web page and simulates parallel transmission of inline objects by HTTP/1.1 range requests. Experimental results show that our proposed mechanism realizes effective content delivery to a diverse group of Internet users. Finally, we introduce two methods to specify application-level QoS policies, one by content authors, and the other by end users.
Portlet syndication
Authors: Diaz Oscar , Rodriguez Juan J.
Published: February 2006

A Portlet is a multistep, user-facing application delivered through a Web application (e.g., a portal). OASIS approved standard, WSRP, is an attempt to standardize the interface between the provider and the consumer of the Portlet. This initiative promotes Portlet interoperability, componentware practices, and the existence of a Portlet market. This work argues that the diversity of the settings where a Portlet might be syndicated recommends that Portlets be instrumented for variability, and this, in turn, demands a product-line approach. This work introduces a new source of variability, the “interaction lifecycle”, a description of the visible flow of a Portlet, and shows how this feature can be adapted to cater to the idiosyncrasies of the hosting application. Distinct variants are identified that permit the consumer to customize the presentation, content, and links of the Portlet markup in a controlled way. The use of product-line techniques allow the consumer to cope with this variability in a cost-effective manner. The article ends by illustrating how the extensible capabilities of WSRP are used to accomodate this process.
Taxonomy of XML schema languages using formal language theory
Authors: Murata Makoto , Lee Dongwon , Mani Murali , Kawaguchi Kohsuke
Published: February 2006

On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
Object oriented goodness
Authors: Mather Karen
Published: February 2006

In her article 'What is Information Ethics?', Mathieson seeks to establish a new framework for Information Ethics, contesting the 'rival theories' of Van Den Hoven and of Floridi. However, when the arguments are examined in terms of Object Oriented Modelling conventions, the concepts in question appear in a different light.
A justification for software rights
Authors: Siponen Mikko
Published: February 2006

It has been debated whether unauthorized copying of computer software is morally justified and whether developers or software companies can own software and require users to pay for its use. Four views in favour of unauthorized copying of software can be distinguished: 'free software' (Stallman), the landlord analogy (Nissenbaum), the 'non-exclusiveness argument' (Weckert, Ladd) and 'it is justified to copy a program that we would never buy' (Weckert). Considerations regarding these issues can be retraced to the three foundations of rights: inherited rights that are already in place, agreed rights, and no rights. From the viewpoint of agreed rights, rights are based on agreement and negotiation, and, referring to the universalizability theses by Rawls and Hare, I argue that it is justified that developers or software companies 'own' their software. I discuss the economic and social effects of free SW, understood as the abolition of financial acknowledgements, suggested by Stallman. I conclude that such free (non-commercial) software would give rise to socio-political changes toward systems that are something other than liberal-based (e.g., socialism). Again, I argue that we have a reason to object to Stallman's program in the light of the universalizability theses. Nevertheless, even if one were to perceive this as a convincing goal, it is questionable whether one should make unauthorized copies on these grounds in a society that does not function on such lines: one should first seek to change the norms and practices of one's society. This is further argued to be advisable, since it is not obvious that adhering to software copyright in the general sense is unfair or irrelevant. For these reasons, we should take violation of the laws governing software copying seriously. Finally, I criticize the non-exclusiveness argument, the landlord analogy and the view that 'is it justified to copy a program that we would never buy'.
Japanese question-answering system using A* search and its improvement
Authors: Mori Tatsunori
Published: February 2006

We have proposed a method to introduce A* search control in a sentential matching mechanism for Japanese question-answering systems in order to reduce the turnaround time while maintaining the accuracy of the answers. Using this method, preprocessing need not be performed on a document database and we may use any information retrieval systems by writing a simple wrapper program. However, the disadvantage is that the accuracy is not sufficiently high and the mean reciprocal rank (MRR) is approximately 0.3 in NTCIR3 QAC1, an evaluation workshop for question-answering systems. In order to improve the accuracy, we propose several measures of the degree of sentence matching and a variant of a voting method. Both of them can be integrated with our system of controlled search. Using these techniques, the system achieves a higher MRR of 0.5 in the evaluation workshop NTCIR4 QAC2.
Improving chronological ordering of sentences extracted from multiple newspaper articles
Authors: Okazaki Naoaki , Matsuo Yutaka , Ishizuka Mitsuru
Published: February 2006

It is necessary to determine a proper arrangement of extracted sentences to generate a well-organized summary from multiple documents. This paper describes our Multi-Document Summarization (MDS) system for TSC-3. It specifically addresses an approach to coherent sentence ordering for MDS. An impediment to the use of chronological ordering, which is widely used by conventional summarization system, is that it arranges sentences without considering the presupposed information of each sentence. We propose a method to improve chronological ordering by resolving precedent information of arranging sentences. Combining the refinement algorithm with topical segmentation and chronological ordering, we address our experiments and metrics to test the effectiveness of MDS tasks. Results demonstrate that the proposed method significantly improves chronological sentence ordering. At the end of the paper, we also report an outline/evaluation of important sentence extraction and redundant clause elimination integrated in our MDS system.
Chinese information retrieval based on terms and relevant terms
Authors: Lingpeng Yang , Donghong Ji , Li Tang , Zhengyu Niu
Published: February 2006

In this article we describe our approach to Chinese information retrieval, where a query is a short natural language description. First, we use automatically extracted short terms from document sets to build indexes and use the short terms in both the query and documents to do initial retrieval. Next, we use long terms extracted from the document collection to reorder the top
N
retrieved documents to improve precision. Finally, we acquire the relevant terms of the short terms from the Internet and the top retrieved documents and use them to do query expansion. Experiments on the NTCIR-4 CLIR Chinese SLIR sub-collection show that document reranking can both improve the retrieval performance on its own and make a significant contribution to query expansion. The experiments also show that the extended query expansion proposed in this article is more effective than the standard Rocchio query expansion.
Principles for digital preservation
Authors: Gladney H. M.
Published: February 2006

Focusing on end users' needs rather than those of archiving institutions.
Protocol analysis
Authors: Owen Stephen , Brereton Pearl , Budgen David
Published: February 2006

Protocol analysis is an evidence-gathering technique with an established record in experimental psychology. Here, it is applied to study how programmers solve problems.
Making computer science minority-friendly
Authors: Varma Roli
Published: February 2006

Computer science programs neglect diverse student needs.
Where does Russia fit into the global software industry?
Authors: Cusumano Michael A.
Published: February 2006

Exploring how Russia's nascent software industry measures up to other countries.
Who should govern the internet?
Authors: Kumar Nanda , Mowshowitz Abbe
Published: February 2006

Failing to share control, the U.S. risks driving disaffected countries to establish their own competing, independent root servers, thus creating parallel Internets.
Offshoring
Authors: Patterson David A.
Published: February 2006

The ACM Job Migration study was released last month, and it includes many recommendations for current and future computing professionals and educators.
Live forensics
Authors: Adelstein Frank
Published: February 2006

Live forensics gathers data from running systems, providing additional contextual information that is not available in a disk-only forensic analysis.
Example-based machine translation using efficient sentence retrieval based on edit-distance
Authors: Doi Takao , Yamamoto Hirofumi , Sumita Eiichiro
Published: February 2006

An Example-Based Machine Translation (EBMT) system, whose translation example unit is a sentence, can produce an accurate and natural translation if translation examples similar enough to an input sentence are retrieved. Such a system, however, suffers from the problem of narrow coverage. To reduce the problem, a large-scale parallel corpus is required and, therefore, an efficient method is needed to retrieve translation examples from a large-scale corpus. The authors propose an efficient retrieval method for a sentence-wise EBMT using edit-distance. The proposed retrieval method efficiently retrieves the most similar sentences using the measure of edit-distance without omissions. The proposed method employs search-space division, word graphs, and an A* search algorithm. The performance of the EBMT was evaluated through Japanese-to-English translation experiments using a bilingual corpus comprising hundreds of thousands of sentences from a travel conversation domain. The EBMT system achieved a high-quality translation ability by using a large corpus and also achieved efficient processing by using the proposed retrieval method.
Anaphora resolution by antecedent identification followed by anaphoricity determination
Authors: Iida Ryu , Inui Kentaro , Matsumoto Yuji
Published: February 2006

We propose a machine learning-based approach to noun-phrase anaphora resolution that combines the advantages of previous learning-based models while overcoming their drawbacks. Our anaphora resolution process reverses the order of the steps in the classification-then-search model proposed by Ng and Cardie [2002b], inheriting all the advantages of that model. We conducted experiments on resolving noun-phrase anaphora in Japanese. The results show that with the selection-then-classification-based modifications, our proposed model outperforms earlier learning-based approaches.
Acquiring causal knowledge from text using the connective marker
tame
Authors: Inui Takashi , Inui Kentaro , Matsumoto Yuji
Published: February 2006

In this paper, we deal with automatic knowledge acquisition from text, specifically the acquisition of
causal relations
. A causal relation is the relation existing between two events such that one event causes (or enables) the other event, such as “hard rain causes flooding” or “taking a train requires buying a ticket.” In previous work these relations have been classified into several types based on a variety of points of view. In this work, we consider four types of causal relations---
cause
,
effect
,
precond(ition)
and
means
---mainly based on agents' volitionality, as proposed in the research field of discourse understanding. The idea behind knowledge acquisition is to use resultative connective markers, such as “because,” “but,” and “if” as linguistic cues. However, there is no guarantee that a given connective marker always signals the same type of causal relation. Therefore, we need to create a computational model that is able to classify samples according to the causal relation. To examine how accurately we can automatically acquire causal knowledge, we attempted an experiment using Japanese newspaper articles, focusing on the resultative connective “tame.” By using machine-learning techniques, we achieved 80% recall with over 95% precision for the
cause
,
precond
, and
means
relations, and 30% recall with 90% precision for the
effect
relation. Furthermore, the classification results suggest that one can expect to acquire over 27,000 instances of causal relations from 1 year of Japanese newspaper articles.
Topic-structure-based complementary information retrieval and its application
Authors: Ma Qiang , Tanaka Katsumi
Published: February 2006

A great deal of technology has been developed to help people access the information they require. With advances in the availability of information, information-seeking activities are becoming more sophisticated. This means that information technology must move to the next stage, i.e., enable users to acquire information from multiple perspectives to satisfy diverse needs. For instance, with the spread of digital broadcasting and broadband Internet connection services, infrastructure for the integration of TV programs and the Internet has been developed that enables users to acquire information from different media at the same time to improve information quality and the level of detail. In this paper, we propose a novel content-based join model for data streams (closed captions of videos or TV programs) and Web pages based on the concept of topic structures. We then propose a mechanism based on this model for retrieving complementary Web pages to augment the content of video or television programs. One of the most notable features of this complementary retrieval mechanism is that the retrieved information is not just similar to the video or TV program, but also provides additional information. In addition, we introduce an application system called WebTelop, which augments the content of TV programs in real time by using complementary Web pages. We also describe some experimental results.
Efficient simulation of buffer overflow probabilities in jackson networks with feedback
Authors: Juneja Sandeep , Nicola Victor
Published: February 2006

Consider a Jackson network that allows feedback and that has a single server at each queue. The queues in this network are classified as a single ‘target’ queue and the remaining ‘feeder’ queues. In this setting we develop the large deviations limit and an asymptotically efficient importance sampling estimator for the probability that the target queue overflows during its busy period, under some regularity conditions on the feeder queue-length distribution at the initiation of the target queue busy period. This importance sampling distribution is obtained as a solution to a non-linear program. We especially focus on the case where the feeder queues, at the initiation of the target queue busy period, have the steady state distribution corresponding to these instants. In this setting, we explicitly identify the importance sampling distribution when the feeder queue service rates exceed a specified threshold. We also relate our work to the existing large deviations literature to develop a perspective on successes and limitations of our results.
What’s on Your Hard Drive?
Authors: O'Hanlon Charlene
Published: February 2006

We’ve seen a lot of tools mentioned over the past year—some popular, and some we’d never heard of. With 2006 on the horizon, we’d like a lot more of the same.
A Conversation with Phil Smoot
Authors: O'Hanlon Charlene
Published: February 2006

In the landscape of today’s megaservices, Hotmail just might be Mount Everest. One of the oldest free Web e-mail services, Hotmail relies on more than 10,000 servers spread around the globe to process billions of e-mail transactions per day. What’s interesting is that despite this enormous amount of traffic, Hotmail relies on less than 100 system administrators to manage it all.
Monitoring, at Your Service
Authors: Hoffman Bill
Published: February 2006

Internet services are becoming more and more a part of our daily lives. We derive value from them, depend on them, and are now beginning to assume their ubiquity as we do the phone system and electricity grid. The implementation of Internet services, though, is an unsolved problem, and Internet services remain far from fulfilling their potential in our world.
Review of "Intrusion Prevention and Active Response: Deploying Network and Host IPS by Michael Rash, Angela D. Orebaugh, Graham Clark, Becky Pinkard, and Jake Babbin", Syngress Publishing, 2005, $49.99, ISBN: 193226647X
Authors: Tomek Andreas
Published: February 2006

Review of "Intrusion Prevention and Active Response: Deploying Network and Host IPS by Michael Rash, Angela D. Orebaugh, Graham Clark, Becky Pinkard, and Jake Babbin", Syngress Publishing, 2005, $49.99, ISBN: 193226647X
Operating systems review
Authors: Matthews Jeanna N.
Published: February 2006

This is my first issue as editor of Operating System Review and the first order of business is to thank Prof. William Waite for his 32 years of dedicated service as the previous editor of OSR. Keith Marzullo determined that Bill's term of volunteer service is the longest in ACM history! At SOSP 2005, attendees had an opportunity to sign his first issue from 1973 and his last 2005 issue. I am told that in 32 years he was never late with an issue of OSR so I have some big shoes to fill.
File size distribution on UNIX systems
Authors: Tanenbaum Andrew S. , Herder Jorrit N. , Bos Herbert
Published: February 2006

Knowledge of the file size distribution is needed to optimize file system design. In particular, if all the files are small, the disk block size should be small, too, to avoid wasting too large a fraction of the disk. On the other hand, if files are generally large, choosing a large block size is good since it leads to more efficient transfers. Only by knowing the file size distribution can reasonable choices be made. In 1984, we published the file size distribution for a university computer science department. We have now made the same measurements 20 years later to see how file sizes have changed. In short, the median file size has more than doubled (from 1080 bytes to 2475 bytes), but large files still dominate the storage requirements.
PlanetLab
Authors: Fiuczynski Marc E.
Published: February 2006

The first OSR issue I read was Volume 29 No. 2 (April 1995). At the time I was actively working on the SPIN Extensible Operating System [5] and looking for new ways to safely expose interrupt handling to user-provided code loaded into the kernel. The article by Kleiman and Eykholt on "Interrupts as Threads" in that issue of OSR was highly relevant and informative. Ever since then I had planned on contributing to OSR but unfortunately never got around to it. For this reason, when Jeanna Matthews asked whether I could serve as the guest editor of the inaugural special topics OSR issue, I jumped at the opportunity.
Scalable routing overlay networks
Authors: Nakao Akihiro , Peterson Larry , Bavier Andy
Published: February 2006

Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a
routing mesh
: the route-selection algorithm considers only those
virtual links
inter-node links in an overlay---in the routing mesh rather than all
N
2
virtual links connecting an
N
-node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead.This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanti es the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh---rather than directly on the Internet---itself benefit,; from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.
ClosestNode.com
Authors: Wong Bernard , Sirer Emin Gün
Published: February 2006

ClosestNode.com is an accurate, scalable, and backwards-compatible service for mapping clients to a nearby server. It provides a DNS interface by which unmodified clients can look up a service name, and get the IP address of the closest server. A shared system for performing such a mapping amortizes the administration and implementation costs of proximity-based server selection. It is aimed at minimizing the amount of effort required for system developers to make new and existing infrastructure services proximity-aware.
Using Really Simple Syndication (RSS) to enhance student research
Authors: Cold S. Jeff
Published: February 2006

Really Simple Syndication (RSS) is a tool used in business and by users for gleaning relevant information from the Internet. RSS technology can be used in the education environment to enhance research methods for students. Students can use RSS to glean current information from on-line journals, publications, web logs and other sources without visiting the sites daily. A combination of RSS and personal web files can be used for student group projects to connect the students and share research over the Internet.
Using collaborative learning research to enhance pair programming pedagogy
Authors: Preston David
Published: February 2006

Programming is a pillar of IT education; teaching programming is a major challenge of IT education. A significant amount of recent research has demonstrated the success of pair programming pedagogy in meeting this challenge. Pair programming is a key component of the Extreme Programming software development methodology. When used as pedagogy, pair programming is an instance of collaborative learning, a well-established technique for teaching complex, conceptual tasks. Research has documented the success of collaborative learning and has identified the critical attributes of successful collaborative learning approaches. This article uses a review of the research as a basis for recommended enhancements to ensure that pair programming pedagogy possesses the critical attributes of successful collaborative teaming approaches.
Monitored data
Authors: Chapin Ned
Published: February 2006

Business data processing, for many reasons and in spite of the technique's being weak, has not used for data control the call capability available in many programming languages. COBOL has a CALL verb with a USING option, for example, yet it enjoys little use. People not working in business data processing sometimes use the call capability for data control and find it adds clarity, discipline and understandability to their work. Most of the advantage comes from the reduction or elimination of global data (global data is something business data processing people seem to be partial to). Yet the reliance on global data--the common COBOL practice--has been roundly criticized and even denounced [9, 10].
Motivation of programmers
Authors: LeDuc A. L.
Published: February 2006

When we speak of motivation in casual conversation, we usually mean two different things. For the sake of simplicity, one of those can be called
internal
motivation, the other
external
motivation.
Review of "Software Psychology: Human Factors in Computer and Information Systems, by Ben Shneiderman", Winthrop Computer Systems Series, 1980
Authors: Olson Margrethe H.
Published: February 2006

The goal of Software Psychology, according to Professor Shneiderman, is "to facilitate the human use of computers." This is a significant goal and one for which a good book is long overdue. However, Professor Shneiderman's book does not quite reach its objective. In fact he is primarily concerned with programmer behavior; the stated objectives of Software Psychology are to enhance programming practice, refine programming techniques, improve teaching, develop software metrics and assess programmer aptitude and abilities. He does a thorough job of assessing the current state of the art in accomplishment of these objectives and in the last few chapters he focuses on design of systems for the nonprogramming user. But his concern is with facilitating computer usage, not with the broad issues of the impact of computer usage on individuals as organization members, as managers and as productive members of the society. For me, the title was somewhat misleading.
Review of "Data Communications Components: Characteristics, Operation, Application, by Gilbert Held", Hayden Books, 1979
Authors: Ives Blake
Published: February 2006

Did you ever wonder whether a multiport modem was more appropriate than a standard modem interfaced to a timedivision multiplexor? For that matter, have you ever heard of a multiport modem? Well Gilbert Held has and he describes it and 24 other data communications components in this handy reference.
Review of "The Art of Software Testing, by Glenford J. Myers", Wiley-Interscience, 1979
Authors: Ives Blake
Published: February 2006

So you think you know how to test software? Glenford Myers' new book may shake your confidence. On page one, Myers puts your hard-earned experience to the test. Presented with the following program specifications, you are asked to develop an appropriate set of test cases:"The program reads 3 integer values from a card. The three values are interpreted as representing the lengths of the sides of a triangle. The program prints a message that states whether the triangle is scalene, isosceles or equilateral."
Review of "Strategic Planning for Information Systems, by Robert V. Head", Q.E.D. Information Sciences, Inc., 1979
Authors: Ives Blake
Published: February 2006

In the summer 1977 issue of
DATA BASE
, Gene Altshuler reviewed a book entitled
Strategic Planning for MIS
(Ephraim R. McLean & John V. Soden, Wiley-Interscience, 1977). Since that time, MIS planning has received a considerable amount of attention. Now Robert Head presents another treatment of information system's strategic planning.
Management information systems
Authors: Davis Gordon B.
Published: February 2006

I have chosen 15 years as the period of review for a personal reason. It was in 1967 that I and others such as Gary Dickson and Tom Hoffmann began the Management Information Systems program at Minnesota. We were not the only university where faculty members were working to establish MIS as an academic discipline, but we achieved significant, immediate results. Therefore, many count the beginnings of MIS as an academic area to the start of the Minnesota program. We established a major in MIS within the MBA and PhD programs and founded a research center, the Management Information Systems Research Center (MISRC). These activities were carried out with the support (including financial) of major businesses in the Minneapolis-St. Paul area.
Computer control systems in organizations
Authors: Cerullo Michael
Published: February 2006

The purpose of this paper is to present an overview of control systems in organizations, with the emphasis on computer control systems. Specifically, the paper will present a model of organizational control systems, discuss the responsibility for internal control systems, present a model of computer security and control points, and categorize the security and control points by specific internal control objectives.
Book reviews
Authors: Schrage John F.
Published: February 2006

The Book Reviews section has been a review of books which the editor and some interested parties have read and given their opinion of. This policy can continue and might do so depending on the members of this Special Interest Group.
Review of "A Guide for Selecting Computers and Software for Small Businesses, by Enockson, Paul G.", Reston Publishing Company, 1983
Authors: Schrage John F.
Published: February 2006

This little book (109 pages) is excellent for the company considering the small computer and its software. The material is requirements-based and walks through an example of acquisition. The Appendices are the key to the book and provide checklists for hardware/software purchases. The content is based on determining requirements for the organization then going through a step-by-step process in solving those needs.
Review of "OS JCL, by Clary, Wayne", Mike Murach and Associates, Inc., 1980
Authors: Schrage John F.
Published: February 2006

One of the first tasks in training the new programmer has been to provide indoctrination to the system and that "key" language of job control (JCL). Even with many students given JCL at college, the organization re-trains for their specific system. The manuals for the IBM JCL have caused many trainees to wonder about programming. In looking at a variety of COBOL books, I stumbled over the Clary book and other Murach materials for the operating system area. Previously, I recommended some other materials to help students over that "JCL fright" but seldom did they feel comfortable with the reference.
Database design
Authors: Chilson David W. , Kudlac Michael E.
Published: February 2006

This paper summarizes a study conducted by the authors which investigated methodologies presently available to assist in the process of database design. The study also examined the current status of database design in a variety of organizations (manufacturing, financial government, service, and other). The findings show that familiarity with logical design methodologies is fairly high, but that actual use of these techniques is quite low. Familiarity with physical design methodologies is less than that with logical design methodologies and so too is actual use of these physical techniques.
A database design methodology for an integrated database environment
Authors: Herman Marian
Published: February 2006

The database design methodology used by a major US. commercial bank is described. The methodology is used for designing databases that support a large integrated real-time application. The methodology consists of four phases:• Conceptual Design• Detailed Conceptual Design• Logical Design• Physical DesignEach design phase corresponds to a particular phase of the standard project life cycle used at the organization. For each database design phase, data collection and analysis, required documentation, and review procedures are described.The bank's experience with and benefits derived from the design methodology are described, as well as current limitations of the methodology.
Review of "Introduction to IBM OS/JCL, by Still, Russ", Applied MicroSystems, Inc., 1983
Authors: Schrage John F.
Published: February 2006

This computer assisted instruction diskette for the Apple II computer provides an overview of the job control language structure for the IBM OS system. Almost every employer wants their new programmer trainee to have an exposure to the control language structure. Even if the computer system used by the organization is not an OS IBM system, the concepts provide the beginning fundamentals for control language for other hardware.
Review of "Business Computer Systems and Applications, by Eliason, Alan L. and Kent D. Kitts", Science Research Associates, Inc., 1979
Authors: Schrage John F.
Published: February 2006

For individuals without a diverse background of business applications, the above two books are essential. The
Business Systems
book provides a batch orientation to the major business applications and has generated the demands for the second application book by Eliason. The
On-line Applications
updates the basic applications of the business to the on-line environment and notes some of the problems associated with the processing change.
Review of "Spreadsheet Software From VisiCalc to 1-2-3, by Thomas B. Henderson, Douglas F., and Gena B. Cobb", Que Corporation, 1983
Authors: Sitek Jerry Frances
Published: February 2006

Spreadsheet Software from VisiCalc to 1-2-3
is a book that all managers who are even remotely considering the acquisition of a spreadsheet for their microcomputers should take a look at. Furthermore, those who already have spreadsheets and are considering upgrading to another version of the one currently in use or perhaps a different spreadsheet will find the information in this book beneficial. It might even help those of you with the "What do I do now" blues; in other words, those with problems learning how to work the fundamental commands for the spreadsheets you already have.
Rethinking office automation
Authors: Olson Margrethe H. , Turner Jon A.
Published: February 2006

The debate regarding the impact of technology on work organization and the quality of work life is gaining momentum as a result of office automation and its influences on large numbers of "'office" jobs. This paper argues that current approaches to implementation of office automation technology are based on faulty assumptions about both technology and work organization. The result has been systems which fail to live up the claims of dramatic increases in productivity.
Effectiveness of end-user developed applications in organizations
Authors: Amoroso Donald L.
Published: February 2006

End-user computing, an environment where users develop applications for their own use, is growing at an astounding rate. This fast-paced growth is due primarily to the proliferation of microcomputers and the availability of end-user languages. However, certain risks have been identified with user-developed applications. Applications have not been adequately tested, documented, or maintained. Users, who are non-technical developers, have failed to identify complete information requirements. In some cases end-user developers have applied the wrong analysis technique or tool to a problem. The research question arising from the current situation is: "What organizational, technical, or user factors will contribute to the effectiveness of end-user developed applications (EUDA)?"
An analysis of information search strategies for decision making
Authors: Cook Gary J.
Published: February 2006

Understanding how people search and combine information to make decisions is an important concern in the study of decision making because people tend to search information consistent with the decision process employed. Thus, analysis of these search strategies provides insight into the decision process, and into the design of computerbased aids for decision making.
Application software documentation
Authors: Guillemette Ronald A.
Published: February 2006

Documentation constitutes a significant, primary interface between the individual whose job tasks are impacted by computer-based applications, and the application system or software package. The MIS literature has identified documentation as a factor influencing project success, software maintenance, and application package usage. However, the professional literature has repeatedly noted the lack of adequate, meaningful documentation in practice. The development and validation of a psychological measure designed to investigate the meaning of documentation for its readers is a first step in a program of research involving the design and implementation of documentation as a factor in MIS utilization. The primary research question addressed by this study is: "What is the nature of dimensions which readers use when evaluating application software documentation?"
A field investigation of the effects of expert systems use on the information processing capacity of the organization
Authors: Sviokla John J.
Published: February 2006

In the past few years interest in creating expert systems (ESs) for businesses has dramatically increased. Although the number of publicized, commercial successes is small, the potential for augmenting human expertise with ESs is noteworthy. Vendors and computer science researchers have chronicled technical issues, but the organizational and management complexities of ES use have yet to be explored. The research questions are: "How does use of an ES affect the task it is designed to support?" Or more specifically, "How does ES use change the process of the task, the product which is created, and the roles of the individuals involved in the process?"
An expert systems approach to audit planning
Authors: Wensley Anthony
Published: February 2006

Audit planning is a complex task which requires considerable expertise. An audit plan specifies both the procedures to be carried out and the extent to which these procedures should be applied. An audit plan is required to achieve a defined level of assurance that errors of a given level will be detected. Further, overall goals relate to cost, time and the utilization of other scarce resources, particuarly people. The principal thrust of the research is to investigate, in more detail, the nature of audit planning and the knowledge which is applied when expert auditors develop audit plans.