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

30th ACM Symposium on Applied Computing (SAC)

作者： Usener, Claus A. Univ Munster European Res Ctr Informat Syst Leonardo Campus 3 Munster Germany

ISBN: (纸本)9781450331968

This paper presents EASy-DSBuilder, an e-assessment tool for assessing fundamental concepts of binary tree data structure operations (i.e. search, insert, and delete operations) taught in Computer Science (CS) lectures. Students can manipulate data structures by adding nodes and freely move them, as well as connect and disconnect nodes within a drag-and-drop interface. At the same time, teachers can easily create new exercises based on their own data structures by uploading their Java implementation. We discuss EASy-DSBuilder's user interface and its general feedback mechanism. We also conducted a user study evaluating EASy-DSBuilder's user interface, visualisation techniques, and overall performance. Both qualitative and quantitative results show that usability is well-liked and learning success is promising.

关键词： automatic assessment visual algorithm simulation data structures and algorithms binary trees online learning eassessment immediate feedback

来源：评论

学校读者我要写书评

暂无评论

Design and architecture of an interactive eTextbook - The OpenDSA system

引用

SCIENCE OF COMPUTER PROGRAMMING 2014年 88卷 22-40页

作者： Fouh, Eric Karavirta, Ville Breakiron, Daniel A. Hamouda, Sally Hall, Simin Naps, Thomas L. Shaffer, Clifford A. Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA Aalto Univ Sch Sci Dept Comp Sci & Engn Helsinki Finland Virginia Tech Dept Mech Engn Blacksburg VA 24061 USA Univ Wisconsin Dept Comp Sci Oshkosh WI 54901 USA

The OpenDSA Project seeks to provide complete instructional materials for data structures and algorithms (DSA) courses. Our vision for a highly interactive eTextbook involves the use of many algorithm visualizations (AVs) and a wide range of interactive exercises with automated assessment. To realize this vision we require a mix of third-party and custom software components that make up a client/server-based web application. The massive amount content development required compels us to adopt an appropriate mix of open-source practices that will encourage broad contribution to the project. In this paper we describe the OpenDSA system architecture and the design goals that led to the present version of the system. (C) 2013 Elsevier B.V. All rights reserved.

关键词： eLearning eTextbook Automated assessment Algorithm visualization data structures and algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted databases Using a Bio-Molecular Algorithm on IBM Quantum's Computers

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2022年第2期21卷 286-293页

作者： Chang, Weng-Long Chung, Wen-Yu Hsiao, Chun-Yuan Wong, Renata Chen, Ju-Chin Feng, Mang Vasilakos, Athanasios V. Natl Kaohsiung Univ Sci & Technol Dept Comp Sci & Informat Engn Kaohsiung 80778 Taiwan Natl Ctr Theoret Sci Div Phys Taipei 10617 Taiwan Chinese Acad Sci Wuhan Inst Phys & Math Wuhan 430071 Peoples R China Guangzhou Inst Ind Technol Res Ctr Quantum Precis Measurement Guangzhou 511458 Peoples R China Fuzhou Univ Coll Math & Comp Sci Fuzhou 350116 Peoples R China

In this paper, we propose a bio-molecular algorithm with O(n(2)) biological operations, O(2(n-1)) DNA strands, O(n) tubes and the longest DNA strand, O(n), for inferring the value of a bit from the only output satisfying any given condition in an unsorted database with 2(n) items of n bits. We show that the value of each bit of the outcome is determined by executing our bio-molecular algorithm n times. Then, we show how to view a bio-molecular solution space with 2(n-1 )DNA strands as an eigenvector and how to find the corresponding unitary operator and eigenvalues for inferring the value of a bit in the output. We also show that using an extension of the quantum phase estimation and quantum counting algorithms computes its unitary operator and eigenvalues from bio-molecularsolution space with 2(n-1 )DNA strands. Next, we demonstratethat the value of each bit of the output solution can be determined by executing the proposed extended quantum algorithms n times. To verify our theorem, we find the maximum-sized clique to a graph with two vertices and one edge and the solution b that satisfies b(2) 1 (mod 15) and 1 < b < (15/2) using IBM Quantum's backend.

关键词： data structures and algorithms molecular algorithms quantum algorithms NP-complete problems

来源：评论

学校读者我要写书评

暂无评论

Barcelona

引用

JOURNAL OF AUTOMATED REASONING 1997年第2期18卷 171-176页

