ppxscal/embedding_network huggingface dataset:
The Thread-Monitor Library: A System Monitoring Solaris-Threads Programs
Authors: Thomas W. Doeppner,  Jr.
Venue:  (1993)

Debugging a multi-threaded program involves all the difficulties of debugging a single-threaded program with the additional concern of the interaction among threads. Multithreaded programs can be nondeterministic-the outcome of the program depends upon the ordering of the executions of the various threads. When testing a program, one would like to exert some control over this ordering, to force certain execution sequences to occur so that they can be tested. The Thread-Monitor Library is an experimental system that allows one to monitor and control the execution of a multithreaded program (written using the Solaris Threads package). It creates separate windows for controlling each thread and separate windows for monitoring each synchronization object (currently, only mutexes and condition variables are supported). Whenever a thread enters a synchronization construct, its execution is immediately suspended and the programmer is prompted for permission to resume execution. The operations applied to each of the synchronization objects are listed in the synchronization object windows, allowing one to keep track of their state. All of this is accomplished through a collection of "wrappers" for the Solaris Threads API. Rather than call the standard Solaris routine, one instead calls the appropriate wrapper which calls upon the monitor code as well as completing the call to the Solaris routine.
Parallel Solution of Sparse Linear Least Squares Problems on Distributed-memory Multiprocessors
Authors: Chunguang Sun
Venue:  (1995)

This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are analyzed. The proposed parallel sparse triangular solution algorithms together with a block-oriented parallel sparse QR factorization algorithm result in a highly efficient block-oriented approach to the parallel solution of sparse linear least squares problems on distributed-memory multiprocessors. Performance of the block-oriented approach is demonstrated empirically through an implementation on an IBM Scalable POWERparallel system SP2. The largest problem solved has over two million rows and more than a quarter million columns. The execution speed for the numerical factorization of this problem achieves over 3.7 gigaflops per second on an IBM SP2 machine with 128 processors.
Automated Dynamic Memory Data Type Implementation Exploration and Optimization
Authors: Marc Leeman, Chantal Ykman, David Atienza, Vincenzo De Florio, Geert Deconinck
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

The behavior of many algorithms is heavily determinedby the input data. Furthermore, this often means that multipleand completely different execution paths can be followed,also internal data usage and handling is frequentlyquite different. Therefore, static compile time memory allocationis not efficient, especially on embedded systemswhere memory is a scarce resource, and dynamic memorymanagement is the only feasible alternative. Includingapplications with dynamic memory in embedded systemsintroduces new challenges as compared to traditional signalprocessing applications. In this session, an automatedframework is presented to optimize embedded applicationswith extensive use of dynamic memory management. Theproposed methodology automates the exploration and identificationof optimal data type implementations based onpower estimates, memory accesses and normalized memoryusage.
Extension Theorems for Plate Elements with Applications
Authors: Jin Gu, Zian Hu
Venue:  (1995)

The extension theorems for plate elements are established in this paper. Their applications to the analysis of nonoverlap domain decomposition methods for solving the plate bending problems are presented. Numerical results coincide with our theoretical estimates.
TANGO: A Framework and System for Algorithm Animation
Authors: John T Stasko
Venue:  (1989)

Algorithm animation is the process of abstracting the data, operations, and semantics of computer programs, and then creating animated graphical views of those abstractions. Although a handful of algorithm animation systems have been developed in recent years, relatively little work has been done on the theoretical foundations of such systems. In this work we develop a conceptual framework with formal models and precise semantics for algorithm animation. The framework contains facilities for defining operations in an algorithm, designing animations, and mapping the algorithm operations to their corresponding animations. We introduce the framework to make animation design easier, as well as to provide a model that supports smooth, continuous image movement. We also present the {\em path-transition} paradigm that simplifies the animation design process. Concurrently, we develop an algorithm animation system called TANGO (Transition-based Animation Generation) based upon the framework. TANGO supports two-dimensional color animations in a window-based workstation environment. It provides programmers with the capabilities to produce sophisticated, real-time views of their programs with a minimum of graphics coding. Using TANGO, programmers create animations by writing routines in an algorithm animation design language or by using a direct-manipulation, demonstrational animation design tool.
Receiver-Initiated Group Membership Protocol (RGMP): A New Group Management Protocol for IP Multicasting
Authors: Wanjiun Liao, De-Nian Yang
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Internet multicast is an important networked service for many existing and emerging applications. The dominant mechanism for group management of IP multicasting is the Internet Group Management Protocol (IGMP). IGMP is based on a query/reply model and refreshes group membership periodically. IGMP has been evolving through three versions. IGMP v1 develops the basis of the query/reply group management model and suppression mechanism, IGMP v2 reduces leave latency that IGMP v1 suffers from, and IGMP v3 adds the capability of source filtering but removes the suppression mechanism of IGMP v1/v2. In this paper, a new group management protocol called Received-initiated Group Membership Protocol (RGMP) is proposed. Both source filtering and membership report suppression are supported. An RGMP host actively refreshes group membership in the neighboring multicast routers. No querier, and hence no query messages and timers, is required for periodically probing the presence of known groups. An individual host maintains a refresh timer per group. The refresh timer is reset once the suppression rule holds for a received report message, where the report may be a join, leave, state change, or a periodical refresh message. The receiver-initiated, self-synchronized refresh timer makes the RGMP suppression mechanism superior to that of IGMP v1/v2, which applies only for periodical refresh report message. As a result, the protocol overhead compared to IGMP v3 is significantly reduced, over a wide variety of service scenarios. In addition to reduced protocol overhead, RGMP is robust, scalable and adaptive to serve as a group management protocol.
A stochastic multi-objective dynamic programming model for multiple generation mate-allocation problems
Authors: H. A. Abbass, G. D. Finn, M. Towsey
Venue:  (1999)

