ppxscal/embedding_network huggingface dataset:
Towards Randomized Strongly Polynomial Algorithms for Linear Programming
Authors: Srinivasan Krishnan, John Reif
Venue:  (1991)

\indent The issue of strongly polynomial algorithms for linear programming has been unresolved for some time now. This paper proposes a new approach that is based on randomization. The key idea of this paper is to polynomially bound the length of a random walk when a certain condition (Conjecture 1) holds. We prove this condition for dimensions two and three. A general proof of the lemma (still open) would automatically result in a randomized strongly polynomial algorithm for linear programming.
Modelling the collaborative mission planning process using dynamic teamwork structures
Authors: Susannah Soon, Adrian Pearce, Max Noble
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present an approach to modelling the collaborative mission planning process, called Agent Assisted Mission Planning (AAMP), for use in distributed multiagent decision support systems. The AAMP approach is based on the use of adaptive agent teamwork structures to understand user activities and requirements. Military personnel engaged in mission planning manipulate interface and simulation agents that consequently recognise user goals to provide customised assistance and services to users. Dynamic teamwork structures are created at runtime that represent the beliefs, desires and intentions of mission planners, and through manipulation of agent profiles structural configurations of teamwork are updated. AAMP then uses matching strategies to compare evolving and existing team structures to recognise user intentions relevant to current tasks. The matching results are interpreted and used to affect agent behaviour to provide enhanced assistance.
Macroscale Thermodynamics and the Chemical Potential for Swelling Porous Media
Authors: Lynn S Bennethum, A. Murad,  M''arcio, John H. Cushman
Venue:  (1997)

The thermodynamical relations for a two-phase, N-constituent, swelling porous medium are derived using a hybridization of averaging and the mixture-theoretic approach of Bowen. Examples of such media include 2-1 lattice clays and lyophilic polymers. The homogenized field equations are obtained by volume averaging microscale field equations so that explicit relationships between the macroscale field variables and their microscale counterparts are obtained. The system of equations is closed by assuming the rate of change of the volume fraction is a dependent constitutive variable, resulting in viscoelastic behavior of the porous medium. A novel, scalar definition for the macroscale chemical potential for porous media is introduced, and it is shown how the properties of this chemical potential can be derived by slightly expanding the usual Coleman and Noll approach for exploiting the entropy inequality to obtain near-equilibrium results. Within this approach, we use Lagrange multipliers to weakly enforce the continuity equations as well as the relationship between the gradients of the diffusive velocities. The relationship between this novel scalar chemical potential and the tensorial chemical potential of Bowen is discussed. The tensorial chemical potential may be discontinuous between the solid and fluid phases at equilibrium; a result in clear contrast to Gibbsian theories. This discontinuity in the potential is due to an "effective" external field (e.g.\ the effective stress induced by a load in the solid phase). It is shown that the macroscopic scalar chemical potential is completely analogous with the Gibbsian chemical potential. The relation between the two potentials is illustrated in three examples.
How to Do Everything With Your iPAQ Pocket PC
Authors: Derek Ball, Barry Shilmover
Venue:  (2002)

:Do more with your iPAQ than you ever thought possible using this easy-to-use guide. Get step-by-step guidance for using Word,Excel,and Outlook,manage your finances,and secure your iPAQ from theft or loss. Covering wireless connections,troubleshooting,as well as fun things to do with the most popular pocket PC this book will show you how make the most out of your iPAQ.
Transformation approaches for the construction of Weibull prediction interval
Authors: Zhenlin Yang, Stanley P. See, M. Xie
Venue: Computational Statistics Data Analysis (2003)

Two methods of transforming the Weibull data to near normality, namely the Box-Cox method and Kullback-Leibler (KL) information method, are discussed and contrasted. A simple prediction interval (PI) based on the better KL information method is proposed. The asymptotic property of this interval is established. Its small sample behavior is investigated using Monte Carlo simulation. Simulation results show that this simple interval is close to the existing complicated PI where the percentage points of the reference distribution have to be either simulated or approximated. The proposed interval can also be easily adjusted to have the correct asymptotic coverage.
File Replication for Enhancing the Availability of Parallel I/O Systems on Clusters
Authors: Hau-Yang Cheng, Chung-Ta King
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Distributed environments such as networks of workstations are becoming more cost-effective and popular, and more high performance computations are moving into such environments. Although in the scientific computing arena NOWs have been used mainly for their high performance, their potential capability in reliability and high availability has not been fully exploited. One important area where this capability can be exploited on NOWs is to ensure data reliability and availability through the parallel I/O system. In this paper, we investigate the availability issues in parallel I/O systems with a shared-nothing disk configuration. A new file replication method, called locality aware file replication (LAFR), is proposed. LAFR is application specific and is designed specially for a parallel file with multiple access patterns. By comparing with previously proposed solutions, we demonstrate that the LAFR scheme may lead to better data access locality, while maintaining the same level of availability.
The graphical interpretation of plausible tacit knowledge flows
Authors: Peter Busch, Debbie Richards, C. N. G. 'Kit' Dampney
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

