ppxscal/embedding_network huggingface dataset:
Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
Venue: Conference on Supporting Group Work (2003)

We are pleased to be able to hold Group2003 on Sanibel Island this year. In addition to the beach, tennis, and pools available at the Sundial Resort we hope participants and their families will find some time to enjoy the unique beauty of Florida's southwest coast and sample the excellent Gulf of Mexico seafood at the island's restaurants. Along with all the surf, sun, and fun we know that you will find the conference sessions both stimulating and informing. Forty-two papers will be presented on topics ranging from collaborative software development to mobile collaborations on motorcycles. These papers represent the best works of the 120 that were submitted for consideration.This year we are pleased to have Professor John L. King, dean of the School of Information at University of Michigan, as our keynote speaker. His research focuses on the development of high-level requirements for information systems design and implementation. Drawing on engineering and the social sciences, he studies the organizational and institutional forces that shape how information technology is developed. Dr. King was editor-in-chief of the INFORMS journal, Information Systems Research, and has been co-editor-in-chief of Information Infrastructure and Policy since 1989.
Dynamic storage routines for Fortran programs
Authors: David W. Bray
Venue: ACM SIGPLAN Notices (1974)

This paper describes a set of list processing routines which augment the capabilities of FORTRAN by providing the programmer with the ability to dynamically allocate arbitrarily complicated data structures. The basic structure provided is a two dimensional array.
A cooperative communicative intelligent agent model for e-commerce
Authors: Ric Jentzsch, Renzo Gobbin
Venue: Managing e-commerce and mobile computing technologies (2003)

The complexities of business continue to expand. First technology, then the World Wide Web, ubiquitous commerce, mobile commerce, and who knows. Business information systems need to be able to adjust to these increased complexities, while not creating more problems. Here, we put forth a conceptual model for cooperative communicative intelligent agents that can extend itself to the logical constructs needed by modern business operations today and tomorrow.
A statistical model for estimating the effect of process variations on crosstalk noise
Authors: Maurizio Martina, Guido Masera
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Noise violation analysis due to crosstalk is recognized as one of the most challenging problems in Ultra Deep Submicron circuits, besides statistical techniques seem to be a promising approach both for early estimation and final signoff tasks. In this work a general closed form for the voltage distribution on the victim line, based on capacitance statistical distributions, is derived. Experimental results show that the proposed methodology is reliable to early estimate the effect of process variations on crosstalk noise.
Rewards: do they encourage tacit knowledge sharing in management consulting firms? case studies approach
Authors: Ricky Laupase
Venue: Knowledge management: current issues and challenges (2003)

This chapter will discuss as to whether reward systems will effectively facilitate the sharing and transfer of tacit knowledge amongst consultants in management consulting firms. A research framework was based on the 'tacit knowledge conversion' model given by Nonaka and Takeuchi (1995) and the 'reward classifications' model by VonKortzfleisch and Mergel (2001). The framework suggests that, with effective implementation, reward systems would encourage the tacit knowledge sharing. A typical example of knowledge-intensive organisation is a management consulting firm in which its success depends heavily on the sharing of tacit knowledge amongst its consultants. Seven senior management executives from different international management consulting firms who have had extensive experience in the consulting industry were interviewed. The study found that reward systems do encourage consultants to share knowledge with each other. It is also found that informal meetings and also offering non-material or 'soft' rewards are often cited as a more effective approach to encourage tacit knowledge sharing.
Incremental computation and maintenance of temporal aggregates
Authors: Jun Yang, Jennifer Widom
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.We consider the problems of computing aggregation queries in temporal databases and of maintaining materialized temporal aggregate views efficiently. The latter problem is particularly challenging since a single data update can cause aggregate results to change over the entire time line. We introduce a new index structure called the SB-tree, which incorporates features from both segment-trees and B-trees. SB-trees support fast lookup of aggregate results based on time and can be maintained efficiently when the data change. We extend the basic SB-tree index to handle cumulative (also called moving-window) aggregates, considering separatelycases when the window size is or is not fixed in advance. For materialized aggregate views in a temporal database or warehouse, we propose building and maintaining SB-tree indices instead of the views themselves.
Evaluating collaborative filtering recommender systems
Authors: Jonathan L. Herlocker, Joseph A. Konstan, Loren G. Terveen, John T. Riedl
Venue: ACM Transactions on Information Systems (TOIS) (2004)

