Marked-up programming: Using XML to structure computer program source code

2000 ◽  
Vol 2 (2) ◽  
pp. 165-182
Author(s):  
Tuomas J. Lukka
Keyword(s):  
Computer Program ◽  
Source Code

scholarly journals Automatic Differentiation in ROOT

2020 ◽  
Vol 245 ◽  
pp. 02015
Author(s):  
Vassil Vassilev ◽  
Aleksandr Efremov ◽  
Oksana Shadura
Keyword(s):  
Computer Program ◽  
Automatic Differentiation ◽  
Source Code ◽  
Constant Factor ◽  
Control Flow ◽  
Chain Rule ◽  
Elementary Functions ◽  
Arithmetic Operations ◽  
Small Constant ◽  
Derivatives Of

In mathematics and computer algebra, automatic differentiation (AD) is a set of techniques to evaluate the derivative of a function specified by a computer program. AD exploits the fact that every computer program, no matter how complicated, executes a sequence of elementary arithmetic operations (addition, subtraction, multiplication, division, etc.), elementary functions (exp, log, sin, cos, etc.) and control flow statements. AD takes source code of a function as input and produces source code of the derived function. By applying the chain rule repeatedly to these operations, derivatives of arbitrary order can be computed automatically, accurately to working precision, and using at most a small constant factor more arithmetic operations than the original program. This paper presents AD techniques available in ROOT, supported by Cling, to produce derivatives of arbitrary C/C++ functions through implementing source code transformation and employing the chain rule of differential calculus in both forward mode and reverse mode. We explain its current integration for gradient computation in TFormula. We demonstrate the correctness and performance improvements in ROOT’s fitting algorithms.

scholarly journals IDENTIFICATION OF HIDDEN VULNERABILITIES IN THE SOURCE CODE MULTI-THREAD PROGRAMS BY ANALYSIS OF FUNCTIONAL TRANSITIONS

2020 ◽  
pp. 43-48
Author(s):  
D. A. Morgunov ◽  
Keyword(s):  
Mathematical Modeling ◽  
Computer Program ◽  
Source Code ◽  
Theoretic Model ◽  
Verification Method ◽  
Stochastic Nature ◽  
Multithreaded Programs ◽  
Function Call ◽  
Data Races ◽  
Time Required

The article presents a new set-theoretic model and procedures that reduce the time required to detect hidden vulnerabilities in the source code of multi-threaded computer programs, as well as the results of mathematical modeling. Hidden vulnerabilities in the article are under-stood as vulnerabilities leading to data races and deadlocks, since they have a stochastic nature of manifestation during testing, which greatly complicates their identification. The presented model describes the state of each thread of a multi-threaded computer program currently exe-cuting a function and the contents of the function call stack. At the same time, it remains pos-sible to use the model in verification by the Model Checking method, and also eliminates the need to solve the problem of searching for the model invariant. The presented procedures make it possible to formulate specifications for the verification method on models, the implementa-tion of which makes it possible to identify vulnerabilities leading to data races and deadlocks in the source code of multithreaded programs

scholarly journals A Graphical Approach to Yield and Boundary Surfaces of Selected Hypoplastic Constitutive Equations

2011 ◽  
Vol 57 (2) ◽  
pp. 139-151
Author(s):  
Z. Sikora ◽  
P. Ciesla
Keyword(s):  
Computer Program ◽  
Yield Surface ◽  
Constitutive Equations ◽  
Source Code ◽  
Graphical Approach ◽  
Boundary Surfaces

Abstract The article describes how to identify the boundary and yield surface for hypoplastic constitutive equations proposed by Wu, Gudehus and Bauer. It is shown how to identify and plot the surfaces for any equation in this class. Calculation errors are analyzed characteristic for applied set of numerical formulas. In the paper there are computer links to the source code prepared in the MATLAB system, based on instructions in the article. A sample consitutive domains are shown, plotted using the attached computer program.

scholarly journals AUTOMATA SEBAGAI MODEL PENGENAL BAHASA

