检索结果-内蒙古大学图书馆

Contextualized mobile game-based learning application for computing education

EDUCATION AND INFORMATION TECHNOLOGIES 2021年第3期26卷 2539-2562页

作者： Yadav, Alok Kumar Oyelere, Solomon Sunday Univ Eastern Finland Sch Comp FIN-80101 Joensuu Finland

This paper intends to present an overview of a mobile game-based learning application, BaghLearn that develops and upskills programming and algorithmic knowledge by cross-curricular capabilities through a traditional world-based game. The focus of this research was to explore the learning effectiveness of BaghLearn on students. Mixed method research approach was applied to collect, process and analyze the research data in which undergraduate students who had some prior knowledge or had taken algorithm courses were instructed to test the mobile game learning application. This study exhibits the idea of integrating learning with contextual mobile game as an effective approach in understanding the influence of games towards cognitive achievements of students in computing education. In addition, there are no major requirements for the use of this application (can be maintained in resource-constrained contexts such as Nepal), which makes it expressively satisfying and useful for students who are relentlessly using mobile devices. Besides, this study evaluated the influence of BaghLearn towards learning of the design and analysis of algorithm course, which is a compulsory course for most undergraduate computing education program. Furthermore, the study findings can be used as a guideline for developing learning solutions and usability evaluation of such solutions, especially for infrastructure-constrained contexts. Students using the BaghLearn opined that the application is easy to use, supportive and lead to improved learning satisfaction.

关键词： BaghLearn Computing education design and analysis of algorithms Game-based learning Nepalese higher education system Usability evaluation

来源：评论

学校读者我要写书评

暂无评论

Randomized Memoryless algorithms for the Weighted and the Generalized k-server Problems

引用

ACM TRANSACTIONS ON algorithms 2020年第1期16卷 14-14页

作者： Chiplunkar, Ashish Vishwanathan, Sundar Indian Inst Technol Delhi New Delhi 110016 India Indian Inst Technol Mumbai 400076 Maharashtra India

The weighted k-server problem is a generalization of the k-server problem wherein the cost of moving a server of weight A through a distance d is beta(i ). d. On uniform metric spaces, this models caching with caches having different page replacement costs. A memoryless algorithm is an online algorithm whose behavior is independent of the history given the positions of its k servers. In this article, we develop a framework to analyze the competitiveness of randomized memoryless algorithms. The key technical contribution is a method for working with potential functions defined implicitly as the solution of a linear system. Using this, we establish tight bounds on the competitive ratio achievable by randomized memoryless algorithms for the weighted k-server problem on uniform metrics. We first prove that there is an alpha(k)-competitive memoryless algorithm for this problem, where alpha(k) = alpha(2)(k-)(1) + 3 alpha(k-1 )+1 alpha(1)= 1. We complement this result by proving that no randomized memoryless algorithm can have a competitive ratio less than alpha(k). Finally, we prove that the above bounds also hold for the generalized k-server problem on weighted uniform metrics.

关键词： design and analysis of algorithms Caching and paging algorithms k-server algorithms

来源：评论

学校读者我要写书评

暂无评论

Force-Directed Graph Layouts by Edge Sampling 9

Force-Directed Graph Layouts by Edge Sampling

引用

9th IEEE Symposium on Large Data analysis and Visualization (LDAV)

作者： Gove, Robert Two Six Labs Arlington VA 22203 USA

ISBN: (纸本)9781728126050

Recent work shows that sampling algorithms can be an effective tool for graph visualization. This paper extends prior work by applying edge sampling algorithms to speed up the spring force calculation in force-directed graph layout algorithms. An experiment on 72 graphs finds that some sampling algorithms achieve comparable quality as no sampling. This result is confirmed with visualizations of the graph layout results. However, runtime improvements are small, especially for graphs with 10,000 vertices or fewer, indicating that the runtime savings might not be worth the risk to layout quality. Therefore, this paper suggests that accurate spring forces may be more important to force-directed graph layout algorithms than accurate electric forces. A copy of this paper plus the code and data to reproduce the results are available at https://***/4ja29/

关键词： Human-centered computing Visualization Visualization techniques Graph drawings Theory of computtion design and analysis of algorithms Streaming, sublinear and near linear time algorithms Sketching and sampling

来源：评论

学校读者我要写书评

暂无评论

The multi-budgeted and weighted bounded degree metric Steiner network problem

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2017年 104卷 36-48页