Recommender systems have been evaluated in many, often incomparable, ways. In this article, we review the key decisions in evaluating collaborative filtering recommender systems: the user tasks being evaluated, the types of analysis and datasets being used, the ways in which prediction quality is measured, the evaluation of prediction attributes other than quality, and the user-based evaluation of the system as a whole. In addition to reviewing the evaluation strategies used by prior researchers, we present empirical results from the analysis of various accuracy metrics on one content domain where all the tested metrics collapsed roughly into three equivalence classes. Metrics within each equivalency class were strongly correlated, while metrics from different equivalency classes were uncorrelated.
Implementation of directed multigraphs in Java
Authors: Jaanus Pöial
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

An implementation of directed multigraphs is introduced for teaching course on algorithms and data structures with Java.
Free and Open Source Development Practices in the Game Community
Authors: Walt Scacchi
Venue: IEEE Software (2004)

Empirical studies of four distinct free and open source software development communities find at least five common types of development processes. These communities, particularly the computer game community, provide examples of common practices.
Discovering Use Cases from Source Code using the Branch-Reserving Call Graph
Authors: Tao Qin, Lu Zhang, Zhiying Zhou, Dan Hao, Jiasu Sun
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Understanding the behavior of a software system is animportant problem in program comprehension. Use caseshave been accepted as an effective means for describingbehavioral requirements for a software system. In thispaper, we propose a novel approach for obtaining usecases from source code. The central idea of our approachis to use the Branch-Reserving Call Graph (BRCG) as theintermediate representation of a software program. Wealso provide strategies for pruning the BRCG to avoidgenerating too many fine-grained use cases. Use cases,which may just undergo some minor modifications fromhuman experts, can be generated through traversing thepruned BRCG. The contributions of our approach arethree-fold. i) This method represents a compromisedapproach, which differs from both the static and dynamicapproaches for use case discovery. ii) This method takesinto consideration the fact that it is the branch statementsthat separate one use case from another in source code.iii) This method can avoid intensive human involvementin determining the final set of use cases. We have alsoperformed a case study for this method on a GNU system.
Design of Hermite Subdivision Schemes Aided by Spectral Radius Optimization
Authors: Bin Han, Michael L. Overton, Thomas P.-Y. Yu
Venue: SIAM Journal on Scientific Computing (2003)

We present a method for constructing multivariate refinable Hermite interpolants and their associated subdivision algorithms based on a combination of analytical and numerical approaches. As the limit of a linear iterative procedure, the critical L2 Sobolev smoothness of a refinable Hermite interpolant is given by the spectral radius of a matrix dependent upon the refinement mask. The design question is, Given certain constraints (support size, symmetry type, refinement pattern, etc.), how can one choose the refinement mask so that the resulting refinable function has optimal smoothness? This question naturally gives rise to a spectral radius optimization problem. In general, the objective function is not convex and may not be differentiable, or even Lipschitz, at a local minimizer. Nonetheless, a recently developed robust solver for nonsmooth optimization problems may be applied to find local minimizers of the spectral radius objective function. In fact, we find that in specific cases that are of particular interest in the present context, the objective function is smooth at local minimizers and may be accurately minimized by standard techniques. We present two necessary mathematical tricks that make the method practical: (i) compression of matrix size based on symmetry and (ii) efficient computation of gradients of the objective function. We conclude by reporting some computational results.
FolkMusic: A Mobile Peer-to-Peer Entertainment System
Authors: Mikael Wiberg
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In this paper we present the design of FolkMusic, a mobile peer-to-peer entertainment system. The work reported in this paper builds on the current trends towards: 1) edutainment software, 2) increase in use of peer-to-peer technologies, and, 3) the current trend towards mobile computing solutions. Further on, the research reported in this paper builds on prior research on "folk computing" for which mobile ad-hoc peer-to-peer solutions are a focal concern. Overall,this paper contributes to research on MANETs (Mobile Ad-hoc Networks) and peer-to-peer (P2P) computing by illustrating how mobile peer-to-peer technologies can be applied to both the area of entertainment as well as for educational purposes. Further on, the FolkMusic system contributes to current technical efforts made on ad-hoc networks by providing a goodexample of how Internet technologies and similar stationary and stable infrastructures can be combined with highly dynamic and wireless networks.
Global Predictability of Chaotic Epidemiological Dynamics in Coupled Populations
Authors: Matt Davison, C. Essex, J. S. Shiner
Venue: Open Systems Information Dynamics (2003)

