This paper proposes a heuristic algorithm for scheduling multiple channels and multiple timeslots in a time-constrained industrial wireless sensor network. The objective is to minimize the end-to-end (e2e) delay. The proposed algorithm is compared with the meta-heuristics in terms of the given e2e delay bound, where it is common in time-constrained industrial networks. Not surprisingly, the meta-heuristics is more accurate in finding a global optimum or sub-optimal values than the heuristic approach at the expense of significant run times and programming effort. The proposed greedy heuristic approach has advantages such as reflection of design context in decision-making and fast communication between stakeholders.
{"title":"Heuristic Algorithms for Scheduling Resources in Time-Constrained Wireless Sensor Networks","authors":"Y. Kim, Yu Wang, B. Park, H. Choi","doi":"10.1109/PLATCON.2015.16","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.16","url":null,"abstract":"This paper proposes a heuristic algorithm for scheduling multiple channels and multiple timeslots in a time-constrained industrial wireless sensor network. The objective is to minimize the end-to-end (e2e) delay. The proposed algorithm is compared with the meta-heuristics in terms of the given e2e delay bound, where it is common in time-constrained industrial networks. Not surprisingly, the meta-heuristics is more accurate in finding a global optimum or sub-optimal values than the heuristic approach at the expense of significant run times and programming effort. The proposed greedy heuristic approach has advantages such as reflection of design context in decision-making and fast communication between stakeholders.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129747052","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 paper presents a novel rehabilitation approach for guiding patients with stroke to execute correct rehabilitation exercise. First of all, a therapist will hold a patient's hand to practice a correct rehabilitation exercise to build a template for the assigned excercise. The recorded template will be a sequence of sensed data acquired from the inertial measurement units (IMUs) attached on the arm of the patient. Then the patient will practice the assigned exercise alone to generate the testing sequence with a screen. Finally, a dynamic time warping (DTW) algorithm will adopted to measure the similarity between the template and the testing sequence. The rehabilitation system will issue an alarm signal whenever the similarity value is below a pre-specified threshold.
{"title":"A Novel Rehabilitation Approach Based on Inertial Sensor Units","authors":"Huang-Ren Chen, Chi-lun Rau, Chung-Huang Yu","doi":"10.1109/PLATCON.2015.24","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.24","url":null,"abstract":"This paper presents a novel rehabilitation approach for guiding patients with stroke to execute correct rehabilitation exercise. First of all, a therapist will hold a patient's hand to practice a correct rehabilitation exercise to build a template for the assigned excercise. The recorded template will be a sequence of sensed data acquired from the inertial measurement units (IMUs) attached on the arm of the patient. Then the patient will practice the assigned exercise alone to generate the testing sequence with a screen. Finally, a dynamic time warping (DTW) algorithm will adopted to measure the similarity between the template and the testing sequence. The rehabilitation system will issue an alarm signal whenever the similarity value is below a pre-specified threshold.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115981457","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}
Due to recent arise of cybercrime, importance of cyber security is highlighted more than ever. NIST has created Cryptographic Module Validation Program, namely CMVP, to validate security level of cryptographic modules for the United States Federal agencies: indeed, many are achieving the validation. According to the program, operating environments for any specific cryptographic module are fixed. In other words, running validated module in other software environment is strictly prohibited. However, this paper asserts that it is possible for a C based module to operate in Java environment without loss of validation as long as the module is running on a verified environment. We expect this paper to help saving great amount of time and costs for developing another cryptographic module for the same operating purpose.
{"title":"Application of C Based Cryptographic Module Operating in Java with Preservation of FIPS 140 Validation","authors":"Hyunduk Choi, Okyeon Yi","doi":"10.1109/PLATCON.2015.31","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.31","url":null,"abstract":"Due to recent arise of cybercrime, importance of cyber security is highlighted more than ever. NIST has created Cryptographic Module Validation Program, namely CMVP, to validate security level of cryptographic modules for the United States Federal agencies: indeed, many are achieving the validation. According to the program, operating environments for any specific cryptographic module are fixed. In other words, running validated module in other software environment is strictly prohibited. However, this paper asserts that it is possible for a C based module to operate in Java environment without loss of validation as long as the module is running on a verified environment. We expect this paper to help saving great amount of time and costs for developing another cryptographic module for the same operating purpose.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115902587","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}
Chao Chen, Wen Ji, Bo-Wei Chen, Seungmin Rho, Yiqiang Chen
Video quality assessment plays an essential role in multimedia systems and services. In the case of scalable video coding, which enables dynamic adaptation based on terminal capabilities and heterogeneous network, variable resolution is one of the most prominent types of video distortions. In this paper, we propose a new spatial distortion metric for evaluating video streaming quality with variable spatial resolution. The key idea is to project video sequence into feature domain and calculate the distortion of content information from the projected principal component matrix and its eigenvectors. This metric can measures the degree of content information degradation especially in spatial resolution scalable video. The performance of the proposed metric is evaluated and compared to some state-of-the-art quality evaluation metrics in the literature. Our results show that the proposed metric achieves good correlations with the subjective evaluations of the EPFL scale video database.
{"title":"New Method for Spatial Scalable Video Quality Evaluation","authors":"Chao Chen, Wen Ji, Bo-Wei Chen, Seungmin Rho, Yiqiang Chen","doi":"10.1109/PLATCON.2015.11","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.11","url":null,"abstract":"Video quality assessment plays an essential role in multimedia systems and services. In the case of scalable video coding, which enables dynamic adaptation based on terminal capabilities and heterogeneous network, variable resolution is one of the most prominent types of video distortions. In this paper, we propose a new spatial distortion metric for evaluating video streaming quality with variable spatial resolution. The key idea is to project video sequence into feature domain and calculate the distortion of content information from the projected principal component matrix and its eigenvectors. This metric can measures the degree of content information degradation especially in spatial resolution scalable video. The performance of the proposed metric is evaluated and compared to some state-of-the-art quality evaluation metrics in the literature. Our results show that the proposed metric achieves good correlations with the subjective evaluations of the EPFL scale video database.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525553","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 aim of this research is to find out effective factors that can help model customer loyalty in smartphone market in China. This study fills in the current gap with solid understanding of customer loyalty and satisfaction in depth. Online survey was applied for data collection and more than 300 participants got involved in the fieldwork. Twelve hypotheses were proposed and tackled by 26 survey questions. SPSS was employed for data analysis including model build and hypotheses tests. Learnt from the data analysis, satisfaction is the most critical factor that determines the customer loyalty in smartphone market in China. Furthermore, quality, P/P ratio and image are positively related to customer satisfaction. Finally, switching costs and store image are tested to exhibit a significant positive influence on repurchase intention.
{"title":"Modelling Customer Loyalty in China's Smartphone Market Using Effective Factors","authors":"Y. Sun, Yao Li, W. Chong, K. L. Man","doi":"10.1109/PLATCON.2015.30","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.30","url":null,"abstract":"The aim of this research is to find out effective factors that can help model customer loyalty in smartphone market in China. This study fills in the current gap with solid understanding of customer loyalty and satisfaction in depth. Online survey was applied for data collection and more than 300 participants got involved in the fieldwork. Twelve hypotheses were proposed and tackled by 26 survey questions. SPSS was employed for data analysis including model build and hypotheses tests. Learnt from the data analysis, satisfaction is the most critical factor that determines the customer loyalty in smartphone market in China. Furthermore, quality, P/P ratio and image are positively related to customer satisfaction. Finally, switching costs and store image are tested to exhibit a significant positive influence on repurchase intention.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126950346","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}
Youngeun An, Guk-Jeong Kim, Sangeon Oh, Minhyuk Chang, Jongan Park
This study proposed a new image retrieval algorithm in which the existing Radon transform which was used for shape retrieval is reinforced with noise invariance. For this, a Radon transform was performed on an inquiry image which had been preprocessed to extract vector values and then the vector values were arranged depending on size to extract a second feature vector. After clustering and normalizing the levels of vector values based on the second feature vector, the feature vector was created. For a simulation on the noise robustness of the image retrieval system proposed, diverse images were used in this experiment. For performance analysis, the system proposed was compared with the retrieval system using the general Radon transform. As a result, the image retrieval system with noise robustness was between two and three times more robust to geometric transforms such as turning, expansion and scaling-down presented in the retrieval system using the general Radon transform.
{"title":"Rearranged Radon Transform Based Noise Robustness Image Retrieval","authors":"Youngeun An, Guk-Jeong Kim, Sangeon Oh, Minhyuk Chang, Jongan Park","doi":"10.1109/PLATCON.2015.15","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.15","url":null,"abstract":"This study proposed a new image retrieval algorithm in which the existing Radon transform which was used for shape retrieval is reinforced with noise invariance. For this, a Radon transform was performed on an inquiry image which had been preprocessed to extract vector values and then the vector values were arranged depending on size to extract a second feature vector. After clustering and normalizing the levels of vector values based on the second feature vector, the feature vector was created. For a simulation on the noise robustness of the image retrieval system proposed, diverse images were used in this experiment. For performance analysis, the system proposed was compared with the retrieval system using the general Radon transform. As a result, the image retrieval system with noise robustness was between two and three times more robust to geometric transforms such as turning, expansion and scaling-down presented in the retrieval system using the general Radon transform.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121789899","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}
Akihiro Hata, K. Araki, S. Kusakabe, Y. Omori, Hsin-hung Lin
Formal methods have been used in the development of the reliable software system. However, one of the issues in using formal methods is how to model the system by considering what kind of system requirements and restrictions we should describe. In order to address this issue, we use a hazard model STAMP and an analytical method STPA based on STAMP. STAMP/STPA is proposed to overcome difficulties in approving conventional hazard analysis techniques for software-centric systems. In this report, we explain our approach and discuss our case study to develop implicit specifications for the cloud service in a model-oriented formal specification language, VDM++.
{"title":"Using Hazard Analysis STAMP/STPA in Developing Model-Oriented Formal Specification toward Reliable Cloud Service","authors":"Akihiro Hata, K. Araki, S. Kusakabe, Y. Omori, Hsin-hung Lin","doi":"10.1109/PLATCON.2015.14","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.14","url":null,"abstract":"Formal methods have been used in the development of the reliable software system. However, one of the issues in using formal methods is how to model the system by considering what kind of system requirements and restrictions we should describe. In order to address this issue, we use a hazard model STAMP and an analytical method STPA based on STAMP. STAMP/STPA is proposed to overcome difficulties in approving conventional hazard analysis techniques for software-centric systems. In this report, we explain our approach and discuss our case study to develop implicit specifications for the cloud service in a model-oriented formal specification language, VDM++.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134470508","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}
Video summarization is a procedure to reduce redundancy and generate concise representation of the video data. Extracting affective key frames from video sequences is an enthusiastic approach amongst video summarization schemes. Affective key frames refer to the intensity and type of feelings that are contained in video and expected to arise in spectators mind. Recent summarization schemes consider audio and visual information. However, these data modalities are not sufficient to accurately perceive human attention, failing to extract semantically relevant content. Video content incites strong neural responses in users, which can be measured by analyzing electroencephalography (EEG) brain signals. Merging EEG and multimedia analysis can serve as a bridge, linking the digital representation of multimedia and user perception. In this context, we propose an affective video content extraction scheme that integrates human neuronal signals with audio-visual features for better perception and comprehension of digital videos. Experimental results shown that the propose model can accurately reflect user preferences, and facilitate extraction of highly affective and personalized summaries.
{"title":"Audio-Visual and EEG-Based Attention Modeling for Extraction of Affective Video Content","authors":"I. Mehmood, M. Sajjad, S. Baik, Seungmin Rho","doi":"10.1109/PLATCON.2015.13","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.13","url":null,"abstract":"Video summarization is a procedure to reduce redundancy and generate concise representation of the video data. Extracting affective key frames from video sequences is an enthusiastic approach amongst video summarization schemes. Affective key frames refer to the intensity and type of feelings that are contained in video and expected to arise in spectators mind. Recent summarization schemes consider audio and visual information. However, these data modalities are not sufficient to accurately perceive human attention, failing to extract semantically relevant content. Video content incites strong neural responses in users, which can be measured by analyzing electroencephalography (EEG) brain signals. Merging EEG and multimedia analysis can serve as a bridge, linking the digital representation of multimedia and user perception. In this context, we propose an affective video content extraction scheme that integrates human neuronal signals with audio-visual features for better perception and comprehension of digital videos. Experimental results shown that the propose model can accurately reflect user preferences, and facilitate extraction of highly affective and personalized summaries.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126901538","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 paper performs an investigation of Radio Frequency Identification (RFID) antenna design for wearable systems. A microwave wideband dual rectangular ring antenna is selected for the further consideration. The basic concepts and structure of wearable systems and RFID antennas are discussed first, followed by an introduction to the basic structure and design parameters of a dual rectangular ring antenna. Lastly, the tri-rectangular ring antenna is introduced. Through optimization, the operating frequency band of the antenna is successfully increased.
{"title":"Rectangular Ring Antenna for Wearable System","authors":"E. Lim, Zhao Wang, Zhouhao Wu, M. Leach, K. Man","doi":"10.1109/PLATCON.2015.27","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.27","url":null,"abstract":"This paper performs an investigation of Radio Frequency Identification (RFID) antenna design for wearable systems. A microwave wideband dual rectangular ring antenna is selected for the further consideration. The basic concepts and structure of wearable systems and RFID antennas are discussed first, followed by an introduction to the basic structure and design parameters of a dual rectangular ring antenna. Lastly, the tri-rectangular ring antenna is introduced. Through optimization, the operating frequency band of the antenna is successfully increased.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115288071","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}
Sang-Min Choi, Da-Jung Cho, Yo-Sub Han, K. L. Man, Y. Sun
Recently, many internet users are not only information consumers but also information providers. There is lots of information on the Web and most people can search information what they want through the Web. One problem of the large number of data in the Web is that we often spend most of our time to find a correct result from search results. Thus, people start looking for a better system that can suggest relevant information instead of letting users go through all search results: We call such systems recommendation systems. Conventional recommendation systems are based on collaborative filtering (CF) approaches. The CF approaches have two problems: sparsity and cold-start. Some researchers have studied to alleviate the problems in CF approaches. One of them is the recommendation algorithm based on category correlations. In this study, researchers utilize genre information in movie domain as category. They have drawn genre correlations using genre counting method. This approach can alleviate the user-side cold-start problems, however, there exists one problem that extensions of the approach are less likely. If a domain has singular category, then we cannot apply previous approaches. It means that we cannot draw category correlations. Because of this reason, we propose a novel approach that can draw category correlations for not only multiple categories but also singular one. We utilize word similarities provided by WordNet.
{"title":"Recommender Systems Using Category Correlations Based on WordNet Similarity","authors":"Sang-Min Choi, Da-Jung Cho, Yo-Sub Han, K. L. Man, Y. Sun","doi":"10.1109/PLATCON.2015.26","DOIUrl":"https://doi.org/10.1109/PLATCON.2015.26","url":null,"abstract":"Recently, many internet users are not only information consumers but also information providers. There is lots of information on the Web and most people can search information what they want through the Web. One problem of the large number of data in the Web is that we often spend most of our time to find a correct result from search results. Thus, people start looking for a better system that can suggest relevant information instead of letting users go through all search results: We call such systems recommendation systems. Conventional recommendation systems are based on collaborative filtering (CF) approaches. The CF approaches have two problems: sparsity and cold-start. Some researchers have studied to alleviate the problems in CF approaches. One of them is the recommendation algorithm based on category correlations. In this study, researchers utilize genre information in movie domain as category. They have drawn genre correlations using genre counting method. This approach can alleviate the user-side cold-start problems, however, there exists one problem that extensions of the approach are less likely. If a domain has singular category, then we cannot apply previous approaches. It means that we cannot draw category correlations. Because of this reason, we propose a novel approach that can draw category correlations for not only multiple categories but also singular one. We utilize word similarities provided by WordNet.","PeriodicalId":220038,"journal":{"name":"2015 International Conference on Platform Technology and Service","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124878005","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
扫码关注我们
求助内容：
应助结果提醒方式：