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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

51 篇 会议
35 篇 期刊文献
4 篇 学位论文

馆藏范围

90 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

81 篇 工学
- 58 篇 计算机科学与技术...
- 51 篇 软件工程
- 8 篇 电气工程
- 6 篇 控制科学与工程
- 3 篇 信息与通信工程
- 1 篇 生物工程
- 1 篇 网络空间安全
8 篇 管理学
- 8 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
4 篇 理学
- 2 篇 数学
- 1 篇 生物学
- 1 篇 科学技术史(分学科...
1 篇 哲学
- 1 篇 哲学
1 篇 经济学
- 1 篇 理论经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

90 篇 programming by e...
37 篇 program synthesi...
8 篇 programming by d...
6 篇 data transformat...
5 篇 end-user program...
5 篇 machine learning
4 篇 program transfor...
4 篇 regular expressi...
3 篇 languages
3 篇 program repair
3 篇 end-user develop...
3 篇 regular expressi...
3 篇 synthesis
3 篇 domain specific ...
3 篇 direct manipulat...
3 篇 intelligent user...
3 篇 data transformat...
3 篇 user interface
3 篇 agents
2 篇 model-based user...

机构

5 篇 univ texas austi...
4 篇 univ michigan an...
4 篇 univ penn philad...
4 篇 rice univ housto...
3 篇 microsoft res re...
3 篇 microsoft redmon...
2 篇 ecole polytech f...
2 篇 mit media lab ca...
2 篇 hanyang univ dep...
2 篇 microsoft res re...
2 篇 univ trieste dia...
2 篇 waseda univ
2 篇 peking univ key ...
2 篇 univ trieste dia...
2 篇 university of mi...
2 篇 univ calif san d...
2 篇 natl univ singap...
2 篇 univ freiburg fr...
2 篇 univ calif san d...
2 篇 univ british col...

作者

10 篇 gulwani sumit
6 篇 dillig isil
4 篇 medvet eric
4 篇 radhakrishna arj...
4 篇 de lorenzo andre...
4 篇 bartoli alberto
4 篇 le vu
4 篇 soares gustavo
4 篇 chaudhuri swarat
4 篇 tarlao fabiano
3 篇 singh rishabh
3 篇 alur rajeev
3 篇 leung alan
3 篇 lee woosuk
3 篇 jin zhongjun
3 篇 macias jose a.
3 篇 tiwari ashish
2 篇 takasu atsuhiro
2 篇 knoblock craig a...
2 篇 lerner sorin

语言

88 篇 英文
2 篇 其他

检索条件"主题词=Programming By Example"

共 90 条记录，以下是41-50 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Attaching UI Enhancements to Websites with End Users 09

Attaching UI Enhancements to Websites with End Users

引用

27th Annual CHI Conference on Human Factors in Computing Systems

作者： Toomim, Michael Drucker, Steven M. Dontcheva, Mira Rahimi, Ali Thomson, Blake Landay, James A. Univ Washington DUB Grp Seattle WA 98195 USA

ISBN: (纸本)9781605582467

We present reform, a step toward write-once apply-anywhere user interface enhancements. The reform system envisions roles for both programmers and end users in enhancing existing websites to support new goals. First, a programmer authors a traditional masbup or browser extension, but they do not write a web scraper. Instead they use reform, which allows novice end users to attach the enhancement to their favorite sites with a scraping by-example interface. reform makes enhancements easier to program while also carrying the benefit that end users can apply the enhancements to any number of new websites. We present reform's architecture, user interface, interactive by-example extraction algorithm for novices, and evaluation, along with five example reform enabled enhancements.

关键词： web data extraction mashups programming by example end-user programming

来源：评论

学校读者我要写书评

暂无评论

RULER: Prebugging with Proxy-Based programming

RULER: Prebugging with Proxy-Based Programming

引用

IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)

作者： Repenning, Alexander Basawapatna, Ashok FHNW Switzerland Sch Educ Brugg Switzerland SUNY Old Westbury Math Comp & Informat Sci Long Isl City NY USA

ISBN: (纸本)9798350376920;9798350366136

While block-based programming has successfully eliminated critical syntactic barriers to programming, it remains unclear how effectively it aids in overcoming semantic, logical, and pragmatic programming challenges that hinder computational thinking. These challenges are likely to far outweigh the syntactic ones. With the goal of creating a highly accessible programming tool for young students using mobile devices, we explored the concept of pragmatic prebugging to begin addressing these challenges. By pragmatic prebugging, we refer to proactive debugging tools designed to prevent logical errors. This article introduces *** as a Computational Thinking Tool with built-in pragmatic prebugging, enabling novice programmers to create games through a paradigm we call proxy-based programming. A small study exploring error rates found statistically significant performance improvements of proxy-based programming compared to block-based programming.

关键词： block-based programming computational thinking programming by example mobile computing

来源：评论

学校读者我要写书评

暂无评论

Categories and Completeness of Visual programming and Direct Manipulation 20

Categories and Completeness of Visual Programming and Direct...

引用

