By Topic

Computer and Information Science, 2008. ICIS 08. Seventh IEEE/ACIS International Conference on

Date 14-16 May 2008

Filter Results

Displaying Results 1 - 25 of 121
  • [Title page i]

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):v - xiii
    Request permission for commercial reuse | PDF file iconPDF (207 KB)
    Freely Available from IEEE
  • Message from the Conference Chairs

    Publication Year: 2008, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (123 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2008, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (127 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organizers

    Publication Year: 2008, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2008, Page(s):xvii - xix
    Request permission for commercial reuse | PDF file iconPDF (134 KB)
    Freely Available from IEEE
  • Software Architectures for Task-Oriented Computing

    Publication Year: 2008, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Summary form only given. Recent advances in ubiquitous computing, autonomic computing, and artificial intelligence have led to a desire to better support user-oriented tasks by placing more intelligence in the computing infrastructure. This infrastructure helps mediate between computing resources and legacy applications on the one hand, and a user's high-level goals on the other hand. In this talk... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues and Models of Security Oriented Systems

    Publication Year: 2008, Page(s): 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (135 KB)

    Summary form only given. Virus infestation is rampant in today's internet based IT activities. The viruses (including worms, and Trojan Horses) are constantly and rapidly created to damage e=commerce and web based application. Importantly, they corrupt communications, valuable databases and disrupt service oriented functions. In the future, they can severely hurt the new applications spanning from... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rate Control Protocol for High Speed Streaming Video

    Publication Year: 2008, Page(s):7 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB) | HTML iconHTML

    In this paper, we propose a rate control for high speed streaming video, which is based on scalable TCP and TEAR. Scalable TCP offers an effective and robust mechanism for bulk data transmitting in high bandwidth-delay network. However it has a big rate oscillation when transmitting video data. TEAR is a rate control protocol that emulates TCP at receivers, which is suitable for streaming video, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaboration between Security Devices toward improving Network Defense

    Publication Year: 2008, Page(s):13 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Internet technologies have been applied to many areas such as tax payments, electronic auctions, electronic commerce, electronic voting; so it is very important to protect these applications and network devices from data tapped or counterfeited by malicious attackers. To guard against these malicious attacks, different network security devices are designed, such as firewalls, intrusion detection a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust Mechanism in Distributed Access Control Model of P2P Networks

    Publication Year: 2008, Page(s):19 - 24
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    Peer-to-peer network technologies have gained popularity without the need for centralized servers. With the consistent development of the network, the existing techniques about access control could not resolve the security issues in P2P networks perfectly. How to realize the trust mechanism in access control system is an important subject of P2P security research. In this paper, we analyze the lac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System

    Publication Year: 2008, Page(s):27 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    This paper presents convergence analysis of Jacobi iterative method using logarithmic number system (LNS) for solving linear systems, where multiplications and divisions are replaced with additions and subtractions, respectively. Two major factors are identified and considered in our convergence analysis. First, in any hardware architecture for Jacobi iterative method, only a set of unknowns can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective RTL Method to Develop On-Line Self-Test Routine for the Processors Using the Wavelet Transform

    Publication Year: 2008, Page(s):33 - 38
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    In this paper, we introduce a new efficient register transfer level (RTL) method to develop on-line self- test routines. We consider some prioritizations to select the components and instructions of the processor. In addition, we choose test patterns based on spectral RTL test pattern generation (TPG) strategy. For the purpose of spectral analysis, we use the wavelet transform. Also, we use a few ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison between New Quantum Approaches for Finding the Minimum or the Maximum of an Unsorted Set of Integers

    Publication Year: 2008, Page(s):41 - 46
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    The change has already begun. It is not a simple change but a revolution in the sense of speed and its impact. In this paper we are going to discuss on quantum computer as a physical system and discuss on its main weakness and then based on our new approach we have solved a problem for finding the minimum or the maximum of a set of integers which has not been solved based on previous quantum compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph

    Publication Year: 2008, Page(s):47 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    In this paper we evaluate our presented Quantum Approach for finding the Estimation of the Length of the Shortest Path in a Connected Weighted Graph which is achieved with a polynomial time complexity about O(n) and as a result of evaluation we show that the Probability of Success of our presented Quantum Approach is increased if the Standard Deviation of the Length of all possible paths between S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Real -Time Interactive Visualization System for DNS Amplification Attack Challenges

    Publication Year: 2008, Page(s):55 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    Domain Name Service (DNS) amplification attack has become a serious issue for network security because small queries can generate massive amounts of UDP packets in response to flood the target server. This paper presents our work to develop a real-time interactive visualization system (RTIVS) for DNS amplification attack to help administrators visualize and analyze traffic, and detect the DNS ampl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Radix Plus Length Based Insert Sort

    Publication Year: 2008, Page(s):61 - 66
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB) | HTML iconHTML

    Many applications depend on efficient sort algorithm to sort large sets of distinct string keys in memory. For example, sorting records for databases in which type of prime key is string. We propose a new improved radix sort algorithm, radix plus length based insert sort algorithm(R-LI), to sort large sets of string keys. The algorithm are used to sort set with length-changeable string key. R-LI a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Integer Linear Programming Approach for Dedicated Machine Constraint

    Publication Year: 2008, Page(s):69 - 74
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous researches either did not take the constraint into account or the proposed heuristic approach might not fit the fast-changing market of semiconductor manufacturing. In this paper, we propose a new framework for the issue of the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Complex Event Processing over RFID Data Stream

    Publication Year: 2008, Page(s):75 - 81
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 KB) | HTML iconHTML

    RFID technology holds the promise of real-time identifying, locating and monitoring physical objects. To achieve these goals, RFID events need to be collected efficiently and composed expressively. Furthermore, these events have unique characteristics, such as locomotive, temporal and history oriented which should be considered and integrated into an event engine model. The diversity of RFID appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tabu Search Solution for Fuzzy Linear Programming

    Publication Year: 2008, Page(s):82 - 87
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (175 KB) | HTML iconHTML

    In this paper, a tabu search (TS) method is proposed to find a global solution for fuzzy linear programming (FLP). Two additional factors, distribution factor (DF) and similarity factor (SF), are also introduced for TS to enhance the searching performance. The application of DF and SF makes the TS to surf in a larger search space and reduces the possibility of re-searching the visited areas. A sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temperature Control for the Thermal Cycling of Polymerase Chain Reaction

    Publication Year: 2008, Page(s):88 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    DNA is a double-stranded chain of nucleotides, in order to make a huge number of copies of DNA segments, polymerase chain reaction (PCR) is the easy method for generating copies of DNA by rapid heating and cooling controlled automatically. Based on the properties of the thermal cycling of PCR, a rational approach for the temperature control of the PCR device is proposed, it consists of Feed-forwar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Algorithm for Closed Cube Computation

    Publication Year: 2008, Page(s):95 - 99
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    Closed cubing is a very efficient algorithm for data cube compression proposed recently in the literature. It losslessly condenses a group of cells into one cell if these cells have the same aggregate value and preserve roll-up/drill-down semantics. Despite its importance, parallel closed cubing solutions for huge data sets are not well studied so far to the best of the authors' knowledge. This pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Structural Index for Graph-Structured Data

    Publication Year: 2008, Page(s):100 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    To speed up queries over XML and semi-structured data, a number of structural indexes have been proposed. The structural index is usually a labeled directed graph defined by partitioning nodes in the XML data graph into equivalence classes and storing equivalence classes as index nodes. On the basis of the Inter- Relevant Successive Trees (IRST), we propose an efficient adaptive structural index, ... View full abstract»

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