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

Multi-purpose Syntax Definition with SDF3 1

18th International Conference on Software Engineering and Formal Methods (SEFM)

作者： Amorim, Luis Eduardo de Souza Visser, Eelco Australian Natl Univ Canberra ACT Australia Delft Univ Technol Delft Netherlands

ISBN: (数字)9783030587680

ISBN: (纸本)9783030587680;9783030587673

SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.

关键词： Syntax definition programming language Parsing

来源：评论

学校读者我要写书评

暂无评论

LDS: Computer-Based Lesson Development System for Teaching Computer Science

LDS: Computer-Based Lesson Development System for Teaching C...

引用

6th Symposium of the Workgroup Human-Computer Interaction and Usability Engineering

作者： Safta, Daniel Gorgan, Dorian Tehn Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9783642166068

In this article we present a new approach to teaching computer science - the evaluation and visual modeling of algorithms based on metaphorical forms - applied within the core of a virtual education system, the development module for computer-based lessons (LDS). We reveal the structure and characteristics of the teaching process that we implemented in the proposed system, students and their roles, applied teaching methods, solutions for evaluation and a case study on a lesson model. We presented the state of the art in this domain highlighting the advantages of the described solution set, and also possible extensions.

关键词： Computer assisted instruction visual modeling teaching process algorithmic thinking programming language

来源：评论

学校读者我要写书评

暂无评论

Development and Visualization of PS-Dict: a Programmer Skills Dictionary 37

Development and Visualization of PS-Dict: a Programmer Skill...

引用

37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)

作者： Charoensuk, Jirawan Phansiri, Thaninrat Abdulroman, Jessada Chootong, Chalothon Kasetsart Univ Fac Sci Sriracha Chon Buri Thailand

ISBN: (数字)9781665485593

ISBN: (纸本)9781665485593

Programmers need to have a wide range of skills to perform their tasks. Using programming tools is not enough for purveying full functionality and development and thus should be combined with essential abilities such as problem-solving, along with in-depth knowledge about operating systems, hardware, and software. Hence, knowledge concerning these various aspects is important. In this study, we propose an interactive programmer skills dictionary in both English and Thai called PS-Dict. Our system produces a Knowledge Graphs using with the first paragraph from a Wikipedia Infobox. The comparison results show that PS-Dict could provide useful information in terms of skill descriptions and a list of related knowledge.

关键词： programmer skills programmer dictionary knowledge graph programming language

来源：评论

学校读者我要写书评

暂无评论

Compiling KB-Sized Machine Learning Models to Tiny IoT Devices 2019

Compiling KB-Sized Machine Learning Models to Tiny IoT Devic...

引用

40th ACM SIGPLAN Conference on programming language Design and Implementation (PLDI) part of ACM's Federated Computing Research Conference (FCRC)

作者： Gopinath, Sridhar Ghanathe, Nikhil Seshadri, Vivek Sharma, Rahul Microsoft Res Bengaluru India

ISBN: (纸本)9781450367127

Recent advances in machine learning (ML) have produced KiloByte-size models that can directly run on constrained IoT devices. This approach avoids expensive communication between IoT devices and the cloud, thereby enabling energy-efficient real-time analytics. However, ML models are expressed typically in floating-point, and IoT hardware typically does not support floating-point. Therefore, running these models on IoT devices requires simulating IEEE-754 floating-point using software, which is very inefficient. We present SeeDot, a domain-specific language to express ML inference algorithms and a compiler that compiles SeeDot programs to fixed-point code that can efficiently run on constrained IoT devices. We propose 1) a novel compilation strategy that reduces the search space for some key parameters used in the fixed-point code, and 2) new efficient implementations of expensive operations. SeeDot compiles state-of-the-art KB-sized models to various microcontrollers and low-end FPGAs. We show that SeeDot outperforms 1) software emulation of floating-point (Arduino), 2) high-bitwidth fixed-point (MATLAB), 3) post-training quantization (TensorFlow-Lite), and 4) floating- and fixed-point FPGA implementations generated using high-level synthesis tools.

