ppxscal/embedding_network huggingface dataset:
On the Movement of Robot Arms in Two Dimensional Bounded Regions
Authors: John E. Hopcroft, Deborah A. Joseph, Sue H. Whitesides
Venue:  (1982)

The classical mover''s problem is the following: can a rigid object in 3-dimensional space be moved from one given position to another while avoiding obstacles? It is known that a more general version of this problem involving objects with movable joints is PSPACE complete, even for a simple tree-like structure moving in a 3-dimensional region. In this paper, we investigate a 2-dimensional mover''s problem in which the object is a robot arm with an arbitrary number of joints. In particular, we give a polynomial time algorithm for moving an arm confined within a circle from one given configuration to another. We also give a polynomial time algorithm for moving the arm from its initial position to a position in which the end of the arm reaches a given point within the circle. Keywords: robotics, manipulators, mechanical arms, algorithms, polynomial time.
Essential Information Systems for Railways and Intensive Application of ADS Technology COSMOS and ATOS
Authors: S. Yamanouchi
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In December 1996, JR East introduced "ATOS" the latest Autonomous Decentralized System, on its Chuo Line. This system, named after Athos, the mountain which is sacred to the Greek Orthodox Church, is considered as a sanctuary of the railway technology in the current information society.ATOS or the Autonomous Decentralization System is not only an application, on a huge scale, of the concept of an epoch making network computing to the downsizing, but is also highly innovative in terms of the diversity and complexity of the technology applied, of its capacity for expansion, and of its complementary functions. The system not only controls the day-to-day operation of 6,200 trains over 1,100 kilometers of track, delivering information which is essential to the company's passengers and work force, but also serves as a safety system covering maintenance work, including track repairs and the inspection of electrical facilities. Total investment in ATOS is expected to reach $360 million.This railway operation control system, which is a comprehensively revamped version of the CTC system used on the Shinkansen routes, is a digital application of analog technology at its best.It is among the most sophisticated and interesting applications of an autonomous decentralized system in the industry. 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
Parallel Tertiary Structure Search on the Cenju-3 Parallel Machine
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The author parallelized a tertiary structure search algorithm on a distributed memory parallel computer, Cenju-3, utilizing a standard message passing interface (MPI) parallel library. For parallelization scheme, a master-workers model is used. I analyzed the total performance by utilizing a M/M/1 queueing model and Jackson's model, and clearly explained the actual turn around times. Tertiary structure search is a computationally intensive task. When test sequences are distributed to all processors, a single key sequence can be tested independently. Thus high parallelization results are anticipated. Since database is allocated on a master processor, worker processors should acquire test sequences from the master processor. Sometimes a worker should wait until other workers obtain test sequences from the master processor. By this waiting, the total performance will saturate when the number of processors proceeds certain level. I analyzed the total performance by utilizing a M/M/1 queueing model and Jackson's model. By using these models, the actual turn around times are explained clearly.
A LISP Programming Exercise
Authors: Jan L. A. Van de Snepscheut
Venue:  (1992)

We present the derivation of a solution to a LISP programming exercise. The derivation is in three steps. First, an inefficient solution is given. Second, the quintessence of a more efficient solution is captured in a number of equalities. Third, an efficient solution is derived from the inefficient one by a number of transformation steps, each of which is justified by the equalities.
A Maze Router for Tracks with Different Width
Authors: V. M. Kureichik, B. K. Lebedev, E. V. Nuzhnov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The main procedures of a new maze router for VLSI CAD system are discussed in this paper. The maze router presented below allows to create tracks with different width and to solve known difficult I. Soukup's routing problems.A new approach to maze routing was described in [1]. The main maze routing ideas are presented in the following scheme (Fig.1). The detailed functional description of its main procedures is proposed in this paper.
Approximations with Minimum Packing Constraint Violation
Authors: Jyh Lin, Jeffrey S Vitter
Venue:  (1992)

