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]

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

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

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

    Page(s): v - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (207 KB)  
    Freely Available from IEEE
  • Message from the Conference Chairs

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • Message from the Program Chairs

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (127 KB)  
    Freely Available from IEEE
  • Conference organizers

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (112 KB)  
    Freely Available from IEEE
  • Program Committee

    Page(s): xvii - xix
    Save to Project icon | Request Permissions | PDF file iconPDF (134 KB)  
    Freely Available from IEEE
  • Software Architectures for Task-Oriented Computing

    Page(s): 3
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 I survey recent research in developing software architectures to support these new capabilities. Key features of these architectures are the ability to interface with legacy applications, but still add considerable support for user tasks; the ability to incorporate machine learning so that the system adapts to the user over time; and the ability to cope with resource variability and user mobility. I outline some of the consequent software engineering challenges that arise in this setting. 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

    Page(s): 4
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 health care to home appliance control. We shall present a broad discussion on a few mostly software engineering topics, pointing out their relevance and relationship to IT security issues. 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

    Page(s): 7 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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, and however it is TCP friendly and keeps the same low utilization as TCP in high-speed network environment. RDSTCP adopts TEAR idea, emulates scalable TCP at receiver. RDSTCP shifts most functions of scalable TCP to the receiver, and reduces the rate oscillation as well as keeping high link utilization. In the end, we emulate and evaluate RDSTCP performance by using NS2. 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

    Page(s): 13 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 and prevention systems, vulnerability scanner, honeypot and so on. However, all these security devices can not guarantee computer systems protection because each one is implemented as a stand-alone system for solving a particular security problem and it is not designed to communicate with the others. The focus of this work is encompassing a security infrastructure where multiple security devices form a global security layer. Each component is defined with respect to the others and interacts dynamically and automatically with the different security devices. 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

    Page(s): 19 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 lack of trust mechanism in the existing access control models, and present a recommendation trust model based on reputation. We introduce the related concepts in the trust model and explain the mechanism of trust. Then, a protocol of trust query is designed and calculations about trust are given. At last, we validate the availability of the trust model, and applied it in the existing access control model. The combining of trust mechanism and access control technologies makes the P2P networks securer. 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

    Page(s): 27 - 32
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 be processed in parallel due to the constraint of hardware resources. Secondly, the conversions of logarithm-to-floating-point and floating-to-logarithm introduce additional error. The convergence analysis demonstrates to what extent the hardware resource constraints and additional conversion error affect the convergence of Jacobi iterative method. 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

    Page(s): 33 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 extra instructions for the purpose of the signature monitoring to detect control flow errors. We demonstrate that the combination of these three strategies is effective for developing small test programs with high fault coverage in a small test development time. In this case, we only need the instruction set architecture (ISA) and RTL information. Our method not only provides a simple and fast algorithm for on-line self-test applications, also gains the advantages of utilizing lower memory and reducing the test generation time complexities in comparison with proposed methods so far. We focus on the application of this approach for Parwan processor. We develop a self-test routine using our proposed method for Parwan processor and demonstrate the effectiveness of our proposed methodology for on-line testing by presenting experimental results for Parwan processor. 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

    Page(s): 41 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 computing approach with time complexity about O(1) and then we evaluate and comprise it with another quantum algorithm with time complexity about 0(1+radic(n)) which also is given by us and as a result we show that if the size of quantum resister is low then our first quantum approach which has lower time complexity is satisfactory and if the size of quantum register is high then as the probability of success of our first approach decreases so our second approach is more convenient. 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

    Page(s): 47 - 54
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 Source and Target vertices is increased also we show that if the Standard Deviation is low nevertheless our Quantum Computation Approach is satisfactory and even the standard deviation is exactly zero the probability of Success of our Quantum Approach is not only zero but also is %100. Also we present a Classic Parallel Approach for finding the Estimation of the Length of the shortest path and then as a comparison between our Quantum Computation and Classic Parallel Approaches we show that even by applying the Classic Parallel Approach the problem can be solved with time complexity about O(log(2n -1)). 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

    Page(s): 55 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 amplification attack. The design of the RTIVS is based on the characteristics of the DNS amplification attack. It provides two modes that are a manual mode and an automatic mode to support reasoning and identify DNS amplification attacks. A graphic user interface is implemented to allow administrators to easily monitor network activity and analyze the large amount of UDP packets in real time. The interactive GUI also supports combination of the administrator's knowledge, experience and judgment into the system. 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

    Page(s): 61 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 algorithm is improvement ofR-S algorithm given by M.DONALD Ma- claren at 1966. Any radix sort method can be used as the first step of R-LI algorithm. The algorithm are based on characters which we give in this article as theorems. Detailed performance analysis is also given. R-LI algorithm is very faster than any simple radix sort which be used as first step of R-LI algorithm. 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

    Page(s): 69 - 74
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 dedicated machine constraint in semiconductor manufacturing based on an Integer Linear Program (ILP) framework. The ILP framework provides an efficient approach to minimize the producing cost and obtain a global optimal solution in an efficient time. We also present the experiments to validate the proposed approach. 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

    Page(s): 75 - 81
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 applications poses further challenges to a generalized framework for RFID events processing. In this paper, the Expressive Stream Language is utilized to collect vast number of primitive events efficiently. Moreover, we introduce a novel semantics to meet requirement of expressive event composition. At last, we use Timed Petri Net to model our newly RFID complex event engine. By introducing typical applications scenarios, we evaluate the validity and effectiveness of our RFID event processing system. 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

    Page(s): 82 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 simulation is done to show the efficiency of the proposed study. 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

    Page(s): 88 - 92
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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-forward, Bang-bang and adaptive PID controller. The experimental results demonstrate that the proposed control method is more stable and efficient. Index terms- Polymerase chain reaction, thermal cycling, temperature control, adaptive PID. 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

    Page(s): 95 - 99
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 paper presents a parallel closed cube construction and query algorithm over low cost PC clusters using the MapReduce framework. In addition, we proved that with the number of data blocks increases, the closed cubes' storage size decreases gradually. Thus users can specify the number of data blocks to balance the performance between cubes storage and query time. Experimental study demonstrates that our algorithm is efficient and scalable. 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

    Page(s): 100 - 106
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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, IRST(k)-index. Compared with the previous indexes, such as the A(k)'-index, D(k)- index, and M(k)-index, our experiment results show that the IRST(k)-index performs more efficiently in terms of space consumption and query performance, while using significantly less construction time. View full abstract»

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