NewBee: Context-Free Grammar (CFG) of a New Programming Language for Novice Programmers

Learning programming and using programming languages are the essential aspects of computer science education.Students use programming languages to write their programs.These computer programs(students or practitioners written)make computers artificially intelligent and perform the tasks needed by the users.Without these programs,the computer may be visioned as a pointless machine.As the premise of writing programs is situated with specific programming languages,enormous efforts have been made to develop and create programming languages.However,each program-ming language is domain-specific and has its nuances,syntax and seman-tics,with specific pros and cons.These language-specific details,including syntax and semantics,are significant hurdles for novice programmers.Also,the instructors of introductory programming courses find these language specificities as the biggest hurdle in students learning,where more focus is on syntax than logic development and actual implementation of the program.Considering the conceptual difficulty of programming languages and novice students’struggles with the language syntax,this paper describes the design and development of a Context-Free Grammar(CFG)of a programming language for the novice,newcomers and students who do not have computer science as their major.Due to its syntax proximity to daily conversations,this paper hypothesizes that this language will be easy to use and understand by novice programmers.This paper systematically designed the language by identifying themes from various existing programming languages(e.g.,C,Python).Additionally,this paper surveyed computer science experts from industry and academia,where experts self-reported their satisfaction with the newly designed language.The results indicate that 93%of the experts reported satisfaction with the NewBee for novice,newcomer and non-Computer Sci-ence(CS)major students.

Analysis of an event study using the Fama–French five‑factor model:teaching approaches including spreadsheets and the R programming language

The current financial education framework has an increasing need to introduce tools that facilitate the application of theoretical models to real-world data and contexts.However,only a limited number of free tools are available for this purpose.Given this lack of tools,the present study provides two approaches to facilitate the implementa-tion of an event study.The first approach consists of a set of MS Excel files based on the Fama–French five-factor model,which allows the application of the event study methodology in a semi-automatic manner.The second approach is an open-source R-programmed tool through which results can be obtained in the context of an event study without the need for programming knowledge.This tool widens the calculus possibilities provided by the first approach and offers the option to apply not only the Fama–French five-factor model but also other models that are common in the finan-cial literature.It is a user-friendly tool that enables reproducibility of the analysis and ensures that the calculations are free of manipulation errors.Both approaches are freely available and ready-to-use.

An Exploratory Practice of Integration of Industry and Education in High-level Programming Language Course in the Background of New Engineering

This paper analyzes some problems of the current teaching situation in the course High-level Programming Language,such as the lagging content of the course compared with technology development,the emphasis on theory rather than on practice,the low enthusiasm of students for learning,and the weak practical ability of students.In response to the needs of enterprises for talents under the background of New Engineering,especially the cultivation of students’adaptability and practical abilities towards future industries to improve students’knowledge and problemsolving abilities to keep up with the modern technology,this paper proposes the ways and methods to reform and explore the teaching content and teaching methods by integrating industry and education,assisting teaching according to industrial demands,and lowering technology barriers of new technology.The practical effect is evaluated through a survey in class and the follow-up questionnaire after class,and the results show that the effect of the practice is effective.

Shrek:a dynamic object-oriented programming language

From a perspective of theoretical study, there are some faults in the models of the existing object-oriented programming languages. For example, C# does not support metaclasses, the primitive types of Java and C# are not objects, etc. So, this paper designs a programming language, Shrek, which integrates many language features and constructions in a compact and consistent model. The Shrek language is a class-based purely object-oriented language. It has a dynamical strong type system, and adopts a single-inheritance mechanism with Mixin as its complement. It has a consistent class instantiation and inheritance structure, and the ability of intercessive structural computational reflection, which enables it to support safe metaclass programming. It also supports multi-thread programming and automatic garbage collection, and enforces its expressive power by adopting a native method mechanism. The prototype system of the Shrek language is implemented and anticipated design goals are achieved.

OFF LINE INTERPRETER OF AGENT ORIENTED PROGRAMMING LANGUAGE AOPLID

AOPLID is a novel agent oriented programming language whose theoretical framework is the existed situation calculus theory and agent model based on intention driven manner. An AOPLID program is represented in set manner. In this paper, an off line AOPLID interpreter in Prolog is implemented, based on the off line AOPLID program semantics. At the same time, the set of rules is given which transforms an AOPLID program represented by sets into Prolog clauses so that it can be interpreted by the off line interpreter. Finally, the sound codes of the off line interpreter are listed.

《Grammars for Programming Languages》简介

加利福尼亚大学J. Craig cleaveland和Robert C. Uzgalis合著的“Grammars forProgramming Languages”(程序设计语言的文法)一书系美国ELSEVIER NORTH-HO-LLAND, INC.1977年出版的一套程序设计语言丛书之一。 自从1956年Noam

Spatial Data Process Using Python Script and Visual Programming Language in ArcGIS

