Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398118
A. Mishra, K. Garg, Abhijit R. Asati, Kota Solomon Raju
The digital system design process can be accelerated by concurrent design of hardware and software. This process requires the migration of functions that are computational extensive to hardware. This paper presents a framework for identifying such functions by proposing an algorithm. The framework uses the time profiling and clustering technique to achieve the objectives. Open source spark compiler has been used to convert functions to hardware description language The final interfacing has been done in embedded development kit.
{"title":"Hardware software co-design using profiling and clustering","authors":"A. Mishra, K. Garg, Abhijit R. Asati, Kota Solomon Raju","doi":"10.1109/ICCICT.2012.6398118","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398118","url":null,"abstract":"The digital system design process can be accelerated by concurrent design of hardware and software. This process requires the migration of functions that are computational extensive to hardware. This paper presents a framework for identifying such functions by proposing an algorithm. The framework uses the time profiling and clustering technique to achieve the objectives. Open source spark compiler has been used to convert functions to hardware description language The final interfacing has been done in embedded development kit.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060923","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398176
H. B. Kekre, T. Sarode, F. Ansari
In recent years image processing tools and techniques are gaining continuous attention and recognition due to augmented usage of still and motion images in vivid fields like medical science, engineering, mass-media and GIS. Special category of image processing technique called “Image Classification” has got pivotal position in all the above said fields. An image classifier is a system which accepts query image as an input in part or whole form associates it with one of the stored classes and returns its class label/number as an output. Image classification helps in managing large amount of image data and easy retrieval of image(s) of interest using some kind of similarity measures like Euclidean Distance(Ed), Mean Square Error (MSE) etc. This paper presents broadly used image classification technique using the concept of feature vectors of partial coefficients using Discrete Cosine, Walsh and Haar and Hartley transforms. Partial coefficients of sizes 8×8, 16×16, 32×32 and 64×64 are used. Euclidian distance and MSE are used for similarity measures. The system uses two databases of 500 images each spread over 10 different categories. The results of various transforms on original and the portions of images are compared.
{"title":"Performance evaluation of DCT, Walsh, Haar and Hartley transforms on whole images and partial coefficients in Image Classification","authors":"H. B. Kekre, T. Sarode, F. Ansari","doi":"10.1109/ICCICT.2012.6398176","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398176","url":null,"abstract":"In recent years image processing tools and techniques are gaining continuous attention and recognition due to augmented usage of still and motion images in vivid fields like medical science, engineering, mass-media and GIS. Special category of image processing technique called “Image Classification” has got pivotal position in all the above said fields. An image classifier is a system which accepts query image as an input in part or whole form associates it with one of the stored classes and returns its class label/number as an output. Image classification helps in managing large amount of image data and easy retrieval of image(s) of interest using some kind of similarity measures like Euclidean Distance(Ed), Mean Square Error (MSE) etc. This paper presents broadly used image classification technique using the concept of feature vectors of partial coefficients using Discrete Cosine, Walsh and Haar and Hartley transforms. Partial coefficients of sizes 8×8, 16×16, 32×32 and 64×64 are used. Euclidian distance and MSE are used for similarity measures. The system uses two databases of 500 images each spread over 10 different categories. The results of various transforms on original and the portions of images are compared.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"39 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123180771","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398104
S. Kansal, A. Makhal, P. Chakraborty, G. Nandi
In this paper we designed an experimental setup in order to have human-robot interaction i.e. first we are going to detect the face and after that we recognise the detected face. Afterwards we get the persons upper body torso color as a key feature. As we extracted the color feature we can compute the moments and also evaluate the motion parameters so that the surveillance robot can track the person accordingly. We also had introduced Speech module in order to have a interaction between the remote and base station. Surveillance robot must track the targeted person in a robust manner in indoor and outdoor environment in different light and dynamic varying conditions. In our proposed setup we use PCA which is going to recognise the person in a real time environment and should communicate to the person via speech module deployed in the surveillance robot, as face recognition works on real time environment we are getting average recognition rate of 98%. Experiment demonstration validates the efficient performance of the approach.
{"title":"Tracking of a target person using face recognition by surveillance robot","authors":"S. Kansal, A. Makhal, P. Chakraborty, G. Nandi","doi":"10.1109/ICCICT.2012.6398104","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398104","url":null,"abstract":"In this paper we designed an experimental setup in order to have human-robot interaction i.e. first we are going to detect the face and after that we recognise the detected face. Afterwards we get the persons upper body torso color as a key feature. As we extracted the color feature we can compute the moments and also evaluate the motion parameters so that the surveillance robot can track the person accordingly. We also had introduced Speech module in order to have a interaction between the remote and base station. Surveillance robot must track the targeted person in a robust manner in indoor and outdoor environment in different light and dynamic varying conditions. In our proposed setup we use PCA which is going to recognise the person in a real time environment and should communicate to the person via speech module deployed in the surveillance robot, as face recognition works on real time environment we are getting average recognition rate of 98%. Experiment demonstration validates the efficient performance of the approach.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122551515","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398232
D. Patil, Sudhir N. Dhage
Congestion in Wireless Sensor Network (WSN) occurs when traffic load allocated to any sensor node is beyond its capacity. It is necessary to control the congestion traffic to support traditional quality of service (such as packet loss ratios, packet delay, wasting energy and throughput) especially, multimedia application of Wireless Multimedia Sensor Network (WMSN). Congestion control in WSN has been shown to be very effective with respect to extending lifespan of system. Hence to avoid the congestion in WSN, we proposed an efficient protocol called Priority-based Congestion Control Protocol (PCCP) which prevents an upstream congestion in WSN. The PCCP creates priority table based an importance of each node, and then sends this information to all the nodes within the network. Secondly, the major function of PCCP is to measure congestion level in the network using ratio of packet inter-arrival time along over packet service time. PCCP uses to control upstream congestion along with congestion degree and packet table. PCCP is hop-by-hop upstream congestion control protocol for WSN. PCCP provides work for packet-based computation to optimize congestion control. It can work under both single path & multipath routing. PCCP ensures guarantee of packet loss as well as delay, resulting each node can avoid unfairness and achieve flexible throughput. In this paper, we have proposed that PCCP provides better QoS by controlling network recourse management and network traffic to consuming efficient energy.
{"title":"Priority-based Congestion Control Protocol (PCCP) for controlling upstream congestion in Wireless Sensor Network","authors":"D. Patil, Sudhir N. Dhage","doi":"10.1109/ICCICT.2012.6398232","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398232","url":null,"abstract":"Congestion in Wireless Sensor Network (WSN) occurs when traffic load allocated to any sensor node is beyond its capacity. It is necessary to control the congestion traffic to support traditional quality of service (such as packet loss ratios, packet delay, wasting energy and throughput) especially, multimedia application of Wireless Multimedia Sensor Network (WMSN). Congestion control in WSN has been shown to be very effective with respect to extending lifespan of system. Hence to avoid the congestion in WSN, we proposed an efficient protocol called Priority-based Congestion Control Protocol (PCCP) which prevents an upstream congestion in WSN. The PCCP creates priority table based an importance of each node, and then sends this information to all the nodes within the network. Secondly, the major function of PCCP is to measure congestion level in the network using ratio of packet inter-arrival time along over packet service time. PCCP uses to control upstream congestion along with congestion degree and packet table. PCCP is hop-by-hop upstream congestion control protocol for WSN. PCCP provides work for packet-based computation to optimize congestion control. It can work under both single path & multipath routing. PCCP ensures guarantee of packet loss as well as delay, resulting each node can avoid unfairness and achieve flexible throughput. In this paper, we have proposed that PCCP provides better QoS by controlling network recourse management and network traffic to consuming efficient energy.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116154332","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398213
A. Hegde, D. Kumar, G. Srinivasa
This paper presents a method for the automated insertion of virtual advertisements (logos, messages, etc.) into videos. The method consists of detecting regular polygons from the edge maps of frames in a video. This is followed by the selection of an optimal candidate slot into which the desired advertisement is inserted. Experimental results demonstrate that the contour-tracing based rectangle detection algorithm presented in this paper outperforms its precedents such as the Hough Transform and ant-based polygon detection for the purposes of identifying appropriate slots for introducing content in videos.
{"title":"Contour-traversal based algorithm for insertion of virtual advertisements in videos","authors":"A. Hegde, D. Kumar, G. Srinivasa","doi":"10.1109/ICCICT.2012.6398213","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398213","url":null,"abstract":"This paper presents a method for the automated insertion of virtual advertisements (logos, messages, etc.) into videos. The method consists of detecting regular polygons from the edge maps of frames in a video. This is followed by the selection of an optimal candidate slot into which the desired advertisement is inserted. Experimental results demonstrate that the contour-tracing based rectangle detection algorithm presented in this paper outperforms its precedents such as the Hough Transform and ant-based polygon detection for the purposes of identifying appropriate slots for introducing content in videos.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615465","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398225
H. B. Kekre, T. Sarode, R. Dhannawat
Image fusion combines several images of same object or scene so that the final output image contains more information. The main requirement of the fusion process is to identify the most significant features in the input images and to transfer them without loss into the fused image. This paper proposes four new techniques for image fusion using Kekre's hybrid wavelet transform techniques and compare them. Hybrid matrices are generated using combination of various matrices like DCT, Hadamard and Kekre's Transform. The main advantage of these transform matrices is that it can be of any size N×N, which need not to be an integer power of 2.
{"title":"Image fusion using Kekre's hybrid wavelet transform","authors":"H. B. Kekre, T. Sarode, R. Dhannawat","doi":"10.1109/ICCICT.2012.6398225","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398225","url":null,"abstract":"Image fusion combines several images of same object or scene so that the final output image contains more information. The main requirement of the fusion process is to identify the most significant features in the input images and to transfer them without loss into the fused image. This paper proposes four new techniques for image fusion using Kekre's hybrid wavelet transform techniques and compare them. Hybrid matrices are generated using combination of various matrices like DCT, Hadamard and Kekre's Transform. The main advantage of these transform matrices is that it can be of any size N×N, which need not to be an integer power of 2.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121841292","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398211
P. Patil, D. D. Shah
The indoor infrared wireless communication has been introduced a new dimension for short range wireless communication. The modulation schemes play an important role during IR channel modeling. The modulation schemes enumerate the harshness of multipath ISI. This paper described and analyzed the various modulations schemes such as on-off-keying(OOK), pulse amplitude modulation (PAM) and pulse position modulation (PPM) and multilevel pulse amplitude and pulse position modulation (PAPM) for the performance measure of Non directed indoor IR channel. It performed the simulation analysis by taking into account the bit error rate (BER) . A fixed rectangular empty room with certain transmitter and receiver geometry was considered during the simulation.
{"title":"Nondirected indoor infrared wireless channel modeling using modulation schemes","authors":"P. Patil, D. D. Shah","doi":"10.1109/ICCICT.2012.6398211","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398211","url":null,"abstract":"The indoor infrared wireless communication has been introduced a new dimension for short range wireless communication. The modulation schemes play an important role during IR channel modeling. The modulation schemes enumerate the harshness of multipath ISI. This paper described and analyzed the various modulations schemes such as on-off-keying(OOK), pulse amplitude modulation (PAM) and pulse position modulation (PPM) and multilevel pulse amplitude and pulse position modulation (PAPM) for the performance measure of Non directed indoor IR channel. It performed the simulation analysis by taking into account the bit error rate (BER) . A fixed rectangular empty room with certain transmitter and receiver geometry was considered during the simulation.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134619375","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398170
N. Agarwal, S. Nema
The next-generation wireless systems are required to have high voice quality as compared to current cellular Mobile radio standards and provide high bit rate data services. The fundamental phenomenon which makes reliable wireless transmission difficult is time-varying multipath fading. In most scattering environments; antenna diversity is a practical, effective and, a widely applied technique for reducing the effect of multipath fading. Diversity techniques are mostly used in base stations to improve their reception quality. Hence transmit diversity schemes are very attractive. In this scheme, copies of the same symbol are transmitted through multiple antennas at different times, hence creating an artificial multipath distortion. A maximum likelihood sequence estimator (MLSE) or a minimum mean squared error (MMSE) equalizer is then used to resolve multipath distortion and obtain diversity gain. This paper presents performance analysis of the Alamouti (two-branch transmit diversity) scheme which provides the same diversity order as maximal-ratio receiver combining (MRC) with one transmit antenna, and two receive antennas. It is shown that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The digital modulation techniques employed in this work are BPSK and different orders of QAM.
{"title":"Performance analysis of Alamouti scheme in Rayleigh channel","authors":"N. Agarwal, S. Nema","doi":"10.1109/ICCICT.2012.6398170","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398170","url":null,"abstract":"The next-generation wireless systems are required to have high voice quality as compared to current cellular Mobile radio standards and provide high bit rate data services. The fundamental phenomenon which makes reliable wireless transmission difficult is time-varying multipath fading. In most scattering environments; antenna diversity is a practical, effective and, a widely applied technique for reducing the effect of multipath fading. Diversity techniques are mostly used in base stations to improve their reception quality. Hence transmit diversity schemes are very attractive. In this scheme, copies of the same symbol are transmitted through multiple antennas at different times, hence creating an artificial multipath distortion. A maximum likelihood sequence estimator (MLSE) or a minimum mean squared error (MMSE) equalizer is then used to resolve multipath distortion and obtain diversity gain. This paper presents performance analysis of the Alamouti (two-branch transmit diversity) scheme which provides the same diversity order as maximal-ratio receiver combining (MRC) with one transmit antenna, and two receive antennas. It is shown that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The digital modulation techniques employed in this work are BPSK and different orders of QAM.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114815612","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398106
A. Tayade, L. Ragha
The widespread popularity of Optimization Algorithm in many fields such as Optimization, Pattern Recognition, Feature Extraction, Feature Selection etc. is mainly due to their ability to solve optimization problems in path planning. Out of many kinds of optimization algorithms, Ant Colony Optimization Algorithm is one of the most popular optimization algorithms. Many algorithms that dynamically construct solution to Ant Colony Optimization have increased in recent years. Several ant colony optimization algorithms present a promising performance on combinatorial optimization problem. Among them, Max Min Ant System performs comparatively better for Travelling Salesman Problem as compared to Ant System and Ant Colony System. A method is proposed for Classification using Ant Colony Optimizer as an Adaptive Classifier. The Classifier using ACO may give more efficient and effective method for classification in the adaptive environment.
{"title":"Ant Colony Optimizer as an Adaptive Classifier","authors":"A. Tayade, L. Ragha","doi":"10.1109/ICCICT.2012.6398106","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398106","url":null,"abstract":"The widespread popularity of Optimization Algorithm in many fields such as Optimization, Pattern Recognition, Feature Extraction, Feature Selection etc. is mainly due to their ability to solve optimization problems in path planning. Out of many kinds of optimization algorithms, Ant Colony Optimization Algorithm is one of the most popular optimization algorithms. Many algorithms that dynamically construct solution to Ant Colony Optimization have increased in recent years. Several ant colony optimization algorithms present a promising performance on combinatorial optimization problem. Among them, Max Min Ant System performs comparatively better for Travelling Salesman Problem as compared to Ant System and Ant Colony System. A method is proposed for Classification using Ant Colony Optimizer as an Adaptive Classifier. The Classifier using ACO may give more efficient and effective method for classification in the adaptive environment.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115435996","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398163
R. Shaikh, M. Sasikumar
Cloud Computing is a style of computing over the internet. It has a significant potential impact on every aspect of IT. The elastic nature of cloud makes it suitable for many types of organization. There are lots of benefits in moving towards the cloud. Along with the benefits, it also suffers from various obstacles that act as a barrier in its growth. Various obstacles are identified one of which is security of data and applications. Security concerns in cloud computing is an active area of research and experimentation. Many security solutions are identified and many are evolving. Trust is also identified as one of the solutions for providing security and selecting a particular service. Various trust solution are existing for many collaborative environments. We are focusing on trust based solution for achieving security in cloud computing. A trust framework is proposed that calculates the trust value. A trust value acts as a means for selecting any cloud service, providing a security strength evaluator for service provider and users in a cloud computing environment.
{"title":"Trust framework for calculating security strength of a cloud service","authors":"R. Shaikh, M. Sasikumar","doi":"10.1109/ICCICT.2012.6398163","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398163","url":null,"abstract":"Cloud Computing is a style of computing over the internet. It has a significant potential impact on every aspect of IT. The elastic nature of cloud makes it suitable for many types of organization. There are lots of benefits in moving towards the cloud. Along with the benefits, it also suffers from various obstacles that act as a barrier in its growth. Various obstacles are identified one of which is security of data and applications. Security concerns in cloud computing is an active area of research and experimentation. Many security solutions are identified and many are evolving. Trust is also identified as one of the solutions for providing security and selecting a particular service. Various trust solution are existing for many collaborative environments. We are focusing on trust based solution for achieving security in cloud computing. A trust framework is proposed that calculates the trust value. A trust value acts as a means for selecting any cloud service, providing a security strength evaluator for service provider and users in a cloud computing environment.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121655335","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
扫码关注我们
求助内容：
应助结果提醒方式：