ppxscal/embedding_network huggingface dataset:
Environment-specific novelty detection
Authors: Stephen Marsland, Ulrich Nehmzow, Jonathan Shapiro
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Novelty detection, recognising features that differ from those that are normally seen, is a potentially useful ability for a mobile robot. Once a robot can detect those features that are novel the amount of learning that has to be done can be reduced (as only new things need to be learnt), the attention of the robot can be focused onto the new features, and the robot can be used as an inspection agent.However, features that are novel in one place could be completely normal elsewhere - for example, tables and chairs are usually seen in offices, but very rarely seen in corridors. This paper suggests a method by which a set of novelty filters can be trained for different environments and the correct filter autonomously selected for the environment that the robot is currently travelling in. The method can also extend itself, so that further environments that are seen by the robot can be added without any retraining.
An invariance principle for nonlinear hybrid and impulsive dynamical systems
Authors: VijaySekhar Chellaboina, Sanjay P. Bhat, Wassim M. Haddad
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

In this paper we develop an invariance principle for dynamical systems possessing left-continuous flows. Specifically, we show that left-continuity of the system trajectories in time for each fixed state point and continuity of the system trajectory in the state for every time in some dense subset of the semi-infinite interval are sufficient for establishing an invariance principle for hybrid and impulsive dynamical systems. As a special case of this result we state and prove new invariant set stability theorems for a class of nonlinear impulsive dynamical systems; namely, state-dependent impulsive dynamical systems. These results provide less conservative stability conditions for impulsive systems as compared to classical results in the literature and allow us to address the stability of limit cycles and periodic orbits of impulsive systems.
Timing-driven placement using design hierarchy guided constraint generation
Authors: Xiaojian Yang, Bo-Kyung Choi, Majid Sarrafzadeh
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Design hierarchy plays an important role in timing-driven placement for large circuits. In this paper, we present a new methodology for delay budgeting based timing-driven placement. A novel slack assignment approach is described as well as its application on delay budgeting with design hierarchy information. The proposed timing-driven placement flow is implemented into a placement tool named Dragon (timing-driven mode), and evaluated using an industrial place and route flow. Compared to Cadence QPlace, timing-driven Dragon generates placement results with shorter clock cycle and better routability.
An evaluation of online learning environments(OLE) on the adult at-risk population
Authors: Eli J. Weissman
Venue: Journal of Computing Sciences in Colleges (2003)

This paper deals with the evaluation of an Online Learning Environment(OLE) paradigm as it pertains to adult at-risk groups. Adult at-risk groups are classified as • Graduates of urban high schools • People who are being forced to work longer because of the change in retirement laws • The recent plethora of immigrants from 3rd world countries • People who have reentered the work force after years of child caring and/or elder care • People who reside in remote areas where educational and research opportunities are limited • Females OLE students tend to have trouble competing in an educational setting because • Many OLE students are older, have jobs, and families. • Students are interested in obtaining a degree for a better job or are retraining to retain employment with their present employer • Distance education often isolates the student. This isolation removes motivational factors that involving a peer group. Additionally distance education students are usually of very diverse backgrounds • Older students are generally not computer literate and thus have to conquer the course work and the delivery vehicle
Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs
Authors: Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The arrangement graph A_{n,k}, which is a generalization of the star graph (n-k=1), presents more flexibility than the star graph in adjusting the major design parameters: number of nodes, degree, and diameter. Previously the arrangement graph has proven hamiltonian. In this paper we further show that the arrangement graph remains hamiltonian even if it is faulty. Let |F_{e}| and |F_{v}| denote the numbers of edge faults and vertex faults, respectively. We show that A_{n,k} is hamiltonian when (1) (k=2 and n-k\geq 4, or k\geq 3 and n-k\geq 4+\lceil \frac{k}{2}\rceil), and |F_{e}|\leq k(n-k)-2, or (2) k\geq 2, n-k\geq 2+\lceil \frac{k}{2}\rceil, and |F_{e}|\leq k(n-k-3)-1, or (3) k\geq 2, n-k\geq 3, and |F_{e}|\leq k.
A neural-network-based approach to the double traveling salesman problem
Authors: Alessio Plebe, Angelo Marcello Anile
Venue: Neural Computation (2002)

