Unified form language: A domain-specific language for weak formulations of partial differential equations

We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational forms and functionals, automatic differentiation of forms and expressions, arbitrary function space hierarchies formultifield problems, general differential operators and flexible tensor algebra. With these features, UFL has been used to effortlessly express finite element methods for complex systems of partial differential equations in near-mathematical notation, resulting in compact, intuitive and readable programs. We present in this work the language and its construction. An implementation of UFL is freely available as an open-source software library. The library generates abstract syntax tree representations of variational problems, which are used by other software libraries to generate concrete low-level implementations. Some application examples are presented and libraries that support UFL are highlighted. © 2014 ACM.

function definition language fdl and its implementation

A Function Definition Language (FDL) is presented. Though designed for describing specifications, FDL is also a general-purpose functional programming language. It uses context-free language as data type, supports pattern matching definition of functions, offers several function definition forms, and is executable. It is shown that FDL has strong expressiveness, is easy to use and describes algorithms concisely and naturally. An interpreter of FDL is introduced. Experiments and discussion are included.

yet another meta-language for programming language processing

The formal specification language LFC was designed to support formal specification acquisition. However, it is yet suited to be used as a meta-language for specifying programming language processing. This paper introduces LFC as a meta-language, and compares it with ASF+SDF, an algebraic specification formalism that can also be used to programming languages.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.

smoothing document language model with local word graph

ACM SIGIR; ACM SIGWEB

Heavy Metals in Soil and Crops of an Intensively Farmed Area: A Case Study in Yucheng City, Shandong Province, China

lThe study was supported by the Knowledge Innovation Foundation of the institute of Geographical Sciences and Natural Resource, Chinese Academy of Sciences (Grant No. 200906002) and Key Directional Project of Knowledge Innovation of Chinese Academy of Sciences (Grant No. KSCX2-YW-N-46-01). The authors would like to thank to Luke Driskell for his kind help and hard work on English language polishing of the article.

Identification of Porphyra lines (Rhodophyta) by AFLP DNA fingerprinting and molecular markers

Twenty-seven Porphyra lines from 5 classes, including lines widely used in China, wild lines, and lines introduced to China from abroad in recent years, were screened by means of amplified fragment length polymorphism (AFLP) with 24 primer pairs. From the generated AFLP products, 13 bands that showed stable and repeatable AFLP patterns amplified by primer pairs M-CGA/E-AA and M-CGA/E-TA were scored and used to develop the DNA fingerprints of the 27 Porphyra lines. Moreover, the DNA fingerprinting patterns were converted into computer language expressed with digitals 1 and 0, which represented the presence (numbered as 1) or absence (numbered as 0) of the corresponding band. On the basis of these results, computerized AFLP DNA fingerprints were constructed in which each of the 27 Porphyra lines has its unique AFLP,fingerprinting pattern and can be easily distinguished from others. Software called PGI-AFLP (Porphyra germplasm identification-AFLP) was designed for identification of the 27 Porphyra lines. In addition, 21 specific AFLP markers from 15 Porphyra lines were identified; 6 AFLP markers from 4 Porphyra lines were sequenced, and 2 of them were successfully converted into SCAR (sequence characterized amplification region) markers. The developed AFLP DNA fingerprinting and specific molecular markers provide useful ways for the identification, classification, and resource protection of the Porphyra lines.

Natural Language Syntax and First Order Preference

We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure. This procedure seems more effective than corresponding procedures based on either classical syntax of our previously proposed taxonomic syntax. This observation may provide a functional explanation for some of the syntactic structure of English.

Computational Consequences of Agreement and Ambiguity in Natural Language

The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).

The Behavior Language; User's Guide

The Behavior Language is a rule-based real-time parallel robot programming language originally based on ideas from [Brooks 86], [Connell 89], and [Maes 89]. It compiles into a modified and extended version of the subsumption architecture [Brooks 86] and thus has backends for a number of processors including the Motorola 68000 and 68HCll, the Hitachi 6301, and Common Lisp. Behaviors are groups of rules which are activatable by a number of different schemes. There are no shared data structures across behaviors, but instead all communication is by explicit message passing. All rules are assumed to run in parallel and asynchronously. It includes the earlier notions of inhibition and suppression, along with a number of mechanisms for spreading of activation.