Yan Wang, Liangjie Zhang, Huimeng Cai, Jian Sun, Ning Li
With the development of the society, distance education and training gradually shows some characteristics similar to the service industry, such as invisible, cannot be stored, heterogeneous, serving and consuming in the same time and so on. To gain a bigger market share in competition and more reputation and brand value in development, distance education and training institutions must pay great attention to the satisfaction and acceptation of its students for its teaching. The rapid development of modern Information Technology (IT) brings new opportunities to promote the quality of distance education services. In this paper, we design an evaluation index system based on an "IT application fields - service quality promotion" two dimensions framework. The dimension of IT application fields includes academic and non-academic student support services. The dimension of service quality promotion includes tangibles, reliability, responsiveness, assurance and empathy. The quality of student support services is measured by the SERVPERF method. Finally, we also provide a case study from The Open University of China(http://ouchn.edu.cn/) to validate our assumptions.
{"title":"Evaluating the Quality of Distance Education Services by Using Modern Information Technology","authors":"Yan Wang, Liangjie Zhang, Huimeng Cai, Jian Sun, Ning Li","doi":"10.1109/APSCC.2012.50","DOIUrl":"https://doi.org/10.1109/APSCC.2012.50","url":null,"abstract":"With the development of the society, distance education and training gradually shows some characteristics similar to the service industry, such as invisible, cannot be stored, heterogeneous, serving and consuming in the same time and so on. To gain a bigger market share in competition and more reputation and brand value in development, distance education and training institutions must pay great attention to the satisfaction and acceptation of its students for its teaching. The rapid development of modern Information Technology (IT) brings new opportunities to promote the quality of distance education services. In this paper, we design an evaluation index system based on an \"IT application fields - service quality promotion\" two dimensions framework. The dimension of IT application fields includes academic and non-academic student support services. The dimension of service quality promotion includes tangibles, reliability, responsiveness, assurance and empathy. The quality of student support services is measured by the SERVPERF method. Finally, we also provide a case study from The Open University of China(http://ouchn.edu.cn/) to validate our assumptions.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122025499","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 face recognition method based on independent component analysis and wavelet transform is proposed. Firstly an image is decomposed using WT into different frequency sub-bands, and then ICA is applied on wavelet sub-bands to get the independent vector, which includes the main information of original image, finally face recognition is implemented with the subspace comprised by these basis vectors. We compared our methods with two face recognition algorithms, ICA and WT. In the experiments, the nearest-neighbor classifier is used to recognize different faces from the ORL face database. Experimental results show that the proposed method improved the recognition rate effectively, the best accuracy rate can reach 92%.
{"title":"An Improved Face Recognition Based on ICA and WT","authors":"Min Luo, Liu Song, S. Li","doi":"10.1109/APSCC.2012.52","DOIUrl":"https://doi.org/10.1109/APSCC.2012.52","url":null,"abstract":"A face recognition method based on independent component analysis and wavelet transform is proposed. Firstly an image is decomposed using WT into different frequency sub-bands, and then ICA is applied on wavelet sub-bands to get the independent vector, which includes the main information of original image, finally face recognition is implemented with the subspace comprised by these basis vectors. We compared our methods with two face recognition algorithms, ICA and WT. In the experiments, the nearest-neighbor classifier is used to recognize different faces from the ORL face database. Experimental results show that the proposed method improved the recognition rate effectively, the best accuracy rate can reach 92%.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128692422","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}
Computer Graphics is an important course for graduate students in computer major. Aiming at the present teaching situation of computer graphics course, combined with an the course characteristics, some educational reform measures, such as adjusting of teaching content, employing more examples in teaching, strengthening the combination of knowledge and practical ability, was proposed. The teaching practices show that these methods can arouse students' learning interest, make the students understand the course better, and obviously improve the quality of teaching.
{"title":"Reform and Exploration of the Computer Graphics","authors":"Yunfeng He, Yizhu Zhao","doi":"10.1109/APSCC.2012.61","DOIUrl":"https://doi.org/10.1109/APSCC.2012.61","url":null,"abstract":"Computer Graphics is an important course for graduate students in computer major. Aiming at the present teaching situation of computer graphics course, combined with an the course characteristics, some educational reform measures, such as adjusting of teaching content, employing more examples in teaching, strengthening the combination of knowledge and practical ability, was proposed. The teaching practices show that these methods can arouse students' learning interest, make the students understand the course better, and obviously improve the quality of teaching.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"12 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114099329","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, we provide a new compositional framework for specifying controllability and refinement of service protocols interacting asynchronously. First, we investigate necessary and sufficient conditions for protocols controllability. Then, we give sufficient conditions for preserving controllability of protocols by asynchronous composition. Finally, we propose two protocols refinement relations and show the soundness of our formal framework: independent implement ability of protocols together with the preservation of controllability under protocols by refinement.
{"title":"Controllability Preservation and Behavioural Refinement for Service Protocols","authors":"N. Hameurlain","doi":"10.1109/APSCC.2012.60","DOIUrl":"https://doi.org/10.1109/APSCC.2012.60","url":null,"abstract":"In this paper, we provide a new compositional framework for specifying controllability and refinement of service protocols interacting asynchronously. First, we investigate necessary and sufficient conditions for protocols controllability. Then, we give sufficient conditions for preserving controllability of protocols by asynchronous composition. Finally, we propose two protocols refinement relations and show the soundness of our formal framework: independent implement ability of protocols together with the preservation of controllability under protocols by refinement.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134353664","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 traditional database technology can't meet the rapidly growing information and the demands of extreme scalability, high availability and reliability for the mass data. In this paper, we have designed a distributed storage system based MPP(massively parallel processing) architecture on RDBMS to solve these problems. First, we present the main framework and the function architecture of the design. Then we do some experiments and performance tests. At last, we conclude that with the good scalability and massively parallel processing advantage, the system can solve the mass data storage problem. The idea of distributed storage system based MPP architecture in relational databases speeds up reading and writing, improving the shortcomings of traditional database.
{"title":"The Distributed Storage System Based on MPP for Mass Data","authors":"Cunchen Li, Jun Yang, Jing Han, E. Haihong","doi":"10.1109/APSCC.2012.55","DOIUrl":"https://doi.org/10.1109/APSCC.2012.55","url":null,"abstract":"The traditional database technology can't meet the rapidly growing information and the demands of extreme scalability, high availability and reliability for the mass data. In this paper, we have designed a distributed storage system based MPP(massively parallel processing) architecture on RDBMS to solve these problems. First, we present the main framework and the function architecture of the design. Then we do some experiments and performance tests. At last, we conclude that with the good scalability and massively parallel processing advantage, the system can solve the mass data storage problem. The idea of distributed storage system based MPP architecture in relational databases speeds up reading and writing, improving the shortcomings of traditional database.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096560","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}
As the adoption of SOA becomes more popular, the problems of implementing SOA are becoming increasingly serious. The proposal and research on SOA governance are intended to resolve these problems and provide guidance on how to plan, design and operate SOA, as well as maximize profits. Many IT organizations have proposed their SOA frameworks, but these frameworks have some disadvantages. In this paper, we propose an ITIL v3-based solution to SOA Governance. Adopting the framework of ITIL, our solution centers around the services life cycle, defines the implementation of each phase, and provides guidance on best practice. It is therefore applicable to practice.
{"title":"An ITIL v3-Based Solution to SOA Governance","authors":"Cui Xian-Peng, Li Bi-ying, Mou Rui-fang","doi":"10.1109/APSCC.2012.17","DOIUrl":"https://doi.org/10.1109/APSCC.2012.17","url":null,"abstract":"As the adoption of SOA becomes more popular, the problems of implementing SOA are becoming increasingly serious. The proposal and research on SOA governance are intended to resolve these problems and provide guidance on how to plan, design and operate SOA, as well as maximize profits. Many IT organizations have proposed their SOA frameworks, but these frameworks have some disadvantages. In this paper, we propose an ITIL v3-based solution to SOA Governance. Adopting the framework of ITIL, our solution centers around the services life cycle, defines the implementation of each phase, and provides guidance on best practice. It is therefore applicable to practice.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131089022","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}
Advances in cloud computing and Internet technologies have pushed more and more data owners to outsource their data to remote cloud servers to enjoy with huge data management services in an efficient cost. However, despite its technical advances, cloud computing introduces many new security challenges that need to be addressed well. This is because, data owners, under such new setting, loss the control over their sensitive data. To keep the confidentiality of their sensitive data, data owners usually outsource the encrypted format of their data to the untrusted cloud servers. Several approaches have been provided to enable searching the encrypted data. However, the majority of these approaches are limited to handle either a single keyword search or a Boolean search but not a multikeyword ranked search, a more efficient model to retrieve the top documents corresponding to the provided keywords. In this paper, we propose a secure multi-keyword ranked search scheme over the encrypted cloud data. Such scheme allows an authorized user to retrieve the most relevant documents in a descending order, while preserving the privacy of his search request and the contents of documents he retrieved. To do so, data owner builds his searchable index, and associates with each term document with a relevance score, which facilitates document ranking. The proposed scheme uses two distinct cloud servers, one for storing the secure index, while the other is used to store the encrypted document collection. Such new setting prevents leaking the search result, i.e. the document identifiers, to the adversary cloud servers. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.
{"title":"Secure Rank-Ordered Search of Multi-keyword Trapdoor over Encrypted Cloud Data","authors":"Ayad Ibrahim, Hai Jin, A. Yassin, Deqing Zou","doi":"10.1109/APSCC.2012.59","DOIUrl":"https://doi.org/10.1109/APSCC.2012.59","url":null,"abstract":"Advances in cloud computing and Internet technologies have pushed more and more data owners to outsource their data to remote cloud servers to enjoy with huge data management services in an efficient cost. However, despite its technical advances, cloud computing introduces many new security challenges that need to be addressed well. This is because, data owners, under such new setting, loss the control over their sensitive data. To keep the confidentiality of their sensitive data, data owners usually outsource the encrypted format of their data to the untrusted cloud servers. Several approaches have been provided to enable searching the encrypted data. However, the majority of these approaches are limited to handle either a single keyword search or a Boolean search but not a multikeyword ranked search, a more efficient model to retrieve the top documents corresponding to the provided keywords. In this paper, we propose a secure multi-keyword ranked search scheme over the encrypted cloud data. Such scheme allows an authorized user to retrieve the most relevant documents in a descending order, while preserving the privacy of his search request and the contents of documents he retrieved. To do so, data owner builds his searchable index, and associates with each term document with a relevance score, which facilitates document ranking. The proposed scheme uses two distinct cloud servers, one for storing the secure index, while the other is used to store the encrypted document collection. Such new setting prevents leaking the search result, i.e. the document identifiers, to the adversary cloud servers. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"43 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132896366","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}
Gaming services are attractive for Internet users. How to broadcast live gaming services to large-scale Internet users is still a big problem. Traditional schemes, based on Peer-to-Peer (P2P) live-streaming and based on TV shows, have poor user experiences (good graphic quality with high resolution) and need big bandwidth or TV set support. In order to avoid network congestion, a small number of solutions propose an alternative approach based on game data content instead of video content to provide game live services. At present, all of them who use client/server framework do not emphasize the design of system architecture, so the number of users is constrained and the system is hard to expand. In this paper, we introduce PKTV, a P2P game battle observing system, which is now optimized specially for War craft 3. PKTV system broadcasts game data content to reduce bandwidth overhead, maintains a P2P overlay for each gaming channel and uses a reliable UDP protocol to break the limitation of the TCP connections, decentralizes servers to enhance system's availability and scalability. Furthermore, tests and simulations show that PKTV also have robust functionality and good performance: low-latency, low bandwidth consumption and very considerable bandwidth savings for servers.
{"title":"A Peer-to-Peer Massive Battle Observing System to Support Game Live","authors":"Linchen Yu, Xiaofei Liao","doi":"10.1109/APSCC.2012.19","DOIUrl":"https://doi.org/10.1109/APSCC.2012.19","url":null,"abstract":"Gaming services are attractive for Internet users. How to broadcast live gaming services to large-scale Internet users is still a big problem. Traditional schemes, based on Peer-to-Peer (P2P) live-streaming and based on TV shows, have poor user experiences (good graphic quality with high resolution) and need big bandwidth or TV set support. In order to avoid network congestion, a small number of solutions propose an alternative approach based on game data content instead of video content to provide game live services. At present, all of them who use client/server framework do not emphasize the design of system architecture, so the number of users is constrained and the system is hard to expand. In this paper, we introduce PKTV, a P2P game battle observing system, which is now optimized specially for War craft 3. PKTV system broadcasts game data content to reduce bandwidth overhead, maintains a P2P overlay for each gaming channel and uses a reliable UDP protocol to break the limitation of the TCP connections, decentralizes servers to enhance system's availability and scalability. Furthermore, tests and simulations show that PKTV also have robust functionality and good performance: low-latency, low bandwidth consumption and very considerable bandwidth savings for servers.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114528458","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}
Software assurance in software development process becomes an important part of ICT supply chains risk management, and also has been one of the most advanced information security technologies. Based on the researches of software assurance, this paper studies the development and current research of software security assurance in the background of software security being concerned by more and more people, then proposes a software security assurance model in software development process based on SDLC model, summarizes security activities during the development phase, analyzes the risk management of software assurance. Finally, the paper also indicates new research directions.
{"title":"Research on Software Development Process Assurance Models in ICT Supply Chain Risk Management","authors":"Feng Xie, Tianbo Lu, Bing Xu, Dongqing Chen, Yong Peng","doi":"10.1109/APSCC.2012.41","DOIUrl":"https://doi.org/10.1109/APSCC.2012.41","url":null,"abstract":"Software assurance in software development process becomes an important part of ICT supply chains risk management, and also has been one of the most advanced information security technologies. Based on the researches of software assurance, this paper studies the development and current research of software security assurance in the background of software security being concerned by more and more people, then proposes a software security assurance model in software development process based on SDLC model, summarizes security activities during the development phase, analyzes the risk management of software assurance. Finally, the paper also indicates new research directions.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130437716","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}
Currently, there is few uniform modelling standards for virtual experiment (VE) systems of different disciplines. The scalability and compatibility of existing systems are relatively poor. The idea of Modelica provides a good opportunity for the unification of the modelling of multi-discipline VEs (MDVE). However, Modelica is an original multi-domain modelling method for scientific research, instead of for VE education. There are some obvious gaps to bring it into a MDVE platform (MDVEP), especially, if it is designed to support massive users and parallel modelling and resolving. This paper presents a new virtual experiment distributed task management system (VETMS) for MDVEP, which can improve the efficiency, stability and availability of the platform. It uses hierarchical design method to decouple the different modules and also provides a set of Application Programming Interfaces (APIs) for external calls. Besides, the system performance is also considered. A Modelica-oriented mechanism is proposed to tackle service failures. A parallelized Twisted framework is presented to overcome the problem of limitation of concurrent requests. Meanwhile, a NAT (Network Address Translator) traversal module of TCP based STUNT protocol is added to reduce the amount of data through master node. Experiment results show that the system can serve as a task management service for MDVEP with good performance.
{"title":"A Novel Task Management System for Modelica-Based Multi-discipline Virtual Experiment Platform","authors":"Wenbin Jiang, Shuguang Wang, Hai Jin, Yong Huang","doi":"10.1109/APSCC.2012.70","DOIUrl":"https://doi.org/10.1109/APSCC.2012.70","url":null,"abstract":"Currently, there is few uniform modelling standards for virtual experiment (VE) systems of different disciplines. The scalability and compatibility of existing systems are relatively poor. The idea of Modelica provides a good opportunity for the unification of the modelling of multi-discipline VEs (MDVE). However, Modelica is an original multi-domain modelling method for scientific research, instead of for VE education. There are some obvious gaps to bring it into a MDVE platform (MDVEP), especially, if it is designed to support massive users and parallel modelling and resolving. This paper presents a new virtual experiment distributed task management system (VETMS) for MDVEP, which can improve the efficiency, stability and availability of the platform. It uses hierarchical design method to decouple the different modules and also provides a set of Application Programming Interfaces (APIs) for external calls. Besides, the system performance is also considered. A Modelica-oriented mechanism is proposed to tackle service failures. A parallelized Twisted framework is presented to overcome the problem of limitation of concurrent requests. Meanwhile, a NAT (Network Address Translator) traversal module of TCP based STUNT protocol is added to reduce the amount of data through master node. Experiment results show that the system can serve as a task management service for MDVEP with good performance.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190382","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
扫码关注我们
求助内容：
应助结果提醒方式：