ppxscal/embedding_network huggingface dataset:
A Variational Approach to Adaptive Correlation for Motion Estimation in Particle Image Velocimetry
Authors: Florian Becker, Bernhard Wieneke, Jing Yuan, Christoph Schnörr
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In particle image velocimetry (PIV) a temporally separated image pair of a gas or liquid seeded with small particles is recorded and analysed in order to measure fluid flows therein. We investigate a variational approach to cross-correlation, a robust and well-established method to determine displacement vectors from the image data. A "soft" Gaussian window function replaces the usual rectangular correlation frame. We propose a criterion to adapt the window size and shape that directly formulates the goal to minimise the displacement estimation error. In order to measure motion and adapt the window shapes at the same time we combine both sub-problems into a bi-level optimisation problem and solve it via continuous multiscale methods. Experiments with synthetic and real PIV data demonstrate the ability of our approach to solve the formulated problem. Moreover window adaptation yields significantly improved results.
Fast-Maneuvering Target Seeking Based on Double-Action Q-Learning
Authors: Daniel C. Ngai, Nelson H. Yung
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In this paper, a reinforcement learning method called DAQL is proposed to solve the problem of seeking and homing onto a fast maneuvering target, within the context of mobile robots. This Q-learning based method considers both target and obstacle actions when determining its own action decisions, which enables the agent to learn more effectively in a dynamically changing environment. It particularly suits fast-maneuvering target cases, in which maneuvers of the target are unknown a priori. Simulation result depicts that the proposed method is able to choose a less convoluted path to reach the target when compared to the ideal proportional navigation (IPN) method in handling fast maneuvering and randomly moving target. Furthermore, it can learn to adapt to the physical limitation of the system and do not require specific initial conditions to be satisfied for successful navigation towards the moving target.
Fusion of Neural Gas
Authors: Sebastián Moreno, Héctor Allende, Rodrigo Salas, Carolina Saavedra
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

One of the most important feature of the Neural Gas is its ability to preserve the topology in the projection of highly dimensional input spaces to lower dimensions vector quantizations. For this reason, the Neural Gas has proven to be a valuable tool in data mining applications.In this paper an incremental ensemble method for the combination of various Neural Gas models is proposed. Several models are trained with bootstrap samples of the data, the "codebooks" with similar Voronoi polygons are merged in one fused node and neighborhood relations are established by linking similar fused nodes. The aim of combining the Neural Gas is to improve the quality and robustness of the topological representation of the single model. We have called this model Fusion-NG.Computational experiments show that the Fusion-NG model effectively preserves the topology of the input space and improves the representation of the single Neural Gas model. Furthermore, the Fusion-NG explicitly shows the neighborhood relations of it prototypes. We report the performance results using synthetic and real datasets, the latter obtained from a benchmark site.
Fault Tolerance Achieved in VLSI
Authors: Richard Emmerson, Michael McGowan
Venue: IEEE Micro (1984)

This quad-modular redundant system offers a cost-effective alternativefor supporting fault tolerance by incorporating hardware/software independence and five redundancy mechanisms to correct both transient and permanent errors.
Passive analysis of TCP anomalies
Authors: Marco Mellia, Michela Meo, Luca Muscariello, Dario Rossi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper, we focus on passive measurements of TCP traffic. We propose a heuristic technique to classify TCP anomalies, i.e., segments that have a sequence number different from the expected one, such as out-of-sequence and duplicate segments. Since TCP is a closed-loop protocol that infers network conditions from packet losses and reacts accordingly, the possibility of carefully distinguishing the causes of anomalies in TCP traffic is very appealing and may be instrumental to understand TCP behavior in real environments. We apply the proposed heuristic to traffic traces collected at both network edges and backbone links. By comparing results obtained from traces collected over several years, we observe some phenomena such as the impact of the introduction of TCP SACK which reduces the unnecessary retransmissions, the large percentage of network reordering, etc. By further studying the statistical properties of TCP anomalies, we find that, while their aggregate exhibits long-range dependence, anomalies suffered by individual long-lived flows are on the contrary uncorrelated. Interestingly, no dependence on the actual link load is observed.
Dynamic Feature Cascade for Multiple Object Tracking with Trackability Analysis
Authors: Zheng Li, Haifeng Gong, Song-Chun Zhu, Nong Sang
Venue: Proceedings of the 6th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2007)