Designing a breeding program has been an issue of primary concern on much animal breeding research has focused in the last decade. In general the outcome of a breeding program is a long-term product and requires careful design. In this paper, we present a stochastic multi-objective multi-stage decision model (SMOM) that optimises simultaneously a breeding program over a number of generations. It is found that the complexity of the model is very high $O(2^{T\times (S + D)^2})$ for the search space, where $S$ denotes the number of sires, $D$ the number of dams, and $T$ the number of generations. Two research directions are suggested to make the problem tractable, namely; genetic algorithms and constraint satisfaction techniques.
Z Specifications Meet Mathematica for Exploratory Prototyping
Authors: Linda B. Sherrell
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

In order for formal methods to achieve widespread acceptance, associated tools must become more accessible to the average user. This work describes ZEM (Z Embedded in Mathematica), a new tool supporting the major phases of the requirements analysis life cycle. ZEM is best described as an animator for Z specifications with a theorem-proving component. The overall goal in its design has been twofold: 1) to encourage the use of formal methods by a wider group of practitioners and 2) to provide an environment that facilitates exploratory prototyping.
A light weight PDA-friendly collection fusion technique
Authors: Jeffery Antoniuk, Mario A. Nascimento
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This short paper presents a light weight technique to merge results lists obtained from querying different databases. The motivation for such a technique is a general purpose search engine for Palm-OS based PDAs.
Systematic Formal Verification of Interpreters
Authors: David Cyrluk, John Rushby, Mandayam Srivas
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Formal methods have gained acceptance in the hardware field through a pragmatic approach that has succeeded in providing systematic, scalable, highly automated, and cost-effective treatments for certain stereotypical problems of practical importance. By identifying stereotypical problems, the effort required to develop effective formal methods has been amortized over many applications. We suggest that formal methods can achieve similar industrial success in selected software applications by following the same principles. As illustration, we examine approaches to the stereotypical problem of interpreter correctness in the presence of timing differences between the specification and implementation interpreters. In hardware, this corresponds to the problem of verifying microprogrammed, pipelined, or superscalar processors, but it has wider applications to any system---hardware or software---that can be considered as an interpreter.
Enabling predictable assembly
Authors: Scott Hissam, Gabriel Moreno, Judith Stafford, Kurt Wallnau
Venue: Journal of Systems and Software (2003)

Demands for increased functionality, better quality, and faster time-to-market in software products continue to increase. Component-based development is the software industry's response to these demands. The industry has developed technologies such as EJB and CORBA to assemble components that are created in isolation. Component technologies available today allow designers to plug components together, but do little to allow the developer to reason about how well they will play together. Predictable assembly focuses on issues related to assembling component-based systems that predictably meet their quality attribute requirements. This paper introduces prediction-enabled component technology (PECT) as a means of packaging predictable assembly as a deployable product. A PECT is the integration of a component technology with one or more analysis technologies. Analysis technologies support prediction of assembly properties and also identify required component properties and their certifiable descriptions. This report describes the major structures of a PECT. It then discusses the means of validating the predictive powers of a PECT, which provides measurably bounded trust in design-time predictions. Last, it demonstrates the above concepts in an illustrative model problem: predicting average end-to-end latency of a 'soft' real time application built from off-the-shelf software components.
PhotoShop 7 Professional Photographic Techniques, 1 edition
Authors: Nyree Costello, Gavin Cromhout, Vikas Shah
Venue:  (2002)