Working Conference on Advanced Visual Interfaces (AVI)

作者： McGuffin, Michael J. Fuhrman, Christopher P. Ecole Technol Super Montreal PQ Canada

ISBN: (纸本)9781450375351

Recent innovations in visual programming and the use of direct manipulation for programming have demonstrated promise, but also raise questions about how far these approaches can be generalized. To clarify these issues, we present a categorization of systems for visual programming, programming-by-example, and similar systems. By examining each category, we elucidate the advantages, limitations, and ways to extend systems in each category. Our work makes it easier for researchers and designers to understand how visual programming languages (VPLs) and similar systems relate to each other, and how to extend them. We also indicate directions for future research.

关键词： visual programming languages direct manipulation programming by example output-directed programming taxonomy programming by demonstration

来源：评论

学校读者我要写书评

暂无评论

Iteratively Learning Conditional Statements in Transforming Data by example 14

Iteratively Learning Conditional Statements in Transforming ...

引用

14th IEEE International Conference on Data Mining (IEEE ICDM)

作者： Wu, Bo Knoblock, Craig A. Univ Southern Calif Dept Comp Sci 4676 Admiralty Way Marina Del Rey CA USA Univ Southern Calif Inst Informat Sci 4676 Admiralty Way Marina Del Rey CA USA

ISBN: (纸本)9781479942749

programming by example (PBE) enables users to transform data formats without coding. As data transformation often involves data with heterogeneous formats, it often requires learning a conditional statement to differentiate these different formats. However, to be practical, the method must learn the correct conditional statement efficiently and accurately with little user input. We present an approach to reduce the conditional statement learning time and the required amount of data. This approach takes advantage of the fact that users interact iteratively with a programming-by-example system. Our approach learns from previous iterations to guide the program generation for the current iteration. The final results show that our method successfully reduces the system running time and the number of examples.

关键词： data transformation clustering classification programming by example

来源：评论

学校读者我要写书评

暂无评论

Learning Text Patterns Using Separate-and-Conquer Genetic programming 18

Learning Text Patterns Using Separate-and-Conquer Genetic Pr...

引用

18th European Conference on Genetic programming (EuroGP)

作者： Bartoli, Alberto De Lorenzo, Andrea Medvet, Eric Tarlao, Fabiano Univ Trieste DIA Trieste Italy

ISBN: (纸本)9783319165011;9783319165004

The problem of extracting knowledge from large volumes of unstructured textual information has become increasingly important. We consider the problem of extracting text slices that adhere to a syntactic pattern and propose an approach capable of generating the desired pattern automatically, from a few annotated examples. Our approach is based on Genetic programming and generates extraction patterns in the form of regular expressions that may be input to existing engines without any post-processing. Key feature of our proposal is its ability of discovering automatically whether the extraction task may be solved by a single pattern, or rather a set of multiple patterns is required. We obtain this property by means of a separate-and-conquer strategy: once a candidate pattern provides adequate performance on a subset of the examples, the pattern is inserted into the set of final solutions and the evolutionary search continues on a smaller set of examples including only those not yet solved adequately. Our proposal outperforms an earlier state-of-the-art approach on three challenging datasets.

关键词： Regular expressions Multiple pattern programming by example Text extraction

来源：评论

学校读者我要写书评

暂无评论

LED: Tool for Synthesizing Web Element Locators 15

LED: Tool for Synthesizing Web Element Locators

引用

30th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)

作者： Bajaj, Kartik Pattabiraman, Karthik Mesbah, Ali Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9781509000258

Web applications are growing fast in popularity and complexity. One of the major problems faced by web developers is writing JavaScript code that can retrieve Document Object Model (DOM) tree elements, and is consistent among multiple DOM states. We attempt to solve this problem by automatically synthesizing JavaScript code that interacts with the DOM. We present an automated tool called LED, to analyze the DOM elements, and synthesize code to select the DOM elements based on the DOM hierarchy as well as the nature of task that the user wants to perform. LED provides an interactive drag and drop support inside the browser for selecting positive and negative examples of DOM elements. We find that LED supports at least 86% of the locators used in the JavaScript code of deployed web applications, and that the locators synthesized by LED have a recall of 98% and a precision of 63%. LED is fast, taking only 0.23 seconds on average to synthesize a locator.

关键词： Program synthesis programming by example Element locators CSS selectors Web applications

来源：评论

学校读者我要写书评

暂无评论

TRANSREGEX: Multi-modal Regular Expression Synthesis by Generate-and-Repair 21

TRANSREGEX: Multi-modal Regular Expression Synthesis by Gene...

引用

43rd IEEE/ACM International Conference on Software Engineering - Software Engineering in Practice (ICSE-SEIP) / 43rd ACM/IEEE International Conference on Software Engineering - New Ideas and Emerging Results (ICSE-NIER)

作者： Li, Yeting Li, Shuaimin Xu, Zhiwu Cao, Jialun Chen, Zixuan Hu, Yun Chen, Haiming Cheung, Shing-Chi Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing Peoples R China Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Peoples R China Hong Kong Univ Sci & Technol Hong Kong Peoples R China Chinese Acad Sci Sci & Technol Integrated Infomat Syst Lab Inst Software Beijing Peoples R China

