ppxscal/embedding_network huggingface dataset:
Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
Authors: Kyle Siegrist
Venue: Combinatorics, Probability and Computing (1998)

Subgraph expansions are commonly used in the analysis of reliability measures of a failure-prone graph. We show that these expansions are special cases of a general result on the expected value of a random variable defined on a partially ordered set; when applied to random subgraphs, the general result defines a natural association between graph functions. As applications, we consider several graph invariants that measure the connectivity of a graph: the number of connected vertex sets of size k, the number of components of size k, and the total number of components. The expected values of these invariants on a random subgraph are global performance measures that generalize the ones commonly studied. Explicit results are obtained for trees, cycles, and complete graphs. Graphs which optimize these performance measures over a given class of graphs are studied
Workload characterization for an E-commerce web site
Authors: Qing Wang, Dwight Makaroff, H. Keith Edwards, Ryan Thompson
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Electronic commerce servers have a significant presence in today's Internet. Corporations require good performance for their business processes. To date, little empirical evidence has been discovered which identifies the types requests that users make of E-commerce systems. In this papers we examine the request level characteristics of the web site of a multinational car-rental company based on a 24 hour web server log. Our main conclusions are: i) An E-commerce web page typically contains many small image files and some popular image files are always requested together; ii) The percentage of requests for each service tends to be stable throughout the day when the time scale is large enough (10 minutes in this case); iii) Significant proportions of the requests are for dynamic pages and require the Secure Socket Layer protocol (SSL); and iv) most web objects are either requested primarily through SSL or primarily through non-SSL.One of the performance implications with respect to the image request patterns is that these image files should be bundled to reduce the number of requests a client issues as well as the server overhead to transfer these small image files separately. The server should arrange its resource allocation taking the request mix into account in order to improve performance. Finally, the use of SSL with respect to the various objects suggests that further study is needed to determine for which pages it is appropriate to use these security measures as they have both performance and security implications.
Mining high dimensional data for classifier knowledge
Authors: Raj Bhatnagar, Goutham Kurra, Wen Niu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

We present in this paper the problem of discovering sets of attribute-value pairs in high dimensional data sets that are of interest not because of co-occurrence alone, but due to their value in serving as cores for potential classifiers of clusters. We present our algorithm in the context of a gene-expression dataset. Gene expression data, in most situations, is insufficient for clustering algorithms and any statistical inference because for 6000+ genes, typically only 10s and at most 100s of data points become available. It is difficult to use statistical techniques to design a classifier for such immensely under-specified data. The observed data, though statistically, insufficient contains some information about the domain. Our goal is to discover as much information about all potential classifiers as possible from the data and then summarize this knowledge. This summarization provides insights into the composition of potential classifiers. We present here algorithms and methods for mining a high dimensional data set, exemplified by a gene expression data set, for mining such information.
The homomorphism problem for trace monoids
Authors: Pedro V. Silva
Venue: Theoretical Computer Science (2003)

It is proved to be decidable, for any given finite subset F of X*, dependency alphabet (Y, τ) and mapping φ : F → Y*, whether or not φ can be extended to a monoid homomorphism φ : F* → M(Y,τ). This contrasts with the undecidability of the symmetric problem, when we consider the dependency alphabet (X, τ) instead. Some other particular cases of homomorphism and isomorphism problems among trace monoids are also discussed.
Neoinstitutionalism and e-government: beyond Jane Fountain
Authors: Kaifeng Yang
Venue: Social Science Computer Review (2003)

