scholarly journals A binary encoding of spinors and applications

2020 ◽  
Vol 7 (1) ◽  
pp. 162-193
Author(s):  
Gerardo Arizmendi ◽  
Rafael Herrera
Keyword(s):  
Lie Algebras ◽  
Binary Code ◽  
Computer Programs ◽  
Binary Encoding ◽  
Explicit Representations

AbstractWe present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations. As applications, we present explicit descriptions of the triality automorphism of Spin(8), explicit representations of the Lie algebras 𝔰𝔭𝔦𝔶 (8), 𝔰𝔭𝔦𝔶 (7) and 𝔤2, etc.

Bond Graph Binary Encoding Method for Genetic Algorithms Applications

2003 ◽  
Author(s):  
Germa´n L. Di´az-Cuevas ◽  
Roger F. Ngwompo
Keyword(s):  
Genetic Algorithms ◽  
Dynamic Systems ◽  
Binary Code ◽  
Worked Examples ◽  
Bond Graphs ◽  
Binary Encoding ◽  
Coding Method ◽  
Performance Specifications ◽  
Model Equations ◽  
Encoding Method

A binary encoding method for bond graphs that can be used for genetic algorithms (GAs) applications is presented. The originality of the proposed coding is that it encompasses causal information. This ensures that causal analysis is taken into account in assessing the fitness of topologies generated in GA operations and the suitability of design candidates to meet performance specifications can be tested directly from the binary code as the model equations can be derived from it. The code is suitable for GAs applications on bond graphs (BG) for topology and parameter optimisation in automated synthesis of dynamic systems. The coding method and its possible applications are illustrated through worked examples.

EXTENDED STATE EXPANSIONS AND THE UNIVERSALITY OF WITTEN’S VERSION OF LINK POLYNOMIAL THEORY

1990 ◽  
Vol 05 (10) ◽  
pp. 1975-2003 ◽  
Author(s):  
MO-LIN GE ◽  
YU-QUAN LI ◽  
KANG XUE
Keyword(s):  
Lie Algebras ◽  
Braid Group ◽  
Point Of View ◽  
Extended State ◽  
Explicit Representations ◽  
Markov Trace ◽  
Chern Simons ◽  
Polynomial Theory

The Witten’s version for constructing the skein relations of link polynomials based on (2+1) Chern-Simons Lagrangian is shown to be universal for Lie algebras. The extended state calculations are developed to give the explicit representations of braid group and new understanding of framing factor from the point of view of generalized Markov trace.

The Construction of Representations of Lie Algebras of Characteristic Zero

1962 ◽  
Vol 14 ◽  
pp. 304-312
Author(s):  
B. Noonan
Keyword(s):  
Lie Algebra ◽  
Lie Algebras ◽  
Characteristic Zero ◽  
Closed Field ◽  
Algebraically Closed Field ◽  
Basis Element ◽  
A Value ◽  
Representations Of Lie Algebras ◽  
Explicit Representations ◽  
The Ideal

In this paper a procedure is given whereby, from a representation of an ideal contained in the radical, explicit representations of a Lie algebra by matrices can be constructed in an algebraically closed field of characteristic zero. The construction is sufficiently general to permit one arbitrary eigenvalue to be assigned to the representation of each basis element of the radical not in the ideal. The theorem of Ado is proved as an application of the construction. While Ado's theorem has several proofs (1; 3; 5; 6), the present one has a value in its explicitness and in the fact that the degree of the representation can be given.

Correlations in Computer Programs

Fractals ◽  
1998 ◽  
Vol 06 (02) ◽  
pp. 131-138 ◽  
Author(s):  
Miroslav M. Novak
Keyword(s):  
Random Walk ◽  
Statistical Methods ◽  
Binary Code ◽  
Source Code ◽  
Computer Programs ◽  
Random Walk Model ◽  
Spearman Correlation ◽  
Correlation Methods ◽  
Object Files ◽  
Degree Of Similarity

Numerical and statistical methods are used to analyze and classify computer programs. Both computer source code and object files are examined. The results of the application of the Pearson and Spearman correlation methods to the source code are coupled with the random walk model applied to the binary code. One of the practical consequences of the analysis is the ability to quantify the degree of similarity between different computer programs and, hence, identify cases of plagiarism.

LZW differential evolution for binary encoding

2012 ◽  
Author(s):  
Orawan Watchanupaporn ◽  
Worasait Suwannik
Keyword(s):  
Differential Evolution ◽  
Binary Encoding

The Computational Sublime in Nick Montfort's ‘Round’ and ‘All the Names of God’

CounterText ◽  
2015 ◽  
Vol 1 (3) ◽  
pp. 348-365 ◽  
Author(s):  
Mario Aquilina
Keyword(s):  
Computer Code ◽  
Computer Programs ◽  
Literary Text ◽  
Text Generation ◽  
Mathematical Concepts ◽  
Literary Space

What if the post-literary also meant that which operates in a literary space (almost) devoid of language as we know it: for instance, a space in which language simply frames the literary or poetic rather than ‘containing’ it? What if the countertextual also meant the (en)countering of literary text with non-textual elements, such as mathematical concepts, or with texts that we would not normally think of as literary, such as computer code? This article addresses these issues in relation to Nick Montfort's #!, a 2014 print collection of poems that presents readers with the output of computer programs as well as the programs themselves, which are designed to operate on principles of text generation regulated by specific constraints. More specifically, it focuses on two works in the collection, ‘Round’ and ‘All the Names of God’, which are read in relation to the notions of the ‘computational sublime’ and the ‘event’.

THE IDENTIFICATION OF PARAMETERS OF THEORIES USED FOR PROGNOSES OF POST MINING DEFORMATIONS BY MEANS OF PRESENT SOFTWARE / IDENTYFIKACJA WARTOŚCI PARAMETRÓW TEORII PROGNOZOWANIA WPŁYWÓW PRZY WYKORZYSTANIU WSPÓŁCZESNYCH NARZĘDZI INFORMATYCZNYCH

2013 ◽  
Vol 58 (4) ◽  
pp. 1347-1357 ◽  
Author(s):  
Roman Ścigała
Keyword(s):  
Rock Mass ◽  
Land Surface ◽  
Underground Mining ◽  
Transient State ◽  
Computer Programs ◽  
Asymptotic State ◽  
Software System ◽  
Practical Utilization ◽  
Identification Of Parameters ◽  
Graphical Processing

Abstract The characteristic of specialized computer programs has been presented, serving for identification of W. Budryk-S. Knothe theory parameters, used for description of asymptotic state of post-mining deformations, as well as for transient state. The software is the result of several years of authors’ work. It is a part of complete software system designed for forecasting of underground mining influences on the rock mass and land surface and graphical processing of calculations results. Apart from software description, a short example of its practical utilization has been attached.

Sign in / Sign up

Export Citation Format

Share Document