Pub Date : 2020-01-01DOI: 10.4018/ijitwe.2020010101
C. Camilleri, Joseph G. Vella, Vitezslav Nezval
Data consistency defines how usable a data set is. Causal consistency is the strongest type of consistency that can be achieved when data is stored in multiple locations, and fault tolerance is desired. Thespis is a middleware that innovatively leverages the Actor model to implement causal consistency over a DBMS, whilst abstracting complexities for application developers behind a REST interface. Following the evaluation of correctness, performance and scalability of Thespis, it is illustrated how a business application can be guaranteed causal consistency, but still encounter Time-To-Check-Time-To-Use (TOCTOU) race conditions. The design and implementation of ThespisTRX is given, which builds upon, and extends, the Thespis middleware to offer read-only transaction capabilities, allowing clients to read a causally-consistent version of multiple data entities. A correctness analysis illustrates how ThespisTRX avoids TOCTOU race conditions, and empirical performance tests show that this can be achieved with minimal overheads.
数据一致性定义了数据集的可用性。当数据存储在多个位置并且需要容错时，因果一致性是可以实现的最强类型的一致性。thespiis是一种中间件，它创新性地利用Actor模型在DBMS上实现因果一致性，同时为应用程序开发人员在REST接口后面抽象复杂性。在对Thespis的正确性、性能和可伸缩性进行评估之后，将说明如何保证业务应用程序的因果一致性，但仍然会遇到time - to - check - to - use (TOCTOU)竞争条件。本文给出了ThespisTRX的设计和实现，它构建并扩展了thespiis中间件，以提供只读事务功能，允许客户端读取多个数据实体的因果一致版本。正确性分析说明了ThespisTRX如何避免TOCTOU竞争条件，经验性能测试表明，这可以以最小的开销实现。
{"title":"ThespisTRX","authors":"C. Camilleri, Joseph G. Vella, Vitezslav Nezval","doi":"10.4018/ijitwe.2020010101","DOIUrl":"https://doi.org/10.4018/ijitwe.2020010101","url":null,"abstract":"Data consistency defines how usable a data set is. Causal consistency is the strongest type of consistency that can be achieved when data is stored in multiple locations, and fault tolerance is desired. Thespis is a middleware that innovatively leverages the Actor model to implement causal consistency over a DBMS, whilst abstracting complexities for application developers behind a REST interface. Following the evaluation of correctness, performance and scalability of Thespis, it is illustrated how a business application can be guaranteed causal consistency, but still encounter Time-To-Check-Time-To-Use (TOCTOU) race conditions. The design and implementation of ThespisTRX is given, which builds upon, and extends, the Thespis middleware to offer read-only transaction capabilities, allowing clients to read a causally-consistent version of multiple data entities. A correctness analysis illustrates how ThespisTRX avoids TOCTOU race conditions, and empirical performance tests show that this can be achieved with minimal overheads.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"26 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75885110","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 : 2019-10-01DOI: 10.4018/ijitwe.2019100101
V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki
In this research, the authors propose a novel tree structure called GANDIVA which computes true supports of all temporal itemsets by performing a tree-based scan and eliminating the database scan which is required for SPAMINE, G-SPAMINE, MASTER, and Z-SPAMINE approaches. The idea is to construct the tree called GANDIVA which determines support of all time-stamped temporal itemsets from the constructed tree. Another important advantage of the proposed approach is that it does not require the original database to be retained in the memory after a time profiled pattern tree (GANDIVA) is constructed from the original database. The significant advantage of GANDIVA over SPAMINE, G-SPAMINE, Z-SPAMINE, and MASTER is that GANDIVA requires zero database scans after the tree construction. GANDIVA is the pioneering research to propose a novel tree-based framework for seasonal temporal data mining.
{"title":"GANDIVA","authors":"V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki","doi":"10.4018/ijitwe.2019100101","DOIUrl":"https://doi.org/10.4018/ijitwe.2019100101","url":null,"abstract":"In this research, the authors propose a novel tree structure called GANDIVA which computes true supports of all temporal itemsets by performing a tree-based scan and eliminating the database scan which is required for SPAMINE, G-SPAMINE, MASTER, and Z-SPAMINE approaches. The idea is to construct the tree called GANDIVA which determines support of all time-stamped temporal itemsets from the constructed tree. Another important advantage of the proposed approach is that it does not require the original database to be retained in the memory after a time profiled pattern tree (GANDIVA) is constructed from the original database. The significant advantage of GANDIVA over SPAMINE, G-SPAMINE, Z-SPAMINE, and MASTER is that GANDIVA requires zero database scans after the tree construction. GANDIVA is the pioneering research to propose a novel tree-based framework for seasonal temporal data mining.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"35 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80943347","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 : 2019-07-01DOI: 10.4018/ijitwe.2019070103
G. Khan, A. Sarkar, S. Sengupta
Enterprise cloud bus (ECBS) is a multi-agent-based abstraction layer framework, responsible for publishing and discovery of services in an Inter-cloud environment. Our work focuses on the service discovery model (HBSD) using Hadoop that leads to the challenges of automatic web service discovery patterns. It has been observed that the RDBMS can handle only data sizes up to a few Terabytes but fails to scale beyond that, so Apache Hadoop can be used for parallel processing of massive datasets. This article provides a novel Hadoop based Service Discovery (HBSD) approach that can handle vast amount of datasets generated from heterogeneous cloud services. The novelty of the proposed architecture coordinates cloud participants, automate service registration pattern, reconfigure discover services and focus on aggregating heterogeneous services from Inter-cloud environments. Moreover, this particle states a novel and efficient algorithm (HBSDMCA) for finding the appropriate service as per user's requirements that can provide higher QoS to the user request for web services.
{"title":"HBSD","authors":"G. Khan, A. Sarkar, S. Sengupta","doi":"10.4018/ijitwe.2019070103","DOIUrl":"https://doi.org/10.4018/ijitwe.2019070103","url":null,"abstract":"Enterprise cloud bus (ECBS) is a multi-agent-based abstraction layer framework, responsible for publishing and discovery of services in an Inter-cloud environment. Our work focuses on the service discovery model (HBSD) using Hadoop that leads to the challenges of automatic web service discovery patterns. It has been observed that the RDBMS can handle only data sizes up to a few Terabytes but fails to scale beyond that, so Apache Hadoop can be used for parallel processing of massive datasets. This article provides a novel Hadoop based Service Discovery (HBSD) approach that can handle vast amount of datasets generated from heterogeneous cloud services. The novelty of the proposed architecture coordinates cloud participants, automate service registration pattern, reconfigure discover services and focus on aggregating heterogeneous services from Inter-cloud environments. Moreover, this particle states a novel and efficient algorithm (HBSDMCA) for finding the appropriate service as per user's requirements that can provide higher QoS to the user request for web services.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4018/ijitwe.2019070103","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70460348","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 : 2018-10-01DOI: 10.4018/ijitwe.2018100102
Rihab Ben Lamine, Raoudha Ben Jemaa, Ikram Ben Amor
This article proposes a formal specification method for Web services composition based on context-aware semantic planning graph technique. The authors first use a graph planning technique to conceive an adaptable semantic Web services composition. They use an ontology based context model for extending Web services descriptions with information about the most suitable context for its use. Then, the composition problem is transformed into a semantic context aware graph planning problem to build a set of best-composed Web services based on the user's context. Because of the error-prone nature of the Web services composition process, and with the integration of context information in this process, the complexity of Web services-based systems is increasing, hence the need for formal specification and verification approaches of such systems. The authors seek to use CCA calculus, to formalize Web services composition expressed in terms of adaptable OWL-S, and transform the description of workflow patterns into the description patterns in terms of CCA, a calculus for context-aware ambients.
{"title":"Formal Specification of Adaptable Semantic Web Services Composition","authors":"Rihab Ben Lamine, Raoudha Ben Jemaa, Ikram Ben Amor","doi":"10.4018/ijitwe.2018100102","DOIUrl":"https://doi.org/10.4018/ijitwe.2018100102","url":null,"abstract":"This article proposes a formal specification method for Web services composition based on context-aware semantic planning graph technique. The authors first use a graph planning technique to conceive an adaptable semantic Web services composition. They use an ontology based context model for extending Web services descriptions with information about the most suitable context for its use. Then, the composition problem is transformed into a semantic context aware graph planning problem to build a set of best-composed Web services based on the user's context. Because of the error-prone nature of the Web services composition process, and with the integration of context information in this process, the complexity of Web services-based systems is increasing, hence the need for formal specification and verification approaches of such systems. The authors seek to use CCA calculus, to formalize Web services composition expressed in terms of adaptable OWL-S, and transform the description of workflow patterns into the description patterns in terms of CCA, a calculus for context-aware ambients.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"32 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82025534","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 : 2016-04-01DOI: 10.4018/IJITWE.2016040103
A. Honarvar, A. Sami
Advances in sensing techniques and IOT enabled the possibility to gain precise information about devices in smart home and smart city environments. Data analysis for sensors and devices may help us develop friendlier systems for smart city or smart home. Sequence pattern mining extracts interesting sequence pattern from data. Electricity usage dose follow a sequence of events. In this study the authors investigate this issue and extracted valuable sequence pattern from real appliances' power usage dataset using PrefixSpan. The experiments in this research is implemented on Spark as a novel distributed and parallel big data processing platform on two different clusters and interesting findings are obtained. These findings show the importance of extracting sequence pattern from power usage data to various applications such as decreasing CO2 and greenhouse gas emission by decreasing the electricity usage. The findings also show the needs to bring big data platforms to processing such kind of data which is captured in smart home and smart cities.
{"title":"Extracting Usage Patterns from Power Usage Data of Homes' Appliances in Smart Home using Big Data Platform","authors":"A. Honarvar, A. Sami","doi":"10.4018/IJITWE.2016040103","DOIUrl":"https://doi.org/10.4018/IJITWE.2016040103","url":null,"abstract":"Advances in sensing techniques and IOT enabled the possibility to gain precise information about devices in smart home and smart city environments. Data analysis for sensors and devices may help us develop friendlier systems for smart city or smart home. Sequence pattern mining extracts interesting sequence pattern from data. Electricity usage dose follow a sequence of events. In this study the authors investigate this issue and extracted valuable sequence pattern from real appliances' power usage dataset using PrefixSpan. The experiments in this research is implemented on Spark as a novel distributed and parallel big data processing platform on two different clusters and interesting findings are obtained. These findings show the importance of extracting sequence pattern from power usage data to various applications such as decreasing CO2 and greenhouse gas emission by decreasing the electricity usage. The findings also show the needs to bring big data platforms to processing such kind of data which is captured in smart home and smart cities.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"99 1","pages":"172-178"},"PeriodicalIF":0.6,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78699151","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-07-01DOI: 10.4018/IJITWE.2013070102
H. Mohamed, Bensebaa Taher
This paper describes an adaptive and intelligent tutoring system AITS based on multiple intelligences and expert system. Most of adaptive and intelligent tutoring systems based their adaptation to user's skill level. Other learner features taken into account are background, hyperspace experience, preferences and interests. However, less attention was paid to multiple intelligences and their effects on learning. Moreover, to design AITS which can manage both different disciplinary domains and a guide for the learner is difficult. The specialization of the analysis treatments is responsible for the loss of reusability for the other disciplinary domains. To overcome these limitations, the authors will try to combine the benefits of paradigms adaptive hypermedia, intelligent tutoring system, multiple intelligences in order to adapt the course to the needs and intellectual abilities of each learner.
{"title":"Combining Expert Systems and Multiple Intelligences in an Adaptive and Intelligent Tutoring System","authors":"H. Mohamed, Bensebaa Taher","doi":"10.4018/IJITWE.2013070102","DOIUrl":"https://doi.org/10.4018/IJITWE.2013070102","url":null,"abstract":"This paper describes an adaptive and intelligent tutoring system AITS based on multiple intelligences and expert system. Most of adaptive and intelligent tutoring systems based their adaptation to user's skill level. Other learner features taken into account are background, hyperspace experience, preferences and interests. However, less attention was paid to multiple intelligences and their effects on learning. Moreover, to design AITS which can manage both different disciplinary domains and a guide for the learner is difficult. The specialization of the analysis treatments is responsible for the loss of reusability for the other disciplinary domains. To overcome these limitations, the authors will try to combine the benefits of paradigms adaptive hypermedia, intelligent tutoring system, multiple intelligences in order to adapt the course to the needs and intellectual abilities of each learner.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"12 1","pages":"22-33"},"PeriodicalIF":0.6,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70460210","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 : 2008-01-01DOI: 10.4018/jitwe.2008010105
Wei Sun, D. Taniar, T. Torabi
Advances in image acquisition and storage technology have led to tremendous growth in very large and detailed image databases. These images, once analysed, can reveal useful information to our uses. The focus for image mining in this article is clustering of shoe prints. This study leads to the work in forensic data mining. In this article, we cluster selected shoe prints using k-means and expectation maximisation (EM). We analyse and compare the results of these two algorithms.
{"title":"Image Mining: A Case for Clustering Shoe prints","authors":"Wei Sun, D. Taniar, T. Torabi","doi":"10.4018/jitwe.2008010105","DOIUrl":"https://doi.org/10.4018/jitwe.2008010105","url":null,"abstract":"Advances in image acquisition and storage technology have led to tremendous growth in very large and detailed image databases. These images, once analysed, can reveal useful information to our uses. The focus for image mining in this article is clustering of shoe prints. This study leads to the work in forensic data mining. In this article, we cluster selected shoe prints using k-means and expectation maximisation (EM). We analyse and compare the results of these two algorithms.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"287 1","pages":"1552-1567"},"PeriodicalIF":0.6,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74768430","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 : 2005-11-20DOI: 10.4018/jitwe.2007070105
Jaime Gómez, A. Bia, Antonio Párraga
This article describes the engineering foundations of VisualWADE, a CASE tool to automate the production of Web applications. VisualWADE follows a model-driven approach focusing on requirements analysis, high level design, and rapid prototyping. In this way, an application evolves smoothly from the first prototype to the final product, and its maintenance is a natural consequence of development. The article also discusses the lessons learned in the development of the tool and its application to several case studies in the industrial context.
{"title":"Tool Support for Model-driven Development of Web Applications","authors":"Jaime Gómez, A. Bia, Antonio Párraga","doi":"10.4018/jitwe.2007070105","DOIUrl":"https://doi.org/10.4018/jitwe.2007070105","url":null,"abstract":"This article describes the engineering foundations of VisualWADE, a CASE tool to automate the production of Web applications. VisualWADE follows a model-driven approach focusing on requirements analysis, high level design, and rapid prototyping. In this way, an application evolves smoothly from the first prototype to the final product, and its maintenance is a natural consequence of development. The article also discusses the lessons learned in the development of the tool and its application to several case studies in the industrial context.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"21 1","pages":"721-730"},"PeriodicalIF":0.6,"publicationDate":"2005-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84943024","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 : 1900-01-01DOI: 10.4018/ijitwe.2021040101
Santosh Kumar, R. Kumar
The internet is very huge in size and increasing exponentially. Finding any relevant information from such a huge information source is now becoming very difficult. Millions of web pages are returned in response to a user's ordinary query. Displaying these web pages without ranking makes it very challenging for the user to find the relevant results of a query. This paper has proposed a novel approach that utilizes web content, usage, and structure data to prioritize web documents. The proposed approach has applications in several major areas like web personalization, adaptive website development, recommendation systems, search engine optimization, business intelligence solutions, etc. Further, the proposed approach has been compared experimentally by other approaches, WDPGA, WDPSA, and WDPII, and it has been observed that with a little trade off time, it has an edge over these approaches.
{"title":"WDPMA","authors":"Santosh Kumar, R. Kumar","doi":"10.4018/ijitwe.2021040101","DOIUrl":"https://doi.org/10.4018/ijitwe.2021040101","url":null,"abstract":"The internet is very huge in size and increasing exponentially. Finding any relevant information from such a huge information source is now becoming very difficult. Millions of web pages are returned in response to a user's ordinary query. Displaying these web pages without ranking makes it very challenging for the user to find the relevant results of a query. This paper has proposed a novel approach that utilizes web content, usage, and structure data to prioritize web documents. The proposed approach has applications in several major areas like web personalization, adaptive website development, recommendation systems, search engine optimization, business intelligence solutions, etc. Further, the proposed approach has been compared experimentally by other approaches, WDPGA, WDPSA, and WDPII, and it has been observed that with a little trade off time, it has an edge over these approaches.","PeriodicalId":51925,"journal":{"name":"International Journal of Information Technology and Web Engineering","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70460567","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
扫码关注我们
求助内容：
应助结果提醒方式：