Time filter

Source Type

Gevorkyan A.S.,Institute for Informatics and Automation Problems | Gevorkyan A.S.,Armenian National Academy of Sciences | Oganesyan K.B.,Yerevan Physics Institute | Oganesyan K.B.,Joint Institute for Nuclear Research | And 2 more authors.
Laser Physics Letters | Year: 2015

The possibility of channeling low-energy relativistic positrons in some ionic crystals with axial symmetry is shown. The annihilation processes of positrons with medium electrons are investigated in detail. The lifetime of a positron in the regime of channeling is estimated; the existence of a long relaxation lifetime has been shown. © 2015 Astro Ltd.


Aslanyan L.,Institute for Informatics and Automation Problems | Sahakyan H.,Institute for Informatics and Automation Problems | Gronau H.-D.,University of Rostock | Wagner P.,University of Rostock
CSIT 2015 - 10th International Conference on Computer Science and Information Technologies | Year: 2015

Characterization of n-cube subsets is considered in terms of variable frequencies (differences) or in terms of hypergraphs - their degree sequences. Characterization under specific constraints is considered - those are the constraints of: upper sets, Sperner sets and random sets. Above the general knowledge about the subset characteristics like variable differences and degree sequences these specific classes are also characterized by sets of their properties - inclusion one into the other, reductions and complexity issues, example series and random descriptions. The issues considered are tightly related to the areas of computer tomography, theory of Boolean functions, (0,1) matrices, hypergraphs, and combinatorial set systems. © 2015 IEEE.


Abrahamyan H.V.,Byurakan Astrophysical Observatory BAO | Mickaelian A.M.,Byurakan Astrophysical Observatory BAO | Knyazyan A.V.,Institute for Informatics and Automation Problems
Astronomy and Computing | Year: 2015

Optical identifications of a few thousands of IRAS sources showed that IRAS Point Source and IRAS Faint Source catalogues (PSC and FSC, respectively) contain many quasars and active galactic nuclei, late-type stars, planetary nebulae, variables, etc. To increase the efficiency of using IRAS PSC and FSC, which contain a lot of common sources, one needs a joint catalogue of all IRAS point sources with improved data based on both catalogues. However, cross-correlation of the catalogues is not so easy, as the association of many sources is relative, and not always it is obvious, whose source from one catalogue corresponds to the other one in the second catalogue. This problem exists in case of using standard cross-correlation tools like VizieR. Therefore, we have created a tool for cross-matching astronomical catalogues and we have applied it to IRAS PSC and FSC. Using this tool we have carried out identifications with a search radius corresponding to 3 σ of errors for each source individually rather than a standard radius for all sources. As a result, we obtained 73,770 associations. We showed that in case of cross-correlation of these catalogues by VizieR, we had to take 161.95 arcseconds radius not to lose any association; however, in this case a lot of false associations appear for many sources. In addition, we have made cross-correlations with AKARI-IRC, AKARI-FIS and WISE catalogues. As a result we created a catalogue with high positional accuracy and with 17 photometric measurements from 1.25 to 160μm range, providing a detailed catalogue for IRAS point sources. © 2015 Elsevier B.V.


Mokatsian A.H.,Institute for Informatics and Automation Problems
CSIT 2013 - 9th International Conference on Computer Science and Information Technologies, Revised Selected Papers | Year: 2013

Let us adduce some definitions: If a computably enumerable (ce.) set A is a disjoint union of two sets B and C, then we say that B, C is a ce. splitting of A. A c.e. set A is tt-mitotic (btt-mitotic) if there is a ce. Splitting (B, Q of A such that the sets B and C both belong to the same tt- (btt-) degree of unsolvability, as the set A. In this paper it is proved, that there exists a tt-mitotic low set, which is not oft-mitotic. © 2013 IEEE.


Shahbazyan K.V.,Institute for Informatics and Automation Problems | Shoukourian Yu.H.,Institute for Informatics and Automation Problems
Cybernetics and Systems Analysis | Year: 2012

This paper presents algorithms for solving several matching problems on Mazurkiewicz traces. The creation of the algorithms is reduced to the construction of automata that recognize corresponding rational trace languages. Such languages and their properties were studied by many authors. This paper considers trace languages used in solving concrete problems that have analogs in stringology. © 2012 Springer Science+Business Media, Inc.


Shahbazyan K.V.,Institute for Informatics and Automation Problems | Shoukourian Yu.H.,Institute for Informatics and Automation Problems
Cybernetics and Systems Analysis | Year: 2013

The concepts of forbidden strings and forbidden subsequences are generalized to traces. This paper presents algorithms for constructing sets of minimal forbidden traces and minimal forbidden subtraces for a given trace. © 2013 Springer Science+Business Media New York.

Loading Institute for Informatics and Automation Problems collaborators
Loading Institute for Informatics and Automation Problems collaborators