D. Çelik, Atilla Elçi, Ridvan Akcicek, Bora Gokce, Pelin Hurcan
{"title":"Mobile Pediatric Consultation and Monitoring System through Semantic Web Technology","authors":"D. Çelik, Atilla Elçi, Ridvan Akcicek, Bora Gokce, Pelin Hurcan","doi":"10.1109/COMPSACW.2014.61","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.61","url":null,"abstract":"Health is a popular aspect of eHealth applications that is starting to explode exponentially. The use of technology offering solutions with a potential of making patients' lives easier in the health sector has gradually increased with mHealth. Technology has great bearing in the health sector in order to increase the efficiency to serve patients by helping to diagnose ailments reliably. Mobile systems help observation of child patients in their treatment process and the collection of health data on the course. Therefore, people will be more aware of their children's health problems and preventive measures in accordance with those health problems. This article is on Mobile Pediatric Consultation and Monitoring System (mPCMS). Details of design and operation are given in this article. Mpcms not only will assist doctors but also help patients in decision making process of the medical treatment due to the information's ease use. Accordingly, with mPCMS, there will be a contribution to distant consultation by the doctor and the family by collecting the health data before and after the treatment of child patients.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124141713","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}
{"title":"The Application of Internet of Things in Social Network","authors":"Yu Zhang, Jiangtao Wen, Fan Mo","doi":"10.1109/COMPSACW.2014.41","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.41","url":null,"abstract":"The combination of Internet of things and the social network make it possible for us to interact with environment and other people, this leading to the social Internet of things concept. In order to expand the idea of human to human connectivity to include everything in the real world, a suitable social model acts as a key factor to expand basic communication functionalities to include services discovery, push messages, subscribe channels and execute orders. Existing solutions do not mention about the relationships between entities or limit the relationships within the physical entities range. In this paper we propose a social model of Internet of things to organize everything in the physical world including both entities and human. And a smart environment prototype including sensors, hardware middleware, cloud server, social network platform, mobile clients along with service discovery functions and reminding functions.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116302200","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}
Daniel Hallmans, Marcus Jägemar, S. Larsson, Thomas Nolte
{"title":"Identifying Evolution Problems for Large Long Term Industrial Evolution Systems","authors":"Daniel Hallmans, Marcus Jägemar, S. Larsson, Thomas Nolte","doi":"10.1109/COMPSACW.2014.66","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.66","url":null,"abstract":"Large infrastructure systems with a life time of more than 30 years, such as telecommunication or power transmission systems, are difficult to maintain since they suffer from the end-of-life plague of software, hardware and knowledge. Large companies have traditionally tackled this problem successfully, but maybe not with complete efficiency in all cases. We find system evolution to be an increasingly interesting problem as infrastructure becomes more complicated. Our increasingly complex and advanced society demands more of the infrastructure making system evolution an interesting alternative to system replacement. From the point of view of the ISO/IEC 15288 development process we have identified life cycle issues connected to long life time scenarios and the different life cycle stages. In this paper we contribute with a modification of the utilisation and support stage in ISO/IEC 15288 into an evolution stage where a system is not only retired and replaced but rather evolved into the next generation. Using this approach changes the view of system development for this specific type of systems towards a way of incremental development, where new functions can be added at the same time as old legacy parts are replaced with functionally equivalent modules based on new hardware. We have based our solution on the experience from investigations of life cycle issues for two large infrastructure systems.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129966374","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}
{"title":"Measuring Prediction Sensitivity of a Cloud Auto-scaling System","authors":"A. Nikravesh, S. Ajila, Chung-Horng Lung","doi":"10.1109/COMPSACW.2014.116","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.116","url":null,"abstract":"Elasticity is one of the key benefits of cloud computing which helps customers reduce the cost. Although elasticity is beneficiary in terms of cost, obligation of maintaining Service Level Agreements leads to necessity in dealing with the cost-performance trade-off. Proactive auto-scaling is an efficient approach to overcome this problem. In this approach scaling actions are generated based on prediction results. Recently, several research studies have been focusing on improving prediction accuracy in order to improve the efficiency of auto-scaling mechanisms. However, the sensitivity of auto-scaling mechanisms to the prediction results is neglected in the domain. In this work we have investigated the sensitivity of auto-scaling mechanisms to the prediction results by evaluating the influence of performance predictions accuracy on the auto-scaling actions. Specifically, we have compared actions of threshold based scaling techniques which are generated based on Support Vector Machine (SVM) and Neural Networks (NN) predictions. Our experimental results show that although SVM is more accurate than NN, scaling decisions made by the two algorithms are identical in 91.5% of the time. Furthermore, we have shown that the optimal training duration for SVM and NN is about 60% of experiment duration.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132451981","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}
{"title":"A Mobility Management System for the Global Live Migration of Virtual Machine across Multiple Sites","authors":"T. Kondo, R. Aibara, Kazufumi Suga, Kaori Maeda","doi":"10.1109/COMPSACW.2014.16","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.16","url":null,"abstract":"With rapid spread of virtualization technologies, Live migration which provides the ability to migrate a running virtual machine (VM) among physical hosts without interruption. Especially, Global Live Migration (GLM) which enables to migrate VM across the geographically-distributed Wide Area Networks (WANs) is an essential step towards development of the inter-cloud environment. However, GLM gets a bit complicated for network configuration compared with ordinary live migration. We have already proposed the GLM method which implements IP mobility support architecture with multiple interfaces to enable live migration among distributed sites consisting of different IP network segments. However, there is no sufficient consideration about the management of smooth handoff for the VM migration on the Internet. In this paper, we propose a mobility management system for GLM, and integrate into our developed nation-wide virtualization infrastructure. The proposed system enables VMs seamless handoff without any modification of the hypervisor while keeping network configuration of the migrating site. Performance evaluation shows the processing overhead of the proposed management system with GLM among multiple sites which are more than 600 km distant. As a result, we confirm that the proposed system provides smooth handoff for the VM on the widely-distributed environment if the proposed system is implemented.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077211","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}
Zijiang Yang, Beibei Yin, Junpeng Lv, K. Cai, S. Yau, Jia Yu
{"title":"Dynamic Random Testing with Parameter Adjustment","authors":"Zijiang Yang, Beibei Yin, Junpeng Lv, K. Cai, S. Yau, Jia Yu","doi":"10.1109/COMPSACW.2014.10","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.10","url":null,"abstract":"In order to improve traditional Random Partition Testing (RPT) strategy, Dynamic Random Testing (DRT) strategy is proposed. By DRT, testing profile is dynamically updated according to the previous test case execution result. The effectiveness of DRT depends on parameter settings. In this paper, a strategy is presented for extending the DRT with parameter adjustment in order to guarantee that the optimized boundaries. Using this strategy, the parameters in DRT are adjusted based on testing history during testing process. Case studies are presented and analyzed to show the improvement of DRT.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"150 27","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884789","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}
{"title":"Bayesian Model Averaging of Bayesian Network Classifiers for Intrusion Detection","authors":"Liyuan Xiao, Yetian Chen, Carl K. Chang","doi":"10.1109/COMPSACW.2014.25","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.25","url":null,"abstract":"Bayesian network (BN) classifiers with powerful reasoning capabilities have been increasingly utilized to detect intrusion with reasonable accuracy and efficiency. However, existing BN classifiers for intrusion detection suffer two problems. First, such BN classifiers are often trained from data using heuristic methods that usually select suboptimal models. Second, the classifiers are trained using very large datasets which may be time consuming to obtain in practice. When the size of training dataset is small, the performance of a single BN classifier is significantly reduced due to its inability to represent the whole probability distribution. To alleviate these problems, we build a Bayesian classifier by Bayesian Model Averaging(BMA) over the k-best BN classifiers, called Bayesian Network Model Averaging (BNMA) classifier. We train and evaluate BNMA classifier on the NSL-KDD dataset, which is less redundant, thus more judicial than the commonly used KDD Cup 99 dataset. We show that the BNMA classifier performs significantly better in terms of detection accuracy than the Naive Bayes classifier and the BN classifier built with heuristic method. We also show that the BNMA classifier trained using a smaller dataset outperforms two other classifiers trained using a larger dataset. This also implies that the BNMA is beneficial in accelerating the detection process due to its less dependance on the potentially prolonged process of collecting large training datasets.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125625271","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}
{"title":"Static Code Analysis for Software Security Verification: Problems and Approaches","authors":"Zeineb Zhioua, S. Short, Y. Roudier","doi":"10.1109/COMPSACW.2014.22","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.22","url":null,"abstract":"Developing and deploying secure software is a difficult task, one that is even harder when the developer has to be conscious of adhering to specific company security requirements. In order to facilitate this, different approaches have been elaborated over the years to varying degrees of success. To better understand the underlying issues, this paper describes and evaluates a number of static code analysis techniques and tools based on an example that illustrates prevalent software security challenges. The latter can be addressed by considering an approach that allows for the detection of security properties and their transformation into security policies that can be validated against security requirements. This would help the developer throughout the software development lifecycle and to insure the compliance with security specifications.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122387179","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}
{"title":"Fair Optimization -- Methodological Foundations of Fairness in Network Resource Allocation","authors":"W. Ogryczak","doi":"10.1109/COMPSACW.2014.11","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.11","url":null,"abstract":"Network resource allocation problems are concerned with the allocation of limited resources among competing entities so as to respect some fairness rules while looking for the overall efficiency. This paper presents the methodology of fair optimization representing inequality averse optimization rather than strict inequality minimization as foundation of fairness in resource allocation. Commonly applied in network resource allocation Max-Min Fairness or the lexicographic maxim in optimization are the most widely known concepts of fair optimization. Alternative models of fair optimization are discussed showing that they generate all the classical fair solution concepts as special cases. However, the concepts of fair optimization can be effectively used to generate various fair and efficient resource allocation schemes.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133580310","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}
Luba Shabnam, Farzana Haque, Moshiur Bhuiyan, A. Krishna
{"title":"Risk Measure Propagation through Organisational Network","authors":"Luba Shabnam, Farzana Haque, Moshiur Bhuiyan, A. Krishna","doi":"10.1109/COMPSACW.2014.40","DOIUrl":"https://doi.org/10.1109/COMPSACW.2014.40","url":null,"abstract":"In this paper we present a risk measurement methodology by incorporating actors' dependency relationships with each other across the whole organisational model. We argue that any actor associated with a vulnerable actor holds certain degree of vulnerability as a result of its association with the vulnerable actor. The degree of vulnerability becomes more if the actor is associated with more vulnerable actors. Similarly, we argue that any actor associated with a critical actor holds certain degree of criticality as a result of its association with the critical actor. The degree of criticality becomes more if the actor is associated with more critical actors. We believe our novel approach is capable of guiding the analyst to analyse vulnerability and criticality levels that exists among the actors' interdependencies across the whole organisational model, hence enabling him/her to design or redesign risk aware business processes.","PeriodicalId":123335,"journal":{"name":"2014 IEEE 38th International Computer Software and Applications Conference Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127785410","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}