Based on Kotler's theory of customer delivered value (CDV) (P. Kotler, 1994), this paper builds up the structural model on the relationship among e-shopping prejudice, CDV of e-customers (e-CDV) and e-customer satisfaction. E-CDV includes 6 dimensionalities, which are product value, personnel value, service value, price cost, time cost, energy and physical cost, while the 3 of last cost dimensionality are valued. The empirical result of 316 samples displays that e-shopping prejudice has prominently negative influence on e-customer satisfaction, while it has no pertinent relationship with E-CDV. E-CDV has prominent influence on e-customer satisfaction, in which the time cost of non-difference-group and the group with high e-shopping prejudice has prominent influence on e-customer satisfaction. It is different from entity shopping, product value and personnel value has weak influence on delivered value of network customers.
{"title":"Empirical Study on the Influence of E-shopping Prejudice to E-customer Satisfaction","authors":"Sizong Wu, W. Yin, Guoyue Xiong","doi":"10.1109/ICEBE.2007.34","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.34","url":null,"abstract":"Based on Kotler's theory of customer delivered value (CDV) (P. Kotler, 1994), this paper builds up the structural model on the relationship among e-shopping prejudice, CDV of e-customers (e-CDV) and e-customer satisfaction. E-CDV includes 6 dimensionalities, which are product value, personnel value, service value, price cost, time cost, energy and physical cost, while the 3 of last cost dimensionality are valued. The empirical result of 316 samples displays that e-shopping prejudice has prominently negative influence on e-customer satisfaction, while it has no pertinent relationship with E-CDV. E-CDV has prominent influence on e-customer satisfaction, in which the time cost of non-difference-group and the group with high e-shopping prejudice has prominent influence on e-customer satisfaction. It is different from entity shopping, product value and personnel value has weak influence on delivered value of network customers.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"229 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940845","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}
Wen J. Li, Ying-wen Wen, Dan Chen, Yongji Li, Kai-Pei Chen
As a natural evolution of GIS (Geographic Information Systems) Web services GIS Grid services (GGS) are defined with common behaviors and semantics using a certain interface description language, which makes the Service-Oriented Architecture (SOA) and its runtime environment more flexible and manageable. A new concept of Pluggable Service is proposed in this paper, which aims to separate the static binding between services and resources when published and to realize the dynamic binding at runtime, resulting in the improvement of the service virtualization, together with better resource sharing and service performance. In this architecture, a kind of Selector is used for selecting the currently best resources in a dynamic GGS Virtual Organization (VO) according to the combination of time-dependent Qualities of Services (QoS) and the resource requirement of specific service providers. Based on the selection result, dynamic binding to the best-fitted resources will be established, making the service available to clients, without any differences from the traditional approaches. The prototype system is built on top of the Globus Toolkit 3.2 (GT3), the de facto standard middleware enabling Grid services. The effects and performance of the system, evaluated through simulation, exhibits the benefits obtained by this architecture.
{"title":"A Dynamic QoS Driven Pluggable GIS Grid Services Architecture","authors":"Wen J. Li, Ying-wen Wen, Dan Chen, Yongji Li, Kai-Pei Chen","doi":"10.1109/ICEBE.2007.48","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.48","url":null,"abstract":"As a natural evolution of GIS (Geographic Information Systems) Web services GIS Grid services (GGS) are defined with common behaviors and semantics using a certain interface description language, which makes the Service-Oriented Architecture (SOA) and its runtime environment more flexible and manageable. A new concept of Pluggable Service is proposed in this paper, which aims to separate the static binding between services and resources when published and to realize the dynamic binding at runtime, resulting in the improvement of the service virtualization, together with better resource sharing and service performance. In this architecture, a kind of Selector is used for selecting the currently best resources in a dynamic GGS Virtual Organization (VO) according to the combination of time-dependent Qualities of Services (QoS) and the resource requirement of specific service providers. Based on the selection result, dynamic binding to the best-fitted resources will be established, making the service available to clients, without any differences from the traditional approaches. The prototype system is built on top of the Globus Toolkit 3.2 (GT3), the de facto standard middleware enabling Grid services. The effects and performance of the system, evaluated through simulation, exhibits the benefits obtained by this architecture.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125010212","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 onset of Service Oriented Architectures (SOA) in domains like trading and banking has considerably heightened the need for dependable system operation. Late binding to services in business-to-business operations pose a serious problem for dependable system operation as it delegates the decision to trust a service to an external agent. However, it is impossible to guarantee that any service is 100% fault-free due to failings in hardware, software and human error. This means that fault tolerance remains the most practical way to address the problem. Unfortunately, there is currently no standard way to achieve this in SOA. This paper describes a novel adaptable fault tolerance framework that overlays a peer network formed by JXTA technology protocols to address this problem. We have adopted a layered approach by incrementally adding protocols and supporting the code infrastructure. The framework is implemented exclusively in Java and XML to ensure cross platform compatibility.
{"title":"An Adaptable Fault-Tolerance for SOA using a Peer-to-Peer Framework","authors":"S. Hall, G. Kotonya","doi":"10.1109/ICEBE.2007.78","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.78","url":null,"abstract":"The onset of Service Oriented Architectures (SOA) in domains like trading and banking has considerably heightened the need for dependable system operation. Late binding to services in business-to-business operations pose a serious problem for dependable system operation as it delegates the decision to trust a service to an external agent. However, it is impossible to guarantee that any service is 100% fault-free due to failings in hardware, software and human error. This means that fault tolerance remains the most practical way to address the problem. Unfortunately, there is currently no standard way to achieve this in SOA. This paper describes a novel adaptable fault tolerance framework that overlays a peer network formed by JXTA technology protocols to address this problem. We have adopted a layered approach by incrementally adding protocols and supporting the code infrastructure. The framework is implemented exclusively in Java and XML to ensure cross platform compatibility.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594242","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 fair and transferable off-line electronic cash system (FTOLC) with multiple banks based on group blind signature is proposed. To the best of our knowledge, it is the first electronic cash scheme that issuing banks' anonymity, customers' conditional anonymity and the transferability of electronic cash without any increase in size are realized.
{"title":"A Fair and Transferable Off-line Electronic Cash System with Multiple Banks","authors":"Chang-ji Wang, Qin Li, Xingfeng Yang","doi":"10.1109/ICEBE.2007.45","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.45","url":null,"abstract":"In this paper, a fair and transferable off-line electronic cash system (FTOLC) with multiple banks based on group blind signature is proposed. To the best of our knowledge, it is the first electronic cash scheme that issuing banks' anonymity, customers' conditional anonymity and the transferability of electronic cash without any increase in size are realized.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668457","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 business process modeling, process (de)composition is one of means to reduce model complexity. However, it isn't enough to fully reduce the complexity caused by cross-cutting concerns. This paper proposes a new process modeling approach: concern-oriented business process modeling, in which the concept of concern or aspectual process is introduced to business process modeling to support flexible process modeling, refactoring and restructuring by aspectual process identifying, modeling, extracting, assembling and weaving. The approach provides people a convenient way to more clearly view and easily manipulate process models from certain concerns' perspectives.
{"title":"Concern Oriented Business Process Modeling","authors":"Jian Wang, Jun Zhu, Haiqi Liang, Ke Xu","doi":"10.1109/ICEBE.2007.52","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.52","url":null,"abstract":"In business process modeling, process (de)composition is one of means to reduce model complexity. However, it isn't enough to fully reduce the complexity caused by cross-cutting concerns. This paper proposes a new process modeling approach: concern-oriented business process modeling, in which the concept of concern or aspectual process is introduced to business process modeling to support flexible process modeling, refactoring and restructuring by aspectual process identifying, modeling, extracting, assembling and weaving. The approach provides people a convenient way to more clearly view and easily manipulate process models from certain concerns' perspectives.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114277835","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}
To dynamically monitor services and diagnosing causes of potential problems, we need to acquire essential information about atomic services. A challenge is how we tap the service middleware and acquire low-level runtime data about atomic services. In this paper, we present a design of dynamic monitor which gathers quality-related data of running services deployed on Enterprise Service Bus. We show the architecture of dynamic monitor, and present an implementation of the monitor on open source platform.
{"title":"A Practical Framework of Dynamic Monitors in Service-Oriented Computing","authors":"D. Cheun, J. Bae, W. Jeon, Hao Yuan, Soo Dong Kim","doi":"10.1109/ICEBE.2007.106","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.106","url":null,"abstract":"To dynamically monitor services and diagnosing causes of potential problems, we need to acquire essential information about atomic services. A challenge is how we tap the service middleware and acquire low-level runtime data about atomic services. In this paper, we present a design of dynamic monitor which gathers quality-related data of running services deployed on Enterprise Service Bus. We show the architecture of dynamic monitor, and present an implementation of the monitor on open source platform.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123634277","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}
Service-oriented applications are naturally linked to virtual organizations (VO) that are used as an effective means to support collaboration across multiple autonomous domains. Participating domains of a VO may change their authorization policies for many reasons, which can bring conflicts to the VO's authorization policies and lead to unavailability of shared resources. In this paper, an adaptive policy reconciliation framework for VOs is proposed, which can dynamically keep VO's authorization polices consistent with changed local policies in order to maintain the availability of shared resources. And we present algorithms on how to revise VO's policies to conform to domain policies, and discuss their effectiveness.
{"title":"A Dynamic Reconciliation Service of RBAC Policies for Virtual Organizations","authors":"Weiqun Sun, Yanbo Han, Baohua Shan","doi":"10.1109/ICEBE.2007.94","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.94","url":null,"abstract":"Service-oriented applications are naturally linked to virtual organizations (VO) that are used as an effective means to support collaboration across multiple autonomous domains. Participating domains of a VO may change their authorization policies for many reasons, which can bring conflicts to the VO's authorization policies and lead to unavailability of shared resources. In this paper, an adaptive policy reconciliation framework for VOs is proposed, which can dynamically keep VO's authorization polices consistent with changed local policies in order to maintain the availability of shared resources. And we present algorithms on how to revise VO's policies to conform to domain policies, and discuss their effectiveness.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125697090","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 paper proposes a workflow model based on discrete stochastic Petri net and a corresponding time performance calculating method. On the basis of workflow nets and the principles of simplifying workflow net based T-component nets which maintains time constraints and probability distribution of tasks in workflow, several basic structures like sequence, parallelism, choice and iteration can be equivalently simplified through equivalent performance parameter calculating method which puts in consider more generally meaningful probability distribution of time delay of workflow activity.
{"title":"An Approach for Workflow Performance Evaluation based on Discrete Stochastic Petri net","authors":"J. Hao, Wang Pei-an","doi":"10.1109/ICEBE.2007.65","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.65","url":null,"abstract":"The paper proposes a workflow model based on discrete stochastic Petri net and a corresponding time performance calculating method. On the basis of workflow nets and the principles of simplifying workflow net based T-component nets which maintains time constraints and probability distribution of tasks in workflow, several basic structures like sequence, parallelism, choice and iteration can be equivalently simplified through equivalent performance parameter calculating method which puts in consider more generally meaningful probability distribution of time delay of workflow activity.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130918836","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 the growing deployment of network security devices, it becomes a great challenge to manage the large volume of security alerts from these devices. In this paper a novel method using sequential pattern mining algorithm is applied to discover complicated multistage attack behavior patterns. Their result can be transformed into rules automatically. In contrast with other approaches, it overcomes the drawback of high dependence on precise attack specifications and accurate rule definitions. Based on the algorithms, a real-time alert correlation system is proposed to detect an ongoing attack and predict the upcoming next step of a multistage attack in real time. Consequently, network administrator can be aware of the threat as soon as possible and take deliberate action to prevent the target of an attack from further compromise. We implement the system and valid our method by a series of experiments with test dataset and in real network environment. The result shows the effectivity of the system in discovery and predication of attacks.
{"title":"Real-Time Correlation of Network Security Alerts","authors":"Zhitang Li, Aifang Zhang, Jie Lei, Li Wang","doi":"10.1109/ICEBE.2007.69","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.69","url":null,"abstract":"With the growing deployment of network security devices, it becomes a great challenge to manage the large volume of security alerts from these devices. In this paper a novel method using sequential pattern mining algorithm is applied to discover complicated multistage attack behavior patterns. Their result can be transformed into rules automatically. In contrast with other approaches, it overcomes the drawback of high dependence on precise attack specifications and accurate rule definitions. Based on the algorithms, a real-time alert correlation system is proposed to detect an ongoing attack and predict the upcoming next step of a multistage attack in real time. Consequently, network administrator can be aware of the threat as soon as possible and take deliberate action to prevent the target of an attack from further compromise. We implement the system and valid our method by a series of experiments with test dataset and in real network environment. The result shows the effectivity of the system in discovery and predication of attacks.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117157981","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}
QoS (Quality of Service) provisioning is an important factor that determines the success of any software service deployment. Defining what level of quality a software service should publish in the registry is a big challenge because of (i) the lack of requestor's QoS requirements when a service is firstly published, (ii) the dynamic, diversified QoS requirements of SLAs (Service Level Agreement) and invocation instances to the same service provider, and (iii) the inability of requestors to precisely specify their QoS requirements for the services they demand. In this paper, we propose a mechanism to automatically recommend the QoS requirements of a given service by referencing previously signed SLAs and their associated runtime instance information of all "similar services" within a service community. Both the mathematical model and its supporting system architecture are given. This work is important because it assists service providers to improve their service quality and competitiveness in a given service community.
{"title":"Automatic Recommendation of Quality Requirements for Software Services","authors":"SiMing Li, Chi-Hung Chi, Chen Ding, Shuo Chen, Ying Huang","doi":"10.1109/ICEBE.2007.130","DOIUrl":"https://doi.org/10.1109/ICEBE.2007.130","url":null,"abstract":"QoS (Quality of Service) provisioning is an important factor that determines the success of any software service deployment. Defining what level of quality a software service should publish in the registry is a big challenge because of (i) the lack of requestor's QoS requirements when a service is firstly published, (ii) the dynamic, diversified QoS requirements of SLAs (Service Level Agreement) and invocation instances to the same service provider, and (iii) the inability of requestors to precisely specify their QoS requirements for the services they demand. In this paper, we propose a mechanism to automatically recommend the QoS requirements of a given service by referencing previously signed SLAs and their associated runtime instance information of all \"similar services\" within a service community. Both the mathematical model and its supporting system architecture are given. This work is important because it assists service providers to improve their service quality and competitiveness in a given service community.","PeriodicalId":184487,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912785","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
扫码关注我们
求助内容：
应助结果提醒方式：