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

Introduction of an Assistance System to Support Domain Experts in programming Low-Code to Leverage Industry 5.0

IEEE ROBOTICS AND AUTOMATION LETTERS 2022年第4期7卷 10422-10429页

作者： Neumann, Eva-Maria Vogel-Heuser, Birgit Haben, Fabian Krueger, Marius Wieringa, Timotheus Tech Univ Munich TUM Sch Engn & Design Inst Automat & Informat Syst Dept Mech Engn D-85748 Garching Germany MDSI Munich Germany MIRMI Munich Germany HAWE Hydraul SE D-85609 Munich Germany

The rapid technological leaps of Industry 4.0 increase the pressure and demands on humans working in automation, which is one of the main motivators of Industry 5.0. In particular, automation software development for mechatronic systems becomes increasingly challenging, as both domain knowledge and programming skills are required for high-quality, maintainable software. Especially for small companies from automation and robotics without dedicated software engineering departments, domain-specific low-code platforms become indispensable that enable domain experts to develop code intuitively using visual programming languages, e.g., for tasks such as retrofitting mobile machines. However, for extensive functionalities, visual programs may become overwhelming due to the scaling-up problem. In addition, the ever-shortening time-to-market increases the time pressure on programmers. Thus, an assistance system concept is introduced that can be implemented by low-code platform suppliers based on combining data mining and static code analysis. Domain experts are supported in developing low-code by targeted recommendations, metric-based complexity measurement, and reducing complexity by encapsulating functionalities. The concept is implemented for the industrial low-code platform HAWE eDesign to program hydraulic components in mobile machines, and its benefits are confirmed in a user study and an industrial expert workshop.

关键词： Data mining industry 5.0 low-code platforms programming assistance system static code analysis visual programming languages

来源：评论

学校读者我要写书评

暂无评论

How People visually Represent Discrete Constraint Problems

引用

IEEE TRANSACTIONS ON visualIZATION AND COMPUTER GRAPHICS 2020年第8期26卷 2603-2619页

作者： Zhu, Xu Nacenta, Miguel A. Akgun, Ozgur Nightingale, Peter Univ St Andrews Sch Comp Sci Jack Cole Bldg St Andrews KY16 9SX Fife Scotland Univ York Dept Comp Sci Deramore Lane York YO10 5GH N Yorkshire England

Problems such as timetabling or personnel allocation can be modeled and solved using discrete constraint programming languages. However, while existing constraint solving software solves such problems quickly in many cases, these systems involve specialized languages that require significant time and effort to learn and apply. These languages are typically text-based and often difficult to interpret and understand quickly, especially for people without engineering or mathematics backgrounds. visualization could provide an alternative way to model and understand such problems. Although many visual programming languages exist for procedural languages, visual encoding of problem specifications has not received much attention. Future problem visualization languages could represent problem elements and their constraints unambiguously, but without unnecessary cognitive burdens for those needing to translate their problem's mental representation into diagrams. As a first step towards such languages, we executed a study that catalogs how people represent constraint problems graphically. We studied three groups with different expertise: non-computer scientists, computer scientists and constraint programmers and analyzed their marks on paper (e.g., arrows), gestures (e.g., pointing) and the mappings to problem concepts (e.g., containers, sets). We provide foundations to guide future tool designs allowing people to effectively grasp, model and solve problems through visual representations.

关键词： visualization Software Computer languages Tools Problem-solving Problem visualization problem modeling problem solving constraint programming visual programming languages

来源：评论

学校读者我要写书评

暂无评论

Formal semantics of visual occam

引用

COMPUTER languages 1998年第2期24卷 99-113页

作者： Al-Mulhem, M Ali, S King Fahd Univ Petr & Minerals Dept Informat & Comp Sci Dhahran 31261 Saudi Arabia