Many organisations make effective use of their codified knowledge, but they often fail to make most efficient use of their tacit knowledge stocks. What we define here as tacit knowledge is the 'articulable implicit IT managerial knowledge', that organisational personnel to varying degrees of success make use of. In this paper we present a graphical interpretation of selected results from what we label as organisation Z. These results have been obtained through a tacit knowledge questionnaire and visualized using formal concept analysis. The results are balanced with social network analysis, which aid in determining if tacit knowledge is being passed from one individual to the next.
RMCM: reliable multicasts for core-based multicast trees
Authors: Yuan Gao, Y. Ge, J. C. Hou
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Reliable multicast is one of the the important and challenging problems that must be effectively resolved before multicast applications can be fully deployed on the Internet. Most existing reliable multicast schemes focus on source-based multicast trees. They either cannot be directly deployed in core-based multicast trees or may render sub-optimal performance when directly deployed. The major difficulty lies in that an on-tree router on a core-based tree does not know, due to lack of the per-source information, how to direct a retransmission request (NAK) toward the sender or some designated replier router/host. We design and evaluate a reliable multicast scheme for core-based multicast trees, called RMCM. RMCM closely emulates the optimal recovery scenario achieved in the turning point approach. Specifically we define new IP options to carry path information in both data packets and NAKs and design a simple, yet effective scheme to facilitate routers on a core-based tree to properly direct NAKs/replies, even in the existence of clouds (of reliable-multicast-incapable routers). To conduct local recovery in the case of group membership and topology changes, we devise a mechanism that selects designated hosts (called repliers) which are most likely to have the requested packet and to which NAKs will be forwarded. We also devise a delayed ACK approach so that both sources and repliers can purge data packets that have been received by all the group members. The event-driven simulation study indicates that RMCM achieves better performance than most existing repair-based reliable multicast schemes, in terms of NAK implosion control, recovery latency, recovery isolation, and capability to deal with clouds. Finally, our experiences with implementing RMCM on FreeBSD 2.2.8 show that the add-on overheads to routers are reasonably small.
Taking the Step From Meta-information to Communication Middleware in Computational Data Streams
Authors: Beth Plale, Karsten Schwan
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

It is our belief that network applications relying on globallydistributed shared resources will increasingly adoptmeta-level descriptions to describe the data streaming inthe application at runtime. Our group has developed thenotion of computational data streams to describe and actupon such data flows. Our work conceptualizes the dataflows as database relations over which useful operations,such as querying, can be performed. This paper shows howone can make the step from a meta-level description of dataflows to an actual implementation using CORBA-style eventchannels and binary I/O for data transport.
Guided region prefetching: a cooperative hardware/software approach
Authors: Zhenlin Wang, Doug Burger, Kathryn S. McKinley, Steven K. Reinhardt, Charles C. Weems
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

Despite large caches, main-memory access latencies still cause significant performance losses in many applications. Numerous hardware and software prefetching schemes have been proposed to tolerate these latencies. Software prefetching typically provides better prefetch accuracy than hardware, but is limited by prefetch instruction overheads and the compiler's limited ability to schedule prefetches sufficiently far in advance to cover level-two cache miss latencies. Hardware prefetching can be effective at hiding these large latencies, but generates many useless prefetches and consumes considerable memory bandwidth. In this paper, we propose a cooperative hardware-software prefetching scheme called Guided Region Prefetching (GRP), which uses compiler-generated hints encoded in load instructions to regulate an aggressive hardware prefetching engine. We compare GRP against a sophisticated pure hardware stride prefetcher and a scheduled region prefetching (SRP) engine. SRP and GRP show the best performance, with respective 22% and 21% gains over no prefetching, but SRP incurs 180% extra memory traffic---nearly tripling bandwidth requirements. GRP achieves performance close to SRP, but with a mere eighth of the extra prefetching traffic, a 23% increase over no prefetching. The GRP hardware-software collaboration thus combines the accuracy of compilerbased program analysis with the performance potential of aggressive hardware prefetching, bringing the performance gap versus a perfect L2 cache under 20%.
Efficient Transition Fault ATPG Algorithms Based on Stuck-At Test Vectors
Authors: Xiao Liu, Michael S. Hsiao, Sreejit Chakravarty, Paul J. Thadikaran
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper proposes novel algorithms for computing test patterns for transition faults in combinational circuits and fully scanned sequential circuits. The algorithms are based on the principle that s@ vectors can be effectively used to construct good quality transition test sets. Several algorithms are discussed. Experimental results obtained using the new algorithms show that there is a 20% reduction in test set size, test data volume and test application time compared to a state-of-the-art native transition test ATPG tool, without any reduction in fault coverage. Other benefits of our approach, viz. productivity improvement, constraint handling and design data compression are highlighted.
Registration of Multiple Point Sets Using the EM Algorithm
Authors: Jacob Goldberger
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In this paper we address the problem of global registration between multiple dimensional point patterns with a given correspondence. The actual overlapping is not necessarily between pairs. Instead, it can be between any number of patterns. It is assumed that each pattern is a portion of an image of an unobserved object under a distinct rigid transformation. We derive an iterative solution for the problem of global registration of the patterns in order to reconstruct the original object.Our solution is based on the EM algorithm and it generalizes the well known solutions for the two-pattern case. We also suggest a very efficient method to implement the proposed algorithm. Experimental results demonstrate the improved performance of the proposed method.
Reuse in Replaying Database Design
Authors: Donatella Castelli.
Venue: Proceedings of the International Conference on Software Maintenance (1998)