In multiple object tracking, the confusion caused by occlusion and similar appearances is an important issue to be solved. In this paper, trackability is proposed to measure how well given features can be used to find the correspondence of any given object in videos with multiple objects. Based on the analysis of trackability and computational complexity of the features under various occlusion conditions, a dynamic feature method cascade is presented to match the objects in consecutive frames. The cascade is composed of three tracking features: appearance, velocity and position. These features are enabled or disabled online to reduce computational complexity while obtaining similar trackability.Experiments are conducted on 27062 frame occlusion objects, in the cases of good trackability, our experiments can obtain high succussful tracking rate with low computation burden, and in the cases of poor trackability, our estimation of trackability and confusion matrix can explain why they can not be tracked well.
Building an Index of Nanomedical Resources: An Automatic Approach Based on Text Mining
Authors: Stefano Chiesa, Miguel García-Remesal, Guillermo Calle, Diana Iglesia, Vaida Bankauskaite, Víctor Maojo
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Nanomedicine is an emerging discipline aimed to applying recent developments in nanotechnology to the medical domain. In recent years, there has been an exponential growth of the number of available nanomedical resources. The latter are aimed to different tasks and include databases, nanosensors, implantable materials, etc. This leads to the necessity of creating new methods to automatically organize such resources depending on their provided functionalities. In this paper we will first present a brief overview on the nanomedical discipline and its related technologies. Next we will introduce a method targeted to the automated creation of an index of nanomedical resources. This method is based on an existing approach to automatically build an index of biomedical resources from research papers using text mining techniques. We believe that such an index would be a valuable tool to foster the research on nanomedicine. This is an example of application in the new area of Nanoinformatics.
Multi-completion with Termination Tools (System Description)
Authors: Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

In this paper we describe a new tool for performing Knuth-Bendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for completion with multiple reduction orderings introduced by Kurihara and Kondo (1999) and (2) the inference system for completion with external termination provers proposed by Wehrman, Stump and Westbrook (2006) and implemented in the Slothrop system. Our tool can be used with any termination tool that satisfies certain minimal requirements. Preliminary experimental results show the potential of our tool.
PFC: Transparent Optimization of Existing Prefetching Strategies for Multi-Level Storage Systems
Authors: Zhe Zhang, Kyuhyung Lee, Xiaosong Ma, Yuanyuan Zhou
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

The multi-level storage architecture has been widely adopted in servers and data centers. However, while prefetching has been shown as a crucial technique to exploit the sequentiality in accesses common for such systems and hide the increasing relative cost of disk I/O, existing multi-level storage studies have focused mostly on cache replacement strategies. In this paper, we show that prefetching algorithms designed for single-level systems may have their limitations magnified when applied to multi-level systems. Overly conservative prefetching will not be able to effectively use the lower-level cache space, while overly aggressive prefetching will be compounded across levels and generate large amounts of wasted prefetch. We take an innovative approach to this problem: rather than designing a new, multi-level prefetching algorithm, we developed PreFetching-Coordinator (PFC), a hierarchy-aware optimization applicable to any existing prefetching algorithms. PFC does not require any application hints, a priori knowledge on the application access pattern or the native prefetching algorithm, or modification to the I/O interface. Instead, it monitors the upper-level access patterns as well as the lower-level cache status, and dynamically adjusts the aggressiveness of the lower-level prefetching activities. We evaluated PFC with extensive simulation study using a verified multi-level storage simulator, an accurate disk simulator, and access traces with different access patterns. Our results indicate that PFC dynamically controls lower-level prefetching in reaction to multiple system and workload parameters, improving the overall system performance in all 96 test cases. Working with four well-known existing prefetching algorithms adopted in real systems, PFC obtains an improvement of up to 35% to the average request response time, with an average improvement of 14.6% over all cases.
Compiler-Enhanced Incremental Checkpointing
Authors: Greg Bronevetsky, Daniel Marques, Keshav Pingali, Radu Rugina
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety of causes. Checkpointing is a popular technique for tolerating such failures in that it allows applications to periodically save their state and restart the computation after a failure. Although a variety of automated system-level checkpointing solutions are currently available to HPC users, manual application-level checkpointing remains by far the most popular approach because of its superior performance. This paper focuses on improving the performance of automated checkpointing via a compiler analysis for incremental checkpointing. This analysis is shown to significantly reduce checkpoint sizes (upto 78%) and to enable asynchronous checkpointing.
Enrichment of European Digital Resources by Federating Regional Digital Libraries in Poland
Authors: Agnieszka Lewandowska, Cezary Mazurek, Marcin Werla
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