The double traveling salesman problem is a variation of the basic traveling salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function.The proposed solution is based on a self-organizing map structure, initialized with as many artificial neurons as the number of targets to be reached. One of the key components of the process is the combination of competitive relaxation with a mechanism for deleting and creating artificial neurons. Moreover, in the competitive relaxation process, information about the trajectory connecting the neurons is combined with the distance of neurons from the target. This strategy prevents tangles in the trajectory and collisions between the two tours. Results of tests indicate that the proposed approach is efficient and reliable for harvest sequence planning. Moreover, the enhancements added to the pure self-organizing map concept are of wider importance, as proved by a traveling salesman problem version of the program, simplified from the double version for comparison.
Conditions for the evolution of mimicry
Authors: Daniel W. Franks, Jason Noble
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Mimicry is a poorly understood phenomenon; we present a simulation of the evolution of both Batesian (parasitic) and Müllerian (mutualistic) mimicry. In the model, multiple species are preyed upon by a single abstract predator; the appearance of each prey species can evolve but their palatability is fixed. Batesian mimicry evolves regardless of the initial phenotypic distance between the two species, whereas Müllerian mimicry requires an initial resemblance, except when a third (Batesian) species is present.
Control and identification of non-linear systems affected by noise using wavelet network
Authors: Smriti Srivastava, Madhusudan Singh, M. Hanmandlu
Venue: Second international workshop on Intelligent systems design and application (2002)

The present work demonstrates an application to approximate, control and denoise a continuous non-linear signal, using wavelet coefficients and neural network. Adaptive Least mean square (∞-LMS)algorithm is used for the parameter adjustment, and wavelet coefficients are used for making the system fast and denoising it. Neural networks have been established as a general approximation tool for fitting nonlinear models from input/output data. On the other hand, the recently introduced wavelet decomposition emerges as a new powerful tool for approximation. The procedure for the wavelet based adaptive control remains the same as for neural network only the concept of compression and denoising the reference signal is adopted. In the adaptive control, identification of plant is done offline and adjustments of controller parameters are performed on-line. The effectiveness of the proposed wavelet neural network architecture as applied to the Identification and control of unknown non-linear systems is discussed and extensive simulation results are presented.
Approximating completion time distribution function for stochastic pert networks
Authors: S. M. T. Fatemi Ghomi, M. Rabbani
Venue: Iranian Journal of Science and Technology (2001)

In this paper an approach to approximate completion time distribution function (CTDF) for stochastic PERT networks is presented. This approach is made with most critical path (MCP) definition and a renewal process. In some cases, the results of this approach is better than Soroush's algorithm that uses only MCP for computation of CTDF. Numerical examples are given and conclusions are made.
Development of the first sensory-motor stages: a contribution to imitation
Authors: Pierre Andry, Philippe Gaussier, Jacqueline Nadel
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

We present the first stages of the developmental course of a robot using vision and a 5 degree of freedom robotic arm. During an exploratory behavior, the robot learns autonomously the visuomotor control of its mechanical arm. We show how a neural network architecture, combining elementary vision, a self-organized algorithm, and dynamical Neural Fields is able to learn and use proper associations between vision and arm movements, even if the problem is ill posed. We show as a robotic result that the architecture can be used as a basis for simple gestural imitations.
Optimal a priori error bounds for the Rayleigh-Ritz method
Authors: Gerard L. G. Sleijpen, Jasper van den Eshof, Paul Smit
Venue: Mathematics of Computation (2003)

We derive error bounds for the Rayleigh-Ritz method for the approximation to extremal eigenpairs of a symmetric matrix. The bounds are expressed in terms of the eigenvalues of the matrix and the angle between the subspace and the eigenvector. We also present a sharp bound.
The Effects of Time Pressure on Quality in Software Development: An Agency Model
Authors: Robert D. Austin
Venue: Information Systems Research (2001)

An agency framework is used to model the behavior of software developers as they weigh concerns about product quality against concerns about missing individual task deadlines. Developers who care about quality but fear the career impact of missed deadlines may take "shortcuts." Managers sometimes attempt to reduce this risk via their deadline-setting policies; a common method involves adding slack to best estimates when setting deadlines to partially alleviate the time pressures believed to encourage shortcut-taking. This paper derives a formal relationship between deadline-setting policies and software product quality. It shows that: (1) adding slack does not always preserve quality, thus, systematically adding slack is an incomplete policy for minimizing costs; (2) costs can be minimized by adopting policies that permit estimates of completion dates and deadlines that are different and; (3) contrary to casual intuition, shortcut-taking can be eliminated by setting deadlines aggressively, thereby maintaining or even increasing the time pressures under which developers work.
Augmented reality for manufacturing planning
Authors: F. Doil, W. Schreiber, T. Alt, C. Patron
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