ISBN: (纸本)9780738113197

Since regular expressions (abbrev. regexes) are difficult to understand and compose. automatically generating regexes has been an important research problem. This paper introduces TRANSREGEX, for automatically constructing regexes from both natural language descriptions and examples. To the best of our knowledge, TRANSREGEX is the first to treat the NI.P-and-example-based regex synthesis problem as the problem of NI.P-based synthesis with regex repair. For this purpose. we present novel algorithms for both NI.P-based synthesis and regex repair. We evaluate TRANSREGEX with ten relevant state-of-the-art tools on three publicly available datasets. The evaluation results demonstrate that the accuracy of our TRANSREGEX is 17.444, 35.8% and 38.9% higher than that of NI.P-based approaches on the three datasets, respectively. Furthermore, TRANSREGEX can achieve higher accuracy than the state-of-the-art multi-modal techniques with 10% to 39% higher accuracy on all three datasets. The evaluation results also indicate TRANSREGEX utilizing natural language and examples in a more effective way.

关键词： regex synthesis regex repair programming by natural languages programming by example

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Web Element Locators 15

Synthesizing Web Element Locators

引用

30th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)

作者： Bajaj, Kartik Pattabiraman, Karthik Mesbah, Ali Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9781509000258

To programmatically interact with the user interface of a web application, element locators are used to select and retrieve elements from the Document Object Model (DOM). Element locators are used in JavaScript code, Cascading stylesheets, and test cases to interact with the runtime DOM of the webpage. Constructing these element locators is, however, challenging due to the dynamic nature of the DOM. We find that locators written by web developers can be quite complex, and involve selecting multiple DOM elements. We present an automated technique for synthesizing DOM element locators using examples provided interactively by the developer. The main insight in our approach is that the problem of synthesizing complex multi-element locators can be expressed as a constraint solving problem over the domain of valid DOM states in a web application. We implemented our synthesis technique in a tool called LED, which provides an interactive drag and drop support inside the browser for selecting positive and negative examples. We find that LED supports at least 86% of the locators used in the JavaScript code of deployed web applications, and that the locators synthesized by LED have a recall of 98% and a precision of 63%. LED is fast, taking only 0.23 seconds on average to synthesize a locator.

关键词： Program synthesis programming by example Element locators CSS selectors Web applications

来源：评论

学校读者我要写书评

暂无评论

example-Guided Synthesis of Relational Queries 2021

Example-Guided Synthesis of Relational Queries

引用

42nd ACM SIGPLAN International Conference on programming Language Design and Implementation (PLDI)

作者： Thakkar, Aalok Naik, Aaditya Sands, Nathaniel Alur, Rajeev Naik, Mayur Raghothaman, Mukund Univ Penn Philadelphia PA 19104 USA Univ Southern Calif Los Angeles CA 90007 USA

ISBN: (纸本)9781450383912

Program synthesis tasks are commonly specified via input-output examples. Existing enumerative techniques for such tasks are primarily guided by program syntax and only make indirect use of the examples. We identify a class of synthesis algorithms for programming-by-examples, which we call example-Guided Synthesis (EGS), that exploits latent structure in the provided examples while generating candidate programs. We present an instance of EGS for the synthesis of relational queries and evaluate it on 86 tasks from three application domains: knowledge discovery, program analysis, and database querying. Our evaluation shows that EGS outperforms state-of-the-art synthesizers based on enumerative search, constraint solving, and hybrid techniques in terms of synthesis time, quality of synthesized programs, and ability to prove unrealizability.

关键词： programming by example example-Guided Synthesis

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Data Structure Transformations from Input-Output examples 15

Synthesizing Data Structure Transformations from Input-Outpu...

引用

36th ACM SIGPLAN Conference on programming Language Design and Implementation

作者： Feser, John K. Chaudhuri, Swarat Dillig, Isil Rice Univ Houston TX 77251 USA UT Austin Austin TX 78712 USA

ISBN: (纸本)9781450334686

We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input-output examples, our method synthesizes a program in a functional language with higher-order combinators like map and fold. The synthesized program is guaranteed to be the simplest program in the language to fit the examples. Our approach combines three technical ideas: inductive generalization, deduction, and enumerative search. First, we generalize the input-output examples into hypotheses about the structure of the target program. For each hypothesis, we use deduction to infer new input/output examples for the missing subexpressions. This leads to a new subproblem where the goal is to synthesize expressions within each hypothesis. Since not every hypothesis can be realized into a program that fits the examples, we use a combination of best-first enumeration and deduction to search for a hypothesis that meets our needs. We have implemented our method in a tool called lambda(2), and we evaluate this tool on a large set of synthesis problems involving lists, trees, and nested data structures. The experiments demonstrate the scalability and broad scope of lambda(2). A highlight is the synthesis of a program believed to be the world's earliest functional pearl.

关键词： Program synthesis programming by example data transformations search-based synthesis automated deduction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：