ppxscal/embedding_network huggingface dataset:
The market for wired city services
Authors: Robert G. Rittenhouse
Venue: ACM SIGCAS Computers and Society (1979)

This paper attempts to develop estimates of the amount and pattern of home use that mught ensue if home information/computer systems were introduced into the contemporary social system. This discussion is not intended to have technological orientation. The services described are possibl, and exist, on a small scale. The prolems involved in duilding a large system which provides multiple services are intentionally omitted. Also the effects of different regulatory climates are not explored in any detall. The primary concern is with the market for home use of wored city services.
Model driven architecture based XML processing
Authors: Ivan Kurtev, Klaas van den Berg
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

A number of applications that process XML documents interpret them as objects of application specific classes in a given domain. Generic interfaces such as SAX and DOM leave this interpretation completely to the application. Data binding provides some automation but it is not powerful enough to express complex relations between the application model and the document syntax. Since document schemas play the role of models of documents we can define document processing as model-to-model transformation in the context of Model Driven Architecture (MDA). We define a transformation language for specifying transformations from XML schemas to application models. Transformation execution is an interpretation of a document that results in a set of application objects.
Computing the update of the repeated median regression line in linear time
Authors: Thorsten Bernholt, Roland Fried
Venue: Information Processing Letters (2003)

The repeated median line estimator is a highly robust method for fitting a regression line to a set of n data points in the plane. In this paper, we consider the problem of updating the estimate after a point is removed from or added to the data set. This problem occurs, e.g., in statistical online monitoring, where the computational effort is often critical. We present a deterministic algorithm for the update working in O(n) time and O(n2) space.
XRL/Woflan: Verification and Extensibility of an XML/Petri-Net-Based Language for Inter-Organizational Workflows
Authors: H. M. W. Verbeek, W. M. P. Van Der Aalst, Akhil Kumar
Venue: Information Technology and Management (2004)

In this paper, we present XRL/Woflan. XRL/Woflan is a software tool using state-of-the-art Petri-net analysis techniques for verifying XRL workflows. The workflow language XRL (eXchangeable Routing Language) supports cross-organizational processes. XRL uses XML for the representation of process definitions and Petri nets for its semantics. XRL is instance-based, therefore, workflow definitions can be changed on the fly and sent across organizational boundaries. These features are vital for today's dynamic and networked economy. However, the features also enable subtle, but highly disruptive, cross-organizational errors. On-the-fly changes and one-of-a-kind processes are destined to result in errors. Moreover, errors of a cross-organizational nature are difficult to repair. XRL/Woflan uses eXtensible Stylesheet Language Transformations (XSLT) to transform XRL specifications to a specific class of Petri nets, and to allow users to design new routing constructs, thus making XRL extensibe. The Petri-net representation is used to determine whether the workflow is correct. If the workflow is not correct, anomalies such as deadlocks and livelocks are reported.
Multiplicative Properties of Spectral Walsh Coefficients of the Boolean Function
Authors: C. N. Yanushkevich
Venue: Automation and Remote Control (2003)

It is shown for the first time that spectral Walsh coefficients of the Boolean function have the structure in the form of the product of Walsh derivatives of this function. A method and an algorithm are suggested for the analysis of multiplicative properties of Walsh coefficients in terms of the behavior of the Boolean function and results of the experiments on test logic circuits are given.
An Analysis of the Imagine PA Public Sector ERP Project
Authors: William Wagner, Yvonne Lederer Antonucci
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

