发布求助
文献互助 智能选刊 最新文献

The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)最新文献

筛选
英文 中文
Pattern Recognition Based Adaptive Categorization Technique and Solution for Services Selection 基于模式识别的自适应分类技术及服务选择解决方案
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.76
Liang-Jie Zhang, Shuxing Cheng, Yi-Min Chee, Abdul Allam, Qun Zhou
{"title":"Pattern Recognition Based Adaptive Categorization Technique and Solution for Services Selection","authors":"Liang-Jie Zhang, Shuxing Cheng, Yi-Min Chee, Abdul Allam, Qun Zhou","doi":"10.1109/APSCC.2007.76","DOIUrl":"https://doi.org/10.1109/APSCC.2007.76","url":null,"abstract":"The current design for the service registry architecture lacks a well-organized categorical structure and service- aware exploration method to enable effective real-time and offline services selection. To address this issue, this paper proposes an architectural framework and enabling technology for a business services analyzer that supports analyzing, clustering and adapting heterogeneous services for dynamic application integration. The proposed systematic services exploration methodology includes services categorization, services clustering and services exposure. By applying pattern recognition algorithm, we build a manageable feature space that is able to select and expose a service to serve the request from a repository with \"large\" amount of available services. To illustrate our design, we also provide a research prototype called Services Litmus Test (SLT) toolkit, which provides a flexible software platform for executing systematic services exploration procedures. The GUI based human assisted tune-up interface makes it very convenient for the services system designers to customize their design according to the adaptive system requirements.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131637597","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}
引用次数: 14
Easy-To-Use Programming Model for Web Services Security 易于使用的Web服务安全编程模型
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.38
Y. Yamaguchi, Hyen-Vui Chung, M. Teraguchi, N. Uramoto
{"title":"Easy-To-Use Programming Model for Web Services Security","authors":"Y. Yamaguchi, Hyen-Vui Chung, M. Teraguchi, N. Uramoto","doi":"10.1109/APSCC.2007.38","DOIUrl":"https://doi.org/10.1109/APSCC.2007.38","url":null,"abstract":"Even with a support tool, setting up a Web services security (WS-Security) configuration can be difficult for people who are not familiar with WS-Security. Some of the reasons are that the WS-Security is a very rich specification with many options and often the processing is complicated. This paper introduces an application programming model (WSSAPI) to simplify the programming experience for end users. It was designed by looking at WS-Security processing from an abstract level. Also, it is designed to consider correctness, efficiency, usability, flexibility, portability, and extensibility. End users just follow the six-step programming model provided in WSSAPI to configure WS-Security. The comparison of WSSAPI to others, like WSS4J, WSE, and JSR-105 shows that it is much easier for end users to use WSSAPI. In this paper, existing APIs for WS-Security are reviewed and compared with WSSAPI to evaluate the ease of use and utility.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127819957","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}
引用次数: 6
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments 移动计算环境下基于id的动态对等体组密钥协议
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.42
R. Tso, X. Yi, E. Okamoto
{"title":"ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments","authors":"R. Tso, X. Yi, E. Okamoto","doi":"10.1109/APSCC.2007.42","DOIUrl":"https://doi.org/10.1109/APSCC.2007.42","url":null,"abstract":"In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement protocol based on identities of mobile users, composed of a basic protocol and a dynamic protocol, for dynamic peer groups. With the basic protocol, an initial secret group key can be achieved in a peer group. By the dynamic protocol, a new secret group key can be reached whenever member or mass join, group mergence, group division, member or mass quit occurs. Our protocol has security features, such as implicit group key authentication, key confirmation, forward secrecy, key independence, and etc. Because our protocol runs in parallel, it is more efficient than those running in series.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"200 1‐2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702602","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}
引用次数: 3
An Agent Scheduling Optimization for Call Centers 呼叫中心座席调度优化
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.27
C. Hishinuma, Masaaki Kanakubo, Takuma Goto
{"title":"An Agent Scheduling Optimization for Call Centers","authors":"C. Hishinuma, Masaaki Kanakubo, Takuma Goto","doi":"10.1109/APSCC.2007.27","DOIUrl":"https://doi.org/10.1109/APSCC.2007.27","url":null,"abstract":"A suitable assignment of agents to handle the workload at a call center is not easy to fulfill because it requires a combinatorial optimization with large solution space and the number of incoming calls is subject to sharp fluctuations over the course of the day. At most call centers, the agent scheduling is done manually using spreadsheets or other software; this takes a lot of time and effort, but the results are often that the center is overstaffed or understaffed. We propose an efficient and practical method to determine the schedule by using traffic theory and evolutionary computation, which has not been applied before to this kind of combinatorial optimization. Heuristic restrictions are introduced for the initial parameters and the search procedure, which had been given randomly in preceding researches. It is shown that the rapid calculation and high accurate scheduling are achieved even though the evaluating function is simplified.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"225 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987254","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}
引用次数: 12
Modeling QoS Attributes and Metrics for Evaluating Services in SOA Considering Consumers' Perspective as the First Class Requirement 考虑消费者视角作为第一类需求，为SOA中评估服务的QoS属性和度量建模
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.72
S. Choi, J. Her, Soo Dong Kim
{"title":"Modeling QoS Attributes and Metrics for Evaluating Services in SOA Considering Consumers' Perspective as the First Class Requirement","authors":"S. Choi, J. Her, Soo Dong Kim","doi":"10.1109/APSCC.2007.72","DOIUrl":"https://doi.org/10.1109/APSCC.2007.72","url":null,"abstract":"In service-oriented architecture (SOA), quality of service is hidden to service consumers due to the blackbox nature of SOA. In a service composition, low quality of an atomic service may cause the quality degradation of all its successors in a service composition. Hence, quality management of a service is important in SOA environment. For this, definition of a quality model especially considering the consumers' perspective is a prerequisite since consumers are the first class users of the services. Therefore, this paper proposes a quality model for evaluating services in SOA regarding customers' perspective. We first analyze the service quality requirements and define quality attributes of the quality model. Then we define metrics for each quality attribute. To show the applicability and usefulness of the quality model, we perform a case study for flight ticket reservation service and finally perform a theoretical analysis.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"14 8 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123722009","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}
引用次数: 59
The Number of Necessary Nodes for Ad Hoc Network Areas Ad Hoc网络区域所需节点的数量
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.60
Youngrag Kim, S. Dehkanov, Heejoo Park, Jaeil Kim, Chonggun Kim
{"title":"The Number of Necessary Nodes for Ad Hoc Network Areas","authors":"Youngrag Kim, S. Dehkanov, Heejoo Park, Jaeil Kim, Chonggun Kim","doi":"10.1109/APSCC.2007.60","DOIUrl":"https://doi.org/10.1109/APSCC.2007.60","url":null,"abstract":"MANET is a network that is consisted of mobile nodes without control of base stations. Since the network includes mobile nodes, path determination and topology composition to connect nodes are not an easy issue to solve. Especially, estimating adequate number of mobile nodes for a network area is very important for optimizing the number of nodes to cover the whole communication area for experiment. In this paper we propose a decision method for the number of necessary nodes in mobile ad hoc networks for covering and collecting data from an arranged area. The performance of proposed method is evaluated with NS-2 simulator.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122675746","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}
引用次数: 18
Web Service in Context and Dependency-Aware Service Composition 上下文中的Web服务和依赖感知的服务组合
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.71
Jiehan Zhou, Eila Niemelä, Juho Perälä, D. Pakkala
{"title":"Web Service in Context and Dependency-Aware Service Composition","authors":"Jiehan Zhou, Eila Niemelä, Juho Perälä, D. Pakkala","doi":"10.1109/APSCC.2007.71","DOIUrl":"https://doi.org/10.1109/APSCC.2007.71","url":null,"abstract":"Service composition enables service users to develop Web applications by composing services via Internet. Traditional service description is function-centred, but lack of composition information, which hinders service composition with respect to service contexts. In this paper, we examine service composition information (i.e. service contexts and service dependency). The context- aware service management platform that we developed provides support for service users to compose services by managing service dependency.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125123274","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}
引用次数: 3
Game-Theoretic Approach for Information Sharing 信息共享的博弈论方法
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.43
M. Raweewan, W. Ferrell
{"title":"Game-Theoretic Approach for Information Sharing","authors":"M. Raweewan, W. Ferrell","doi":"10.1109/APSCC.2007.43","DOIUrl":"https://doi.org/10.1109/APSCC.2007.43","url":null,"abstract":"This paper presents an integrated methodology to support decision making in cooperation through interorganizational information sharing. The methodology employs game-theoretic approach to determine whether it is advantageous to share information between two or three firms, each possessing one piece of information. While a firm in a two-firm situation has to decide either sharing nothing or sharing all, a firm in a three-firm situation has an additional decision to determine with which firm it should form coalition. A scope of this research focuses on two collaborative frameworks: 1) competition- cooperation and 2) co-opetition. Finally, examples are provided to illustrate how the methodology can be used in practice.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128847911","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}
引用次数: 4
Resource Availability Evaluation in Service Grid Environment 服务网格环境下的资源可用性评估
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.66
Hu Zhoujun, H. Zhigang, L. Zhenhua
{"title":"Resource Availability Evaluation in Service Grid Environment","authors":"Hu Zhoujun, H. Zhigang, L. Zhenhua","doi":"10.1109/APSCC.2007.66","DOIUrl":"https://doi.org/10.1109/APSCC.2007.66","url":null,"abstract":"In dynamic grid environment, prediction and evaluation of resource availability are the prerequisite for reasonable resource selection and good QoS guarantee. Based on some related resource and task historical traces, probability theory is applied to resource availability prediction and evaluation. The availability metrics including resource off-line time, local task execution time, waiting queue length and waiting time are presented and the distribution functions of these metrics are given and proven. The experiment results show that the prediction is effective, and the amount of candidate resources determined by resource availability evaluation is decreased significantly, therefore lowering time complexity of task scheduling.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120913630","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}
引用次数: 13
A Global-Energy-Balancing Real-Time Routing in Wireless Sensor Networks 一种基于全局能量均衡的无线传感器网络实时路由
The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) Pub Date : 2007-12-11 DOI: 10.1109/APSCC.2007.32
Peilong Li, Yu Gu, Bao-hua Zhao
{"title":"A Global-Energy-Balancing Real-Time Routing in Wireless Sensor Networks","authors":"Peilong Li, Yu Gu, Bao-hua Zhao","doi":"10.1109/APSCC.2007.32","DOIUrl":"https://doi.org/10.1109/APSCC.2007.32","url":null,"abstract":"Many applications in wireless sensor networks like video surveillance have the requirement of timely data delivery. Real-time routing is needed in these applications. Because of the limitation of node energy, energy efficiency is also an important concern in routing protocol design in order to increase the network lifetime. In this paper, we propose a global-energy-balancing routing scheme (GEBR) for real-time traffic based on directed diffusion (DD), which balances node energy utilization to increase the network lifetime. GEBR can find an optimal path in sensor networks for data transfer considering global energy balance and limited delivery delay. Simulation results show that GEBR significantly outperforms DD in uniform energy utilization. GEBR achieves better global energy balance and longer network lifetime. The time for real-time service of the sensor networks using GEBR is prolonged by about 4.37% and the network lifetime is prolonged by 44.6%.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129051993","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}
引用次数: 14
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信