ppxscal/embedding_network huggingface dataset:
Some Second Order Set Theory
Authors: Joel David Hamkins
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

This article surveys two recent developments in set theory sharing an essential second-order nature, namely, the modal logic of forcing, oriented upward from the universe of set theory to its forcing extensions; and set-theoretic geology, oriented downward from the universe to the inner models over which it arises by forcing. The research is a mixture of ideas from several parts of logic, including, of course, set theory and forcing, but also modal logic, finite combinatorics and the philosophy of mathematics, for it invites a mathematical engagement with various philosophical views on the nature of mathematical existence. 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
Addressing common crosscutting problems with Arcum
Authors: Macneil Shonle, William G. Griswold, Sorin Lerner
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

Crosscutting is an inherent part of software development and can typically be managed through modularization: A module's stable properties are defined in an interface while its likely-to-change properties are encapsulated within the module [19]. The crosscutting of the stable properties, such as class and method names, can be mitigated with automated refactoring tools that allow, for example, the interface's elements to be renamed [9, 18]. However, often the crosscutting from design idioms (such as design patterns and coding styles) are so specific to the program's domain that their crosscutting would not likely have been anticipated by the developers of an automated refactoring system. The Arcum plug-in for Eclipse enables programmers to describe the implementation of a crosscutting design idiom as a set of syntactic patterns and semantic constraints. Arcum can process declarations of related implementations and infer the refactoring steps necessary to transform a program from using one implementation to its alternatives. As a result, automating refactoring for domain-specific crosscutting design idioms can be easy and practical. This paper presents a case study of how Arcum was used to mitigate four classic software engineering problems that are exacerbated by crosscutting: library migration, debugging, programmer-defined semantic checking, and architectural enforcement.
A genetic encoding approach for learning methods for combining classifiers
Authors: Loris Nanni, Alessandra Lumini
Venue: Expert Systems with Applications: An International Journal (2009)

Several studies have reported that the ensemble of classifiers can improve the performance of a stand-alone classifier. In this paper, we propose a learning method for combining the predictions of a set of classifiers. The method described in this paper uses a genetic-based version of the correspondence analysis for combining classifiers. The correspondence analysis is based on the orthonormal representation of the labels assigned to the patterns by a pool of classifiers. In this paper instead of the orthonormal representation we use a pool of representations obtained by a genetic algorithm. Each single representation is used to train a different classifiers, these classifiers are combined by vote rule. The performance improvement with respect to other learning-based fusion methods is validated through experiments with several benchmark datasets.
Interactive massive model rendering
Authors: Andreas Dietrich, Enrico Gobbetti, Dinesh Manocha, Fabio Marton, Renato Pajarola, Philipp Slusallek, Sung-eui Yoon
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

This course instructs students in the software and hardware strategies needed for real-time visualization and interaction with massive models. Seven international researchers and practitioners are the instructors. The general form of the course will be lecture with live demos.
Adding support to XACML for multi-domain user to user dynamic delegation of authority
Authors: David W. Chadwick, Sassa Otenko, Tuan Anh Nguyen
Venue: International Journal of Information Security (2009)

We describe adding support for dynamic delegation of authority (DOA) between users in multiple administrative domains, to the XACML model for authorisation decision making. DOA is enacted via the issuing of credentials from one user to another, and follows the role based access control model. We present the problems and requirements that such a delegation model demands, the policy elements that are necessary to control the delegation chains and a description of the architected solution. We propose a new conceptual entity called the credential validation service (CVS) to work alongside the XACML PDP. We describe our implementation of the CVS and present performance measurements for validating delegated chains of credentials.
Mining the web for visual concepts
Authors: Nick Morsillo, Chris Pal, Randal Nelson
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

The web has the potential to serve as an excellent source of example imagery for visual concepts. Image search engines based on text keywords can fetch thousands of images for a given query; however, their results tend to be visually noisy. We present a technique that allows a user to refine noisy search results and characterize a more precise visual object class. With a small amount of user intervention we are able to re-rank search engine results to obtain many more examples of the desired concept. Our approach is based on semi-supervised machine learning in a novel probabilistic graphical model composed of both generative and discriminative elements. Learning is achieved via a hybrid expectation maximization / expected gradient procedure initialized with a small example set defined by the user. We demonstrate our approach on images of musical instruments collected from Google image search. The rankings given by our model show significant improvement with respect to the user-refined query. The results are suitable for improving user experience in image search applications and for collecting large labeled datasets for computer vision research.
How to correctly use the protocol interference model for multi-hop wireless networks
Authors: Yi Shi, Y. Thomas Hou, Jia Liu, Sastry Kompella
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

