ppxscal/embedding_network huggingface dataset:
Computing visibility on terrains in external memory
Authors: Herman Haverkort, Laura Toma, Yi Zhuang
Venue: Journal of Experimental Algorithmics (JEA) (2009)

Given an arbitrary viewpoint v and a terrain, the visibility map or viewshed of v is the set of points in the terrain that are visible from v. In this article we consider the problem of computing the viewshed of a point on a very large grid terrain in external memory. We describe algorithms for this problem in the cache-aware and cache-oblivious models, together with an implementation and an experimental evaluation. Our algorithms are a novel application of the distribution sweeping technique and use O(sort(n)) I/Os, where sort(n) is the complexity of sorting n items of data in the I/O-model. The experimental results demonstrate that our algorithm scales up and performs significantly better than the traditional internal-memory plane sweep algorithm and can compute visibility for terrains of 1.1 billion points in less than 4 hours on a low-cost machine compared to more than 32 hours with the internal-memory algorithm.
Magnetic reproducer and printer
Authors: John C. Sims,  Jr.
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

The rapid development of business systems during the past few years has at the same time called attention to some rather serious limitations in mechanical and photographic methods for the production of printed copy. Modern electronic computing machines can process data and produce results in tremendous quantity. Moreover, the operation of large business organizations creates a problem in the dissemination of information within themselves that is not always economically solved by existing equipment.
Progressive Cut: An Image Cutout Algorithm that Models User Intentions
Authors: Qiong Yang, Chao Wang, Xiaoou Tang, Mo Chen, Zhongfu Ye
Venue: IEEE MultiMedia (2007)

To give users more control over image segmentation and extraction, we propose the progressive-cut algorithm, which explicitly models the user's intention in a graph-cut framework. Because we incorporate three aspects of user intention into an object cutout system, our algorithm lets users work with fewer strokes, achieving faster and more accurate visual feedback.
Zero Downtime Reconfiguration of Distributed Automation Systems: The εCEDAC Approach
Authors: Martijn N. Rooker, Christoph Sünder, Thomas Strasser, Alois Zoitl, Oliver Hummer, Gerhard Ebenhofer
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Future manufacturing is envisioned to be highly flexible and adaptable. New technologies for reconfigurable systems and their adaptations are preconditions for this vision. Without such solutions, engineering adaptations of Industrial Process Measurement and Control Systems (IPMCS) will exceed the costs of engineered systems by far and the reuse of equipment will become inefficient. Especially the reconfiguration of control applications is not sufficiently solved. This paper gives an overview of the use of reconfiguration applications for downtimeless system evolution of control applications on basis of the standard IEC 61499. A new approach for the reconfiguration of IEC 61499 based control application and the corresponding modeling is discussed. This new method significantly increases engineering efficiency and reuse in component-based IPMCS.
Extending Inconsistency-Tolerant Integrity Checking by Semantic Query Optimization
Authors: Hendrik Decker
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

The premise that all integrity constraints be totally satisfied guarantees the correctness of methods for simplified integrity checking, and of semantic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.
Recognition of video sequences using low frequencies and color information
Authors: Julia Åhlén, David Sundgren
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

This paper presents a method for descriptive feature matching between two video streams of the same scene. The second video is a corrupted copy of the first video. Examples of reliable recognition of an original scene that is subjected for compression and noise are presented. The algorithm is invariant to image scale and rotation, providing robust matching across a substantial range of video signals. This paper shows an approach to using descriptive features for randomly chosen frames from video stream. By involving color information as a feature we increase the robustness of the identification process. The median of low frequencies is measured, followed by an average of spectral information from the same frame to identify clusters belonging to a scene in a film. Finally, a comparison analysis is done to verify the originality of the film.
Some identities on the Catalan, Motzkin and Schröder numbers
Authors: Eva Y. P. Deng, Wei-Jun Yan
Venue: Discrete Applied Mathematics (2008)

In this paper, some identities between the Catalan, Motzkin and Schroder numbers are obtained by using the Riordan group. We also present two combinatorial proofs for an identity related to the Catalan numbers with the Motzkin numbers and an identity related to the Schroder numbers with the Motzkin numbers, respectively.
Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library
Authors: Changbo Chen, François Lemaire, Marc Moreno Maza, Wei Pan, Yuzhen Xie
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