When the dynamics of an epidemic are chaotic, detailed prediction is effectively impossible, except perhaps in the short term. However, a probability distribution underlying the motion does allow for the long term prediction of statistical measures such as the mean or the standard deviation. Even this weaker long term predictability might be lost if distinct populations with chaotic dynamics are coupled. We show that such coupling can result in a phenomenon we call &ldquo;sensitive dependence on neglected dynamics&rdquo;. In light of this phenomenon, it is somewhat surprising that when two logistic maps are coupled, the long term predictability of the mean and standard deviation is maintained. This is true even though the probability distribution describing the time series depends on the coupling strength. The coupling-strength dependence does reveal itself in the loss of predictability of higher order moments such as skewness and kurtosis.
The language of machines
Authors: Eva Jacobus, Brian Duffy
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

When we start to engage machines in conversation, what language will it be? While natural language is our preferred means of communication, natural language processing is by no means trivial. An alternate approach is to look at augmenting Agent Communication Languages with a view to providing a middle ground between for speech-based interaction between man and machine. This paper presents such a system which has been implemented on Media Lab Europe's social robot "Joe".
A Tale of Three Disciplines ...and a Revolution
Authors: Jesse H. Poore
Venue: Computer (2004)

Despite years of hard work and dedicated champions, software engineering's educational and industrial constituents have not only failed to converge, the gap between them continues to grow.Some disciplines, like circuit and genetic engineering, seem to evolve from theory to practice relatively responsibly. Software engineering, on the other hand, while not yet at the guillotine, has suffered a decided lack of direction. It may be time to storm the gates. It is never too late for a revolution, and circuit and genetic engineering provide two worthy role models.
IM, Not IP (Information Pollution)
Authors: Jakob Nielsen
Venue: Queue (2003)

Respected technology commentators say that they now prefer instant messaging (IM) over e-mail as their medium of choice for computer-mediated communication.1 The main reasons are that e-mail has become an overloaded channel for readers and that you can’t be sure to get a timely response from the recipients of your e-mail.
From the editors
Authors: Wynne W. Chin, Dorothy Leidner
Venue: ACM SIGMIS Database (2003)

In our final issue for this year, we are pleased to present a nice broad range of papers that include two special issue topic areas: The Role of the CIO and Component-Based Software Development. The first two papers in this volume dealing with the role of the CIO reflect the efforts of our guest editor Charlotte Stephens. We thank Charlotte for her dedication and efforts as well as all the reviewers that took part in process. We asked Charlotte to provide an introduction to these papers and she has graciously done so. Similarly, the third article by Jain, Vitharana & Zahedi represents the final paper in a series of four related to a special issue call on component-based software. We originally wished to have a single volume housing these papers. But due to logistical issues, publishing each article as soon as it was ready was eventually felt to be more expedient. Nonetheless, it is important to note that this special issue was guest edited by T. Ravichandran. In turn, Ravi has also graciously agreed to provide an introduction discussing all four papers. The last paper in this issue by Hsu, Chen, Jiang, and Klein provides food for thought on the relationship between career satisfaction and the impact of both the career stage and career anchor that an IT worker is situated. Not surprisingly, the relationships are found to be more complex that previously depicted in the literature. The article warns against the one size fits all approach especially for those with technically oriented careers. As a final note, with the publication of these four articles - we are close to completing all the outstanding papers that we've inherited from the previous editors. While there are still one or two papers left for us to process, authors who have submitted papers to us during the past two years of our tenure and received acceptances will be glad to know that their papers will soon see the light of day.
Agent-Based Distributed Intrusion Source Identification
Authors: Hongjun Wang, Ruijun Wang, Cuirong Wang, Yuan Gao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Network-based intrusion has become a serious threat to networked information systems. Yet, the current network security mechanisms are passive in response to network-based intrusions. In order to hide their origins, intruders usually use incorrect or spoofed source IP addresses breaking into targets. It is difficult to identify the real source of these network-based intrusions due to the nature of the IP protocol. This paper presents the design of distributed intrusion source identification systems (DISIS) based on agents. It is comprised of several agents of different types, which can be developed respectively. The agents communicate with each other when they take their actions. DISIS can cooperate with any other intrusion detection system. This system can be installed in router or a dedicated device connected to router. DISIS can trace single source attack or multiple sources attack on-line or off-line.
Proscenium: a framework for spatio-temporal video editing
Authors: Eric P. Bennett, Leonard McMillan
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present an approach to video editing where movie sequences are treated as spatio-temporal volumes that can be sheered and warped under user control. This simple capability enables new video editing operations that support complex postproduction modifications, such as object removal and/or changes in camera motion. Our methods do not rely on complicated and error-prone image analysis or computer vision methods. Moreover, they facilitate an editing approach to video that is similar to standard image-editing tasks. Central to our system is a movie representation framework called Proscenium that supports efficient queries and operations on spatio-temporal volumes while maintaining the original source content. We have adopted a graph-based lazy-evaluation model in order to support interactive visualizations, complex data modifications, and efficient processing of large spatio-temporal volumes.
First experiences using XACML for access control in distributed systems
Authors: Markus Lorch, Seth Proctor, Rebekah Lepro, Dennis Kafura, Sumit Shah
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