:Discover how the latest version of Photoshop will enable you to recreate, in digital form, all the traditional techniques that were once limited to darkrooms. We'll also show you how to obtain many more effects used by professionals today that were once beyond the photographer's grasp. Whether you are a professional photographer looking to increase your Photoshop skills, a Photoshop expert wanting to find out more about working with photographic images or an enthusiast looking to achieve top quality results, this book is for you. The authors share their wealth of experience and breadth of knowledge to give you a comprehensive rundown of what's now possible with Photoshop 7, including the revolutionary Healing Brush tool. A wide range of techniques are demonstrated and clearly explained, illustrated with practical real-world exercises, ranging from color correction right through to preparing images for print or optimizing them for the web. You will also benefit from fast, friendly and free technical support by e-mail, and the back up of Photoshop files and communities at the friendsofed.com website.
An empirical evaluation of Chernoff faces, star glyphs, and spatial visualizations for binary data
Authors: Michael D. Lee, Rachel E. Reilly, Marcus E. Butavicius
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

Data visualization has the potential to assist humans in analyzing and comprehending large volumes of data, and to detect patterns, clusters and outliers that are not obvious using non-graphical forms of presentation. For this reason, data visualizations have an important role to play in a diverse range of applied problems, including data exploration and mining, information retrieval, and intelligence analysis. Unfortunately, while a variety of different approaches are available for data visualization, there have been few rigorous evaluations of their effectiveness. This paper presents the results of a controlled experiment comparing the ability four different visualization approaches to help people answer meaningful questions for binary data sets. Two of these visualizations, Chernoff faces and star glyphs, represent objects using simple icon-like displays. The other two visualizations use a spatial arrangement of the objects, based on a model of human mental representation, where more similar objects are placed nearer each other. One of these spatial displays uses a common features model of similarity, while the other uses a distinctive features model. It is found that both glyph visualizations lead to slow, inaccurate answers being given with low confidence, while the faster and more confident answers for spatial visualizations are only accurate when the common features similarity model is used.
Learning the parameters for a gradient-based approach to image segmentation using cultural algorithms
Authors: R. G. Reynolds, S. R. Rolnick
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

There are two basic approaches to image segmentation, region-based and neighborhood-based. Region-based approaches require less a priori knowledge about the scene than neighborhood-based approaches but are computationally more expensive. In cases where there is little prior knowledge about properties of the image, one is often forced to use region growing approaches. In this paper the authors use cultural algorithms, a form of evolutionary computation based upon principles of cultural evolution, as the basis for learning the parameters for a neighborhood-based approach to image segmentation from the results of a region-growing approach. Specifically, parameters for a differential gradient method utilizing the Sobel operator are learned from the results of a region growing approach. The prototype is applied to a sequence of real world images, taken from archaeological excavations of a prehistoric site in order to extract spatial activity areas in the site. A region-growing approach is applied first to the images, and then a cultural algorithm is used to extract the parameters for use by a gradient method for those images. The resulting performance of the gradient method produced a correspondence of over 95% with that of the original.
Frequency Domain Approach for CMOS Ultra-Wideband Radios
Authors: Hyung-Jin Lee, Dong Sam Ha
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Ultra wideband (UWB) is a promising newcommunication scheme for short-range, high datarate applications. Processing UWB signalsnecessitates impractically high sampling rates foranalog-to-digital converters. In this paper, wepropose a new approach to address this problem.
Analytical solutions for bending design of RC trapezoidal cross sections according to EC2 standard
Authors: M. Skrinar
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper considers the uniaxial bending analysis of reinforced concrete trapezoidal cross sections. Due to a linear change of the width of the cross section the analysis procedures for trapezoidal cross sections essentially deviate from the analysis of a rectangular cross section. The paper considers the bilinear design stress-strain relationship for the concrete and for both cases that appear according to the maximal strain in the concrete presents the development of the analytical expressions for coefficients αR and ka that are necessary for the computation of the required cross section of the reinforcements As1.
CLP (Intervals) Revisited
Authors: F. Benhamou, D. McAllester, P. Van Hentenryck
Venue:  (1994)

The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a new CLP language Newton whose operational semantics is based on the notion of box-consistency, an approximation of arc-consistency, and whose implementation uses Newton interval method. Experimental results indicate that Newton outperforms existing languages by an order of magnitude and is competitive with some state-of-the-art tools on some standard benchmarks. Limitations of our current implementation and directions for further work are also identified.
Static Scheduling for Dynamic Dataflow Machines
Authors: Micah Beck, Keshav Pingali, Alexandru Nicolau
Venue:  (1990)

