Pub Date : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703358
Pushkar Pete, Kunal Patange, M. Wankhade, Arpitrama Chatterjee, M. Kurhekar, Krishan Kumar
In Cloud computing era, computing resources are being used on-demand via network. It consumes a huge amount of energy, which does not measure easily with computational use of resources. Therefore, energy consumption in data centers becomes the most essential concern to address. Thus, this model highlights an efficient energy technique to address the concern by migrating the Virtual Machines (VMs) onto the servers appropriately. An algorithm has been proposed to satisfy the user requests by launching the VMs efficiently. A experimental study is made on the total amount of energy saved by our proposed 3E-VMC model against the state-of-the-art techniques. Theoretically, the maximum amount of saved energy estimated by the proposed 3E-VMC model is 75%, while it has been experimentally verified as 54%.
{"title":"3E-VMC: An Experimental Energy Efficient Model for VMs scheduling over Cloud","authors":"Pushkar Pete, Kunal Patange, M. Wankhade, Arpitrama Chatterjee, M. Kurhekar, Krishan Kumar","doi":"10.1109/ICSCCC.2018.8703358","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703358","url":null,"abstract":"In Cloud computing era, computing resources are being used on-demand via network. It consumes a huge amount of energy, which does not measure easily with computational use of resources. Therefore, energy consumption in data centers becomes the most essential concern to address. Thus, this model highlights an efficient energy technique to address the concern by migrating the Virtual Machines (VMs) onto the servers appropriately. An algorithm has been proposed to satisfy the user requests by launching the VMs efficiently. A experimental study is made on the total amount of energy saved by our proposed 3E-VMC model against the state-of-the-art techniques. Theoretically, the maximum amount of saved energy estimated by the proposed 3E-VMC model is 75%, while it has been experimentally verified as 54%.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900281","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 : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703314
Atul Oak, R. Daruwala
Internet of Things - IoT is a data communication network used to share information between two devices. IoT is considered as a layered system with different protocols used to communicate information than the traditional internet. Message Queue Telemetry and Transport (MQTT) is one of the most common application layer protocols used for sharing information in IoT applications. MQTT protocol does not have any inbuilt mechanism to secure the information that is communicated between the two devices. MQTT protocol depends on lower layers for the security of information that is communicated. Our research aims at improving the security feature of MQTT protocol. Some experimental part of our research is been presented in this paper to measure the performance of MQTT protocol with standard encryption algorithms.
{"title":"Assessment of Message Queue Telemetry and Transport (MQTT) protocol with Symmetric Encryption","authors":"Atul Oak, R. Daruwala","doi":"10.1109/ICSCCC.2018.8703314","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703314","url":null,"abstract":"Internet of Things - IoT is a data communication network used to share information between two devices. IoT is considered as a layered system with different protocols used to communicate information than the traditional internet. Message Queue Telemetry and Transport (MQTT) is one of the most common application layer protocols used for sharing information in IoT applications. MQTT protocol does not have any inbuilt mechanism to secure the information that is communicated between the two devices. MQTT protocol depends on lower layers for the security of information that is communicated. Our research aims at improving the security feature of MQTT protocol. Some experimental part of our research is been presented in this paper to measure the performance of MQTT protocol with standard encryption algorithms.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116436405","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 : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703315
Pavitdeep Singh, M. Bhamrah, Jatinder Kaur
Software requirements gathering and selection is primarily the first and most important step during in the development of a software product. These new set of requirements drives the next set of functionalities/ features for the product. However, there is always a necessity to select the right set of requirement which fulfills the customer satisfaction and deliver these changes within the defined budget limits. The complexity of selecting the new requirements increases with the inter-dependency of various requirements defined. In this paper, we use a Jaya based optimization technique using weighted sum approach to solve the multi-objective next release problem (MONRP). In this approach, classic bi-objective NRP comprising the conflicting objectives e.g. maximizing global satisfaction and minimizing the cost (total development effort) are reduced to single objective by assigning different weights to each objective. The proposed technique has been successfully applied to a public dataset instance provided in various literature of NRP. The simulation results are compared with various well known variants of GDE3 algorithm for solution accuracy.
{"title":"Jaya algorithm using weighted sum approach for the multi-objective next release problem","authors":"Pavitdeep Singh, M. Bhamrah, Jatinder Kaur","doi":"10.1109/ICSCCC.2018.8703315","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703315","url":null,"abstract":"Software requirements gathering and selection is primarily the first and most important step during in the development of a software product. These new set of requirements drives the next set of functionalities/ features for the product. However, there is always a necessity to select the right set of requirement which fulfills the customer satisfaction and deliver these changes within the defined budget limits. The complexity of selecting the new requirements increases with the inter-dependency of various requirements defined. In this paper, we use a Jaya based optimization technique using weighted sum approach to solve the multi-objective next release problem (MONRP). In this approach, classic bi-objective NRP comprising the conflicting objectives e.g. maximizing global satisfaction and minimizing the cost (total development effort) are reduced to single objective by assigning different weights to each objective. The proposed technique has been successfully applied to a public dataset instance provided in various literature of NRP. The simulation results are compared with various well known variants of GDE3 algorithm for solution accuracy.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131599553","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 : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703271
R. Mittal, M. Bhatia
Nowadays many biological problems are structured in the form of networks called biological networks. Formation of such large networks helps us in analyzing biological systems extensively and effectively. Although the size and structure of biological networks are very complex and it is difficult to interpret such networks without further processing. In this paper, we discuss the analysis of such systems by forming clusters and analyze the whole arrangement using different types of clusters formed in the network. A cluster is a highly connected group of nodes of the net and cluster analysis is one of the prominent features used for the analysis of the biological systems. Here, we present our study by applying some popular clustering algorithms on multi-layer biological networks to see the changes in the shape, size, and structure of the clusters when multiple interactions among biological entities are included and the behavior of objects in such networks.
{"title":"Analyzing the Structures of Clusters in Multi-layer Biological Networks","authors":"R. Mittal, M. Bhatia","doi":"10.1109/ICSCCC.2018.8703271","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703271","url":null,"abstract":"Nowadays many biological problems are structured in the form of networks called biological networks. Formation of such large networks helps us in analyzing biological systems extensively and effectively. Although the size and structure of biological networks are very complex and it is difficult to interpret such networks without further processing. In this paper, we discuss the analysis of such systems by forming clusters and analyze the whole arrangement using different types of clusters formed in the network. A cluster is a highly connected group of nodes of the net and cluster analysis is one of the prominent features used for the analysis of the biological systems. Here, we present our study by applying some popular clustering algorithms on multi-layer biological networks to see the changes in the shape, size, and structure of the clusters when multiple interactions among biological entities are included and the behavior of objects in such networks.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128785789","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 : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703329
Nishtha Arora, G. Gabrani
The field of Social Computing has tremendous potential to explore the value within the data generated from various social media platforms like Facebook, Instagram, Twitter, Snapchat, LinkedIn etc. Due to the growing volume of this data, it has become difficult to gain insights with the help of traditional techniques. So machine learning techniques have become the bread and butter of researchers working in this area as they can be used to analyze large volumes of data. The purpose of this paper is to get introduced to some important research problems in the area of social computing, the machine learning and statistical methods adopted by the researchers worldwide to address those problems and the research gaps that still need to be addressed. It also emphasizes on an important problem on Twitter platform: The classification of a tweet as fake or real.
{"title":"Significant Machine Learning and Statistical Concepts and their Applications in Social Computing","authors":"Nishtha Arora, G. Gabrani","doi":"10.1109/ICSCCC.2018.8703329","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703329","url":null,"abstract":"The field of Social Computing has tremendous potential to explore the value within the data generated from various social media platforms like Facebook, Instagram, Twitter, Snapchat, LinkedIn etc. Due to the growing volume of this data, it has become difficult to gain insights with the help of traditional techniques. So machine learning techniques have become the bread and butter of researchers working in this area as they can be used to analyze large volumes of data. The purpose of this paper is to get introduced to some important research problems in the area of social computing, the machine learning and statistical methods adopted by the researchers worldwide to address those problems and the research gaps that still need to be addressed. It also emphasizes on an important problem on Twitter platform: The classification of a tweet as fake or real.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125525313","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 : 2018-12-01DOI: 10.1109/ICSCCC.2018.8703306
Neetika Soni, I. Saini, Butta Singh
In the era of e-healthcare paradigm, the demand of storage memory has increased manifolds. In order to combat with the bourgeoning memory and bandwidth requirements, compression techniques are employed. In this paper, Discrete Cosine Transform based lossless ECG compression approach is proposed. The method exploits only the non-QRS regions of ECG signal for compression and hence avoids any distortion in its clinically significant features. Moreover, in this approach the chaotically selected DCT coefficients are employed for compression. Therefore at receiver, only the users having the correct key can decompress the signal. The proposed method is applied on all 48 records of MIT-BIH arrhythmia database of 2 mins duration with different compression rates and evaluated the performance in terms of PRD and CR. The comparison is made with the state of the art techniques in terms of quality score and found that the proposed method yields excellent results.
{"title":"Morphologically Robust Discrete Cosine Transform based Lossless ECG Compression with Access Control Quality","authors":"Neetika Soni, I. Saini, Butta Singh","doi":"10.1109/ICSCCC.2018.8703306","DOIUrl":"https://doi.org/10.1109/ICSCCC.2018.8703306","url":null,"abstract":"In the era of e-healthcare paradigm, the demand of storage memory has increased manifolds. In order to combat with the bourgeoning memory and bandwidth requirements, compression techniques are employed. In this paper, Discrete Cosine Transform based lossless ECG compression approach is proposed. The method exploits only the non-QRS regions of ECG signal for compression and hence avoids any distortion in its clinically significant features. Moreover, in this approach the chaotically selected DCT coefficients are employed for compression. Therefore at receiver, only the users having the correct key can decompress the signal. The proposed method is applied on all 48 records of MIT-BIH arrhythmia database of 2 mins duration with different compression rates and evaluated the performance in terms of PRD and CR. The comparison is made with the state of the art techniques in terms of quality score and found that the proposed method yields excellent results.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129577239","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 : 2018-12-01DOI: 10.1109/icsccc.2018.8703288
{"title":"ICSCCC 2018 Copyright Page","authors":"","doi":"10.1109/icsccc.2018.8703288","DOIUrl":"https://doi.org/10.1109/icsccc.2018.8703288","url":null,"abstract":"","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126047354","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
扫码关注我们
求助内容：
应助结果提醒方式：