关键词： Machine Learning IoT device programming language Compiler Fixed-point Microcontroller FPGA

来源：评论

学校读者我要写书评

暂无评论

Go Model and Object Oriented programming 1

引用

19th Brazilian Symposium on Programing languages (SBLP)

作者： Liu, Haiyang Qiu, Zongyan Peking Univ Sch Math LMAM Beijing 100871 Peoples R China Peking Univ Sch Math Dept Informat Beijing 100871 Peoples R China

ISBN: (数字)9783319240121

ISBN: (纸本)9783319240121;9783319240114

Go is a contemporary language aiming to support OO programming where the core OO feature, inheritance, is intentionally excluded. Go uses the concepts of embedding and interface to provide its object model. To understand the design of Go and its consequences, we develop a simple Go-like model language, mini-Go, which abstracts Go's interface-based OO features. The formal defined type system and semantics are given. In addition, we propose an even simpler language mu Go where the feature of pointers is further removed. We demonstrate that mu Go is as expressive in OO as the original language with pointers, which provides a uniform model for Go-like OO programming. We investigate the OO model of the Go-like languages using mu Go in detail, point out that the absence of open recursion brings difficulties in OO design, and then propose a novel design pattern to mimic the open recursion feature to overcome the difficulties.

关键词： programming language Object Oriented Go

来源：评论

学校读者我要写书评

暂无评论

Context-redefined language synthesis for energy consumption prediction using data from mixed remote sensors types 3

Context-redefined language synthesis for energy consumption ...

引用

Conference on Remote Sensing Technologies and Applications in Urban Environments III

作者： Belyaev, A. O. Podsvirov, V. N. Podoprigora, V. B. Sinutin, S. A. Boldyreff, A. S. Southern Fed Univ Inst Radiotech Syst & Control Engelsa Str 1 Taganrog Russia JSC RPE IC Kvant Milchakova 7 Rostov Na Donu Russia

ISBN: (纸本)9781510621701

This paper deals with the design and application issues of context-redefined computer languages for new information technologies. The discussion touches upon these languages implementation problems for intelligent learning agents (ILA), applied for solving the behavior prediction tasks for resource consumption in communal services. The article deals with the second problem in particular. The approach consists in the application of context-redefined language and its support system for problem solution. We focus on principal unpredicted changing of source function algorithms. Built-in context-redefined computer language is an essential tool for this kind of algorithm support. The main part of the intelligent learning agent is performance element. The performance element operates according to the current algorithm, which is described by means of built-in context-redefined language. The main idea of built-in language synthesis is to use main parts of the algorithm for ILA components with proper modification by means another algorithms and context connection. Due to this connection, the original algorithm can be changed directly or indirectly in the process of ILA functioning. We have to extract changing parts of component algorithms and organize proper interaction between every part and the context, which can be changed directly or indirectly. Required adaptive algorithm variation takes place on the base of obtained knowledge. At the same time, the algorithm must be implemented quickly, and the language must be simple and clear. The algorithm efficiency is based on flexibility and modifiability of the language. General constructions of the built-in context-redefined language have been demonstrated with proper comments.

关键词： energy consumption forecasting programming language intelligent learning agent context-redefined language smart city

来源：评论

学校读者我要写书评

暂无评论

Static Memory Management for Efficient Mobile Sensing Applications 13

Static Memory Management for Efficient Mobile Sensing Applic...

引用

Proceedings of the International Conference on Embedded Software (EMSOFT)

作者： Lai, Farley Schmidt, Daniel Chipara, Octav Univ Iowa Dept Comp Sci Iowa City IA 52242 USA

ISBN: (纸本)9781467380799

