N. Kolchanov, R. Hofestadt, Dagmara Furman, D. Afonnikov, M. Gelfand, V. Govorun, L. Milanesi, I. Rogozin, M. Samsonova, A. Sarai, K. Skryabin, L. Zhivotovsky, Jagath Rajapakse, Ekaterina Denisova, A. Kharkevich, G. Kiseleva, Yu. S. Orlov
Nikolay Kolchanov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia (Chairman of the Conference) Ralf Hofestadt University of Bielefeld, Germany (Co-Chairman of the Conference) Dagmara Furman Institute of Cytology and Genetics SB RAS, Novosibirsk, (Conference Scientific Secretary) Dmitry Afonnikov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Mikhail Gelfand GosNIIGenetika, Moscow, Russia Vadim Govorun Institute of Physicochemical Medicine, RAMS, Moscow, Russia Reinhart Heinrich Humboldt University Berlin, Berlin, Germany Charlie Hodgman Multidisciplinary Centre for Integrative Biology, School of Biosciences, University of Nottingham, UK Alexey Kochetov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Eugene Koonin National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, USA Vassily Lyubetsky Institute for Informational Transmission Problems RAS, Moscow, Russia Luciano Milanesi National Research Council – Institute of Biomedical Technology, Italy Viatcheslav Mordvinov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Yuriy Orlov Genome Institute of Singapore, Laboratory of Information & Mathematical Sciences, Singapore Igor Rogozin Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Cenk Sahinalp Computing Science, Simon Fraser University, Burnaby, Canada Maria Samsonova St.Petersburg State Polytechnic University, St.Petersburg, Russia Akinori Sarai Kyushu Institute of Technology (KIT), Iizuka, Japan Konstantin Skryabin Centre "Bioengineering" RAS, Moscow, Russia Rustem Tchuraev Institute of Biology, Ufa Sci. Centre RAS, Ufa, Russia Denis Thieffry ESIL-GBMA, Universite de la Mediterranee, Marseille, France Jennifer Trelewicz IBM Almaden Research Center, San Jose, California, USA Edgar Wingender UKG, University of Goettingen, Goettingen, Germany Lev Zhivotovsky Institute of General Genetics RAS, Moscow, Russia Jagath C. Rajapakse School of Computer Engineering, Nanyang Technological University, Singapore
{"title":"International program committee","authors":"N. Kolchanov, R. Hofestadt, Dagmara Furman, D. Afonnikov, M. Gelfand, V. Govorun, L. Milanesi, I. Rogozin, M. Samsonova, A. Sarai, K. Skryabin, L. Zhivotovsky, Jagath Rajapakse, Ekaterina Denisova, A. Kharkevich, G. Kiseleva, Yu. S. Orlov","doi":"10.1109/ACSD.2005.22","DOIUrl":"https://doi.org/10.1109/ACSD.2005.22","url":null,"abstract":"Nikolay Kolchanov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia (Chairman of the Conference) Ralf Hofestadt University of Bielefeld, Germany (Co-Chairman of the Conference) Dagmara Furman Institute of Cytology and Genetics SB RAS, Novosibirsk, (Conference Scientific Secretary) Dmitry Afonnikov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Mikhail Gelfand GosNIIGenetika, Moscow, Russia Vadim Govorun Institute of Physicochemical Medicine, RAMS, Moscow, Russia Reinhart Heinrich Humboldt University Berlin, Berlin, Germany Charlie Hodgman Multidisciplinary Centre for Integrative Biology, School of Biosciences, University of Nottingham, UK Alexey Kochetov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Eugene Koonin National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Bethesda, USA Vassily Lyubetsky Institute for Informational Transmission Problems RAS, Moscow, Russia Luciano Milanesi National Research Council – Institute of Biomedical Technology, Italy Viatcheslav Mordvinov Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Yuriy Orlov Genome Institute of Singapore, Laboratory of Information & Mathematical Sciences, Singapore Igor Rogozin Institute of Cytology and Genetics SB RAS, Novosibirsk, Russia Cenk Sahinalp Computing Science, Simon Fraser University, Burnaby, Canada Maria Samsonova St.Petersburg State Polytechnic University, St.Petersburg, Russia Akinori Sarai Kyushu Institute of Technology (KIT), Iizuka, Japan Konstantin Skryabin Centre \"Bioengineering\" RAS, Moscow, Russia Rustem Tchuraev Institute of Biology, Ufa Sci. Centre RAS, Ufa, Russia Denis Thieffry ESIL-GBMA, Universite de la Mediterranee, Marseille, France Jennifer Trelewicz IBM Almaden Research Center, San Jose, California, USA Edgar Wingender UKG, University of Goettingen, Goettingen, Germany Lev Zhivotovsky Institute of General Genetics RAS, Moscow, Russia Jagath C. Rajapakse School of Computer Engineering, Nanyang Technological University, Singapore","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"8 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513907","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093319
Md. Sumon Shahriar, Paulo A. de Souza, G. Timms
An integrated pattern mining technique for query answering is proposed for marine sensor data. In pattern query, we adopt the dynamic time warping (DTW) method and propose the use of a query relaxation approach in finding similar patterns. We further calculate prediction from discovered similar patterns in marine sensor data. The predictive values are then compared with the forecast from hydrodynamic model data. In addition, we present query answering using a clustering technique. Finally, we show implementation results in a marine sensor network deployed in the South East of Tasmania, Australia.
{"title":"Pattern mining for query answering in marine sensor data","authors":"Md. Sumon Shahriar, Paulo A. de Souza, G. Timms","doi":"10.1109/ICDIM.2011.6093319","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093319","url":null,"abstract":"An integrated pattern mining technique for query answering is proposed for marine sensor data. In pattern query, we adopt the dynamic time warping (DTW) method and propose the use of a query relaxation approach in finding similar patterns. We further calculate prediction from discovered similar patterns in marine sensor data. The predictive values are then compared with the forecast from hydrodynamic model data. In addition, we present query answering using a clustering technique. Finally, we show implementation results in a marine sensor network deployed in the South East of Tasmania, Australia.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126189150","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093333
Rayed Alghamdi, Steve Drew, Mohammed Alshehri
This paper presents findings from a study of factors affecting the rate of diffusion and adoption of online retailing in Saudi Arabia. In general, Saudi retailers have not responded actively to the global growth of online retailing. Accordingly, this research was conducted to find the key factors involved in this phenomenon. A major finding presented here, is that both buyers and sellers emphasize the need for government involvement to support and promote development of online commerce. Particularly, it indicates the need for strategic government initiatives to provide regulation, legislation, education, and trusted infrastructure for secure payment and delivery. Saudi Arabia presents a unique cultural, technological and political context for the development of e-commerce. We highlight the particular motivators and potential benefits of Saudi government involvement in e-commerce development. A new model for formulating roles and strategic government initiatives to support the successful diffusion of online retailing in KSA is presented and discussed. This will be of interest to any following the development of e-commerce and the information economy in the Arab nations.
{"title":"Strategic government initiatives to promote diffusion of online retailing in Saudi Arabia","authors":"Rayed Alghamdi, Steve Drew, Mohammed Alshehri","doi":"10.1109/ICDIM.2011.6093333","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093333","url":null,"abstract":"This paper presents findings from a study of factors affecting the rate of diffusion and adoption of online retailing in Saudi Arabia. In general, Saudi retailers have not responded actively to the global growth of online retailing. Accordingly, this research was conducted to find the key factors involved in this phenomenon. A major finding presented here, is that both buyers and sellers emphasize the need for government involvement to support and promote development of online commerce. Particularly, it indicates the need for strategic government initiatives to provide regulation, legislation, education, and trusted infrastructure for secure payment and delivery. Saudi Arabia presents a unique cultural, technological and political context for the development of e-commerce. We highlight the particular motivators and potential benefits of Saudi government involvement in e-commerce development. A new model for formulating roles and strategic government initiatives to support the successful diffusion of online retailing in KSA is presented and discussed. This will be of interest to any following the development of e-commerce and the information economy in the Arab nations.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127045087","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093314
S. Fajt, I. Holubová, M. Nečaský
Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any. Consequently, no integrity constrains are specified as well. In this paper we focus on extension of approaches for inferring an XML schema from a sample set of XML documents with mining primary and foreign keys. In particular we consider the keys in the context of XSD, i.e. absolute and relative as well as simple and composite keys. We propose a novel approach called KeyMiner and depict its efficiency experimentally using real-world and synthetic data.
{"title":"On mining XML integrity constraints","authors":"S. Fajt, I. Holubová, M. Nečaský","doi":"10.1109/ICDIM.2011.6093314","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093314","url":null,"abstract":"Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any. Consequently, no integrity constrains are specified as well. In this paper we focus on extension of approaches for inferring an XML schema from a sample set of XML documents with mining primary and foreign keys. In particular we consider the keys in the context of XSD, i.e. absolute and relative as well as simple and composite keys. We propose a novel approach called KeyMiner and depict its efficiency experimentally using real-world and synthetic data.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127575808","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093351
Ingyu Lee, Byung-Won On
With the popularity of Internet, tremendous amount of unstructured document information is available to access. Extracting related information from huge unstructured documents is a very difficult task. Especially, confusion can occur by synonym and polysemy, miss spelling, abbreviation, etc. To resolve those confusion is known as an Entity Resolution problem. Clustering algorithms have been popularly used to resolve mixed entities. However, most researches focus on one feature of an entity such as co-author lists or paper titles. In this paper, we are proposing a weighted hybrid feature scheme to distinguish mixed entities among unstructured documents. Experimental results show that weighted hybrid approach improves the accuracy and efficiency.
{"title":"Weighted hybrid features to resolve mixed entities","authors":"Ingyu Lee, Byung-Won On","doi":"10.1109/ICDIM.2011.6093351","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093351","url":null,"abstract":"With the popularity of Internet, tremendous amount of unstructured document information is available to access. Extracting related information from huge unstructured documents is a very difficult task. Especially, confusion can occur by synonym and polysemy, miss spelling, abbreviation, etc. To resolve those confusion is known as an Entity Resolution problem. Clustering algorithms have been popularly used to resolve mixed entities. However, most researches focus on one feature of an entity such as co-author lists or paper titles. In this paper, we are proposing a weighted hybrid feature scheme to distinguish mixed entities among unstructured documents. Experimental results show that weighted hybrid approach improves the accuracy and efficiency.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129407829","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093370
Elise Desmier, Frédéric Flouvat, B. Stoll, Nazha Selmaoui-Folcher
Supervised classification of satellite images is a commonly used technique in Remote Sensing. It allows the production of thematic maps based on a training set chosen by domain experts. These training sets, called ROI (Regions Of Interest), statistically characterize each class (e.g. coconut, sand) of the satellite image. Thus, a set of ROI is manually created by domain expert for each image. When a large number of images with high resolution occurs, manual creation of ROI for each image can be very time and money consuming. In this paper, we propose a semi-automatic approach based on clustering to limit the number of ROI done by experts. Then, we use decision trees on a binary decomposition of RGB components to improve the classification. Experiments have been done on 306 high resolution images of Tuamotu archipelago.
{"title":"Coconut fields classification using data mining on a large database of high-resolution Ikonos images","authors":"Elise Desmier, Frédéric Flouvat, B. Stoll, Nazha Selmaoui-Folcher","doi":"10.1109/ICDIM.2011.6093370","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093370","url":null,"abstract":"Supervised classification of satellite images is a commonly used technique in Remote Sensing. It allows the production of thematic maps based on a training set chosen by domain experts. These training sets, called ROI (Regions Of Interest), statistically characterize each class (e.g. coconut, sand) of the satellite image. Thus, a set of ROI is manually created by domain expert for each image. When a large number of images with high resolution occurs, manual creation of ROI for each image can be very time and money consuming. In this paper, we propose a semi-automatic approach based on clustering to limit the number of ROI done by experts. Then, we use decision trees on a binary decomposition of RGB components to improve the classification. Experiments have been done on 306 high resolution images of Tuamotu archipelago.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126132768","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093336
S. Knight
The 2009 Report by the National Health and Hospitals Reform Commission (NHHRC) to the Federal government described the Australian Health Sector (AHS) and its information processes as “fragmented”. When presented with the observation that an organisation and its information or management processes are fragmented, it seems natural to assume such a state to be deficient. More often than not, the response is for an organisation to attempt to reform or standardise its systems in an attempt to un-fragment their core business. This paper argues for an alternative paradigm, informed by the science of Complexity, which conceptualises complex organisations and their processes in terms of being Complex Adaptive Systems (CAS). In this context, traditional information and management science approaches to understanding organisational characteristics such as fragmentation, process and information duplication or redundancy, and system regulation may require a rethink.
{"title":"Information management in health systems: Considering an organic approach","authors":"S. Knight","doi":"10.1109/ICDIM.2011.6093336","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093336","url":null,"abstract":"The 2009 Report by the National Health and Hospitals Reform Commission (NHHRC) to the Federal government described the Australian Health Sector (AHS) and its information processes as “fragmented”. When presented with the observation that an organisation and its information or management processes are fragmented, it seems natural to assume such a state to be deficient. More often than not, the response is for an organisation to attempt to reform or standardise its systems in an attempt to un-fragment their core business. This paper argues for an alternative paradigm, informed by the science of Complexity, which conceptualises complex organisations and their processes in terms of being Complex Adaptive Systems (CAS). In this context, traditional information and management science approaches to understanding organisational characteristics such as fragmentation, process and information duplication or redundancy, and system regulation may require a rethink.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129508923","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093317
Junpei Kawamoto, Masatoshi Yoshikawa
In this paper, we propose a novel approach for private query; IPP (inner product predicate) method. Private query is a query processing protocol to obtain requesting tuples without exposing any information about what users request to third persons including service providers. Existing works about private query such as PIR, which ensure information theoretic safety, have severe restriction because they do not support range queries nor allow tuples having a same value in queried attributes. Our IPP method, on the other hands, focuses range queries mainly and it allows tuples having a same value in any attributes. IPP method employs a query transform by trusted clients (QT) scheme and proposes transformation algorithms which make the correlation between plain queries and transformed queries and the correlation between plain attribute values and transformed attribute values small enough. Thus, the transformed queries and attribute values have resistance to frequency analysis attacks which implies IPP method prevents attackers, who know the plain distribution of them, from computing the plain queries and attribute values from transformed values. IPP method adds perturbations to queries and attribute values and gives them a matrix based encryption to achieve the above property. We also confirm the computational cost on servers belongs to O(n) with the number of tuples n and is virtually no correlation between the distributions of transformed queries and queried attribute values and the plain distributions of them by experimental evaluations.
{"title":"Private range query by perturbation and matrix based encryption","authors":"Junpei Kawamoto, Masatoshi Yoshikawa","doi":"10.1109/ICDIM.2011.6093317","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093317","url":null,"abstract":"In this paper, we propose a novel approach for private query; IPP (inner product predicate) method. Private query is a query processing protocol to obtain requesting tuples without exposing any information about what users request to third persons including service providers. Existing works about private query such as PIR, which ensure information theoretic safety, have severe restriction because they do not support range queries nor allow tuples having a same value in queried attributes. Our IPP method, on the other hands, focuses range queries mainly and it allows tuples having a same value in any attributes. IPP method employs a query transform by trusted clients (QT) scheme and proposes transformation algorithms which make the correlation between plain queries and transformed queries and the correlation between plain attribute values and transformed attribute values small enough. Thus, the transformed queries and attribute values have resistance to frequency analysis attacks which implies IPP method prevents attackers, who know the plain distribution of them, from computing the plain queries and attribute values from transformed values. IPP method adds perturbations to queries and attribute values and gives them a matrix based encryption to achieve the above property. We also confirm the computational cost on servers belongs to O(n) with the number of tuples n and is virtually no correlation between the distributions of transformed queries and queried attribute values and the plain distributions of them by experimental evaluations.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129151582","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093341
Fattaneh Mimhashemi, A. Albadavi, A. Asosheh, M. G. Tajgardoon
Development of science and technology in different fields followed by complicated calculations-based projects and studies, therefore, in recent years it has been attempted to find solutions for reducing the calculation and temporal costs in the area of such problems. Various distributed calculations method, each are seeking for reducing the costs by parallel implementation of calculation plans on non concentrated calculating nodes, among which grid computing, exploiting from unusable sources resulted in reduced costs for developing the calculation networks. In concurrent with developed countries, Iran Scientific Society tries to use such methods for reducing the temporal and resources costs by researching and defined some projects for providing service-based grid computing for being used in universities and researching house through the country and the one of the most important actions of such kind includes designing and introducing the grid of Institute for Studies in Theoretical Physics and Mathematics (IPM) where tries to aggregate universities and researching houses in the frame of a national grid and it has yet provided some of fundamental services of grid. This paper aims to provide a grid computing model for being used in universities and researching houses that implemented in Tarbiat Modares University by test.
{"title":"A service-based grid computing model to apply in the universities and institutes","authors":"Fattaneh Mimhashemi, A. Albadavi, A. Asosheh, M. G. Tajgardoon","doi":"10.1109/ICDIM.2011.6093341","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093341","url":null,"abstract":"Development of science and technology in different fields followed by complicated calculations-based projects and studies, therefore, in recent years it has been attempted to find solutions for reducing the calculation and temporal costs in the area of such problems. Various distributed calculations method, each are seeking for reducing the costs by parallel implementation of calculation plans on non concentrated calculating nodes, among which grid computing, exploiting from unusable sources resulted in reduced costs for developing the calculation networks. In concurrent with developed countries, Iran Scientific Society tries to use such methods for reducing the temporal and resources costs by researching and defined some projects for providing service-based grid computing for being used in universities and researching house through the country and the one of the most important actions of such kind includes designing and introducing the grid of Institute for Studies in Theoretical Physics and Mathematics (IPM) where tries to aggregate universities and researching houses in the frame of a national grid and it has yet provided some of fundamental services of grid. This paper aims to provide a grid computing model for being used in universities and researching houses that implemented in Tarbiat Modares University by test.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122294624","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 : 2011-12-01DOI: 10.1109/ICDIM.2011.6093339
F. Alahmari
In recent years the web has advanced from a linked web of documents to also support structured and semantic web data. An increasing number of data providers are publishing their data on the web according to Linked Data principles. With this growth, consuming and manipulating multiple data sources are required in order to exploit the web of Linked Data. The goal of this paper is to provide a benchmark and a comparative study between two query approaches that can be used to manipulate Linked Data over the web. The comparison considers the state of the art approaches for query processing across Linked Data sources.
{"title":"Evaluating SPARQL using query federation and link traversal","authors":"F. Alahmari","doi":"10.1109/ICDIM.2011.6093339","DOIUrl":"https://doi.org/10.1109/ICDIM.2011.6093339","url":null,"abstract":"In recent years the web has advanced from a linked web of documents to also support structured and semantic web data. An increasing number of data providers are publishing their data on the web according to Linked Data principles. With this growth, consuming and manipulating multiple data sources are required in order to exploit the web of Linked Data. The goal of this paper is to provide a benchmark and a comparative study between two query approaches that can be used to manipulate Linked Data over the web. The comparison considers the state of the art approaches for query processing across Linked Data sources.","PeriodicalId":355775,"journal":{"name":"2011 Sixth International Conference on Digital Information Management","volume":"392 4-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120897366","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
扫码关注我们
求助内容：
应助结果提醒方式：