A web service integrating mobile client applications requires a complex user interface, which usually consists of more than one view. Moreover, it should provide a way to navigate between the views. In this paper, we presented a formal way to analyze a set of views for a given service specification, and a model for the relationship between views and methods. We then provided an algorithm to generate codes for service method calls and navigation between views. Therefore, with an optional user configuration input, we could almost instantly generate XForms codes from the webservice specifications. Finally, we developed a proofof-concept implementation of an XForms-based service architecture, to show that the generated code works well as an interface for web service integrations.
{"title":"Code Generation of an XForms Client for Service Integration","authors":"Eunjung Lee, K. Seo","doi":"10.1109/ASEA.2008.58","DOIUrl":"https://doi.org/10.1109/ASEA.2008.58","url":null,"abstract":"A web service integrating mobile client applications requires a complex user interface, which usually consists of more than one view. Moreover, it should provide a way to navigate between the views. In this paper, we presented a formal way to analyze a set of views for a given service specification, and a model for the relationship between views and methods. We then provided an algorithm to generate codes for service method calls and navigation between views. Therefore, with an optional user configuration input, we could almost instantly generate XForms codes from the webservice specifications. Finally, we developed a proofof-concept implementation of an XForms-based service architecture, to show that the generated code works well as an interface for web service integrations.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123397840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Noar and Shamir presented the concept of visual cryptography. Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed his probability-based visual secret sharing scheme, where the concept of probability is employed to pick out pixels from the black or white sets. In this paper, we shall propose a new scheme that is a modified version of Yangpsilas scheme. Our experimental results show that we can obtain better recovered image quality with high contrast.
{"title":"An Efficient Probability-Based t out of n Secret Image Sharing Scheme","authors":"C. Chang, Yu-Zheng Wang, Chi-Shiang Chan","doi":"10.1109/FGCNS.2008.15","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.15","url":null,"abstract":"Noar and Shamir presented the concept of visual cryptography. Many researches following it go down the same track: to expand the secret pixels to blocks. As a result, the size of the secret image becomes larger, and the quality of the expanded secret image becomes worse. In order to prevent the pixels from expanding, Yang has proposed his probability-based visual secret sharing scheme, where the concept of probability is employed to pick out pixels from the black or white sets. In this paper, we shall propose a new scheme that is a modified version of Yangpsilas scheme. Our experimental results show that we can obtain better recovered image quality with high contrast.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126727231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A denoising algorithm for point-sampled geometry is proposed based on noise intensity. The noise intensity of each point on point-sampled geometry (PSG) is first measured by using a combined criterion. Based on mean shift clustering, the PSG is then clustered in terms of the local geometry-features similarity. According to the cluster to which a sample point belongs, a moving least squares surface is constructed, and in combination with noise intensity, the PSG is finally denoised. Some experimental results demonstrate that the algorithm is robust, and can denoise the noise efficiently while preserving the surface features.
{"title":"Noise Intensity-Based Denoising of Point-Sampled Geometry","authors":"Renfang Wang, Ji-fang Li","doi":"10.1109/FGCNS.2008.10","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.10","url":null,"abstract":"A denoising algorithm for point-sampled geometry is proposed based on noise intensity. The noise intensity of each point on point-sampled geometry (PSG) is first measured by using a combined criterion. Based on mean shift clustering, the PSG is then clustered in terms of the local geometry-features similarity. According to the cluster to which a sample point belongs, a moving least squares surface is constructed, and in combination with noise intensity, the PSG is finally denoised. Some experimental results demonstrate that the algorithm is robust, and can denoise the noise efficiently while preserving the surface features.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114960537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the design principle for integrating quality management on Web service registry developed in UDDI specification and Web service quality management system (WSQMS). WSQMS, developed by NIA can measure and collect the quality information of Web services by its agency system installed on the Web service system. Web service registry is core system for registering and searching WSDL (Web service description language). On the registry, there are no methods that users search Web services on the basis of quality information because the registry is operating without any relationship of WSQMS. So, it is required an integration method where WSQMS and registries share the quality data on the basis of classified quality data. For representing Web service quality information, we adopted the WSQDL (Web service quality description language), which published by WSQM technical committee in OASIS. In more detail, this paper also presents the scheme to compose the classification scheme for quality data and to modify the necessary data structure of the registry.
{"title":"QoS Management for SOA by Synchronizing Quality Context in UDDI","authors":"Youngkon Lee","doi":"10.1109/FGCNS.2008.101","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.101","url":null,"abstract":"This paper presents the design principle for integrating quality management on Web service registry developed in UDDI specification and Web service quality management system (WSQMS). WSQMS, developed by NIA can measure and collect the quality information of Web services by its agency system installed on the Web service system. Web service registry is core system for registering and searching WSDL (Web service description language). On the registry, there are no methods that users search Web services on the basis of quality information because the registry is operating without any relationship of WSQMS. So, it is required an integration method where WSQMS and registries share the quality data on the basis of classified quality data. For representing Web service quality information, we adopted the WSQDL (Web service quality description language), which published by WSQM technical committee in OASIS. In more detail, this paper also presents the scheme to compose the classification scheme for quality data and to modify the necessary data structure of the registry.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128572427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaohui Wei, Zhaohui Ding, Shaocheng Xing, Y. Yuan, W. Li
The resources in a grid are distributed in multiple autonomic domains. Hence, itpsilas always a time consuming process to perform the resource co-allocation in grids especially for parallel jobs due to the diversity of local domain policies and the dynamic resource workloads. Even worse, the resource competing among multiple parallel jobs may result in resource allocation deadlock. In this paper, a novel synchronized resource co-allocation model for cross-domain parallel jobs, called virtual job model (VJM), is proposed. VJM uses virtual jobs to co-reserve the earliest available resources for real parallel jobs with considering the local resource policies and the current resource availability in multiple domains. The co-reservation algorithm implemented in VJM is not only able to detect potential deadlocks, but able to relieve the resource competing via the resource reorganization mechanism. At last, we demonstrate that VJM is able to reduce the time cost of resource co-allocation significantly via experiments.
{"title":"VJM: A Novel Grid Resource Co-Allocation Model for Parallel Jobs","authors":"Xiaohui Wei, Zhaohui Ding, Shaocheng Xing, Y. Yuan, W. Li","doi":"10.1109/FGCNS.2008.151","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.151","url":null,"abstract":"The resources in a grid are distributed in multiple autonomic domains. Hence, itpsilas always a time consuming process to perform the resource co-allocation in grids especially for parallel jobs due to the diversity of local domain policies and the dynamic resource workloads. Even worse, the resource competing among multiple parallel jobs may result in resource allocation deadlock. In this paper, a novel synchronized resource co-allocation model for cross-domain parallel jobs, called virtual job model (VJM), is proposed. VJM uses virtual jobs to co-reserve the earliest available resources for real parallel jobs with considering the local resource policies and the current resource availability in multiple domains. The co-reservation algorithm implemented in VJM is not only able to detect potential deadlocks, but able to relieve the resource competing via the resource reorganization mechanism. At last, we demonstrate that VJM is able to reduce the time cost of resource co-allocation significantly via experiments.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129088769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaohui Wei, Hongliang Li, Shaocheng Xing, Ji Li, Z. Z. Hu, S. Yuan
Multi-thread is a mature and widely-used programming mode for multitasking applications developing, especially in Java. However java.lang.Thread is not designed for HPC parallel programming. Java multi-thread program is confined within single compute host. CommonJ Work Manager is a joint specification proposed by IBM and BEA. Work Manager is a higher-level alternative to using Java Thread. Originally, Work Manager is used to solve the constraint of opening independent threads in J2EE container. Although there are some enterprise servers such as WebLogic and WebSphere which have supported Work Manager, they are not aim at large scale parallel applications. They do not have a grid-enabled and expandable architecture, and the multi-thread programs are still executed on single compute host. Currently, grid-enabled parallel programming model like MPICH-G2 is limited with C/C++ implementations. There are no official bindings for MPI with Java. In this paper, we present a grid-enabled multi-thread programming model: SymWorkManager to enable multithread programs to run on distributed environments. SymWorkManager is designed as a high performance computing (HPC) implementation of CommonJ Work Manger specification using Platform Symphony. It provides J2EE developers a simpler way to program parallel multi-thread applications under a HPC platform.
多线程是一种成熟且广泛应用于多任务应用程序开发的编程模式，特别是在Java中。然而，java.lang.Thread并不是为HPC并行编程而设计的。Java多线程程序被限制在单个计算主机中。CommonJ Work Manager是由IBM和BEA联合提出的规范。工作管理器是使用Java线程的高级替代方案。最初，工作管理器是用来解决在J2EE容器中打开独立线程的约束。尽管有一些企业服务器(如WebLogic和WebSphere)支持Work Manager，但它们并不针对大规模并行应用程序。它们没有支持网格和可扩展的体系结构，多线程程序仍然在单个计算主机上执行。目前，像MPICH-G2这样支持网格的并行编程模型受限于C/ c++实现。在Java中没有MPI的官方绑定。在本文中，我们提出了一个支持网格的多线程编程模型:SymWorkManager，使多线程程序能够在分布式环境中运行。SymWorkManager是使用Platform Symphony设计的CommonJ Work manager规范的高性能计算(HPC)实现。它为J2EE开发人员在HPC平台下编写并行多线程应用程序提供了一种更简单的方法。
{"title":"SymWorkManager: A Novel HPC Multi-Thread Programming Model","authors":"Xiaohui Wei, Hongliang Li, Shaocheng Xing, Ji Li, Z. Z. Hu, S. Yuan","doi":"10.1109/FGCNS.2008.146","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.146","url":null,"abstract":"Multi-thread is a mature and widely-used programming mode for multitasking applications developing, especially in Java. However java.lang.Thread is not designed for HPC parallel programming. Java multi-thread program is confined within single compute host. CommonJ Work Manager is a joint specification proposed by IBM and BEA. Work Manager is a higher-level alternative to using Java Thread. Originally, Work Manager is used to solve the constraint of opening independent threads in J2EE container. Although there are some enterprise servers such as WebLogic and WebSphere which have supported Work Manager, they are not aim at large scale parallel applications. They do not have a grid-enabled and expandable architecture, and the multi-thread programs are still executed on single compute host. Currently, grid-enabled parallel programming model like MPICH-G2 is limited with C/C++ implementations. There are no official bindings for MPI with Java. In this paper, we present a grid-enabled multi-thread programming model: SymWorkManager to enable multithread programs to run on distributed environments. SymWorkManager is designed as a high performance computing (HPC) implementation of CommonJ Work Manger specification using Platform Symphony. It provides J2EE developers a simpler way to program parallel multi-thread applications under a HPC platform.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a new oblivious fragile watermarking using discrete cosine transform is proposed. It is inspired by Wong's public key watermarking scheme proposed in 1998 and aims to improve its vulnerability towards possible attacks indicated by Barreto and Holliman. Instead of making use of contextual information and making it an inter-block dependent scheme, as suggested by Barreto, we adopt another approach to retain its blockwise independent property. Our scheme can avoid the conditions necessary for such attacks to be feasible. Furthermore, our scheme extracts the inherent image features and embed them into this image as the watermark. This relieves users from having to maintain a database of watermarks from various sources. Experimental results show that the watermark insertion procedure has little effect on the visual quality of the watermarked image. They also show our scheme can locate the modifications made to the watermarked image, including image scaling, cropping, geometric distortion, pixel value changes, etc.
{"title":"A New Public-Key Oblivious Fragile Watermarking for Image Authentication Using Discrete Cosine Transform","authors":"Chinchen Chang, H. Chou","doi":"10.1109/FGCNS.2008.9","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.9","url":null,"abstract":"In this paper, a new oblivious fragile watermarking using discrete cosine transform is proposed. It is inspired by Wong's public key watermarking scheme proposed in 1998 and aims to improve its vulnerability towards possible attacks indicated by Barreto and Holliman. Instead of making use of contextual information and making it an inter-block dependent scheme, as suggested by Barreto, we adopt another approach to retain its blockwise independent property. Our scheme can avoid the conditions necessary for such attacks to be feasible. Furthermore, our scheme extracts the inherent image features and embed them into this image as the watermark. This relieves users from having to maintain a database of watermarks from various sources. Experimental results show that the watermark insertion procedure has little effect on the visual quality of the watermarked image. They also show our scheme can locate the modifications made to the watermarked image, including image scaling, cropping, geometric distortion, pixel value changes, etc.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126681426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With rapid growth of the Internet and the globalization of the market, companies accepted and adopted the new information and communication technology in the performance of their activities, not only to support traditional activities, but also to support those arising from new opportunities, mainly from the Internet. This paper addresses the e-service quality issue in the electronic marketplace. The purpose of the paper is to investigate e-service quality dimensions from both e-service providerpsilas and customerpsilas perspectives. The paper explores e-service quality dimensions based on a review of the development of e-service quality dimension. It proposes a 10-dimension scale for measuring e-service quality: Website design, reliability, fulfillment, security, responsiveness, personalization, information and empathy from the e-service providerpsilas perspective, and trust and experience from the customerpsilas perspective. This paper concludes by discussing the limitation of this study and highlighting areas for the future research in the realm of e-service quality.
{"title":"Dimensions of E-service Quality: An Alternative Model","authors":"Hongxiu Li, R. Suomi","doi":"10.1109/FGCNS.2008.104","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.104","url":null,"abstract":"With rapid growth of the Internet and the globalization of the market, companies accepted and adopted the new information and communication technology in the performance of their activities, not only to support traditional activities, but also to support those arising from new opportunities, mainly from the Internet. This paper addresses the e-service quality issue in the electronic marketplace. The purpose of the paper is to investigate e-service quality dimensions from both e-service providerpsilas and customerpsilas perspectives. The paper explores e-service quality dimensions based on a review of the development of e-service quality dimension. It proposes a 10-dimension scale for measuring e-service quality: Website design, reliability, fulfillment, security, responsiveness, personalization, information and empathy from the e-service providerpsilas perspective, and trust and experience from the customerpsilas perspective. This paper concludes by discussing the limitation of this study and highlighting areas for the future research in the realm of e-service quality.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
When we generate an intermediate viewpoint image using multi-view images and their depth maps, we may have very annoying boundary noises in the background due to depth value errors around depth discontinuities. In this paper, we propose a boundary filtering method for synthesized images. After defining the boundary noise area using depth map, we replace them with corresponding texture information from the other reference image. Our experiments show that the proposed method improves visual quality of the synthesized virtual viewpoint images.
{"title":"Boundary Filtering on Synthesized Views of 3D Video","authors":"Cheon Lee, Yo-Sung Ho","doi":"10.1109/FGCNS.2008.49","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.49","url":null,"abstract":"When we generate an intermediate viewpoint image using multi-view images and their depth maps, we may have very annoying boundary noises in the background due to depth value errors around depth discontinuities. In this paper, we propose a boundary filtering method for synthesized images. After defining the boundary noise area using depth map, we replace them with corresponding texture information from the other reference image. Our experiments show that the proposed method improves visual quality of the synthesized virtual viewpoint images.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125735818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The measurement with a signal of time difference of arrival (TDoA) is a widely used technique in source localization. However, this method involves much nonlinear calculation. In this paper, we propose a method that needs less computation for UGV location tracking using extended Kalman filtering based on non linear TDoA measurements. To overcome the inaccurate results due to limited linear approximation, this paper suggests a position estimation algorithm based upon an adaptive fading Kalman filter. The adaptive fading factor enables the estimator to change the error covariance according to the real situation. Through the comparison with other analytical methods, simulation results show that the proposed localization method achieves an improved accuracy even with reduced computational efforts.
{"title":"TDoA Based UGV Localization Using Adaptive Kalman Filter Algorithm","authors":"W. Sung, Sungok Choi, K. You","doi":"10.1109/FGCNS.2008.126","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.126","url":null,"abstract":"The measurement with a signal of time difference of arrival (TDoA) is a widely used technique in source localization. However, this method involves much nonlinear calculation. In this paper, we propose a method that needs less computation for UGV location tracking using extended Kalman filtering based on non linear TDoA measurements. To overcome the inaccurate results due to limited linear approximation, this paper suggests a position estimation algorithm based upon an adaptive fading Kalman filter. The adaptive fading factor enables the estimator to change the error covariance according to the real situation. Through the comparison with other analytical methods, simulation results show that the proposed localization method achieves an improved accuracy even with reduced computational efforts.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：