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

49th IEEE Frontiers in Education Conference (FIE)

作者： Amanullah, Kashif Univ Canterbury Dept Comp Sci Christchurch New Zealand

ISBN: (纸本)9781728117461

Teaching programming to school children is a challenging task. This report summarizes the research problem, and outlines the research questions around the issues with block based languages and suitability of elementary patterns as a possible solution. Results to date show a little use of important programming elements even after many years of use, and there is no clear sign of progression in skills with or without remixing.

关键词： programming patterns Scratch primary school students

来源：评论

学校读者我要写书评

暂无评论

Reusable Solutions for Implementing Usability Functionalities

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2015年第4期25卷 727-755页

作者： Rodriguez, Francy D. Acuna, Silvia T. Juristo, Natalia Univ Politecn Madrid Escuela Tecn Super Ingn Informat E-28660 Madrid Spain Univ Autonoma Madrid Dept Ingn Informat E-28049 Madrid Spain

Usability is a software system quality attribute. Although software engineers originally considered usability to be related exclusively to the user interface, it was later found to affect the core functionality of software applications. As of then, proposals for addressing usability at different stages of the software development cycle were researched. The objective of this paper is to present three reusable solutions at detailed design and programming level in order to effectively implement the Abort Operation, Progress Feedback and Preferences usability functionalities in web applications. To do this, an inductive research method was applied. We developed three web applications including the above usability functionalities as case studies. We looked for commonalities across the implementations in order to induce a general solution. The elements common to all three developed applications include: application scenarios, functionalities, responsibilities, classes, methods, attributes and code snippets. The findings were specified as an implementation-oriented design pattern and as programming patterns in three languages. Additional case studies were conducted in order to validate the proposed solution. The independent developers used the patterns to implement different applications for each case study. As a result, we found that solutions specified as patterns can be reused to develop web applications.

关键词： Software engineering programming patterns design patterns usability

来源：评论

学校读者我要写书评

暂无评论

Edelweiss: Automatic Storage Reclamation for Distributed programming

引用

PROCEEDINGS OF THE VLDB ENDOWMENT 2014年第6期7卷 481-492页

作者： Conway, Neil Alvaro, Peter Andrews, Emily Hellerstein, Joseph M. Univ Calif Berkeley Berkeley CA 94720 USA

Event Log Exchange (ELE) is a common programming pattern based on immutable state and messaging. ELE sidesteps traditional challenges in distributed consistency, at the expense of introducing new challenges in designing space reclamation protocols to avoid consuming unbounded storage. We introduce Edelweiss, a sublanguage of Bloom that provides an ELE programming model, yet automatically reclaims space without programmer assistance. We describe techniques to analyze Edelweiss programs and automatically generate application-specific distributed space reclamation logic. We show how Edelweiss can be used to elegantly implement a variety of communication and distributed storage protocols;the storage reclamation code generated by Edelweiss effectively garbage-collects state and often matches hand-written protocols from the literature.

关键词： Reclamation Application programs Application specific Distributed programming Distributed storage programming models programming patterns

来源：评论

学校读者我要写书评

暂无评论

Automatic parallelization of representative-based clustering algorithms for multicore cluster systems

引用

INTERNATIONAL JOURNAL OF DATA SCIENCE AND ANALYTICS 2020年第2期10卷 135-159页

作者： Islam, Saiyedul Balasubramaniam, Sundar Gupta, Shruti Brajesh, Shikhar Badlani, Rohan Labhishetty, Nitin Baid, Abhinav Goyal, Poonam Goyal, Navneet Birla Inst Technol & Sci Pilani Adv Data Analyt & Parallel Technol Lab Dept Comp Sci & Informat Syst Pilani Campus Pilani Rajasthan India

Ease of programming and optimal parallel performance have historically been on the opposite side of a trade-off, forcing the user to choose. With the advent of the Big Data era and the rapid evolution of sequential algorithms, the data analytics community can no longer afford the trade-off. We observed that several clustering algorithms often share common traits-particularly, algorithms belonging to the same class of clustering exhibit significant overlap in processing steps. Here, we present our observation on domain patterns in representative-based clustering algorithms and how they manifest as clearly identifiable programming patterns when mapped to a Domain Specific Language (DSL). We have integrated the signatures of these patterns in the DSL compiler for parallelism identification and automatic parallel code generation. The compiler either generates MPI C++ code for distributed memory parallel processing or MPI-OpenMP C++ code for hybrid memory parallel processing, depending upon the target architecture. Our experiments on different state-of-the-art parallelization frameworks show that our system can achieve near-optimal speedup while requiring a fraction of the programming effort, making it an ideal choice for the data analytics community. Results are presented for both distributed and hybrid memory systems.

