By Topic

Computing, Engineering and Information, 2009. ICC '09. International Conference on

Date 2-4 April 2009

Filter Results

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

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

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

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

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

    Publication Year: 2009 , Page(s): v - x
    Save to Project icon | Request Permissions | PDF file iconPDF (177 KB)  
    Freely Available from IEEE
  • Conference Information

    Publication Year: 2009 , Page(s): xi - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (53 KB)  
    Freely Available from IEEE
  • Refactoring Effect on Cohesion Metrics

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

    Developers and designers always strive for quality software. Quality software tends to be robust, reliable and easy to maintain, and thus reduces the cost of software development and maintenance. Class cohesion is an important internal quality attribute. Several methods have been applied to improve software quality; refactoring is one of those methods. The goal of this paper is to investigate whether refactoring improves software quality, by improving class cohesion. This is done by examining different cohesion metrics values after refactoring is applied. We found that in general refactoring indeed improves class cohesion values. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Mathematical Analysis of a Data-Grid Push Service for Disaster Management Response Scenarios

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

    Current developments in grid technologies involve fluid and dynamic interactions between service providers and service consumers. We are particularly interested in a notable obstacle, namely how to keep service consumers informed of relevant changes about data committed in multiple and distributed service provider levels, and most importantly, when these changes can affect others well-being. To achieve this,we use an aggregated service case scenario to demonstrate the need for a data-grid push service in disaster management response operations. With this in mind, the paper describes in detail the model architecture in the form of a UML activity diagram, as well as its mathematical modeling analysis for keeping interested stakeholders informed automatically about relevant and critical data changes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Ontology to Support Empirical Studies in Software Engineering

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

    Ontologies are semantically organized collections of information pieces. Ontologies provide a way of organizing and encoding the collected knowledge for a given domain. Formalizing the accumulated knowledge in such a framework enables all sorts of automated analysis. We present an ontology for analyzing empirical studies of software engineering, in particular the design of software engineering experiments. The design of such experiments consists of assigning human subjects to apply treatments, such as techniques or tools, to artifacts such as code or specifications. The particular design and available treatments depend on the goals of the experiment. Provisions for addressing various threats to validity constrain the available design space. Furthermore, the assignments have to be consistent with the available resources. By encapsulating the existing knowledge on designing experiments, we posit that it is possible to check a given design for validity and consistency. We present a case study encoding software inspection experiments into an ontology and show how we can use it for checking a proposed design for a new inspection experiment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Aspects of the Calculation of Isometry Groups in General Relativity

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

    We describe the ideas behind the package `isometry', implemented in Maple to calculate isometry groups of dimensions 2, 3 and 4 in General Relativity. The package extends the functionality of previous programs written to perform invariant classification of space-times in General Relativity. Programming solutions used to surmount problems encountered with the calculation of eigenvectors and the determination of the signs of expressions are described. We also show how the package can be used to find the Killing vectors of a space-time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on the Performance of Sparse Matrix-vector Multiplication with Column Reordering

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

    We revisit ordering techniques as a preprocessing step for improving the performance of sparse matrix-vector multiplication (SpM x V) on modern hierarchical memory computers. In computing SpM x V the main purpose of ordering of columns (or rows) is to improve the performance by enhancing data reuse. We present a new ordering technique based on the binary reflected gray codes and experimentally evaluate and compare it with other column ordering techniques from the literature. The results from numerical experiments with very large test matrices clearly demonstrates the performance gains rendered by our proposed technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demonic Semantics and Fixed Points

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

    We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove that this greatest fixed coincides with the least fixed point with respect to the usual ordering (angelic inclusion) of the same function. This is followed by an example of application. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Formula for the nth Derivative and the nth Anti-Derivative of the Power-Logarithmic Class

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

    We give a complete solution to the problem of finding the nth derivative and the nth anti-derivative, where n is a real number or a symbol, of elementary and special classes of functions. In general, the solutions are given through unified formulas in terms of the Fox H-function which in many cases can be simplified for less general functions. In this work, we consider the class of the power-logarithmic class { f(x):f(x)=Sigmaj=1 lscrpj(xalpha j)ln(betajxgamma j+1)} (1) where alphajisinCopf, betajisinCopf{0}, gammajisinRopf{0}, and pj's are polynomials of certain degrees.One of the key points in this work is that the approach does not depend on integration techniques. The arbitrary order of differentiation is found according to the Riemann-Liouville definition, whereas the generalized Cauchy n-fold integral is adopted for arbitrary order of integration. A software exhibition will be within the talk using the computer algebra system Maple. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Face Recognition Using Incremental Principal Components Analysis

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

    Human face recognition plays a significant role in security applications for access control and real time video surveillance systems, and robotics. Popular approaches for face recognition, such as principal components analysis (PCA), rely on static datasets where training is carried in a batch-mode on a pre-available image set. Real world applications require that the training set be dynamic of evolving nature where within the framework of continuous learning new training images are continuously added to the original set; this would trigger a costly frequent re-computation of the eigen space representation via repeating an entire batch-based training that includes the new images. Incremental PCA methods allow adding new images and updating the PCA representation, and offer the advantage of dispensing with the recently added images after model update. In this paper, various incremental PCA (IPCA) training and relearning strategies are proposed and applied to the candid covariance-free incremental principal component algorithm. The effect of the number of increments and size of the eigen vectors on the correct rate of recognition are studied. The results suggest that batch PCA is inferior to the four considered IPCA1-4, and that all IPCAs are practically equivalent with IPCA3 yielding slightly better results than the other IPCAs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pyramid-Based Watermarking Technique for Digital Color Images Copyright Protection

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

    This paper proposes a pyramid-wavelet watermarking scheme for ownership verification of digital color images. The discrete wavelet transform (DWT) has been used extensively in recent years in watermarking systems. It provides the necessary perceptual invisibility and robustness. In this paper, a pre-DWT process is implemented using optimal pyramid transform (OPT), where one of the error images that are resulted from the pyramid transform is decomposed using DWT, and a watermark is inserted in one of its colors; red, green, or blue. Then, the watermarked color image is reconstructed. The filters used for OPT and DWT decomposition are randomly generated to increase the security of this algorithm. The simulation results show that the proposed algorithm achieves high average correlation against Gaussian and salt-and-paper noise. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-Dimensional Geometric Transforms for Edge Detection

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

    Wavelet multiresolution adaptive methods are known to provide efficient schemes for detecting and processing edges, and reducing noise in images. However, they introduce oscillations around edges. Methods based on diffusion equations have been used to enhance the edges in images and to reduce oscillations around the edges but are likely to introduce noise around the edges. In this paper, we provide a scheme that combines the edge detection properties of wavelets and the edge enhancing properties of diffusion equations there by reducing the noise and the oscillation around the edges. Our results indicate that the scheme using curvelets out performs the one with two-dimensional tensor product of Daubechies wavelets, and that using just the diffusion equations when these schemes are applied to a noisy image. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-modal Images Contrast Enhancement Using Histogram Specification with Gamma Distribution

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

    Contrast enhancement occupies an important part of image enhancement area. This paper proposed a contrast enhancement method which is based on the modification of image's histogram using histogram specification (HS) and gamma distribution. In fact, this work aims to complete the work of Al-Manea and El-Zaart to include multi-modal images since their work can deal only with bi-modal images. The proposed method in this paper begins by reading the image and getting the statistical information of the original histogram using maximum likelihood gamma distribution (MLGD). Then, it generates the desired histogram by separating image modes using several shifting processes applied on each two successive modes. At the end, it generates the enhanced image using HS. Finally, the proposed method has been implemented and tested using various multi-modal gray-level images where experimental results showed an improvement in the contrast of these images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GIMS-Technology in Environmental Problems

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

    GIMS-technology (GIS+Model) combining the methodic and algorithms of mathematical modeling with the land and remote observations of the environment. Links between experiments, algorithms, and models of environmental processes and subsystems are developed to realize effective procedure for the operative control and diagnostics of the environment. The GIMS (Geoinformational Monitoring System) functions include: acquisition and accumulation of data by means of in situ and remote methods and their analysis with the subsequent subject processing; systematic observation and evaluation of the environment; evaluation and synthesis of knowledge concerning the atmosphere, soil-plant cover, and water medium change; predetermination of the forecasting diagnostics of the environment change under anthropogenic forcing; analysis of the tendencies in the environmental processes when the anthropogenic scenarios are realized; identification of causes of ecological disturbances and danger warning. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PADMA Database: Pathogen Associated Drosophila MicroArray Database

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

    We present the development of new database, called PADMA, for easy retrieval of genes whose expression is altered by parasitoid infections. The database also houses gene expression data sets from Drosophila blood cells after immune activation. The PADMA system will allow a user to compare genes whose expression is altered after infection by a single or multiple pathogens. Such capability is not publicly available to the Drosophila research community. The PADMA system is currently being tested in-house for public release. We describe the motivation for this research and a detailed account on the design of the database to promote data sharing among users and applications in the context of genome biology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negative Database for Data Security

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

    Data security is a major issue in any Web-based application. There have been approaches to handle intruders in any system, however, these approaches are not fully trustable; evidently data is not totally protected. Real world databases have information that needs to be securely stored. The approach of generating negative database could help solve such problem. A negative database can be defined as a database that contains huge amount of data consisting of counterfeit data along with the real data. Intruders may be able to get access to such databases, but, as they try to extract information, they will retrieve data sets that would include both the actual and the negative data. In this paper we present our approach towards implementing the concept of negative database to help prevent data theft from malicious users and provide efficient data retrieval for all valid users. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Supporting Multiple Quality-of-Services Classes in Mobile WiMAX Handoff

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

    IEEE 802.16 WiMAX (Worldwide Interoperability for Microwave Access) is a major standard technology for wireless metropolitan area networks. Quality-of-service (QoS) scheduling classes and mobility management are two main issues for supporting seamless high-speed communications. Previous works on WiMAX handoff however have mainly addressed a particular scenario or a specific QoS class. This work proposes a context-sensitive handoff scheme that supports the five IEEE 802.16 QoS scheduling classes.Furthermore, it is energy-aware - it may switch to energy-saving mode during a handoff. Performance evaluation shows that,comparing with three existing methods, the proposed scheme successfully supports the five QoS classes in both layers 2 and 3 handoff, reduces end-to-end handoff delay, delay jitter, and service disruption time. It also increases throughput and energy efficiency.We believe that this work is a significant contribution on providing high-quality, seamless data and media streaming over IEEE802.16 networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular Grouping Broadcasting Plans in Wireless Mobile Environment

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

    The broadcast problem including the plan design is considered. The data are inserted and numbered at predefined order into customized size relations. The server ability to create a full, Regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Regular Geometric Algorithm (RGA) prepares a RBP and enables the users to catch their items avoiding energy waste of their devices. Moreover, the Grouping Method Algorithm (GMA) based on integrated relations can guarantee the discrimination of services using all the available number of channels. This last property among the self-monitoring, self-organizing, can be offered by servers today providing also channel availability and less energy consumption by using smaller number of channels. Simulation results are provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Analysis of Confidentiality-Enhanced Multipath Streaming in Multi-Hop Wireless Networks

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

    High security and low energy consumption are two of the most important features in implementing today's wireless network systems and applications. They are not totally unrelated in terms of system design. In fact, there is a tradeoff relationship between security and energy. Generally the more secure a system is, the more energy it consumes. In this paper, we integrate a confidentiality (security) enhancement technique with an energy-saving scheme together, and analyze its power consumption. The multipath data allocation improves confidentiality, and the interference-aware minimum energy routing preserves transmission power. Based on our investigation, low density wireless networks can provide both enhanced security and reduced energy consumption at a reasonable level. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting Heterogeneous Interfaces in Mobile Ad hoc Networks

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

    In this paper, we enhance AODV to exploit heterogeneous communication interfaces in a real-world mobile ad hoc network testbed. The aim is to provide an end-to-end communication abstraction that hides heterogeneity. The anticipated algorithm introduces features like backup routes and delay aware routing to improve AODV's performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Skipping SvS Intersection Algorithm

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

    In this paper, we propose to improve the SvS algorithm by skipping elements of the smaller set for reducing a search boundary. The boundary of skipped element is determined by boundaries of elements prior to and next to it. We perform experiments on uniformly distributed random datasets to compare our algorithm with the standard SvS. We use regression analysis to get an equation for determining an appropriate skipping number. Our results show that the skipping SvS algorithm using the equation obtained can reduce approximately 41% on the number of comparisons of the standard SvS algorithm. View full abstract»

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