This paper presents a technique for reducing the effort required to replay database schema design during maintenance. This technique is based on the reuse of the refinement steps, the schemas and the verification of the original design. For each kind of reuse, the technique specifies the conditions under which reuse can be applied and which are the local changes that must be operated on the components of the previous design. 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
Design and Implementation of an RSVP-based Quality of Service Architecture for Integrated Services Internet
Authors: Tsipora Barizilai, Dilip Kandlur, Debanjan Saha, Ashish Mehra, Steve Wise
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper presents the design and implementation of a quality of service architecture for the Internet. The architecture is based on the emerging standards for resource reservation in the Internet, namely the RSVP protocol and the associated service specifications defined by the Internet Engineering Task Force. Our architecture represents a major functional enhancement to the traditional sockets based communication subsystem, while preserving application programming interface and binary compatibility with existing applications. It is scalable and supports a variety of network interfaces ranging from legacy LAN interfaces, such as Token Ring and Ethernet, to high-speed ATM interfaces. We also describe our initial experiences with the implementation of this architecture on the IBM AIX platform.
Digital Video Essentials: Shoot, Transfer, Edit, Share, 1 edition
Authors: Erica Sadun
Venue:  (2003)

:The Perfect Companion for Your Digital Video Camera Digital video brings the power of studio production to the personal computer. With just a video camera, a computer, and the proper software, you can create your own innovative and unique movies for personal or business use. Digital Video Essentials shows you how to take advantage of today's technology to get the results you want. In this book, you'll learn to shoot your footage effectively, transfer it to your computer, use editing software to build and enhance your material, and export your movies to VHS tape, DVDs, the Internet, and more. All the Know-How You Need Inside you get the unparalleled instruction of best-selling author and video expert Erica Sadun, who explains the technologies and standards behind digital video in terms anyone can understand. Digital Video Essentials shows you how to make the most of your equipment, introduces you to the inexpensive tools that will turn your computer into a digital-editing studio, and explains the latest methods for getting your video to its audience. It even guides you through special-effects projects so you can have fun with your video as you learn. The companion CD comes packed with sample projects and trial versions of the software you need- from programs for editing video and sound to tools for burning CDs and creating streaming video. Topics covered include- Choosing your equipment and planning a shoot Composing, lighting, and shooting scenes Recording high-quality sound Getting analog or digital video onto your computer Editing your video on a PC or a Mac Adding low-cost special effects to your videos Burning video CDs and DVDs Sharing your movies via streaming video ABOUT THE AUTHOR Erica Sadun began working with digital image-capture techniques in 1984. She holds a Master's degree in digital imaging from the University of Pennsylvania and a Ph.D. in Computer Science from Georgia Tech's Graphics, Visualization & Usability Center. Her previous Sybex books include the best-seller Digital Photography Essentials- Point, Shoot, Enhance, Share, Digital Video! I Didn't Know You Could Do That... and iMovie 2 Solutions- Tips, Tricks, and Special Effects.
Newtonian Graphs, Riemann Surfaces and Computation
Authors: Kjartan Stefansson
Venue:  (1995)