This article addresses the evolution and implementation of e-government with a neoinstitutional perspective. It starts with a critique on Jane Fountain's technology enactment framework in that the framework fails to show how elected officials, public administrators, and citizens can facilitate e-government toward better democratic governance. This problem reflects the immaturity and ambiguity of neo-institutionalism in accounting for institutional change. The author argues that a balance between agent and institution, between strategic choice and institutional constraint should be maintained in analyzing the evolution of e-government as a long-term institutional change. This balanced approach would give public administration a more optimistic future of e-government.
A Mapping Strategy for Resource-Efficient Network Processing on Multiprocessor SoCs
Authors: Matthias Grünewald, Jörg-Christian Niemann, Mario Porrmann, Ulrich Rückert
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Hardware architectures based on a field of hardware-extended processors can provide flexible computing power for applications where parallelism can be exploited. For multiprocessors, the assignment of functionality to execution units can have a great impact on the performance.Additionally, finding the optimal mapping can be a time-consuming task. We present a multiprocessor architecture along with a suitable design method that includes an automatedsolution to the mapping problem. Our hardware architecture employs a network-on-chip (NoC) to achieve a high degree of scalability for the application and for the system in respect to future integration technologies.We also show how to reduce the packet buffer requirements with a proper scheduling strategy and present first estimates for the resource consumption of an application targeted for mobile networking.
PINE: Podium Incremental Neighbor Evaluator for classifying spatial data
Authors: William Perrizo, Qin Ding, Anne Denton, Kirk Scott, Qiang Ding, Maleq Khan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Given a set of training data, nearest neighbor classification predicts the class value for an unknown tuple X by searching the training set for the k nearest neighbors to X and then classifying X according to the most frequent class among the k neighbors. Each of the k nearest neighbors casts an equal vote for the class of X. In this paper, we propose a new algorithm, Podium Incremental Neighbor Evaluator (PINE), in which nearest neighbors are weighted for voting. A metric called HOBBit is used as the distance metric, and a data structure, the P-tree, is used for efficient implementation of the PINE algorithm on spatial data. Our experiments show that by using a Gaussian podium function, PINE outperforms the k-nearest neighbor (KNN) method in terms of classification accuracy for spatial data. In addition, in the PINE algorithm, all the instances are potential neighbors so that the value of k need not be pre-specified as in KNN methods. By assigning high weights to the nearest neighbors and low (even zero) weights to other neighbors, high classification accuracy can be achieved.
Exploring Machine Learning Techniques for Software Size Estimation
Authors: Evandro N. Regolin, Gustavo A. de Souza, Aurora R. T. Pozo, Silvia R. Vergilio
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

Prediction models are fundamental in the earlystages of the software development when many times,decisions must be taken without the required information.A typical information that is not available inthese stages is software size metrics, such as lines ofcode (LOC). Models for LOC estimation are obtainedfrom historical data and statistical regression methodsare usually applied. These characteristics make thisestimation problem especially interesting for the applicationof machine learning techniques. To explore thisfact, this work applies Genetic Programming and NeuralNetworks techniques for LOC estimation. Two differentdata sets were used to obtain two models usingrespectively the metrics function points and number ofcomponents. The models are analysed and the machinelearning techniques are compared.
Wavelet-based signal modeling and processing algorithms with applications
Authors: Yi Wan
Venue:  (2003)

Good signal representation and the corresponding signal processing algorithms lie at the heart of the signal processing research effort. Since the 1980's wavelet analysis has become more and more a mature tool in many applications such as image compression due to some key advantages over the traditional Fourier analysis. In this thesis we first develop a wavelet-based statistical framework and an efficient algorithm for solving the linear inverse problems with application to image restoration. The result is an efficient method that produces state-of-the-art results for such problems and has potential further applications in other areas. To overcome the issues such as the blocking artifacts in using orthogonal wavelets, we next investigate the design issue of more flexible basis representations based on frames. In particular, we develop a quasi image rotation method that is based on pixel reassignment and hence retains the original image statistics. When combined with translation operators, this method provides very efficient and desirable frames for image processing. Given a frame, due to the large number of redundant basis functions in it, how to efficiently implement a frame-based algorithm is the key issue. We show this through the example of optimal signal denoising in the presence of added zero-mean white noise. We show that the optimal solution exists yet the computation toward the solution is very heavy. We develop a framework that allows for fast approximations to the optimal solution and has clear physical interpretation. This method is in essence different from the other various approximate approaches such the basis pursuit and has applications in other areas such as image segmentation. We also develop a complexity regularized iterative algorithm for getting sparse solutions to the frame-based signal denoising problem.
Easy Quantification of Improved Spare Parts Inventory Policies
Authors: Ulrich W. Thonemann, Alex O. Brown, Warren H. Hausman
Venue: Management Science (2002)