The shortening of development cycles demand for efficient methods and tools for the planning of complex production systems. Recently immersive Virtual Reality technologies have been introduced to the manufacturing planning functions. This has lead to a decrease in planning times as well as to the improvement of the quality of planning results. The introduction of various virtual planning tools is targeting the complete integration of all planning tasks and demands an intuitive interaction with complex computer models of machinery, factory-layouts etc. Known methods and tools are limited to a purely virtual representation of planning objects and thus require the complete modeling of the production system. The high costs reduce the possible benefits of these tools and this technology in general. New potential for the improvement of the industrial planning process are offered by the AR-technology. Using AR-techniques an physically existing production environment can be superimposed with virtual planning objects. Planning tasks can thus be validated without modeling the surrounding environment of the production site. In this contribution we discuss the support of manufacturing planning tasks with the Augmented Reality technology. We present potential benefits and describe the development of an prototypical AR-System for the support of planning tasks.
Semantic Minimization of 3-Valued Propositional Formulae
Authors: Thomas W. Reps, Alexey Loginov, Mooly Sagiv
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite) information. By replacing a formula \varphi with a "better" formula \psi, we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is "best" (in a certain well-defined sense).
Efficient visualization of large medical image datasets on standard PC hardware
Authors: V. Pekar, D. Hempel, G. Kiefer, M. Busch, J. Weese
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

Fast and accurate algorithms for medical image processing and visualization are becoming increasingly important due to routine acquisition and processing of rapidly growing amounts of data in clinical practice. At the same time, standard computer hardware is becoming sufficiently powerful to be used in applications which previously required expensive and inflexible special-purpose hardware. We present an efficient volume rendering approach using the example of maximum intensity projection (MIP), which is an important clinical tool. The method systematically exploits the properties of general-purpose hardware such as hierarchical cache memories and super-scalar processing. In order to optimize the cache efficiency, the dataset is processed in blocks which fit into the processor cache. The innermost ray casting loop is transformed such that the arithmetic operations and memory accesses can be processed in parallel on current general-purpose processors. Combined with other optimization strategies, such as vectorization and block-wise ray skipping, this approach yields near-interactive frame rates for large clinical datasets using a standard dual-processor PC. Data compression and simplification methods have intentionally not been used in order to demonstrate the achievable performance without any quality reductions. Some of the presented ideas can be applied to other computationally intensive image processing tasks.
The double gamma function and related pick functions
Authors: Henrik L. Pedersen
Venue: Journal of Computational and Applied Mathematics (2003)

Denoting by G the Barnes double gamma function we find the Stieltjes representation of the related Pick function z ↦ (log G(z +1))/(z2 Log z). As a corollary we obtain that this function has a completely monotone derivative on the positive half line.
Some conjectures on primes (III)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2002)

For any positive integer n, let pn be the nth prime. In this paper we prove that the equality (√pn - log pn+1)/(√pn+1 - logpn)≥(√3 - log5)/(√5 - log3)for any n.
High performance sparse static solver in finite element analyses with loop-unrolling
Authors: Pu Chen, Dong Zheng, Shuli Sun, Mingwu Yuan
Venue: Advances in Engineering Software (2003)

Symmetric positive definite equation solvers play a very important role in promoting the efficiency of the finite element analyses (FEA). The focus of this paper is to describe a new storage scheme--cell-sparse storage scheme--and the corresponding algorithm of the direct symmetric positive definite equation solver in FEA. Loop-unrolling (or simply unrolling) techniques are incorporated into sparse solvers to enhance the vector speed. Sparse storage schemes, out-of-core strategy, and numerical factorization are discussed. The performance in terms of elapsed time and memory requirement of different solvers are demonstrated by finding static displacement vectors for practical engineering problems. Numerical tests indicate that the cell-sparse storage scheme and the two-level unrolling can improve the performance of symmetric positive definite equation solvers significantly.
An H-form variant of the partitioned QN method
Authors: M. B. Reed
Venue: Applied Numerical Mathematics (2003)

