Construction of an effective algorithm to find the isomorphism of two simple finite semigroups

Cybernetics ◽  
1987 ◽  
Vol 22 (6) ◽  
pp. 706-714
Author(s):  
V. A. Makarenko
Keyword(s):  
Effective Algorithm ◽  
Finite Semigroups

An Effective Algorithm for Large Scale Image and Terrain Data Walkthrough

2009 ◽  
Vol 11 (5) ◽  
pp. 604-609
Author(s):  
Liuqing MA ◽  
Guanfu SONG ◽  
Hui GUO ◽  
Qin ZHOU
Keyword(s):  
Large Scale ◽  
Effective Algorithm

Inverse spectral problem of an anharmonic oscillator on a half-axis with the Neumann boundary condition

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Agil K. Khanmamedov ◽  
Nigar F. Gafarova
Keyword(s):  
Boundary Condition ◽  
Neumann Boundary Condition ◽  
Inverse Spectral Problem ◽  
Anharmonic Oscillator ◽  
Neumann Boundary ◽  
Effective Algorithm ◽  
Inverse Spectral Problems ◽  
Main Equation ◽  
Inverse Spectral ◽  
Half Axis

AbstractAn anharmonic oscillator {T(q)=-\frac{d^{2}}{dx^{2}}+x^{2}+q(x)} on the half-axis {0\leq x<\infty} with the Neumann boundary condition is considered. By means of transformation operators, the direct and inverse spectral problems are studied. We obtain the main integral equations of the inverse problem and prove that the main equation is uniquely solvable. An effective algorithm for reconstruction of perturbed potential is indicated.

A system of constructor classes: overloading and implicit higher-order polymorphism

1995 ◽  
Vol 5 (1) ◽  
pp. 1-35 ◽  
Author(s):  
Mark P. Jones
Keyword(s):  
Type System ◽  
Type Systems ◽  
Natural Generalization ◽  
Higher Order ◽  
Functional Language ◽  
Effective Algorithm ◽  
Prototype Implementation ◽  
Type Classes

AbstractThis paper describes a flexible type system that combines overloading and higher-order polymorphism in an implicitly typed language using a system of constructor classes—a natural generalization of type classes in Haskell. We present a range of examples to demonstrate the usefulness of such a system. In particular, we show how constructor classes can be used to support the use of monads in a functional language. The underlying type system permits higher-order polymorphism but retains many of the attractive features that have made Hindley/Milner type systems so popular. In particular, there is an effective algorithm that can be used to calculate principal types without the need for explicit type or kind annotations. A prototype implementation has been developed providing, amongst other things, the first concrete implementation of monad comprehensions known to us at the time of writing.

scholarly journals Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm

Algorithmica ◽  
2017 ◽  
Vol 80 (6) ◽  
pp. 1804-1833 ◽  
Author(s):  
Gennaro Cordasco ◽  
Luisa Gargano ◽  
Marco Mecchia ◽  
Adele A. Rescigno ◽  
Ugo Vaccaro
Keyword(s):  
Social Networks ◽  
Small Target ◽  
Effective Algorithm ◽  
Target Sets
Sign in / Sign up

Export Citation Format

Share Document