作者： Nieuwenhuis, R Rivero, JM Vallejo, MH TECH UNIV CATALONIA BARCELONA SPAIN

Here we describe the equational theorem prover Barcelona, in its version that participated in the CADE-13 ATP System Competition. The system was built on top of our toolkit of data structures and algorithms for automa... 详细信息

关键词： automated theorem proving competition Barcelona data structures and algorithms implementation

来源：评论

学校读者我要写书评

暂无评论

Comparing data streams using Hamming norms (How to zero in)

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND data ENGINEERING 2003年第3期15卷 529-540页

作者： Cormode, G datar, M Indyk, P Muthukrishnan, S Rutgers State Univ Ctr Discrete Math & Comp Sci Piscataway NJ 08854 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA MIT Comp Sci Lab Cambridge MA 02139 USA Rutgers State Univ Div Comp & Informat Sci Piscataway NJ 08854 USA AT&T Res Florham Pk NJ 07932 USA

Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely stored in traditional databases and instead must be processed "on the fly" as they are produced. Similarly, sensor networks produce multiple data streams of observations from their sensors. There is growing focus on manipulating data streams and, hence, there is a need to identify basic operations of interest in managing data streams, and to support them efficiently. We propose computation of the Hamming norm as a basic operation of interest. The Hamming norm formalizes ideas that are used throughout data processing. When applied to a single stream, the Hamming norm gives the number of distinct items that are present in that data stream, which is a statistic of great interest in databases. When applied to a pair of streams, the Hamming norm gives an important measure of (dis)similarity: the number of unequal item counts in the two streams. Hamming norms have many uses in comparing data streams. We present a novel approximation technique for estimating the Hamming norm for massive data streams;this relies on what we call the "l(0) sketch" and we prove its accuracy. We test our approximation method on a large quantity of synthetic and real stream data, and show that the estimation is accurate to within a few percentage points.

关键词： data stream analysis approximate query processing data structures and algorithms data reduction

来源：评论

学校读者我要写书评

暂无评论

Encouraging Reflection in Support of Learning data structures 19

Encouraging Reflection in Support of Learning Data Structure...

引用

Proceedings of the 50th ACM Technical Symposium on Computer Science Education

作者： Cheryl Resch Christina Gardner-McCune University of Florida Gainesville FL USA

ISBN: (纸本)9781450358903

Encouraging Reflection in Support of Learning data structures Cheryl Resch, University of Florida Christina Gardner-McCune, University of Florida Contact: [email protected] Our research looks at using reflection in teaching data structures and algorithms (DSA) to promote meaningful learning. This poster examines the differences in reflections produced by two different programming assignments in DSA at the University of Florida. In the first assignment, students were asked to implement a line editor using a linked list and in the reflection prompt students were asked to reflect on the use of the assigned data structure and what they would do differently if they could do the assignment again. In this assignment, the dominant reflection was a simple recounting of material taught in class. In 15% of the reflections, students identified an implementation improvement that could be used. In 25% of the reflections, students identified non-technical issues such as time management when reflecting on what they would do differently if they had to do the assignment again. In the second assignment, students were asked to code Google's page-rank algorithm and were allowed to choose a graph implementation. They were asked to reflect on their implementation and what they would do differently if they could do the assignment again. In this assignment, the dominant reflection, ?%, was about the appropriateness of the chosen graph implementation compared to other implementations. In their reflection on what they would do differently, only 12% of the reflections mentioned non-technical issues. This data suggests that giving students an opportunity to decide the implementation approach and providing more specific reflection prompts produces more technical reflections. DOI: HTTPS://***/10.1145/3287324.3293802

关键词： problem solving data structures and algorithms keywords: reflection

来源：评论

学校读者我要写书评

暂无评论

Chain Minors are FPT

引用

ALGORITHMICA 2017年第3期79卷 698-707页

作者： Blasiok, Jaroslaw Kaminski, Marcin Uniwersytet Warszawski Inst Informatyki Warsaw Poland

Given two finite partially ordered sets P and Q, we say that P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C-Q in Q with the property that f restricted to C-Q is an isomorphism of chains C and C-Q. We give an algorithm to decide whether a partially ordered set P is a chain minor of a partially ordered set Q, which runs in time O(|Q| log |Q|) for every fixed partially ordered set P. This solves an open problem from the monograph by Downey and Fellows (Parameterized complexity. Springer, New York, 1999) who asked whether the problem was fixed parameter tractable.

