Search

The technology works as a catalyst through which many changes occur in the learning approaches, teaching methodologies, research arena, in the work environment and in the use of information and knowledge. Helping students to learn using technological tools rather than using conventional techniques has become more popular in the 21st century in colleges and schools in the domain of computer science. Integration of technological tools will help teachers to the international requirement to use technology-based teaching and learning tools instead of traditional teaching methods. Most researchers agree on the significance of the use of technological tools in different education systems. However, current state-of-the-art depicts that there is no comprehensive study that provides an analysis of different technological tools e.g. computer-based, games based, mobile based, and multimedia technologies used in education. This paper provides a comprehensive review of several of the most popular teaching methodologies (collaborative, active learning, problem-based, inductive teaching method) and technological tools i.e. computer-based (ICT, CAI, CBI), games based (serious games, web games, micro-games, videos games), mobile based (laptop, PDAs, tablets, mobile phones), online learning tools (flipped classroom, web MOOCs) and multimedia technologies (Videos, MCMs, MAMCM). The purpose of this research paper is to scrutinize the roles and effectiveness of technological tools in teaching and learning process and it provides the definition of each method, along with the similarities and differences among these teaching methodologies and technological tools. Even though the strength of each individual method is something that is met with varying degrees of evidence, teaching with the help of technological tools has been found to be generally more effective or at least equally effective to traditional methods of teaching. The purpose of the use of technology in teaching and learning process is to improve productivity, the effectiveness of current practices and bring pedagogical changes which are beneficial for the betterment of education. We explore the theoretical literature available about the influence of technology and its effectiveness in the field of education. In teaching and learning process, the use of technological tools increases interaction between teachers and students. To incorporate technology, educators and teachers must implement the right technological tools to make the environment more innovative for the students.

Summary: Due to recent developments in location‐based services and mobile computing, the need for indices for moving objects has been strengthened to improve the response time of a query operation. With a single index in place for managing both the update and query operations for moving objects, the index needs to be updated each time the object moves. This deteriorates the performance of concurrent query operations. It is critical to handle the conflicts between continuous update and query operations effectively using appropriate concurrency control protocol otherwise, inconsistent results will be reported. Many indices have been proposed in the literature for moving objects but they lack the support for processing concurrent operations. Further, the consistent indices in the literature are based on tree structure that have computationally expensive split/merge operations that can negatively affect the response time of query processing algorithms. Moreover such tree based indices are proposed for historical and future timeline data. As the scope of this article is on current timeline and concurrent continuous query operations, therefore, we exploit state of the art hash‐based indices in the literature and presented the two consistent versions. The comparative analysis of the indices is performed and meaningful findings are also presented along. [ABSTRACT FROM AUTHOR]

Summary: Recently, mobile computing has changed the way that spatial data and GIS are processed. Unlike wired and stand‐alone GIS, now the trend has been switched from offline to real‐time data processing using location aware services, such as GPS technology. The increased usage of location aware services in multiuser real‐time environment has made transaction management incredibly significant. If the simultaneous query operations on the same data item are not handled intelligently then this results in data inconsistency issue. Concurrency control protocol is one of the primary aspects that helps in overcoming this issue a in multiuser environment. To the best of our knowledge, the impact of technological advancements on concurrency control has not been thoroughly studied in the literature. In this article, we explored the literature on concurrency control algorithms in depth with respect to real‐time applications and the applications with moving objects. We defined a taxonomy of concurrency control solutions and assessed the maturity of these solutions in the light of characteristics of real‐time and mobile environment. We compared the most recent developments made in the literature and presented meaningful insights. Challenges are also identified and discussed, which can assist in doing research in this domain in future. [ABSTRACT FROM AUTHOR]

The edit distance between two sequences is the minimum number of weighted transformation-operations that are required to transform one string into the other. The weighted transformation-operations are insert, remove, and substitute. Dynamic programming solution to find edit distance exists but it becomes computationally intensive when the lengths of strings become very large. This work presents a novel parallel algorithm to solve edit distance problem of string matching. The algorithm is based on resolving dependencies in the dynamic programming solution of the problem and it is able to compute each row of edit distance table in parallel. In this way, it becomes possible to compute the complete table in min(m,n) iterations for strings of size m and n whereas state-of-the-art parallel algorithm solves the problem in max(m,n) iterations. The proposed algorithm also increases the amount of parallelism in each of its iteration. The algorithm is also capable of exploiting spatial locality while its implementation. Additionally, the algorithm works in a load balanced way that further improves its performance. The algorithm is implemented for multicore systems having shared memory. Implementation of the algorithm in OpenMP shows linear speedup and better execution time as compared to state-of-the-art parallel approach. Efficiency of the algorithm is also proven better in comparison to its competitor. [ABSTRACT FROM AUTHOR]

Cyber physical system (CPS) applications are widely used to control critical infrastructure of various application domains, eg, medical health care, energy, and power, to name a few. Such applications usually take input data from sensors, estimate current state of the system, and then based on the estimation, make critical decisions to control the underlying infrastructure automatically. Therefore, security and integrity of the (system state) data are critically important to ensure safe operations of CPS. In this paper, we present a review of security of various data management systems used in CPS. Since CPS are composed of systems of (sub)systems that generate a huge amount of data (ie, periodical sensor input data), therefore, recently, NoSQL and NewSQL data management systems have emerged as popular data management systems to support efficient and scalable analysis of unstructured data. Unfortunately, these systems were not initially build for data security and thus are vulnerable to numerous security attacks. Considering flexible data model and efficient access methods in NoSQL and NewSQL, we discuss the security attacks on such data management systems and their corresponding solutions to mitigate them. In particular, we analyze the system and data security of popular NoSQL and NewSQL systems. To analyze that, we defined feature vectors for system and data security and compared the data systems against them. Finally, we propose security solutions for data management systems by identifying various security vulnerabilities in internal security algorithms of such systems. [ABSTRACT FROM AUTHOR]