Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Computer Science (ENC), 2009 Mexican International Conference on

Date 21-25 Sept. 2009

Filter Results

Displaying Results 1 - 25 of 61
  • [Front cover]

    Publication Year: 2009 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (546 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (26 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (193 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2009 , Page(s): ix - x
    Save to Project icon | Request Permissions | PDF file iconPDF (95 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Foreword

    Publication Year: 2009 , Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Acknowledgments

    Publication Year: 2009 , Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (70 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009 , Page(s): xiii - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009 , Page(s): xvi - xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2009 , Page(s): xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • Invited Talks

    Publication Year: 2009 , Page(s): xix - xxiv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (75 KB)  

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Study of the Robust Bayesian Regularization Technique for Remote Sensing Imaging in Geophysical Applications

    Publication Year: 2009 , Page(s): 3 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1016 KB) |  | HTML iconHTML  

    In this paper, a performance study of a methodology for reconstruction of high-resolution remote sensing imagery is presented. This method is the robust version of the Bayesian regularization (BR) technique, which performs the image reconstruction as a solution of the ill-conditioned inverse spatial spectrum pattern (SSP) estimation problem with model uncertainties via unifying the Bayesian minimum risk (BMR) estimation strategy with the maximum entropy (ME) randomized a priori image model and other projection-type regularization constraints imposed on the solution. The results of extended comparative simulation study of a family of image formation/enhancement algorithms that employ the RBR method for high-resolution reconstruction of the SSP is presented. Moreover, the computational complexity of different methods are analyzed and reported together with the scene imaging protocols. The advantages of the remote sensing imaging experiment (that employ the BR-based estimator) over the cases of poorer designed experiments (that employ the conventional matched spatial filtering as well as the least squares techniques) are verified trough the simulation study. Finally, the application of this estimator in geophysical applications of remote sensing imagery is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing Implementations of a Calculator for Exact Real Number Computation

    Publication Year: 2009 , Page(s): 13 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    As one of the first theoretical programming languages for exact real number computation, Real PCF showed to be impractical due to the parallel construct needed for even basic operations. Later, Marcial et al. proposed a variant of Real PCF avoiding the parallelism by introducing a non-deterministic constructor into the language. This language is called LRT. In this paper we present an implementation of a calculator for exact real number computation based on LRT and compare its efficacy with an application of the standard use of real numbers in an imperative programming language. Finally, our implementation is compared with a standard implementation of exact real number computation based on the sign digit representation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks

    Publication Year: 2009 , Page(s): 24 - 32
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (407 KB) |  | HTML iconHTML  

    Existing memory-less greedy-face-greedy (GFG) routing algorithm can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Possibilistic Stratified Minimal Model Semantics

    Publication Year: 2009 , Page(s): 33 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (223 KB) |  | HTML iconHTML  

    In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics. We show that this semantics has some interesting properties such as it is always defined and satisfies relevance. One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Privacy Service for Structured P2P Systems

    Publication Year: 2009 , Page(s): 45 - 56
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (912 KB) |  | HTML iconHTML  

    Online peer-to-peer (P2P) communities such as professional ones (e.g., medical or research) are becoming popular due to increasing needs on data sharing. P2P environments offer valuable characteristics but limited guarantees when sharing sensitive or confidential data. They can be considered as hostile because data can be accessed by everyone (by potentially untrustworthy peers) and used for everything (e.g., for marketing or for activities against the owner's preferences or ethics). In this paper we propose PriServ, a privacy service located on top of distributed hash table (DHT) based P2P systems which prevents data privacy violations. Based on data owner privacy preferences, PriServ uses Hippocratic database principles, takes into account which operations will be realized on shared data (e.g., read, write, disclosure) and uses reputation techniques to increase trust on peers. Several simulation results encourage our ideas and a prototype of PriServ is under development. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis between HSDPA and EVDO with Mobile Clients

    Publication Year: 2009 , Page(s): 57 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (531 KB) |  | HTML iconHTML  

    This work presents a real-case scenario with mobile clients. The main goal of this work is to evaluate the performance of the two most popular third generation technologies (EVDO and HSDPA). The tests were performed at three speeds (60 km/h, 80 km/h and 100 km/h). The tests were conducted in the most careful effort to have the most accurate results. The performance evaluation was based on the throughput (Uplink/Downlink) of each technology. In the results we can see that: HSDPA technology doubles the downlink speeds obtained by EVDO Rev. A. Also with EVDO the loss-rate between 60 km/h to 80 km/h was 6.46% and increases to 60.17% at 100 km/h. The HSDPA loss-rate results were: 14.85% from 60 km/h to 80 km/h and 68.64% from 60 km/h to 100 km/h. Based on the results obtained; we could say that the most suitable technology for symmetric applications in mobile environments is EVDO Rev. A, as the same way we could say that HSDA, will be the most suitable technology for asymmetric requirements in mobile environments. This work provides very helpful information to the potential users to know what technology fits their requirements. Also this information can be useful to the carriers to improve its network and to know what kind of services can provide/offer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Practical Approach to Modeling and Extracting Information from Semantic Web Based on Microformats

    Publication Year: 2009 , Page(s): 65 - 74
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (755 KB) |  | HTML iconHTML  

    The lowercase semantic web consists of web pages enriched with semantic special tags which are called microformats, and it is considered a pragmatic path to the Semantic Web. In this work, we present a practical approach for modeling (microformat based) semantic relations between web pages by means of classical graph like data structures, such as semantic networks. In order to provide categorization into the semantic network we implement the special set of entrance points to the semantic network, which are so-called, semantic indexes. Then we present an agent software approach to retrieve semantically related information between web pages, we describe the main modules and data structures of the process and finally we present snapshots of the tool. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Architecture for Asynchronous Indexing of Media Assets

    Publication Year: 2009 , Page(s): 75 - 85
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (681 KB) |  | HTML iconHTML  

    Multimedia documents, though rich in content, generally lack structured and descriptive metadata that would allow indexing, searching, and cross-linking. Since the field of Multimedia Information Retrieval has been working on solving the problem of multimedia content analyzing and indexing for a number of years, several existing components could be integrated into a final solution, as well as incorporating new techniques from current research results. Hence, a multimedia indexing system must not only face the challenge of a providing scalability and performance, but should also allow for interoperability with legacy code and integration of new processes. With these goals in mind, this paper presents a loosely coupled, asynchronous, distributed event-based SOA media indexing system, making use of Web services and Enterprise Service Bus technologies and contrasts it with different application distribution approaches, with regards to the throughput, scalability, and response time when executing the tasks required for analyzing and indexing of large media document collections. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP Extension to Send Traffic Simultaneously through Multiple Heterogeneous Network Interfaces

    Publication Year: 2009 , Page(s): 89 - 94
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (215 KB) |  | HTML iconHTML  

    Wireless technologies has become very popular in recent years because allows users to be connected all the time without the need of a physical medium to transport data. Many mobile devices are equipped with multiple network interfaces to be connected. However, there is no mechanism to allow the use of these multiple network interfaces simultaneously. The use of a single network interface at the time is not enough to for today's application requirements. Bandwidth aggregation is a solution to this problem. However, current solutions require the placement of additional infrastructure to the network or the creation of a new transport protocol, which incurs into additional modification of applications. In this paper a solution to this problem is presented by only modifying the Transmission Control Protocol to allow the use of multiple network interfaces to send traffic simultaneously increasing the throughput while being transparent to users and applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently Coordinating Services for Querying Data in Dynamic Environments

    Publication Year: 2009 , Page(s): 95 - 106
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (224 KB) |  | HTML iconHTML  

    In this paper we present our vision, and discuss the main research problems along with prospective solutions, on the evaluation of queries over data available and processable through services. In particular, we address queries in dynamic environments concerning aspects such as mobility and continuous data. These queries entail the potential of offering users ubiquitous access to relevant information in the form of value-added services. The core of our proposed approach, lies in the development of a services coordination framework complemented with proven traditional query processing techniques adapted to service-based environments. Thus, we derive the blueprint for an efficient solution for query evaluation in service-based contexts and their related application areas. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query Optimization Using Case-Based Reasoning in Ubiquitous Environments

    Publication Year: 2009 , Page(s): 107 - 118
    Cited by:  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (533 KB) |  | HTML iconHTML  

    Query optimization is a widely studied problem, a variety of query optimization techniques have been suggested. These approaches are presented in the framework of classical query evaluation procedures that rely upon cost models heavily dependent on metadata (e.g. statistics and cardinality estimates) and that typically are restricted to execution time estimation. There are computational environments where metadata acquisition and support is very expensive. Additionally, execution time is not the only optimization objective of interest. A ubiquitous computing environment is an appropriate example where classical query optimization techniques are not useful any more. In order to solve this problem, this article presents a query optimization technique based on learning, particularly on case-based reasoning. Given a query, the knowledge acquired from previous experiences is exploited in order to propose reasonable solutions. It is possible to learn from each new experience in order to suggest better solutions to solve future queries. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Model for a Mobile Image Query Service

    Publication Year: 2009 , Page(s): 119 - 126
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1000 KB) |  | HTML iconHTML  

    Photographic observations of the night sky can best be presented using a data model that conveys the observations, analysis, objects contained with the observations, and results of analysis pertaining to those objects. Such a model is proposed in this paper and it is referred to as the internet Flexible Image Transport System (iFITS), along with a mapping function to transform instances of the Sloan Digital Sky Survey (SDSS) Data Release 1 (DR1) to instances of iFITS, and a hybrid light-weight marshaling method to transfer DR1 data to the implementation of iFITS. iFITS is implemented as a mobile code agent that supports client-based image retrieval in web-based mobile computing environments. The implementation of iFITS was tested against the Image Query Service of SDSS Data Release 6 and the Revised Image Query Service recently proposed. The experiments results reported show a three-fold speedup for iFITS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query an Image Database by Segmentation and Content

    Publication Year: 2009 , Page(s): 127 - 134
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (807 KB) |  | HTML iconHTML  

    The Recent advances on image databases have been developed and most of them consider several methods to query image, the amount of information stored is so big that it is a must to use a combination of different techniques such as image segmentation in order to reduce the dimensionality of the search space. Taking advantage of an image pictographic expressiveness together with the soundness of image segmentation methods, it is possible to rely on an efficient method to query an image database. In this work, it is proposed a new method of image segmentation, indexation and retrieval by content. In this paper an image is not considered as a set of objects, is considered as a feature vector where its components represent a segment of color. Color is treated in another color space rather than to work on RGB space. For each image a fuzzy histogram is obtained in order to get for each image its own signature together whit its own feature vector. Fuzzy theory is applied to solve color uncertainty, which it comes from color quantification and human perception of colors. The whole set of images, which are in RGB representation are transformed to LAB model, obtaining better color representation in order to obtain a feature vector together with wavelet coefficients. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.