关键词： Partially ordered sets Parameterized complexity data structures and algorithms

来源：评论

学校读者我要写书评

暂无评论

IMAGE-CODING BY ADAPTIVE TREE-STRUCTURED SEGMENTATION

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1992年第6期38卷 1755-1767页

作者： WU, XL Department of Computer Science University of Western Ontario London ONT Canada

Proposed is a new algorithmic approach to segmentation-based image coding. A good compromise is achieve between segmentations by quadtree-based decomposition and by free region-growing in terms of time complexity and scene adaptability. Encoding is to recursively partition an image into convex n-gons, 3 less-than-or-equal-to n less-than-or-equal-to 8, until the pixels in current n-gon satisfy a uniformity criterion. The recursive partition generates a valid segmentation by aligning the polygon boundaries with image edges. This segmentation is embedded into a binary tree for compact encoding of its geometry. The compressed image is sent as a labeled pointerless binary tree, and decoding is simply polygon filling. High-compression ratios are obtained by balancing the accuracy and geometric complexity of the image segmentation;a key issue for segmentation-based image coding that was not addressed before. Due to its tree structure, the new method is also suitable for progressive image coding.

关键词： IMAGE CODING SEGMENTATION PIECEWISE FUNCTIONAL APPROXIMATION OPTIMIZATION DIGITAL GEOMETRY data structures and algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers

IEEE TRANSACTIONS ON NANOBIOSCIENCE

引用

IEEE TRANSACTIONS ON NANOBIOSCIENCE 2021年第3期20卷 354-376页

作者： Chang, Weng-Long Chen, Ju-Chin Chung, Wen-Yu Hsiao, Chun-Yuan Wong, Renata Vasilakos, Athanasios V. Natl Kaohsiung Univ Sci & Technol Dept Comp Sci & Informat Engn Kaohsiung 80778 Taiwan Nanjing Univ Dept Comp Sci & Technol Nanjing 210023 Peoples R China Univ Technol Sydney Sch Elect & Data Engn Ultimo NSW 2007 Australia Fuzhou Univ Coll Math & Comp Sci Fuzhou 350116 Peoples R China Lulea Univ Technol Dept Comp Sci Elect & Space Engn S-97187 Lulea Sweden

In this paper, we propose a bio-molecular algorithm with O(n(2) + m) biological operations, O(2(n)) DNA strands, O(n) tubes and the longest DNA strand, O(n), for solving the independent-set problem for any graph G with m edges and n vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with m NAND gates, (m+n x(n + 1)) AND gates and ((n x (n + 1))/2) NOT gates can find the maximal independent-set(s)to the independent-set problem for any graph G with m edges and n vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound Omega(2(n/2)) queries and the upper bound O(2(n/2)) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph G with m edges and n vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of n bits is to determine whether the given 2(n) real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is Omega(2(nx(2/3))) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to Omega((2(n/2))/(2(1/2))) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM's quantum computer.

关键词： Electron tubes DNA Computer science Quantum computing Computers Roads Urban areas data structures and algorithms independent-set problem molecular algorithms molecular computing quantum algorithms quantum computing

来源：评论

学校读者我要写书评

暂无评论

Algorithm Visualization and the Elusive Modality Effect 2021

Algorithm Visualization and the Elusive Modality Effect

引用

17th Annual ACM Conference on International Computing Education Research (ICER)

作者： Zavgorodniaia, Albina Tilantera, Artturi Korhonen, Ari Seppala, Otto Hellas, Arto Sorva, Juha Aalto Univ Espoo Finland

ISBN: (纸本)9781450383264

The modality effect in multimedia learning suggests that pictures are best accompanied by audio explanations rather than text, but this finding has not been replicated in computing education. We investigate which instructional modality works best as an accompaniment for algorithm visualizations. In a randomized controlled trial, learners were split into three conditions who viewed an instructional video on Dijkstra's algorithm, with diagrams accompanied by audio, text, or both. We find neither a modality effect in favor of the audio condition nor a verbal redundancy effect in favor of using only a single modality rather than both. Taken together with earlier research, our findings suggest that the modality effect is difficult to apply reliably and computing educators should not rush to integrate audio into visualizations in expectation of the effect. We discuss theoretical viewpoints that future research should attend to;these include alternative part-explanations of the modality effect and attention-based models of working memory, among others.

关键词： modality effect verbal redundancy effect data structures and algorithms algorithm visualization algorithm animation Dijkstra's algorithm replication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：