We present new functionalities that we have added to the RegularChains library in Maple to efficiently compute irredundant triangular decompositions. We report on the implementation of different strategies. Our experiments show that, for difficult input systems, the computing time for removing redundant components can be reduced to a small portion of the total time needed for solving these systems.
Borph: an operating system for fpga-based reconfigurable computers
Authors: Robert Brodersen
Venue:  (2007)

Reconfigurable computing is a promising technology to meet future computational demand by leveraging flexibilities and the high degree of parallelism found in reconfigurable hardware fabrics, such as field programmable gate arrays (FPGAs). However, despite their promising performance researchers have demonstrated, reconfigurable computers are yet to be widely adopted. One reason is the lack of a common and intuitive operating system for these platforms. This dissertation work explores the design and implementation trade-offs of an operating system for FPGA-based reconfigurable computers, BORPH, the Berkeley Operating system for ReProgrammable Hardware. The goal of this work is to explore and demonstrate the feasibility of providing a systematic and easy to understand view into reconfigurable computers through OS support without incurring significant performance penalties. BORPH provides kernel support for FPGA applications by extending a standard Linux operating system. It establishes the notion of hardware process for executing user FPGA applications. Users therefore compile and execute hardware designs on FPGA resources the same way they run software programs on conventional processor-based systems. BORPH offers run-time general file system support to hardware processes as if they were software. The unified file interface allows hardware and software processes to communicate via standard UNIX file pipes. Furthermore, a virtual file system is built to allow access to memories and registers defined in the FPGA, providing communication links between hardware and software. The functions of BORPH are demonstrated on a BEE2 compute module. Performances of BORPH are measured to identify bottlenecks of our system. The clean OS kernel/user separation of BORPH has allowed us to improve overall system performance without affecting existing user designs. Furthermore, BORPH's unified runtime environment has enabled designers to make fair and end-to-end comparisons among software/hardware implementations of the same application. Most importantly, since the introduction of BORPH to our FPGA-based platform, we have observed increased productivity among high-level application developers who have little experience in FPGA application design.
Learning Network Topology from Simple Sensor Data
Authors: Dimitri Marinakis, Philippe Giguère, Gregory Dudek
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this problem, our technique operates on timestamp free observational data; i.e. no timing information is exploited by our algorithm except the ordering. We first give a theoretical analysis of this version of the problem, and then we show that by considering a sliding window over the observations, the problem can be re-formulated as a version of set-covering. We present two heuristics based on this set-covering formulation and evaluate them with numerical simulations. The experiments demonstrate that promising results can be obtained using a greedy algorithm.
Guest Editors' Introduction: E-Voting Security
Authors: David L. Dill, Aviel D. Rubin
Venue: IEEE Security and Privacy (2004)

In the future, we hope to see better voting machines that reduce the trust required in the software component and provide voters with confidence. Several states, such as California and Nevada, have already declared that voter verifiability will be part of any machine they use. We hope this positive trend will continue.
Enhancing Elicitation Technique Selection Process in a Cooperative Distributed Environment
Authors: Hakim Bendjenna, Nacereddine Zarour, Pierre-Jean Charrel
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

Requirements elicitation is a key stage in the successful designing of the computerized information system of a distributed organization. Few works have been focusing on how a requirements analyst selects one of the existing requirements elicitation techniques, notably in a distributed cooperative environment. However, the elicitation technique selection process creates significant communication, coordination, cultural and processes diversity challenges which impact the effectiveness of all the requirements engineering process and, further, product quality. This paper presents a decision making process that allows a requirements analyst to choose an elicitation technique in a cooperative distributed environment based on stakeholders' preferences, linguistic knowledge and priorities.
Ultra reliable computing systems
Authors: Chong Ho Lee
Venue:  (2007)

For high security and safety applications as well as general purpose applications, it is necessary to have ultra reliable computing systems. This dissertation describes our system of self-testable and self-repairable digital devices, especially, EPLDs (Electrically Programmable Logic Devices). In addition to significantly improving the reliability of digital systems, our self-healing and re-configurable system design with added repair capability can also provide higher yields, lower testing costs, and faster time-to-market for the semiconductor industry. The digital system in our approach is composed of blocks, which realize combinational and sequential circuits using GALs (Generic Array Logic Devices). We describe three techniques for fault-locating and fault-repairing in these devices. The methodology we used for evaluation of these methods and a comparison with devices that have no self-repair capability was simulation of the self-repair algorithms. Our simulations show that the lifetime for a GAL-based EPLD that uses our multiple self-repairing methods is longer than the lifetime of a GAL-based EPLD that uses a single self-repair method or no self-repair method. Specifically, our work demonstrates that the lifetime of a GAL can be increased by adding extra columns in the AND array of a GAL and extra output ORs in a GAL. It also gives information on how many extra columns and extra ORs a GAL needs and which self-repairing method should be used to guarantee a given lifetime. Thus, we can estimate an ideal point, where the maximum reliability can be reached with the minimum cost. 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
A Benchmark Comparison of 32-bit Microprocessors
Authors: Thayne Cooper, Wayne Bell, Frank Lin, Norm Rasmussen
Venue: IEEE Micro (1986)