关键词： Clustering Domain Specific Language Parallelizing compiler High Performance Computing programming patterns

来源：评论

学校读者我要写书评

暂无评论

Validating, Refining, and Identifying programming Plans Using Learning Curve Analysis on Code Writing Data 24

Validating, Refining, and Identifying Programming Plans Usin...

引用

20th Annual Conference on International Computing Education Research (ICER)

作者： Demirtas, Mehmet Arif Fowler, Max Hu, Nicole Cunningham, Kathryn Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9798400704758

Background and Context: A major difference between expert and novice programmers is the ability to recognize and apply common and meaningful patterns in code. Previous works have attempted to identify these patterns as programming plans, such as counting or filtering the items of a collection. However, these efforts primarily relied on expert opinions and yielded many varied sets of plans. No methods have been applied to evaluate these various programming plans as far as their alignment with novices' cognitive development. Objectives: In this work, we investigate which programming plans are learned as discrete skills. To this end, we evaluate how well students transfer their knowledge between problems that test a particular plan. Further, we explore how plan definitions can be improved to better represent student cognition using historical data on student performance collected from a programming course. Method: We apply learning curve analysis, a method for modeling student improvement on problems that test a particular skill, using programming plans as a skill model. More specifically, we study student submissions on code-writing exercises in Python from a CS1 class for non-majors that includes many small programming problems as well as implicit and explicit instruction on patterns. We compare the learning curves for ten programming plans across seven semesters of the same course. Findings: Students develop the skill of using some programming plans in their solutions, indicated by consistent declines in error rates on practice opportunities for a subset of plans in multiple semesters with various conditions. Most consistently learned plans have clear and concrete goals that can be explained in natural language, as opposed to having abstract definitions or being explained in terms of language structures. Implications: We show that learning curve analysis can be used to empirically assess the cognitive validity of proposed programming plans, as well as compare variou

关键词： learning curve analysis CS1 programming plans programming patterns knowledge components

来源：评论

学校读者我要写书评

暂无评论

A Rapid Prototyping Approach for High Performance Density-Based Clustering 6

A Rapid Prototyping Approach for High Performance Density-Ba...

引用

6th IEEE International Conference on Data Science and Advanced Analytics (DSAA)

作者： Islam, Saiyedul Balasubramaniam, Sundar Goyal, Poonam Sultana, Ankit Bhutani, Lakshit Raje, Saurabh Goyal, Navneet Birla Inst Technol & Sci Pilani Adv Data Analyt & Parallel Technol Lab Dept Comp Sci & Informat Syst Pilani Campus Pilani Rajasthan India

ISBN: (纸本)9781728144931

Big Data has significantly increased the dependence of data analytics community on High Performance Computing (HPC) systems. However, efficiently programming an HPC system is still a tedious task requiring specialized skills in parallelization and the use of platform-specific languages as well as mechanisms. We present a framework for quickly prototyping new/existing density-based clustering algorithms while obtaining low running times and high speedups via automatic parallelization. The user is required only to specify the sequential algorithm in a Domain Specific Language (DSL) for clustering at a very high level of abstraction. The parallelizing compiler for the DSL does the rest to leverage distributed systems in particular, typical scale-out clusters made of commodity hardware. Our approach is based on recurring, parallelizable programming patterns known as Kernels, which are identified and parallelized by the compiler. We demonstrate the ease of programming and scalable performance for DBSCAN, SNN, and RECOME algorithms. We also establish that the proposed approach can achieve performance comparable to state-of-the-art manually parallelized implementations while requiring minimal programming effort that is several orders of magnitude smaller than those required on other parallel platforms like MPI/Spark.

关键词： Clustering Domain Specific Language Big Data Engineering programming patterns Parallelizing Compiler

来源：评论

学校读者我要写书评

暂无评论

Using GitHub Copilot to Solve Simple programming Problems 2023

Using GitHub Copilot to Solve Simple Programming Problems

引用

54th Annual ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE TS)

作者： Wermelinger, Michel Open Univ Sch Comp & Commun Milton Keynes Bucks England

ISBN: (纸本)9781450394314

The teaching and assessment of introductory programming involves writing code that solves a problem described by text. Previous research found that OpenAI's Codex, a natural language machine learning model trained on billions of lines of code, performs well on many programming problems, often generating correct and readable Python code. GitHub's version of Codex, Copilot, is freely available to students. This raises pedagogic and academic integrity concerns. Educators need to know what Copilot is capable of, in order to adapt their teaching to AI-powered programming assistants. Previous research evaluated the most performant Codex model quantitatively, e.g. how many problems have at least one correct suggestion that passes all tests. Here I evaluate Copilot instead, to see if and how it differs from Codex, and look qualitatively at the generated suggestions, to understand the limitations of Copilot. I also report on the experience of using Copilot for other activities asked of students in programming courses: explaining code, generating tests and fixing bugs. The paper concludes with a discussion of the implications of the observed capabilities for the teaching of programming.