For the past several decades, we have seen organizations on a global scale continue to streamline their business processes enabled by enterprise resource planning (ERP) systems. Despite the recent economic downturn, the public sector represents one of the largest potential areas for new ERP sales. In addition the scale of public sector ERP projects is potentially huge as evidenced by the projected $3B for the US Navy ERP implementation and the US Army ERP implementation that is expected to include over 135,000 end users. The huge scale of these projects reinforces the need for successful ERP implementation methodologies for the public sector. Several governmental agencies in the US, Germany, Australia, and Malaysia have reported that the integration of agencies and systems in the public sector can be quite different from the private sector, requiring the use of a different approach and model. However, these agencies only attempted to implement different parts of an ERP system, whereas the US commonwealth or state of Pennsylvania is one of the first to attempt the integration of almost all of its governmental agencies with a single ERP package on a large scale. The question remains if there is a need to use a different enterprise systems implementation approach and model for a large-scale integrated ERP system in the public sector as compared to the private sector. This paper first identifies various differences in ERPimplementation methodologies deployed in the public and private sectors, and then focuses on the issues and success factors of one large-scale public sector ERP project. Finally, these issues and success factors are compared to private sector ERP implementations.
PURPLE: Predictive Active Queue Management Utilizing Congestion Information
Authors: Roman Pletka, Marcel Waldvogel, Soenke Mannal
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Active Queue Management (AQM) is an attempt to finda delicate balance between two antagonistic Internet queuingrequirements: First, buffer space should be maximizedto accommodate the possibly huge transient bursts; second,buffer occupation should be minimum so as not to introduceunnecessary end-to-end delays. Traditional AQMmechanisms have been built on heuristics to achieve thisbalance, and have mostly done so quite well, but often requiremanual tuning or have resulted in slow convergence.In contrast, the PURPLE approach predicts the impact ofits own actions on the behavior of reactive protocols andthus on the short-term future traffic without keeping per-flowstate. PURPLE allows much faster convergence of themain AQM parameters, at least towards a local optimum,thereby smoothing and minimizing both congestion feedbackand queue occupancy. To improve the quality of theprediction, we also passively monitor (using lightweight operations)information pertaining to the amount of congestionelsewhere in the network, for example, as seen by flowstraversing this router.
Peer-to-peer learning with open-ended writable Web
Authors: Jakko Kurhila, Miikka Miettinen, Petri Nokelainen, Patrik Floréen, Henry Tirri
Venue: ACM SIGCSE Bulletin (2003)

In spite of advances in educational technology, most Web-based computer science courses rely on costly pre-made learning materials. By shifting the emphasis to peer-to-peer learning and other student-centred learning principles, more meaningful learning process can be accomplished, without preparing stand-alone Web-courses. A course applying these principles is presented along with a tool built for the purpose. The tool offers the possibility to build a joint information pool and publish new work while constructing knowledge by collaborative annotation of the information or published work. According to our experince, transparency in the learning process is also well-accepted and viewed beneficial by the students.
Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
Authors: Dudley Stark
Venue: Combinatorics, Probability and Computing (1997)

Assemblies are labelled combinatorial objects that can be decomposed into components. Examples of assemblies include set partitions, permutations and random mappings. In addition, a distribution from population genetics called the Ewens sampling formula may be treated as an assembly. Each assembly has a size n, and the sum of the sizes of the components sums to n. When the uniform distribution is put on all assemblies of size n, the process of component counts is equal in distribution to a process of independent Poisson variables Zi conditioned on the event that a weighted sum of the independent variables is equal to n. Logarithmic assemblies are assemblies characterized by some &theta; > 0 for which i&Eopf;Zi &rarr; &theta;. Permutations and random mappings are logarithmic assemblies; set partitions are not a logarithmic assembly. Suppose b = b(n) is a sequence of positive integers for which b&#x002F;n &rarr; &beta; ε (0, 1]. For logarithmic assemblies, the total variation distance db(n) between the laws of the first b coordinates of the component counting process and of the first b coordinates of the independent processes converges to a constant H(&beta;). An explicit formula for H(&beta;) is given for &beta; ε (0, 1] in terms of a limit process which depends only on the parameter &theta;. Also, it is shown that db(n) &rarr; 0 if and only if b&#x002F;n &rarr; 0, generalizing results of Arratia, Barbour and Tavar&eacute; for the Ewens sampling formula. Local limit theorems for weighted sums of the Zi are used to prove these results.
EDITORIAL
Authors: Leigh Landy
Venue: Organised Sound (2002)

This issue of Organised Sound is about interactivity, a theme that the journal has often visited in the past. What makes this visit to this very important subject special is that it has been chosen as the first theme within our annual collaboration with the International Computer Music Association (ICMA). The ICMA President, Mary Simoni, has joined the Editors this year as ICMA representative and Mara Helmuth, currently the ICMA's editor of Array, has kindly taken on the role of Guest Editor for this issue. The journal Editors would like to welcome the ICMA and thank those ICMA members, and Mara in particular, who helped to make this issue possible. We look forward to further developing this collaborotion.
The effect of small disjuncts and class distribution on decision tree learning
Authors: Gary Mitchell Weiss
Venue:  (2003)

