Chung-Hung Tsai, Dauw-Song Zhu, Yu-Li Lan, Ding-Long Li
The Depot-Logistic Information Management System (DLIMS) is aimed to provide the Air Force logistics staff of all sectors with an information technology platform for convenience of management, supervision, aircraft maintenance, along with supply operations. The DLIMS in Taiwan has been established for more than 10 years. However, it has not been evaluated for its effectiveness. This study integrates service quality into Wixom and Todd (2005) model to evaluate the effectiveness of the DLIMS. A survey of 273 users of DLIMS was conducted to validate the proposed model. The research results show that the overall goodness-of-fit indices indicate a reasonable fit of the model and data. This study emphasizes the importance of integration of satisfaction theory and technology acceptance theory to comprehensively illustrate the effectiveness of DLIMS. The integrative viewpoint implies that DLIMS is not only a logistic information system but also a service provider to the Air Force. Accordingly, the professional staff officers IS department, logistics sectors and headquarters should value simultaneously object-based functions and service quality, in order to improve users' satisfaction, which in turn can promote users' behavioral beliefs and usage intention. The findings can be a reference for the Air Force logistics sectors to make policies as well as be a basis for evaluation of success and acceptance of military-related information system.
{"title":"A Study on the Using Behavior of Depot-Logistic Information System in Taiwan: An Integration of Satisfaction Theory and Technology Acceptance Theory","authors":"Chung-Hung Tsai, Dauw-Song Zhu, Yu-Li Lan, Ding-Long Li","doi":"10.4304/jmm.8.2.106-112","DOIUrl":"https://doi.org/10.4304/jmm.8.2.106-112","url":null,"abstract":"The Depot-Logistic Information Management System (DLIMS) is aimed to provide the Air Force logistics staff of all sectors with an information technology platform for convenience of management, supervision, aircraft maintenance, along with supply operations. The DLIMS in Taiwan has been established for more than 10 years. However, it has not been evaluated for its effectiveness. This study integrates service quality into Wixom and Todd (2005) model to evaluate the effectiveness of the DLIMS. A survey of 273 users of DLIMS was conducted to validate the proposed model. The research results show that the overall goodness-of-fit indices indicate a reasonable fit of the model and data. This study emphasizes the importance of integration of satisfaction theory and technology acceptance theory to comprehensively illustrate the effectiveness of DLIMS. The integrative viewpoint implies that DLIMS is not only a logistic information system but also a service provider to the Air Force. Accordingly, the professional staff officers IS department, logistics sectors and headquarters should value simultaneously object-based functions and service quality, in order to improve users' satisfaction, which in turn can promote users' behavioral beliefs and usage intention. The findings can be a reference for the Air Force logistics sectors to make policies as well as be a basis for evaluation of success and acceptance of military-related information system.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134021370","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 a novel of multi-resolution analysis tool, the modified sharp frequency localized contour let transforms (MSFLCT) provides flexible multiresolution, anisotropy, and directional expansion for medical images. In this paper, we proposed a new fusion rule for multimodal medical images based on MSFLCT. The multimodal medical images are decomposed by MSFLCT. For the high-pass sub band, the weighted sum modified laplacian (WSML) method is used for choose the high frequency coefficients. For the low pass sub band, the maximum local energy (MLE) method is combined with "region" idea for low frequency coefficient selection. The final fusion image is obtained by applying inverse MSFLCT to fused low pass and high pass sub bands. Abundant experiments have been made on groups of multimodality datasets, both human visual and quantitative analysis show that the new strategy for attaining image fusion with satisfactory performance.
{"title":"Multimodal Medical Image Fusion in Modified Sharp Frequency Localized Contourlet Domain","authors":"S. Serikawa, Huimin Lu, Yujie Li, Lifeng Zhang","doi":"10.1109/SNPD.2012.17","DOIUrl":"https://doi.org/10.1109/SNPD.2012.17","url":null,"abstract":"As a novel of multi-resolution analysis tool, the modified sharp frequency localized contour let transforms (MSFLCT) provides flexible multiresolution, anisotropy, and directional expansion for medical images. In this paper, we proposed a new fusion rule for multimodal medical images based on MSFLCT. The multimodal medical images are decomposed by MSFLCT. For the high-pass sub band, the weighted sum modified laplacian (WSML) method is used for choose the high frequency coefficients. For the low pass sub band, the maximum local energy (MLE) method is combined with \"region\" idea for low frequency coefficient selection. The final fusion image is obtained by applying inverse MSFLCT to fused low pass and high pass sub bands. Abundant experiments have been made on groups of multimodality datasets, both human visual and quantitative analysis show that the new strategy for attaining image fusion with satisfactory performance.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133382072","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}
Weizhi Xu, Hao Zhang, Shuai Jiao, Da Wang, Fenglong Song, Zhiyong Liu
It is an important task to tune performance for sparse matrix vector multiplication (SpMV), but it is also a difficult task because of its irregularity. In this paper, we propose a cache blocking method to improve the performance of SpMV on the emerging GPU architecture. The sparse matrix is partitioned into many sub-blocks, which are stored in CSR format. With the blocking method, the corresponding part of vector x can be reused in the GPU cache, so the time spent on accessing the global memory for vector x is reduced heavily. Experimental results on GeForce GTX 480 show that SpMV kernel with the cache blocking method is 5x faster than the unblocked CSR kernel in the best case.
{"title":"Optimizing Sparse Matrix Vector Multiplication Using Cache Blocking Method on Fermi GPU","authors":"Weizhi Xu, Hao Zhang, Shuai Jiao, Da Wang, Fenglong Song, Zhiyong Liu","doi":"10.1109/SNPD.2012.20","DOIUrl":"https://doi.org/10.1109/SNPD.2012.20","url":null,"abstract":"It is an important task to tune performance for sparse matrix vector multiplication (SpMV), but it is also a difficult task because of its irregularity. In this paper, we propose a cache blocking method to improve the performance of SpMV on the emerging GPU architecture. The sparse matrix is partitioned into many sub-blocks, which are stored in CSR format. With the blocking method, the corresponding part of vector x can be reused in the GPU cache, so the time spent on accessing the global memory for vector x is reduced heavily. Experimental results on GeForce GTX 480 show that SpMV kernel with the cache blocking method is 5x faster than the unblocked CSR kernel in the best case.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127653343","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 describe a novel image-based person identification task. Traditional face-based person identification methods have a low tolerance for occluded situation, such as overlapping of people in an image. We focus on an image from an overhead camera. Using the overhead camera reduces a restriction of the installation location of a camera and solves the problem of occluded images. In addition, we utilize depth information for the identification task. We apply four features to the identification method, (1) estimated body height, (2) estimated body dimensions, (3) estimated body size and (4) depth histogram. Experimental result shows the effectiveness of our method.
{"title":"Person Identification Using Top-View Image with Depth Information","authors":"Daichi Kouno, Kazutaka Shimada, Tsutomu Endo","doi":"10.4018/ijsi.2013040106","DOIUrl":"https://doi.org/10.4018/ijsi.2013040106","url":null,"abstract":"In this paper, we describe a novel image-based person identification task. Traditional face-based person identification methods have a low tolerance for occluded situation, such as overlapping of people in an image. We focus on an image from an overhead camera. Using the overhead camera reduces a restriction of the installation location of a camera and solves the problem of occluded images. In addition, we utilize depth information for the identification task. We apply four features to the identification method, (1) estimated body height, (2) estimated body dimensions, (3) estimated body size and (4) depth histogram. Experimental result shows the effectiveness of our method.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128827954","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}
With the development of WSN applications, there is increasing concern for the research of WSN. The routing algorithm is one of the important supporting technologies of WSN. However, the current studies of routing algorithms focus on the single performance. For instance, the aim of Energy Multipath Routing Algorithm is to maximize the network life cycle. And the aim of the Minimal-hop routing algorithm is to minimize the network transmission delay. This paper synthesizes the three performance indicators, namely network life cycle, network latency and network reliability to propose a Self-adaptive Routing Algorithm (SARA). SARA could satisfy different network requirements by adjusting the parameters. The experimental result shows that SARA can reduce the network latency, extend the network lifecycle and enhance the network reliability compared with the Multi-path energy efficient algorithm.
{"title":"SARA: A Self-Adaptive Routing Algorithm in Wireless Sensor Network","authors":"Yi Zhang, Zhiyi Fang, Hongyu Sun, Lin Chen","doi":"10.1109/SNPD.2012.132","DOIUrl":"https://doi.org/10.1109/SNPD.2012.132","url":null,"abstract":"With the development of WSN applications, there is increasing concern for the research of WSN. The routing algorithm is one of the important supporting technologies of WSN. However, the current studies of routing algorithms focus on the single performance. For instance, the aim of Energy Multipath Routing Algorithm is to maximize the network life cycle. And the aim of the Minimal-hop routing algorithm is to minimize the network transmission delay. This paper synthesizes the three performance indicators, namely network life cycle, network latency and network reliability to propose a Self-adaptive Routing Algorithm (SARA). SARA could satisfy different network requirements by adjusting the parameters. The experimental result shows that SARA can reduce the network latency, extend the network lifecycle and enhance the network reliability compared with the Multi-path energy efficient algorithm.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121722244","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}
Radoslaw Krzywania, L. Dolata, P. Krawiec, Waldemar Latoszek, A. Szymanski, J. Wszolek
In this paper we present the PL-LAB, which is a Polish nationwide network test bed involving several research and academia institutions. PL-LAB was designed to facilitate research in the area of Future Internet carried out within the Future Internet Engineering (FIE) project. It allows researchers to create virtual laboratories, with guaranteed resources and direct physical access to laboratory equipment. This way, PL-LAB enables running, among others, experiments that deal with virtualization, which is the base concept for the FIE proposal of Future Internet architecture.
{"title":"PL-LAB: Polish Future Internet Distributed Laboratory","authors":"Radoslaw Krzywania, L. Dolata, P. Krawiec, Waldemar Latoszek, A. Szymanski, J. Wszolek","doi":"10.1109/SNPD.2012.73","DOIUrl":"https://doi.org/10.1109/SNPD.2012.73","url":null,"abstract":"In this paper we present the PL-LAB, which is a Polish nationwide network test bed involving several research and academia institutions. PL-LAB was designed to facilitate research in the area of Future Internet carried out within the Future Internet Engineering (FIE) project. It allows researchers to create virtual laboratories, with guaranteed resources and direct physical access to laboratory equipment. This way, PL-LAB enables running, among others, experiments that deal with virtualization, which is the base concept for the FIE proposal of Future Internet architecture.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156448","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 present a scalable implementation of a topic modeling (Adaptive Link-IPLSA) based method for online event analysis, which summarize the gist of massive amount of changing tweets and enable users to explore the temporal trends in topics. This model also can simultaneously maintain the continuity of the latent semantics to better capture the time line development of events. With the help of this model, users can quickly grasp major topics in these twitters. The preliminary results show that our method leads to more balanced and comprehensive improvement for online event detection compared to benchmark approaches. Additionally our algorithm is computationally feasible in near real-time scenarios making it an attractive alternative for capturing the rapidly changing dynamics of microblogs.
{"title":"A Novel Online Event Analysis Framework for Micro-blog Based on Incremental Topic Modeling","authors":"Huifang Ma, Bo Wang, Ning Li","doi":"10.1109/SNPD.2012.48","DOIUrl":"https://doi.org/10.1109/SNPD.2012.48","url":null,"abstract":"In this paper, we present a scalable implementation of a topic modeling (Adaptive Link-IPLSA) based method for online event analysis, which summarize the gist of massive amount of changing tweets and enable users to explore the temporal trends in topics. This model also can simultaneously maintain the continuity of the latent semantics to better capture the time line development of events. With the help of this model, users can quickly grasp major topics in these twitters. The preliminary results show that our method leads to more balanced and comprehensive improvement for online event detection compared to benchmark approaches. Additionally our algorithm is computationally feasible in near real-time scenarios making it an attractive alternative for capturing the rapidly changing dynamics of microblogs.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131855806","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}
With an increase in the services on the Internet, importance for software security technologies has been recognized. A number of research and development programs regarding software security have been carried out thus far. However, it is not clear how these technologies can be combined in order to utilize them effectively. This paper proposes a conceptual model for a body of knowledge regarding software security. In addition, this paper introduces an overview of technologies developed for different pieces of knowledge and the current status of research that has clarified the relationships between these pieces of knowledge. Finally, the author discusses the future direction of this field.
{"title":"Survey on Body of Knowledge Regarding Software Security","authors":"A. Hazeyama","doi":"10.1109/SNPD.2012.64","DOIUrl":"https://doi.org/10.1109/SNPD.2012.64","url":null,"abstract":"With an increase in the services on the Internet, importance for software security technologies has been recognized. A number of research and development programs regarding software security have been carried out thus far. However, it is not clear how these technologies can be combined in order to utilize them effectively. This paper proposes a conceptual model for a body of knowledge regarding software security. In addition, this paper introduces an overview of technologies developed for different pieces of knowledge and the current status of research that has clarified the relationships between these pieces of knowledge. Finally, the author discusses the future direction of this field.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130530487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This purpose of the study is to develop the usage intention model of Telecare systems. Based on the Technology Acceptance Model, the proposed framework is validated with 365 respondents from Nantou County located in Taiwan, which shows that both perceived ease of use, and perceived usefulness are key factors affecting the intention to use telecare system. According to the statistical results, the proposed model fits very well for the samples. In other words, perceived ease of use, and perceived usefulness will affect simultaneously behavioral intention in telecare system. This study emphasizes that the managers of hospitals and designers of telecare system companies should pay more attention to understanding the perceptions of elderly (or patients) and improving the system and information quality of the system. Therefore, successful telecare systems not only provide robust system quality of information systems, but also delivery reliable information quality of health cares.
{"title":"Applying the Technology Acceptance Model to Explore Intention to Use Telecare System in Taiwan","authors":"Su-Pi Su, Chung-Hung Tsai, Yi-Kang Chen","doi":"10.1109/SNPD.2012.113","DOIUrl":"https://doi.org/10.1109/SNPD.2012.113","url":null,"abstract":"This purpose of the study is to develop the usage intention model of Telecare systems. Based on the Technology Acceptance Model, the proposed framework is validated with 365 respondents from Nantou County located in Taiwan, which shows that both perceived ease of use, and perceived usefulness are key factors affecting the intention to use telecare system. According to the statistical results, the proposed model fits very well for the samples. In other words, perceived ease of use, and perceived usefulness will affect simultaneously behavioral intention in telecare system. This study emphasizes that the managers of hospitals and designers of telecare system companies should pay more attention to understanding the perceptions of elderly (or patients) and improving the system and information quality of the system. Therefore, successful telecare systems not only provide robust system quality of information systems, but also delivery reliable information quality of health cares.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114988087","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. Beben, Piotr Wisniewski, P. Krawiec, M. Nowak, P. Pecka, J. M. Batalla, P. Bialon, P. Olender, Jakub Gutkowski, B. Belter, Lukasz Lopatowski
This paper presents the Content Aware Network designed as one of the Parallel Internets developed on Virtual Infrastructure. The CAN is a post-IP network designed to facilitate access to multimedia content in large scale environment. We introduce the proposed CAN network architecture and discuss mechanisms and algorithms required to assure ubiquitous content access and efficient content delivery. In particular, we propose new content naming and resolution schemes, an effective content source selection algorithm, which optimize resource utilization and the flexible content delivery method. Moreover, we present developed prototype and numerical results illustrating effectiveness of proposed CAN delivery method.
{"title":"Content Aware Network Based on Virtual Infrastructure","authors":"A. Beben, Piotr Wisniewski, P. Krawiec, M. Nowak, P. Pecka, J. M. Batalla, P. Bialon, P. Olender, Jakub Gutkowski, B. Belter, Lukasz Lopatowski","doi":"10.1109/SNPD.2012.68","DOIUrl":"https://doi.org/10.1109/SNPD.2012.68","url":null,"abstract":"This paper presents the Content Aware Network designed as one of the Parallel Internets developed on Virtual Infrastructure. The CAN is a post-IP network designed to facilitate access to multimedia content in large scale environment. We introduce the proposed CAN network architecture and discuss mechanisms and algorithms required to assure ubiquitous content access and efficient content delivery. In particular, we propose new content naming and resolution schemes, an effective content source selection algorithm, which optimize resource utilization and the flexible content delivery method. Moreover, we present developed prototype and numerical results illustrating effectiveness of proposed CAN delivery method.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125437495","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
扫码关注我们
求助内容：
应助结果提醒方式：