Mobile commerce is the significant development of E-commerce. While consumer trust has become the bottleneck of the development of e-commerce, it is also becoming the major obstacle of mobile commerce. In this paper, we discuss the influencing factors of consumer initial trust in mobile commerce based on discussing the foundation of trust, the formation process of online trust and the characteristics of mobile commerce trust. Meanwhile, some corresponding strategies are provided in this paper to build consumer initial trust in M-commerce.
{"title":"Research on Influencing Factors of Consumer Initial Trust Based on Mobile Commerce","authors":"Zhihong Li, Minxia Li","doi":"10.1109/ISECS.2008.95","DOIUrl":"https://doi.org/10.1109/ISECS.2008.95","url":null,"abstract":"Mobile commerce is the significant development of E-commerce. While consumer trust has become the bottleneck of the development of e-commerce, it is also becoming the major obstacle of mobile commerce. In this paper, we discuss the influencing factors of consumer initial trust in mobile commerce based on discussing the foundation of trust, the formation process of online trust and the characteristics of mobile commerce trust. Meanwhile, some corresponding strategies are provided in this paper to build consumer initial trust in M-commerce.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126273363","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}
Internet banking is the provision of banking services over the internet that gives people the opportunity of easy access to their banking activities. This paper focuses on the security of internet banking. It expresses that by the combination of two common mechanisms, PKI and biometric, a higher level of security can be achieved that resolves the key management problem. This paper presents a biometric signature based on the ECC (elliptic curve cryptography) algorithm that has some advantages in comparison with the RSA-based biometric signature. The major advantage that dramatically improves security aspects in electronic banking is that using the ECC algorithm to create a biometric signature, it becomes possible to create public and private keys without storing and transmitting any private information anywhere.
{"title":"ECC-Based Biometric Signature: A New Approach in Electronic Banking Security","authors":"S. Mohammadi, S. Abedi","doi":"10.1109/ISECS.2008.98","DOIUrl":"https://doi.org/10.1109/ISECS.2008.98","url":null,"abstract":"Internet banking is the provision of banking services over the internet that gives people the opportunity of easy access to their banking activities. This paper focuses on the security of internet banking. It expresses that by the combination of two common mechanisms, PKI and biometric, a higher level of security can be achieved that resolves the key management problem. This paper presents a biometric signature based on the ECC (elliptic curve cryptography) algorithm that has some advantages in comparison with the RSA-based biometric signature. The major advantage that dramatically improves security aspects in electronic banking is that using the ECC algorithm to create a biometric signature, it becomes possible to create public and private keys without storing and transmitting any private information anywhere.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125303508","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 authors investigate cobweb type service price fluctuations with adaptive learning, and put forward a dynamic service pricing method based on the dynamic stochastic wealth model (DSWM). In this model, authors treat the service market as an expectation feedback system, where the current market equilibrium price of service determined by aggregated individual service providerpsilas expectations of next periodpsilas yield. After several rounds of price adjustment, optimal pricing strategies can be conducted. In order to describe the fluctuations of price in future, authors also developed a set of market impact functions with the technique of dynamic harmonic regression modification to simulate the market impact.
{"title":"General Service Pricing Strategies Research Based on Dynamic Stochastic Wealth Model","authors":"Yongming Cai, Wei Chen","doi":"10.1109/ISECS.2008.35","DOIUrl":"https://doi.org/10.1109/ISECS.2008.35","url":null,"abstract":"The authors investigate cobweb type service price fluctuations with adaptive learning, and put forward a dynamic service pricing method based on the dynamic stochastic wealth model (DSWM). In this model, authors treat the service market as an expectation feedback system, where the current market equilibrium price of service determined by aggregated individual service providerpsilas expectations of next periodpsilas yield. After several rounds of price adjustment, optimal pricing strategies can be conducted. In order to describe the fluctuations of price in future, authors also developed a set of market impact functions with the technique of dynamic harmonic regression modification to simulate the market impact.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116566642","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}
Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. The wasp colony algorithm is a newly presented dynamic scheduling algorithm, which bases on natural insect society behavior models. Based on the principle of the wasp colony algorithm, two different algorithms, namely the routing wasp algorithm and the scheduling wasp algorithm, are combined to solve the job shop dynamic scheduling problem. The algorithms are modified to better adapt to job shop dynamic scheduling environment. The algorithms are developed based on Eclipse 3.2 and J2SE 6.0. Simulation experiments are accomplished and experimental data are analyzed. The results show that the principle of the algorithms is simple, their computational quantity is small, and they can be applied to multi-batch dynamic scheduling with unpredictable entry time due to their favorable potential.
{"title":"Integrated Routing Wasp Algorithm and Scheduling Wasp Algorithm for Job Shop Dynamic Scheduling","authors":"Yan Cao, Yanli Yang, Huamin Wang","doi":"10.1109/ISECS.2008.168","DOIUrl":"https://doi.org/10.1109/ISECS.2008.168","url":null,"abstract":"Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. The wasp colony algorithm is a newly presented dynamic scheduling algorithm, which bases on natural insect society behavior models. Based on the principle of the wasp colony algorithm, two different algorithms, namely the routing wasp algorithm and the scheduling wasp algorithm, are combined to solve the job shop dynamic scheduling problem. The algorithms are modified to better adapt to job shop dynamic scheduling environment. The algorithms are developed based on Eclipse 3.2 and J2SE 6.0. Simulation experiments are accomplished and experimental data are analyzed. The results show that the principle of the algorithms is simple, their computational quantity is small, and they can be applied to multi-batch dynamic scheduling with unpredictable entry time due to their favorable potential.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129508108","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}
Efficient authenticated multi-party key agreement is both an open problem and one of the fundamental cryptographic primitives that has to be tackled for deploying secure e-commerce in the real world. In this paper, by taking one third of the order of a generator a basic version of a multi-party key agreement scheme is proposed based on the matrix-based ECC (Elliptic Curve Cryptog-raphy) by Climent et al. The basic security of the proposed scheme is based on the ECDLP (Elliptic Curve Discrete Logarithm Problem) and the DLP defined over a cyclic subgroup generated by a block matrix consisting of two matrices with entries in an optimal extension field and one matrix whose entries are points of an elliptic curve. Analysis indicates that besides several desirable security properties this system can get larger key spaces flexibly without having to increase the underlying elliptic curve and save the computational requirements inherent to the regeneration and revalidation of elliptic curves.
{"title":"Implementing Multi-party Key Exchange by Linear Combination of Elliptic Curve Points","authors":"Jun Yang, Xianze Yang","doi":"10.1109/ISECS.2008.209","DOIUrl":"https://doi.org/10.1109/ISECS.2008.209","url":null,"abstract":"Efficient authenticated multi-party key agreement is both an open problem and one of the fundamental cryptographic primitives that has to be tackled for deploying secure e-commerce in the real world. In this paper, by taking one third of the order of a generator a basic version of a multi-party key agreement scheme is proposed based on the matrix-based ECC (Elliptic Curve Cryptog-raphy) by Climent et al. The basic security of the proposed scheme is based on the ECDLP (Elliptic Curve Discrete Logarithm Problem) and the DLP defined over a cyclic subgroup generated by a block matrix consisting of two matrices with entries in an optimal extension field and one matrix whose entries are points of an elliptic curve. Analysis indicates that besides several desirable security properties this system can get larger key spaces flexibly without having to increase the underlying elliptic curve and save the computational requirements inherent to the regeneration and revalidation of elliptic curves.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125756807","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 constructs 3-level evaluation model based on ACSI model and confirm the attribute weights by the means of entropy weight method, then compute the overall customer satisfaction index making use of fuzzy comprehensive evaluation method and illustrate the method by an empirical investigation. Results provide policymakers with insights into consumers' mental perception for M-commerce.
{"title":"Customer Satisfaction Evaluation for Mobile Commerce Based on Fuzzy Comprehensive Evaluation","authors":"Jinsong Gao, Jinhui Xu, Zibo Zhou, Zhuojun Li","doi":"10.1109/ISECS.2008.181","DOIUrl":"https://doi.org/10.1109/ISECS.2008.181","url":null,"abstract":"This paper constructs 3-level evaluation model based on ACSI model and confirm the attribute weights by the means of entropy weight method, then compute the overall customer satisfaction index making use of fuzzy comprehensive evaluation method and illustrate the method by an empirical investigation. Results provide policymakers with insights into consumers' mental perception for M-commerce.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131115258","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}
Ontology-based semantic retrieval is a hotspot of current research. In order to achieve fuzzy semantic retrieval, this paper applies a fuzzy ontology framework to information retrieval system in e-commerce. The framework includes three parts: concepts, properties of concepts and values of properties, in which propertypsilas value can be linguistic values of fuzzy concepts. The semantic query expansion is constructed by order relation, equivalence relation, inclusion relation, reversion relation and complement relation between fuzzy concepts defined in linguistic variable ontologies with resource description framework (RDF). The application to retrieve customer, product and supplier information shows that the framework can overcome the localization of other fuzzy ontology models, and this research facilitates the semantic retrieval of information through fuzzy concepts on the semantic Web.
{"title":"Application of Fuzzy Ontology to Information Retrieval for Electronic Commerce","authors":"Jun Zhai, Lixin Shen, Yiduo Liang, J. Jiang","doi":"10.1109/ISECS.2008.177","DOIUrl":"https://doi.org/10.1109/ISECS.2008.177","url":null,"abstract":"Ontology-based semantic retrieval is a hotspot of current research. In order to achieve fuzzy semantic retrieval, this paper applies a fuzzy ontology framework to information retrieval system in e-commerce. The framework includes three parts: concepts, properties of concepts and values of properties, in which propertypsilas value can be linguistic values of fuzzy concepts. The semantic query expansion is constructed by order relation, equivalence relation, inclusion relation, reversion relation and complement relation between fuzzy concepts defined in linguistic variable ontologies with resource description framework (RDF). The application to retrieve customer, product and supplier information shows that the framework can overcome the localization of other fuzzy ontology models, and this research facilitates the semantic retrieval of information through fuzzy concepts on the semantic Web.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327813","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 introduces the constitute, structure and the software model of a set of networked manufacturing quality monitoring system, using JAVA network technique to realize a set of three layer distributed manufacturing process monitoring system which is comprised with remote quality manage center, manufacturing process supervision center and the units of measure and control layer. The design using object-oriented technique based on JAVA can easily transport to different operation systems with high performance of the expansibility. The system is suitable for the production online analysis and judgment in the network environment. It can significantly increase the product quality and economic efficiency of enterprises.
{"title":"Development of Internet-based Long-range Manufacture Quality Monitoring System","authors":"Jitao Fang, Shusong Yu, Xiangqian Ding","doi":"10.1109/ISECS.2008.16","DOIUrl":"https://doi.org/10.1109/ISECS.2008.16","url":null,"abstract":"This paper introduces the constitute, structure and the software model of a set of networked manufacturing quality monitoring system, using JAVA network technique to realize a set of three layer distributed manufacturing process monitoring system which is comprised with remote quality manage center, manufacturing process supervision center and the units of measure and control layer. The design using object-oriented technique based on JAVA can easily transport to different operation systems with high performance of the expansibility. The system is suitable for the production online analysis and judgment in the network environment. It can significantly increase the product quality and economic efficiency of enterprises.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132561721","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}
Video summarization has become an indispensable tool of any practical video content management system in large volume video data. In this paper, we propose a novel approach to automatically generate the video summary for broadcast news videos. Firstly, videos are pre-processed by shot detection, key frame extraction, and story segmentation. Then, a clustering algorithm based on affinity propagation (AP) is originally introduced to group the key frames into clusters. Moreover, a semantic content mining approach based on vector space model (VSM) is adopted to select the most informative video shots for constructing the video summary. This aims to keep the pertinent key frames that distinguish one scene to others and remove the visual-content redundancy from news video. Experimental results show that the proposed method can efficiently generate a set of representative shots and also extract the hierarchical structure of a video sequence.
{"title":"Automatic Video Summarization by Affinity Propagation Clustering and Semantic Content Mining","authors":"Xiao-neng Xie, Fei Wu","doi":"10.1109/ISECS.2008.118","DOIUrl":"https://doi.org/10.1109/ISECS.2008.118","url":null,"abstract":"Video summarization has become an indispensable tool of any practical video content management system in large volume video data. In this paper, we propose a novel approach to automatically generate the video summary for broadcast news videos. Firstly, videos are pre-processed by shot detection, key frame extraction, and story segmentation. Then, a clustering algorithm based on affinity propagation (AP) is originally introduced to group the key frames into clusters. Moreover, a semantic content mining approach based on vector space model (VSM) is adopted to select the most informative video shots for constructing the video summary. This aims to keep the pertinent key frames that distinguish one scene to others and remove the visual-content redundancy from news video. Experimental results show that the proposed method can efficiently generate a set of representative shots and also extract the hierarchical structure of a video sequence.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"729 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114927627","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}
Recommender systems are used by e-commerce sites to suggest products to their customers and to provide consumers with information to help them determine which products to purchase. Traditional recommender is oriented to a unique recommendation algorithm based on clear preference. Unfortunately, it is not enough. In a lot situations, user hope recommender help them to finish a complicate task based on fuzzy preference, not only to provide candidate recommendation list. In the paper, an advanced recommender, recommender oriented to complicate task (ROCT), is proposed to meet the requirement. A general design of ROCT is presented, and its architecture and working procedure is detailed. In ROCT, soft constraint technique is used to model userpsilas preference and critique example is used to elicit userpsilas preference.
{"title":"Recommender Oriented to Complicate Task in E-commerce","authors":"Li Yu, Xiaoping Yang, Qian Li","doi":"10.1109/ISECS.2008.132","DOIUrl":"https://doi.org/10.1109/ISECS.2008.132","url":null,"abstract":"Recommender systems are used by e-commerce sites to suggest products to their customers and to provide consumers with information to help them determine which products to purchase. Traditional recommender is oriented to a unique recommendation algorithm based on clear preference. Unfortunately, it is not enough. In a lot situations, user hope recommender help them to finish a complicate task based on fuzzy preference, not only to provide candidate recommendation list. In the paper, an advanced recommender, recommender oriented to complicate task (ROCT), is proposed to meet the requirement. A general design of ROCT is presented, and its architecture and working procedure is detailed. In ROCT, soft constraint technique is used to model userpsilas preference and critique example is used to elicit userpsilas preference.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114466583","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
扫码关注我们
求助内容：
应助结果提醒方式：