ppxscal/embedding_network huggingface dataset:
Efficient Parallel Algorithms for some Tree Layout Problems
Authors: J. Diaz, A. Gibbons, Grammati E. Pantziou, M. Serna, Paul G. Spirakis, J. Toran
Venue:  (1993)

The minimum cut and minimum length linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and in P for trees. We present here two algorithms in NC. The first solves the minimum length linear arrangement problem for unrooted trees in $O(\log^2 n)$ time and $O(n^2 3^{\log n})$ CREW PRAM processors. The second algorithm solves the minimum cut arrangement for unrooted trees of maximum degree $d$ in $O(d \log^2 n)$ time and $O(n^2 /\log n)$ CREW PRAM processors.
On domain models for system testing
Authors: A. von Mayrhauser, M. Shumway, P. Ocken, R. Mraz
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Domain models have long been used as basis for software development and reuse. We present a specialized, simplified domain model that has been used for system testing in industry and is the core part of a system testing approach we call 'application domain-based testing'. Sleuth, a test suite generation tool is based on this concept. The paper reports on the domain analysis, the domain model components, and industrial experience of reusing domain models and tests generated with Sleuth.
An operating system based on the concept of a supervisory computer
Authors: R. Stockton Gaines
Venue: ACM SIGOPS Operating Systems Review (1972)

An operating system which is organized as a small supervisor and a set of independent processes are described. The supervisor handles I/O with external devices - the file and directory system - schedules active processes and manages memory, handles errors, and provides a small set of primitive functions which it will execute for a process. A process is able to specify a request for a complicated action on the part of the supervisor (usually a wait on the occurrence of a compound event in the system) by combining these primitives into a "supervisory computer program." The part of the supervisor which executes these programs may be viewed as a software implemented "supervisory computer." The paper develops these concepts in detail, outlines the remainder of the supervisor, and discusses some of the advantages of this approach.
Formal Reasoning about Communication Systems II: Automated Fast-Track Reconfiguration
Authors: Christoph Kreitz
Venue:  (1998)

We present formal techniques for improving the performance of group communication systems built with the Ensemble toolkit. For common sequences of operations we identify a fast-track through a stack of communication protocols and reconfigure the system''s code accordingly. Our techniques are implemented as fully automated tactics of the NuPRL proof development system and are based on an embedding the implementation language of Ensemble into the logical language of NuPRL. Together with verification techniques to be developed in the near future they will lead to a logical programming environment for the construction of reliable and efficient group communication systems.
Product families and process families
Authors: S. M. Sutton, L. J. Osterweil
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Product lines or families represent an important way of organizing software products. Product families might include, for example, successive revisions of a single application, versions of an application for different host platforms, or versions with varying features, e.g., different levels of security. A software product family can thus be viewed as a collection of products that are similar in some important respects yet systematically different in others. The family viewpoint emphasizes both the commonality among family members and the differences between them, and it draws attention to their interrelationships. Our work in software processes has lead us to conclude that software processes also can be usefully viewed in terms of families. As software process engineers, we also naturally view products in terms of the processes that create them and, conversely, we view processes in terms of the products they create. This suggests that product families and process families should be closely interrelated. Consequently, both products and processes may benefit from analysis in terms of families and family relationships. We begin to sketch out such an analysis and some of the issues that it raises.
Wearable Computers for Three Dimensional CSCW
Authors: Mark Billinghurst, Suzane Weghorst, Tom Furness Iii
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Using established principles from the field of Computer Supported Collaborative Work (CSCW), we describe how wearable computers are ideal platforms for three dimensional CSCW. To illustrate this we present two pilot studies which imply that wearables may be able to support three dimensional collaboration and that users will perform better with these interfaces than immersive collaborative environments.
A Quality Methodology Based on Statistical Analysis of Software Structure
Authors: Maurizio Pighin
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

The purpose of this paper is to present a methodology based structural parameters of software and to validate it by factorial and regression analysis. This methodology is able to predict every file risk level, or in other words how prone it is to containing faults. The influence of structural parameters on the conditions which characterize a system can vary enormously. Once the environment has been identified and a reasonable amount of data accumulated, it is then possible to construct a model which identifies potentially dangerous programs; moreover, this model is dynamic and can be continually recalibrated to suit the environment in question. The conclusions we have reached through the factorial and regression analysis of experimental data allow us to assert that the results obtained by the proposed methodology and the basic assumption upon which the theoretical framework depends, are substantially proven.
An Implementation of External-Memory Depth-First Search
Authors: Christopher S. Leon
Venue:  (1998)

