Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860557
Günter Fahrnberger, D. Nayak, M. VenkataSwamy, S. Ramaswamy
Internet, on one hand, is a primary foundation for knowledge acquisition in a child's life. On the other hand, there are many growing exploits over children. Motivated by the rising need to shield children's communication channels from obnoxious sources, this paper proposes a framework named SafeChat. SafeChat is the result of aggregating the context based authentication features of 4-CBAF model and the message encryption features from demonstrated SecureString 2.0. SafeChat intercepts children's communication and eradicates explicit words coming into the children's devices. SafeChat filters explicit words without recognizing their meaning. Such an approach hardens the system against malicious attacks. Furthermore, it secures the communication channels against possible man-in-the-middle attacks by employing an encryption mechanism. In addition, it encompasses the tools to authenticate and authorize communications and allows parents to monitor children communication channels in case an intervention is desirable. SafeChat supports to extend it to incorporate essential features including a facility to censor users through building a social network. Such a social network would allow other children to learn about the users with potential threats.
{"title":"SafeChat: A tool to shield children's communication from explicit messages","authors":"Günter Fahrnberger, D. Nayak, M. VenkataSwamy, S. Ramaswamy","doi":"10.1109/I4CS.2014.6860557","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860557","url":null,"abstract":"Internet, on one hand, is a primary foundation for knowledge acquisition in a child's life. On the other hand, there are many growing exploits over children. Motivated by the rising need to shield children's communication channels from obnoxious sources, this paper proposes a framework named SafeChat. SafeChat is the result of aggregating the context based authentication features of 4-CBAF model and the message encryption features from demonstrated SecureString 2.0. SafeChat intercepts children's communication and eradicates explicit words coming into the children's devices. SafeChat filters explicit words without recognizing their meaning. Such an approach hardens the system against malicious attacks. Furthermore, it secures the communication channels against possible man-in-the-middle attacks by employing an encryption mechanism. In addition, it encompasses the tools to authenticate and authorize communications and allows parents to monitor children communication channels in case an intervention is desirable. SafeChat supports to extend it to incorporate essential features including a facility to censor users through building a social network. Such a social network would allow other children to learn about the users with potential threats.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129662393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860553
L. Mokdad, J. Ben-othman
One challenge of composite Web service architectures is the guarantee of the Quality of Service (QoS). Performance evaluation of these architectures is essential but complex due to synchronizations inside the orchestration of services. We propose in this paper, to use stochastic automata networks which a power formalism to modelize and to evaluate complex system with synchronizations.
{"title":"Stochastic automata networks for performance evaluation of composite Web services","authors":"L. Mokdad, J. Ben-othman","doi":"10.1109/I4CS.2014.6860553","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860553","url":null,"abstract":"One challenge of composite Web service architectures is the guarantee of the Quality of Service (QoS). Performance evaluation of these architectures is essential but complex due to synchronizations inside the orchestration of services. We propose in this paper, to use stochastic automata networks which a power formalism to modelize and to evaluate complex system with synchronizations.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860549
F. Sánchez-Fernández, Philippe Brunet, S. Senouci
The first step in a surveillance system is to create a representation of the environment. Background subtraction is widely used algorithm to define a part of an image that most time remains stationary in a video. In surveillance tasks, this model helps to recognize those outlier objects in an area under monitoring. Set up a background model on moving platforms (intelligent cars, UAVs, etc.) is a challenging task due camera motion when images are acquired. In this paper, we propose a method to support instabilities caused by aerial images fusing spatial and temporal information about image motion. We used frame difference as first approximation, then age of pixels is estimated. This latter gives us an invariability level of a pixel over time. Gradient direction of ages and an adaptive weight are used to reduce impact from camera motion on background modelling. We tested our proposed method simulating several conditions that impair aerial image acquisition such as intentional and unintentional camera motion. Experimental results show improved performance compared to algorithms GMM and KDE.
{"title":"Background subtraction for aerial surveillance conditions","authors":"F. Sánchez-Fernández, Philippe Brunet, S. Senouci","doi":"10.1109/I4CS.2014.6860549","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860549","url":null,"abstract":"The first step in a surveillance system is to create a representation of the environment. Background subtraction is widely used algorithm to define a part of an image that most time remains stationary in a video. In surveillance tasks, this model helps to recognize those outlier objects in an area under monitoring. Set up a background model on moving platforms (intelligent cars, UAVs, etc.) is a challenging task due camera motion when images are acquired. In this paper, we propose a method to support instabilities caused by aerial images fusing spatial and temporal information about image motion. We used frame difference as first approximation, then age of pixels is estimated. This latter gives us an invariability level of a pixel over time. Gradient direction of ages and an adaptive weight are used to reduce impact from camera motion on background modelling. We tested our proposed method simulating several conditions that impair aerial image acquisition such as intentional and unintentional camera motion. Experimental results show improved performance compared to algorithms GMM and KDE.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860550
Ahmed Louazani, S. Senouci, M. Bendaoud
Among recent advances in wireless communication technologies' field, Vehicular Ad-hoc Networks (VANETs) have drawn the attention of both academic and industry researchers due to their potential applications including driving safety, entertainment, emergency applications, and content sharing. VANET networks are characterized by their high mobile topology changes. Clustering is one of the control schemes used to make this global topology less dynamic. It allows the formation of dynamic virtual backbone used to organize the medium access, to support quality of service and to simplify routing. Mainly, nodes are organized into clusters with at least one cluster head (CH) node that is responsible for the coordination tasks of its cluster. In this sight, our paper introduces a clustering mechanism based for connectivity maintenance in VANET. The proposed solution is experimentally evaluated using NS2 simulator.
{"title":"Clustering-based algorithm for connectivity maintenance in Vehicular Ad-Hoc Networks","authors":"Ahmed Louazani, S. Senouci, M. Bendaoud","doi":"10.1109/I4CS.2014.6860550","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860550","url":null,"abstract":"Among recent advances in wireless communication technologies' field, Vehicular Ad-hoc Networks (VANETs) have drawn the attention of both academic and industry researchers due to their potential applications including driving safety, entertainment, emergency applications, and content sharing. VANET networks are characterized by their high mobile topology changes. Clustering is one of the control schemes used to make this global topology less dynamic. It allows the formation of dynamic virtual backbone used to organize the medium access, to support quality of service and to simplify routing. Mainly, nodes are organized into clusters with at least one cluster head (CH) node that is responsible for the coordination tasks of its cluster. In this sight, our paper introduces a clustering mechanism based for connectivity maintenance in VANET. The proposed solution is experimentally evaluated using NS2 simulator.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127708128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860564
Bassirou Gueye, O. Flauzac, Cyril Rabat, I. Niang
Grids that use the concept of services are generally based on highly centralized hierarchical architectures. The main issue of this centralization is the unified management of resources, but it is difficult to react rapidly against failure that can affect grid users. Therefore, in our previous works, we proposed a specification called P2P4GS for services management in a grid-computing environment based on peer-to-peer paradigm. In this approach, all nodes can participate to the deployment and the discovery processes for a given service. In addition, each node maintains a table called “Service Registry”, which lists the services owned by this node, as well as the other services located inside the grid and learned during a discovery process. However, the growth of the distributed systems size, in terms of number of nodes, services and users, raises the question of scalability. In this paper, we propose to limit the knowledge about the location of grid services on some nodes that we call ISP (Information System Proxy). Around each ISP, we form a community constituted by a set of nodes of the grid. In order to reduce the ISP overload, on the one hand, we delegate invocation and execution services tasks for nodes called IP (Invocation Proxy). On the other hand, we memorize information about the location of frequently requested services on LP (Location Proxy) nodes.
{"title":"A self-adaptive structuring for P2P-based grid","authors":"Bassirou Gueye, O. Flauzac, Cyril Rabat, I. Niang","doi":"10.1109/I4CS.2014.6860564","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860564","url":null,"abstract":"Grids that use the concept of services are generally based on highly centralized hierarchical architectures. The main issue of this centralization is the unified management of resources, but it is difficult to react rapidly against failure that can affect grid users. Therefore, in our previous works, we proposed a specification called P2P4GS for services management in a grid-computing environment based on peer-to-peer paradigm. In this approach, all nodes can participate to the deployment and the discovery processes for a given service. In addition, each node maintains a table called “Service Registry”, which lists the services owned by this node, as well as the other services located inside the grid and learned during a discovery process. However, the growth of the distributed systems size, in terms of number of nodes, services and users, raises the question of scalability. In this paper, we propose to limit the knowledge about the location of grid services on some nodes that we call ISP (Information System Proxy). Around each ISP, we form a community constituted by a set of nodes of the grid. In order to reduce the ISP overload, on the one hand, we delegate invocation and execution services tasks for nodes called IP (Invocation Proxy). On the other hand, we memorize information about the location of frequently requested services on LP (Location Proxy) nodes.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860558
Katharina Mollus, D. Westhoff, T. Markmann
Recently we presented QuantDroid [7], a quantitative approach towards mitigating privilege escalation attacks on Android. By monitoring all synchronous IPC via overt channels on-the-fly, a so called flow-graph service detects an abnormal amount of traffic exchanged between DVMs running different Apps to indicate a potential horizontal privilege escalation attack. However, although certainly a valuable first step, our initial QuantDroid approach fails when dealing with asynchronous IPC via persistent storage containers on the Android system. To also address this issue, in this work we extend QuantDroid to QuantDroid++ by providing i) a central storage of taints when operating on system-internal databases of Android, ii) an extension of the SQL cursor object to preserve taints and link requested data with such taints, and, finally iii) an inspection of the information flow with such newly available taints for all relevant database operations.
{"title":"Curtailing privilege escalation attacks over asynchronous channels on Android","authors":"Katharina Mollus, D. Westhoff, T. Markmann","doi":"10.1109/I4CS.2014.6860558","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860558","url":null,"abstract":"Recently we presented QuantDroid [7], a quantitative approach towards mitigating privilege escalation attacks on Android. By monitoring all synchronous IPC via overt channels on-the-fly, a so called flow-graph service detects an abnormal amount of traffic exchanged between DVMs running different Apps to indicate a potential horizontal privilege escalation attack. However, although certainly a valuable first step, our initial QuantDroid approach fails when dealing with asynchronous IPC via persistent storage containers on the Android system. To also address this issue, in this work we extend QuantDroid to QuantDroid++ by providing i) a central storage of taints when operating on system-internal databases of Android, ii) an extension of the SQL cursor object to preserve taints and link requested data with such taints, and, finally iii) an inspection of the information flow with such newly available taints for all relevant database operations.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117284879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860556
B. Alghamdi, H. Fouchal, Marwane Ayaida
This paper presents Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks (WSN). We combined two type of scheduling in this study: the static scheduling for coordinator nodes and the dynamic scheduling for leaf nodes. We consider a cluster tree topology in our study with, one main coordinator (Personal Area Network Coordinator), several children coordinators (Routers) and several end devices (leafs). We implement the scheduling algorithm on the PAN Coordinator. The experimental implementation is done over TelosB sensors under TinyOS environment.
{"title":"Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks","authors":"B. Alghamdi, H. Fouchal, Marwane Ayaida","doi":"10.1109/I4CS.2014.6860556","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860556","url":null,"abstract":"This paper presents Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks (WSN). We combined two type of scheduling in this study: the static scheduling for coordinator nodes and the dynamic scheduling for leaf nodes. We consider a cluster tree topology in our study with, one main coordinator (Personal Area Network Coordinator), several children coordinators (Routers) and several end devices (leafs). We implement the scheduling algorithm on the PAN Coordinator. The experimental implementation is done over TelosB sensors under TinyOS environment.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128286362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860552
G. Eichler, C. Erfurth, Karl-Heinz Lüke
What will the future learning and academic support environment look like for students? What are the resulting requirements for a suitable tool landscape? As an active member of different communities, students already use a set of tools especially for communication and networking purposes. Students do not stop the usage of their social tools within their universities. However, universities provide their own tools for students to be connected with the organization. Which tools are out of fashion? Which tool classes are needed? And how is the degree of integration to be achieved with common community tools and systems? This paper analyses requirements from the student point of view and discusses aspects for the integration into an academic IT infrastructure.
{"title":"Student Interaction Communities social requirements reflected by a tool and system landscape","authors":"G. Eichler, C. Erfurth, Karl-Heinz Lüke","doi":"10.1109/I4CS.2014.6860552","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860552","url":null,"abstract":"What will the future learning and academic support environment look like for students? What are the resulting requirements for a suitable tool landscape? As an active member of different communities, students already use a set of tools especially for communication and networking purposes. Students do not stop the usage of their social tools within their universities. However, universities provide their own tools for students to be connected with the organization. Which tools are out of fashion? Which tool classes are needed? And how is the degree of integration to be achieved with common community tools and systems? This paper analyses requirements from the student point of view and discusses aspects for the integration into an academic IT infrastructure.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860560
A. A. Younes, Frédéric Blanchard, B. Delemer, M. Herbin
The therapeutic monitoring of patients at home produces a mass of data that requires new methods for analyzing and processing. The main challenge of medical data processing is the management of high intra-subject and inter-subject variabilities. The need for specific dashboards for both the patient and the group of patients with similar therapeutic behaviors is another difficulty. This paper describes a new way to analyze such medical data through the use of singular profiles of elderly patients in a population with type 2 diabetes. Our goal is to develop a methodology of data processing for following the insulin therapy at home. The first step of processing consists in the fuzzification of the attributes within the data samples to ensure the robustness of the method. The singularity index we propose assesses the fuzzy attributes relative to each patient. This index is obtained by computing the power of the fuzzy set associated with each attribute. The singularity of the attributes permits us to give the singular profile of each patient. The visualization step leads us to propose empirical rules to obtain three kinds of different profiles. This robust approach also permits us to highlight three clusters of elderly diabetics. The three clusters appear very similar as the ones obtained when using classical automated methods of clustering such as the k-medoids. By extending this approach, the ultimate goal of our future developments is the design of a recommender system for type 2 diabetics with insulin therapy.
{"title":"Singular profile of diabetics","authors":"A. A. Younes, Frédéric Blanchard, B. Delemer, M. Herbin","doi":"10.1109/I4CS.2014.6860560","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860560","url":null,"abstract":"The therapeutic monitoring of patients at home produces a mass of data that requires new methods for analyzing and processing. The main challenge of medical data processing is the management of high intra-subject and inter-subject variabilities. The need for specific dashboards for both the patient and the group of patients with similar therapeutic behaviors is another difficulty. This paper describes a new way to analyze such medical data through the use of singular profiles of elderly patients in a population with type 2 diabetes. Our goal is to develop a methodology of data processing for following the insulin therapy at home. The first step of processing consists in the fuzzification of the attributes within the data samples to ensure the robustness of the method. The singularity index we propose assesses the fuzzy attributes relative to each patient. This index is obtained by computing the power of the fuzzy set associated with each attribute. The singularity of the attributes permits us to give the singular profile of each patient. The visualization step leads us to propose empirical rules to obtain three kinds of different profiles. This robust approach also permits us to highlight three clusters of elderly diabetics. The three clusters appear very similar as the ones obtained when using classical automated methods of clustering such as the k-medoids. By extending this approach, the ultimate goal of our future developments is the design of a recommender system for type 2 diabetics with insulin therapy.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415762","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
扫码关注我们
求助内容：
应助结果提醒方式：