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

On the persistent rumors of the programmer's imminent demise

SOFTWARE AND SYSTEMS MODELING 2023年第6期22卷 1969-1976页

作者： Mohammadi, Hessam Ghardallou, Wided Brick, Elijah Mili, Ali NJIT CS Dept Newark NJ 07102 USA Univ Sousse Dept Comp Sci Rue Khalifa Karoui Sousse 4000 Tunisia

Since the dawn of programming, several developments in programming language design and programming methodology have been hailed as the end of the profession of programmer;they have all proven to be exaggerated rumors, to echo the words attributed to Mark Twain. In this short paper, we ponder the question of whether the emergence of large language models finally realizes these prophecies? Also, we discuss why even if this prophecy is finally realized, it does not change the job of the researcher in programming.

关键词： programming languages automatic programming programming profession Large language models

来源：评论

学校读者我要写书评

暂无评论

SOFTWARE COST AND PRODUCTIVITY IMPROVEMENTS - AN ANALOGICAL VIEW

引用

COMPUTER 1985年第5期18卷 86-96页

作者： SILVERMAN, BG GEORGE WASHINGTON UNIV INST ARTIFICIAL INTELLIGENCEWASHINGTONDC 20052

First Page of the Article

关键词： Productivity programming profession automatic programming Job design Software systems Systems engineering and theory Program processors Operating systems Production facilities

来源：评论

学校读者我要写书评

暂无评论

DECISION TABLE TECHNIQUES IN COMPUTER CONTROL

引用

IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS 1966年第5期PA85卷 495-&页

作者： KRAMER, FA KIRK, GJ Public Service Electric and Gas Company Newark NJ USA Westinghouse Electric Corporation Pittsburgh PA USA

Decision tables for real time process control logically present the solution to a problem and directly replace flowcharts. A decision table is a self-contained description of the solution to a complex decision problem. It presents all pertinent variables, the rules for combining possible conditions, and actions desired. The power of a decision table is that format and programming are independent of the problem, and it is thereby possible to automate much of the manpower required to design, program, test, and document solutions to complex control problems.

关键词： Flowcharts Logic testing Process control Application software Kirk field collapse effect automatic control Computer applications Debugging automatic programming automatic testing

来源：评论

学校读者我要写书评

暂无评论

Study on modeling methods for knowledge-based goal programming

Study on modeling methods for knowledge-based goal programmi...

引用

IEEE International Conference on Grey Systems and Intellignet Services

作者： Xiu Lijun Li Yuannian Chen Yanhui

ISBN: (纸本)9781424412945

Aimed at the question that goal programming is lack of modeling support and the automatic generation of model during the process of modeling, this paper systematically researches the modeling question of goal programming using knowledge engineering, machine learning and such theories, and proposes the theoretical system of "practical questions - knowledgeable information model - knowledgeable mathematical model knowledgeable solution model". The study opens up the method of a knowledge-based model to solve goal programming questions. The research makes the application of goal programming step forward to the intelligent direction.

关键词： Mathematical model Mathematical programming automatic programming Learning systems Intelligent systems Knowledge engineering Machine learning Intelligent structures Decision support systems Application software

来源：评论

学校读者我要写书评

暂无评论

COMPUTER AIDS FOR IC DESIGN

引用

IEEE SOFTWARE 1986年第2期3卷 38-47页

作者： KIM, J MCDERMOTT, J CARNEGIE MELLON UNIV DEPT COMP SCI PITTSBURGH PA 15213 USA

Features a computer program for integrated-circuit layout designing. Specifications of a cell layout design knowledge-based system called Talib; Functions of an automatic cell layout system; Types of task- specific kn... 详细信息

关键词： Algorithm design and analysis Integrated circuit layout MOS devices automatic programming Knowledge based systems Character generation Manufacturing processes Process design Expert systems

来源：评论

学校读者我要写书评

暂无评论

SOFTWARE CAD - A REVOLUTIONARY APPROACH

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第3期15卷 235-249页

作者： BUHR, RJA KARAM, GM HAYES, CJ WOODSIDE, CM CARLETON UNIV REAL TIME & DISTRIBUTED SYST GRPOTTAWA K1S 5B6ONTARIOCANADA SUN MICROSYST GRAPH STANDARDS GRPMT VIEWCA 94043

The term software CAD suggests a design paradigm and supporting environment centering around wiring-diagram-like graphical representations of software structures which serve as a framework for both human reasoning and automated tools for analysis and code generation. The term revolutionary highlights the fact that adopting the approach in industry would have exactly that effect on the state of the practice. This paper has its roots in a research project at Carleton University, which developed an experimental software CAD environment called the Carleton embedded system design environment (CAEDE), oriented toward embedded systems and Ada, to provide a demonstration of the concept and to serve as a research testbed. The major contribution of CAEDE presented in this paper is a demonstration of a visual paradigm which combines semantic depth and syntactic shallowness, relative to Ada, in a manner that makes it possible for the embedded system designer to work in terms of abstract machines while still 'thinking Ada.' A secondary contribution is the identification of Prolog as a promising approach for supporting tool development in an environment which supports the visual paradigm. We also describe experimental tools for temporal analysis, performance analysis, and the generation of skeleton Ada code; however, details are left for future papers. [ABSTRACT FROM AUTHOR]

关键词： automatic programming computer-aided design concurrent systems design environment graphics Index Terms-Ada prolog soft ware design

来源：评论

学校读者我要写书评

暂无评论