Memory management is a crucial aspect of mobile sensing applications that must process high-rate data streams in an energy-efficient manner. Our work is done in the context of synchronous data-flow models in which applications are implemented as a graph of components that exchange data at fixed and known rates over FIFO channels. In this paper, we show that it is feasible to leverage the restricted semantics of synchronous data-flow models to optimize memory management. Our memory optimization approach includes two components: (1) We use abstract interpretation to analyze the complete memory behavior of a mobile sensing application and identify data sharing opportunities across components according to the live ranges of exchanged samples. Experiments indicate that the static analysis is precise for a majority of considered stream applications whose control logic does not depend on input data. (2) We propose novel heuristics for memory allocation that leverage the graph structure of applications to optimize data exchanges between application components to achieve not only significantly lower memory footprints but also increased stream processing throughput. We incorporate code generation techniques that transform a stream program into efficient C code. The memory optimizations are implemented as a new compiler for the StreamIt programming language. Experiments show that our memory optimizations reduce memory footprint by as much as 96% while matching or improving the performance of the StreamIt compiler with cache optimizations enabled. These results suggest that highly efficient stream processing engines may be built using synchronous data-flow languages.

关键词： data flow analysis graph theory program compilers programming languages smart phones storage management FIFO channels StreamIt compiler abstract interpretation application components cache optimizations code generation techniques data sharing opportunities graph structure high-rate data streams memory allocation memory optimization approach mobile sensing applications programming language smartphones static memory management stream processing engines stream processing throughput synchronous data-flow models Algorithm design and analysis Junctions Layout Memory management Optimization Radiation detectors Schedules Store management Smartphone Computer programming languages Memory allocation compilers analysis programme Algorithm design and analysis data flow analysis Radiation detectors layouts Junction Device Component Graph theory

来源：评论

学校读者我要写书评

暂无评论

programming a multi-agent system with MASL

Programming a multi-agent system with MASL

引用

IEEE/ASME International Conference on Advanced Intelligent Mechatronics

作者： Duhaut, Dominique Le Guyadec, Yann Dubois, Michel Univ Bretagne Sud Lorient Vannes Morbihan France

ISBN: (纸本)9781424424948

Expressing the general behaviour of a set of robots working together is a difficult task. Self reconfigurable robots or a team of robots playing football are examples of such problem. To control a set of homogeneous or heterogeneous robotic components, one needs to express synchronous and asynchronous computation, from a local or a global point of view. In this paper we propose a unique language to express the behaviour of a set of heterogeneous robots.

关键词： multi-agent systems self-reconfigurable robots RoboCup programming language

来源：评论

学校读者我要写书评

暂无评论

ObliVM: A programming Framework for Secure Computation 36

ObliVM: A Programming Framework for Secure Computation

引用

IEEE Symposium on Security and Privacy SP

作者： Liu, Chang Wang, Xiao Shaun Nayak, Kartik Huang, Yan Shi, Elaine Univ Maryland College Pk MD 20742 USA Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781467369497

We design and develop ObliVM, a programming framework for secure computation. ObliVM offers a domain-specific language designed for compilation of programs into efficient oblivious representations suitable for secure computation. ObliVM offers a powerful, expressive programming language and user-friendly oblivious programming abstractions. We develop various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrate the scalability of ObliVM to bigger data sizes. We also show how ObliVM significantly reduces development effort while retaining competitive performance for a wide range of applications in comparison with hand-crafted solutions. We are in the process of open-sourcing ObliVM and our rich libraries to the community (***), offering a reusable framework to implement and distribute new cryptographic algorithms.

关键词： Compiler Oblivious Algorithms Oblivious RAM programming language Secure Computation Type System

来源：评论

学校读者我要写书评

暂无评论

The History of FORTRAN I, II, and III

引用

Annals of the History of Computing 1979年第1期1卷 21-37页

作者： Backus, John IBM Research Laboratory San Jose CA 95193 United States

This article discusses attitudes about “automatic programming, “ the economics of programming, and existing programming systems, all in the early 1950s. It describes the formation of the FORTRAN group, its knowledge of existing systems, its plans for FORTRAN, and the development of the language in 1954. It describes the development of the optimizing compiler for FOR TRAN I, of various language manuals, and of FORTRAN II and III. It concludes with remarks about later developments and the impact of FORTRAN and its successors on programming today. © 1979, IEEE. All right reserved.

关键词： 1.2 4.2 compiler design compilers FORTRAN history language design optimization programming language programming language manuals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：