visual programming languages (VPLs) have been proposed to simplify the task of programming and to make better use of human capabilities. visual Occam (VISO) is a visual programming language for concurrent programming. It uses message passing for interprocess communication and processes are disjoint. The VISO language uses a modular approach to visual programming which simplifies the specification of programs. It has a graphical syntax based the language occam. The main emphasis in this paper is to provide formal semantics of VISO using process calculus. The semantics of all programming constructs and icons in VISO are given as well as a number of complete example programs and their translation in process calculus. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

关键词： visual programming languages process calculus formal semantics occam concurrent programming

来源：评论

学校读者我要写书评

暂无评论

visual Occam: syntax and semantics

引用

COMPUTER languages 1997年第1期23卷 1-24页

作者： AlMulhem, M Ali, S Information & Computer Science Department King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

visual Occam (VISO) is a visual programming language for concurrent programming. It uses message passing for interprocess communication and processes are disjoint. The VISO language uses a modular approach to visual programming which simplifies the specification of programs. It has a graphical syntax based on the language Occam. The petri net formalism is used to represent the semantics of the VISO language. This paper describes the design and implementation of the VISO language. It presents syntax, semantics, and a number of concurrent programs specified in the VISO language. Also, it discusses how synchronous communication can be expressed in petri nets. (C) 1997 Elsevier Science Ltd.

关键词： visual programming languages petri nets syntax and semantics Occam concurrent programming

来源：评论

学校读者我要写书评

暂无评论

New Approach for Conversational Agent Definition by Non-Programmers: A visual Domain-Specific Language

引用

IEEE ACCESS 2019年 7卷 5262-5276页

作者： Rodriguez-Gil, Luis Garcia-Zubia, Javier Orduna, Pablo Villar-Martinez, Aitor Lopez-De-Ipina, Diego LabsL&C Gordoniz Bilbao 48002 Spain Univ Deusto Fac Engn Bilbao 48007 Spain DeustoTech Deusto Fdn Bilbao 48007 Spain

Intelligent tutors and conversational agents (CAs) have proven to be useful learning tools. They have potential not only as stand-alone devices but also as integrable components to enrich and complement other educational resources. For this, new authoring approaches and platforms are required. They should be accessible to non-programmers (such as most teachers) and they should be integrable into current web-based educational platforms. This paper proposes a new approach to define such agents through a visual domain-specific language based on Google Blockly (a scratch-like language). It also develops a web-based integrable authoring platform to serve as a prototype, describing the requirements and architecture. To evaluate whether this novel approach is effective, a multi-stage experiment was conducted. First, participants learned to use the prototype authoring platform through an interactive tutorial. Second, they created a CA with a specific domain model. Times and performance were measured. Finally, they answered a standardized usability questionnaire (UMUX) and a purpose-specific survey. Results show that participants were able to learn to use the domain-specific language in a short time. Moreover, the purpose-specific survey indicates that their perception of the approach (and its potential) is positive. The standardized questionnaire indicates that even in its prototype stage, its usability is satisfactory.

关键词： visual programming languages customizable systems conversational agents intelligent tutoring systems online learning online labs

来源：评论

学校读者我要写书评

暂无评论

Nine-step approach to designing successful visual programming applications

引用

COMPUTING & CONTROL ENGINEERING JOURNAL 2002年第2期13卷 82-86页

作者： Llewellyn, E Stanton, M Roberts, G Univ Coll Wales Mechatron Res Ctr Newport NP20 5XR Gwent Wales

A nine-step method for overcoming the limitations of traditional models when designing visual applications is presented. Microsoft visual Basic is used to demonstrate the technique that can be applied to most visual programming languages. The method described takes account of factors such as an interface driven approach, the psychology of programmer commitment, the need to develop readable code, and provides a method of modularly designing detailed test documents. The method has proved to be suitable for existing visual basic developers and those wishing to move from procedural into visual programming.

关键词： visual programming visual languages visual programming languages visual programming visual programming application design test documents systems analysis programmer commitment psychology Microsoft visual Basic Software management Graphics techniques High level languages readable code BASIC interface driven approach

