{"title":"Business Process-Oriented Software Architecture for Supporting Business Process Change","authors":"Qing Yao, Jing Zhang, Haiyang Wang","doi":"10.1109/ISECS.2008.46","DOIUrl":"https://doi.org/10.1109/ISECS.2008.46","url":null,"abstract":"As a business process is essential in running an enterprise, this paper aims toward improving software architecture by extracting business-relevant semantics from business logic and transforming them as important elements that need to be molded and represented in software architecture. This allows for the development of a business process-oriented software architecture (BPOSA) that can support smoother business process change. The paper introduces the structure of BPOSA and its work mode. Then it describes the steps involved in designing a process-oriented software system, and provides analysis and design methods of extending process-relevant attributes for application in business operations.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"50 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":"115808815","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}
{"title":"High Efficiency Association Rules Mining Algorithm for Bank Cost Analysis","authors":"Ying Mei, Liangsheng Zhu","doi":"10.1109/ISECS.2008.47","DOIUrl":"https://doi.org/10.1109/ISECS.2008.47","url":null,"abstract":"This paper introduces improving rate and proposes the incremental mining algorithm for optimizing association rules based on CBA mining algorithm. Comparing with the traditional algorithm, the improved algorithm is fast, efficient in incremental data mining and can find trends in association rules. The decision making reliability is enhanced by the association rules obtained from the improved algorithm. The algorithm was used to bank cost analysis with test results showing that the prediction precision of the algorithm is better than that of the traditional algorithm.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"174 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":"116132241","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}
{"title":"Metadata Management for Distributed Multimedia Storage System","authors":"Ling Zhan, Ji-guang Wan, Peng Gu","doi":"10.1109/ISECS.2008.141","DOIUrl":"https://doi.org/10.1109/ISECS.2008.141","url":null,"abstract":"As a result of the multimedia rapid growth, there has been a huge increase in the amount of information generated and shared by people all over the world. Demand for large-scale multimedia storage system is growing rapidly. This paper describes the design and implementation of the Two-level metadata server for distributed multimedia storage system (DMSS). The DMSS divides the logical view of the stored data from the physical view. The logical view is managed by the metadata server which is called GMS (global metadata server), and the physical view is managed by a component of storage servers which is called LMS (local metadata server). Adopting LMS, each storage server can maintain its own storage resources and metadata and data independently, and can offer storage service independently. The DMSS allows the application servers to access the storage servers directly and in parallel providing very high performance.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"30 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":"123732696","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}
{"title":"Research on a New E-voting Method based on the Cellular Phone","authors":"Yun-he Li, Sha Wu","doi":"10.1109/ISECS.2008.205","DOIUrl":"https://doi.org/10.1109/ISECS.2008.205","url":null,"abstract":"E-voting based on the Internet has been recently performed in a wide region. There isn't any spatial restriction that a voter has to go to a certain polling place, but an e-voting using the Internet has to gather the computer in which the internet connection is possible. This voting method requires an access account for the e-voting through the beforehand report of a voter. To minimize these disadvantages, a method was proposed in this paper, in which a voter, who has the wireless certificate issued in advance, uses his own cellular phone for the e-voting. The approach allows a voter to cast his vote in a simple and convenient way no matter the time and location, thus increasing the rate of voting, and ensuring confidentiality and anonymity as well.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"78 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":"121746173","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}
{"title":"A Fuzzy Anonymity Analysis Model for Mobility in Anonymity System","authors":"Liang Wang, Yajun Guo, Huifang Yan","doi":"10.1109/ISECS.2008.90","DOIUrl":"https://doi.org/10.1109/ISECS.2008.90","url":null,"abstract":"Anonymity is the property of keeping secret the identity of user accessing a certain resource or service, and it is a main approach to protect userpsilas privacy. At present, many solutions of anonymity have been proposed, but they seldom concern how to evaluate the security of an anonymity mechanism. As userpsilas actions are often dynamic and random in the network, this paper proposes a novel conceptual anonymity analysis model based on the fuzzy relation theory in fuzzy mathematics. Theoretic analysis shows that the proposed model can effectively analyze the security of existing anonymity systems in respect of the type of mobility, and can help design a new anonymity protection scheme.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"237 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":"123889908","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}
{"title":"An Anomaly Intrusion Detection Model Based on Limited Labeled Instances","authors":"Shanqing Guo, Zhong-Hua Zhao","doi":"10.1109/ISECS.2008.26","DOIUrl":"https://doi.org/10.1109/ISECS.2008.26","url":null,"abstract":"Unsupervised or supervised anomaly intrusion detection techniques have great utility with the context of network intrusion detection system. However, large amount of labeled attack instances used by supervised approaches are difficult to obtain. And this makes most existing supervised techniques hardly be implemented in the real world. Unsupervised methods are superior in their independency on prior knowledge, but it is also very difficult for these methods to achieve high detection rate as well as low false positive rate. In this paper, we proposed an anomaly intrusion detection model based on small labeled instances that outperform existing unsupervised methods with a detection performance very close to that of the supervised one. We evaluated our methods by conducting experiments with network records from the KDD CUP 1999 data set. The results showed that our algorithm is an efficient method in detecting both known and unknown attacks.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"33 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":"129968894","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}
{"title":"Message Substitute Attack on Concurrent Signatures Protocol and its Improvement","authors":"Yaling Zhang, Xiaofeng Wang","doi":"10.1109/ISECS.2008.214","DOIUrl":"https://doi.org/10.1109/ISECS.2008.214","url":null,"abstract":"At Eurocrypt 2004, the concept of concurrent signatures was introduced by Chen, Kudla and Paterson. Concurrent signatures contribute a novel approach for the traditional problem of fair exchange of signatures. In this paper a general attack named the message substitute attack to the existing concurrent signatures protocol is proposed. Under the message substitute attack there is no concurrent in the existing concurrent signatures protocols including perfect concurrent signatures (PCS) protocol proposed by Susilo et al and its improvement iPCS1 protocol proposed by Guilin Wang et al. To prevent the message substitute attack, an i2PCS1 protocol which is an improvement on iPCS1 protocol is proposed. Further more an i3PCS1 protocol which is another improvement on iPCS1 protocol is proposed, the distinct advantage of i3PCS1 protocol is that its keystones are not published by the initial signer Alice finally but by the matching signer Bob, so that the matching signer Bob has some advantage over the initial signer Alice, while in almost all previous concurrent signatures protocols the initial signer Alice has some advantage. So the i3PCS1 Protocol differs from the previous concurrent signatures protocols.","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":"128506598","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}
{"title":"Development Course for Information Platform Based on MDA","authors":"Z. Deng, Bin Su","doi":"10.1109/ISECS.2008.129","DOIUrl":"https://doi.org/10.1109/ISECS.2008.129","url":null,"abstract":"MDA, which is with the main-line of models conversion, not only lowered the mismatch of problem domain with solve domain, but also lowered dependence to technology. That makes developers be able to focus on the problems themselves. This paper mainly discusses the information platform development based on MDA. Associated MDA with Web application, it analyzed the 6 processes which composes the development course suitable for Web application development. An Operating Log Inquiries subsystem of a power company as a case study is presented in the end.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"8 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":"115943246","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}
{"title":"An Effective Fragile Document Watermarking Technique","authors":"Jiaxin Yu, Xinsheng Wang, Jianfei Li, Xu Nan","doi":"10.1109/ISECS.2008.91","DOIUrl":"https://doi.org/10.1109/ISECS.2008.91","url":null,"abstract":"Some work is done to improve embedding capacity and locate tampered regions base on the prior research of fragile document watermark in this paper. And an effective fragile document watermarking algorithm is proposed. The wet paper code which adjusts the number of embedding watermark bits dynamically and takes full advantage of turnover pixels is used for embed watermark to improve embedding capacity. To locate tampered regions, the image is cut into blocks according to the content of it and every image block includes only one character or Chinese word. The Gray-code which was used for coding the watermark reduced the decoding errors caused by noise and improved the robustness of the watermark. The experiment shows that this algorithm can detect the location of tampered image and get better embedding capacity that is near the number of changeable pixels, which are demands of actual application.","PeriodicalId":144075,"journal":{"name":"2008 International Symposium on Electronic Commerce and Security","volume":"203 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":"122448501","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}
{"title":"Ownership Motivation and Corporate Performance in IT Industry under the Wave of E-Commerce: An Empirical Study based on Chinese Public Companies","authors":"Qi Yue, Hailin Lan, Luan Jiang","doi":"10.1109/ISECS.2008.30","DOIUrl":"https://doi.org/10.1109/ISECS.2008.30","url":null,"abstract":"The development of Internet generated the wave of E-Commerce, which can lead an expansion of IT industry. This paper focuses on the relationship between of ownership motivation and corporate performance in IT companies because the showing of low occupational stability of managers in IT industry. With an empirical research through all 99 IT companies from Shanghai and Shenzhen stock market as the sample data, this paper founded that the average managerial ownership is quite small and has no effect on corporate performance, but there is an U-curved relationship between the population ratio of managerial stockholder and corporate performance.","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":"120919198","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}