Cloud computing has emerged as one of the latest technologies for delivering on-demand advanced services over the internet. Various cloud providers have developed data-centres which are spread at several geographically locations, and are available for utilization from internet users. However, as the number of resource consumers is increasing significantly, it becomes apparent that the capacity-oriented clouds require coming together and agreeing on common acting behaviours for improving the quality of service, hence providing an overall optimal load allocation. In this direction, current solutions do not support a coordinated distribution of different cloud workloads. Even geographically distributed data-centres from the same vendor (e.g. Amazon) don't support a seamless mechanic for balancing hosted services as the users require indicating their selected hosts' location. To answer this limitation, a recently emerged inter-clouds notion comes to expand cloud capabilities and to offer an improved sharing paradigm of workloads. Herein we present a state-of-the-art review with a particular focus on the adoptability of current meta-schedulers for managing workloads, towards the inter-cloud era. Specifically, by exploiting inter-cloud requirements (e.g. flexibility, geographically distribution etc.) we evaluate various meta-schedulers for future inter-clouds.
{"title":"Towards Inter-cloud Schedulers: A Survey of Meta-scheduling Approaches","authors":"Stelios Sotiriadis, N. Bessis, N. Antonopoulos","doi":"10.1109/3PGCIC.2011.19","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.19","url":null,"abstract":"Cloud computing has emerged as one of the latest technologies for delivering on-demand advanced services over the internet. Various cloud providers have developed data-centres which are spread at several geographically locations, and are available for utilization from internet users. However, as the number of resource consumers is increasing significantly, it becomes apparent that the capacity-oriented clouds require coming together and agreeing on common acting behaviours for improving the quality of service, hence providing an overall optimal load allocation. In this direction, current solutions do not support a coordinated distribution of different cloud workloads. Even geographically distributed data-centres from the same vendor (e.g. Amazon) don't support a seamless mechanic for balancing hosted services as the users require indicating their selected hosts' location. To answer this limitation, a recently emerged inter-clouds notion comes to expand cloud capabilities and to offer an improved sharing paradigm of workloads. Herein we present a state-of-the-art review with a particular focus on the adoptability of current meta-schedulers for managing workloads, towards the inter-cloud era. Specifically, by exploiting inter-cloud requirements (e.g. flexibility, geographically distribution etc.) we evaluate various meta-schedulers for future inter-clouds.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115435096","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 research deals with a novel approach to classification. Classical artificial neural networks, where a relation between inputs and outputs is based on the mathematical transfer functions and optimized numerical weights, was an inspiration for this work. Artificial neural networks need to optimize weights, but the structure and transfer functions are usually set up before the training. There exist some evolutionary approaches, which help to set up the structure or to optimize weights in different ways than standard artificial neural networks do. The proposed method utilizes the symbolic regression for synthesis of a whole structure, i.e. the relation between inputs and output(s). For experimentation, Differential Evolution (DE) and Self Organizing Migrating Algorithm (SOMA) for the main procedure of analytic programming (AP) and DE as an algorithm for meta-evolution were used.
{"title":"Classification with Pseudo Neural Networks Based on Evolutionary Symbolic Regression","authors":"Z. Oplatková, R. Šenkeřík","doi":"10.1109/3PGCIC.2011.74","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.74","url":null,"abstract":"This research deals with a novel approach to classification. Classical artificial neural networks, where a relation between inputs and outputs is based on the mathematical transfer functions and optimized numerical weights, was an inspiration for this work. Artificial neural networks need to optimize weights, but the structure and transfer functions are usually set up before the training. There exist some evolutionary approaches, which help to set up the structure or to optimize weights in different ways than standard artificial neural networks do. The proposed method utilizes the symbolic regression for synthesis of a whole structure, i.e. the relation between inputs and output(s). For experimentation, Differential Evolution (DE) and Self Organizing Migrating Algorithm (SOMA) for the main procedure of analytic programming (AP) and DE as an algorithm for meta-evolution were used.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130023350","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 a situation-based service composition model for dynamic environments in which the characteristics of the surrounding environments are frequently changing. The main contribution of situation-based service composition model is: (1) to provide a concept of situations which specified the mutual affects of situated conditions and situated services, and (2) to provide an adaptation mechanism to support the planning and adaptation of composite services in specific situations.
{"title":"A Situation-Based Service Composition Model for Dynamic Environments","authors":"H. Le","doi":"10.1109/3PGCIC.2011.59","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.59","url":null,"abstract":"This paper presents a situation-based service composition model for dynamic environments in which the characteristics of the surrounding environments are frequently changing. The main contribution of situation-based service composition model is: (1) to provide a concept of situations which specified the mutual affects of situated conditions and situated services, and (2) to provide an adaptation mechanism to support the planning and adaptation of composite services in specific situations.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122896621","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}
S. Pippal, Vishu Sharma, Shakti Mishra, D. S. Kushwaha
Software-as-a-Service (SaaS) is a service model for delivering application as cloud services over the internet on subscription basis to multiple clients. This has forced the use of shared databases termed as multitenant databases. Multitenancy refers to a technology where a single instance of application serves requests from multiple clients. The word Tenant refers to a single organization (eg. an Institution) or person. In our proposed approach, shared database shared schema approach has been proposed that offers larger number of tenants (Educational Institutions) per database server as the single database serves the database requirements of multiple Institutions. Authentication and authorization are prime requirements when dealing with multitenancy. Kerberos authentication protocol is used on the top of multitenant database for participating educational institution in a heterogeneous environment, where a tenant can also voluntarily participate in the data centre.
{"title":"An Efficient Schema Shared Approach for Cloud Based Multitenant Database with Authentication and Authorization Framework","authors":"S. Pippal, Vishu Sharma, Shakti Mishra, D. S. Kushwaha","doi":"10.1109/3PGCIC.2011.39","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.39","url":null,"abstract":"Software-as-a-Service (SaaS) is a service model for delivering application as cloud services over the internet on subscription basis to multiple clients. This has forced the use of shared databases termed as multitenant databases. Multitenancy refers to a technology where a single instance of application serves requests from multiple clients. The word Tenant refers to a single organization (eg. an Institution) or person. In our proposed approach, shared database shared schema approach has been proposed that offers larger number of tenants (Educational Institutions) per database server as the single database serves the database requirements of multiple Institutions. Authentication and authorization are prime requirements when dealing with multitenancy. Kerberos authentication protocol is used on the top of multitenant database for participating educational institution in a heterogeneous environment, where a tenant can also voluntarily participate in the data centre.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133289505","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}
Co-allocation is newly developed technology for downloading data files from multiple replicas by establishing multiple connections in parallel, thus improving performance over single-server transfers and helping to alleviate the internet congestion problem. Schemes including our previous the anticipative recursively adjusting mechanism plus (ARAM+) model based on co-allocation strategies and resource broker which provides capabilities such as service allocating, resource discovery, job scheduling, job monitoring and data access to users~{!/~} application have been proposed. However, the challenges to the resource broker architectures are bottleneck and single point of failure for file transfer. Moreover, the secure intra-grid communication against internal attacks is another important issue. To overcome these problems, we present a new fully decentralized resource broker model with authorization and authentication based on co-allocation method for redundant parallel file transfer in Data Grid. We design and implement a resource broker agent, calling ~{!0~}light broker~{!1~} to share the workload of resource broker. We also propose a multiparty key agreement protocol to provide a secure resource group communication. The experimental results demonstrate that, our approach achieves dependable performance with various loads of services, broker failures and possible attacks.
{"title":"A Decentralized Resource Broker Model with Authorization and Authentication Based on Multiparty Key Agreement Protocol in Data Grids","authors":"Wen-Chung Chiang, Chao-Tung Yang, Hsiu-Hsia Lin","doi":"10.1109/3PGCIC.2011.11","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.11","url":null,"abstract":"Co-allocation is newly developed technology for downloading data files from multiple replicas by establishing multiple connections in parallel, thus improving performance over single-server transfers and helping to alleviate the internet congestion problem. Schemes including our previous the anticipative recursively adjusting mechanism plus (ARAM+) model based on co-allocation strategies and resource broker which provides capabilities such as service allocating, resource discovery, job scheduling, job monitoring and data access to users~{!/~} application have been proposed. However, the challenges to the resource broker architectures are bottleneck and single point of failure for file transfer. Moreover, the secure intra-grid communication against internal attacks is another important issue. To overcome these problems, we present a new fully decentralized resource broker model with authorization and authentication based on co-allocation method for redundant parallel file transfer in Data Grid. We design and implement a resource broker agent, calling ~{!0~}light broker~{!1~} to share the workload of resource broker. We also propose a multiparty key agreement protocol to provide a secure resource group communication. The experimental results demonstrate that, our approach achieves dependable performance with various loads of services, broker failures and possible attacks.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127554837","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}
M. Morshed, Mohammad Maynul Islam, Mohammad Kamrul Huq, Md. Shahadat Hossain, Mohammad Ariful Basher
Use of wireless hand held devices like mobile, PDA, laptop etc. is increasing rapidly. Many advanced users want more functionality with these wireless devices to manage their daily schedule. But most of the wireless hand-held devices have limited resource capability for robust functionality. Therefore cloud computing environment could be an alternative solution for these devices to support resource consuming applications. If the wireless hand held device is connected with the cloud, user can use more resource consuming applications and private data (stored in the cloud) from those devices. But privacy and security of the personal information and data make the user concern for using the cloud. The aim of the paper is to identify the security and privacy related risks and threats of the mass users as well as corporate users, if the wireless hand-held devices will be integrated with the cloud.
{"title":"Integration of Wireless Hand-Held Devices with the Cloud Architecture: Security and Privacy Issues","authors":"M. Morshed, Mohammad Maynul Islam, Mohammad Kamrul Huq, Md. Shahadat Hossain, Mohammad Ariful Basher","doi":"10.1109/3PGCIC.2011.22","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.22","url":null,"abstract":"Use of wireless hand held devices like mobile, PDA, laptop etc. is increasing rapidly. Many advanced users want more functionality with these wireless devices to manage their daily schedule. But most of the wireless hand-held devices have limited resource capability for robust functionality. Therefore cloud computing environment could be an alternative solution for these devices to support resource consuming applications. If the wireless hand held device is connected with the cloud, user can use more resource consuming applications and private data (stored in the cloud) from those devices. But privacy and security of the personal information and data make the user concern for using the cloud. The aim of the paper is to identify the security and privacy related risks and threats of the mass users as well as corporate users, if the wireless hand-held devices will be integrated with the cloud.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114733789","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}
Recently, technology of cloud computing has been rapidly developed, and it is expected to apply for various network services. Virtual technology is a part of significant technology which has been contributed for the development of cloud computing. Various virtual technologies such as virtual OS and VDE become very important for server and network management in these days. Furthermore, such a virtual technology becomes possible to provide efficient resource management or QoS with virtual network configuration. Thus, it will be important for network construction to provide hardware and software service in near future. Autonomous network configuration in virtual layer is one of such a service. Not only network configuration is constructed in physical layer, but also it should be constructed in virtual layer for providing optimal resource and QoS management. In this paper, Overlay Cloud Computing Service is proposed, and it is consisted of virtual autonomous network configuration in cloud computing service including various server and network services. In our proposal methods, first of all, there are various kinds of user policy such as eco mode, high power mode, and secure mode. Then, virtual network and server configuration is automatically held in virtual layer with the mode setting and hardware configuration. Besides, with observation values of network and server condition, virtual configuration is changed optimally. In this optimal configuration changes, Kalman filter is used for the calculation of network and server condition. Then, with the results of calculation, virtual network topology is changed. In this paper, first, introduction and cloud computing service is discussed. Then, our proposed Overlay Cloud Computing Service by autonomous network configuration is introduced. In the chapter, optimal control method by Kalman filter with observed values is also introduced. Finally, conclusion and future study is discussed.
{"title":"Proposal of Overlay Cloud Computing System by Virtual Autonomous Network Configuration","authors":"Noriki Uchida, Kazuo Takahata, Y. Shibata","doi":"10.1109/3PGCIC.2011.56","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.56","url":null,"abstract":"Recently, technology of cloud computing has been rapidly developed, and it is expected to apply for various network services. Virtual technology is a part of significant technology which has been contributed for the development of cloud computing. Various virtual technologies such as virtual OS and VDE become very important for server and network management in these days. Furthermore, such a virtual technology becomes possible to provide efficient resource management or QoS with virtual network configuration. Thus, it will be important for network construction to provide hardware and software service in near future. Autonomous network configuration in virtual layer is one of such a service. Not only network configuration is constructed in physical layer, but also it should be constructed in virtual layer for providing optimal resource and QoS management. In this paper, Overlay Cloud Computing Service is proposed, and it is consisted of virtual autonomous network configuration in cloud computing service including various server and network services. In our proposal methods, first of all, there are various kinds of user policy such as eco mode, high power mode, and secure mode. Then, virtual network and server configuration is automatically held in virtual layer with the mode setting and hardware configuration. Besides, with observation values of network and server condition, virtual configuration is changed optimally. In this optimal configuration changes, Kalman filter is used for the calculation of network and server condition. Then, with the results of calculation, virtual network topology is changed. In this paper, first, introduction and cloud computing service is discussed. Then, our proposed Overlay Cloud Computing Service by autonomous network configuration is introduced. In the chapter, optimal control method by Kalman filter with observed values is also introduced. Finally, conclusion and future study is discussed.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130792441","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 Cloud has emerged as the solution for fast application deployment and cheap and flexible private infrastructure replacement, as well as for providing scalable services over the internet. The current paper tries to provide an overview of the current technologies related to the Cloud, their features and interactions. The services and platforms used in the Cloud have their specific advantages and drawbacks which we try to capture. The overview describes private, proprietary as well as open Cloud frameworks.
{"title":"Current Cloud Technologies Overview","authors":"E. Mocanu, M. Andreica, N. Tapus","doi":"10.1109/3PGCIC.2011.52","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.52","url":null,"abstract":"The Cloud has emerged as the solution for fast application deployment and cheap and flexible private infrastructure replacement, as well as for providing scalable services over the internet. The current paper tries to provide an overview of the current technologies related to the Cloud, their features and interactions. The services and platforms used in the Cloud have their specific advantages and drawbacks which we try to capture. The overview describes private, proprietary as well as open Cloud frameworks.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"50 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130971144","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}
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is the hop-limited routing tables, storing the route information to nodes within a small number (say n) hops from each node. The hop-limited routing table is substantially equivalent to the hop-limited shortest path tree, which is made of nodes within limited hop distance from the root. The other is the file list, which is an index over files kept by nodes within n hops from each node. To find a file, a node first checks its file list. If the requested file is found in the list, the node sends a file request message to the file owner, otherwise, it sends a file-search message to a randomly-selected leaf node on the hop-limited shortest path tree rooted at itself. Numerical examples show that our proposal has much smaller search latency and lower file-search failure ratio than the primitive random-walk-based search, while it wastes much less network bandwidth than network-broadcast-based searches.
{"title":"Random Walk Search on Concatenated Hop-Limited Trees Embedded into Unstructured P2Ps","authors":"S. Shioda, Phouvieng Hieungmany","doi":"10.1109/3PGCIC.2011.17","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.17","url":null,"abstract":"We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is the hop-limited routing tables, storing the route information to nodes within a small number (say n) hops from each node. The hop-limited routing table is substantially equivalent to the hop-limited shortest path tree, which is made of nodes within limited hop distance from the root. The other is the file list, which is an index over files kept by nodes within n hops from each node. To find a file, a node first checks its file list. If the requested file is found in the list, the node sends a file request message to the file owner, otherwise, it sends a file-search message to a randomly-selected leaf node on the hop-limited shortest path tree rooted at itself. Numerical examples show that our proposal has much smaller search latency and lower file-search failure ratio than the primitive random-walk-based search, while it wastes much less network bandwidth than network-broadcast-based searches.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127861112","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}
M. Kotyrba, Z. Oplatková, E. Volná, R. Šenkeřík, Václav Kocian, M. Janošek
In this paper we develop two methods that are able to analyze and recognize patterns in time series. The first model is based on analytic programming (AP), which belongs to soft computing. AP is based as well as genetic programming on the set of functions, operators and so-called terminals, which are usually constants or independent variables. The second one uses an artificial neural network that is adapted by back propagation. Artificial neural networks are suitable for pattern recognition in time series mainly because of learning only from examples. There is no need to add additional information that could bring more confusion than recognition effect. Neural networks are able to generalize and are resistant to noise. On the other hand, it is generally not possible to determine exactly what a neural network learned and it is also hard to estimate possible recognition error. They are ideal especially when we do not have any other description of the observed series. This paper also includes experimental results of time series pattern recognition carried out with both mentioned methods, which have proven their suitability for this type of problem solving.
{"title":"Time Series Pattern Recognition via SoftComputing","authors":"M. Kotyrba, Z. Oplatková, E. Volná, R. Šenkeřík, Václav Kocian, M. Janošek","doi":"10.1109/3PGCIC.2011.72","DOIUrl":"https://doi.org/10.1109/3PGCIC.2011.72","url":null,"abstract":"In this paper we develop two methods that are able to analyze and recognize patterns in time series. The first model is based on analytic programming (AP), which belongs to soft computing. AP is based as well as genetic programming on the set of functions, operators and so-called terminals, which are usually constants or independent variables. The second one uses an artificial neural network that is adapted by back propagation. Artificial neural networks are suitable for pattern recognition in time series mainly because of learning only from examples. There is no need to add additional information that could bring more confusion than recognition effect. Neural networks are able to generalize and are resistant to noise. On the other hand, it is generally not possible to determine exactly what a neural network learned and it is also hard to estimate possible recognition error. They are ideal especially when we do not have any other description of the observed series. This paper also includes experimental results of time series pattern recognition carried out with both mentioned methods, which have proven their suitability for this type of problem solving.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228037","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
扫码关注我们
求助内容：
应助结果提醒方式：