In many different areas of computing, problems can arise which are too large to fit in main memory. For these problems, the I/O cost of moving data between main memory and secondary storage (for example, disks) becomes a significant bottleneck affecting the performance of the program. Since most algorithms do not take into account the size of main memory, new algorithms have been developed to optimize the number of I/O''s performed. This paper details the implementation of one such algorithm, for external-memory depth-first search. Depth-first search is a basic tool for solving many problems in graph theory, and since graph theory is applicable for many large computational problems, it is important to make sure that such a basic tool is designed to avoid the bottleneck of main memory to secondary storage I/O''s. The algorithm whose implementation is described in this paper is sketched out in an extended abstract by Chiang et al. We attempt to improve the given algorithm by minimizing I/O''s performed, and to extend the algorithm by finding disjoint trees, and by classifying all the edges in the problem. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Energy Allocation Strategies for Turbo Codes with Short Frames
Authors: M. M. Salah, R. A. Raines, M. A. Temple, T. G. Bailey
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Turbo codes have been shown to approach the Shannon limit for error correcting capability at low signal-to-noise ratios given large sized frames. Extensive research efforts have been examining ways to enhance the performance of turbo codes for short frames (e.g., voice transmission). One way of enhancing the performance is to optimize the energy allocated to each bit stream to achieve the best performance possible. In standard turbo codes, all bits are transmitted with equal energy. Changing the energy allocation strategy can enhance the performance of turbo codes with short frame lengths. Using computer simulation and analytic bounds, different strategies are discussed and applicability to short frame applications investigated.
NP-Completeness of the Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithm
Authors: N. Fujimoto, K. Hagihara
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

The bulk synchronous task scheduling problem (BSSP)is known as an effective task scheduling problem fordistributed-memory machines, but the time complexity ofBSSP is unknown. This paper presents a proof of NP-completeness of BSSP even in the case of unit time tasksand positive integer constant communication delays. Thispaper also gives an approximation algorithm for BSSP inseveral restricted cases.
ADOPT: Efficient Hardware Address Generation in Distributed Memory Architectures
Authors: Miguel Miranda, Francky Catthoor, Martin Janssen, Hugo de Man
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

An address generation and optimization environment (ADOPT) for distributed memory architectures, is presented. ADOPT is oriented to minimize the area overhead introduced by the use of large numbers of customized address calculation units, needed to cope with the increasing bandwidth requirements of memory intensive real-time signal processing applications. Different high-level optimizing architectural alternatives are explored, such as algebraic optimizations and efficient data-path clustering and assignment, to minimize the space/time-multiplexed address unit cost. Furthermore, in order to significantly reduced the routing complexity, typically present in partitioned architectures, a methodology for the synthesis of a distributed architecture for hierarchical local controllers for address generation, is also proposed. The techniques presented are demonstrated on a realistic test-vehicle, showing significant savings on the overall addressing cost.
Feedback Control of the Software Test Process Through Measurements of Software Reliability
Authors: Joao W. Cangussu, Aditya P. Mathur, Raymond A. DeCarlo
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

