The result of the research of the educational effect of Kanji (Chinese character) learning system is described in this thesis. Kanji learning system was made so that the grade-schooler and the foreigner in the living in Japan may study kanji joyfully and efficiently. An existing system is composed of the client Application program and the Server Application program. The client application program has function to grade characteristics of Kanji, "Tome", "Hane", "Harai" and more. However, this system didn't use for actual study of Kanji. Therefore, two experiments were conducted on college students to verify educational effect of this. In this time, educational effect was defined the change of percentage of correct answers. Also, it was considered as learning time and the number of times writing Kanji in once learning time. The purpose of the first experiment in this research is measurement educational effect to learn stroke order of Kanji. Second experiment's purpose is comparison educational effect between learning process of this system and usual learning process writing Kanji on paper. From these experiments, it seems Kanji learning system is given large educational effort about the stroke order of Kanji to students. On the other hand, it seems that the effect of memorized of Kanji given from Kanji learning system is small. However, looking at the results of these comprehensive, it seems that Kanji learning system can be given more educational effect than the usual learning process to write Kanji many times.
{"title":"Educational Effect of Kanji Learning System","authors":"Kotomi Ishida, Jungpil Shin","doi":"10.1109/APSCC.2012.48","DOIUrl":"https://doi.org/10.1109/APSCC.2012.48","url":null,"abstract":"The result of the research of the educational effect of Kanji (Chinese character) learning system is described in this thesis. Kanji learning system was made so that the grade-schooler and the foreigner in the living in Japan may study kanji joyfully and efficiently. An existing system is composed of the client Application program and the Server Application program. The client application program has function to grade characteristics of Kanji, \"Tome\", \"Hane\", \"Harai\" and more. However, this system didn't use for actual study of Kanji. Therefore, two experiments were conducted on college students to verify educational effect of this. In this time, educational effect was defined the change of percentage of correct answers. Also, it was considered as learning time and the number of times writing Kanji in once learning time. The purpose of the first experiment in this research is measurement educational effect to learn stroke order of Kanji. Second experiment's purpose is comparison educational effect between learning process of this system and usual learning process writing Kanji on paper. From these experiments, it seems Kanji learning system is given large educational effort about the stroke order of Kanji to students. On the other hand, it seems that the effect of memorized of Kanji given from Kanji learning system is small. However, looking at the results of these comprehensive, it seems that Kanji learning system can be given more educational effect than the usual learning process to write Kanji many times.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"33 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":"124899751","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}
Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called "garbled circuit". Later, many protocols based on garbled circuit approach have been presented, most of which discussed malicious adversaries and efficiency about 2PC. However, there only have a few protocols dealing with the fundamental property of fairness for Yao's garbled circuit approach, in which one involved a trusted third party and the others are very expensive. In the paper, we propose' an efficient Yao's garbled circuit protocol for fair secure 2PC based on ElGamal encryption, Pedersen commitment, Cachin et al.'s verifiable oblivious transfer and Ou-Ruan et al.'s gradual release homomorphic timed commitment. The protocol achieves two advantages: it doesn't need the third party and it is more efficient than other fair secure Yao's protocols.
{"title":"Efficient Fair Secure Two-Party Computation","authors":"Ou Ruan, Jing Zhou, Minghui Zheng, Guohua Cui","doi":"10.1109/APSCC.2012.13","DOIUrl":"https://doi.org/10.1109/APSCC.2012.13","url":null,"abstract":"Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called \"garbled circuit\". Later, many protocols based on garbled circuit approach have been presented, most of which discussed malicious adversaries and efficiency about 2PC. However, there only have a few protocols dealing with the fundamental property of fairness for Yao's garbled circuit approach, in which one involved a trusted third party and the others are very expensive. In the paper, we propose' an efficient Yao's garbled circuit protocol for fair secure 2PC based on ElGamal encryption, Pedersen commitment, Cachin et al.'s verifiable oblivious transfer and Ou-Ruan et al.'s gradual release homomorphic timed commitment. The protocol achieves two advantages: it doesn't need the third party and it is more efficient than other fair secure Yao's protocols.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"118 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":"130056678","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}
For the lack of evaluation before the implementation process of business process optimization, this paper presents doing evaluations before the implementation of business processes optimization. The paper uses the method of multiplying and maximizing that combines matrix with fuzzy calculation to improve existing fuzzy comprehensive evaluation method and solves the problem that evaluation result cannot effectively reflect the changes of weight. Then the method is applied to the equipment management process optimization of Second Harbor Engineering Company and the evaluation result reflects the changes of weight more effectively than the original fuzzy comprehensive evaluation.
{"title":"Study and Application of Business Process Optimization and Evaluation","authors":"Dewei Peng, L. Cheng, Hongmei Zhou, Xia Zhang","doi":"10.1109/APSCC.2012.39","DOIUrl":"https://doi.org/10.1109/APSCC.2012.39","url":null,"abstract":"For the lack of evaluation before the implementation process of business process optimization, this paper presents doing evaluations before the implementation of business processes optimization. The paper uses the method of multiplying and maximizing that combines matrix with fuzzy calculation to improve existing fuzzy comprehensive evaluation method and solves the problem that evaluation result cannot effectively reflect the changes of weight. Then the method is applied to the equipment management process optimization of Second Harbor Engineering Company and the evaluation result reflects the changes of weight more effectively than the original fuzzy comprehensive evaluation.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"28 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":"134272834","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}
Virtualization and cloud oriented platforms are becoming popular both in data centres as well as in personal computing space. Several variants with differing characteristics exist for the said platforms. Someone designing an industrial grade software using/for such platforms today has to understand and analyse a large set of issues and characteristics for these variants. In the presented work, we examine and bring out the architecturally significant characteristics of various virtualization and cloud based platforms. We then determine the impact of such characteristics on the ability of guest applications to achieve various quality attributes (QA), such as security, scalability, and other *bilities. These two knowledge artifacts help in systematic and objective assessment of computing platforms on a set of QA criteria. In our findings we observe that efficiency, resource elasticity and security are among the most impacted QAs, and virtualization platforms exhibit the maximum impact on QAs.
{"title":"Cloud Platforms: Impact on Guest Application Quality Attributes","authors":"B. Sodhi, P. T. V.","doi":"10.1109/APSCC.2012.22","DOIUrl":"https://doi.org/10.1109/APSCC.2012.22","url":null,"abstract":"Virtualization and cloud oriented platforms are becoming popular both in data centres as well as in personal computing space. Several variants with differing characteristics exist for the said platforms. Someone designing an industrial grade software using/for such platforms today has to understand and analyse a large set of issues and characteristics for these variants. In the presented work, we examine and bring out the architecturally significant characteristics of various virtualization and cloud based platforms. We then determine the impact of such characteristics on the ability of guest applications to achieve various quality attributes (QA), such as security, scalability, and other *bilities. These two knowledge artifacts help in systematic and objective assessment of computing platforms on a set of QA criteria. In our findings we observe that efficiency, resource elasticity and security are among the most impacted QAs, and virtualization platforms exhibit the maximum impact on QAs.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"13 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":"124479276","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}
Crowd sourcing is a new paradigm of service provision. Current commercial crowd sourcing platforms rarely consider the interaction between task takers, which is extremely required in the disaster management scenario. In this paper, we designed a framework for community based crowd sourcing, i.e., task takers are from an existing community or will easily form a new community. A size-specified community creation method using multiple social contexts is also proposed.
{"title":"Selecting the Best Solvers: Toward Community Based Crowdsourcing for Disaster Management","authors":"Zhiyong Yu, Daqing Zhang, Dingqi Yang, Guolong Chen","doi":"10.1109/APSCC.2012.20","DOIUrl":"https://doi.org/10.1109/APSCC.2012.20","url":null,"abstract":"Crowd sourcing is a new paradigm of service provision. Current commercial crowd sourcing platforms rarely consider the interaction between task takers, which is extremely required in the disaster management scenario. In this paper, we designed a framework for community based crowd sourcing, i.e., task takers are from an existing community or will easily form a new community. A size-specified community creation method using multiple social contexts is also proposed.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"59 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":"124860591","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}
Cloud computing has generated significant interest in the business processing community, where workflow process in a business context can be organized by integrating web-based services or hosted activities. The budget for capital expenses and operating expenses on cloud computing based workflow systems can be made previous the real deployment when expenses of involved tasks (cloud services) and expected task execution number of times (expnum) are available. To get expnum, we propose two approaches, which are flow-balance and divide-and-conquer. We also analyze workflow control-flow patterns to help in getting expnum. Case study and simulations have verified the ability of our approaches.
{"title":"Approaches on Getting Workflow Task Execution Number of Times","authors":"Naiqiao Du, Xiaojun Ye, Jianmin Wang","doi":"10.1109/APSCC.2012.28","DOIUrl":"https://doi.org/10.1109/APSCC.2012.28","url":null,"abstract":"Cloud computing has generated significant interest in the business processing community, where workflow process in a business context can be organized by integrating web-based services or hosted activities. The budget for capital expenses and operating expenses on cloud computing based workflow systems can be made previous the real deployment when expenses of involved tasks (cloud services) and expected task execution number of times (expnum) are available. To get expnum, we propose two approaches, which are flow-balance and divide-and-conquer. We also analyze workflow control-flow patterns to help in getting expnum. Case study and simulations have verified the ability of our approaches.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"2005 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":"116847205","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}
Guisheng Fan, Huiqun Yu, Liqiong Chen, Dongmei Liu
Cloud computing has attracted much interest recently from both industry and academic. More and more Internet applications are moving to the cloud environment. However, fault detection technique in cloud application is a crucial issue. This issue is especially difficult since cloud computing relies by nature on a highly dynamic environment. In this paper, we propose a model based Byzantine fault detection technique for cloud computing. A cloud computing fault net (CFN) is used to precisely model the different components of cloud computing, such as service resources, cloud module, the detection and failure process, etc, the basic properties of the constructed model are analyzed. Based on this, the fault detection strategy is proposed, which can dynamically detect the fault of cloud application in the execution process. The operational semantics and related theories of Petri nets help prove its effectiveness and correctness. An example is used to simulate the modeling and analyzing process, and a series of experiments are done to explain the effectiveness of proposed method.
{"title":"Model Based Byzantine Fault Detection Technique for Cloud Computing","authors":"Guisheng Fan, Huiqun Yu, Liqiong Chen, Dongmei Liu","doi":"10.1109/APSCC.2012.56","DOIUrl":"https://doi.org/10.1109/APSCC.2012.56","url":null,"abstract":"Cloud computing has attracted much interest recently from both industry and academic. More and more Internet applications are moving to the cloud environment. However, fault detection technique in cloud application is a crucial issue. This issue is especially difficult since cloud computing relies by nature on a highly dynamic environment. In this paper, we propose a model based Byzantine fault detection technique for cloud computing. A cloud computing fault net (CFN) is used to precisely model the different components of cloud computing, such as service resources, cloud module, the detection and failure process, etc, the basic properties of the constructed model are analyzed. Based on this, the fault detection strategy is proposed, which can dynamically detect the fault of cloud application in the execution process. The operational semantics and related theories of Petri nets help prove its effectiveness and correctness. An example is used to simulate the modeling and analyzing process, and a series of experiments are done to explain the effectiveness of proposed method.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"50 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":"129375175","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}
Wei Song, Gongxuan Zhang, Yang Zou, Qiliang Yang, Xiaoxing Ma
To stay on the cutting edge, Web services ought to adapt themselves to the evolving business requirements and the changing environments. For a long-running service choreography, its member services may need to evolve even at run-time. However, inconsistencies or spurious results (e.g., unspecified receptions and deadlocks) may occur if these services evolve dynamically in an uncoordinated manner. To cope with this problem, we propose an approach that supports the dynamic evolution of choreographies. In our approach, two mechanisms are proposed to make sure that the choreography evolution can be conducted in an orderly fashion. First, an evolution protocol is proposed to support dynamic co-evolution of the member services in a choreography. Second, the proposed approach restricts choreography changes to one single service only if the relevant partner services can evolve simultaneously. A typical purchase order application is used to motivate our proposal and illustrate the viability of our approach.
{"title":"Towards Dynamic Evolution of Service Choreographies","authors":"Wei Song, Gongxuan Zhang, Yang Zou, Qiliang Yang, Xiaoxing Ma","doi":"10.1109/APSCC.2012.40","DOIUrl":"https://doi.org/10.1109/APSCC.2012.40","url":null,"abstract":"To stay on the cutting edge, Web services ought to adapt themselves to the evolving business requirements and the changing environments. For a long-running service choreography, its member services may need to evolve even at run-time. However, inconsistencies or spurious results (e.g., unspecified receptions and deadlocks) may occur if these services evolve dynamically in an uncoordinated manner. To cope with this problem, we propose an approach that supports the dynamic evolution of choreographies. In our approach, two mechanisms are proposed to make sure that the choreography evolution can be conducted in an orderly fashion. First, an evolution protocol is proposed to support dynamic co-evolution of the member services in a choreography. Second, the proposed approach restricts choreography changes to one single service only if the relevant partner services can evolve simultaneously. A typical purchase order application is used to motivate our proposal and illustrate the viability of our approach.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"27 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":"127297358","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}
For SWARM robots, the complicated tasks should be implemented by the cooperation among the individual robots. Due to the features of mobility and miniaturization, the perception and communication capabilities of such SWARM robots are usually limited. For the communication between the mobile robots, the transmission signal would suffer attenuation and disturbance in terms of the space-time factors in the process of wave propagation, and it could significantly affect the communication connectivity quality. In order to conquer this, the empirical study of the wireless communication connectivity between the mobile robots is presented in the paper, and a novel communication connectivity quality guarantee algorithm using RSSI feedback information and power control technique is proposed to improve the link-state quality. It relies the virtual force based on the RSSI measurement while utilizes an adaptive transmission power control scheme. The experimental results demonstrate the proposed algorithm is able to effectively conquer the effect from the time and space factors in a certain degree, and improve the connectivity quality of communication between mobile robots, and also achieve the energy efficiency.
{"title":"Empirical Study of Communication Connectivity Quality for Mobile Robots","authors":"Y. Zhong, Shanlu Gao, Yan He","doi":"10.1109/APSCC.2012.10","DOIUrl":"https://doi.org/10.1109/APSCC.2012.10","url":null,"abstract":"For SWARM robots, the complicated tasks should be implemented by the cooperation among the individual robots. Due to the features of mobility and miniaturization, the perception and communication capabilities of such SWARM robots are usually limited. For the communication between the mobile robots, the transmission signal would suffer attenuation and disturbance in terms of the space-time factors in the process of wave propagation, and it could significantly affect the communication connectivity quality. In order to conquer this, the empirical study of the wireless communication connectivity between the mobile robots is presented in the paper, and a novel communication connectivity quality guarantee algorithm using RSSI feedback information and power control technique is proposed to improve the link-state quality. It relies the virtual force based on the RSSI measurement while utilizes an adaptive transmission power control scheme. The experimental results demonstrate the proposed algorithm is able to effectively conquer the effect from the time and space factors in a certain degree, and improve the connectivity quality of communication between mobile robots, and also achieve the energy efficiency.","PeriodicalId":256842,"journal":{"name":"2012 IEEE Asia-Pacific Services Computing Conference","volume":"68 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":"129042719","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}
Semantic similarity between ontological concepts plays an important role in service discovery and composition. In this paper, using the ontological relation, a novel intuitionistic fuzzy set model is proposed to interpret concepts on the ontology with three intuitionistic fuzzy sets of different weights, and an effective similarity measure of which is selected to calculate the concept similarity. The model successfully translates all the semantic information of a concept into mathematical expressions of intuitionistic fuzzy sets, thus concept similarity is easily calculated. It is designed to handle not only simple ontologies where only atomic concepts are presented, but also complex ones where concepts could inherit from multiple concepts and have semantic relations other than is-a with other concepts. The experimental result has shown that the model is effective, and it's easy to implement.
{"title":"An Intuitionistic Fuzzy Set Model for Concept Similarity Using Ontological Relations","authors":"Fa-Gui Liu, Fen Xiao, Yue-Dong Lin, Yang Zhang","doi":"10.1109/APSCC.2012.27","DOIUrl":"https://doi.org/10.1109/APSCC.2012.27","url":null,"abstract":"Semantic similarity between ontological concepts plays an important role in service discovery and composition. In this paper, using the ontological relation, a novel intuitionistic fuzzy set model is proposed to interpret concepts on the ontology with three intuitionistic fuzzy sets of different weights, and an effective similarity measure of which is selected to calculate the concept similarity. The model successfully translates all the semantic information of a concept into mathematical expressions of intuitionistic fuzzy sets, thus concept similarity is easily calculated. It is designed to handle not only simple ontologies where only atomic concepts are presented, but also complex ones where concepts could inherit from multiple concepts and have semantic relations other than is-a with other concepts. The experimental result has shown that the model is effective, and it's easy to implement.","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":"125699293","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
扫码关注我们
求助内容：
应助结果提醒方式：