This paper tries to reconcile the tension between physical model and protocol model that have been used to characterize interference relationship in a multi-hop wireless network. The physical model (a.k.a. SINR model) is widely considered as a reference model for physical layer behavior but its application in multi-hop wireless networks is limited by its complexity. On the other hand, the protocol model (a.k.a. unified disk graph model) is simple but there have been doubts on its validity. This paper explores the following fundamental question: How to correctly use the protocol interference model? We show that in general, solutions obtained under the protocol model may be infeasible in practice and thus, results based on blind use of protocol model can be misleading. We propose a novel concept called "reality check" and present a method of using protocol model with reality check for wireless networks. Subsequently, we show that by appropriate setting of the interference range in the protocol model, it is possible to narrow the solution gap between the two models. Our simulation results confirm that this gap is indeed small (or even negligible). Thus, our methodology of joint reality check and interference range setting retains the protocol model as a viable approach to analyze multi-hop wireless networks.
Research Issues on Data Warehouse Maintenance
Authors: S. Sai Satyanarayana Reddy, A. Lavanya, V. Khanna, L. S. S. Reddy
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Data Warehousing has been a buzz word in the industry. Researches have been constantly involved in finding new ways of designing and developing Data Warehousing Architectures, algorithms and tools for bringing together some selected data from multiple heterogeneous databases into a single repository. The real work of taking output from the data warehouse depends largely on how it is managed. Although a lot of research is going on to enhance the design and development of Data warehouse, Very little effort has been spent on the maintenance side. Without proper maintenance data warehouse is not going to give the desired output which is expected of it. In this work a comparison of various architectures of Data Warehousing system, based on analyzed on concepts like wrapper, monitor, integrator, metadata, data quantity indicator is considered.The Objective of the work is to come out with comparisons between theoretical projections and real world findings on all these factors. The Final goal of the work is to suggest an improved methodology for potential users of the data warehouse in their decision making process in the Business process system.
My iPhone, 2nd edition
Authors: Brad Miser
Venue:  (2008)

My iPhone, Second EditionStep-by-step instructions with callouts to iPhone photos so that you can see exactly what to do. Help when you run into the few iPhone limitations. Tips and Notes to help you get the most from your iPhone. Full-color, step-by-step tasks walk you through getting and keeping your iPhone working just the way you want. The tasks include: How to use all the essential features of iPhone 3G such as the cell phone, visual voice mail, conference calling, and contact information.How to add network connections and switch between them; surf the web using full-featured web pages just like on a computer; and receive and manage your email, from all your accounts, including Microsoft Exchange, wherever you are.How to configure MobileMe to keep all your contacts, email, and events current on your device wirelessly.How to use an iPod and and iTunes 8 to listen to music and podcasts or watch movies, TV shows, and music videos.How to take quality photos and view them, email them, or transfer them to a computer.How to find, download, install, manage, and use thousands of iPhone applications. How use Maps to find any location, plan a route to it, and then track your route with GPS.How to customize the way iPhone looks and works with your own wallpaper, Home screen button layouts, ringtones from your favorites songs, and more.CATEGORY: Apple Digital Media COVERS: Apple iPhone USER LEVEL: Beginning-IntermediateQuote from front cover.As easy as the iPhone is to admire and use, Miser unlocks all of its secrets and offers frank, useful advice for getting the most out of the most amazing product of this century (so far!). Mark A. Kellner, Technology Columnist, The Washington Times
Detection and Segmentation of Multiple, Partially Occluded Objects by Grouping, Merging, Assigning Part Detection Responses
Authors: Bo Wu, Ram Nevatia
Venue: International Journal of Computer Vision (2009)