We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint violation, the epsilon-approximation problem for many problems of this type is itself NP-hard. Our methods provide polynomial-time epsilon-approximations while attempting to minimize the packing constraint violation. Our methods lead to the first known approximation algorithms with provable performance guarantees for the s-median problem, the tree pruning problem, and the generalized assignment problem. These important problems have numerous applications to data compression, vector quantization, memory-based learning, computer graphics, image processing, clustering, regression, network location, scheduling, protocol testing, and communication. We provide evidence via reductions that our approximation algorithms are nearly optimal in terms of the packing constraint violation. We also discuss some recent applications of our techniques to scheduling problems.
Constructing smoothing functions in smoothed particle hydrodynamics with applications
Authors: M. B. Liu, G. R. Liu, K. Y. Lam
Venue: Journal of Computational and Applied Mathematics (2003)

This paper presents a general approach to construct analytical smoothing functions for the meshfree, Lagrangian and particle method of smoothed particle hydrodynamics. The approach uses integral form of function representation and applies Taylor series expansion to the SPH function and derivative approximations. The constructing conditions are derived systematically, which not only interpret the consistency condition of the method, but also describe the compact supportness requirement of the smoothing function. Examples of SPH smoothing function are constructed including some existing ones. With this approach, a new quartic smoothing function with some advantages is constructed, and is applied to the one dimensional shock problem and a one dimensional TNT detonation problem. The good agreement between the SPH results and those from other sources shows the effectiveness of the approach and the newly constructed smoothing function in numerical simulations.
Professional Techniques for Digital Wedding Photography
Authors: Jeff Hawkins, Kathleen Hawkins
Venue:  (2002)

:Wedding photographers competing for clients have much to learn about staying on top of changing technology. This timely guide explores the reservations many photographers have about digital wedding photography and explains the outstanding benefits of this new technology, including saved labor and cost and quick turnaround time. Topics include selecting and using equipment, addressing client concerns and potential objections, pricing images, using digital proofs, and using digital imaging software.Jeff Hawkins has been a professional photographer for 20 years. Kathleen Hawkins is president of Wedding Professionals of Central Florida. They are the authors of Professional Marketing & Selling Techniques for Wedding Photographers. They live in Longwood, Florida.
Modelling the Fault Correction Process
Authors: Norman F. Schneidewind
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

In general, software reliability models have focused on modeling and predicting failure occurrence and have not given equal priority to modeling the fault correction process.However, there is a need for fault correction prediction, because there are important applications that fault correction modeling and prediction support.These are the following: predicting whether reliability goals have been achieved, developing stopping rules for testing,formulating tes strategies, and rationally allocating test resources.Because these factors are related, we integrate them in our model.Our modeling approach involves relating fault correction to failure prediction, with a time delay between failure detection and faul correction, represented by a random variable whose distribution parameters are estimated from observed data.
A Generalization of Shestakov's Function Decomposition Method
Authors: J. J. Lou, J. A. Brzozowski
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Shestakov expresses an incompletely specified Boolean function ¿(x1; : : : ; xn) in terms of Boolean functions gu, gv and h in the form h(gu(u1; : : : ; ur); gv(v1; : : : ; vs)), where ¿{u1; : : : ; ur} U ¿{v1; : : : ; vs} = ¿{x1; : : : ; xn}.We generalize his method to multi-valued functions with partial don't care's represented in a compact cube-like notation; we do this using blankets, which are generalizations of set systems. Luba and Selvaraj express a Boolean function ¿(x1; : : : ; xn) in terms of Boolean functions g and h as h(u1; : : : ; ur; g(v1; : : : ; vs)). This method has been formalized using blankets by Brzozowski and Luba, and generalized to multi-valued functions by Brzozowski and Lou. The relations among these methods are discussed.
Macromedia Dreamweaver MX Unleashed
Authors: Matthew Pizzi, Thomas Myers, Zak Ruvalcaba
Venue:  (2002)

:Macromedia Dreamweaver MX Unleashed is the first complete reference guide to cover Dreamweaver MX's new and powerful features that aid in server-side programming, as well as strategies for designing, managing and developing sophisticated Web sites.A reference for advanced users on complex application development techniques, this book guides developers into the realm of dynamic sites enabling a richer experience for the end user.Developers learn how to collect information from a user and personalize their Web experience and how to use Dreamweaver MX management tools that aren't thoroughly covered in other intermediate-level Dreamweaver books.
Some Observations About NP Complete Sets
Authors: Juris Hartmanis
Venue:  (1987)

In this paper we summarize and extend some recent results about the properties of NP complete sets and related results about the structure of feasible computations.
Finite Canonization
Authors: Saharon Shelah
Venue:  (1995)