关键词： code generation test generation code explanation programming exercises programming patterns novice programming introductory programming academic integrity OpenAI Codex

来源：评论

学校读者我要写书评

暂无评论

Teaching Resources for Young Programmers: the use of patterns

Teaching Resources for Young Programmers: the use of Pattern...

引用

IEEE Frontiers in Education Conference (FIE)

作者： Amanullah, Kashif Bell, Tim Univ Canterbury Dept Comp Sci Christchurch New Zealand

ISBN: (纸本)9781728189611

This Full Paper in the Research Category identifies and evaluates teaching resources suitable for teaching younger students using the Scratch and Python programming languages. Choosing suitable resources to introduce programming to children is a balance between making sure they are appropriate to their skills such as literacy and numeracy, and are motivating in their social context. Resources need to strike a balance between allow early success, but also introduce genuine programming skills, so that students can progress their programming skills rather than repeating simple tasks over and over. An important element is the choice of teaching resources used to support students' learning. We propose using elementary programming patterns as a measure of how comprehensive a teaching resource for programming is. Note that this doesn't mean advocating that students should be pressed to learn advanced patterns quickly, but it does provide a measure of how deeply a particular resource covers general programming concepts. We identify a set of patterns that are relevant to basic programming practice, and have analyzed some recommended online teaching resources and a small sample of introductory programming books for Scratch and Python against this set of patterns. The use of given set of patterns was relatively low, but some resources did introduce a range of patterns, and some new patterns emerged from the analysis that seemed to be used frequently in Scratch.

关键词： programming patterns Scratch primary school students

来源：评论

学校读者我要写书评

暂无评论

Pattern-based Automatic Parallelization of Representative-based Clustering Algorithms 5

Pattern-based Automatic Parallelization of Representative-ba...

引用

5th IEEE International Conference on Data Science and Advanced Analytics (IEEE DSAA)

作者： Islam, Saiyedul Balasubramaniam, Sundar Gupta, Shruti Brajesh, Shikhar Badlani, Rohan Labhishetty, Nitin Baid, Abhinav Goyal, Poonam Goyal, Navneet Birla Inst Technol & Sci Pilani Dept Comp Sci & Informat Syst Adv Data Analyt & Parallel Technol Lab Pilani Campus Pilani Rajasthan India BITS Pilani Pilani Rajasthan India

ISBN: (纸本)9781538650905

Ease of programming and optimal parallel performance have historically been on the opposite side of a tradeoff, forcing the user to choose. With the advent of the Big Data era and rapid evolution of sequential algorithms, the data analytics community can no longer afford the tradeoff. We observed that several clustering algorithms often share common traits-particularly, algorithms belonging to same class of clustering exhibit significant overlap in processing steps. Here, we present our observation on domain patterns in Representative-based clustering algorithms and how they manifest as clearly identifiable programming patterns when mapped to a Domain Specific Language (DSL). We have integrated the signatures of these patterns in the DSL compiler for parallelism identification and automatic parallel code generation. Our experiments on different state-of-the-art parallelization frameworks shows that our system is able to achieve near-optimal speedup while requiring a fraction of the programming effort, making it an ideal choice for the data analytics community.

关键词： Clustering Domain Specific Language Parallelizing Compiler High Performance Computing programming patterns

来源：评论

学校读者我要写书评

暂无评论

GroupSpeak: High-level language extension for workflow capability

GroupSpeak: High-level language extension for workflow capab...

引用

IEEE International Conference on Web Services (ICWS 2009)

作者： Gutman, Moshe Radhakrishnan, Sridhar Kim, Changwook Sekharan, Chandra N. Laufer, Konstantin Univ Oklahoma Sch Comp Sci Norman OK 73019 USA Loyola Univ Dept Comp Sci Chicago IL USA

ISBN: (纸本)9781424449293

Currently, workflow systems are either XML based or component based. Both paradigms have usability deficiencies. XML is not designed for procedural programming. Legacy code is difficult to adapt to component based systems. We propose a new paradigm by adding workflow keywords to an existing high-level language. This approach, called GroupSpeak, uses a procedural style of programming and allows for easy introduction of workflow patterns to legacy code. The programmer can leverage their existing knowledge of the high-level language to easily add workflow capabilities to their applications.

关键词： workflow language extensions programming patterns web services composition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：