We propose a method that detects and segments multiple, partially occluded objects in images. A part hierarchy is defined for the object class. Both the segmentation and detection tasks are formulated as binary classification problem. A whole-object segmentor and several part detectors are learned by boosting local shape feature based weak classifiers. Given a new image, the part detectors are applied to obtain a number of part responses. All the edge pixels in the image that positively contribute to the part responses are extracted. A joint likelihood of multiple objects is defined based on the part detection responses and the object edges. Computation of the joint likelihood includes an inter-object occlusion reasoning that is based on the object silhouettes extracted with the whole-object segmentor. By maximizing the joint likelihood, part detection responses are grouped, merged, and assigned to multiple object hypotheses. The proposed approach is demonstrated with the class of pedestrians. The experimental results show that our method outperforms the previous ones.
MOPS --- A Morphodynamical Prediction System on Cluster Computers
Authors: Hartmut Kapitza
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The simulation of morphodynamical processes with a 3D model requires high horizontal and vertical resolution at least in some parts of the model domain. In particular, all areas with steep bathymetry gradients like tidal rivulets or shipping channels require highly resolved simulations. Since it is not feasible to run the total model domain with the same high resolution everywhere, this problem calls for a multiply nested approach. Still, the amount of grid points necessary for a multiply nested simulation is enormous. Since in shallow areas the influence of wave action on the bottom shear stress becomes important a wave model particularly suitable for shallow water is coupled to the hydrodynamics. The integrated system is implemented on a Linux cluster using the MPI library. Performance results for different types of model coupling are presented.
Extending Persistence Using Poincar&#x00e9; and Lefschetz Duality
Authors: David Cohen-Steiner, Herbert Edelsbrunner, John Harer
Venue: Foundations of Computational Mathematics (2009)

Persistent homology has proven to be a useful tool in a variety of contexts, including the recognition and measurement of shape characteristics of surfaces in &#x211d;3. Persistence pairs homology classes that are born and die in a filtration of a topological space, but does not pair its actual homology classes. For the sublevelset filtration of a surface in &#x211d;3, persistence has been extended to a pairing of essential classes using Reeb graphs. In this paper, we give an algebraic formulation that extends persistence to essential homology for any filtered space, present an algorithm to calculate it, and describe how it aids our ability to recognize shape features for codimension 1 submanifolds of Euclidean space. The extension derives from Poincar&#x00e9; duality but generalizes to nonmanifold spaces. We prove stability for general triangulated spaces and duality as well as symmetry for triangulated manifolds.
The Reuse Policy in Developing Multi-Agent System
Authors: Xue Xiao, Yao Lina, Luo Junwei
Venue: International Journal of Distributed Sensor Networks (2009)

The agent-oriented (AO) methodology is an effective means for constructing distributed systems. Despite a great deal of research, a number of challenges still exist before making agent-based computing a widely accepted paradigm in software engineering practice. The problem of “difficult to implement agent-based system” originates from the gap between design models and system implementation to a high degree. Developers often feel that those characteristics depicted in agent design models are too abstract and difficult to implement. In order to solve this problem, the paper presents a hierarchical development architecture (HDA) approach to facilitate building up a new agent system. The HDA consists of two parts (analysis and design part, and the system implementation part), covering the entire development lifecycle. Each phase of the HDA is further categorized into a layered model structure. Based on the goal and the task of each layer, the user can fill different method fragments into the appropriate layers to handle different kinds of quality attributes. Instead of creating incompatible techniques, models and CASE tools for each methodology, modular and reusable models can be created once, and shared within different methodologies. It represents significant savings in the development cost and the learning cost. As the supporting tool, the method engineering process and design patterns play the key role in the HDA. In order to build a new method based on the reuse policy, we adopted (and extended) the method engineering paradigm. According to this approach, a new method is built by assembling pieces of method fragments from a method repository, which is a structural representation of the method fragments that compose the actual AO method with their composing relationships. In this way we could obtain the best method for our specific needs. In our view, the excellent design patterns will be a good choice for developers to customize their own infra-structure, which is flexible and pluggable. Therefore, a layered-structure is presented, aimed at giving an explicit guide about how to apply those patterns and an order of examination of pattern application. Through applying the HDA-based design patterns, developers can build applications from third party off-the-shelf solution components conveniently. To exemplify its feasibility and effectiveness, the construction of the C4I system is presented as a case study. An agent-oriented new approach derived from HDA is applied and the experimental result is satisfactory.
Universal hash functions for an infinite universe and hash trees
Authors: Peter Brass
Venue: Information Processing Letters (2009)

