ppxscal/embedding_network huggingface dataset:
A Case for Continuous Data Protection at Block Level in Disk Array Storages
Authors: Weijun Xiao, Jin Ren, Qing Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

This paper presents a study of data storages for continuous data protection (CDP). After analyzing the existing data protection technologies, we propose a new disk array architecture that provides Timely Recovery to Any Point-in-time, referred to as TRAP. TRAP stores not only the data stripe upon a write to the array but also the time-stamped Exclusive ors (xors) of successive writes to each data block. By leveraging the xor operations that are performed upon each block write in today's RAID4/5 controllers, TRAP does not incur noticeable performance overhead. More importantly, TRAP is able to recover data very quickly to any point-in-time upon data damage by tracing back the sequence and history of xors resulting from writes. What is interesting is that the TRAP architecture is very space efficient. We have implemented a prototype of the new TRAP architecture using software at the block level and carried out extensive performance measurements using TPC-C benchmarks running on Oracle and Postgres databases, TPC-W running on a MySQL database, and file system benchmarks running on Linux and Windows systems. Our experiments demonstrated that TRAP not only is able to recover data to any point-in-time very quickly upon a failure but also uses less storage space than traditional daily incremental backup/snapshot. Compared to the state-of-the-art CDP technologies, TRAP saves disk storage space by one to two orders of magnitude with a simple and a fast encoding algorithm. In addition, TRAP can provide two-way data recovery with the availability of only one reference image in contrast to the one-way recovery of snapshot and incremental backup technologies.
What Does an Information Diffusion Model Tell about Social Network Structure?
Authors: Takayasu Fushimi, Takashi Kawazoe, Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

In this paper, we attempt to answer a question "What does an information diffusion model tell about social network structure?" To this end, we propose a new scheme for empirical study to explore the behavioral characteristics of representative information diffusion models such as the IC (Independent Cascade) model and the LT (Linear Threshold) model on large networks with different community structure. To change community structure, we first construct a GR (Generalized Random) network from an originally observed network. Here GR networks are constructed just by randomly rewiring links of the original network without changing the degree of each node. Then we plot the expected number of influenced nodes based on an information diffusion model with respect to the degree of each information source node. Using large real networks, we empirically found that our proposal scheme uncovered a number of new insights. Most importantly, we show that community structure more strongly affects information diffusion processes of the IC model than those of the LT model. Moreover, by visualizing these networks, we give some evidence that our claims are reasonable.
Variance reduction techniques in particle-based visual contour tracking
Authors: Daniel Ponsa, Antonio M. López
Venue: Pattern Recognition (2009)

This paper presents a comparative study of three different strategies to improve the performance of particle filters, in the context of visual contour tracking: the unscented particle filter, the Rao-Blackwellized particle filter, and the partitioned sampling technique. The tracking problem analyzed is the joint estimation of the global and local transformation of the outline of a given target, represented following the active shape model approach. The main contributions of the paper are the novel adaptations of the considered techniques on this generic problem, and the quantitative assessment of their performance in extensive experimental work done.
Integrated Noise Modeling for Image Sensor Using Bayer Domain Images
Authors: Yeul-Min Baek, Joong-Geun Kim, Dong-Chan Cho, Jin-Aeon Lee, Whoi-Yul Kim
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

Most of image processing algorithms assume that an image has an additive white Gaussian noise (AWGN). However, since the real noise is not AWGN, such algorithms are not effective with real images acquired by image sensors for digital camera. In this paper, we present an integrated noise model for image sensors that can handle shot noise, dark-current noise and fixed-pattern noise together. In addition, unlike most noise modeling methods, parameters for the model do not need to be re-configured depending on input images once it is made. Thus the proposed noise model is best suitable for various imaging devices. We introduce two applications of our noise model: edge detection and noise reduction in image sensors. The experimental results show how effective our noise model is for both applications.
Parallel Iterative Solvers for Unstructured Grids Using an OpenMP/MPI Hybrid Programming Model for the GeoFEM Platform on SMP Cluster Architectures
Authors: Kengo Nakajima, Hiroshi Okuda
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