This paper introduces a technique for transforming partitioned quasi-Newton algorithms into H-form algorithms. The resulting algorithms have essentially the same space requirements as the standard partitioned QN method, but involve only a global matrix-vector multiplication (rather than a global solution by conjugate gradients) at each iteration. Results demonstrate that the method, which is highly suitable for parallelization, is competitive with other quasi-Newton methods in minimizing partially separable polynomial functions of large dimension.
Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects
Authors: Yuanyuan Yang, Jianchao Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in parallel and distributed computing systems. We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable interconnects. It is well-known that this type of interconnect has low hardware cost, but can realize only a small portion of all possible permutations between its inputs and outputs in a single pass. In this paper, we consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes. In particular, routing with node-disjoint paths has important applications in the emerging optical interconnects. We employ and further expand the Latin square technique used in the all-to-all personalized exchange algorithms for this class of interconnects for general permutation routing. As can be seen, our implementation of permutation routing is optimal in terms of the number of passes that messages are transmitted through the network, and it is near-optimal in network transmission time for sufficiently long messages. The possibility of adopting a single-stage interconnect is also discussed.
Master/slave speculative parallelization
Authors: Craig Zilles, Gurindar Sohi
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution on a multiprocessor. In MSSP, one processor---the master---executes an approximate version of the program to compute selected values that the full program's execution is expected to compute. The master's results are checked by slave processors that execute the original program. This validation is parallelized by cutting the program's execution into tasks. Each slave uses its predicted inputs (as computed by the master) to validate the input predictions of the next task, inductively validating the entire execution.The performance of MSSP is largely determined by the execution rate of the approximate program. Since approximate code has no correctness requirements (in essence it is a software value predictor), it can be optimized more effectively than traditionally generated code. It is free to sacrifice correctness in the uncommon case to maximize performance in the common case.A simulation-based evaluation of an initial MSSP implementation achieves speedups of up to 1.7 (harmonic mean 1.25) on the SPEC2000 integer benchmarks. Performance is currently limited by the effectiveness with which our current automated infrastructure approximates programs, which can likely be improved significantly.
Older-first garbage collection in practice: evaluation in a Java Virtual Machine
Authors: Darko Stefanović, Matthew Hertz, Stephen M. Blackburn, Kathryn S. McKinley, J. Eliot B. Moss
Venue: ACM SIGPLAN Notices (2003)

Until recently, the best performing copying garbage collectors used a generational policy which repeatedly collects the very youngest objects, copies any survivors to an older space, and then infrequently collects the older space. A previous study that used garbage-collection simulation pointed to potential improvements by using an Older-First copying garbage collection algorithm. The Older-First algorithm sweeps a fixed-sized window through the heap from older to younger objects, and avoids copying the very youngest objects which have not yet had sufficient time to die. We describe and examine here an implementation of the Older-First algorithm in the Jikes RVM for Java. This investigation shows that Older-First can perform as well as the simulation results suggested, and greatly improves total program performance when compared to using a fixed-size nursery generational collector. We further compare Older-First to a flexible-size nursery generational collector in which the nursery occupies all of the heap that does not contain older objects. In these comparisons, the flexible-nursery collector is occasionally the better of the two, but on average the Older-First collector performs the best.
Kolmogorov's Contributions to the Foundations of Probability
Authors: V. G. Vovk, G. R. Shafer
Venue: Problems of Information Transmission (2003)

Andrei Nikolaevich Kolmogorov was the foremost contributor to the mathematical and philosophical foundations of probability in the twentieth century, and his thinking on the topic is still potent today. In this article we first review the three stages of Kolmogorov's work on the foundations of probability: (1) his formulation of measure-theoretic probability, 1933; (2) his frequentist theory of probability, 1963; and (3) his algorithmic theory of randomness, 1965&ndash;1987. We also discuss another approach to the foundations of probability, based on martingales, which Kolmogorov did not consider.
An engineering data access system for a finite element program
Authors: Jun Peng, David Liu, Kincho H. Law
Venue: Advances in Engineering Software (2003)

This paper describes a prototype implementation of an engineering data access system for a finite element analysis (FEA) program. The system incorporates a commercial off-the-shelf (COTS) database as the backend to store selected analysis results; and the Internet is utilized as the communication channel to access the analysis results. The objective of using an engineering database is to provide the users the needed engineering information from readily accessible sources in a ready-to-use format for further manipulation. Three key issues regarding the engineering data access system are discussed, including data modeling, data representation, and data retrieval. The engineering data access system gives great flexibility and extendibility to the data management in finite element programs and can provide additional features to enhance the applicability of FEA software.