Vladi Koliçi, Tetsuya Oda, Admir Barolli, Algenti Lala, L. Barolli, F. Xhafa
Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In this work, we evaluated WMN-SA system which is based on Simulated Annealing (SA) to find an optimal location assignment for mesh routers. As evaluation metrics, we used throughput, one-way delay, jitter, fairness index and residual energy. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance of the optimized network topologies by sending multiple constant bit rate flows in the network. The simulation results show that the throughput is almost the same for both WMN architectures. The delay, jitter and fairness index of 32 mesh routers is higher than other number of mesh routers for I/B WMN architecture. For 16 mesh router, the remaining energy is higher than 24 and 32 mesh routers.
{"title":"Application of WMN-SA Web Interface and NS-3 for Optimization and Analysis in WMNs Considering Different Number of Mesh Routers and Architectures","authors":"Vladi Koliçi, Tetsuya Oda, Admir Barolli, Algenti Lala, L. Barolli, F. Xhafa","doi":"10.1109/INCoS.2015.12","DOIUrl":"https://doi.org/10.1109/INCoS.2015.12","url":null,"abstract":"Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In this work, we evaluated WMN-SA system which is based on Simulated Annealing (SA) to find an optimal location assignment for mesh routers. As evaluation metrics, we used throughput, one-way delay, jitter, fairness index and residual energy. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance of the optimized network topologies by sending multiple constant bit rate flows in the network. The simulation results show that the throughput is almost the same for both WMN architectures. The delay, jitter and fairness index of 32 mesh routers is higher than other number of mesh routers for I/B WMN architecture. For 16 mesh router, the remaining energy is higher than 24 and 32 mesh routers.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128201025","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 describes an innovative e-Learning project proposal, named MeToo, aiming to enhance existing e-learning platforms by developing tools and services which support the detection and representation of learners' emotions, as well as emotion-based learning adaptation and affective feedback. To this end, MeToo applies novel emotion detection models to rich multimodal data collected using state of the art channels, advanced sensors and novel adaptive interfaces. Via multiple small-scale pilots in formal, informal and workplace learning environments, MeToo system will intend to demonstrate a positive impact of emotion-aware e-learning on decreasing learners drop-out rates, increasing satisfaction and improving learning performance, thus making learning as a whole a better experience. MeToo's approach requires a multi discipline perspective with expertise in e-learning, software development, internet of things, educational psychology, affective sciences, social sciences and neuroscience. To this end, MeToo not only includes experts in the above domains but also specialists with access to primary and secondary schools, university students, corporate learners and open education users. The paper shows the most relevant aspects of the scientific approaches of this project proposal submitted to the Horizon 2020 ICT program of the European Commission.
{"title":"Towards a Multi-modal Emotion-Awareness e-Learning System","authors":"S. Caballé","doi":"10.1109/INCoS.2015.88","DOIUrl":"https://doi.org/10.1109/INCoS.2015.88","url":null,"abstract":"This paper describes an innovative e-Learning project proposal, named MeToo, aiming to enhance existing e-learning platforms by developing tools and services which support the detection and representation of learners' emotions, as well as emotion-based learning adaptation and affective feedback. To this end, MeToo applies novel emotion detection models to rich multimodal data collected using state of the art channels, advanced sensors and novel adaptive interfaces. Via multiple small-scale pilots in formal, informal and workplace learning environments, MeToo system will intend to demonstrate a positive impact of emotion-aware e-learning on decreasing learners drop-out rates, increasing satisfaction and improving learning performance, thus making learning as a whole a better experience. MeToo's approach requires a multi discipline perspective with expertise in e-learning, software development, internet of things, educational psychology, affective sciences, social sciences and neuroscience. To this end, MeToo not only includes experts in the above domains but also specialists with access to primary and secondary schools, university students, corporate learners and open education users. The paper shows the most relevant aspects of the scientific approaches of this project proposal submitted to the Horizon 2020 ICT program of the European Commission.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"539 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123711010","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 decision to implement a new or modified process within the organization brings many uncertainties. Stakeholders encourage the discussions about the need for these changes. Some positives are identified but mostly negative aspects are presented in the case of such initiatives. Implemented changes mean for many people distortions of existing rules and relationships that need to be re-built and operationally stabilized. In addition, the implementation of change is not cost neutral, that is, the changes create additional demands on the budget. To implement required process as well as changes with minimum resistance it is necessary to present their added value for stakeholders. In this paper we demonstrate how it is possible to transform the process of resource planning based on the ITIL® best practices to the service with added value. The presented process includes a combination of operational and business variables that are appropriately evaluated and implemented into the mathematical model. The proposed process can be used to optimally manage resources within organizations of all sizes with a form of proactive services. Another positives of presented service are that it can be provided not only through internal solutions, but also as a cloud concept.
{"title":"Process as a Service (PraaS) for Planning of Resources in Organizations","authors":"P. Balco, M. Greguš","doi":"10.1109/INCoS.2015.38","DOIUrl":"https://doi.org/10.1109/INCoS.2015.38","url":null,"abstract":"The decision to implement a new or modified process within the organization brings many uncertainties. Stakeholders encourage the discussions about the need for these changes. Some positives are identified but mostly negative aspects are presented in the case of such initiatives. Implemented changes mean for many people distortions of existing rules and relationships that need to be re-built and operationally stabilized. In addition, the implementation of change is not cost neutral, that is, the changes create additional demands on the budget. To implement required process as well as changes with minimum resistance it is necessary to present their added value for stakeholders. In this paper we demonstrate how it is possible to transform the process of resource planning based on the ITIL® best practices to the service with added value. The presented process includes a combination of operational and business variables that are appropriately evaluated and implemented into the mathematical model. The proposed process can be used to optimally manage resources within organizations of all sizes with a form of proactive services. Another positives of presented service are that it can be provided not only through internal solutions, but also as a cloud concept.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126502059","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}
Frequent itemsets mining will not conducive to data analysis. Because of frequent itemsets mining produce very large amount of frequent itemsets in the case large data. Frequent closed itemsets provides a lossless frequent item sets, the smallest representation. This paper aims at the problem of shortage of the DCI_Closed algorithm in the process of mining efficiency, puts forward a kind of improved DCI_Closed algorithm to improve the efficiency of mining, the algorithm references the concept of co-occurrence itemsets and use the nature of the co-occurrence itemsets to prune operation on the 1-itemsets. And improve the efficiency of the algorithm. The experimental results show that the improved DCI_Closed algorithm is better than DCI_Closed algorithm on running time.
{"title":"An Improved DCI_Closed Algorithm","authors":"Y. Miao, Hong Wang","doi":"10.1109/INCoS.2015.11","DOIUrl":"https://doi.org/10.1109/INCoS.2015.11","url":null,"abstract":"Frequent itemsets mining will not conducive to data analysis. Because of frequent itemsets mining produce very large amount of frequent itemsets in the case large data. Frequent closed itemsets provides a lossless frequent item sets, the smallest representation. This paper aims at the problem of shortage of the DCI_Closed algorithm in the process of mining efficiency, puts forward a kind of improved DCI_Closed algorithm to improve the efficiency of mining, the algorithm references the concept of co-occurrence itemsets and use the nature of the co-occurrence itemsets to prune operation on the 1-itemsets. And improve the efficiency of the algorithm. The experimental results show that the improved DCI_Closed algorithm is better than DCI_Closed algorithm on running time.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116443743","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}
Cognitive systems may support different tasks for intelligent company management. Such systems play an important role in evaluation of different enterprise conditions, and allow predicting future company developments. Such systems are able to forecast future company states thanks evaluation of different local and global parameters connected with particular company. This paper presents a comparative evaluation of different classes of cognitive information systems, useful for supporting various decision making tasks. In particular the efficiency of such systems will be presented and compared, as well as some new areas of application will be described.
{"title":"Comparison of Cognitive Information Systems Supporting Management Tasks","authors":"L. Ogiela, M. Ogiela","doi":"10.1109/INCoS.2015.63","DOIUrl":"https://doi.org/10.1109/INCoS.2015.63","url":null,"abstract":"Cognitive systems may support different tasks for intelligent company management. Such systems play an important role in evaluation of different enterprise conditions, and allow predicting future company developments. Such systems are able to forecast future company states thanks evaluation of different local and global parameters connected with particular company. This paper presents a comparative evaluation of different classes of cognitive information systems, useful for supporting various decision making tasks. In particular the efficiency of such systems will be presented and compared, as well as some new areas of application will be described.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130720586","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 any science is to advance the state-of-the-art knowledge via a rigorous investigation and analysis of empirical observations, as well as the development of new theoretical frameworks. Data acquisition and ultimately the extraction of novel knowledge, is therefore the foundation of any scientific advance. However, with the increasing creation of data in various forms and shapes, identifying relevant information from structured and unstructured data sets raises several challenges, as well as opportunities. In this paper, we discuss a semi-automatic method to identify, analyse and generate knowledge specifically focusing on Criminology. The main motivation is to provide a toolbox to help criminology experts, which would potentially lead to a better understanding and prediction of the properties to facilitate the decision making process. Our initial validation shows the potential of our method providing relevant and accurate results.
{"title":"A Preliminary Investigation of a Semi-Automatic Criminology Intelligence Extraction Method: A Big Data Approach","authors":"M. Trovati, P. Hodgson, C. Hargreaves","doi":"10.1109/INCoS.2015.37","DOIUrl":"https://doi.org/10.1109/INCoS.2015.37","url":null,"abstract":"The aim of any science is to advance the state-of-the-art knowledge via a rigorous investigation and analysis of empirical observations, as well as the development of new theoretical frameworks. Data acquisition and ultimately the extraction of novel knowledge, is therefore the foundation of any scientific advance. However, with the increasing creation of data in various forms and shapes, identifying relevant information from structured and unstructured data sets raises several challenges, as well as opportunities. In this paper, we discuss a semi-automatic method to identify, analyse and generate knowledge specifically focusing on Criminology. The main motivation is to provide a toolbox to help criminology experts, which would potentially lead to a better understanding and prediction of the properties to facilitate the decision making process. Our initial validation shows the potential of our method providing relevant and accurate results.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114204400","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}
High quality video delivery over LTE is a challenging issue due to limited radio resources of the LTE base station. This paper presents a study on the dilemma problem for allocating radio resource blocks between video and background flows in the LTE downlink. We propose a new concept called minimum background fairness (MBF) and combine it with our earlier idea called generalized largest weighted delay first (GLWDF) to avoid resource starvation of background traffic while achieving high-quality prioritized services of differentiated video packet types. Our preliminary results show that MBF cannot only guarantee a better minimum level of fairness in resource allocation to background traffic than FLS (a lately new design based on a so-called two-level scheduling), but also achieve video transmission quality gains over all the conventional single-level schedulers as well as FLS. In particular, such performance gains are amplified during medium to heavy congestions.
{"title":"Minimum Background Fairness for Quality Video Delivery over the LTE Downlink","authors":"Wen-Ping Lai, Ching-Hsiang Lin, En-Cheng Liou","doi":"10.1109/INCoS.2015.68","DOIUrl":"https://doi.org/10.1109/INCoS.2015.68","url":null,"abstract":"High quality video delivery over LTE is a challenging issue due to limited radio resources of the LTE base station. This paper presents a study on the dilemma problem for allocating radio resource blocks between video and background flows in the LTE downlink. We propose a new concept called minimum background fairness (MBF) and combine it with our earlier idea called generalized largest weighted delay first (GLWDF) to avoid resource starvation of background traffic while achieving high-quality prioritized services of differentiated video packet types. Our preliminary results show that MBF cannot only guarantee a better minimum level of fairness in resource allocation to background traffic than FLS (a lately new design based on a so-called two-level scheduling), but also achieve video transmission quality gains over all the conventional single-level schedulers as well as FLS. In particular, such performance gains are amplified during medium to heavy congestions.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088436","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 significant environmental changes in the telecommunications market, network failures affect socioeconomic activities more than ever before. In this paper, we investigate the statistical characteristics of interval, duration, and number of users affected for serious network failures, which are defined as network failures that last for more than two hours and affect more than 30,000 users, that occurred in Japan during Japanese fiscal years 2008-2013 (April 2008 to March 2014). The results show that (i) the interval follows a Poisson process, (ii) the duration follows a Pareto distribution, (iii) the number of users affected follows a piecewise Pareto distribution, (iv) the product of duration and number of users affected roughly follows a distribution that can be derived from a convolution of two distributions of duration and number of users affected, (v) the relationship between duration and number of users affected differs from service to service, and (vi) the impact of recent serious network failures is getting more severe.
{"title":"Recent Trends and Some Lessons for Serious Network Failures in Japan","authors":"M. Uchida","doi":"10.1109/INCoS.2015.31","DOIUrl":"https://doi.org/10.1109/INCoS.2015.31","url":null,"abstract":"Due to significant environmental changes in the telecommunications market, network failures affect socioeconomic activities more than ever before. In this paper, we investigate the statistical characteristics of interval, duration, and number of users affected for serious network failures, which are defined as network failures that last for more than two hours and affect more than 30,000 users, that occurred in Japan during Japanese fiscal years 2008-2013 (April 2008 to March 2014). The results show that (i) the interval follows a Poisson process, (ii) the duration follows a Pareto distribution, (iii) the number of users affected follows a piecewise Pareto distribution, (iv) the product of duration and number of users affected roughly follows a distribution that can be derived from a convolution of two distributions of duration and number of users affected, (v) the relationship between duration and number of users affected differs from service to service, and (vi) the impact of recent serious network failures is getting more severe.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115162017","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}
Andreas Mladenow, Christine Bauer, C. Strauss, M. Greguš
As novel forms of crowdsourcing emerge on the market, we emphasize that the important aspect of location-dependency is more complex than assumed and, thus, suggest a typology along two dimensions of locality: the first dimension refers to whether or not the crowdsourcees interact while being collocated or dispersed, the second dimension refers to the locality of the crowdsourcees in relation to the crowdsourcer's locality (local vs. remote crowd). The resulting four types of crowdsourcing are underpinned by real-world examples. Potential advantages and challenges of the four types are discussed, particularly with respect to motivation and value. The suggested categorization shall provide the necessary basis for future research, as a systematic approach is essential to enable, yield and foster sustainability in a novel interdisciplinary research field like location-based crowdsourcing.
{"title":"Collaboration and Locality in Crowdsourcing","authors":"Andreas Mladenow, Christine Bauer, C. Strauss, M. Greguš","doi":"10.1109/INCoS.2015.74","DOIUrl":"https://doi.org/10.1109/INCoS.2015.74","url":null,"abstract":"As novel forms of crowdsourcing emerge on the market, we emphasize that the important aspect of location-dependency is more complex than assumed and, thus, suggest a typology along two dimensions of locality: the first dimension refers to whether or not the crowdsourcees interact while being collocated or dispersed, the second dimension refers to the locality of the crowdsourcees in relation to the crowdsourcer's locality (local vs. remote crowd). The resulting four types of crowdsourcing are underpinned by real-world examples. Potential advantages and challenges of the four types are discussed, particularly with respect to motivation and value. The suggested categorization shall provide the necessary basis for future research, as a systematic approach is essential to enable, yield and foster sustainability in a novel interdisciplinary research field like location-based crowdsourcing.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934290","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}
These years attribute based encryption (ABE) is a very hot research topic for its very flexible control on the encrypted content. Typically, there are three parties in an attribute based encryption system: PKG, User (Decrypter), Encrypter. The PKG (Private Key Generator) is responsible to generate secret keys for the User (Decrypter) according to the attributes (CP-ABE) or the policy (KP-ABE), then the Encrypter encrypts his content according to the policy (KP-ABE) or the attributes (CP-ABE), the User then decrypts the encrypted content using his secret keys. However, all the ABE schemes until now require the exist of PKG to generate secret keys for the User(Decrypter). We observe this i snot the only way to generate the secret keys, the encrypter also has the ability to generate "secret keys" for the User (Decrypter) by using the randomness which used in the encryption. We introduce a new variant of ABE: DO-ABE, which is almost the same as the traditional ABE except the secret keys generated by the encrypter. Compared with ABE, DO-ABE can easily achieve message-level based fine-grained control on the encrypted content, the key-escrow free property, easily message recoverable for the encrypter, while these properties are desirable in practical applications like cloud storage. We give two concrete KP-DO-ABE and CP-DO-ABE schemes, discuss its features compared with the traditional ABE and roughly analysis its security. Finally we conclude our paper with many interesting open problems.
{"title":"Data Owner Based Attribute Based Encryption","authors":"Jindan Zhang, Xu An Wang, Jianfeng Ma","doi":"10.1109/INCoS.2015.42","DOIUrl":"https://doi.org/10.1109/INCoS.2015.42","url":null,"abstract":"These years attribute based encryption (ABE) is a very hot research topic for its very flexible control on the encrypted content. Typically, there are three parties in an attribute based encryption system: PKG, User (Decrypter), Encrypter. The PKG (Private Key Generator) is responsible to generate secret keys for the User (Decrypter) according to the attributes (CP-ABE) or the policy (KP-ABE), then the Encrypter encrypts his content according to the policy (KP-ABE) or the attributes (CP-ABE), the User then decrypts the encrypted content using his secret keys. However, all the ABE schemes until now require the exist of PKG to generate secret keys for the User(Decrypter). We observe this i snot the only way to generate the secret keys, the encrypter also has the ability to generate \"secret keys\" for the User (Decrypter) by using the randomness which used in the encryption. We introduce a new variant of ABE: DO-ABE, which is almost the same as the traditional ABE except the secret keys generated by the encrypter. Compared with ABE, DO-ABE can easily achieve message-level based fine-grained control on the encrypted content, the key-escrow free property, easily message recoverable for the encrypter, while these properties are desirable in practical applications like cloud storage. We give two concrete KP-DO-ABE and CP-DO-ABE schemes, discuss its features compared with the traditional ABE and roughly analysis its security. Finally we conclude our paper with many interesting open problems.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128880837","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
扫码关注我们
求助内容：
应助结果提醒方式：