Data are limitless. But those are usually not formed or created in our needs. Most of data providers deliver their data in Microsoft Excel spreadsheet, which is compatible with ArcGIS, the most widely used GIS （Geographic Information System） software in GIS sector. However, those table data contain much unnecessary information that do not need for a certain project. Using the raw data can increase processing times and reduce performance of geoprocessing tools. This study shows steps of how the raw data are being processed using ArcGIS ModelBuilder and Python script.

Linguistic Economy Applied to Programming Language Identifiers

Though many different readability metrics have been created, there still is no universal agreement defining readability of software source code. The lack of a clear agreement of source code readability has ramifications in many areas of the software development life-cycle, not least of which being software maintainability. We propose a measurement based on Linguistic Economy to bridge the gap between mathematical and behavioral aspects. Linguistic Economy describes efficiencies of speech and is generally applied to natural languages. In our study, we create a large corpus of words that are likely to be found in a programmer’s vocabulary, and a corpus of existing identifiers found in a collection of open-source projects. We perform a usage analysis to create a database from both of these corpora. Linguistic Economy suggests that words requiring less effort to speak are used more often than words requiring more effort. This concept is applied to measure how difficult program identifiers are to understand by extracting them from the program source and comparing their usage to the database. Through this process, we can identify source code that programmers find difficult to review. We validate our work using data from a survey where programmers identified unpleasant to review source files. The results indicate that source files identified as unpleasant to review source code have more linguistically complicated identifiers than pleasant programs.

Current Trends in Online Programming Languages Learning Tools: A Systematic Literature Review

Students face difficulties in programming languages learning (PLL) which encourages many scholars to investigate the factors behind that. Although there a number of positive and negative factors found to be effective in PLL procedure, utilising online tools in PLL were recognized as a positive recommended means. This motivates many researchers to provide solutions and proposals which result in a number of choices and options. However, categorising those efforts and showing what has been done, would provide a better and clear image for future studies. Therefore, this paper aims to conduct a systematic literature review to show what studies have been done and then categorise them based on the type of online tools and the aims of the research. The study follows Kitchenham and Charters guidelines for writing SLR (Systematic Literature Review). The search result reached 1390 publications between 2013-09/2018. After the filtration which has been done through selected criteria, 160 publications were found to be adequate to answer the review questions. The main results of this systematic review are categorizing the aims of the studies in online PLL tools, classifying the tools and finding the current trends of the online PLL tools.

Extraction of Robot Primitive Control Rules from Natural Language Instructions

A support vector rule based method is investigated for the construction of motion controllers via natural language training. It is a two-phase process including motion control information collection from natural language instructions, and motion information condensation with the aid of support vector machine （SVM） theory. Self-organizing fuzzy neural networks are utilized for the collection of control rules, from which support vector rules are extracted to form a final controller to achieve any given control accuracy. In this way, the number of control rules is reduced, and the structure of the controller tidied, making a controller constructed using natural language training more appropriate in practice, and providing a fundamental rule base for high-level robot behavior control. Simulations and experiments on a wheeled robot are carried out to illustrate the effectiveness of the method.

Enhancing Critical Path Problem in Neutrosophic Environment Using Python

In the real world,one of the most common problems in project management is the unpredictability of resources and timelines.An efficient way to resolve uncertainty problems and overcome such obstacles is through an extended fuzzy approach,often known as neutrosophic logic.Our rigorous proposed model has led to the creation of an advanced technique for computing the triangular single-valued neutrosophic number.This innovative approach evaluates the inherent uncertainty in project durations of the planning phase,which enhances the potential significance of the decision-making process in the project.Our proposed method,for the first time in the neutrosophic set literature,not only solves existing problems but also introduces a new set of problems not yet explored in previous research.A comparative study using Python programming was conducted to examine the effectiveness of responsive and adaptive planning,as well as their differences from other existing models such as the classical critical path problem and the fuzzy critical path problem.The study highlights the use of neutrosophic logic in handling complex projects by illustrating an innovative dynamic programming framework that is robust and flexible,according to the derived results,and sets the stage for future discussions on its scalability and application across different industries.

Assembly language and assembler for deep learning accelerators

Deep learning accelerators(DLAs)have been proved to be efficient computational devices for processing deep learning algorithms.Various DLA architectures are proposed and applied to different applications and tasks.However,for most DLAs,their programming interfaces are either difficult to use or not efficient enough.Most DLAs require programmers to directly write instructions,which is time-consuming and error-prone.Another prevailing programming interface for DLAs is high-performance libraries and deep learning frameworks,which are easy to be used and very friendly to users,but their high abstraction level limits their control capacity over the hardware resources thus compromises the efficiency of the accelerator.A design of the programming interface is for DLAs.First various existing DLAs and their programming methods are analyzed and a methodology for designing programming interface for DLAs is proposed,which is a high-level assembly language(called DLA-AL),assembler and runtime for DLAs.DLA-AL is composed of a low-level assembly language and a set of high-level blocks.It allows experienced experts to fully exploit the potential of DLAs and achieve near-optimal performance.Meanwhile,by using DLA-AL,end-users who have little knowledge of the hardware are able to develop deep learning algorithms on DLAs spending minimal programming efforts.