In this note we describe the adaptation of the universal hashing idea to an infinite universe, and to prefix hash trees. These are a structure underlying all extendible hash methods, which have up to now only been studied under the uniform hashing assumption.
Statistical profiling-based techniques for effective power provisioning in data centers
Authors: Sriram Govindan, Jeonghwan Choi, Bhuvan Urgaonkar, Anand Sivasubramaniam, Andrea Baldini
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Current capacity planning practices based on heavy over-provisioning of power infrastructure hurt (i) the operational costs of data centers as well as (ii) the computational work they can support. We explore a combination of statistical multiplexing techniques to improve the utilization of the power hierarchy within a data center. At the highest level of the power hierarchy, we employ controlled underprovisioning and over-booking of power needs of hosted workloads. At the lower levels, we introduce the novel notion of soft fuses to flexibly distribute provisioned power among hosted workloads based on their needs. Our techniques are built upon a measurement-driven profiling and prediction framework to characterize key statistical properties of the power needs of hosted workloads and their aggregates. We characterize the gains in terms of the amount of computational work (CPU cycles) per provisioned unit of power Computation per Provisioned Watt (CPW). Our technique is able to double the CPWoffered by a Power Distribution Unit (PDU) running the e-commerce benchmark TPC-W compared to conventional provisioning practices. Over-booking the PDU by 10% based on tails of power profiles yields a further improvement of 20%. Reactive techniques implemented on our Xen VMM-based servers dynamically modulate CPU DVFS states to ensure power draw below the limits imposed by soft fuses. Finally, information captured in our profiles also provide ways of controlling application performance degradation despite overbooking. The 95th percentile of TPC-W session response time only grew from 1.59 sec to 1.78 sec--a degradation of 12%.
An integrated approach to network protocols
Authors: Louis Pouzin
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Host-to-host protocols (H-H) for heterogeneous computer networks are still in infancy. So far very few implementations are in existence. Among those on which documentation is available are Arpanet and Cyclades. The former provides only for basic services allowing the transfer of up to 1000 octet messages, with flow control but not error control. The latter allows up to 32 000 octet messages, with error and flow control. Both are similar in the sense that they offer only a message transfer service, which is intended for building higher level protocols more appropriate for specific uses. Since data to be transferred are usually structured in various ways, a traditional approach is to superimpose additional layers of specific protocols, each one dealing with a particular level of structure. While being functionally correct, this approach leads to heterogeneity, redundancy and overhead among the various layers.
XenSocket: a high-throughput interdomain transport for virtual machines
Authors: Xiaolan Zhang, Suzanne McIntosh, Pankaj Rohatgi, John Linwood Griffin
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

This paper presents the design and implementation of XenSocket, a UNIX-domain-socket-like construct for high-throughput in-terdomain (VM-to-VM) communication on the same system. The design of XenSocket replaces the Xen page-flipping mechanism with a static circular memory buffer shared between two domains, wherein information is written by one domain and read asynchronously by the other domain. XenSocket draws on best-practice work in this field and avoids incurring the overhead of multiple hypercalls and memory page table updates by aggregating what were previously multiple operations on multiple network packets into one or more large operations on the shared buffer. While the reference implementation (and name) of XenSocket is written against the Xen virtual machine monitor, the principle behind XenSocket applies broadly across the field of virtual machines.
Note: Moves and displacements of particular elements in Quicksort
Authors: Conrado Martínez, Helmut Prodinger
Venue: Theoretical Computer Science (2009)

In this research note we investigate the number of moves and the displacement of particular elements during the execution of the well-known quicksort algorithm. This type of analysis is useful if the costs of data moves were dependent on the source and target locations, and possibly the moved element itself. From the mathematical point of view, the analysis of these quantities turns out to be related to the analysis of quickselect, a selection algorithm which is a variant of quicksort that finds the i-th smallest element of n given elements, without sorting them. Our results constitute thus a novel application of M. Kuba's machinery [M. Kuba, On quickselect, partial sorting and multiple quickselect, Inform. Process. Lett. 99(5) (2006) 181-186] for the solution of general quickselect recurrences.
Numerical simulations of the Boussinesq equation by He's variational iteration method
Authors: Elcin Yusufoglu, Ahmet Bekir
Venue: International Journal of Computer Mathematics (2009)

In this paper, we present a reliable algorithm to study the well-known model of nonlinear dispersive waves proposed by Boussinesq. We solve the Cauchy problem of Boussinesq equation using variational iteration method (VIM). The numerical results of this method are compared with the exact solution of an artificial model to show the efficiency of the method. The approximate solutions show that VIM is a powerful mathematical tool for solving nonlinear problems.