Recursos de colección

CiteSeerX Scientific Literature Digital Library and Search Engine (6.162.260 recursos)

CiteSeerX is a scientific literature digital library and search engine that focuses primarily on the literature in computer and information science. CiteSeerx aims to improve the dissemination of scientific literature and to provide improvements in functionality, usability, availability, cost, comprehensiveness, efficiency, and timeliness in the access of scientific and scholarly knowledge

Mostrando recursos 1 - 20 de 6.074.021

  1. SEMANTIC WEB MEETS VIRTUAL MUSEUMS: THE DOMUS NATURAE PROJECT

    Cristina Ghiselli; Alberto Trombetta; Loris Bozzato; Elisabetta Binaghi
    The aim of this work is to present a complex, web-based virtual museum application, integrating several tools for flexible management of heterogeneous and highly structured knowledge. All the used tools are compliant to W3C's standards. In particular, the complex network of associations and relations among concepts and objects (as typically found in a virtual museum environment) has been faithfully represented adopting W3C's Semantic Web standards. The proposed ontology allows for constraining, expressing and analyzing the intended meaning of the shared vocabulary of concepts and relations in the project domain of knowledge. As a valuable byproduct, this allows the virtual museum's...

  2. The Case of Chaotic Routing Revisited

    Cruz Izu; Ramon Beivide; Jose Angel Gregorio
    This paper presents a new evaluation of the Chaos router, a cut-through non-minimal adaptive router, which was reported to reach 95 % of its theoretical throughput limit, at the time where most router proposals only reached 60 to 80%. We will revisit the Chaos router design, provide a new vision of its strengths and relate them to the state-of-the-art in adaptive router design. In particular, our analysis has identified a parameter of the router design that was not emphasized in the network evaluation presented by their authors, but that is the key to its outstanding performance. This parameter is the...

  3. Efficient architectures through application clustering and architectural heterogeneity

    Lukasz Strozek
    Customizing architectures for particular applications is a promising approach to yield highly energy-efficient designs for embedded systems. This work explores the benefits of architectural customization for a class of embedded architectures typically used in energy-constrained application domains such as sensor node and multimedia processing. We implement a process flow that analyzes runtime profiles of applications and combines this information with a model for our architectural design space providing a robust customization engine built upon a fully automated method for determining an efficient architecture (together with appropriate application transformations). By profiling embedded benchmarks from a variety of sensor and multimedia applications,...

  4. A Time-Domain Simulation Framework of an


    E live in an era when the U.S. Navy has as some of its main goals the reduction of manning on board its ships and the increase of the survivability of its vessels. The automatic reconfiguration of the electrical network in the

  5. Developing Adapters for Web Services Integration

    Boualem Benatallah; Fabio Casati; Daniela Grigori; H. R. Motahari Nezhad; Farouk Toumani
    Abstract. The push toward business process automation has generated the need for integrating different enterprise applications involved in such processes. The typical approach to integration and to process automation is based on the use of adapters and message brokers. The need for adapters in Web services mainly comes from two sources: one is the heterogeneity at the higher levels of the interoperability stack, and the other is the high number of clients, each of which can support different interfaces and protocols, thereby generating the need for providing multiple interfaces to the same service. In this paper, we characterize the problem...

  6. Ontology-Based Extraction of RDF Data from the World Wide Web

    Brigham Young University; Tim Chartrand; Tim Chartrand
    majority vote has been found to be satisfactory.

  7. A Unified Vector/Scalar Floating-Point Architecture

    Jonathan Bertoni; David W. Wall
    research relevant to the design and application of high performance scientific computers. We test our ideas by designing, building, and using real systems. The systems we build are research prototypes; they are not intended to become products. There is a second research laboratory located in Palo Alto, the Systems Research Center (SRC). Other Digital research groups are located in Paris (PRL) and in Cambridge,

  8. Spatial presence and emotional responses to success in a video game: A psychophysiological study

    Niklas Ravaja; Jari Laarni; Kari Kallinen; Timo Saari; Mikko Salminen; Jussi Holopainen; Aki Järvinen
    We examined the relationship of self-reported Spatial Presence with emotion-related psychophysiological responses to success (reaching the goal) in a video game among 36 young adults. Event-related changes in facial electromyographic (EMG) activity (an index of emotional valence), electrodermal activity (EDA; an index of arousal), and cardiac interbeat intervals (IBIs) were recorded. The results showed that Spatial Presence was associated with an increase in zygomatic and orbicularis oculi, and a decrease in corrugator supercilii, EMG activity in response to reaching the goal. Spatial Presence was also positively related to EDA, but unrelated to IBI. High Spatial Presence may result in a...

  9. ABSTRACT Anonymity and Accountability in Self-Organizing Electronic Communities

    Csilla Farkas; Attila Meretei
    In this paper we study the problem of anonymity versus accountability in electronic communities. We argue that full anonymity may present a security risk that is unacceptable in certain applications; therefore, anonymity and accountability are both needed. To resolve the inherent contradiction between anonymity and accountability in a flexible manner, we introduce the concepts of internal and external accountabilities. Intuitively, internal accountability applies to virtual users only, and is governed by the policy of a group (a community). In contrast, external accountability is needed to address issues related to misuse if the activity is to be penalized in real life...

  10. Authors ’ Addresses

    Matthias Bender; Sebastian Michel; Peter Triantafillou Gerhard; Matthias Bender; Sebastian Michel; Gerhard Weikum; Peter Triantafillou
    Peer-to-Peer (P2P) search engines and other forms of distributed information retrieval (IR) are gaining momentum. Unlike in centralized IR, it is difficult and expensive to compute statistical measures about the entire document collection as it is widely distributed across many computers in a highly dynamic network. On the other hand, such network-wide statistics, most notably, global document frequencies of the individual terms, would be highly beneficial for ranking global search results that are compiled from different peers. This paper develops an efficient and scalable method for estimating global document frequencies in a large-scale, highly dynamic P2P network with autonomous peers....

  11. Dna implementation of finite-state machines

    M. Garzon; Y. Gao; J. A. Rose; R. C. Murphy; R. Deaton; D. R. Franceschetti; S. E. Stevens
    Abstract. We explore the information processing capabilities and efciency of DNA computations by giving two di erent types of implementations of nite-state machines. A ligation-based approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequential input feed and di erent molecules for di erent machines. In a second implementation not based on ligation, transitions are represented by reusable molecules, and the input, coded as a molecule, can be introduced at once. We extend the technique for programmable fault-tolerant implementation of nondeterministic nite-state machines by enforcings the basic conditions in the subset constructions that...

  12. Structure-texture decomposition by a TV-Gabor model

    Jean-françois Aujol; Guy Gilboa; Tony Chan; Stanley Osher
    Abstract. This paper explores new aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, where u holds the geometrical information and v holds the textural information. Our aim is to provide the necessary variational tools and suggest the suitable functional spaces to extract specific types of textures. Our modeling uses the total-variation semi-norm for extracting the structural part and a new tunable norm, presented here for the first time, based on Gabor functions, for the textural part. A way to select the splitting parameter based...

  13. Bayes Risk Minimization in Natural Language Parsing

    Ivan Titov; James Henderson
    Candidate selection from n-best lists is a widely used approach in natural language parsing. Instead of attempting to select the most probable candidate, we focus on prediction of a new structure which minimizes an approximation to Bayes risk. Our approach does not place any restrictions on the probabilistic model used. We show how this approach can be applied in both dependency and constituent tree parsing with loss functions standard for these tasks. We evaluate these methods empirically on the Wall Street Journal parsing task. 1

  14. Mining anomalies using traffic feature distributions

    Anukool Lakhina; Mark Crovella
    The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing this massive data source for anomaly diagnosis is as yet unmet. We argue that the distributions of packet features (IP addresses and ports) observed in flow traces reveals both the presence and the structure of a wide range of anomalies. Using entropy as a summarization tool, we show that the analysis of feature distributions leads to significant advances on two fronts: (1) it enables highly sensitive detection...

  15. Preface

    Dagur Gunnarsson; Kongens Lyngby; Dagur Gunnarsson
    Every organization or company relies on data in one form or another both digital data and physical data. One of the main challenges companies and organizations face is securing data and other valuable assets. For some organizations security is more important than others, e.g., a bank’s most valuable asset is its data, transactions and other financial data. Defining security policies is a major task, enforcing security policies an even bigger one. Security policies should be defined to protect data from malicious attackers from the outside world as well as from people that have inside knowledge of the inner workings of...

  16. Plagiarism Detection in Computer Code

    Matt G. Ellis; Claude W. Anderson
    The ease with which computer code can be copied by students presents opportunities for plagiarism on programming projects. Presently, instructors are provided with few tools (if any) that assist them in detecting possible plagiarism in an assignment. Therefore, the only solution is a tedious and error prone by hand check of student submissions, looking for similarity between any two. In this thesis, I discuss the history of software plagiarism detection as well as present new methods of detection and software that implements these methods.

  17. Downloaded from

    Ercan U Acar; Howie Choset; Ercan U. Acar; Howie Choset
    The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner for robots in unknown spaces. We achieve coverage using Morse decompositions which are exact cellular decompositions whose cells are defined in terms of critical points of Morse functions. Generically, two critical points define a cell. We encode the topology of the Morse decomposition using a graph that has nodes corresponding to the critical points and edges representing the cells defined by pairs of critical points. The robot simultaneously covers the...

  18. Morphological operations on matrix-valued images

    Bernhard Burgeth; Martin Welk; Christian Feddern; Joachim Weickert
    Abstract. The output of modern imaging techniques such as diffusion tensor MRI or the physical measurement of anisotropic behaviour in materials such as the stress-tensor consists of tensor-valued data. Hence adequate image processing methods for shape analysis, skeletonisation, denoising and segmentation are in demand. The goal of this paper is to extend the morphological operations of dilation, erosion, opening and closing to the matrix-valued setting. We show that naive approaches such as componentwise application of scalar morphological operations are unsatisfactory, since they violate elementary requirements such as invariance under rotation. This lead us to study an analytic and a geometric...

  19. Kirkpatrick-Seidel’s Prune-and-Search Convex Hull Algorithm


    This note concerns the computation of the convex hull of a given set P ={p 1, p 2,..., p n}of n points in the plane. Let h denote the size of the convex hull, ie the number of its vertices. The value h is not known beforehand, and it can range anywhere

  20. Mobiroute: Routing towards a mobile sink for improving lifetime in sensor networks

    Jun Luo; Jacques Panchard; Matthias Grossglauser; Jean-pierre Hubaux
    Abstract. Improving network lifetime is an important issue involved in every aspect of the design and deployment of wireless sensor networks. There is a recent research trend of studying the application of a mobile sink to transport (rather than let the sensor nodes transmit) data back. Whereas this approach trades data delivery latency for reduced (node) energy consumption (and thus an improved lifetime), our experience tells us that sacrificing latency to extend lifetime is not necessary. In this paper, in line with our previous work, we investigate the approach that makes use of a mobile sink for balancing the traffic...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.