来源：评论

学校读者我要写书评

暂无评论

A context-sensitive graph grammar formalism for the specification of visual languages

引用

COMPUTER JOURNAL 2001年第3期44卷 186-200页

作者： Zhang, DQ Zhang, K Cao, JN Univ Texas Dept Comp Sci Richardson TX 75083 USA Coral Corp Ottawa ON Canada Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programming languages. Yet most graph-grammar parsing algorithms presented so far are either unable to recognize interesting visual languages or tend to be inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. This paper presents a context-sensitive graph grammar called reserved graph grammar, which can explicitly and completely describe the syntax of a wide range of diagrams using labeled graphs. The parsing algorithm of a reserved graph grammar uses a marking mechanism to avoid ambiguity in parsing and has polynomial time complexity in most cases. The paper defines a constraint condition under which a graph defined in a reserved graph grammar can be parsed in polynomial time. An algorithm for checking the condition is also provided.

关键词： complexity classes visual languages Specifications Ganglia syntax visual programming languages formalism parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

Concurrent programming in VISO

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第5期12卷 281-288页

作者： Al-Mulhem, MS King Fahd Univ Petr & Minerals Dept Informat & Comp Sci Dhahran 31261 Saudi Arabia

Concurrent programming is more difficult to use and understand than sequential programming. In order to simplify this type of programming a number of approaches have been developed such as visual programming, visual Occam (VISO) is a visual programming language for concurrent programming. It has a graphical syntax based on the language Occam and its semantics is represented both in petri net and process calculus. This paper presents a modular visual approach to write concurrent programs using the VISO language, Concurrent programs in VISO are specified graphically at different levels of abstraction, This paper describes this modular visual approach by constructing two examples in VISO, The first example is a simple concurrent program and it is mainly used to show the details of constructing a concurrent program in VISO, The second example is a larger concurrent program with more levels of abstraction. Copyright . (C) 2000 John Wiley & Sons, Ltd.

关键词： concurrent programming Occam visual programming languages

来源：评论

学校读者我要写书评

暂无评论

Using spatial logic to describe visual languages

引用

ARTIFICIAL INTELLIGENCE REVIEW 1996年第3-4期10卷 171-186页

作者： Gooday, JM Cohn, AG Division of Artificial Intelligence School of Computer Studies University of Leeds Leeds England

visual computer languages exploit the natural language of diagrams and pictures to provide a simple and intelligible approach to programming. Unfortunately, it is difficult to provide them with a formal syntax and semantics. In this paper we show how the RCC spatial calculus can be used to provide an unambiguous, formal description of such languages by systematically describing the syntax of Pictorial Janus.

关键词： visual programming languages spatial languages

来源：评论

学校读者我要写书评

暂无评论

Filmification of methods: A visual language for graph algorithms

引用

JOURNAL OF visual languages AND COMPUTING 2008年第1期19卷 123-150页

作者： Watanobe, Yutaka Mirenkov, Nikolay N. Yoshioka, Rentaro Monakhov, Oleg Univ Aizu Grad Dept Informat Syst Fukushima 9658580 Japan Russian Acad Sci Inst Computat Math & Math Geophys Siberian Div R-630090 Novosibirsk Russia

A novel approach for using the filmification of methods concept in the graph algorithm representation, specification, and programming is considered. it is based on a "cyberFilm" format, where a set of multimedia frames represents algorithmic features. A brief description of the cyberFilm concept and an observation of graph algorithm features are presented. A number of cyberFilms related to Prim's and Dijkstra's algorithms have been developed and used to explain the basic ideas of the approach. Several versions of the algorithm visualization are demonstrated by corresponding examples of cyberFilm frames and icon language representations. In addition, a method for program generation from the cyberFilm specification is provided with explanations of program templates supporting the cyberFilm frames. (c) 2006 Published by Elsevier Ltd.

关键词： visual programming languages CyberFilm graph algorithms program templates

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：