Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

New Trends in Information and Service Science, 2009. NISS '09. International Conference on

Date June 30 2009-July 2 2009

Filter Results

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

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

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

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

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

    Publication Year: 2009 , Page(s): v - xxii
    Save to Project icon | Request Permissions | PDF file iconPDF (207 KB)  
    Freely Available from IEEE
  • Message from the General Co-chairs

    Publication Year: 2009 , Page(s): xxiii - xxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Program Co-chair

    Publication Year: 2009 , Page(s): xxv
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • Message from the Publicity Co-chair

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

    Publication Year: 2009 , Page(s): xxvii - xxviii
    Save to Project icon | Request Permissions | PDF file iconPDF (143 KB)  
    Freely Available from IEEE
  • International Committee

    Publication Year: 2009 , Page(s): xxix - xxxii
    Save to Project icon | Request Permissions | PDF file iconPDF (163 KB)  
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009 , Page(s): xxxiii - xxxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (112 KB)  
    Freely Available from IEEE
  • 3D Emotional Rendering Method via Coloration and Shading in Virtual Character Design

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

    An available high quality and real-time rendering method was presented by applying various shading to the objects like a character that configuring contents in virtual environment, thanks to the development of 3D rendering technology. Based on the coloration for 3D emotional rendering, at the same time, many kind of shaders that occurring effects of chrome, glass, bump for reality, were proposed. The proposed emotional rendering system provides the 3D virtual contents with which an easy, fast contents making, and various set up, optimal end products making are possible. It would present the way and direction of emotional rendering to provide various contents making in virtual environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Demand Driven Web Service Lifecycle

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

    Web service lifecycle is a fundamental topic for Web services and service computing. This article will examine web service lifecycle and propose a demand-driven model for Web service lifecycle taking into account the demand of the main parties in Web services. The proposed approach will facilitate the research and development of Web services, e-services, service intelligence and service computing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Failure Detector for P2P Storage System

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

    P2P storage systems have a lot of attractive advantages, such as self-organizing, scalability, robust and fault-tolerant. Unfortunately, there are some problems in real network conditions, especially, when considering asynchronous wide-area networks, where messages may be delayed indefinitely and nodes may fail. So, failure detector is one of basic components to build a reliable P2P storage systems. Considering the highly dynamic characteristics of distributed system, a novel dynamic failure detector, which can combine heartbeat strategy with unbiased grey prediction model, is designed to improve the failure detection quality of service (QoS) according to the application needs and network environment changes. The results show that, on the basis of the algorithm implementation failure detector has better performance. Compared to other failure detector, ours is much efficient and adaptive. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hierarchical Cache Scheme for Object Storage System

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

    HCOS is a scheme of OSS (object storage system) proposed by us from the size of object aspect by which performance of read/write (R/W) can be promoted effectively. In this paper, the hierarchy cache scheme for OSS called as HCOS is discussed. The prominent feature of HCOS is that the two-level cache model which is different from traditional cache scheme for OSS is adopted in our hierarchy cache scheme. The two-level cache model in HCOS includes two parts called as L-cache and S-cache which is divided according to the size of object, and the two parts in the model is cooperated to accomplish the overall workload of cache according to judging rule of our scheme. The working principle of HCOS and the cache replacement strategy which combined with LRU algorithm and characteristic of object size are also discussed in our paper. Our HCOS provides a hierarchy cache scheme for promoting performance of R/W for OSS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Knowledge Element Model for Knowledge Abstract and Fusion System

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

    The amount of digitally available informaition is growing at an exponential rate. Educational resource systems are in widespread use and knowledge develops and spreads rapidly in quality, quantity, profundity and extension. This paper describes a new model of knowledge element to organize knowledge and to share the educational resource, and presents the framework of a knowledge abstract and fusion system based on it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Mashup Platform for Lightweight Application Integration

    Publication Year: 2009 , Page(s): 27 - 32
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1385 KB) |  | HTML iconHTML  

    Traditional application integration technologies are performed in a rigid and slow process and do not fully utilize the computing power and storage capability of client. By extending mashup concept into application integration space, we can achieve a novel and more lightweight integration approach. This paper introduces our Web based integration platform BU Studio, which is built upon a series of mashup abstractions. These abstractions are proposed in the perspective of software architecture, including a component model to encapsulate integrated objects and a connector model to specify communication style and communication content between integrated objects. BU Studio provides a drag-and-drop style environment for on-the-fly application integration from abstraction to deployment. Based on our platform, end user can integrate enterprise applications and services in a more lightweight manner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Space Allocation Algorithm for Minimal Early and Tardy Costs in Space Scheduling

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

    The factory space for assembly is one of critical resources for the machine assembly industry. In the past, many researches discussed job shop or single machine scheduling problems with time constraint. In machinery, factory space constrains scheduling. The most common way for scheduling jobs in machinery industry is to assign jobs based on experience. Therefore, the main purpose of this research is to derive a method to schedule jobs for machinery industry and develop new dispatching rules. In this research, we develop an algorithm, Northwest corner searching algorithm to schedule jobs into the shop floor. In addition, two space dispatching rules, largest space requirement (LSR) and smallest space requirement (SSR), are also developed for sequencing jobs. We find that both the proposed algorithm and dispatching rule perform well in our experiments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on the New BSC Algorithm and Design for Network Security

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

    New BSC cryptographic algorithm is suitable network environment and wire/wireless communication network, on implement easy, security rate preservation, scalable and reconfigurable. Though proposed algorithm strengthens security vulnerability of TCP/IP protocol and keep security about many user as that have authentication function in network environment, there is important purpose. So that new BSC cryptographic algorithm implemented by hardware base cryptosystem and en/decryption is achieved at the same time, composed architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-Based Data Loading Method in MedImGrid

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

    Agent-based grid data loading method aims at integrating heterogeneous hospitalspsila information systems into a medical information exchange platform based on grid middleware. It collects distributed data sets for decision support system, which makes data sources expanded from independent database modes to medical information systems in wide area. Virtual data access with grid service improves data security and makes data modification in local system more flexible. HL7 protocol and middleware are utilized to transform HL7 data into various local data structures for keeping the independence of each hospital information system and providing more convenience and expansibility for various medical applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Application of a Parallel Algorithm on a Image Recognition

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

    This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen image vectors and a parallel algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Asymmetric and DCC Analysis of Two Stock Markets Return: An Evidence Study of the U.S. and the Canada's Stock Markets

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

    The empirical results show that the dynamic conditional correlation (DCC) and the bivariate asymmetric-IGARCH (1, 1) model is appropriate in evaluating the relationship of the U.S. and the Canadapsilas stock markets. The empirical result also indicates that the U.S. and the Canadapsilas stock markets is a positive relation. The average estimation value of correlation coefficient equals to 0.669, which implies that the two stock markets is synchronized influence. Besides, the empirical result also shows that the U.S. and the Canadapsilas stock markets have an asymmetrical effect, and the variation risks of the U.S. and the Canadapsilas stock market returns also receives the influence of the positive and negative of the itself return ratepsila volatility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Economic Model for Multi-Resource Transaction in Grid Environment

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

    To solve the complex issue of multi-resource transaction in grid environment, based on the economic theory,a multi-resource parallel transaction model is proposed. Then its formal description and the key concepts are given. For the purpose of optimization allocation of buyerpsila s credit on multi-resource, the strategy and a mathematical solution are presented. Finally, service encapsulation of messages on resource nodes during the communication, and the process of multi-resource parallel transaction algorithm are illustrated.It is proved that the model can improve the efficiency of resource management in grid environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Kademlia Routing Algorithm for P2P Network

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

    Kademlia is a famous routing algorithm based on DHT in P2P network research. To conquer the shortages of Kademlia in searching efficiency and the strategy of cache, an improved Kademlia routing algorithm is proposed which can accelerate the hotspots inquiry speed in P2P network and is implemented by using fast table look-up and weights setting method. This technique avoids inefficient inquiry under the high refreshing frequency in cache and congregates hotspot resources for high query hit rate. Simulation tests show that the improved algorithm has lower average route step and inquiry time delay than the original one. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural QoS Predictions in Model-Driven Development of Component-Based Software

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

    Continuous quality-of-service (QoS) provisioning is becoming increasingly important in the software development lifecycle of distributed systems. For component-based software, it also requires understanding of extra-functional properties of each individual component. However, black-box components, as most commonly provided by current component models, do not provide sufficient details to predict QoS. This paper describes which information about a component is needed to enable relevant analyses and emphasizes that prediction feedback should not based on internal models, but based on models which the domain experts understand. Hence, a mechanism is required to annotate analysis results and back into the original models provided by the domain experts. This paper proposes a new approach to provide QoS predictions of distributed systems throughout the whole development lifecycle. View full abstract»

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