Search results for "ALGORITHM"

Methods matter: Testing competing models for designing short-scale Big-Five assessments

2015

Abstract Many psychological instruments are psychometrically inadequate because derived person-parameters are unfounded and models will be rejected using established psychometric criteria. One strategy towards improving the psychometric properties is to shorten instruments. We present and compare the following procedures for the abbreviation of self-report assessments on the Trait Self-Description Inventory in a sample of 14,347 participants: (a) Maximizing reliability/main loadings, (b) Minimizing modification indices/cross loadings, (c) the PURIFY Algorithm in Tetrad, (d) Ant Colony Optimization, and (e) a genetic algorithm. Ant Colony Optimization was superior to all other methods in imp…

Finite-element design sensitivity analysis for non-linear potential problems

1990

Design sensitivity analysis is performed for the finite-element system arising from the discretization of non-linear potential problems using isoparametric Lagrangian elements. The calculated sensitivity formulae are given in a simple matrix form. Applications to the design of electromagnets and airfoils are given.

Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra

2019

AbstractWe propose three cryptographic key exchange protocols in the octonion algebra. Using the totient function, defined for integral octonions, we generalize the RSA public-key cryptosystem to the octonion arithmetics. The two proposed symmetric cryptographic key exchange protocols are based on the automorphism and the derivation of the octonion algebra.

Nonstochastic languages as projections of 2-tape quasideterministic languages

1998

A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L (n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tape quasideterministic language exists, the projection of which on the first tape is a nonstochastic language.

Inductive synthesis of dot expressions

2005

We consider the problem of the synthesis of algorithms by sample computations. We introduce a formal language, namely, the so-called dot expressions, which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical equivalence of dot expressions are defined and proved to be decidable. A formal example of a dot expression is defined in the way that, actually, it represents a sample computation of the program presented by the given dot expression. A system of s…

Counterexamples for unique continuation

1988

Erratum/Addendum to the paper ``Some seminorms on quasi*-algebras" (Studia Math. 158 (2003), 99–115)

2004

Vector Bundles and Torsion Free Sheaves on Degenerations of Elliptic Curves

2006

In this paper we give a survey about the classification of vector bundles and torsion free sheaves on degenerations of elliptic curves. Coherent sheaves on singular curves of arithmetic genus one can be studied using the technique of matrix problems or via Fourier-Mukai transforms, both methods are discussed here. Moreover, we include new proofs of some classical results about vector bundles on elliptic curves.

Learning from good examples

1995

The usual information in inductive inference for the purposes of learning an unknown recursive function f is the set of all input /output examples (n,f(n)), n ∈ ℕ. In contrast to this approach we show that it is considerably more powerful to work with finite sets of “good” examples even when these good examples are required to be effectively computable. The influence of the underlying numberings, with respect to which the learning problem has to be solved, to the capabilities of inference from good examples is also investigated. It turns out that nonstandard numberings can be much more powerful than Godel numberings.

An improved algorithm for thermal dynamic simulation of walls using Z-transform coefficients

2003

The Transfer Function Method (TFM), recommended by American Society of Heating, Refrigerating and Air-Conditioning Engineers (ASHRAE), is one of the most modern tools available to solve heat transfer problems in building envelopes and environments. TFM utilises Z-transform to solve the equations system that describes the heat transfer in a multi-layered wall. Due to an analogy with an electric circuit, it is possible to write the equations system in a matrix suitable to be solved by computer. Authors carried out an analysis on an historical building placed in the south of Italy to test the reliability and the quality of the thermal dynamic simulation using TFM. The analysis is performed usi…