Data hiding is now becoming most important research area now a day. One efficient binary data hiding technique into a digital image has been proposed in this study. The proposed work focuses on the learning of different edge detection and data hiding techniques and analysis of their relative performances. Work focuses on finding the boundary edges of size of the length of the data to be hided. Sobel, Prewitt, Roberts and Canny edge detection techniques have been used to hide data. Comparison results show Prewitt is a better technique for finding the edges of particular size. Binary data of different size have been hided in edges points to generate the image with hided data. Original data is also extracted from the image with similar approach of hiding. The proposed technique hides data with minimum number of change of bits of the original image (As an example: Twenty bits of data can hide by changing of four bits only). Therefore the proposed approach is most efficient and useful for hiding information.
{"title":"Efficient Binary Data Hiding Technique in Boundary Points","authors":"Subodh Kumar, Sandip Mal","doi":"10.1109/CICT.2016.18","DOIUrl":"https://doi.org/10.1109/CICT.2016.18","url":null,"abstract":"Data hiding is now becoming most important research area now a day. One efficient binary data hiding technique into a digital image has been proposed in this study. The proposed work focuses on the learning of different edge detection and data hiding techniques and analysis of their relative performances. Work focuses on finding the boundary edges of size of the length of the data to be hided. Sobel, Prewitt, Roberts and Canny edge detection techniques have been used to hide data. Comparison results show Prewitt is a better technique for finding the edges of particular size. Binary data of different size have been hided in edges points to generate the image with hided data. Original data is also extracted from the image with similar approach of hiding. The proposed technique hides data with minimum number of change of bits of the original image (As an example: Twenty bits of data can hide by changing of four bits only). Therefore the proposed approach is most efficient and useful for hiding information.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125421355","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}
Now a day's privacy is the main issue to sending information from one point to another in data transmission. Encryption of data is the most effective way of computer science concerned with developing schemes and formula to achieve data & information security. In its course of action, it allows sequence to be encoded in the form of cipher text where it is extremely difficult to read or recognize the codes where decryption is the procedure to transforming encoded text into the original message and information. In this paper we present an algorithm for data encryption and decryption which is based on number theory. In addition, data encryption using strange number system (especially using pentaoctagesimal (SNS) can make available physical or substantial security to information - allowing updating only to authorized users. This algorithm is used pentaoctagesimal strange number system to encrypt data and we propose a better data encryption and decryption strategy, which will offer better security towards all possible ways of attacks while data transmission. In reference to data security, a Turing-Machine is a device based on hypothesis that manages numbers dexterously on stripe of tape according to conditions of the table. In contempt of its simplicity, Turing-Machine can be pertinent at any computer algorithm after simulating the logic that would be useful in illuminating the function of a CPU. In this research-work authors have proposed a notion that takes binary number for a given decimal number and simulate the binary number through Turing-Machine. As a result of which the next number can be generated in binary form. Further if again we calculate the decimal of the obtained binary digits, the resultant decimal number is one more than the previous decimal number. This approach would be helpful to generate next successor decimal number from a given decimal number. Further this approach of number generation through Turing machine would be helpful in cryptographic techniques where, generated number can be applied for data security enhancement at both sender as well as receiver end.
{"title":"Data Security Enhancement Through Number System: A Turing-Machine Approach","authors":"H. Tripathi, Bramah Hazela","doi":"10.1109/CICT.2016.131","DOIUrl":"https://doi.org/10.1109/CICT.2016.131","url":null,"abstract":"Now a day's privacy is the main issue to sending information from one point to another in data transmission. Encryption of data is the most effective way of computer science concerned with developing schemes and formula to achieve data & information security. In its course of action, it allows sequence to be encoded in the form of cipher text where it is extremely difficult to read or recognize the codes where decryption is the procedure to transforming encoded text into the original message and information. In this paper we present an algorithm for data encryption and decryption which is based on number theory. In addition, data encryption using strange number system (especially using pentaoctagesimal (SNS) can make available physical or substantial security to information - allowing updating only to authorized users. This algorithm is used pentaoctagesimal strange number system to encrypt data and we propose a better data encryption and decryption strategy, which will offer better security towards all possible ways of attacks while data transmission. In reference to data security, a Turing-Machine is a device based on hypothesis that manages numbers dexterously on stripe of tape according to conditions of the table. In contempt of its simplicity, Turing-Machine can be pertinent at any computer algorithm after simulating the logic that would be useful in illuminating the function of a CPU. In this research-work authors have proposed a notion that takes binary number for a given decimal number and simulate the binary number through Turing-Machine. As a result of which the next number can be generated in binary form. Further if again we calculate the decimal of the obtained binary digits, the resultant decimal number is one more than the previous decimal number. This approach would be helpful to generate next successor decimal number from a given decimal number. Further this approach of number generation through Turing machine would be helpful in cryptographic techniques where, generated number can be applied for data security enhancement at both sender as well as receiver end.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558152","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}
Classification techniques classify the remotely sensed image by using reflectance properties of pixels. This paper presents a new approach to classify multispectral remotely sensed image. This approach classifies the multispectral image using frequencies of spectral bands' grey level values (DN values) in Histogram. It draws histogram for different spectral bands of the image. Then, it finds and separates the humps in histograms. This approach yields more meaningful classification for multi-modal or bi-modal histograms. It creates 3 potential centroids in each hump for each spectral band. More the number of humps, more would be potential centroids for classification. Different spectral bands have different peaks in their humps of histograms. It reads all the pixels of one peak of one band and draw the local histogram of other bands' grey level values using pixels read. This way, peak of one hump of one band can find corresponding peaks in local histogram and these peaks make a pixel that can be a potential centroid and some of these peak frequencies is the actual frequency of that centroid. Now, I choose extreme left and extreme right grey level values whose frequency is greater than or equal to the average frequency of that hump. As each hump of each spectral band has three grey level values, I can find three centroids for each hump of each spectral band. Duplicate centroids are eliminated from the list of centroids. The rest of the centroids are recursively iterated and centroids with lesser frequencies than the nearby centroids are eliminated. Later, algorithm uses gravitational force to find out two nearby centroids.
{"title":"Image Classification Using Humps of Histogram","authors":"A. Khare","doi":"10.1109/CICT.2016.37","DOIUrl":"https://doi.org/10.1109/CICT.2016.37","url":null,"abstract":"Classification techniques classify the remotely sensed image by using reflectance properties of pixels. This paper presents a new approach to classify multispectral remotely sensed image. This approach classifies the multispectral image using frequencies of spectral bands' grey level values (DN values) in Histogram. It draws histogram for different spectral bands of the image. Then, it finds and separates the humps in histograms. This approach yields more meaningful classification for multi-modal or bi-modal histograms. It creates 3 potential centroids in each hump for each spectral band. More the number of humps, more would be potential centroids for classification. Different spectral bands have different peaks in their humps of histograms. It reads all the pixels of one peak of one band and draw the local histogram of other bands' grey level values using pixels read. This way, peak of one hump of one band can find corresponding peaks in local histogram and these peaks make a pixel that can be a potential centroid and some of these peak frequencies is the actual frequency of that centroid. Now, I choose extreme left and extreme right grey level values whose frequency is greater than or equal to the average frequency of that hump. As each hump of each spectral band has three grey level values, I can find three centroids for each hump of each spectral band. Duplicate centroids are eliminated from the list of centroids. The rest of the centroids are recursively iterated and centroids with lesser frequencies than the nearby centroids are eliminated. Later, algorithm uses gravitational force to find out two nearby centroids.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121318428","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}
In wireless networks, Vehicular Adhoc Network (VANET), is one of most recent research area, which is growing day by day. It is used to provide an efficient Traffic Information System (TIS), Intelligent Transportation System (ITS), and Life Safety. Authentication is an emerging issue for VANET security. There are many authentication schemes which have been proposed for stabilized communication among autonomous entities for efficient, fast, scalable and reliable data transmission. In current scenario, there is not adopted a real-life general solution in the worldwide standard for the autonomous mobile node authentication in VANETs. Here introducing a new efficient secure scheme that is "A Secure Authentication Scheme for VANETs", combination of Group signature and Identity based(ID-based) Signature scheme. The scheme Provides cost effective, highly privacy preserving of user, efficient message authentication and verification than existing system for VANETs. Only Authentic mobile node can enter in secure VANETs system. Group leader Local Authority (LA) can authenticate messages without involvement of concern Central Authority (CA). Malicious mobile node can very easily identify at beginning of joining the system and the system are trusty for all new mobile node to join VANETs. The scheme more suitable for high traffic density area or urban area, performance is more better in highly density traffic area and easy to verification of messages. The new anonymous authentication schemes which are more secure efficient, robust, and scalable for VANET's authentication and provide real-life solution match with the standard.
{"title":"A Novel Secure Authentication Scheme for VANETs","authors":"Dinesh Tiwari, Mayank Bhushan, Ankit Yadav, Suman Jain","doi":"10.1109/CICT.2016.64","DOIUrl":"https://doi.org/10.1109/CICT.2016.64","url":null,"abstract":"In wireless networks, Vehicular Adhoc Network (VANET), is one of most recent research area, which is growing day by day. It is used to provide an efficient Traffic Information System (TIS), Intelligent Transportation System (ITS), and Life Safety. Authentication is an emerging issue for VANET security. There are many authentication schemes which have been proposed for stabilized communication among autonomous entities for efficient, fast, scalable and reliable data transmission. In current scenario, there is not adopted a real-life general solution in the worldwide standard for the autonomous mobile node authentication in VANETs. Here introducing a new efficient secure scheme that is \"A Secure Authentication Scheme for VANETs\", combination of Group signature and Identity based(ID-based) Signature scheme. The scheme Provides cost effective, highly privacy preserving of user, efficient message authentication and verification than existing system for VANETs. Only Authentic mobile node can enter in secure VANETs system. Group leader Local Authority (LA) can authenticate messages without involvement of concern Central Authority (CA). Malicious mobile node can very easily identify at beginning of joining the system and the system are trusty for all new mobile node to join VANETs. The scheme more suitable for high traffic density area or urban area, performance is more better in highly density traffic area and easy to verification of messages. The new anonymous authentication schemes which are more secure efficient, robust, and scalable for VANET's authentication and provide real-life solution match with the standard.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116380761","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 classification of an image scene having multiple class labels produces significant challenge to the researchers. A semantic scene may be described by multiple objects or by multiple classes. For example, a beach scene may also contain mountain or buildings in the background. This research work proposes a multi-label scene classification model by using Binary Relevance (BR) based one-versus-rest Least Squares Twin Support Vector Machine (LSTSVM). Fifteen evaluation metrics have been used to analyze and compare the result of the proposed scene classification model with the six existing multi-label classifiers. Experimental results demonstrate the superiority and usefulness of the proposed model in the classification of multi-label scene over the existing multi-label approaches.
{"title":"A Multilabel Approach Using Binary Relevance and One-versus-Rest Least Squares Twin Support Vector Machine for Scene Classification","authors":"Divya Tomar, Sonali Agarwal","doi":"10.1109/CICT.2016.17","DOIUrl":"https://doi.org/10.1109/CICT.2016.17","url":null,"abstract":"The classification of an image scene having multiple class labels produces significant challenge to the researchers. A semantic scene may be described by multiple objects or by multiple classes. For example, a beach scene may also contain mountain or buildings in the background. This research work proposes a multi-label scene classification model by using Binary Relevance (BR) based one-versus-rest Least Squares Twin Support Vector Machine (LSTSVM). Fifteen evaluation metrics have been used to analyze and compare the result of the proposed scene classification model with the six existing multi-label classifiers. Experimental results demonstrate the superiority and usefulness of the proposed model in the classification of multi-label scene over the existing multi-label approaches.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116519996","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}
In this paper a permanent magnet synchronous generator based wind energy conversion system (WECS) with 2 level back to back converter under normal and fault condition on grid side is studied by using two effective controllers i.e tip speed ratio (TSR) and Fuzzy logic control (FLC) for maximum power extraction. The control schemes are used to track maximum generator power and to protect the wind turbine from damages with the help of machine side converter control. On the grid side the inverter is used to control active and reactive power independently with the control of d-axis and q-axis currents by using vector control theory (VC) with direct power control technique (DPC). Simulation results show the improved performance with FLC strategy compared to TSR contr oller under normal and fault conditions.
{"title":"PMSG Based Wind Energy Conversion System for Maximum Power Extraction","authors":"M. Lakshmi, Y. Babu, P. M. Babu","doi":"10.1109/CICT.2016.78","DOIUrl":"https://doi.org/10.1109/CICT.2016.78","url":null,"abstract":"In this paper a permanent magnet synchronous generator based wind energy conversion system (WECS) with 2 level back to back converter under normal and fault condition on grid side is studied by using two effective controllers i.e tip speed ratio (TSR) and Fuzzy logic control (FLC) for maximum power extraction. The control schemes are used to track maximum generator power and to protect the wind turbine from damages with the help of machine side converter control. On the grid side the inverter is used to control active and reactive power independently with the control of d-axis and q-axis currents by using vector control theory (VC) with direct power control technique (DPC). Simulation results show the improved performance with FLC strategy compared to TSR contr oller under normal and fault conditions.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128452711","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}
Rohan Gupta, V. Tripathi, Kartikeya Singh, Nandish Pathak, Rohit Rastogi
This paper deals with a method of clipping a line segment into a circular window. Its unlike other algorithms, instead of dividing region into segments and generating the corresponding region codes, yields results based their parametric equations which not only yields precise result for each pixel but also compute faster. Its an algorithm that can be embedded in many circular displays in order to save their buffer memory and displaying fast and accurate result on the screen, after that they can be translated and scaled into the required area known as viewport.
{"title":"An Innovative and Easy Approach for Clipping Curves along a Circular Window","authors":"Rohan Gupta, V. Tripathi, Kartikeya Singh, Nandish Pathak, Rohit Rastogi","doi":"10.1109/CICT.2016.132","DOIUrl":"https://doi.org/10.1109/CICT.2016.132","url":null,"abstract":"This paper deals with a method of clipping a line segment into a circular window. Its unlike other algorithms, instead of dividing region into segments and generating the corresponding region codes, yields results based their parametric equations which not only yields precise result for each pixel but also compute faster. Its an algorithm that can be embedded in many circular displays in order to save their buffer memory and displaying fast and accurate result on the screen, after that they can be translated and scaled into the required area known as viewport.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127350205","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}
Sachin Bagga, A. Girdhar, M. Trivedi, Yingzhi Yang
There are number of problems that are so complex/large that it becomes impractical or even in some cases impossible to solve these problems on a single machine. As compared to the serial computation, parallel computation is much result oriented for understanding, simulating of number of complex and real world physical process. The cache oblivious(CO) model helps us in designing the algorithms which are cache alert. Moreover these algorithms will be independent of the given system's cache size. A matrix multiplication based upon the Peano curves helps in designing of the cache oblivious algorithms. The distributed environment is being developed using RMI (Remote Method Invocation). In this setup the Master system will decompose a large size matrix into the smaller (ones depending upon the system available). The slave systems will perform the computations as per the equations based upon space filling Peano curves which are cache oblivious in nature. As a result we are able to reuse the matrix elements again and again which leads to decrease in number of cache misses and increasing the overall execution time of whole cluster. At the master system actual partitioning is done to generate submatrix and the virtual partitioning into size of 3x3 is being done at the slave systems for implementing multiplication based upon Peano curves(PC). PC algorithmic approach provides spatial locality which is a basic requirement for increasing the overall system efficiency.
{"title":"RMI Approach to Cluster Based Cache Oblivious Peano Curves","authors":"Sachin Bagga, A. Girdhar, M. Trivedi, Yingzhi Yang","doi":"10.1109/CICT.2016.26","DOIUrl":"https://doi.org/10.1109/CICT.2016.26","url":null,"abstract":"There are number of problems that are so complex/large that it becomes impractical or even in some cases impossible to solve these problems on a single machine. As compared to the serial computation, parallel computation is much result oriented for understanding, simulating of number of complex and real world physical process. The cache oblivious(CO) model helps us in designing the algorithms which are cache alert. Moreover these algorithms will be independent of the given system's cache size. A matrix multiplication based upon the Peano curves helps in designing of the cache oblivious algorithms. The distributed environment is being developed using RMI (Remote Method Invocation). In this setup the Master system will decompose a large size matrix into the smaller (ones depending upon the system available). The slave systems will perform the computations as per the equations based upon space filling Peano curves which are cache oblivious in nature. As a result we are able to reuse the matrix elements again and again which leads to decrease in number of cache misses and increasing the overall execution time of whole cluster. At the master system actual partitioning is done to generate submatrix and the virtual partitioning into size of 3x3 is being done at the slave systems for implementing multiplication based upon Peano curves(PC). PC algorithmic approach provides spatial locality which is a basic requirement for increasing the overall system efficiency.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134482368","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}
Rijwan Khan, Mohd Amjad, Akhilesh Kumar Srivastava
Software testing is a process for insuring the delivery of an error free software to customers. The success or failure of the software to achieve its desirability is depend on the software testing components. All the software industries spend a lot of their money and time for software testing process. Automatic testing is a key area where cost and time of software testing process has been considerably reduced as compared to manual testing. Path testing is a process of finding all du-path coverage for a given program. In this paper genetic algorithm is used for automatic test cases generation and optimization. The proposed method with genetic algorithm accepts a set of inputs and check of for path coverage.
{"title":"Optimization of Automatic Generated Test Cases for Path Testing Using Genetic Algorithm","authors":"Rijwan Khan, Mohd Amjad, Akhilesh Kumar Srivastava","doi":"10.1109/CICT.2016.16","DOIUrl":"https://doi.org/10.1109/CICT.2016.16","url":null,"abstract":"Software testing is a process for insuring the delivery of an error free software to customers. The success or failure of the software to achieve its desirability is depend on the software testing components. All the software industries spend a lot of their money and time for software testing process. Automatic testing is a key area where cost and time of software testing process has been considerably reduced as compared to manual testing. Path testing is a process of finding all du-path coverage for a given program. In this paper genetic algorithm is used for automatic test cases generation and optimization. The proposed method with genetic algorithm accepts a set of inputs and check of for path coverage.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131164650","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 advances in cloud computing have presented the global vision of utility computing with promising trends to a new world of information and communication technology. The legacy systems built on the obsolete and older technologies are typically addressed for the modification and alteration processed to leverage the benefits of cloud. Migrating to the cloud deployment models and re-engineering the on premises applications are two main issues concerning the cloud computing deployment. It can intensely expand the quality and scope of the software applications for resource provisioning with better efficiency. Instead of opting the traditional way of modifying the entire system in one go, incremental re-engineering of software architecture can lead to a safer and flexible way involving the correction of architectural deviation of legacy systems.
{"title":"Incremental Architectural Re-engineering for the Cloud: An Overview","authors":"Suman Jain, Mayank Bhushan, Ankit Yadav, Dinesh Tiwari","doi":"10.1109/CICT.2016.135","DOIUrl":"https://doi.org/10.1109/CICT.2016.135","url":null,"abstract":"The advances in cloud computing have presented the global vision of utility computing with promising trends to a new world of information and communication technology. The legacy systems built on the obsolete and older technologies are typically addressed for the modification and alteration processed to leverage the benefits of cloud. Migrating to the cloud deployment models and re-engineering the on premises applications are two main issues concerning the cloud computing deployment. It can intensely expand the quality and scope of the software applications for resource provisioning with better efficiency. Instead of opting the traditional way of modifying the entire system in one go, incremental re-engineering of software architecture can lead to a safer and flexible way involving the correction of architectural deviation of legacy systems.","PeriodicalId":118509,"journal":{"name":"2016 Second International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115773753","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
扫码关注我们
求助内容：
应助结果提醒方式：