In this thesis we study the Newtonian graph and how to compute it. We show different applications of this computation, ranging from numerical root finding to computing the genera of algebraic Riemann surfaces. Newton''s method in the complex plane gives rise to a vector field. Certain curves of flow in this field are of particular interest as they form a connected graph, the Newtonian graph. The faces of the graph are regions corresponding to roots of the input function, and Newton''s method on each region "should" converge to that root. We give a symbolic algorithm to compute the Newtonian graph for rational functions. The resulting structure can be used to improve Newton''s method to guarantee convergence. We also show how to extend the notion of Newtonian flow to a Riemann surface of an algebraic function. Again we obtain a Newtonian graph, now living on the abstract Riemann surface. We show how the graph is a tiling of the surface, and can therefore be used to compute the genus of the surface. Then we extend our earlier graph computation to cover the algebraic functions as well. All this computation is very efficient in the sense that it can all be done within the NC complexity class. This gives the first NC algorithm to compute the genus of algebraic Riemann surfaces.
Approximate Minimum-cost Multicommodity Flows in $\tilde 0(\eps^{-2}KNM)$ Time
Authors: M. D. Grigoriadis, L. G Khachiyan
Venue:  (1995)

We show that an $\veps$-approximate solution of the cost-constrained $K$-commodity flow problem on an $N$-node $M$-arc network $G$ can be computed by sequentially solving $0(K(\eps^{-2}+\log K)\log M\log(\eps^{-1}K))$ single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde 0(\eps^{-2}KNM)$ running time, where the notation $\tilde 0(\cdot)$ means ``up to logarithmic factors''''. This result improves the time bound mentioned in Grigoriadis and Khachiyan (1994) by a factor of $M/N$ and that developed recently in Karger and Plotkin (1995) by a factor of $\eps^{-1}$. We also provide a simple $\tilde 0(NM)$-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde 0(\eps^{-3})$ times faster than the algorithm of Karger and Plotkin (1995).
The existence of hyper-L triple-loop networks
Authors: Chiuyuan Chen, F. K. Hwang, J. S. Lee, S. J. Shih
Venue: Discrete Mathematics (2003)

Aguiló et al. (Discrete Math. 167/168 (1997) 3-16) have presented some necessary conditions for the existence of hyper-L triple-loop networks. In this paper, we will give necessary and sufficient conditions for the existence of hyper-L triple-loop networks.
A Note on Tape Bounds for SLA Language Processing
Authors: Juris Hartmanis, L. Berman
Venue:  (1975)

In this note we show that the tape bounded complexity classes of languages over single letter alphabets are closed under complementation. We then use this result to show that there exists an infinite hierarchy of tape bounded complexity classes of sla languages between log n and log log n tape bounds. We also show that every infinite sla language recognizable on less than log n tape has infinitely many different regular subsets, and, therefore, the set of primes in unary notation, P, requires exactly log n tape for its recognition and every infinite subset of P requires at least log n tape.
Design of Dynamic Reliability Indices
Authors: Elena N. Zaitseva, Vitaly G. Levashenko
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

The Multi-State System reliability is investigated inthis paper. The new class of Reliability Indices isobtained. We have called these indices as DynamicReliability Indices. These indices estimate influenceupon the Multi-State System reliability by thecapacity levels of a system component. TheMultiple-Valued Logic mathematical tools are used forcalculation of Dynamic Reliability Indices.
Automating Rule Strengths in Expert System
Authors: Marco Valtorta
Venue:  (1987)

Automating rule strengths in expert systems is a way to alleviate the knowledge acquisition bottleneck. It is assumed that rules are fixed, except for the values of their strengths, which are computed or adjusted from initial values given by experts. A model of expert systems is proposed, in which rules have the form IF $(P _ 1, P _ 2 \& ...\& P _ n)$ THEN $C$ WITH ATTENUATION $a$, where $P _ 1, P _ 2, ..., P _ n$ and $C$ are weighted propositions, i.e., statements with a certainty factor (CF), and $a$, the strength of the rule, is a number between 0 and 1. Certainty factors are numbers between 0 and 1. The premise of the rule has a CF that is computed by taking the MIN of the CFs of its component conjuncts. The CF of the premise is multiplied by the strength of the rule to obtain the CF of the conclusion, C. Many rules may conclude the same proposition; their CFs are merged by using the MAX or the probabilistic addition functions. To compute rule attenuations, two problem settings are considered. In the first, an oracle is given, that can provide the CFs of the conclusions of the entire rule-based system, given any assignment of certainty factors to the premises of the entire system (complete case). In the second, a fixed set of cases is available (incomplete case). A fast algorithm for synthesis in the complete case for simple rule bases is given both for MAX and probabilistic sum. It is shown that, when premises are shared among rules, a well-known result in the testing of Boolean circuits implies that determination of a rule strength is NP-Complete. However, a fast algorithm is given for the determination of input attenuations. In the incomplete case, the synthesis of attenuations is shown to be NP-Complete, even for very shallow rule bases with only two propositions in the premise of each rule, both for MAX and probabilistic sum. The refinement of attenuations from expert-given estimates is shown to be NP-Hard, no matter how close to the correct value the estimates are and how small an improvement towards the correct value is desired. The NP-Hardness proofs are exploited to define a strict condition under which a fast algorithm for the MAX case exists and to interpret several simple iterative algorithms.