作者： Stamoulis, Georgios Maastricht Univ Dept Data & Knowledge Engn DKE POB 616 NL-6200 MB Maastricht Netherlands

We study the multi-budgeted version of the metric Survivable Network design Problem (SND) (Jain, 2001), also known as Steiner Network problem, where besides the usual connectivity requirements (i.e., lower bound on the number edge-disjoint paths) between pre-specified pairs of points, we are also asked to satisfy a set of extra linear constraints (the budgets). Based on combinatorial properties of extreme point solutions of the natural LP relaxation of the problem and using the iterative method, we design new approximation algorithms with the following performance guarantee: if any edge participates in at most f is an element of N budgets, then we show how we can device an (f + 2,f + 2) bi-criteria approximation algorithm in polynomial time i.e., return a solution with cost at most (2 + f) times the optimal one with a potential budget overflow bounded from above by the same factor. In other words, the approximation and budget violation guarantee we achieve is a linear function of the maximum frequency among all the edges in the budgets, as opposed to a function of the number of budgets themselves and this constitutes a strict improvement over the previous approaches. Our approach is flexible enough and we demonstrate how it can be used to provide a (4, 4) bi-criteria algorithm for the Minimum Weighted Bounded Degree version of the SND problem in which we have the standard SND connectivity constraints and, additionally, for every vertex v in the graph we have an upper bound on the sum of the weights of the edges incident to that edge in any feasible solution. These problems, besides their obvious theoretical interest, have numerous real life applications from Cloud Computing to Optical Networking systems. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Survivable Network design design and analysis of algorithms Fault tolerant computing Cloud Computing Communication networks

来源：评论

学校读者我要写书评

暂无评论

Distributing evacuees method to appropriate routes according to variation of person number 6

Distributing evacuees method to appropriate routes according...

引用

IEEE 6th Global Conference on Consumer Electronics (GCCE)

作者： Kimura, Takeru Funahashi, Kenji Itoh, Hirotaka Nagoya Inst Technol Dept Comp Sci Nagoya Aichi Japan

ISBN: (纸本)9781509040452

We often use shortest route to reach safety place when disaster occurs, that is because it takes shorter time than others in many cases. However, it sometimes cause congestion and make evacuation time longer. In this paper we propose a method of selecting appropriate route for each evacuee according to variation of person number. We explain algorithms to select appropriate route for each evacuee and to simulate evacuation using selected route.

关键词： Evacuation route Transportation Emergency management design and analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach

引用

International Journal of Applied and Computational Mathematics 2017年第3期3卷 1931-1950页

作者： Pal, Madhumangal Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India Department of Mathematics National Institute of Technology Durgapur Mahatma Gandhi Avenue Durgapur 713 209 West Bengal India

In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A set of programmes that are mutually exclusive in respect of time scheduling is called a session. We assume that a company sets the objective of selecting the popular programmes in k parallel sessions among different channels so as to make its commercial advertisement reach the maximum number of viewers, that is, a company selects k suitable programme slots simultaneously for advertisement. The aim of the paper is, therefore, to help the companies to select the programme slots, which are mutually exclusive with respect to the time schedule of telecasting time, in such a way that the total number of viewers of the selected programme in k parallel slots rises to the optimum level. It is shown that the solution of this problem is obtained by solving the maximum weight k-colouring problem on an interval graph. An algorithm is designed to solve this just-in-time optimization problem using O(kMn ² ) time, where n and M represent the total number of programmes of all channels and the upper bound of the viewers of all programmes of all channels respectively. The problem considered in this paper is a daily life problem which is modeled by k-colouring problem on interval graph. © 2016, Springer India Pvt. Ltd.

关键词： design and analysis of algorithms Graph colouring Graph theory Interval graphs Modelling

来源：评论

学校读者我要写书评

暂无评论

Ring Segmented and Block analysis Based Multi-feature Evaluation Model for Contrast Balancing 2nd

Ring Segmented and Block Analysis Based Multi-feature Evalua...

引用

2nd International Conference on Information, Communication and Computing Technology (ICICCT)

作者： Juneja, Kapil Maharshi Dayanand Univ Dept Comp Sci & Engn Univ Inst Engn & Technol Rohtak 124001 Haryana India

ISBN: (纸本)9789811065446;9789811065439