The main goal of classifier learning is to generate a model that makes few misclassification errors. Given this emphasis on error minimization, it makes sense to try to understand how the induction process gives rise to classifiers that make errors and whether we can identify those parts of the classifier that generate most of the errors. In this thesis we provide the first comprehensive studies of two major sources of classification errors. The first study concerns small disjuncts, which are those disjuncts within a classifier that cover only a few training examples. An analysis of classifiers induced from thirty data sets shows that these small disjuncts are extremely error prone and often account for the majority of all classification errors. Because small disjuncts largely determine classifier performance, we use them as a &ldquo;lens&rdquo; through which to study classifier induction. Factors such as pruning, training-set size, noise and class imbalance are each analyzed to determine how they affect small disjuncts and, more generally, classifier learning. The second study analyzes the effect that rare classes and class distribution have on learning. Those examples belonging to rare classes are shown to be misclassified much more often than common classes. The thesis then goes on to analyze the impact that varying the class distribution of the training data has on classifier performance. The experimental results indicate that the naturally occurring class distribution is not always best for learning and that a balanced class distribution should be chosen to generate a classifier robust to different misclassification costs. It is often necessary to limit the amount of training data used for learning, due to the costs associated with obtaining and learning from this data. This thesis presents a budget-sensitive progressive-sampling algorithm for selecting training examples in this situation. This algorithm is shown to produce a class distribution that performs quite well for learning (i.e., is near optimal).
Distributed coordination of project schedule changes using agent-based compensatory negotiation methodology
Authors: Keesoo Kim, Boyd C. Paulson,  Jr., Raymond E. Levitt, Martin A. Fischer, Charles J. Petrie,  Jr.
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

In the construction industry, projects are becoming increasingly large and complex, necessitating multiple subcontractors. Traditional centralized coordination techniques used by general contractors become insufficient as subcontractors perform most work and provide their own resources. When subcontractors cannot provide enough resources, they hinder their own performance, that of other subcontractors, and ultimately the entire project. Thus, projects need a new distributed coordination approach wherein all of the concerned subcontractors can respond to changes and reschedule a project dynamically. This paper presents a new distributed coordination framework for project schedule changes (DCPSC) that is based on an agent-based negotiation approach wherein software agents evaluate the impact of changes, simulate decisions, and give advice on behalf of the human subcontractors. A case example demonstrates the significance of the DCPSC. It compares two centralized coordination methodologies used in current practice to the DCPSC framework. We demonstrate that our DCPSC framework always finds a solution that is better than or equal to any of two centralized coordination methodologies.
The biological integration system
Authors: Zoé Lacroix, Omar Boucelma, Mehdi Essid
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

The access and exploitation of integrated Web data repositories and applications is critical for life science. Biologists design protocols that typically rely on complex query pipelines accessing various biological Web resources (data sources and tools) to constitute data sets for analysis and mining. Web integration platforms are needed to allow biologists to access, manipulate and analyze electronic biological data. The design of integration architectures to support life science addresses specific issues. Biological resources are highly heterogeneous: not only they differ by their data representation, but they also offer radically different query capabilities. In this paper we present the Biological Integration System (BIS) that focuses on the data integration aspects while addressing the integration of query capabilities available at the sources. Typically, biological Web data sources provide complex query and analysis capabilities such as sequence similarity search engines, that need to be integrated as well as the data. We introduce the notion of derived wrappers that capture additional query capabilities to either compensate capabilities lacking at a source, or to adjust an existing capability in order to make it homogeneous with similar capabilities, wrapped at other sources.
Reflections by teachers learning to program
Authors: Ken Halland, Katherine Malan
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

In this paper we look at what we can learn about teaching programming from the reflections of teachers on their own learning. Using direct quotes from journals kept by teachers while they were learning Delphi, we discuss the suitability of a visual or event-driven programming language for teaching programming. We then show how knowledge of another language can both help and hinder the learning of a new language with a different paradigm. In particular, we highlight some of the changes in thinking required with respect to learning visual, event-driven programming. Finally we look at issues around learning styles, and whether theory or practice should be done first.
Common Subsequences and Supersequences and their Expected Length
Authors: Vlado Dančík
Venue: Combinatorics, Probability and Computing (1998)