This paper presents approximate analytical models to quantify the expected improvement in inventory investment when using a system approach to control inventory as opposed to a simpler item approach. A system approach ensures that a demand-weighted average fill rate is achieved at low inventory investment by assigning low fill rates to parts with high costs and high fill rates to parts with low costs. An item approach does not vary fill rates by parts but assigns identical fill rates to all parts. Using single-parameter functional representations of the skewness of unit costs and average demand across all parts in the system, simple approximate analytical expressions for the required inventory investment are derived for both approaches. The accuracy of the approximations is validated using data from a distribution center for computer spare parts. For these data, the solutions obtained by the approximations are very close to the exact values. The results show that inventory investments can be well approximated as a function of only a few cost and demand parameters. These expressions can be used to determine the percentage reduction in inventory investment for a particular target demand-weighted average fill rate when the superior system approach is used instead of the item approach. For increased ease of use, the percentage reduction in inventory when using a system as opposed to an item approach is computed over a range of realistic values for the key parameters of the model and a quadratic expression is fitted to the data. This fitted expression provides rough guidelines for the anticipated improvement with very limited data needed, prior to detailed modeling or implementation.
NETKIT: a software component-based approach to programmable networking
Authors: Geoff Coulson, Gordon Blair, David Hutchison, Ackbar Joolia, Kevin Lee, Jo Ueyama, Antonio Gomes, Yimin Ye
Venue: ACM SIGCOMM Computer Communication Review (2003)

While there has already been significant research in support of openness and programmability in networks, this paper argues that there remains a need for generic support for the integrated development, deployment and management of programmable networking software. We further argue that this support should explicitly address the management of run-time reconfiguration of systems, and should be independent of any particular programming paradigm (e.g. active networking or open signaling), programming language, or hardware/ operating system platform. In line with these aims, we outline an approach to the structuring of programmable networking software in terms of a ubiquitously applied software component model that can accommodate all levels of a programmable networking system from low-level system support, to in-band packet handling, to active networking execution environments to signaling and coordination.
New amicable four-cycles
Authors: Karsten Blankenagel, Walter Borho, Axel vom Stein
Venue: Mathematics of Computation (2003)

Fifty new amicable four-cycles are discovered by the constructive method invented in 1969 by the second author.
Interaction space theory: a framework for tool development
Authors: Duska Rosenberg, Simon Foley, Stavros Kammas, Mirja Lievonen
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper draws upon EU-funded research conducted by the authors as part of the Sustainable Accommodation in the New Economy Project (SANE IST 2000-25257). It describes the development in that project of the Interaction Space Theory that underpins the Model of Mediated Communication for Nomadic Knowledge Workers and its relation to extended theoretical explorations of the Common Ground Approach. Our contribution to the workshop will be to outline the theoretical and methodological underpinnings for the development of collaborative tools, adaptive and responsive to the requirements of their 'nomadic' users. We will also consider new concepts, developed in order to extend the Common Ground approach for the study of language use, so that it may account for communication in computer-mediated environments.
Distributed Telerobotics System Based on Common Object Request Broker Architecture
Authors: Songmin Jia, Yoshiro Hada, Kunikatsu Takase
Venue: Journal of Intelligent and Robotic Systems (2004)

This paper proposes using CORBA as communication architecture to integrate network-distributed software and robotic systems in support systems for the aged or disabled. The proposed method keeps system costs low and expands availability. Its high scaling and inter-operating ability allows clients and server objects that are written in different languages, run in different operating systems, and connected to different networks to inter-operate. It also enables the system to be extended and integrated with other technologies and applications distributed over the Internet. Based on CORBA, we developed hardware base including a robot arm and an omnidirectional mobile robot and application servers including a task-level robot arm control server, live feedback image server, mobile robot control server and iGPS server. By remotely controlling mobile robot to cooperate with the robot arm, the caregivers or family member can use the developed system for some basic services to the aged or disabled.
How people use softcopy documentation: a case study
Authors: Dave Hendry, Blair Nonnecke, Tom Carcy, John Mitterer, Rick Sobicsiak, Dov Lungu
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

How do people find the information they need in softcopy documentation? In an attempt to answer this question, two usability assessments were conducted in which participants solved tasks using softcopy manuals presented on a version of BookiManager* READ/DOS program. The assessments revealed broad individual differences; however, the following generalizations could be drawn: 1) The Search function is often effective, but it is not sufficient by itself; 2) the table of contents is very important; 3) the index is rarely used, possibly because it is not easily accessible; and 4) paging is done frequently. The knowledge gained from these assessments translates into the following practical advice for writers: 1) Write modular information; 2) ensure that the table of contents is well organized and descriptive; 3) improve the index; and 4) provide the user with information on the strategic use of the program used to present documentation.
The system design cycle
Authors: George H. Mealy
Venue: Proceedings of the second symposium on Operating systems principles (1969)