TOWARD AN ASSEMBLY PLAN FROM OBSERVATION .1. TASK RECOGNITION WITH POLYHEDRAL OBJECTS

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1994年第3期10卷 368-385页

作者： IKEUCHI, K SUEHIRO, T ELECTROTECH LAB TSUKUBAJAPAN

Currently, most robot programming is done either by manual programming or using a teach pendant as part of the ''teach-by-showing'' method. Both of these methods have been found to have several drawbacks. We are developing a novel method with which to program a robot: the assembly-plan-from-observation (APO) method. The APO method aims to build a system that has the capability of observing a human performing an assembly task, understanding the task based on the observation, and subsequently generating a robot program to achieve the same task. This paper focuses on the task recognition module (TRM), the main component of a complete APO system. The TRM recognizes object configurations before and after an assembly task, detects a configuration transition, and infers the assembly task that causes such a configuration transition. We assume that each assembly task aims to achieve a face contact relation between an object that has just been manipulated and stationary environmental objects. We prepare abstract task models that associate transitions of face contact relations with assembly tasks that achieve such transitions. Next, we implement TRM in order to verify two issues: 1) that such a contact transition can be recovered from the output of the object recognizer, and 2) that given these relation transitions, it is possible to use the abstract task models to effect the generation of robot motion commands;the execution of these commands will culminate in a repetition on the original assembly task.

关键词： Robotic assembly Service robots Robot programming Robotics and automation Transmission line measurements Face detection automatic programming Education Educational robots Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

Schema induction for logic program synthesis

引用

ARTIFICIAL INTELLIGENCE 1998年第1-2期98卷 1-47页

作者： Tinkham, NL Rowan Univ Dept Comp Sci Glassboro NJ 08028 USA

Prolog program synthesis can be made more efficient by using schemata which capture similarities in previously-seen programs. Such schemata narrow the search involved in the synthesis of a new program. We define a generalization operator for forming schemata from programs and a downward refinement operator for constructing programs from schemata. These operators define schema-hierarchy graphs which can be used to aid in the synthesis of new programs. Algorithms are presented for efficiently obtaining least generalizations of schemata, for adding new schemata to a schema-hierarchy graph, and for using schemata to construct new programs. (C) 1998 Elsevier Science B.V.

关键词： inductive logic programming inductive inference automatic programming learning

来源：评论

学校读者我要写书评

暂无评论

Neural Network Approach to Program Synthesis for Tabular Transformation by Example

引用

IEEE ACCESS 2022年 10卷 24864-24876页

作者： Ujibashi, Yoshifumi Takasu, Atsuhiro Grad Univ Adv Studies SOKENDAI Dept Informat Hayama Kanagawa 2400193 Japan Fujitsu Ltd Nakahara Ku Kawasaki Kanagawa 2118588 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

Data transformation is a laborious and time-consuming task for analysts. programming by example (PBE) is a technique that can simplify this difficult task for data analysts by automatically generating programs for data transformation. Most of the previously proposed PBE methods are based on search algorithms, but recent improvements in machine learning (ML) have led to its application in PBE research. For example, RobustFill was proposed as an ML-based PBE method for string transformation by using long short-term memory (LSTM) as the sequential encoder-decoder model. However, an ML-based PBE method has not been developed for tabular transformations, which are used frequently in data analysis. Thus, in the present study, we propose an ML-based PBE method for tabular transformations. First, we consider the features of tabular transformations, which are more complex and data intensive than string transformations, and propose a new ML-based PBE method using the state-of-the-art Transformer sequential encoder-decoder model. To our knowledge, this is the first ML-based PBE method for tabular transformations. We also propose two decoding methods comprising multistep beam search and program validation-beam search, which are optimized for program generation, and thus generate correct programs with higher accuracy. Our evaluation results demonstrated that the Transformer-based PBE model performed much better than LSTM-based PBE when applied to tabular transformations. Furthermore, the Transformer-based model with the proposed decoding method performed better than the conventional PBE model using the search-based method.

关键词： Task analysis Transformers Data integration Training Decoding Licenses Domain specific languages automatic programming beam search LSTM neural network programming by example program synthesis tabular data transformer

来源：评论

学校读者我要写书评

暂无评论

Extending the "Open-Closed Principle" to Automated Algorithm Configuration

引用

EVOLUTIONARY COMPUTATION 2019年第1期27卷 173-193页

作者： Swan, Jerry Adriaensen, Steven Barwell, Adam D. Hammond, Kevin White, David R. Univ York Dept Comp Sci York N Yorkshire England Vrije Univ Brussel Brussels Belgium Univ St Andrews St Andrews Fife Scotland Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England

Metaheuristics are an effective and diverse class of optimization algorithms: a means of obtaining solutions of acceptable quality for otherwise intractable problems. The selection, construction, and configuration of a metaheuristic for a given problem has historically been a manually intensive process based on experience, experimentation, and reasoning by metaphor. More recently, there has been interest in automating the process of algorithm configuration. In this article, we identify shared state as an inhibitor of progress for such automation. To solve this problem, we introduce the Automated Open-Closed Principle (AOCP), which stipulates design requirements for unintrusive reuse of algorithm frameworks and automated assembly of algorithms from an extensible palette of components. We demonstrate how the AOCP enables a greater degree of automation than previously possible via an example implementation.

关键词： Automated design of algorithms automatic programming programming by optimization metaheuristics functional programming ant programming search-based software engineering systems self-assembly

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：