Pub Date : 2013-07-10DOI: 10.1109/IISA.2013.6623687
Loukia Karanikola, Isambo Karali, S. McClean
The Semantic Web vision introduces the concept of machine-oriented web information. This information is characterized by the notions of uncertainty and vagueness. Towards this notions, an ontology model for representing uncertain or vague information, as well as an inference method for reasoning about this kind of information is necessary. Our approach faces the aforementioned issues, i.e. the imperfect ontology model and the reasoning approach. In order to show how our method performs, an implementation is outlined.
{"title":"Uncertainty reasoning for the Semantic Web based on Dempster-Shafer model","authors":"Loukia Karanikola, Isambo Karali, S. McClean","doi":"10.1109/IISA.2013.6623687","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623687","url":null,"abstract":"The Semantic Web vision introduces the concept of machine-oriented web information. This information is characterized by the notions of uncertainty and vagueness. Towards this notions, an ontology model for representing uncertain or vague information, as well as an inference method for reasoning about this kind of information is necessary. Our approach faces the aforementioned issues, i.e. the imperfect ontology model and the reasoning approach. In order to show how our method performs, an implementation is outlined.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114466805","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623686
C. Patsakis, A. Solanas
Business models based on offering free services to people in exchange for their data are gaining importance and prevalence. The most prominent examples are social networks and, more recently, mobile social networks. However, this trend is endangering users' privacy. We do not discuss the ethical and legal issues derived from this business model. Notwithstanding, we believe that users might have better and more privacy-aware alternatives enabling them to trade their privacy on their own. Thus, we introduce the concept of “Privacy as a Product” (PaaP) and we propose and describe a framework and a protocol based on the Raykova-Vo-Bellovin-Malkin protocol that enables users to share private data without the need for trusting the infrastructure (e.g. a social network). We show that our proposal is feasible in terms of computational and storage overhead. Hence, our solution opens the door to the new concept of “Privacy as a Product” and could be the foundation for implementations of privacy-aware social networks in which privacy plays a more central role, like in the healthcare sector.
{"title":"Privacy as a Product: A case study in the m-Health sector","authors":"C. Patsakis, A. Solanas","doi":"10.1109/IISA.2013.6623686","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623686","url":null,"abstract":"Business models based on offering free services to people in exchange for their data are gaining importance and prevalence. The most prominent examples are social networks and, more recently, mobile social networks. However, this trend is endangering users' privacy. We do not discuss the ethical and legal issues derived from this business model. Notwithstanding, we believe that users might have better and more privacy-aware alternatives enabling them to trade their privacy on their own. Thus, we introduce the concept of “Privacy as a Product” (PaaP) and we propose and describe a framework and a protocol based on the Raykova-Vo-Bellovin-Malkin protocol that enables users to share private data without the need for trusting the infrastructure (e.g. a social network). We show that our proposal is feasible in terms of computational and storage overhead. Hence, our solution opens the door to the new concept of “Privacy as a Product” and could be the foundation for implementations of privacy-aware social networks in which privacy plays a more central role, like in the healthcare sector.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117288776","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623679
Jeanelle E. Abanto, Charmailene C. Reyes, J. Malinao, H. Adorna
In this study, we used AutoRegressive Integrated Moving Average (ARIMA) to effectively represent expected normal traffic behavior of those weeks identified to be abnormal in the previous literature. Using the 2006 North Luzon Expressway North Bound (NLEX NB) Balintawak (Blk) segment's hourly traffic volume and time mean speed data sets provided by the National Center for Transportation Studies (NCTS), we processed the data to generate time series plots of the weekly densities, the normal range of traffic density, and the abnormal. We obtained these through Quantum Frequency Algorithm (QFA). We fit the ARIMA model to some weeks of Blk which have evident occurrences of incidents as detected and crosschecked with the incidents data provided by NCTS. We performed a forecast of the fit and generated a time series plot of the superimposed plots of the actual data and the forecast for each of the top incidents generated in the previous literature. These plots provided a simplistic time-domain 2D visualizations that successfully exposed the abnormal points where incidents happened. These also provided an estimate of the expected traffic density behavior if incidents did not happen.
{"title":"Traffic incident detection and modelling using Quantum Frequency Algorithm and AutoRegressive Integrated Moving Average models","authors":"Jeanelle E. Abanto, Charmailene C. Reyes, J. Malinao, H. Adorna","doi":"10.1109/IISA.2013.6623679","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623679","url":null,"abstract":"In this study, we used AutoRegressive Integrated Moving Average (ARIMA) to effectively represent expected normal traffic behavior of those weeks identified to be abnormal in the previous literature. Using the 2006 North Luzon Expressway North Bound (NLEX NB) Balintawak (Blk) segment's hourly traffic volume and time mean speed data sets provided by the National Center for Transportation Studies (NCTS), we processed the data to generate time series plots of the weekly densities, the normal range of traffic density, and the abnormal. We obtained these through Quantum Frequency Algorithm (QFA). We fit the ARIMA model to some weeks of Blk which have evident occurrences of incidents as detected and crosschecked with the incidents data provided by NCTS. We performed a forecast of the fit and generated a time series plot of the superimposed plots of the actual data and the forecast for each of the top incidents generated in the previous literature. These plots provided a simplistic time-domain 2D visualizations that successfully exposed the abnormal points where incidents happened. These also provided an estimate of the expected traffic density behavior if incidents did not happen.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318144","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623731
K. Michalopoulos, Michail Tsakalakis, N. Bourbakis
This paper presents a methodology for the extraction, recognition and characterization of paths in aerial images. We present a sequential algorithm that creates a linear approximation of the underlying path. The path is divided into straight line segments in a sequential manner. It takes under consideration the local spatial structure of the patterns in order to extract the straight line segment and the overall global path is sequentially formed from each segment. We present the preprocessing steps used to extract patterns of interest from an image and the results from two case study examples. The methodology has applications for the autonomous path planning of aerial vehicle following a specified structure (river, road) and in cases where that we are interested in the spatial relationships of the underlying patterns in the image and want to detect changes in the spatial structure of the patterns.
{"title":"Detecting texture paths and patterns in aerial images","authors":"K. Michalopoulos, Michail Tsakalakis, N. Bourbakis","doi":"10.1109/IISA.2013.6623731","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623731","url":null,"abstract":"This paper presents a methodology for the extraction, recognition and characterization of paths in aerial images. We present a sequential algorithm that creates a linear approximation of the underlying path. The path is divided into straight line segments in a sequential manner. It takes under consideration the local spatial structure of the patterns in order to extract the straight line segment and the overall global path is sequentially formed from each segment. We present the preprocessing steps used to extract patterns of interest from an image and the results from two case study examples. The methodology has applications for the autonomous path planning of aerial vehicle following a specified structure (river, road) and in cases where that we are interested in the spatial relationships of the underlying patterns in the image and want to detect changes in the spatial structure of the patterns.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128828100","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623691
M. Virvou, Spyros Papadimitriou
Recent studies have shown that the use of educational games during learning process is dramatically increased. Furthermore, researchers suggest the attachment of adaptive features in order to motivate students and assess their knowledge level on a specific educational subject. In this paper, we present an educational browser-based game with coins that contributes to better understanding the addition process in elementary education. The game encompasses user modeling and adaptive techniques. It determines students' knowledge level and helps them outcome difficulties and obtain fluency in arithmetic addition skills.
{"title":"Learning addition by playing an adaptive game with coins","authors":"M. Virvou, Spyros Papadimitriou","doi":"10.1109/IISA.2013.6623691","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623691","url":null,"abstract":"Recent studies have shown that the use of educational games during learning process is dramatically increased. Furthermore, researchers suggest the attachment of adaptive features in order to motivate students and assess their knowledge level on a specific educational subject. In this paper, we present an educational browser-based game with coins that contributes to better understanding the addition process in elementary education. The game encompasses user modeling and adaptive techniques. It determines students' knowledge level and helps them outcome difficulties and obtain fluency in arithmetic addition skills.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122020299","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623682
Rosaly B. Alday, Ruel M. Pagayon
Misinterpreted drug names in medical prescriptions cause severe and lethal effects to patients. This is caused by either illegible handwriting or inability of pharmacists to recognize medicine names in medical prescription. This study resolves the problems in medical prescriptions through MediPic, an Android application that uses optical character recognition to partially scan handwritten medicine names and return readable digital text. This mobile application used Tesseract as the optical character recognition library, and Repres to match the partial string with the drug name. With MediPic, cases of misinterpretation of medicine names can be decreased. This will help pharmacists mininize their doubts in selling the wrong medicine to patients. This will also be handful to the patients because it will provide a way to know more about the medicine they are about to take.
{"title":"MediPic: A mobile application for medical prescriptions","authors":"Rosaly B. Alday, Ruel M. Pagayon","doi":"10.1109/IISA.2013.6623682","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623682","url":null,"abstract":"Misinterpreted drug names in medical prescriptions cause severe and lethal effects to patients. This is caused by either illegible handwriting or inability of pharmacists to recognize medicine names in medical prescription. This study resolves the problems in medical prescriptions through MediPic, an Android application that uses optical character recognition to partially scan handwritten medicine names and return readable digital text. This mobile application used Tesseract as the optical character recognition library, and Repres to match the partial string with the drug name. With MediPic, cases of misinterpretation of medicine names can be decreased. This will help pharmacists mininize their doubts in selling the wrong medicine to patients. This will also be handful to the patients because it will provide a way to know more about the medicine they are about to take.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127286013","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623693
A. S. Lampropoulos, G. Tsihrintzis
In this paper we explore the use of density one-class classifiers for the movie recommendation problem. Our motivation lies in the fact that users of recommender systems usually provide ratings only for items that they are interested in and belong to their preferences without giving information on items that they dislike. One-class classification seems to be the proper learning paradigm for the recommendation problem, as it tries to induce a general function that can discriminate between two classes of interest, given the constraint that training patterns are available only from one class. The experimental results show that one-class classifiers not only cope with the problem of lack of negative examples, but also succeed in performing efficiently in the recommendation process.
{"title":"Evaluation of density one-class classifiers for item-based filtering","authors":"A. S. Lampropoulos, G. Tsihrintzis","doi":"10.1109/IISA.2013.6623693","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623693","url":null,"abstract":"In this paper we explore the use of density one-class classifiers for the movie recommendation problem. Our motivation lies in the fact that users of recommender systems usually provide ratings only for items that they are interested in and belong to their preferences without giving information on items that they dislike. One-class classification seems to be the proper learning paradigm for the recommendation problem, as it tries to induce a general function that can discriminate between two classes of interest, given the constraint that training patterns are available only from one class. The experimental results show that one-class classifiers not only cope with the problem of lack of negative examples, but also succeed in performing efficiently in the recommendation process.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122254472","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623721
V. Martinek, M. Zemlicka
We made the passengers' path planning more reliable by predicting irregularities in public transportation. The prediction is based on historical data. Two levels of refinement are introduced and tested on sample data. Applying prediction on actual timetables allows us to plan the path up to 19% more resilient against change loses. This can significantly help passengers to reach the destination in time.
{"title":"Passenger path plan reliability improvement proposal","authors":"V. Martinek, M. Zemlicka","doi":"10.1109/IISA.2013.6623721","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623721","url":null,"abstract":"We made the passengers' path planning more reliable by predicting irregularities in public transportation. The prediction is based on historical data. Two levels of refinement are introduced and tested on sample data. Applying prediction on actual timetables allows us to plan the path up to 19% more resilient against change loses. This can significantly help passengers to reach the destination in time.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852067","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623680
Armond C. Ave, Jaime D. L. Caro, Diana Mae C. Pacapac, Kyla Marie G. Salamanca
Lack of motivation is often cited as one of the most common reasons as to why only few burn patients with physical conditions do the recommended rehabilitation exercises regularly. Many games have been created to address this problem but most of them require subjects to wear sensors and devices which can be intrusive. A non-intrusive kinesthetic game that uses a Kinect sensor to incorporate range of motion (ROM) exercises was developed to motivate second-degree or higher burns patients in the sub-acute stage aged 5-8 years old in upper extremity rehabilitation. The game also aids therapists in monitoring each patient's progress by providing information regarding performance (i.e., reaction time, limb speed, and range of motion) and allows therapists to tweak parameters (e.g., joint to train, range area of focus) to address specific needs.
{"title":"A kinesthetic game as a motivational aid and monitor in upper extremities burns rehabilitation","authors":"Armond C. Ave, Jaime D. L. Caro, Diana Mae C. Pacapac, Kyla Marie G. Salamanca","doi":"10.1109/IISA.2013.6623680","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623680","url":null,"abstract":"Lack of motivation is often cited as one of the most common reasons as to why only few burn patients with physical conditions do the recommended rehabilitation exercises regularly. Many games have been created to address this problem but most of them require subjects to wear sensors and devices which can be intrusive. A non-intrusive kinesthetic game that uses a Kinect sensor to incorporate range of motion (ROM) exercises was developed to motivate second-degree or higher burns patients in the sub-acute stage aged 5-8 years old in upper extremity rehabilitation. The game also aids therapists in monitoring each patient's progress by providing information regarding performance (i.e., reaction time, limb speed, and range of motion) and allows therapists to tweak parameters (e.g., joint to train, range area of focus) to address specific needs.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131771996","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 : 2013-07-10DOI: 10.1109/IISA.2013.6623703
Alvin John Burgos, Jaime D. L. Caro
In this paper, we discuss and prove properties of the Johnson scheme G(n, k), with vertex set all subsets of {1, 2, ..., n}, and (x, y) is an edge whenever |x Π y| = k - 1. We proved that it is Hamiltonian by constructing an algorithm that will generate a Hamiltonian cycle given n and k. We also proved that there is an embedding from the Johnson scheme to a subgraph of the hypercube. We also proved that there is a range of lengths in a given Johnson scheme such that it is a valid cycle length, that is, there is a cycle with that length in the graph. This paper may add to the current known properties of the Johnson scheme, that may help future network engineers to decide on a specific interconnection network to use.
讨论并证明了顶点集为{1,2，…的所有子集的Johnson方案G(n, k)的性质。， n}，当|x Π y| = k - 1时，(x, y)是一条边。我们通过构造一个算法来证明它是哈密顿的，该算法将在给定n和k的情况下生成哈密顿循环。我们还证明了从Johnson方案到超立方体的子图存在嵌入。我们还证明了在给定的Johnson方案中存在一个长度范围，使得它是一个有效的循环长度，也就是说，在图中存在一个具有该长度的循环。这篇论文可能会增加目前已知的约翰逊方案的特性，这可能有助于未来的网络工程师决定使用特定的互连网络。
{"title":"Properties of Johnson schemes","authors":"Alvin John Burgos, Jaime D. L. Caro","doi":"10.1109/IISA.2013.6623703","DOIUrl":"https://doi.org/10.1109/IISA.2013.6623703","url":null,"abstract":"In this paper, we discuss and prove properties of the Johnson scheme G(n, k), with vertex set all subsets of {1, 2, ..., n}, and (x, y) is an edge whenever |x Π y| = k - 1. We proved that it is Hamiltonian by constructing an algorithm that will generate a Hamiltonian cycle given n and k. We also proved that there is an embedding from the Johnson scheme to a subgraph of the hypercube. We also proved that there is a range of lengths in a given Johnson scheme such that it is a valid cycle length, that is, there is a cycle with that length in the graph. This paper may add to the current known properties of the Johnson scheme, that may help future network engineers to decide on a specific interconnection network to use.","PeriodicalId":261368,"journal":{"name":"IISA 2013","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124480559","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
扫码关注我们
求助内容：
应助结果提醒方式：