Technical competence in system design encompasses at least an appreciation of a number of issues that are often dismissed as being merely managerial in nature, since most system programmers seek a purely technical definition of what constitutes a system design, if they think about the problem at all. This paper reviews the area between the purely technical and the purely managerial as it pertains to the design portion of the system development cycle and finds this area non-empty. "System", in the author's lexicon, is an antonym of "chaos"; the two main sections of the paper discuss the components of the design activity and byways which lead to chaotic systems.
On remote procedure call
Authors: Patrícia Gomes Soares
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

The Remote Procedure Call (RPC) paradigm is reviewed. The concept is described, along with the backbone structure of the mechanisms that support it. An overview of works in supporting these mechanisms is discussed. Extensions to the paradigm that have been proposed to enlarge its suitability, are studied. The main contributions of this paper are a standard view and classification of RPC mechanisms according to different perspectives, and a snapshot of the paradigm in use today and of goals for the future of RPC.
Patterns of cooperative interaction: Linking ethnomethodology and design
Authors: David Martin, Ian Sommerville
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

Patterns of Cooperative Interaction are regularities in the organisation of work, activity, and interaction among participants, and with, through, and around artifacts. These patterns are organised around a framework and are inspired by how such regularities are highlighted in ethnomethodologically-informed ethnographic studies of work and technology. They comprise a high level description and two or more comparable examples drawn from specific studies. Our contention is that these patterns form a useful resource for reusing findings from previous field studies, for enabling analysis and considering design in new settings. Previous work on the relationship between ethnomethodology and design has been concerned primarily in providing presentation frameworks and mechanisms, practical advice, schematisations of the ethnomethodologist's role, different possibilities of input at different stages in development, and various conceptualisations of the relationship between study and design. In contrast, this article seeks to first discuss the position of patterns relative to emergent major topics of interest of these studies. Subsequently it seeks to describe the case for the collection of patterns based on findings, their comparison across studies and their general implications for design problems, rather than the concerns of practical and methodological interest outlined in the other work. Special attention is paid to our evaluations and to how they inform how the patterns collection may be read, used and contributed to, as well as to reflections on the composition of the collection as it has emerged. The paper finishes, first, with a discussion of how our work relates to other work on patterns, before some closing comments are made on the role of our patterns and ethnomethodology in systems design.
Power series, power serious
Authors: M. Douglas McIlroy
Venue: Journal of Functional Programming (1999)

Power series and stream processing were made for each other. Stream algorithms for power series are short, sweet, and compositional. Their neatness shines through in Haskell, thanks to pattern-matching, lazy lists, and operator overloading. In a short compass one can build working code from ground zero (scalar operations) up to exact calculation of generating functions and solutions of differential equations.
Runge-Kutta bicharacteristic methods for first order partial functional differential equations
Authors: Z. Kamont, J. Newlin-Lukowicz
Venue: Neural, Parallel Scientific Computations (2003)

Classical solutions of first order partial differential functional systems with initial boundary conditions are approximated in the paper by solutions of a difference problem of the Runge-Kutta type. Sufficient conditions for the convergence of the method are given. The proofs of the stability of the difference problems are based on a comparison method. Nonlinear estimates of the Perron type for given fuctions are used. This new approach to a numerical solving of functional differential equations is based on a method of bicharacteristics for mixed problems. Numerical examples are given.Differential systems with deviated variables and differential integral systems may be derived from a general model by specializing given operators.
Sequence spaces of spline functions on subsets and l&#x221E;-spaces
Authors: Peter Wingren
Venue: Journal of Approximation Theory (2003)

Spaces of sequences of bounded linear splines defined on arbitrary subsets of R are studied, especially with respect to continuous extensions. An extension problem is solved by establishing a decomposition for the space of spline sequences with respect to the l∞-space on a corresponding subset of Z+ × Z. An application to Zygmund spaces on subsets is presented.