Let f(n, k, l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants &gamma;(l)k such that f(n, k, l)&rarr; &gamma;(l)kn as n&rarr;&infin;, and we show that &gamma;(l)k= &Theta;(k1&#x002F;l&minus;1) as k&rarr;&infin;. Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.
The use of action research in the improvement of communication in a community of practice: the MOISIG case
Authors: Anabela Sarmento, João Batista, Leonor Cardoso, Mário Lousã, Rosalina Babo, Teresa Rebelo
Venue: Knowledge management: current issues and challenges (2003)

Research projects conducted under the action research approach are expected to present a dual contribution: to solve real problems and to add some new knowledge. This chapter introduces a case in which the researcher and the research client are the same entity. The research question and the problem to be solved concern communication in communities of practice using information technology. A description of the community of practice under study is provided, as well as the action research approach and the research cycles concluded. Results concerning the research question, the problem under resolution and the ethical question (researcher and research client being the same entity) are discussed. The evaluation of the results leads to the main conclusion that the action research approach is helpful for both learning processes and problem solving, even when the researcher and the research client are the same entity.
Collaboration and Undo: The Web Workspace Paradigm
Authors: Garret Swart
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

An informal look at some of the most annoying problems confronting users who attempt to manipulate data stored on the web and a new update paradigm that handles many of these problems. This new approach, called Web Workspaces, allows for collaboration, undo, what if' analysis, auditing and a form of long running transaction. The new approach builds on Workspace Versioning techniques long in use in CASE and CAD systems and on transaction coordination techniques, long used to turn disparate applications into cohesive systems. The ideas can be applied to Web Services or to Enterprise frameworks to build more robust and usable applications for manipulating data on the web.
NIST Net: a Linux-based network emulation tool
Authors: Mark Carson, Darrin Santay
Venue: ACM SIGCOMM Computer Communication Review (2003)

Testing of network protocols and distributed applications has become increasingly complex, as the diversity of networks and underlying technologies increase, and the adaptive behavior of applications becomes more sophisticated. In this paper, we present NIST Net, a tool to facilitate testing and experimentation with network code through emulation. NIST Net enables experimenters to model and effect arbitrary performance dynamics (packet delay, jitter, bandwidth limitations, congestion, packet loss and duplication) on live IP packets passing through a commodity Linux-based PC router. We describe the emulation capabilities of NIST Net; examine its architecture; and discuss some of the implementation challenges encountered in building such a tool to operate at very high network data rates while imposing minimal processing overhead. Calibration results are provided to quantify the fidelity and performance of NIST Net over a wide range of offered loads (up to 1 Gbps), and a diverse set of emulated performance dynamics.
Mining Sequential Patterns Using Graph Search Techniques
Authors: Yin-Fu Huang, Shao-Yuan Lin
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Sequential patterns discovery has emerged as animportant problem in data mining. In this paper, wepropose an effective GST algorithm for mining sequentialpatterns in a large transaction database. Different from theApriori-like algorithms, the GST algorithm can out oforder find large k-sequences (k > = 3); i.e., we can findlarge k-sequences not directly through large(k-1)-sequences. This leads to that our algorithm has muchbetter performance than the Apriori-like algorithms.Besides, we also propose the method to find newsequential patterns by scanning only new transactionssince the database was increased. Through severalcomprehensive experiments, the GST algorithm gains asignificant performance improvement over the Apriori-likealgorithms. Also we found as long as the ratio of the itemspurchased in new transactions is not close to 100%,scanning only new transactions is always much better thanscanning the entire database.
Integrating Closed-Loop Supply Chains and Spare-Parts Management at IBM
Authors: Moritz Fleischmann, Jo A. E. E. van Nunen, Ben Gräve
Venue: Interfaces (2003)

IBM is among the pioneers recognizing the benefits of closed-loop supply chains that integrate product returns into business operations. We worked on a project exploiting product returns as a source of spare parts. Key decisions concern what recovery opportunities to use, the channel design, and coordinating alternative supply sources. Our analytic inventory-control model and a simulation model showed that procurement-cost savings largely outweigh reverse logistics costs and that information management is essential. These findings provide a basis for significantly expanding the usage of the novel parts supply source, thereby cutting procurement costs.
Conceptual design of technical systems using functions and physical laws
Authors: Roman Žavbi, Jože Duhovnik
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

Since the operation of technical systems can be explained using physical laws, why then might we not use them explicitly in designing these systems? The characteristic initial binding variable, with which appropriate physical laws are sought, first needs to be extracted from the function of the future technical system. If there are several appropriate physical laws (i.e., operators), we evaluate them using the Analytic Hierarchy Process (AHP) method. The most suitable is then selected with regard to the chosen criteria based on design requirements. When one physical law is not sufficient for the design of a technical system, several laws are linked together using binding variables to form a conceptual chain (i.e., macro-operator). Such a chain does not only contain supporting physical laws; physical laws indirectly introduce basic models of shape, their basic topology, geometry, and basic material properties into the chain. A prototype computer-aided design system is based on the prescriptive conceptual design model presented below.