The benchmarking of four 32-bit microprocessors?the MC68020, the NS32032, the AT&T 32100, and the Intel 80386?revealed some specific reasons for the differences in performance that were observed.
Modeling Role-Based Agent Team
Authors: Yu Zhang
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

The problem of ensuring agents work as an effective team in dynamic distributed environments still remains a challenging issue. In this paper we proposed a role-based team model. In our model, the role characterizes the responsibilities and provides logic patterns to achieve certain goals and cooperate with others. The agent is an autonomous execution unit and follows the logic patterns that the role provides. We also developed algorithms and mechanisms to evolve the plan of a role to the plan of an agent. Our role-based team model allows the split of roles (who define the plans) and agents (who execute the plans) in team plans, and dynamic role-agent assignment. It also achieves a certain level of plan reusability. We present two experiments which show plan reusability and its flexibility in supporting simultaneously plan invocation.
Optimal calculation of partial transmission ratios for four-step helical gearboxes with first and third step double gear-sets for minimal gearbox length
Authors: Vu Ngoc Pi
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

This paper presents a new study on the applications of optimization and regression analysis techniques for optimal prediction of partial transmission ratios of four-step helical gearboxes with first and third step double gear-sets for getting minimal gearbox length. In the study, from the condition of moment equilibrium of a mechanic system including gear units and their regular resistance condition, an optimization program for determining the partial ratios of the gearboxes is performed. From the results of the optimization program, explicit models for prediction of the partial ratios are proposed by using regression analysis. Using these models, the prediction of the partial ratios is accurate and simple.
Automatic medical image annotation in ImageCLEF 2007: Overview, results, and discussion
Authors: Thomas Deselaers, Thomas M. Deserno, Henning Müller
Venue: Pattern Recognition Letters (2008)

In this paper, the automatic medical annotation task of the 2007 CLEF cross language image retrieval campaign (ImageCLEF) is described. The paper focusses on the images used, the task setup, and the results obtained in the evaluation campaign. Since 2005, the medical automatic image annotation task exists in ImageCLEF with increasing complexity to evaluate the performance of state-of-the-art methods for completely automatic annotation of medical images based on visual properties. The paper also describes the evolution of the task from its origin in 2005-2007. The 2007 task, comprising 11,000 fully annotated training images and 1000 test images to be annotated, is a realistic task with a large number of possible classes at different levels of detail. Detailed analysis of the methods across participating groups is presented with respect to the (i) image representation, (ii) classification method, and (iii) use of the class hierarchy. The results show that methods which build on local image descriptors and discriminative models are able to provide good predictions of the image classes, mostly by using techniques that were originally developed in the machine learning and computer vision domain for object recognition in non-medical images.
Smallcheck and lazy smallcheck: automatic exhaustive testing for small values
Authors: Colin Runciman, Matthew Naylor, Fredrik Lindblad
Venue: ACM SIGPLAN Notices (2009)

This paper describes two Haskell libraries for property-based testing. Following the lead of QuickCheck, these testing libraries SmallCheck and Lazy SmallCheck also use type-based generators to obtain test-sets of finite values for which properties are checked, and report any counter-examples found. But instead of using a sample of randomly generated values they test properties for all values up to some limiting depth, progressively increasing this limit. The paper explains the design and implementation of both libraries and evaluates them in comparison with each other and with QuickCheck.
Gene-finding with the VOM model
Authors: K. O. Shohat-Zaidenraise, A. Shmilovici, I. Ben-Gal
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

We present the architecture of an elementary gene-finding algorithm that is based on a Variable Order Markov model (VOM). The VOM model is a generalization of the traditional Markov model that can cope with varying memory dependencies. The VOM model is more efficient in terms of its parameterization and therefore can be trained on relatively short sequences. Experiments with the proposed gene-finder (GF) on three prokaryotic genomes indicate its potential advantage on the detection of short genes.
Automatically Generating and Validating Reading-Check Questions
Authors: Christine M. Feeney, Michael Heilman
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

