Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.83
Y. Ono, M. Ishihara, S. Hirokawa, M. Yamashiro
This paper attempts to evaluate our new real time qualitative feedback system and its implementation. It was suggested in our earlier research that text-based instant feedback has an advantage of providing learners with opportunities to become aware of new discoveries from the feedback from the audience. We start the discussion with the consideration of some issues around the new system, comparison with two traditional approaches, Clicker approach and Forum approach, cost on learners, and their motivation for the next presentation. We carried out experiment studies and prove that our approach is superior to the traditional Forum and quantitative approach, showing the results of our research.
{"title":"Implementation and Evaluation of Real Time Qualitative Feedback Systems in a Foreign Language Presentation Course","authors":"Y. Ono, M. Ishihara, S. Hirokawa, M. Yamashiro","doi":"10.1109/IIAI-AAI.2014.83","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.83","url":null,"abstract":"This paper attempts to evaluate our new real time qualitative feedback system and its implementation. It was suggested in our earlier research that text-based instant feedback has an advantage of providing learners with opportunities to become aware of new discoveries from the feedback from the audience. We start the discussion with the consideration of some issues around the new system, comparison with two traditional approaches, Clicker approach and Forum approach, cost on learners, and their motivation for the next presentation. We carried out experiment studies and prove that our approach is superior to the traditional Forum and quantitative approach, showing the results of our research.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608968","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.188
S. M. Said, Morikazu Nakamura
Hybrid algorithms incorporated with parallel processing techniques are very powerful tools for efficiently solving very complex optimization problems. We present asynchronous parallel computer architecture adaptation based on hybridization of Genetic Algorithms (GAs) and Estimation of Distribution Algorithms (EDAs). In this master-slave formulation, slaves perform evolutionary computation independently using GAs, while master supervises and controls the searching process. Master's role is to probabilistically study the characteristics of solution space and directs the slaves on good searching spots. This study reports some few findings on the ability of our hybrid algorithm to solve some instances of BQP problem as well as AODV routing optimization in VANETs. For both problems our hybrid algorithm has obtained best results in terms of quality of solutions as well as computational speed.
{"title":"Master-Slave Asynchronous Evolutionary Hybrid Algorithm and ITS Application in VANETs Routing Optimization","authors":"S. M. Said, Morikazu Nakamura","doi":"10.1109/IIAI-AAI.2014.188","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.188","url":null,"abstract":"Hybrid algorithms incorporated with parallel processing techniques are very powerful tools for efficiently solving very complex optimization problems. We present asynchronous parallel computer architecture adaptation based on hybridization of Genetic Algorithms (GAs) and Estimation of Distribution Algorithms (EDAs). In this master-slave formulation, slaves perform evolutionary computation independently using GAs, while master supervises and controls the searching process. Master's role is to probabilistically study the characteristics of solution space and directs the slaves on good searching spots. This study reports some few findings on the ability of our hybrid algorithm to solve some instances of BQP problem as well as AODV routing optimization in VANETs. For both problems our hybrid algorithm has obtained best results in terms of quality of solutions as well as computational speed.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127705464","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.178
Shunki Takami, Ippei Torii, N. Ishii
Recently, the decreasing birthrate and aging society has advanced along with the rapid development of medical technology in Japan. Many Japanese want to live at home with old age and the number of elderly people living alone also steadily increases. Solitary deaths of elderly people living alone become an issue in such situation and it is necessary to take measures to cope with the situation. Some products to prevent solitary deaths utilizing information technology have been released already in Japan. However, most of them are not widely used because maintenance or introduction costs are quite high. In this paper, we state the development of the medical record system equipped with a simple automatic inquiry function to manage the health of the elderly living alone, "Otassha Tsushin", and the mobile application to prevent solitary deaths, "Anshin", to distribute to elderly people living alone and their families and supporters.
{"title":"Application of Information Technology to Develop the System for Solitary Death","authors":"Shunki Takami, Ippei Torii, N. Ishii","doi":"10.1109/IIAI-AAI.2014.178","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.178","url":null,"abstract":"Recently, the decreasing birthrate and aging society has advanced along with the rapid development of medical technology in Japan. Many Japanese want to live at home with old age and the number of elderly people living alone also steadily increases. Solitary deaths of elderly people living alone become an issue in such situation and it is necessary to take measures to cope with the situation. Some products to prevent solitary deaths utilizing information technology have been released already in Japan. However, most of them are not widely used because maintenance or introduction costs are quite high. In this paper, we state the development of the medical record system equipped with a simple automatic inquiry function to manage the health of the elderly living alone, \"Otassha Tsushin\", and the mobile application to prevent solitary deaths, \"Anshin\", to distribute to elderly people living alone and their families and supporters.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126005974","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.25
Shin-Ya Katayama, Shun Shiramatsu, Tadachika Ozono, T. Shintani
We propose a Generational Layered (GL) canvas mechanism to reduce delays of synchronization for collaborative Web applications. The delays consist of network delays and drawing delays. The network delays are well-argued topic by various researches. We focus on the drawing delays, which are a primary bottleneck of synchronization of objects on canvas. In our previous work, we have proposed a Drawing-Frequency based Layered (DFL) canvas mechanism. The DFL canvas mechanism solved the drawing problem but requires to manually assign a parameter how frequently an object is redrawn, respectively. The GL canvas mechanism achieves the automatic assignment of canvas objects to elicit high performance when the drawing-frequency is unknown. The automatic assignment algorithm is inspired by the generational garbage collection. We implemented and evaluated the mechanism, and then the mechanism elicited higher performance up to 3.5 times faster when the canvas had the sufficient number of layers. Developers can create fast Web applications using the mechanism. The mechanism enhances the potential of the Web applications running within low performance devices such as tablets and smartphones.
{"title":"Generational Layered Canvas Mechanism for Collaborative Web Applications","authors":"Shin-Ya Katayama, Shun Shiramatsu, Tadachika Ozono, T. Shintani","doi":"10.1109/IIAI-AAI.2014.25","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.25","url":null,"abstract":"We propose a Generational Layered (GL) canvas mechanism to reduce delays of synchronization for collaborative Web applications. The delays consist of network delays and drawing delays. The network delays are well-argued topic by various researches. We focus on the drawing delays, which are a primary bottleneck of synchronization of objects on canvas. In our previous work, we have proposed a Drawing-Frequency based Layered (DFL) canvas mechanism. The DFL canvas mechanism solved the drawing problem but requires to manually assign a parameter how frequently an object is redrawn, respectively. The GL canvas mechanism achieves the automatic assignment of canvas objects to elicit high performance when the drawing-frequency is unknown. The automatic assignment algorithm is inspired by the generational garbage collection. We implemented and evaluated the mechanism, and then the mechanism elicited higher performance up to 3.5 times faster when the canvas had the sufficient number of layers. Developers can create fast Web applications using the mechanism. The mechanism enhances the potential of the Web applications running within low performance devices such as tablets and smartphones.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125739226","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.113
L. Hsu
Very few studies have explored the learning outcome of nursing students undertaking physical examination and health assessment training. A simulation-based physical examination and health assessment training could provide a safe learning environment that allows mistakes and offers opportunities for discussion, feedback and reflection that are crucial for clinical skills and knowledge development. A simulation-based training can provide students with systematic guidance and feedback and help them relate simulation to real-life clinical practice as they build up clinical competence. This study aims to explore the effect of a simulation-based, e-learning physical examination and health assessment training course on clinical competence development of a group of nursing students. The APP provides instructions on abdominal examinations, respiratory examinations, cardiovascular examinations, and neuromuscular examinations.
{"title":"The Design of Simulation-Based e-Learning Mobile Application Software","authors":"L. Hsu","doi":"10.1109/IIAI-AAI.2014.113","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.113","url":null,"abstract":"Very few studies have explored the learning outcome of nursing students undertaking physical examination and health assessment training. A simulation-based physical examination and health assessment training could provide a safe learning environment that allows mistakes and offers opportunities for discussion, feedback and reflection that are crucial for clinical skills and knowledge development. A simulation-based training can provide students with systematic guidance and feedback and help them relate simulation to real-life clinical practice as they build up clinical competence. This study aims to explore the effect of a simulation-based, e-learning physical examination and health assessment training course on clinical competence development of a group of nursing students. The APP provides instructions on abdominal examinations, respiratory examinations, cardiovascular examinations, and neuromuscular examinations.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132235962","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.167
Kana Miyawaki, Hung-Hsuan Huang, K. Kawagoe
There are many research activities on Region Of Interest (ROI) in the research fields of image recognition, used for medical treatments and sport video analysis. Many researches on an area of interest (Region Of Interest, ROI) have been conducted in the research area on image processings. It's important to extract a region which isn't an interest area in order to avoid the false negative of an area of interest. It is much meaningful to consider that an urrently uninteresting area is one of the useful areas in future. Therefore, in this paper, the concept of Region Of Uninterest(ROU) is proposed as a area which may play a role in future. As practical applications of ROU, geographical maps and images are discussed.
感兴趣区域(ROI)在图像识别的研究领域有很多研究活动，用于医学治疗和运动视频分析。在图像处理的研究领域中，对感兴趣的区域(Region of interest, ROI)进行了大量的研究。为了避免感兴趣区域的假阴性，提取一个非感兴趣区域是很重要的。考虑到一个目前无趣的领域是未来有用的领域之一是很有意义的。因此，本文提出了无兴趣区(ROU)的概念，作为未来可能发挥作用的区域。作为ROU的实际应用，讨论了地理地图和图像。
{"title":"ROU (Region of Uninterest) and its Applications for Geographical Maps and Images","authors":"Kana Miyawaki, Hung-Hsuan Huang, K. Kawagoe","doi":"10.1109/IIAI-AAI.2014.167","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.167","url":null,"abstract":"There are many research activities on Region Of Interest (ROI) in the research fields of image recognition, used for medical treatments and sport video analysis. Many researches on an area of interest (Region Of Interest, ROI) have been conducted in the research area on image processings. It's important to extract a region which isn't an interest area in order to avoid the false negative of an area of interest. It is much meaningful to consider that an urrently uninteresting area is one of the useful areas in future. Therefore, in this paper, the concept of Region Of Uninterest(ROU) is proposed as a area which may play a role in future. As practical applications of ROU, geographical maps and images are discussed.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129355636","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}
We investigated the performance of different types of weighted citation networks to detect emerging research fronts by comparing existing studies and constructed citation networks and divided them into clusters. We also applied measures to such weighted citations as the differences in publication years between citing and cited papers and the similarities of their keywords to effectively detect emerging research fronts. However, the functions that decide the edge weight in the citation networks were decided based on experiments. For automatically deciding the effective weight's functions that depend on the dataset characteristics, a learning method is important. In this paper, we propose a novel learning method based on neural networks for deciding the edge weights for citation networks. We evaluated our proposed method in three research domains: gallium nitride, complex networks, and nano-carbon. We demonstrate that our proposed method has better performance of each approach than the existing methods by the following measures of extracted research fronts: visibility, speed, and topological and field relevance.
{"title":"Detecting Research Fronts Using Neural Network Model for Weighted Citation Network Analysis","authors":"Hisato Fujimagari, K. Fujita","doi":"10.2197/ipsjjip.23.753","DOIUrl":"https://doi.org/10.2197/ipsjjip.23.753","url":null,"abstract":"We investigated the performance of different types of weighted citation networks to detect emerging research fronts by comparing existing studies and constructed citation networks and divided them into clusters. We also applied measures to such weighted citations as the differences in publication years between citing and cited papers and the similarities of their keywords to effectively detect emerging research fronts. However, the functions that decide the edge weight in the citation networks were decided based on experiments. For automatically deciding the effective weight's functions that depend on the dataset characteristics, a learning method is important. In this paper, we propose a novel learning method based on neural networks for deciding the edge weights for citation networks. We evaluated our proposed method in three research domains: gallium nitride, complex networks, and nano-carbon. We demonstrate that our proposed method has better performance of each approach than the existing methods by the following measures of extracted research fronts: visibility, speed, and topological and field relevance.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330692","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.50
Yudai Kato, Shun Shiramatsu, Tadachika Ozono, T. Shintani
A keyword-based query is not sufficient for retrieving presentations. We assume that episodic memories about authoring slides and giving a presentation can be used for query because users easily recall and recognize slides associated with such memories. In this study, we present slide retrieval based on research episode networks that are a network composed of slides, episodic information and the links between them as Linked Data. The episodic information is information associated with authoring slides and giving a presentation. Slide retrieval based on research episode networks has ability to search for slides which full-text search does not. We designed and implemented a repository, Slide Repository, searching for and storing slides and supporting transformation of slides and presentations on web browsers. The experiment shows the effectiveness of slide retrieval based on research episode networks.
{"title":"Slide Repository: A Repository for Slide Reuse Using Research Episode Network","authors":"Yudai Kato, Shun Shiramatsu, Tadachika Ozono, T. Shintani","doi":"10.1109/IIAI-AAI.2014.50","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.50","url":null,"abstract":"A keyword-based query is not sufficient for retrieving presentations. We assume that episodic memories about authoring slides and giving a presentation can be used for query because users easily recall and recognize slides associated with such memories. In this study, we present slide retrieval based on research episode networks that are a network composed of slides, episodic information and the links between them as Linked Data. The episodic information is information associated with authoring slides and giving a presentation. Slide retrieval based on research episode networks has ability to search for slides which full-text search does not. We designed and implemented a repository, Slide Repository, searching for and storing slides and supporting transformation of slides and presentations on web browsers. The experiment shows the effectiveness of slide retrieval based on research episode networks.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"50 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124530471","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 propose a new Hardware Transactional Memory (HTM) system for a shared-memory multiprocessor in which elementary processors are connected by a single common bus. One of the key features of our system is a modified snoop cache protocol to reduce overheads on the transactional memory consistency control. By publishing all of modified data in a transaction at once when the transaction commits, our system avoids the overhead on the commit, which would arise from a sequential publication (or write-back to main memory) of each data item in the transaction otherwise. Another feature is a virtualization of a cache layer in the memory hierarchy. When a cache must replace a line which contains speculatively modified data, our system dynamically reallocates the address of the line to another location in main memory, and back up the evicted data to a lower layer cache or main memory. The backed-up data is still under the control of the transactional memory consistency through our snoop cache protocol. By enlarging a cache capacity virtually in this manner, our system can support unbounded transactions which are not limited by the hardware resources in the size and the duration.
{"title":"A Lazy-Updating Snoop Cache Protocol for Transactional Memory","authors":"Sekai Ichii, Atsushi Nunome, Hiroaki Hirata, Kiyoshi Shibayama","doi":"10.1109/IIAI-AAI.2014.134","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.134","url":null,"abstract":"In this paper, we propose a new Hardware Transactional Memory (HTM) system for a shared-memory multiprocessor in which elementary processors are connected by a single common bus. One of the key features of our system is a modified snoop cache protocol to reduce overheads on the transactional memory consistency control. By publishing all of modified data in a transaction at once when the transaction commits, our system avoids the overhead on the commit, which would arise from a sequential publication (or write-back to main memory) of each data item in the transaction otherwise. Another feature is a virtualization of a cache layer in the memory hierarchy. When a cache must replace a line which contains speculatively modified data, our system dynamically reallocates the address of the line to another location in main memory, and back up the evicted data to a lower layer cache or main memory. The backed-up data is still under the control of the transactional memory consistency through our snoop cache protocol. By enlarging a cache capacity virtually in this manner, our system can support unbounded transactions which are not limited by the hardware resources in the size and the duration.","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127725103","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}
Pub Date : 2014-12-01DOI: 10.1109/IIAI-AAI.2014.62
Chung-Hung Tsai, Dauw-Song Zhu, S. Wang, Lixia Jian
Under the considerations of trading costs and efficiency, more and more investors choose the way of online stock trading which is fast, convenient, and has preferential fee. The cost of establishing a new customer is five times more than maintaining an old one. As a result, to explore the investors choose continuous usage behavior of online security trading system as reference for security industry to promote and improve relevant business in the future. The model of this study is developed by combining DeLone and McLean's Information System Success Model (D&M IS Success Model) and Technology Acceptance Model (TAM). The variable of "Habit" was collected from "Focus Group" to develop research model. This research consists of 340 valid samples who using domestic opened and operative ones of security e-trade accounts. Then we apply "Structural Equation Modeling" to analyze the data and test hypothesis. Depending on the analysis of real evidences, this study have four conclusions: 1. In overall model, according to exogenous variables, "Habit" is the most effective to "Continuous Usage Behavior" of online stock trading, and followed by "System Quality". It reveals that "Habit" have greatly influence on "Continuous Usage Behavior". 2. In three quality contents, "System Quality" is the most important factor affecting "Continuous Usage Behavior", it is also the only significant factor affecting "Perceived usefulness" and "User Satisfaction", it shows "System Quality" is the major requirement of continued users. 4. We demonstrate that not only "User Satisfaction" positively affects "Using Intention" and further affects "Continuous Usage Behavior" in this study, but also the most important discovery is "Habit" positive affects "Using Intention" and further affects "Continuous Usage Behavior".
{"title":"A Study of Continuous Usage Behavior for Online Stock Trading - Domestic Brokers of Securities Industry as Examples","authors":"Chung-Hung Tsai, Dauw-Song Zhu, S. Wang, Lixia Jian","doi":"10.1109/IIAI-AAI.2014.62","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2014.62","url":null,"abstract":"Under the considerations of trading costs and efficiency, more and more investors choose the way of online stock trading which is fast, convenient, and has preferential fee. The cost of establishing a new customer is five times more than maintaining an old one. As a result, to explore the investors choose continuous usage behavior of online security trading system as reference for security industry to promote and improve relevant business in the future. The model of this study is developed by combining DeLone and McLean's Information System Success Model (D&M IS Success Model) and Technology Acceptance Model (TAM). The variable of \"Habit\" was collected from \"Focus Group\" to develop research model. This research consists of 340 valid samples who using domestic opened and operative ones of security e-trade accounts. Then we apply \"Structural Equation Modeling\" to analyze the data and test hypothesis. Depending on the analysis of real evidences, this study have four conclusions: 1. In overall model, according to exogenous variables, \"Habit\" is the most effective to \"Continuous Usage Behavior\" of online stock trading, and followed by \"System Quality\". It reveals that \"Habit\" have greatly influence on \"Continuous Usage Behavior\". 2. In three quality contents, \"System Quality\" is the most important factor affecting \"Continuous Usage Behavior\", it is also the only significant factor affecting \"Perceived usefulness\" and \"User Satisfaction\", it shows \"System Quality\" is the major requirement of continued users. 4. We demonstrate that not only \"User Satisfaction\" positively affects \"Using Intention\" and further affects \"Continuous Usage Behavior\" in this study, but also the most important discovery is \"Habit\" positive affects \"Using Intention\" and further affects \"Continuous Usage Behavior\".","PeriodicalId":432222,"journal":{"name":"2014 IIAI 3rd International Conference on Advanced Applied Informatics","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133716676","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
扫码关注我们
求助内容：
应助结果提醒方式：