The canonization theorem says that for given m,n for some m(*) (the first one is called ER(n;m)) we have for every function f with domain {1,...,m(*)]^n, for some A in [1,...,m(*)]^m, the question of when the equality f({i(1),...,i(n)}) = f({j(1),...,j(n)}) (where i(1)>, ..., i(n) and j(1)>, ..., j(n) are from A) holds has the simplest answer: for some subset v of {1,...,n} the equality holds if i(1)=j(1) for all 1 in v. We improve the bound on ER(n,m) so that fixing n the number of exponentiation needed to calculate ER(n,m) is the best possible.
A Generic Programming System for Sparse Matrix Computations (REVISED)
Authors: Vladimir K Nikolay Mateev, Paul Stodghill
Venue:  (1999)

Sparse matrices are stored in compressed formats in which zeros are not stored explicitly. Writing high-performance sparse matrix libraries is a difficult and tedious job because there are many compressed formats in use and each of them requires specialized code. In this paper, we argue that (i) compressed formats should be viewed as {\em indexed-sequential access structures} (in the database sense), and (ii) efficient sparse codes exploit such indexing structures wherever possible. This point of view leads naturally to restructuring compiler technology that can be used to synthesize many sparse codes from high-level algorithms and specifications of sparse formats, exploiting indexing structures for efficiency. We show that appropriate abstractions of the indexing structures of commonly used formats can be provided to such a compiler through the type structure of a language like C++. Finally, we describe experimental results obtained from the {\em Bernoulli Sparse Compiler} which demonstrate that the performance of code generated by this compiler is comparable to the performance of programs in the NIST Sparse BLAS library. One view of this system is that it exploits restructuring compiler technology to perform a novel kind of template instantiation.
Legal and Contractual Issues in Software Reuse
Authors: Wayne C. Lim
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

This paper contributes to the body of knowledge in reuse legal and contractual issues by outlining such issues by the scope of reuse, covering the advantages and disadvantages of various intellectual property protection methods, discussing legal issues from the viewpoint of the producer, consumer, broker and enduser, and describing the implications of licenses and warranties for software reuse.
Applications of the Hybrid Automated Reliability Predictor
Authors: J S Bavuso, B J Dugan, Kishor Trivedi, Beth Rothmann, Mark Boyd
Venue:  (1987)

The Hybrid Automated Reliability Predictor (HARP) is a software package that implements advanced reliability modeling techniques. In this paper we present an overview of some of the problems that arise in modeling highly reliable fault-tolerant systems, loosely divided into model construction and model solution problems. We then describe the HARP approach to these difficulties, which is facilitated by a technique called {\em behavioral decomposition}. The bulk of this paper presents examples of the evaluation of some typical fault tolerant systems, including a local area network, two fault-tolerant computer systems (Carnegie-Mellon University multiprocessor system, {\em C.mmp}, and Software Implemented Fault Tolerance, {\em SIFT} ), and two examples of flight control systems.
Benchmarking IBM SP1 system for SPMD programming
Authors: Wentong Cai, A. Hang, P. Varman
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The IBM SP1 is the first member of the IBM Scalable POWERparallel series, a distributed memory parallel computer based on RISC System/6000 processing element. In this paper, the benchmarking exercise of two message passing libraries, MPL and PVM, on the IBM SP1 for SPMD programming is described. We will discuss the benchmarks used in our experiment, and present the results we obtained. Our results indicate that to achieve performance improvement and to reduce the communication overhead, the use of the high performance switch is essential on the IBM SP1 machine.
A File System Extension to Micro-PL/CS
Authors: James E. Archer,  Jr.
Venue:  (1979)