In this paper we present the PIONIER Network Digital Libraries Federation, which was founded in the June 2007 in Poland. This federation is a single point of access to the majority of Polish digital resources gathered in regional and institutional digital libraries. Besides of the resources aggregation and promotion this service also allows for automated coordination of digitization and PURL resolution of OAI identifiers for objects from Polish digital libraries. It is also a part of networked digital library user profile system enabled recently in the Polish network of distributed digital libraries. During the development of the PIONIER Network Digital Libraries Federation extensions for OAI-PMH protocol and Shibboleth middleware were made and deployed in order to achieve required federation functionality. The PIONIER DLF service is based on the set of distributed atomic services giving together its functionality.
Convex Hulls of Point-Sets and Non-uniform Hypergraphs
Authors: Hanno Lefmann
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

For fixed integers k ¿ 3 and hypergraphs ${\mathcal G}$ on N vertices, which contain edges of cardinalities at most k, and are uncrowded, i.e., do not contain cycles of lengths 2,3, or 4, and with average degree for the i-element edges bounded by O(T i ¿ 1 ·(ln T)(k ¿ i)/(k ¿ 1)), i = 3, ..., k, for some number T ¿ 1, we show that the independence number $\alpha ({\mathcal G})$ satisfies $\alpha ({\mathcal G}) = \Omega ((N/T) \cdot (\ln T)^{1/(k-1)})$. Moreover, an independent set I of size |I| = ¿((N/T) ·(ln T)1/(k ¿ 1)) can be found deterministically in polynomial time. This extends a result of Ajtai, Komlós, Pintz, Spencer and Szemerédi for uncrwoded uniform hypergraphs. We apply this result to a variant of Heilbronn's problem on the minimum area of the convex hull of small sets of points among n points in the unit square [0,1]2.
A type-preserving compiler in Haskell
Authors: Louis-Julien Guillemette, Stefan Monnier
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants, in order to capture important invariants of the program in the types. This allows type-based program verification and is a promising compromise between plain old types and full blown Hoare logic proofs. The introduction of GADTs in GHC (and more recently type families) made such dependent typing available in an industry-quality implementation, making it possible to consider its use in large scale programs. We have undertaken the construction of a complete compiler for System F, whose main property is that the GHC type checker verifies mechanically that each phase of the compiler properly preserves types. Our particular focus is on "types rather than proofs": reasonably few annotations that do not overwhelm the actual code. We believe it should be possible to write such a type-preserving compiler with an amount of extra code comparable to what is necessary for typical typed intermediate languages, but with the advantage of static checking. We will show in this paper the remaining hurdles to reach this goal.
A rigorous methodology for security architecture modeling and verification
Authors: Yomna Ali, Sherif El-Kassas
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Few attempts have been made at defining a formal and traceable relationship for integrating security in all phases of analysis, modeling, and verification of software systems. In this paper, we propose a rigorous methodology for utilizing threat modeling in building secure software architectures using SAM (Software Architecture Modeling framework) and verifying them formally using Symbolic Model Checking. Security mitigations suggested by the threat model are expressed as constraints over a high-level SAM model and are used to refine it into a secure constrained model. We also, propose a translation from SAM Secure models into the SMV model checker where the threats and the elicited security properties from the threat modeling process are used as inputs to the verification phase as well. This method is developed with the aim of bridging the gap between informal security requirements and their formal representation and verification.
Building a Digital Research Community in the Humanities
Authors: Toby Burrows, Ela Majocha
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The ARC Network for Early European Research (NEER), funded under the Australian Research Council's Research Networks programme, aims to enhance the scale of Australian research in medieval and early modern studies, and to build collaborative and innovative approaches to planning and managing research. An integral part of NEER's vision is the development of a digital environment which provides a setting for the work of this national research community. This environment has three major components: the Confluence collaborative Web workspace, the PioNEER digital repository for research outputs and data, and the Europa Inventa gateway to cultural heritage objects.
Existence of positive solutions for second order functional differential equations
Authors: F. H. Wong, S. P. Wang, T. G. Chen
Venue: Computers Mathematics with Applications (2008)