An efficient parallel iterative method for unstructured grids developed by the authors for SMP cluster architectures on the GeoFEM platform is presented. The method is based on a 3-level hybrid parallel programming model, including message passing for inter-SMP node communication, loop directives by OpenMP for intra-SMP node parallelization and vectorization for each processing element (PE). Simple 3D elastic linear problems with more than 8×108 DOF have been solved by 3x3 block ICCG(0) with additive Schwarz domain decomposition and PDJDS/CM-RCM reordering on 128 SMP nodes of Hitachi SR8000/MPP parallel computer, achieving performance of 335.2 GFLOPS. The PDJDS/CM-RCM reordering method provides excellent vector and parallel performance in SMP nodes.
A decisions query language (DQL): high-level abstraction for mathematical programming over databases
Authors: Alexander Brodsky, Mayur M. Bhot, Manasa Chandrashekar, Nathan E. Egge, X. Sean Wang
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

The demonstrated, high-level decisions query language DQL combines the decision optimization capability of mathematical programming and the data manipulation capability of traditional database query languages. DQL benefits application developers in two aspects. First, it avoids a conceptual impedance mismatch between mathematical programming and data access and makes decision optimization functionality readily accessible to database programmers with no prior experience in operations research. Second, a tight integration provides unique opportunities for more efficient evaluation as compared to a loosely coupled system. This demonstration uses an emergency response scenario to illustrate the power of the language and its implementation.
Fluctuation AnaLysis CalculatOR
Authors: Brandon M. Hall, Chang-Xing Ma, Ping Liang, Keshav K. Singh
Venue: Bioinformatics (2009)

Summary:The program Fluctuation AnaLysis CalculatOR (FALCOR) is a web tool designed for use with Luria–Delbrück fluctuation analysis to calculate the frequency and rate from various mutation assays in bacteria and yeast. Three calculation methods are available through this program: (i) Ma-Sandri-Sarkar Maximum Likelihood Estimator (MSS-MLE) method, (ii) Lea-Coulson method of the median (LC) and (iii) frequency. Availability: The FALCOR rate calculator is currently accessible at http://www.mitochondria.org/protocols/FALCOR.html. This program is written as a Java™ Applet, requiring a web browser enabled with Sun MicroSystems' Java Virtual Machine. Contact: brandon.hall@roswellpark.org
Bankruptcy prediction using ELECTRE-based single-layer perceptron
Authors: Yi-Chung Hu
Venue: Neurocomputing (2009)

For the outranking relation theory, the ELECTRE methods are one of the most extensively used outranking methods. To measure the degree of agreement and the degree of disagreement of the proposition ''one alternative outranks another alternative'', the concordance and discordance relations are usually associated with the outranking relation. Instead of the traditional single-layer perceptron (SLP) developed according to the multiple-attribute utility theory, this paper contributes to develop a novel ELECTRE-based SLP for multicriteria classification problems based on the ELECTRE methods involving pairwise comparisons among patterns. A genetic-algorithm-based method is then designed to determine connection weights. A real-world data set involving bankruptcy analysis obtained from Moody's Industrial Manuals is employed to examine the classification performance of the proposed ELECTRE-based model. The results demonstrate that the proposed model performs well compared to an arsenal of well-known classification methods involving quantitative disciplines of statistics and machine learning.
Integration of haptics with Web3D using the SAI
Authors: Liam Kurmos, Nigel W. John, Jonathan C. Roberts
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Haptics force-feedback technology is fast becoming a consumer product and no longer only found in research laboratories. The emergence of the budget Falcon device (Novint Technologies, Inc., USA) represents a key step in the dissemination of haptics technology as it offers this functionality to home users, in particular to games players. Haptics has the potential to revolutionise the Human Computer Interface if novel and creative software solutions can be found to utilise it. Currently developing for haptics requires low level programming knowledge, which is often a barrier to uptake. This paper looks at how haptics support can be integrated into an X3D authored virtual world using an open source haptics library via the Scene Authoring Interface (SAI). We supply a partial implementation of a Java wrapping to the HAPI open-source haptics library and provide a demonstration of its use within the Xj3D browser through SAI. This work is intended to contribute to a possible future haptics extension of the ISO X3D standard.
Scalability of Gaussian 03 on SGI Altix: The Importance of Data Locality on CC-NUMA Architecture
Authors: Roberto Gomperts, Michael Frisch, Jean-Pierre Panziera
Venue: Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism (2009)