Image capturing in different indoor and outdoor environment requires high quality and sensing camera devices. Image capture in fog, night, rainy atmosphere, etc., can face an unequal contrast problem. Visibility is the primary concern for any image processing application to extract the content information and features accurately. In this paper, a ring segment based block feature evaluation method is provided to setup the enhancement individually in each segmented region. In this model, an intelligent method is applied to raw image to locate the regions with extreme visibility difference. The ring specific geographical mapping is applied to locate these regions. Three blocks from the region are evaluated based on visibility, entropy and frequency parameters. The comparative evaluation on block content strength is applied to get the referenced block blocks with maximum containment. Finally, each region block is mapped to this reference block to stabilize the contrast unbalancing. The proposed method is applied in real time captured images with different lighting effects. The comparative evaluation against histogram equalization method is applied for the PSNR and MSE parameters. The evaluation results show that the proposed method enhanced the visible quality and error robustness of dark, dull and faded images.

关键词： Image representations Appearance and texture representations Feature selection Image processing Visibility Image manipulation design and analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

Taming the Data Deluge to Unravel the Mysteries of the Universe 17

Taming the Data Deluge to Unravel the Mysteries of the Unive...

引用

26th International Conference on World Wide Web (WWW)

作者： Johnston-Hollitt, Melanie Victoria Univ Wellington Sch Chem & Phys Sci Wellington New Zealand Peripety Sci Ltd Wellington New Zealand

ISBN: (纸本)9781450349130

Modern Astrophysics is one of the most data intensive research fields in the world and is driving many of the required innovations in the 'big data' space. Foremost in astronomy in terms of data generation is radio astronomy, and in the last decade an increase in global interest and investment in the field had led to a large number of new or upgraded facilities which are each currently generating petabytes of data per annum. The peak of this so-called 'radio renaissance' will be the Square Kilometre Array (SKA) - a global observatory designed to uncover the mysteries of the Universe. The SKA will create the highest resolution, fastest frame rate movie of the evolving Universe ever and in doing so will generate 160 terrabytes of data a day, or close to 5 zettabytes of data per annum. Furthermore, due to the extreme faintness of extraterrestrial radio signals, the telescope elements for the SKA must be located in radio quite parts of the world with very low population density. Thus the project aims to build the most data intensive scientific experiment ever, in some of the most remote places on Earth. Generating and serving scientific data products of this scale to a global community of researchers from remote locations is just the first of the 'big data' challenges the project faces. Coordination of a global network of tiered data resources will be required along with software tools to exploit the vast sea of results generated. In fact, to fully realize the enormous scientific potential of this project, we will need not only better data distribution and coordination mechanisms, but also improved algorithms, artificial intelligence and ontologies to extract knowledge in an automated way at a scale not yet attempted in science. In this keynote I will present an overview of the SKA project, outline the 'big data' challenges the project faces and discuss some of the approaches we are taking to tame the astronomical data deluge we face.

关键词： Square Kilometre Array Radio Astronomy Big Data design and analysis of algorithms Pattern Matching Machine Learning Data Compression

来源：评论

学校读者我要写书评

暂无评论

The String Matching algorithms Research Tool 20

The String Matching Algorithms Research Tool

引用

Prague Stringology Conference (PSC)

作者： Faro, Simone Lecroq, Thierry Borzi, Stefano Di Mauro, Simone Maggio, Alessandro Univ Catania Viale A Doria 6 I-95125 Catania Italy Univ Rouen LITIS EA 4108 F-76821 Mont St Aignan France

ISBN: (纸本)9788001059968

String matching is the problem of finding all occurrences of a given pattern in a given text. It is an extensively studied problem in computer science because of its direct application to several areas such as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 85 string matching algorithms have been proposed, and more than 50% of them in the last ten years. In this paper we present Smart, an efficient and flexible tool designed for developing, testing, comparing and evaluating string matching algorithms. It also provides the most comprehensive survey of online exact single string matching algorithms together with a set of corpora available for testing purposes.

关键词： string matching text processing design and analysis of algorithms testing framework algorithms survey experimental evaluation

来源：评论

学校读者我要写书评

暂无评论

Solving the Maximum Matching Problem on Bipartite Star₁₂₃-Free Graphs in Linear Time

引用

Open Journal of Discrete Mathematics 2016年第1期6卷 13-24页

作者： Ruzayn Quaddoura Department of Computer Science Faculty of Information Technology Zarqa University Zarqa Jordan

The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J... 详细信息

The bipartite Star₁₂₃-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star₁₂₃-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star₁₂₃, P₇-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.

关键词： Bipartite Graphs Decomposition of Graphs design and analysis of algorithms Matching

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：