Dataflow machines can ``unravel'''' loops automatically so that many iterations of a loop can execute in parallel. Unbounded loop unraveling can strain the resources available on the machine and, in extreme cases, deadlock can occur due to overcommitment of resources. Previous efforts to address this problem have focused mainly on runtime mechanisms of debatable utility. Loop bounding, a compile-time technique, controls parallelism by introducing dependencies between loop iterations. The loop is given enough resources for the concurrent execution of some number of iterations, say $k$. The $K$ + 1st iteration uses the same resources as the first iteration and starts only after the first iteration is complete, and so on. Thus, the granularity of resource allocation is based on the rather arbitrary syntactic notion of a loop iteration. In this paper, we argue that loop bounding can lead to inefficient use of resources and propose an alternative way of compiling loops for pipelined execution. We introduce the notion of a stage decomposition of a loop, which defines a partition of a loop iteration into stages. We show how the problem of choosing a stage decomposition for a particular loop can be tackled by applying compile-time analyses and static scheduling techniques. Such techniques have been developed for scheduling loops on very long instruction word (VLIW) machines which, like dataflow machines, can exploit fine-grained parallelism in programs. These analyses permit the compiler to allocate resources according to expected patterns of usage, thus reducing overall resource requirements. Finally, we show how our schema can be implemented on the Monsoon dataflow machine being built at M.I.T.
Learning Boxes in High Dimension
Authors: Amos Beimel, Eyal Kushilevitz
Venue:  (1997)

We present exact learning algorithms that learn several classes of (discrete) boxes in $\{0,\ldots,\ell-1\}^n$. In particular we learn: (1) The class of unions of $O(\log n)$ boxes in time $\poly(n,\log\ell)$ (solving an open problem of \cite{GGM94,BGGM94}; in~\cite{BBBKV97} this class is shown to be learnable in time $\poly(n,\ell)$). (2) The class of unions of disjoint boxes in time $\poly(n,t,\log\ell)$, where $t$ is the number of boxes. (Previously this was known only in the case where all boxes are disjoint in one of the dimensions; in~\cite{BBBKV97} this class is shown to be learnable in time $\poly(n,t,\ell)$). In particular our algorithm learns the class of decision trees over $n$ variables, that take values in $\{0,\ldots,\ell-1\}$, with comparison nodes in time $\poly(n,t,\log\ell)$, where $t$ is the number of leaves (this was an open problem in \cite{Bsh93} which was shown in \cite{BBBKV96} to be learnable in time $\poly(n,t,\ell)$). (3) The class of unions of $O(1)$-degenerate boxes (that is, boxes that depend only on $O(1)$ variables) in time $\poly(n,t,\log\ell)$ (generalizing the learnability of $O(1)$-DNF and of boxes in $O(1)$ dimensions). The algorithm for this class uses only equivalence queries and it can also be used to learn the class of unions of $O(1)$ boxes (from equivalence queries only).
Essentials of XBRL: Financial Reporting in the 21st Century
Authors: Bryan P. Bergeron, Miklos A. Vasarhelyi, LIV Watson
Venue:  (2002)

:Full of valuable tips, techniques, illustrative real-world examples, exhibits, and best practices, this handy and concise paperback will help you stay up to date on the newest thinking, strategies, developments, and technologies in XBRL.
Scheduling packet transmissions in a multi-hop packet switched network based on message length
Authors: E. Modiano
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to first-come-first-serve scheduling.
Beginning Java 2 SDK 1.4 Edition, 1 edition
Authors: Ivor Horton, Wrox Author Team
Venue:  (2002)

:Chapter 1: Introducing JavaChapter 2: Programs, Data, Variables and Calculation Chapter 3: Loops and Logic Chapter 4: Arrays and Strings Chapter 5: Defining Classes Chapter 6: Extending Classes and Inheritance Chapter 7: Exceptions Chapter 8: Understanding Streams Chapter 9: Accessing Files and Directories Chapter 10: Reading Files Chapter 11: Serializing Objects Chapter 12: Collection Classes Chapter 13: A Collection of Useful Classes (update) Chapter 14: Threads Chapter 15: Creating Windows Chapter 16: Handling Events Chapter 17: Drawing in a Window Chapter 18: Extending the GUI Chapter 19: Filing and Printing Documents (additional material) Chapter 20: Introducing XML Chapter 21: Java and XML