A closed-loop feedbacb control model of the Software Test Process (STP) is described.The model is grounded in the well established theory of Automatic Control.It offers a formal and novel procedure for using product reliability or failure intensity as a basis for closed loop control of the STP.The reliability or the failure intensity of the product is compared against the desired reliability at each checkpoint and the difference fed back to a controller.The controller uses this difference to compute changes necessary in the process parameters to meet the reliability or failure intensity objective at the terminal checkpoint (the deadline).The STP continues beyond a check point with a revised set of parameters.This procedure is repeated at each check point until the termination of the STP.The procedure accountsfor the possibility of changes, during testing, in reliability or failure intensity objective, the check points, and the parameters that characterize the STP. The effectiveness of this procedure was studied using commercial data available in the public domain and also from the data generated through simulation.In all cases the use of feedbac control producesadequate results allowing the achievement of the objectives.
Sensing the state of voice sources to improve multiplexer performance
Authors: S. Sibal, K. Parthasarathy, K. S. Vastola
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The control of source-coded traffic at a multiplexer has been a topic of extensive research. Traditional approaches typically use feedback information on the buffer level in designing the control policy. While important, buffer levels capture only part of the information about the overall system state. By setting up this problem as a Markov decision process, the authors show that using information on the state (activity) of the sources, in addition to the buffer level, can result in significant improvements over traditional approaches. They demonstrate this for a multiplexer fed by /spl mu/-law encoded voice sources. Some of the scenarios studied exhibit a reduction in distortion exceeding 35%. In general, the improvement is heavily dependent on the correlation statistics of the sources. Emulations validate the analysis. The form and characteristics of the optimal control policies are also discussed.
Exact Location Identification in a Mobile Computing Network
Authors: Koushik Sinha, Nabanita Das
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In a mobile communication environment, whenever there is a call request, the network must know where the intended recipient of the call is currently located. This gives rise to the problem of location management. Different location management schemes for mobile networks have been proposed so far. However, whatever be the scheme, it can only identify a location area comprised of a number of cells, or at best a single cell, which may extend over an area of a few square kilometers. However, in case of some emergency needs of a mobile user, e.g., in case of fire, medical assistance, accident etc., it is essential to know the exact location of it, to provide immediate services. In such circumstances, it is a prerequisite to identify the exact location of the particular mobile user, within a radius of a few meters or so. So far, there is no such location management scheme that is capable of finding the exact location of any user with such accuracy. In this paper, we propose a simple scheme for determining the exact location of a mobile terminal. By our technique, in case of some emergency, the mobile user transmits a special distress signal. In response to that, the base station B0 of the cell (in which the mobile user currently is), along with two other adjacent base stations exchange a few messages among themselves and the mobile, and hence it finally computes the exact coordinates of the mobile user. Next, with the assistance of detailed road map, the base station B0 can identify the exact location. It has been shown that the technique enables us to determine the exact location with an accuracy of a few meters only. Moreover, the overhead in terms of extra hardware, the number of messages and the message complexity, as well as the time delay involved in the identification process is negligibly small.
An Interface Method for Semiconductor Process Simulation
Authors: J M Johnson, L C Gardner
Venue:  (1991)

