ppxscal/embedding_network huggingface dataset:
On determining the fair bandwidth share for ABR connections in ATM networks
Authors: Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal, Bobby Vandalore
Venue: Journal of High Speed Networks (2002)

In a multi-service network such as ATM, adaptive data services (such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources the fair and efficient rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In this paper, we propose a new method for determining the "effective" number of active connections, and the fair bandwidth share for each connection. We prove the efficiency and fairness of the proposed method analytically, and use several simulations to illustrate its fairness dynamics and transient response properties.
Initial reactions in Ti-Si(Mo) bilayers
Authors: R. Cocchi, G. Ottaviani, T. Marangon, G. Mastracchio, S. Alberici, G. Queirolo
Venue: Microelectronic Engineering (2002)

In situ resistance measurements were used to investigate the initial reactions between a titanium film and a molybdenum-doped silicon film. MeV4He+ Rutherford spectrometry and X-ray diffraction were also used. An X-ray amorphous layer having the composition TiSix, with x< 2, is first formed. At 500°C TiSi2 grows which could be C-40, and above 550°C C-54 is formed. The activation energy of the first intermixing process is 3.1±0.1 eV, similar to 2.8±0.1 eV which was obtained in samples without molybdenum.
Activating Networks: A Progress Report
Authors: Jonathan M. Smith, Kenneth L. Calvert, Sandra L. Murphy, Hilarie K. Orman, Larry L. Peterson
Venue: Computer (1999)

Active networks--networks you can add programs to or customize to particular applications--are probably most familiar as Web proxy caches and firewalls. In their more sophisticated form, however, they have become customized infrastructures that let designers program control planes--the control software and network hardware used to manipulate the transport system's behavior. Programming mechanisms such as open signaling are becoming more widespread, for example. But research in active networks has taken a step beyond even these sophisticated infrastructures. Working systems now let designers modify packet-switching infrastructures on the fly using either a switch-like model, which mixes active packets with other packets, or in a capsule model, which regards all packets as programs. In surveying working systems and experimental results, the authors have found that first-generation systems have opted to use modern programming language technologies such as Caml and Java to provide usability and safety, and cryptographic techniques to provide security. The systems differ in the degree of flexibility and performance they offer. Many differences stem from the use of a particular security model.
Standards-Software Reliability Handbook: Achieving Reliable Software
Authors: D. M. Siefert, G. E. Stark
Venue: Computer (1992)

The results to date of a three-year research effort on software reliability engineering sponsored by the American Institute of Astronautics and Aeronautics (AIAA) are discussed. After a standard for recommended practice for software reliability estimation was approved by the AIAA, a blue-ribbon panel of industry experts was convened to consider the future of reliable software and software technology in space systems. The panel's work towards a software reliability engineering database and research in software reliability tools and software reliability models are discussed. The software reliability recommended practice, its intended audience, and its users are reviewed.
Computational Complexity of Compaction to Reflexive Cycles
Authors: Narayan Vikas
Venue: SIAM Journal on Computing (2003)

In this paper, we solve a widely publicized open problem posed by Peter Winkler in 1988. The problem is to decide whether or not it is possible to partition the vertices of a graph into four distinct nonempty sets A, B, C, and D, such that there is no edge between the sets A and C, and between the sets B and D, and that there is at least one edge between any other pair of distinct sets. Winkler asked whether this problem is NP-complete. We show in this paper that it is NP-complete. We study the problem as the compaction problem for a reflexive 4-cycle. We also show in this paper that the compaction problem for a reflexive k-cycle is NP-complete for all $k \geq 4$.
Jottings from the business intelligence jungle
Authors: David Selby
Venue: Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications (2002)

This paper examines some of the big hitting issues in the business intelligence world and shows how APL remains a key component in the resolution of these issues. It also suggests areas where APL could fill new voids that require flexible development environments. Like in the film 'Tron', where APL played a quiet but key role, in business intelligence you can see it still plays a quiet but key role.
Metrics for applying GOF design patterns in refactoring processes
Authors: Taichi Muraki, Motoshi Saeki
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

This paper presents a kind of software design measures that help us to determine the application of Gang-Of-Four design patterns to refactoring processes. Refactoring using design patterns is one of the promising approaches to improve the designs during development activities, and a crucial issue is to identify when, where and which patterns could be applied. We analyzed several actual object-oriented designs of low quality needed to be refactored and focus on the characteristics of conditional statements of methods and inheritance structures, which seemed to cause the low quality. We provide 20 measures to objectively detect these characteristics in object-oriented designs. These measures express the complexity of branching execution in conditional statements and the strength of the dependency among the sub classes in the inheritance trees. Designers can be guided to recognize when, where and which design patterns should be used, in order to refactor their designs of low quality, by calculating these measures. We apply our approach to the low-quality design of the drawing editor that was produced by a novice designer and assess the effectiveness of our measures.
Planning for remote users
Authors: Frances Bardello Craig
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Technical and economic problems in accessing remote computers have virtually been eliminated. It is now feasible and economical, for a user to access remote computers through private or public data communications networks. From 1966 through the present, administrative issues in the sharing of computing resources among higher education and research institutions have been the topic of conferences, publications and experimentation. EDUCOM, the inter-university consortium of colleges, universities and research institutions, sponsors much of this activity regarding the sharing of computing resources. In 1974 EDUCOM established the Planning Council to more actively experiment with network issues. On July 1, 1979 the Planning Council's experiment in a national educational network, EDUNET, became an operational reality. EDUNET is supported by regular and sustaining membership fees. Carnegie-Mellon University has opted to become a supplier of computing services to the EDUNET network. This paper describes the issues considered in planning to service remote users. The paper uses Carnegie-Mellon as an example of a host site on EDUNET. Administrators in charge of user services organizations and/or computation centers who plan to sell their computing resources to a remote market will find this paper contains a useful checklist of items for consideration. 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
A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap
Authors: S. Prakash, Yann Hang Lee, T. Johnson
Venue: IEEE Transactions on Computers (1994)

Nonblocking algorithms for concurrent objects guarantee that an object is always accessible, in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes. A number of algorithms have been proposed for shared FIFO queues, but nonblocking implementations are few and either limit the concurrency or provide inefficient solutions. The authors present a simple and efficient nonblocking shared FIFO queue algorithm with O(n) system latency, no additional memory requirements, and enqueuing and dequeuing times independent of the size of the queue. They use the compare & swap operation as the basic synchronization primitive. They model their algorithm analytically and with a simulation, and compare its performance with that of a blocking FIFO queue. They find that the nonblocking queue has better performance if processors are occasionally slow, but worse performance if some processors are always slower than others.
Supercomputing: The View from Japan
Authors: David K. Kahaner
Venue: IEEE Micro (1993)

Japan's Ministry of International Trade and Industry's (MITI's) Superspeed project, which investigated high-speed devices and computer architecture, algorithms, and languages for parallel computing, is reviewed. The supercomputing industries in Japan and the United States are compared. The architecture and performance of current supercomputers and the current states of supercomputer technology and supercomputer software are discussed.
Uniform Parity Group Distribution in Disk Arrays with Multiple Failures
Authors: S. W. Ng, R. L. Mattson
Venue: IEEE Transactions on Computers (1994)

Several new disk arrays have recently been proposed in which the parity groupings are uniformly distributed throughout the array so that the extra workload created by a disk failure can be evenly shared by all the surviving disks, resulting in the best possible degraded mode performance. Many arrays now also put in multiple spare disks so that expensive service calls can be deferred. Furthermore, in a new sparing scheme called distributed sparing, the spare spaces are actually distributed throughout the array. This means after a rebuild the new array will be logically different from the original array. The authors present an algorithm for constructing and maintaining arrays with distributed sparing so that repeated uniform parity group distribution is achieved with each successive failure.
Software Risk Management: Principles and Practices
Authors: Barry W. Boehm
Venue: IEEE Software (1991)

The emerging discipline of software risk management is described. It is defined as an attempt to formalize the risk-oriented correlates of success into a readily applicable set of principles and practices. Its objectives are to identify, address, and eliminate risk items before they become either threats to successful software operation or major sources of software rework. The basic concepts are set forth, and the major steps and techniques involved in software risk management are explained. Suggestions for implementing risk management are provided.
Developing Groupware for Requirements Negotiation: Lessons Learned
Authors: Barry Boehm, Paul Grünbacher, Robert O. Briggs
Venue: IEEE Software (2001)

The authors discuss the series of groupware implementations they developed for the WinWin requirements negotiation approach. The WinWin approach involves having a system's success-critical stakeholders participate in a negotiation process so that they can converge on a mutually satisfactory set of requirements. In particular, the authors review the lessons they learned while developing their WinWin system.
Design of FIR Bilevel Laplacian-of-Gaussian filter
Authors: Soo-Chang Pei, Ji-Hwei Horng
Venue: Signal Processing (2002)

The Laplacian-of-Gaussian (LOG) filter is an optimal edge detector, but it is computationally inefficient. In this paper, we propose the bilevel Laplacian-of-Gaussian (BLoG) filter to approximate the LoG filter. This approximation is formulated as an optimization problem and solved by the gradient descent algorithm. Only two multiplications per pixel are required in convolving with the BLoG filter. The computation is fast and it produces satisfactory results. The applications of ID BLoG filter to corner detection and 2D BLoG filter to edge detection are also presented.
Continued Fractions and 2D Hurwitz Polynomials
Authors: Jiří Gregor
Venue: Multidimensional Systems and Signal Processing (2002)

A test based on continued fraction expansion for polynomials with complex coefficients decides whether the polynomial has all its roots in the left half-plane. The test presented here is more effective compared to tests evaluating determinants and allows for generalization to polynomials in two variables. The main result is a new test for polynomials in two variables and new algorithms testing necessary conditions of stability for these polynomials. The results can be used in many further areas of research and can also be further generalized. They also show the strength of the continued fraction techniques and the role of positive functions in many areas of system theory. The algorithms described as procedures in MATHEMATICA&copy; language and examples are also included.
Shape from Focus
Authors: S. K. Nayar, Y. Nakagawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

The shape from focus method presented here uses different focus levels to obtain a sequence of object images. The sum-modified-Laplacian (SML) operator is developed to provide local measures of the quality of image focus. The operator is applied to the image sequence to determine a set of focus measures at each image point. A depth estimation algorithm interpolates a small number of focus measure values to obtain accurate depth estimates. A fully automated shape from focus system has been implemented using an optical microscope and tested on a variety of industrial samples. Experimental results are presented that demonstrate the accuracy and robustness of the proposed method. These results suggest shape from focus to be an effective approach for a variety of challenging visual inspection tasks.
Feature-Preserving Clustering of 2-D Data for Two-Class Problems Using Analytical Formulas: An Automatic and Fast Approach
Authors: J. C. Lin, W. H. Tsai
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We propose a new method to perform two-class clustering of 2-D data in a quick and automatic way by preserving certain features of the input data. The method is analytical, deterministic, unsupervised, automatic, and noniterative. The computation time is of order n if the data size is n, and hence much faster than any other method which requires the computation of an n-by-n dissimilarity matrix. Furthermore, the proposed method does not have the trouble of guessing initial values. This new approach is thus more suitable for fast automatic hierarchical clustering or any other fields requiring fast automatic two-class clustering of 2-D data. The method can be extended to cluster data in higher dimensional space. A 3-D example is included.
Towards a theory of cache-efficient algorithms
Authors: Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
Venue: Journal of the ACM (JACM) (2002)

We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameters. Our cache model, an extension of Aggarwal and Vitter's I/O model, enables us to establish useful relationships between the cache complexity and the I/O complexity of computations. As a corollary, we obtain cache-efficient algorithms in the single-level cache model for fundamental problems like sorting, FFT, and an important subclass of permutations. We also analyze the average-case cache behavior of mergesort, show that ignoring associativity concerns could lead to inferior performance, and present supporting experimental evidence.We further extend our model to multiple levels of cache with limited associativity and present optimal algorithms for matrix transpose and sorting. Our techniques may be used for systematic exploitation of the memory hierarchy starting from the algorithm design stage, and for dealing with the hitherto unresolved problem of limited associativity.
On Matrix-Geometric Solution of Nested QBD Chains
Authors: Sung Ho Choi, Bara Kim, Khosrow Sohraby, Bong Dae Choi
Venue: Queueing Systems: Theory and Applications (2003)

In this paper, a generalization of the level dependent Quasi-Birth-and-Death (QBD) chains is presented. We analyze nested level dependent QBD chains and provide the complete characterization of their fundamental matrices in terms of minimal non-negative solutions of a number of matrix quadratic equations. Our results provide mixed matrix-geometric solution for the stationary distribution of nested QBD chains. Applications in overload control in communication networks are also discussed.
Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set
Authors: D. -I. Lin, Z. M. Kedem
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Discovering frequent itemsets is a key problem in important data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. Typical algorithms for solving this problem operate in a bottom-up, breadth-first search direction. The computation starts from frequent 1-itemsets (the minimum length frequent itemsets) and continues until all maximal (length) frequent itemsets are found. During the execution, every frequent itemset is explicitly considered. Such algorithms perform well when all maximal frequent itemsets are short. However, performance drastically deteriorates when some of the maximal frequent itemsets are long. We present a new algorithm which combines both the bottom-up and the top-down searches. The primary search direction is still bottom-up, but a restricted search is also conducted in the top-down direction. This search is used only for maintaining and updating a new data structure, the maximum frequent candidate set. It is used to prune early candidates that would be normally encountered in the bottom-up search. A very important characteristic of the algorithm is that it does not require explicit examination of every frequent itemset. Therefore, the algorithm performs well even when some maximal frequent itemsets are long. As its output, the algorithm produces the maximum frequent set, i.e., the set containing all maximal frequent itemsets, thus specifying immediately all frequent itemsets. We evaluate the performance of the algorithm using well-known synthetic benchmark databases, real-life census, and stock market databases. The improvement in performance can be up to several orders of magnitude, compared to the best previous algorithms.
Evolving RPC for active storage
Authors: Muthian Sivathanu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: ACM SIGPLAN Notices (2002)

We introduce Scriptable RPC (SRPC), an RPC-based framework that enables distributed system services to take advantage of active components. Technology trends point to a world where each component in a system (whether disk, network interface, or memory) has substantial computational capabilities; however, traditional methods of building distributed services are not designed to take advantage of these new architectures, mandating wholesale change of the software base to exploit more powerful hardware. In contrast, SRPC provides a direct and simple migration path for traditional services into the active environment.We demonstrate the power and flexibility of the SRPC framework through a series of case studies, with a focus on active storage servers. Specifically, we find three advantages to our approach. First, SRPC improves the performance of distributed file servers, reducing latency by combining the execution of operations at the file server. Second, SRPC enables the ready addition of new functionality; for example, more powerful cache consistency models can be realized on top of a server that exports a simple NFS-like interface. Third, SRPC simplifies the construction of distributed services; operations that are difficult to coordinate across client and server can now be co-executed at the server, thus avoiding costly agreement and crash-recovery protocols.
Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation
Authors: A. K. Das, P. P. Chaudhuri
Venue: IEEE Transactions on Computers (1993)

A novel scheme for utilizing the regular structure of three neighborhood additive cellular automata (CAs) for pseudoexhaustive test pattern generation is introduced. The vector space generated by a CA can be decomposed into several cyclic subspaces. A cycle corresponding to an m-dimensional cyclic subspace has been shown to pseudoexhaustively test an n-input circuit (n
AMS: A Declarative Formalism for Hierarchical Representation of Procedural Knowledge
Authors: J. Li, J. S. K. Ang, X. Tong, M. Tueni
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

This paper presents a domain-independent formalism, called Activity Manager System (AMS), for the explicit, hierarchical representation of procedural knowledge. The formalism is able to: (1) describe procedures at a reasonable level of complexity and completeness; (2) generate dynamically procedures at different levels of abstraction; (3) organize knowledge hierarchies by means of abstract entities; and (4) allow knowledge reusability at different levels of abstraction. AMS uses the notions of activity, activity network, state, and memory organization packet for activities (MOPA) to represent abstractions, and it allows the user to model an application in a hierarchical manner. The advantages and limitations of AMS are also discussed.
On Invariant Manifolds in Singularly Perturbed Systems
Authors: O. D. Anosova
Venue: Journal of Dynamical and Control Systems (1999)

A singularly perturbed system with a small parameter &epsi; at the velocity of the slow variable y and with the fast variable x is considered. The main hypothesis is that for all y from some bounded domain D, the fast subsystem has a stable invariant or overflowing manifold M0(y) and that the motions in this system going in the directions transversal to M0(y) are more fast than the mutual approaching of trajectories on M0(y) (a precise statement is given in terms of appropriate Lyapunov-type characteristic numbers). It is proved that for a sufficiently small &epsi;, the whole system has an invariant manifold close to \bigcup\limits_{y\in D}M_0(y)\times \{y\}; the degree of its smoothness is specifed.
Very Low Cost Testers: Opportunities and Challenges
Authors: Jay Bedsole, Rajesh Raina, Al Crouch, Magdy S. Abadir
Venue: IEEE Design Test (2001)

Prudent application of design-for-testability guidelines can yield designs that don't require all the expensive features of traditional automated test equipment. The authors describe how the VLSI design and semiconductor test communities can cooperate to greatly reduce testing costs.