Authorization systems today are increasingly complex. They span domains of administration, rely on many different authentication sources, and manage permissions that can be as complex as the system itself. Worse still, while there are many standards that define authentication mechanisms, the standards that address authorization are less well defined and tend to work only within homogeneous systems. This paper presents XACML, a standard access control language, as one component of a distributed and inter-operable authorization framework. Several emerging systems which incorporate XACML are discussed. These discussions illustrate how authorization can be deployed in distributed, decentralized systems. Finally, some new and future topics are presented to show where this work is heading and how it will help connect the general components of an authorization system.
Free theorems in the presence of seq
Authors: Patricia Johann, Janis Voigtländer
Venue: ACM SIGPLAN Notices (2004)

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. Unfortunately, the standard parametricity theorem fails for nonstrict languages supporting a polymorphic strict evaluation primitive like Haskell's seq. Contrary to the folklore surrounding seq and parametricity, we show that not even quantifying only over strict and bottom-reflecting relations in the $\forall$-clause of the underlying logical relation --- and thus restricting the choice of functions with which such relations are instantiated to obtain free theorems to strict and total ones --- is sufficient to recover from this failure. By addressing the subtle issues that arise when propagating up the type hierarchy restrictions imposed on a logical relation in order to accommodate the strictness primitive, we provide a parametricity theorem for the subset of Haskell corresponding to a Girard-Reynolds-style calculus with fixpoints, algebraic datatypes, and seq. A crucial ingredient of our approach is the use of an asymmetric logical relation, which leads to "inequational" versions of free theorems enriched by preconditions guaranteeing their validity in the described setting. Besides the potential to obtain corresponding preconditions for standard equational free theorems by combining some new inequational ones, the latter also have value in their own right, as is exemplified with a careful analysis of seq's impact on familiar program transformations.
Implementing the PostgreSQL Query Optimizer within the OPT++ Framework
Authors: Ju Wang, Jinmiao Li, Greg Butler
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Our work studies the application of an existing framework,called OPT++, for query optimization for relationaldatabases. The initial application was a simplebottom-up optimizer, while the second application wasto implement the query optimization strategies of PostgreSQLwith the framework. Our experience illustratesthe power and the pitfalls of reusing frameworks.During the course of the two applications we foundsubstantial need to improve the design at the detailed levelthough the main abstractions of OPT++ did not change.Our second application raised many issues with the performanceof OPT++, which is surprising since its fundamentalpurpose was a major study of relative performanceof query optimization strategies by its author. Wehave addressed many performance issues, but some withbroad impact on the framework's code are still being addressed.
Partial evaluation of MATLAB
Authors: Daniel Elphick, Michael Leuschel, Simon Cox
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

We describe the problems associated with the creation of high performance code for mathematical computations. We discuss the advantages and disadvantages of using a high level language like MATLAB and then propose partial evaluation as a way of lessening the disadvantages at little cost. We then go on to describe the design of a partial evaluator for MATLAB and present results showing what performance increases can be achieved and the circumstances in which partial evaluation can provide these.
A Test-Driven Component Development Framework based on the CORBA Component Model
Authors: Egon Teiniker, Stefan Mitterdorfer, Leif Morgan Johnson, Christian Kreiner, Zsolt Kovács, Reinhold Weiss
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Short product cycles and rapidly changing requirementsare increasingly forcing developers to use agile developmentstrategies like extreme programming and test-drivendevelopment. At the same time, hierarchical software designstrategies such as component based software engineeringare becoming necessary to overcome increasing softwarecomplexity. In this paper, we present a test-drivencomponent development framework that encapsulates testcode in a mirror component for automated testing duringdevelopment, and as an executable semantic to simplify assessmentand to increase trustworthiness of software systems.