What Fails English as the Dream Language of Rural India？

Rural masses in India view English as the language of socio-economic empowerment through education. Education could be either in English or in regional languages, but children should learn English, because it is seen as the key to the world of opportunities in higher education and employment. The governments need to politically respond to the aspirations of the common masses keeping aside both politicised language policies and theoretical linguistic inputs that encourage one＇s mother tongue as the ideal medium of instruction. Onerous responsibility lays on men, methods, and materials over which government have the least say, but the practising teachers of English and academics who help bureaucrats in framing language policies in India are solely responsible for non-realization of dreams of the masses. There is something terribly rotten in the state of English-teaching enterprise in India. This paper proposes to examine the present state of affairs in the teaching of English to rural students and to offer constructive alternatives to the existing package of men, materials, and methods.

Local Radial Basis Function Methods: Comparison, Improvements, and Implementation

Radial Basis Function methods for scattered data interpolation and for the numerical solution of PDEs were originally implemented in a global manner. Subsequently, it was realized that the methods could be implemented more efficiently in a local manner and that the local approaches could match or even surpass the accuracy of the global implementations. In this work, three localization approaches are compared: a local RBF method, a partition of unity method, and a recently introduced modified partition of unity method. A simple shape parameter selection method is introduced and the application of artificial viscosity to stabilize each of the local methods when approximating time-dependent PDEs is reviewed. Additionally, a new type of quasi-random center is introduced which may be better choices than other quasi-random points that are commonly used with RBF methods. All the results within the manuscript are reproducible as they are included as examples in the freely available Python Radial Basis Function Toolbox.

An analysis method of topological relations between Snort rules

It is difficult to knowall the relations between Snort rules. To deal with this problem, the topological relations between Snort rules are classified based on the set theory, and a method for calculating the topological relations between Snort rules is proposed. In the existing methods for analyzing the relations of Snort rules, the relations are usually determined only according to the header information of the Snort rules. Without considering the actions of Snort rules, the proposed method improves upon the existing methods and it can classify and calculate the topological relations between Snort rules according to both headers and options information of Snort rules. In addition, the proposed method is implemented by the functional language Haskell. The experimental results showthat the topological relations between Snort rules can be calculated rapidly and effectively. The proposed method also provides an important basis for conflict detection in the succeeding Snort rules.

Dynamic Simulation of the Aircraft Environmental Control System

The dynamic research of aircraft environmental control system (ECS) is an important step in the advanced ECS design process. Based on the thermodynamics theory, mathematical models for the dynamic performance simulating of aircraft ECS were set up and an ECS simulation toolbox (ECS_1.0) was created with MATLAB language. It consists of main component modules (ducts, valves, heat exchangers, compressor, turbine, etc.). An aircraft environmental control system computer model was developed to assist engineers with the design and development of ECS dynamic optimization. An example simulating an existing ECS was given which shows the satisfactory effects.

Quantum programming languages: A tentative study

Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent results of the quantum computation group at Nanjing University, namely the functional quantum programming language NDQFP. All primitive functions and combining forms in NDQFP are given in the appendix.

Use of content management systems to address nursing workflow

Nurses are at the forefront of providing healthcare services to individuals of all age groups and with varying medical conditions.Aside from the critical knowledge and technical skills from nursing science,advancement in technology has assisted nurses in delivering quality nursing care by streamlining workflow processes and ensuring that data can easily be retrieved or modified.Electronic health records dramatically changed the landscape of the healthcare practice by providing an electronic means to store data and for healthcare professionals to retrieve and manipulate health information in a secured and collaborative environment.But with the nature of data being stored in the electronic health records,nurses still need to organize and process these data into relevant information,knowledge or wisdom so they can provide better holistic care to patients.This discussion paper details the role of content management systems in addressing nursing workflow by providing a mechanism for nurses to be developers themselves,and not just users or consumers of health innovative technologies.By using content management systems as platform for application development,nurses or other healthcare professionals,may be able to address problems with internal workflow without having to incur huge amounts in software development,or having to extensively learn programming languages.

An Improved Bottom-up Method for Implementing Equational Programming Language

Equational programming language (EP) is a novl intelligence language. This paper describes our EP system based on equational logic. Its execution mechanism is pattern matching. The paper focuses the discussion on the improvment to bottom-up tree pattern matching. The new bottom-up method shows high execution efficiency.

Decision Making as Theorem Proving

We present a method for using type theory to solve decision making problem. Our method is based on the view that decision making is a special kind of theorem proving activity. An isomorphism between problems and types, and solutions and programs has been established to support this view which is much similar to the Curry-Howard isomorphism between propositions and types, and proofs and programs. To support our method, a proof development system called PowerEpsilon has been developed, and the synthesis of a decision procedure for validity of first-order propositional logic is discussed to show the power of the system.