\indent The diffusion of dopants in silicon at high temperatures is modeled by a nonlinear parabolic system of partial differential equations on a two-dimensional region with a moving boundary. A numerical solution using the L-stable TRBDF2 time integration method and a ``box method'''' spatial discretization is described. Details are given of the methods used to specify and manipulate curves, and to define arbitrary simply connected regions by their boundary curves. Numerical experiments are presented comparing the divided difference and TR/TR methods for dynamically adjusting the timestep, and comparing Newton and Newton-Richardson iteration.
Considerations for an organizational memory in software development
Authors: E. Ellmer, D. Merkl
Venue: Proceedings of the 10th International Software Process Workshop (1996)

We believe that the efficiency and productivity of software development processes can be dramatically increased by making the knowledge gained during past projects persistent and thus reusable for future projects. We plead for the establishment of a computer supported organizational memory for software development organizations. Furthermore, we feel that the accelerated growth of software process modeling techniques provides a convenient equipment for the realization of what we propose. A process model is an explicit representation of process knowledge and may thus serve as a means for storing and retrieving organizational knowledge about software process execution. Thus, we argue for reusing software process models. An organizational memory for software development organizations may be implemented by populating and structuring a process model library and providing mechanisms for retrieving and tailoring process models in order to apply them during the execution (management) of projects.
First-Order System Least-Squares for Second-Order Partial Differential Equations: Part I
Authors: Z. Cai, R. Lazarov, T. A. Manteuffel, S. F. McCormick
Venue:  (1994)

This paper develops ellipticity estimates and discretization error bounds for elliptic equations (with lower order terms) that are reformulated as a lest-squares problem for an equivalent first-order system. The main result is the proof of ellipticity, which is used in a companion paper to establish optimal convergence of multiplicative and additive solvers of the discrete systems.
ASP.NET Website Programming: Problem - Design - Solution VB.NET Edition, 1 edition
Authors: Marco Bellinaso, Kevin Hoffman
Venue:  (2003)

:ASP.NET Website Programming shows you how to build an interactive website from design to deployment.Packed with solutions to website programming problems, this book will have you building well-engineered, extendable ASP.NET websites quickly and easily.What you need to knowThis book is for developers who: Use ASP.NET and Visual Basic .NETUse Visual Studio&reg; .NET Professional or above, or Visual Basic&reg; .NET StandardWhat you will learn from this bookWith ASP.NET Website Programming you will learn to:Establish a solid, scalable website foundationProvide flexible user accounts by integrating with ASP.NET's built-in securityCreate fully featured discussion forums Generate revenue from advertisingBuild a web interface for managing the files on your siteAdd opinion polls, e-mail newsletters, and news managementDeploy the finished site on a live serverBuild websites using good, n-tier coding techniques
An Analytical Model for Delay and Crosstalk Estimation with Application to Decoupling
Authors: Murat R. Becer, Ibrahim N. Hajj
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The impact of interconnect coupling, in the form of delay and crosstalk, in deep submicron integrated circuit design is increasing. In many cases, especially in routing, the coupling capacitance, Cc, between adjacent lines is decoupled and replaced by 2Cc connected to ground for fast worst-case delay estimation. This is based on the assumption that worst-case delay occurs when two adjacent lines switch simultaneously in opposite directions so that the voltage change across the coupling capacitance is twice that when only one line is switching. Similarly, when two adjacent lines switch simultaneously in the same direction, the coupling capacitance is put to zero based on the fact that the voltage difference across it is zero. However, we show that by replacing the coupling capacitance Cc with a grounded capacitance of 2Cc (or by zero) when signals switch simultaneously in opposite (or same) directions may overestimate or even underestimate the actual delay. The variable strengths of the drivers driving the coupled lines bring in an additional level of complexity to the delay estimation when coupling exists. In this paper, we derive a simple analytical model that takes the effect of different driver strengths into account, to accurately estimate the delay and crosstalk of two coupled interconnect lines switching simultaneously. This approach also gives the exact values of the multiplicants that Cc should be multiplied with, if the lines are to be decoupled, for both worst-case and best-case delay computation; that is when the signals switch in opposite direction and when they switch in the same direction.
Case-Based Classification Using Similarity-Based Retrieval
Authors: Igor Jurisica, Janice Glasgow
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Classification involves associating instances with particular classes by maximizing intra-class similarities and minimizing inter-class similarities. The paper presents a novel approach to case-based classification. The algorithm is based on a notion of similarity assessment and was developed for supporting flexible retrieval of relevant information. Validity of the proposed approach is tested on real world domains, and the system's performance is compared to that of other machine learning algorithms.
On the Complexity of Generation in Ternary Hamming Spaces
Authors: Endre Boros, Peter L. Hammer, Frederica Ricca, Bruno Simeone
Venue:  (1998)

In this paper, a follow-up of DIMACS Report 98-01, we continue to study ternary Hamming spaces $\TT^n$, where $\TT=\{0,1,2\}$, and their generators. In particular, we are interested in the computational complexity of the generation of all vectors with respect to a specific generator $G\subseteq \TT^n$. We consider several parameters, i.e., depth and load, which provide alternative ways to measure the computational effort required in order to generate all points of $\TT^n$ starting from those of $G$. We establish lower and upper bounds on the minimum depth and the minimum load for a generator in, and prove that some of them are sharp.
A note on Schrijver's submodular function minimization algorithm
Authors: Jens Vygen
Venue: Journal of Combinatorial Theory Series B (2003)

We prove that Schrijver's submodular function minimization algorithm is faster by a factor of n than was proved by Schrijver in his paper.
Estimation of the shape parameter k of the negative binomial distribution
Authors: Mohammad F. Al-Saleh, Fatima K. Al-Batainah
Venue: Applied Mathematics and Computation (2003)

Using approximate Bayesian methods, an estimator of the shape parameter of the negative binomial distribution is introduced. Most of the available estimators of this parameter, such as the method of moment and the maximum likelihood estimators (MME and MLE), give inadmissible values when the mean of the observed sample is larger than its variance. In this case, the MME gives values while the MLE is infinite. Such observed sample in not unlikely when the mean of the population is close to its variance. The suggested estimator always has valid values, and turned out to be more efficient for most values of the parameter space. Family size data is used for illustration of the procedure.
Building Adaptive Systems Using Ensemble
Authors: Robbert van Renesse, Ken Birman, Mark Hayden, Alexey Vaysburd, David Karr
Venue:  (1997)

Trends in networking and distributed computing are creating a new generation of applications that must adapt as the environment within which they execute changes. Examples of adaptations include switching protocols to overcome a security exposure or failure mode seen only in certain setting, changing data rates to accommodate a slow link, or adapting the behavior of a high level application to match the set of participants using the application. We describe the Ensemble system, a tool for building adaptive distributed programs.