The number of texts used by the REAP tutor and challenges of automatically generating reading comprehension questions necessitated a simpler automated type of question. We describe an algorithm for generating such reading-check questions for arbitrary texts. Two studies investigating the utility of these questions found reliable, moderate correlations with vocabulary learning and reading comprehension.
Probe Matrix Problems: Totally Balanced Matrices
Authors: David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

Let be a class of 0/1-matrices. A 0/1/ ¿-matrix A where the ¿s induce a submatrix is a probe matrix of if the ¿s in A can be replaced by 0s and 1s such that A becomes a member of . We show that for being the class of totally balanced matrices, it can be decided in polynomial time whether A is a probe totally balanced matrix. On our route toward proving this main result, we also prove that so-called partitioned probe strongly chordal graphs and partitioned probe chordal bipartite graphs can be recognized in polynomial time.
A Mixed Method Lemmatization Algorithm Using a Hierarchy of Linguistic Identities (HOLI)
Authors: Anton Karl Ingason, Sigrún Helgadóttir, Hrafn Loftsson, Eiríkur Rögnvaldsson
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

We present a new mixed method lemmatizer for Icelandic, Lemmald, which achieves good performance by relying on IceTagger [1] for tagging and The Icelandic Frequency Dictionary [2] corpus for training. We combine the advantages of data-driven machine learning with linguistic insights to maximize performance. To achieve this, we make use of a novel approach: Hierarchy of Linguistic Identities (HOLI), which involves organizing features and feature structures for the machine learning based on linguistic knowledge. Accuracy of the lemmatization is further improved using an add-on which connects to the Database of Modern Icelandic Inflections [3]. Given correct tagging, our system lemmatizes Icelandic text with an accuracy of 99.55%. We believe our method can be fruitfully adapted to other morphologically rich languages.
Towards Virtual Emotions and Emergence of Social Behaviour
Authors: Dirk M. Reichardt
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In our approach we explore emotional effects of virtual agents without human interaction. The idea is the following: emotion is considered a valuable means to explain social phenomena like the emergence of costly punishment. Now, would it be possible to put together a population of agents which mimics human society? Would it even be possible to show that certain personality configurations and emotional behavior emerge from interactions in a virtual agent society experiment? In previous work we selected the public goods game with punishment option because of its intriguing property of affect-based decisions [1]. In this paper we present our first approach to virtual agent population modelling which adopts a setting of the public goods game as it is used for studies on cooperative behaviour (see [1][3]). The discrete version of the game distinguishes between the roles of the punisher, the cooperator and the defector. As shown in [3] the iterated public goods game leads to a predominance of the defectors. This is changed by giving the participants the freedom to choose whether to participate in the game or not which gives the punishers a chance to get back into the game and it is shown that eventually they become dominant (see [3]).
Examining the Feasibility of Reconfigurable Models for Molecular Dynamics Simulation
Authors: Eunjung Cho, Anu G. Bourgeois, José Alberto Fernández-Zepeda
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

A Molecular Dynamics (MD) system is defined by the position and momentum of particles and their interactions. The dynamics of a system can be evaluated by an N-body problem and the simulation is continued until the energy reaches equilibrium. Many applications use MD for biomolecular simulations and the simulations are performed in multiscale of time and length. The simulations of the relevant scales require strong and fast computing power, but it is even beyond the reach of current fastest supercomputers. In this paper, we design R-Mesh Algorithms that require O(N) time complexity for the Direct method for MD simulations and O(r)+O(logM) time complexity for the Multigrid method, where r is N/M and M is the size of R-Mesh. Our work supports the theory that reconfigurable models are a good direction for biological studies which require high computing power.
Collisions for Step-Reduced SHA-256
Authors: Ivica Nikolić, Alex Biryukov
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

In this article we find collisions for step-reduced SHA-256. We develop a differential that holds with high probability if the message satisfies certain conditions. We solve the equations that arise from the conditions. Due to the carefully chosen differential and word differences, the message expansion of SHA-256 has little effect on spreading the differences in the words. This helps us to find full collision for 21-step reduced SHA-256, semi-free start collision, i.e. collision for a different initial value, for 23-step reduced SHA-256, and semi-free start near collision (with only 15 bit difference out of 256 bits) for 25-step reduced SHA-256.