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

Cyber Worlds, 2002. Proceedings. First International Symposium on

Date 6-8 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings First International Symosium on Cyber Worlds

    Publication Year: 2002
    Save to Project icon | Request Permissions | PDF file iconPDF (305 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2002 , Page(s): 561 - 562
    Save to Project icon | Request Permissions | PDF file iconPDF (196 KB)  
    Freely Available from IEEE
  • A real-time configurable shader based on lookup tables

    Publication Year: 2002 , Page(s): 507 - 514
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3563 KB) |  | HTML iconHTML  

    This paper presents hardware architecture for a configurable shader with pre-filtered environment mapping and twist/bump pattern mapping. Our architecture enables per-pixel shading calculation, which can be programmed by means of lookup tables, random-access memories (RAMs) and read-only memories (ROMs), and provides real-time rendering with various shading and reflectance models, such as Blinn-Phong, Cook-Torrance, and Ward. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive function-based artistic shape modeling

    Publication Year: 2002 , Page(s): 521 - 528
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (778 KB) |  | HTML iconHTML  

    This paper addresses interactive function-based shape modeling where relatively small formulas are used rather than thousands of polygons. Interactive modification of the function model with concurrent visualization of the respective polygonal mesh provides both interactivity and any required level of detail leading to a photorealistic appearance of the resulting shapes. We have proposed a rendering method capable of handling local shape modifications with any desired precision. We have also proposed methods which let us accelerate the final function evaluation - a common bottleneck for function-based shape modeling. Finally, we describe applications of interactive function-based shape modeling to photorealistic virtual embossing and carving. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new QoS routing approach for multimedia applications based on genetic algorithms

    Publication Year: 2002 , Page(s): 289 - 295
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (324 KB) |  | HTML iconHTML  

    In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web-based software engineering education environment supporting collaboration between the teacher side and the student groups

    Publication Year: 2002 , Page(s): 323 - 330
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (608 KB)  

    Software development is knowledge-intensive work. In a software project, various types of problems need to be resolved. One approach to acquiring the knowledge necessary for software development in a university education environment is for the students to experience project-based software development. For this kind of education to succeed, collaboration is inevitable between both the teacher side (teacher and teaching assistants) and student groups and within the group membership. This paper describes a collaborative software engineering education environment that in particular focuses on supporting collaboration between the student groups and the teacher side, its application to a real class and the results. The system supports four aspects of collaboration; inspection, acceptance testing, comments attachment for artifacts, and informal communication. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchically structured constraint-based data model for solid modelling in a virtual reality environment

    Publication Year: 2002 , Page(s): 537 - 544
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (460 KB) |  | HTML iconHTML  

    A hierarchically structured constraint-based data model for solid modelling in a virtual reality environment is presented. The data model integrates a high-level constraint-based model for precise object definition, a mid-level CSG/Brep hybrid solid model for supporting hierarchical geometry abstractions and object creation, and a low-level polygon model for real-time visualization and interaction in the virtual reality environment. Constraints are embedded in the solid model and organized at different levels to reflect the entire solid modelling process from features and parts, to assemblies. This model not only provides precise object definition, but also supports real-time visualization and interaction in the VR environment. Furthermore, it has the potential to obtain precise 3D interactions and precise constraint-based manipulations can be deduced from the data model to carry out precise solid modelling in the VR environment. View full abstract»

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

    Publication Year: 2002 , Page(s): 225 - 229
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (319 KB) |  | HTML iconHTML  

    There is an increasing number of products to be saved in digital form. In the digital world, we can preserve products forever, but there are also disadvantages such as easy copying. The watermark is an important protection method in digital media. When a media is publicly available or put on a network, it is very easy to copy or be misappropriated. The author can prove ownership by using an open algorithm and security key to extract the watermark. Therefore, a watermark technique must resist attacks and cannot influence image quality. We propose an image watermark technique based on the spatial domain in a color image. We present experimental results which prove that our method can resist certain attacks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design patterns for topological modeling

    Publication Year: 2002 , Page(s): 455 - 462
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (387 KB) |  | HTML iconHTML  

    Theoretical frameworks of topological modeling and various potential applications have been proposed by Kunii and his collaborators. However serious applications are still wanted to prove the ubiquitous importance of the topological modeling technology. To accelerate progress in this field we need to pay more attention to design patterns that are to be shared among researchers and developers of topological modeling tools. This paper presents some useful patterns derived from experience in developing interactive topological modeling tools. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cybernarium Days 2002-A public experience of virtual and augmented worlds

    Publication Year: 2002 , Page(s): 553 - 560
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (725 KB) |  | HTML iconHTML  

    Are Virtual and Augmented Reality (VR/AR) well suited for entertaining and educating a lay audience? In this paper we try to find an answer to this question and work out the conditions and requirements for successful installations. We will describe our "test bed", the Cybernarium Days 2002, the world's first public exhibition exclusively dedicated to Virtual and Augmented Reality, which attracted more than 10.000 visitors in 6 days. We also present the results of the user questioning, which took place during the exhibition, and the "lessons learnt". Furthermore we focus on software aspects, which enabled us to use low cost hardware and offered a way to build new exhibits in a short time. Since the raise or fall of a VR/AR installation is mainly influenced by its user interface, we present a classification scheme for devices and outline their advantages and disadvantages, offering other VR/AR-developers a guideline for their work on public VR/AR-exhibits. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical image retouching method

    Publication Year: 2002 , Page(s): 480 - 487
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (570 KB) |  | HTML iconHTML  

    In this paper we present a novel fast algorithm for image retouching. A space-mapping technique is used to transform a missing (or damaged) part of a surface into a different shape in a continuous manner. Experimental results are included to demonstrate the feasibility of our approach. The proposed approach shows the obvious relationship between the surface retouching problem and image inpainting. We consider shape transformation as a general type of operation for restoring missing data, and attempt to approach the well-known problem of "fulfillment" of damaged or missing areas from a single point of view, namely, that of the space mapping technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From dual-cube to metacube: efficient low-degree alternatives to hypercube

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

    The hypercube has been widely used as the interconnection network in parallel computers. However, when dealing with the parallel computers of very large scale, the port limitation due to the technology greatly forbid the use of hypercube networks. The hypercube-based SGI Origin2000, a newly developed multiprocessor system, tried to solve this problem by introducing a Cray router. In this paper we first describe a hypercube-like network, called dual-cube, that was motivated by the structure of Origin2000. A dual-cube DC(m) has m+1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a node in another cluster. The dual-cube mitigates the problem of port limitation in the large-scale hypercube network while keeps most of the topological properties of the hypercube network. Then, we describe an interconnection network that extends dual-cube into a more general network called metacube. The metacube has a two-level cube structure with two parameters representing the dimensions of the two-level cubes. Metacube is much more flexible than dual-cube and can solve the port limitation problem completely. The dual-cube and metacube networks can be applied to SGI Origin2000 to connect large number of processors without using Cray router. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent based campus information providing system for cellular phone

    Publication Year: 2002 , Page(s): 339 - 345
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (930 KB) |  | HTML iconHTML  

    In this paper a campus information providing system (CIPS) for cellular phones is proposed. By using this system, the search time to find the necessary information in the campus is reduced. A user can access the system using the cellular phone terminal and by clicking the links or by inserting a keyword in the form they can get easily the campus information. The system has four agents which deals with Web information required by users, Net News, the student's login state, campus navigation and the filtering of the received campus information for cellular phone terminal. Therefore the proposed system can provide different media informations to a cellular phone. By using the proposed system, the users are able to get the information anywhere and anytime. The system performance was evaluated using a questionnaire. From the questionnaire results, we found that the system was able to show the required information. However the system operation should be improved and the information content should be shown better. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Function-based 3D web visualization

    Publication Year: 2002 , Page(s): 428 - 435
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (606 KB) |  | HTML iconHTML  

    This paper describes how the web-based visualization can be greatly improved using the function-based shape modeling technique. The improvement is possible because the proposed function-defined VRML shape node allows the content creators to describe any complex models with relatively small functions compared to the large-size polygonal mesh based VRML nodes. These function-defined shapes can be used together with the common VRML shapes. The proposed node has a few implementations capable of visualizing geometric shapes defined with HyperFun language as well as in any proprietary function-defined data formal. For fast visualization of the function-defined shapes, we have developed an improved continuation polygonization algorithm specifically designed for VRML visualization. The design, the implementation details, and the application examples of the proposed node are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the RNN to develop a Web-based pattern recognition system for pattern search of component database

    Publication Year: 2002 , Page(s): 146 - 153
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (811 KB) |  | HTML iconHTML  

    This study attempts to apply pattern recognition (PR) technologies with associative memory to real-time pattern recognition of engineering components using a client-server network structure in a Web-based recognition system. A remote engineer is able to draw directly the shape of engineering components using the browser, and the recognition system will search for the component database of a company using the Internet. Component patterns are stored in the database system. Their properties and specifications are also attached to the data field of each component pattern except that of engineering components. In our approach, the recognition system adopts parallel computing, and will raise the recognition rate. Our recognition system is a client-server network structure using the Internet. The system uses a recurrent neural network (RNN) with associative memory to perform training and recognition. The last phase utilizes the technology of database matching and solves the problem of spurious state. Our system will be used at the Yang-Fen Automation Electrical Engineering Company. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of SVD algorithm on the Trident processor

    Publication Year: 2002 , Page(s): 95 - 102
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1720 KB)  

    Within the current decade, process technology is promising one billion transistors on a single die, operating at frequency of from 6 to 10 GHz. As a direct result of the fundamental trends of increasing transistors density and switching speeds, newer technological and microarchitectural design constrains are introduced. Among them, wire delays will become critical. To take the benefits of the VLSI technology, we proposed Trident processor, which emphasizes on local communication. Like vector architectures, Trident processor extends a scalar core with parallel lanes; each lane contains an execution datapath and a slice of register file. However, Trident processor uses ring and communication registers, which are based on local communication, to store and cyclically shift 1-D data within and across the lanes, respectively. By using parallel datapaths, ring, and communication registers, Trident processor can effectively process not only vector but also matrix data. In this paper, the performance of the Trident processor on singular value decomposition (SVD) algorithm is evaluated. On 500×600 input matrix, four lanes Trident processor significantly reduces the number of instructions (44 times less), loop overhead (30 times less), and load/store operations (3 times less) comparing with a scalar code. Moreover, Trident processor is scalable and its scalability needs only replicating lanes to process longer vectors or larger matrices (eight lanes can speedup SVD by 2.5 times over four lanes). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process of software evolution

    Publication Year: 2002 , Page(s): 8 - 15
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (425 KB) |  | HTML iconHTML  

    A number of interesting phenomena can be observed when lifelong processes of object-oriented software are analyzed from the viewpoint of software evolution. This paper proposes a framework of software evolution studies and reports the results of empirical case studies and evolution patterns discovered through the analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategies to suppress productivity degradation with unknown issues under iterative development process

    Publication Year: 2002 , Page(s): 121 - 126
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (365 KB) |  | HTML iconHTML  

    Two different approaches in the iterative development process have been proposed for development projects using object technologies: the modeling intensive approach and the implementation intensive approach. The differences between the two approaches arise partly from differences in strategies to suppress productivity degradation by trial and error with unknown issues in development projects. Strategies of a typical modeling intensive approach, the UP (Unified Process), and those of a typical implementation intensive approach, XP (extreme programming), are discussed. To investigate the effectiveness of these strategies, implementation productivity and interface change rate are measured on a development project under the UP. A high interface change rate and low implementation productivity are observed in classes related to the solution domain. These measurement results support the effectiveness of the "suppression of rework" strategy and "suppression of change propagation" strategy, of the UP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile Distributed Web Server System

    Publication Year: 2002 , Page(s): 346 - 353
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (728 KB) |  | HTML iconHTML  

    The Internet traffic is growing rapidly in recent years. How to distribute the network traffic effectively is an important issue. In this paper, we propose a mobile distributed web server system to distribute Web content to the mobile servers around the world in inexpensive and effective way. The proposed method is fully compatible with current existing systems. In this paper, we discuss the Web content requesting imbalance (WCRI) problem and describe how this system is able to solve this problem. We also provide a possible implementation of a mobile distributed Web server system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vertically stacked Benes networks for crosstalk-free permutation

    Publication Year: 2002 , Page(s): 255 - 260
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (350 KB) |  | HTML iconHTML  

    Crosstalk in optical switching elements (SEs) is one of the major shortcomings in optical switching networks, and avoiding crosstalk is an important issue for proper optical network operation. We propose a new class of optical multistage interconnection networks (MINs)-vertically stacked Benes networks VSB(N, K) that have N inputs (outputs) and consist of K vertically stacked Benes networks. The VSB(N, K) network can support any permutation of an N-element set {0, 1, ..., N-1}. Complete algorithms to realize crosstalk-free permutation in a VSB(N, K) network are the main contributions of this paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct segmentation for reverse engineering

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

    In reverse engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate consecutive steps as surface fitting. In this paper we present a step segmentation method with subsequent classification of simple algebraic surfaces. Our method is direct in the sense that it operates directly on the point set in contrast to other approaches that are based on a triangulation of the data set. The segmentation process involves a fast algorithm for k-nearest neighbors search and an estimation of first and second order surface properties. First order segmentation, based on normal vectors, provides an initial subdivision of the surface and detects sharp edges as well as flat or highly curved areas. One of the main features of our method is to proceed by alternating the steps of segmentation and normal vector estimation. Second order segmentation subdivides the surface according to principal curvatures and provides a sufficient foundation for the classification of simple algebraic surfaces. If the boundary of the original object contains such surfaces the segmentation is optimized based on the result of a surface fitting procedure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HMM topology selection for on-line Thai handwriting recognition

    Publication Year: 2002 , Page(s): 142 - 145
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (423 KB) |  | HTML iconHTML  

    Researchers have extensively applied hidden Markov models (HMM) to handwriting recognition in English, Chinese, and other languages. Most researchers have used left-right topology for handwriting and speech recognition. This research studied the effect of HMM topology on isolated online Thai handwriting recognition. The left-right, fully connected and proposed topologies (left-right-left) were compared. The number of states of a character HMM for each topology was varied from 15 to 35 nodes and the one with the best training observations probability was selected. The feature used was chain code-like with modifications to represent original quadrant position. The recognition results showed that the proposed topology increases the recognition rate compared to the most widely used left-right topology. View full abstract»

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

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

    Cyber graphics as an emerging technology has been playing key roles as human interfaces of cyber worlds. With the ever increasing roles of cyber worlds in the real world, as seen in e-financial trading that deals the GDP equivalent in a day, understanding of cyber graphics is becoming essential. To this end, scientific research has been conducted to grasp the foundation as invariants. Cellular modeling has been found to be of key importance. The adjunction spaces and cell attaching functions of cyber graphics are investigated through a variety of examples to find the invariants successfully. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XML vs. Object-Oriented XML: Motivations, applications, and performance evaluation

    Publication Year: 2002 , Page(s): 371 - 377
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1604 KB) |  | HTML iconHTML  

    Currently, XML by itself is a flat structure used to describe structured document for data transfer. In this paper, through a Web based video application which uses enhanced XML descriptions for data transfer, we present an approach to convert the enhanced XML into Object-Oriented XML by integrating them into an object-oriented database (OODB). To enhance the functionality of the XML objects, methods are incorporated, making the efficient XML processing and retrieval to be possible. For higher query performance, we apply upon the XML objects the structural join index hierarchy (SJIH) which is an object indexing technique particularly suited to multimedia databases. The validity and effectiveness of this approach is demonstrated through an analytical evaluation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS control in group communication

    Publication Year: 2002 , Page(s): 282 - 288
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (317 KB) |  | HTML iconHTML  

    This paper discusses a communication model to exchange multimedia messages in a group of multiple processes. Quality of Service (QoS) required by an application has to be supported. In traditional communication protocols like TCP and RTP, a process can reliably deliver messages to one or more than one process, i.e. one-way transmission. In the group communication, a process sends multimedia messages to multiple processes while receiving multimedia messages from multiple processes in a group. In addition, messages are required to be causally delivered. We discuss how to transmit multimedia messages to each destination process so as to satisfy QoS requirement. View full abstract»

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