2009 ◽  
Vol 1 (2) ◽  
pp. 53
Author(s):  
Eddy Maryanto
Keyword(s):  
Computer Program ◽  
Finite Automaton ◽  
Source Code ◽  
Computer Software ◽  
Deterministic Finite Automaton ◽  
Machine Code ◽  
Software Technology ◽  
Nondeterministic Finite Automaton

A deterministic finite automaton as well a nondeterministic finite automaton can be used to model a language recognizer. In computer software technology, language recognizer usually be an integrated part of a compiler, that is a computer program that take responsibility to translate source code into machine code. Comparing with a deterministic finite automaton, a nondeterministic finite automaton is a better model for language recognizer because it might be simpler and less in size than a deterministic one.

scholarly journals CoxIter – Computing invariants of hyperbolic Coxeter groups

2015 ◽  
Vol 18 (1) ◽  
pp. 754-773 ◽  
Author(s):  
R. Guglielmetti
Keyword(s):  
Computer Program ◽  
Euler Characteristic ◽  
Coxeter Groups ◽  
Source Code ◽  
Theoretical Background ◽  
Combinatorial Structure ◽  
Fundamental Polyhedron ◽  
Supplementary Material

CoxIter is a computer program designed to compute invariants of hyperbolic Coxeter groups. Given such a group, the program determines whether it is cocompact or of finite covolume, whether it is arithmetic in the non-cocompact case, and whether it provides the Euler characteristic and the combinatorial structure of the associated fundamental polyhedron. The aim of this paper is to present the theoretical background for the program. The source code is available online as supplementary material with the published article and on the author’s website (http://coxiter.rgug.ch).Supplementary materials are available with this article.

A general computer program for the extended plate overlap algorithm

1978 ◽  
Vol 48 ◽  
pp. 287-293 ◽  
Author(s):  
Chr. de Vegt ◽  
E. Ebner ◽  
K. von der Heide
Keyword(s):  
Computer Program ◽  
Simultaneous Determination ◽  
General Computer Program ◽  
General Computer

In contrast to the adjustment of single plates a block adjustment is a simultaneous determination of all unknowns associated with many overlapping plates (star positions and plate constants etc. ) by one large adjustment. This plate overlap technique was introduced by Eichhorn and reviewed by Googe et. al. The author now has developed a set of computer programmes which allows the adjustment of any set of contemporaneous overlapping plates. There is in principle no limit for the number of plates, the number of stars, the number of individual plate constants for each plate, and for the overlapping factor.

Structures and crystallization of vacuum-deposited amorphous Se and Sb films

1990 ◽  
Vol 48 (4) ◽  
pp. 140-141
Author(s):  
Makoto Shiojiri ◽  
Toshiyuki Isshiki ◽  
Tetsuya Fudaba ◽  
Yoshihiro Hirota
Keyword(s):  
Monte Carlo ◽  
Electron Microscope ◽  
Monte Carlo Method ◽  
Computer Program ◽  
Radial Distribution ◽  
Film Formation ◽  
Amorphous State ◽  
Two Dimensional ◽  
Amorphous Films ◽  
Binding Condition

In hexagonal Se crystal each atom is covalently bound to two others to form an endless spiral chain, and in Sb crystal each atom to three others to form an extended puckered sheet. Such chains and sheets may be regarded as one- and two- dimensional molecules, respectively. In this paper we investigate the structures in amorphous state of these elements and the crystallization.HRTEM and ED images of vacuum-deposited amorphous Se and Sb films were taken with a JEM-200CX electron microscope (Cs=1.2 mm). The structure models of amorphous films were constructed on a computer by Monte Carlo method. Generated atoms were subsequently deposited on a space of 2 nm×2 nm as they fulfiled the binding condition, to form a film 5 nm thick (Fig. 1a-1c). An improvement on a previous computer program has been made as to realize the actual film formation. Radial distribution fuction (RDF) curves, ED intensities and HRTEM images for the constructed structure models were calculated, and compared with the observed ones.

Sign in / Sign up

Export Citation Format

Share Document