Pub Date : 2014-01-14DOI: 10.14419/JACST.V3I1.1805
A. Koutsoudis, F. Arnaoutoglou, G. Pavlidis
The idea of enriching a cultural heritage visitor’s experience by employing mobile devices such as smartphones and tablets is an active research domain. This is mainly due to the worldwide user penetration of such devices along with their continuous hardware performance enhancement. This work presents the experience and feedback gained by one year of operation of an experimental information system that aims in enhancing the experience of a visitor on his/her demand. The evaluated system is based on the use case-scenario where the a mobile device is used to capture and decode passive markers (such as QR-codes) that are located on facades of selected important buildings in the old town of Xanthi, Greece, in order to enrich the visitor’s experience through a broad context of historical and architectural information delivered over the Web.
{"title":"Passive markers as a low-cost method of enriching cultural visits on user's demand","authors":"A. Koutsoudis, F. Arnaoutoglou, G. Pavlidis","doi":"10.14419/JACST.V3I1.1805","DOIUrl":"https://doi.org/10.14419/JACST.V3I1.1805","url":null,"abstract":"The idea of enriching a cultural heritage visitor’s experience by employing mobile devices such as smartphones and tablets is an active research domain. This is mainly due to the worldwide user penetration of such devices along with their continuous hardware performance enhancement. This work presents the experience and feedback gained by one year of operation of an experimental information system that aims in enhancing the experience of a visitor on his/her demand. The evaluated system is based on the use case-scenario where the a mobile device is used to capture and decode passive markers (such as QR-codes) that are located on facades of selected important buildings in the old town of Xanthi, Greece, in order to enrich the visitor’s experience through a broad context of historical and architectural information delivered over the Web.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127537743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-14DOI: 10.14419/JACST.V3I1.1583
S. Kalantary, Sara Taghipour
With the recent technological advances in wireless communications, integrated digital circuits, and micro electro mechanical systems (MEMS); development of wireless sensor networks has been enabled and become dramatically feasible. Wireless sensor networks (WSNs) are large networks made of a numerous number of sensor nodes with sensing, computation, and wireless communications capabilities. Many various routing, power management, and data dissemination protocols have been designed for wireless sensor networks (WSNs) dependent on both the network architecture and the applications that it is designed for. In this paper, we present the state of the art of wireless sensor networks' architecture and design features. Also, in this paper, we introduce recent work on routing protocols for WSNs and their design goals and challenges. Also, an overview of the application that WSNs assist in is presented. Finally, several open research questions of wireless sensor networks management and issues are suggested and put forward.
{"title":"A survey on architectures, protocols, applications, and management in wireless sensor networks","authors":"S. Kalantary, Sara Taghipour","doi":"10.14419/JACST.V3I1.1583","DOIUrl":"https://doi.org/10.14419/JACST.V3I1.1583","url":null,"abstract":"With the recent technological advances in wireless communications, integrated digital circuits, and micro electro mechanical systems (MEMS); development of wireless sensor networks has been enabled and become dramatically feasible. Wireless sensor networks (WSNs) are large networks made of a numerous number of sensor nodes with sensing, computation, and wireless communications capabilities. Many various routing, power management, and data dissemination protocols have been designed for wireless sensor networks (WSNs) dependent on both the network architecture and the applications that it is designed for. In this paper, we present the state of the art of wireless sensor networks' architecture and design features. Also, in this paper, we introduce recent work on routing protocols for WSNs and their design goals and challenges. Also, an overview of the application that WSNs assist in is presented. Finally, several open research questions of wireless sensor networks management and issues are suggested and put forward.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129113306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-14DOI: 10.14419/JACST.V3I1.1783
O. N. Almasi, Ali Ahmadi Naghedi, Ebrahim Tadayoni, A. Zare
Designing an optimal Takagi–Sugeno (T–S) fuzzy system for real–world non–linear control problems is a challenging problem. Complex non–linear system produces large fuzzy rule–based and requires large amount of memory. To overcome these problems, this paper proposes a hybrid approach to generate the optimal T–S fuzzy system. First, the Fuzzy Clustering Method (FCM) is employed to partitioning the input space and extracting initial fuzzy rule–based. Moreover, a new Adaptive Particle Swarm Optimization (APSO) technique is suggested to determine the optimal number of clusters in FCM, which is the same as the number of fuzzy rules. Finally, Recursive Least Square (RLS) method based on the Mean Square Errors (MSE) criterion is used to regulate the coefficients of the consequent part of initial fuzzy rules. Some simulations are conducted on a Non–Linear Inverted Pendulum (NLIP) system to support the efficiency of the proposed approach in designing compact and accurate T–S fuzzy systems.
{"title":"Optimal design of T-S fuzzy controller for a nonlinear system using a new adaptive particle swarm optimization algorithm","authors":"O. N. Almasi, Ali Ahmadi Naghedi, Ebrahim Tadayoni, A. Zare","doi":"10.14419/JACST.V3I1.1783","DOIUrl":"https://doi.org/10.14419/JACST.V3I1.1783","url":null,"abstract":"Designing an optimal Takagi–Sugeno (T–S) fuzzy system for real–world non–linear control problems is a challenging problem. Complex non–linear system produces large fuzzy rule–based and requires large amount of memory. To overcome these problems, this paper proposes a hybrid approach to generate the optimal T–S fuzzy system. First, the Fuzzy Clustering Method (FCM) is employed to partitioning the input space and extracting initial fuzzy rule–based. Moreover, a new Adaptive Particle Swarm Optimization (APSO) technique is suggested to determine the optimal number of clusters in FCM, which is the same as the number of fuzzy rules. Finally, Recursive Least Square (RLS) method based on the Mean Square Errors (MSE) criterion is used to regulate the coefficients of the consequent part of initial fuzzy rules. Some simulations are conducted on a Non–Linear Inverted Pendulum (NLIP) system to support the efficiency of the proposed approach in designing compact and accurate T–S fuzzy systems.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121198449","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 : 2013-12-14DOI: 10.26483/IJARCS.V4I10.1886
M. G. Duaimi, Yasir Abd Alhamed
With the growing number of XML documents on the Web it becomes essential to effectively organize these XML documents in order to retrieve useful information from them. A possible solution is to apply clustering on the XML documents to discover knowledge that promotes effective data management, information retrieval and query processing. This paper presents a framework for clustering XML documents by structure. Modelling the XML documents as rooted ordered labeled trees, we study the usage of structural distance metrics in hierarchical clustering algorithms to detect groups of structurally similar XML documents. We suggest the usage of structural summaries for trees to improve the performance of the distance calculation and at the same time to maintain or even improve its quality.
{"title":"Mining XML Document Based on Structure","authors":"M. G. Duaimi, Yasir Abd Alhamed","doi":"10.26483/IJARCS.V4I10.1886","DOIUrl":"https://doi.org/10.26483/IJARCS.V4I10.1886","url":null,"abstract":"With the growing number of XML documents on the Web it becomes essential to effectively organize these XML documents in order to retrieve useful information from them. A possible solution is to apply clustering on the XML documents to discover knowledge that promotes effective data management, information retrieval and query processing. This paper presents a framework for clustering XML documents by structure. Modelling the XML documents as rooted ordered labeled trees, we study the usage of structural distance metrics in hierarchical clustering algorithms to detect groups of structurally similar XML documents. We suggest the usage of structural summaries for trees to improve the performance of the distance calculation and at the same time to maintain or even improve its quality.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124698409","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}
To automate the process of forming the baseline data pre-processing software package block PRESS 3D URAL [1], designed to solve engineering problems of Mining Geomechanics encouraged to use triangulation objects 2D space mining plans and their subsequent transformation into a 3D computational model.
自动化过程形成基线数据预处理软件包block PRESS 3D URAL[1]，旨在解决采矿地质力学工程问题，鼓励使用三角测量对象进行二维空间采矿计划并随后将其转换为三维计算模型。
{"title":"Automation of the interpolation of pre-processor basic data for program complex “press 3D URAL”","authors":"I. Brigadnov, D. Sidorov, S. Mozer","doi":"10.14419/JACST.V2I2.718","DOIUrl":"https://doi.org/10.14419/JACST.V2I2.718","url":null,"abstract":"To automate the process of forming the baseline data pre-processing software package block PRESS 3D URAL [1], designed to solve engineering problems of Mining Geomechanics encouraged to use triangulation objects 2D space mining plans and their subsequent transformation into a 3D computational model.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128417275","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 : 2013-03-22DOI: 10.14419/JACST.V2I2.1194
Behnaz Naghash Almasi, O. N. Almasi, M. Kavousi, Amirhossein Sharifinia
Diabetes incidence is one of the most serious health challenges in both industrial and developing countries; however, it is for sure that the early detection and accurate diagnosis of this disease can decrease the risk of affiliation to other relevant disease in diabetes patients. Because of the effective classification and high diagnostic capability, expert systems and machine learning techniques are now gaining popularity in this field. In this study, Least square support vector machine (LS-SVM) was used for diabetes diagnosis. The effectiveness of the LS-SVM is examined on Pima Indian diabetes dataset using k-fold cross validation method. Compared to thirteen well-known methods for the diabetes diagnosis in the literature, the study results showed the effectiveness of the proposed method.
{"title":"Computer-aided diagnosis of diabetes using least square support vector machine","authors":"Behnaz Naghash Almasi, O. N. Almasi, M. Kavousi, Amirhossein Sharifinia","doi":"10.14419/JACST.V2I2.1194","DOIUrl":"https://doi.org/10.14419/JACST.V2I2.1194","url":null,"abstract":"Diabetes incidence is one of the most serious health challenges in both industrial and developing countries; however, it is for sure that the early detection and accurate diagnosis of this disease can decrease the risk of affiliation to other relevant disease in diabetes patients. Because of the effective classification and high diagnostic capability, expert systems and machine learning techniques are now gaining popularity in this field. In this study, Least square support vector machine (LS-SVM) was used for diabetes diagnosis. The effectiveness of the LS-SVM is examined on Pima Indian diabetes dataset using k-fold cross validation method. Compared to thirteen well-known methods for the diabetes diagnosis in the literature, the study results showed the effectiveness of the proposed method.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114493458","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}
A hardware implementation of pulse mode Radial Basis Function Neural Network (RBFNN) with on-chip learning ability is proposed in this paper. Pulse mode presents an emerging technology in digital implementation of neural networks thanks to its higher density of integration. However, hardware on-chip learning is a difficult issue, since the back-propagation algorithm is the most used, which requires a large number of logic gates in the hardware. To overcome this problem, we apply a hybrid process, which is split into two stages. In the first one, the K-means algorithm is used to update the centers of gaussian activation functions. Thereafter, the connection weights are adjusted using the back-propagation algorithm. Details of important aspects concerning the hardware implementation are given. As illustration of the efficiency and scalability of the proposed design, we consider edge detection operation which is a very important step in image processing. In the learning step, the RBFNN was taught the Canny operator behavior. Experiential results show good approximation features. The proposed design was implemented on a virtex II PRO FPGA platform and synthesis results showed higher performances when benchmarked against conventional techniques and neural ones.
提出了一种具有片上学习能力的脉冲模式径向基函数神经网络(RBFNN)的硬件实现方法。脉冲模式以其较高的集成密度成为神经网络数字化实现中的一种新兴技术。然而，硬件片上学习是一个难题，因为反向传播算法是最常用的，这需要在硬件中设置大量的逻辑门。为了克服这个问题，我们应用了一个混合过程，它分为两个阶段。在第一种方法中，使用K-means算法来更新高斯激活函数的中心。然后，使用反向传播算法调整连接权值。给出了有关硬件实现的重要方面的详细信息。为了说明该设计的效率和可扩展性，我们考虑了图像处理中非常重要的一步边缘检测操作。在学习步骤中，RBFNN学习Canny算子行为。实验结果显示了良好的近似特性。该设计在virtex II PRO FPGA平台上实现，综合结果与传统技术和神经网络技术相比具有更高的性能。
{"title":"Digital Hardware Pulse-Mode RBFNN with Hybrid On-chip Learning Algorithm Based Edge Detection","authors":"Amir Gargouri, D. Masmoudi","doi":"10.14419/JACST.V2I1.547","DOIUrl":"https://doi.org/10.14419/JACST.V2I1.547","url":null,"abstract":"A hardware implementation of pulse mode Radial Basis Function Neural Network (RBFNN) with on-chip learning ability is proposed in this paper. Pulse mode presents an emerging technology in digital implementation of neural networks thanks to its higher density of integration. However, hardware on-chip learning is a difficult issue, since the back-propagation algorithm is the most used, which requires a large number of logic gates in the hardware. To overcome this problem, we apply a hybrid process, which is split into two stages. In the first one, the K-means algorithm is used to update the centers of gaussian activation functions. Thereafter, the connection weights are adjusted using the back-propagation algorithm. Details of important aspects concerning the hardware implementation are given. As illustration of the efficiency and scalability of the proposed design, we consider edge detection operation which is a very important step in image processing. In the learning step, the RBFNN was taught the Canny operator behavior. Experiential results show good approximation features. The proposed design was implemented on a virtex II PRO FPGA platform and synthesis results showed higher performances when benchmarked against conventional techniques and neural ones.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125728755","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 work lies within the scope of color image segmentation by spatial-region classification. The spatial distribution of objects in each region of image is difficult to be identified when the region are non-connected clusters. A standard of color identification by conventional methods of segmentation remains weak for capturing the spatial dispersion of the various objects of the same color region. We propose to apply a spatial classification to characterize geographical connected sets that represent the same regions. The originality of this paper lies in our new min-connected algorithm which is derived from a spatial-color compactness model. Our work is a hybrid segmentation that takes into account the distribution of colors in the color space and the spatial location of colors in the image plane. Experimental tests on synthetic and real images show that our technique leads to promising results for segmentation.
{"title":"Spatial-region classification by Min-Connected algorithm for unsupervised segmentation","authors":"Rachid Alaoui, A. Jakimi, Lahcen Elbermi","doi":"10.14419/JACST.V2I1.666","DOIUrl":"https://doi.org/10.14419/JACST.V2I1.666","url":null,"abstract":"This work lies within the scope of color image segmentation by spatial-region classification. The spatial distribution of objects in each region of image is difficult to be identified when the region are non-connected clusters. A standard of color identification by conventional methods of segmentation remains weak for capturing the spatial dispersion of the various objects of the same color region. We propose to apply a spatial classification to characterize geographical connected sets that represent the same regions. The originality of this paper lies in our new min-connected algorithm which is derived from a spatial-color compactness model. Our work is a hybrid segmentation that takes into account the distribution of colors in the color space and the spatial location of colors in the image plane. Experimental tests on synthetic and real images show that our technique leads to promising results for segmentation.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134085660","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 presents application of Big Bang and Big crunch(BB-BC) a nature inspired optimization method which is developed from the concepts of universal evolution to solve complex static optimal power flow (OPF) with an aim to obtain minimum cost of thermal power generating units whose cost functions are non-convex due to valve point loading effects. Control variables to optimize cost functions by satisfying usual constraints of OPF are of continuous and discrete type (mixedinteger control variables). Mathematical programming approaches presents problem in solving non-convex OPF. Nature inspired heuristic methods can be applied to solve such non-convex optimization problems. One of the requirements of heuristic methods is numerical simplicity without trial parameters in update equation of optimization along with reliability and ease in developing computer code for implementation. Most of the nature inspired methods search efficiency and reliability depends on choice of trial parameters to update control variables as optimization advances in search of optimal control variables.BB-BC optimization has search ability on par with other popular heuristic methods but free from choice of trial parameters is applied to obtain OPF solutions on two typical power systems networks and results are compared with MATLAB-7.0 pattern random search optimization tool box .Digital simulation results indicates a promising nature of the BB-BC to deal with non-convex optimization requirements of power system situations .
{"title":"Optimal Power flow with valve point loading effects of cost function and mixed-integer control variables using Big-Bang and Big-Crunch optimization.","authors":"C. V. G. K. Rao, G. Yesuratnam","doi":"10.14419/JACST.V2I1.522","DOIUrl":"https://doi.org/10.14419/JACST.V2I1.522","url":null,"abstract":"This paper presents application of Big Bang and Big crunch(BB-BC) a nature inspired optimization method which is developed from the concepts of universal evolution to solve complex static optimal power flow (OPF) with an aim to obtain minimum cost of thermal power generating units whose cost functions are non-convex due to valve point loading effects. Control variables to optimize cost functions by satisfying usual constraints of OPF are of continuous and discrete type (mixedinteger control variables). Mathematical programming approaches presents problem in solving non-convex OPF. Nature inspired heuristic methods can be applied to solve such non-convex optimization problems. One of the requirements of heuristic methods is numerical simplicity without trial parameters in update equation of optimization along with reliability and ease in developing computer code for implementation. Most of the nature inspired methods search efficiency and reliability depends on choice of trial parameters to update control variables as optimization advances in search of optimal control variables.BB-BC optimization has search ability on par with other popular heuristic methods but free from choice of trial parameters is applied to obtain OPF solutions on two typical power systems networks and results are compared with MATLAB-7.0 pattern random search optimization tool box .Digital simulation results indicates a promising nature of the BB-BC to deal with non-convex optimization requirements of power system situations .","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114428668","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}
Cloud computing technology and services has become an important issue in the recent years. Cloud Computing needs lot of attention, time and innovative concepts for the technology to mature over a period of time. Many organizations show interest in adopting cloud computing technology and services because of its socio economic and time factor. Cloud computing is nothing but virtual centralization of different computers where the software and memory space is provided by the vendor and the data is managed by them. This leaves the client/customer unaware of where the process is running or where the data is stored. Security of the data is highly dependent on the vendor who has to provide an assurance to the customer on security issues by making service level agreements. This paper focus on security issues, requirements for providing a secured data in cloud computing environment by giving a standard service oriented cloud computing Architecture and management tools that can be used by the organizations for authentication, confidentiality and integrity. Thus providing secured data access and transfer.
{"title":"Securing and Managing the Data with efficient Architecture in Cloud Computing Environment","authors":"kartheesan log, S. Srivatsa","doi":"10.14419/JACST.V2I1.545","DOIUrl":"https://doi.org/10.14419/JACST.V2I1.545","url":null,"abstract":"Cloud computing technology and services has become an important issue in the recent years. Cloud Computing needs lot of attention, time and innovative concepts for the technology to mature over a period of time. Many organizations show interest in adopting cloud computing technology and services because of its socio economic and time factor. Cloud computing is nothing but virtual centralization of different computers where the software and memory space is provided by the vendor and the data is managed by them. This leaves the client/customer unaware of where the process is running or where the data is stored. Security of the data is highly dependent on the vendor who has to provide an assurance to the customer on security issues by making service level agreements. This paper focus on security issues, requirements for providing a secured data in cloud computing environment by giving a standard service oriented cloud computing Architecture and management tools that can be used by the organizations for authentication, confidentiality and integrity. Thus providing secured data access and transfer.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862347","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
扫码关注我们
求助内容：
应助结果提醒方式：