We afford a existence criterion of positive solutions of a boundary value problem concerning a second order functional differential equation by using the Krasnoselskii fixed point theorem on cones in Banach spaces. Moreover, we also apply our results to establish several existence theorems of multiple positive solutions for some functional differential equations.
Dense Fast Random Projections and Lean Walsh Transforms
Authors: Edo Liberty, Nir Ailon, Amit Singer
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Random projection methods give distributions over k ×d matrices such that if a matrix ¿ (chosen according to the distribution) is applied to a vector the norm of the resulting vector, , is up to distortion ¿ equal to the norm of x w.p. at least 1 ¿ ¿. The Johnson Lindenstrauss lemma shows that such distributions exist over dense matrices for k (the target dimension) in . Ailon and Chazelle and later Matousek showed that there exist entry-wise i.i.d. distributions over sparse matrices ¿ which give the same guaranties for vectors whose ¿ ¿ is bounded away from their ¿2 norm. This allows to accelerate the mapping x¿¿x. We claim that setting ¿ as any column normalized deterministic dense matrix composed with random ±1 diagonal matrix also exhibits this property for vectors whose ¿ p (for any p > 2) is bounded away from their ¿2 norm. We also describe a specific tensor product matrix which we term lean Walsh. It is applicable to any vector in in O(d) operations and requires a weaker ¿ ¿ bound on x then the best current result, under comparable running times, using sparse matrices due to Matousek.
Coevolution of Neuro-developmental Programs That Play Checkers
Authors: Gul Muhammad Khan, Julian F. Miller, David M. Halliday
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

This paper presents a method for co-evolving neuro-inspired developmental programs for playing checkers. Each player's program is represented by seven chromosomes encoding digital circuits, using a form of genetic programming, called Cartesian Genetic Programming (CGP). The neural network that occurs by running the genetic programs has a highly dynamic morphology in which neurons grow, and die, and neurite branches together with synaptic connections form and change in response to situations encountered on the checkers board. The results show that, after a number of generations, by playing each other the agents play much better than those from earlier generations. Such learning abilities are encoded at a genetic level rather than at the phenotype level of neural connections.
The Algorithm Design Manual, 2nd edition
Authors: Steven S. Skiena
Venue:  (2008)

....The most comprehensive guide to designing practical and efficient algorithms!.... The Algorithm Design Manual, Second Edition "...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews "It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources."-- P. Takis Metaxas, Wellesley College "This is the most approachable book on algorithms I have." -- Megan Squire, Elon University, USA This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding onthe first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instructionon methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: Doubles the tutorial material and exercises over the first edition Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them Includes several NEW "war stories" relating experiences from real-world applications Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java ADDITIONAL Learning Tools: Exercises include "job interview problems" from major software companies Highlighted take-home lesson boxes emphasize essential concepts Provides comprehensive references to both survey articles and the primary literature Exercises points to relevant programming contest challenge problems Many algorithms presented with actual code (written in C) as well as pseudo-code A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.