Performance anomalies when running Gaussian frequency calculations in parallel on SGI Altix computers with CC-NUMA memory architecture are analyzed using performance tools that access hardware counters. The bottleneck is the frequent and nearly simultaneous data-loads of all threads involved in the calculation of data allocated in the node where the master thread runs. Code changes that ensure these data-loads are localized improve performance by a factor close to two. The improvements carry over to other molecular models and other types of calculations. An expansion or an alternative of FirstPrivate OpenMP's clause can facilitate the code transformations.
Web Ontology Languages: theory and practice --will they ever meet?
Authors: Marie Duží, Anneli Heimbürger
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

The current state of Semantic Web ontology languages is briefly described, and the ontology languages are characterised from the logical point of view. Generally, these languages are based on the first-order predicate logic enriched with ad hoc higher-order constructs wherever needed. We argue that in the Semantic Web we need a rich language with transparent semantics, in order to build up metadata on the conceptual level of the Semantic Web architecture. A powerful logical tool of Transparent Intensional Logic (TIL) is described, which provides a logico-semantic framework for a fine-grained knowledge representation and conceptual analysis. TIL is based on a rich ontology of entities organised in an infinite ramified hierarchy of types. The conceptual role of TIL in building ontologies is described, and we show that such a system can serve as a unifying logical framework. Concluding we argue that the conceptual and logical level of the Web architecture have an important role, and we should pay a due attention to these levels.
Comparative study between a new nonlinear model and common linear model for analysing laboratory simulated-forest hyperspectral data
Authors: Wenyi Fan, Baoxin Hu, John Miller, Mingze Li
Venue: International Journal of Remote Sensing (2009)

The spectral unmixing of mixed pixels is a key factor in remote sensing images, especially for hyperspectral imagery. A commonly used approach to spectral unmixing has been linear unmixing. However, the question of whether linear or nonlinear processes dominate spectral signatures of mixed pixels is still an unresolved matter. In this study, we put forward a new nonlinear model for inferring end-member fractions within hyperspectral scenes. This study focuses on comparing the nonlinear model with a linear model. A detail comparative analysis of the fractions 'sunlit crown', 'sunlit background' and 'shadow' between the two methods was carried out through visualization, and comparing with supervised classification using a database of laboratory simulated-forest scenes. Our results show that the nonlinear model of spectral unmixing outperforms the linear model, especially in the scenes with translucent crown on a white background. A nonlinear mixture model is needed to account for the multiple scattering between tree crowns and background.
A system for monitoring and interpreting team actions of embodied agents
Authors: Brandyn White, Ladislau Bölöni
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Understanding and recognizing team actions executed by embodied agents (e.g., robots, agents, humans) has applications in team sports [2], surveillance [1], and training. Many team actions can be described by the individual team member's movement patterns; moreover, by understanding the internal structure of the team action, we can predict the next actions of the individual members, as well as whether they are executing the action correctly or not.
How Hard is a Commercial Puzzle: the Eternity II Challenge
Authors: Carlos Ansótegui, Ramon Béjar, Cèsar Fernández, Carles Mateu
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.
A cell-centered Lagrangian hydrodynamics scheme on general unstructured meshes in arbitrary dimension
Authors: G. Carré, S. Del Pino, B. Després, E. Labourasse
Venue: Journal of Computational Physics (2009)

We describe a cell-centered Godunov scheme for Lagrangian gas dynamics on general unstructured meshes in arbitrary dimension. The construction of the scheme is based upon the definition of some geometric vectors which are defined on a moving mesh. The finite volume solver is node based and compatible with the mesh displacement. We also discuss boundary conditions. Numerical results on basic 3D tests problems show the efficiency of this approach. We also consider a quasi-incompressible test problem for which our nodal solver gives very good results if compared with other Godunov solvers. We briefly discuss the compatibility with ALE and/or AMR techniques at the end of this work. We detail the coefficients of the isoparametric element in the appendix.
Empowering rural citizen journalism via web 2.0 technologies
Authors: Marco A. Figueiredo, Paola Prado, Mauro A. Câmara, Ana M. Albuquerque
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

Once acquainted with the modern information and communication tools made available with the advent of the Internet, five Brazilian rural communities participating in a pilot project to develop a self-sustaining telecenter model, engaged in citizen journalism using inexpensive digital video cameras. Community members used Web 2.0 collaborative tools to post short videos on the telecenter portal. The 95 video blogs published between September 2006 and May 2008 recorded various aspects of community life, including religious celebrations, oral history arts and crafts traditions, folklore, and environmental concerns. This study evaluates the impact of video blogging in these communities.
Advanced Filters & Components for Electrical Power Applications
Venue:  (2007)