Micro-PL/CS is a version of PL/CS developed for interactive use with a dedicated microprocessor. A file system extension is proposed to give PL/CS a simple, but extremely powerful file system capability. The system allows for the creation and manipulation of files for sequential, random, or keyed access (or any combination) in an unrestricted manner. Essential to the capability is a set of built-in functions and pseudo-variables which allow file manipulation without syntactic complication.
Monitoring and Characterization of Component-Based Systems with Global Causality Capture
Authors: Jun Li
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Current software development techniques and toolslack the capability to characterize function call chains inmultithreaded and distributed applications built uponcomponent technologies like CORBA, COM and J2EE.The root cause is that causal linkage informationnecessary to trace end-to-end call chains is private toeach vendor's runtime and often unavailable for loggingor analysis. We propose and demonstrate a mechanismfor maintaining and correlating global causalityinformation of component-based applications, and usingthis information to expose and characterize function callchains and their associated behaviors in suchmultithreaded and distributed applications. Our approachrelies on a global virtual tunnel facilitated by theinstrumented stubs and skeletons. This tunnel maintainsand correlates causal information throughout the end-to-endcall chains spanning threads, processes andprocessors. As a result, monitoring data captured locallycan be correlated and system-wide propagation of timinglatency and CPU utilization becomes perceivable.
Closed-Form Expressions for Irradiance from Non-Uniform Lambertian Luminaires Part II: Polynomially-Varying Radiant Exitance
Authors: Min Chen, James Arvo
Venue:  (2000)

We present new analytical techniques for computing illumination from non-uniform luminaires. The methods are based on new closed-form expressions derived by generalizing the concepts of irradiance tensor and angular moment to rational forms and an arbitrary number of directions, known as rational irradiance tensors and rational angular moments, respectively. The techniques apply to any emission, reflection or transmission distribution expressed as a polynomial over a polygonal surface, and provide a powerful mathematical tool to handle more complex BRDF''s. We derive closed-form expressions for irradiance due to polygonal luminaires with polynomially varying radiant exitance, which satisfy a recurrence relation that subsumes Lambert''s formula for uniform luminaires. Our formulas extend the class of available closed-form expressions for computing direct radiative transfer from planar surfaces to points, and can find many potential applications in simulating non-Lambertian illumination and scattering phenomena
The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems
Authors: Frank B. Schmuck
Venue:  (1988)

Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. We show that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. We introduce the concept of a linearization function that maps partially ordered sets of events to totally ordered histories. We show how to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found. We prove that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, we consider an important subclass of problems that have certain commutativity properties. We present techniques for constructing asynchronous implementations for this class. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.
Using Triples to Reason About Concurrent Programs
Authors: K. M Chandy
Venue:  (1993)

This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic.
Dynamic Adaptive Forward Error Control for Image Transmission over Lossy Networks
Authors: Rogelio Hasimoto-Beltran, Ashfaq A. Khokhar
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In this work, we address the problem of transmitting JPEG compressed image over a lossy network. We introduce a combination of block level Triangular Interleaving Scheme (TRII), and Variable and Selective Forward Error Correction scheme (VS-FEC) to make the transmitted data more resilient while using the network bandwidth more efficiently in the presence of bursty losses. Our results show that TRII barely affects the final compression ratio of the transmitted image (on the average just 4% below JPEG), while considerably increases its resilience to errors. Also, in the presence of losses, a new scheme is introduced to dynamically add a variable FEC to avoid retransmission of the lost data. Small amount of FEC overhead was needed (4%, versus 10%-15% in constant FEC) to be at least 90% sure on the average that the protected information will not be damaged during transmission.
Transient Dynamics Inside Periodic Windows and in Their Vicinity I. Logistic Maps
Authors: Katarzyna Buszko, Krzysztof Stefański
Venue: Open Systems Information Dynamics (2003)

The paper contains results of numerical experiments on evolution generated by logistic maps inside periodic windows and in their vicinity. We study properties of dynamics in terms of rambling time inside periodic windows and duration of the non-laminar phase in their proximity, showing that a close relation between these two notions exists. We also give results of numerical experiments on map-generated evolution of measure on the unit interval.
Near-Horn Prolog and Beyond
Authors: W D Loveland
Venue:  (1988)

Near-Horn Prolog is an extension of Prolog designed to handle disjunction and classical negation. The emphasis here is on minimal change from standard Prolog in regard to notation, derivation form, and speed of inner-loop computation. The procedure is optimized for the input program that is near-Horn; i.e., a program where almost all clauses are definite clauses. This paper goes beyond the near-Horn focus to report on the completeness of one version of nH-Prolog, along with soundness of the procedure. Completeness is important here not only for the usual reasons of guaranteed success on small problems and insight into the behavior of the procedure but also because we anticipate the introduction of negation-as-failure which requires conviction that a proof will be found if a proof exists.