By Topic

Information Technology and Applications, 2005. ICITA 2005. Third International Conference on

Date 4-7 July 2005

Go

Filter Results

Displaying Results 1 - 25 of 158
  • Third International Conference on Information Technology and Applications - Cover

    Publication Year: 2005 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (919 KB)  
    Freely Available from IEEE
  • Third International Conference on Information Technology and Applications - Title Page

    Publication Year: 2005 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (39 KB)  
    Freely Available from IEEE
  • Third International Conference on Information Technology and Applications - Copyright Page

    Publication Year: 2005 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (46 KB)  
    Freely Available from IEEE
  • Third International Conference on Information Technology and Applications - Table of contents

    Publication Year: 2005 , Page(s): v - xx
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2005 , Page(s): xxi
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005 , Page(s): xxii - xxiii
    Save to Project icon | Request Permissions | PDF file iconPDF (23 KB)  
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2005 , Page(s): xxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (20 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2005 , Page(s): xxv
    Save to Project icon | Request Permissions | PDF file iconPDF (19 KB)  
    Freely Available from IEEE
  • "RoboPress" - An Automated Mobile Press for Manufacturing Concrete Products

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

    This paper presents innovative manufacturing and control procedures applied in the design, construction and operation, of a mobile hydraulic press machine (RoboPress). The research demonstrates how the design of an automated mobile manufacturing system can be optimized through using qualitative modeling and simulation from artificial intelligence View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Path Planning Based on New Repulsive Potential Functions with Angle Distributions

    Publication Year: 2005 , Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB) |  | HTML iconHTML  

    New repulsive potential functions (RPFs) for point robot path planning are presented, where the RPF for path planning has a different magnitude at each direction of a RPF based on the angle between a goal and an obstacle, unlike a conventional RPF in which the same magnitude at each direction is obtained. In doing so the RPF attempts to overcome some of the typical problems that may pose to the conventional RPF. In particular, this paper presents a set of analysis for designing potential functions to avoid local minima for a number of representative scenarios. Specifically the following cases are addressed: a non-reachable goal problem (a case that the potential of the goal is overwhelmed by the potential of an obstacle), an obstacle collision problem (a case that the potential of the obstacle is overwhelmed by the potential of the goal), and a narrow passage problem (a case that the potential of the goal is overwhelmed by the potential of two obstacles). The proposed RPF scheme eliminates the non-feasible area for the three cases by the help of angle varying magnitude between a goal and an obstacle View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Repulsive Force in Competitive Multi-Robot Teleoperation

    Publication Year: 2005 , Page(s): 15 - 20
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    This paper introduces a new application of a virtual repulsive force feedback (VRFF) in telegame, a competitive multi-robot teleoperation system. This system allows multiple users to play the game competitively over the Internet. To improve the teleoperator's situation awareness and enhance the control dexterity, many virtual reality approaches are used in the human machine interface. The VRFF is developed based on an orient cylinder bounding (OCB) collision detection algorithm. A teleoperation/telegame robot platform (TTRP) is built and a series of strong-interactive experiments have been conducted on it. In telegame, a 2 DOF force feedback joystick is employed as the master device and two remote users can control their robots dexterously and intuitively via the Internet, which verifies the feasibility and efficiency of VRFF in the Internet-based multi-operator-multi-robot teleoperation system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for Robot Writing Using Character Segmentation

    Publication Year: 2005 , Page(s): 21 - 24
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (100 KB) |  | HTML iconHTML  

    Currently, there are many ongoing researches that are targeted at making robots more human-like. One of the tasks that can be done by humans easily but is difficult to be done by robots is writing. In this paper, we are presenting a flexible algorithm that can allow a robot to write. This algorithm is based on character segmentation, where the main idea is to store character information as segments and the segment information can then be used by the robot to write. We have also developed a sample application using the proposed algorithm to allow a Mitsubishi RV-2AJ robotic arm to write English characters and numbers. Through our experiment, it has been proven that the algorithm developed is able to allow the robotic arm to write View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Ant Algorithm for Solving Robot Path Planning Problem

    Publication Year: 2005 , Page(s): 25 - 27
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (83 KB) |  | HTML iconHTML  

    Using ant algorithm, robot path planning in two-dimension environment is studied. It introduces the intelligent finding optimum mechanism of ant colony. It solves the drawback of local optimization and expedites searching speed. The mathematical model is established and the algorithm is achieved with VB language, the result shows it is valid with the capability of robust and extensibility View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Two Synaptic Weight Neural Networks for Nonlinear Control

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

    In this paper, adaptive identification and control of nonlinear dynamical systems are investigated using two synaptic weight neural networks (TSWNN). Firstly, a novel approach to train the TWSWNN is introduced, which employs an adaptive fuzzy generalized learning vector quantization (AFGLVQ) technique and recursive least squares algorithm with variable forgetting factor (VRLS). The AFGLVQ adjusts the kernels of the TSWNN while the VRLS updates the connection weights of the network. The identification algorithm has the properties of rapid convergence and persistent adaptability that make it suitable for real-time control. Secondly, on the basis of the one-step ahead TSWNN predictor, the control law is optimized iteratively through a numerical stable Davidon's least squares-based (SDLS) minimization approach. A nonlinear example is simulated to demonstrate the effectiveness of the identification and control algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Real-Time Traffic Pattern Detection for Dynamic Cache Size Tuning in Information Retrieval

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

    The novel RTPD/MACSC model proposed in this paper tunes the cache size adoptively on the fly. It combines the extant MACSC (model for adaptive cache size control) and the novel RTPD (real-time traffic pattern detection) capability. Similar to its MACSC predecessor, the new RTPD/MACSC tuner maintains the given cache hit ratio consistently and persistently. It, however, differs from its predecessor because it adapts itself to compensate for the ill effects on the cache hit ratio by the Internet traffic, which embeds various patterns over time. The automatic adaptation (self-tuning) capability in response to traffic pattern changes detected by the RTPD is called self-reconfiguration in the RTPD/MACSC context View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Research and Design of Business Component Reuse in Enterprise Information System Integration

    Publication Year: 2005 , Page(s): 41 - 44
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (70 KB) |  | HTML iconHTML  

    In this paper, the problem of business component reuse is researched in the integration of rapid reconfigurable enterprise information system. The model of function component is provided, which is based on analyzing and abstracting function commonness from different components in business component domain, the compiling parameters of function component denote a business component type, and the running parameters denote the difference of business components. At the same time, the syntax description of the function components is presented. The reuse of business component is improved in enterprise information system integration by designing function component View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Concurrency Control for Collaborative Office Systems

    Publication Year: 2005 , Page(s): 45 - 50
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (119 KB) |  | HTML iconHTML  

    As collaboration support for multiple users to work on the same Office documents becomes more and more desirable, some work has been done to provide real-time collaboration support for Microsoft Office. These systems use tightly coupled concurrency control mechanisms, which directly determine their collaboration support capabilities as well as implementation complexities. In this project, we choose StarOffice as the platform to drive our research on collaboration support for Office systems, where a flexible concurrency control framework is proposed. In this framework, concurrency control mechanisms are decoupled from the rest of system in such a way that multiple concurrency control mechanisms are offered for users to choose from according to their specific collaboration situations, and that new concurrency control mechanisms can be easily added to the system without touching the code of existing concurrency control mechanisms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cost Effective Spacial Redundancy with Data-Path Partitioning

    Publication Year: 2005 , Page(s): 51 - 56
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (129 KB) |  | HTML iconHTML  

    In order to maintain the high reliability of a computer system, it is necessary to detect the failure leading to a fault. In general, fault can be detected by exploiting time redundancy or spatial redundancy. However, it negatively affects on either hardware cost or processor performance. To solve the cost-performance issue, in this paper, we propose a concept of cost-effective approach to achieve spatial redundancy for dependable processors. In addition, we perform a primly evaluation for the impact of our method on processor performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partition-Based Parallel PageRank Algorithm

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

    A re-ranking technique, called "PageRank", brings a successful story behind the Googletrade search engine. Many studies focus on finding an efficient way to compute the PageRank scores of a large web graph. Researchers propose to compute them sequentially by reducing the I/O cost of disk access, improving the convergence rate, or even employing peer-2-peer architecture, etc. However, only a few concentrate on computation using parallel processing techniques. In this paper, we propose a partition-based parallel PageRank algorithm that can efficiently be run on a low-cost parallel environment like PC cluster. For comparison, we also study other two well-known PageRank techniques, and provide an analytical discussion of their performance in terms of I/O and synchronization cost, as well as memory usage. Experimental results show a promising improvement on a large artificial web graph synthesized from the TH domain View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending Metadata with Scenarios in Adaptive Distributed System

    Publication Year: 2005 , Page(s): 63 - 68
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (115 KB) |  | HTML iconHTML  

    The traditional metadata cannot provide enough support for the adaptive distributed systems. In this paper, we propose a metadata extension that uses the scenarios as semantic aspect, describing the expected interaction sequence based on XML schema. With such constraints, resource waste and further damages can be avoided by preventing the illegal interactions at runtime. This extension is more valid and user-friendly than the majority of the existing proposals, avoiding the potential inconsistency. A prototype has been developed to illustrate the applicability of the extended metadata. The experiments demonstrate that the prototype introduces an average overhead ratio of 6.4% in the inter-process interactions and only 0.27% in the remote interactions. The approach presented in this paper is suitable for the adaptive distributed systems and affords more guarantee of reliability View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Disk Reconfiguration with Performance Guarantees in Shared Storage Environment

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

    In this paper, we present a novel approach of virtual disk reconfiguration with performance guarantee in shared storage environment, which is important for storage maintenance tasks, especially for load balance. It identifies the surplus I/O resource of storage pools after satisfying performance requirement of virtual disks through EPYFQ scheduling algorithms, and gives high priority of using these I/O resources to data migration tasks. Moreover, our approach divides data migration task into multiple storage transactions, which can protect the consistency of the data in reconfigured virtual disks, such that the application I/O and migration I/O can execute concurrently. We also implement our approach into E-DM (enhanced device mapper), a kernel module of Linux, and evaluate it. The result shows that the IOPS of virtual disks is decreased not more than 3% during reconfiguration View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Wallet-Size Cluster for H.264 Encoding

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

    A scalable wallet-size cluster computing system has been proposed to obtain low cost, low power consumption and small sized digital home processing center. In this paper, we apply the wallet-size cluster for H.264 encoding to accelerate the H.264 video processing. We analyze the encoder scheme of the H.264, and perform the H.264 encoding in parallel through the nodes of the cluster. The experimental results show that an efficient real time video processing for H.264 can be achieved View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • E-DM: A QoS-Enabled Storage Service Schedule System in Shared Storage Environment

    Publication Year: 2005 , Page(s): 81 - 84
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (114 KB) |  | HTML iconHTML  

    This paper introduces E-DM, a QoS-enabled storage service schedule system, which provides performance virtualization in shared storage environment. It uses EPYFQ scheduling algorithm to schedule requests from virtual disks according to their shares, and can satisfy the following three requirements demanded by performance virtualization, performance isolation, fairness and throughput. We also evaluate E-DM from the above three aspects. Our results show that E-DM has good ability of performance isolation and fairness. Besides, we can adjust the tradeoff between tight resource control and throughput of storage system through the parameter epsiv View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing the Same Operation with a Large Number of Users Using P2P

    Publication Year: 2005 , Page(s): 85 - 88
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (153 KB) |  | HTML iconHTML  

    A computer assisted teaching system which enables sharing the same operation with a large number of users using P2P is shown. The users of this system can share the same operation of applications such like a text editor, a draw program and others, on their computer terminals in real-time. This system can show an operation on a terminal to all terminals in the latency of O(log N) time complexity, where N is the number of terminals. In order to share the same operation on computer terminals, at most one operation must be performed on them at a time. In order to realize this, a mutual exclusion algorithm is embedded in this system. The time complexity of entering the critical section is O(log N). We have compared the performance of this system with the performance of a client-server system. A game could be played by remote users using this system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Internet-Enabled Setup Planning System

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

    In this paper, an Internet-enabled system has been developed to support setup planning, based on some state-of-the-art Java and Web technologies. The utilizing of XML as a file format provides means for the transfer of information between various manufacturing systems. A fuzzy set theory based intelligent approach for setup planning is introduced. In this approach, the setups are automatically planned based on key factors of machining practice, tolerance requirement and manufacturing cost. Finally, a case study is presented to illustrate the proposed system and to show the effectiveness of the presented setup planning approach View full abstract»

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