Written by staff at the Laboratory for Electromagnetic and Electronic Systems, M.I.T. in 2006. Chapter titles are ...(1) Introduction ...(2) Filters and Components with Inductance Cancellation ...(3) Filters with Inductance Cancellation using Printed Circuit Board Transformers ...(4) Design of Integrated LC Filter Elements with Inductance Cancellation ...(5) Inductance Cancellation Circuits with Active Tuning ...(6) Multiple Element Inductance Compensation ...(7) Other Applications of Inductance Cancellation ...(8) Parasitic Capacitance Cancellation in Filters ...(9) Summary and Conclusions ...(10) Appendix A: Transformer Models ...(11) Appendix B: Empirical Inductance Calculation Formulas ...(12) Appendix (continued) 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
Extremal problems on triangle areas in two and three dimensions
Authors: Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth
Venue: Journal of Combinatorial Theory Series A (2009)

The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that are spanned by finite point sets in the plane and in 3-space, and the number of distinct areas determined by the triangles. In the plane, our main result is an O(n^4^4^/^1^9)=O(n^2^.^3^1^5^8) upper bound on the number of unit-area triangles spanned by n points, which is the first breakthrough improving the classical bound of O(n^7^/^3) from 1992. We also make progress in a number of important special cases. We show that: (i) For points in convex position, there exist n-element point sets that span @W(nlogn) triangles of unit area. (ii) The number of triangles of minimum (nonzero) area determined by n points is at most 23(n^2-n); there exist n-element point sets (for arbitrarily large n) that span (6/@p^2-o(1))n^2 minimum-area triangles. (iii) The number of acute triangles of minimum area determined by n points is O(n); this is asymptotically tight. (iv) For n points in convex position, the number of triangles of minimum area is O(n); this is asymptotically tight. (v) If no three points are allowed to be collinear, there are n-element point sets that span @W(nlogn) minimum-area triangles (in contrast to (ii), where collinearities are allowed and a quadratic lower bound holds). In 3-space we prove an O(n^1^7^/^7@b(n))=O(n^2^.^4^2^8^6) upper bound on the number of unit-area triangles spanned by n points, where @b(n) is an extremely slowly growing function related to the inverse Ackermann function. The best previous bound, O(n^8^/^3), is an old result of Erdos and Purdy from 1971. We further show, for point sets in 3-space: (i) The number of minimum nonzero area triangles is at most n^2+O(n), and this is worst-case optimal, up to a constant factor. (ii) There are n-element point sets that span @W(n^4^/^3) triangles of maximum area, all incident to a common point. In any n-element point set, the maximum number of maximum-area triangles incident to a common point is O(n^4^/^3^+^@e), for any @e>0. (iii) Every set of n points, not all on a line, determines at least @W(n^2^/^3/@b(n)) triangles of distinct areas, which share a common side.
Enhancing constraints manipulation in semiring-based formalisms
Authors: Stefano Bistarelli, Fabio Gadducci
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Many “semiring-like” structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing with soft constraints, highlighting the differences between alternative proposals in the literature. We then extend the semiring structure by adding the notion of division as a weak inverse operation of product. In particular, division is needed to apply constraint relaxation when the product operation of the semiring is not idempotent. The division operator is introduced via residuation and it is also able to deal with partial orders, generalizing the approach given for Valued CSPs.
Engaging students in software development course projects
Authors: Jacqueline Hundley, Winard Britt
Venue: The Fifth Richard Tapia Celebration of Diversity in Computing Conference: Intellect, Initiatives, Insight, and Innovations (2009)

This work seeks to contribute to software development education by motivating the use of engaging in-class and laboratory assignments. Ideally, these assignments should involve considerable student buy-in and should also evolve throughout the course to mimic real-world software development. Prior research is discussed, as well as several specific examples from two introductory programming classes. The ultimate contribution is a convincing argument to spend the extra effort to design better student projects.
Book Review: Processor Stew
Authors: Grant Martin
Venue: IEEE Design Test (2009)

This is a review of Processor Description Languages (edited by Prabhat Mishra and Nikil Dutt). This book is likely to become the main resource for anyone wanting to understand the ADL area in detail. The book&#x0027;s 14 chapters contain detailed descriptions of 11 industrial and academic ADLs used for ASIP creation. In addition, it summarizes the salient features of eight more approaches in a concluding chapter. It thus can serve as the standard comparative reference work for this approach to processor-centric design for several years to come.