item: #1 of 341 id: mpcs-10 author: Petrosyan, Garik title: Polynomial Bounded Proof Complexities for Some Classes of DNF-Tautologies date: 2020-07-10 words: 3140 flesch: 65 summary: [4] L. Strasburger, “Extension without Cut”, INRIA SaclayIle-de-France and Ecole Poly- technique, LIX, Rue de Saclay, 91128 Palaiseau Cedex, France [5] S. R. Buss, “Polynomial size proofs of the propositional pigeonhole principle”, Journal of Symbolic Logic, vol. In particular, Lutz Strasburger introduced in [2] the notion of balanced formulas and showed that if there are polynomially bounded Frege proofs for the set of balanced tautologies, then the Frege systems are super. keywords: conjunct; dnf; polynomially; proof; set; tautologies; variables cache: mpcs-10.pdf plain text: mpcs-10.txt item: #2 of 341 id: mpcs-11 author: Hambardzumyan, Arsen A. title: Investigation of Monotonous Properties for Frege Systems date: 2020-07-10 words: 3063 flesch: 84 summary: (p ⊃ p)) &((¬q) ⊃ (t ⊃ (q ⊃ r))) &((¬q) ⊃ (q ⊃ r)) We will add q ⊃ to P(A′(q)) because we assumed q is true(1) when modifying ⊃. So, no minimal can be obtained by replacing any subformula of A or Ti(q) in (q ⊃ P(A′(q)))& . . . &Ti(q) . . keywords: proof cache: mpcs-11.pdf plain text: mpcs-11.txt item: #3 of 341 id: mpcs-113 author: Nahapetyan, Hayk E. title: An Example of a Multiplayer Serious Game on 3D Sandpile Model date: 2021-12-10 words: 3132 flesch: 60 summary: The idea behind the developed model relies on various theorems regarded to Sandpile model, which improved the concept of learning and increased attractiveness. grain on Sandpile model public static void AddGrain(Position pos); //Adds keywords: example; game; grains; model; order; sandgame; sandpile; void cache: mpcs-113.pdf plain text: mpcs-113.txt item: #4 of 341 id: mpcs-115 author: Koulakzian, Mossine S.; Mosesyan, Carlen M.; Nikoghosyan, Zhora G. title: New Extensions of Dirac's Theorems date: 2021-12-10 words: 4500 flesch: 110 summary: e o r d e r ( t h e n u m b e r o Th u s , Th e o r e m 1 a n d Th e o r e m 2 a r e s h a r p in a ll r e s p e c t s . keywords: e n; e t; t h cache: mpcs-115.pdf plain text: mpcs-115.txt item: #5 of 341 id: mpcs-116 author: Koulakzian, Mossine S. title: On Long Cycles in Graphs in Terms of Degree Sequences date: 2021-12-10 words: 3224 flesch: 108 summary: L e t n b e t h e o r d e r ( t h e n u m b e r o Th e o r e m keywords: e n; e t cache: mpcs-116.pdf plain text: mpcs-116.txt item: #6 of 341 id: mpcs-117 author: Barseghyan, Rafayel V . title: About Complexity of FFT Algorithms for Length of q × 2p date: 2021-12-10 words: 9543 flesch: 110 summary: r e a c c u r a t e r e s u lt s we c [7 ] is p r e s e n t e d . keywords: e d; e n; e t; h e; n t; r e; s e; t h cache: mpcs-117.pdf plain text: mpcs-117.txt item: #7 of 341 id: mpcs-119 author: Poghosyan, Aghasi S. title: Image Caption Generation and Object Detection via a Single Model date: 2021-12-10 words: 3661 flesch: 74 summary: There are works which can extract image caption or object names and their coordinates. The final model extracts from image caption and object coordinates with their names without losing accuracy according to initial models. keywords: caption; image; object cache: mpcs-119.pdf plain text: mpcs-119.txt item: #8 of 341 id: mpcs-12 author: Khamisyan, Artur A. title: On Some Universal Propositional Proof Systems for Many-Valued Logic date: 2020-07-10 words: 2900 flesch: 74 summary: 𝐴𝐴 ⊃ (𝐵𝐵 ⊃ 𝐴𝐴) 2. (𝐴𝐴 ⊃ 𝐵𝐵) ⊃ (�𝐴𝐴 ⊃ (𝐵𝐵 ⊃ 𝐶𝐶)� ⊃ (𝐴𝐴 ⊃ 𝐶𝐶)) (𝐴𝐴1 ⊃ 𝐵𝐵) ⊃ (�𝐴𝐴 1 2� ⊃ 𝐵𝐵� ⊃ �(𝐴𝐴0 ⊃ 𝐵𝐵) ⊃ keywords: ⊃ �; ⊃ 𝐵𝐵; ⊃ 𝐶𝐶; 𝐴𝐴 ⊃; 𝐴𝐴 𝑝𝑝1; 𝐴𝐴1; 𝐴𝐴2 cache: mpcs-12.pdf plain text: mpcs-12.txt item: #9 of 341 id: mpcs-121 author: Keropyan, Grigor S.; Vardanyan, Vahagn G.; Aslanyan, Hayk K.; Kurmangaleev, Shamil F.; Gaissaryan, Sergey. S. title: Multiplatform Use-After-Free and Double-Free Detection in Binaries * date: 2021-12-10 words: 2601 flesch: 60 summary: For program analysis SDG (System Dependence Graph) machine-independent representation is used. The developed platform is capable to analyze binaries of several architectures (x86, x86-64, MIPS, POWER-PC, ARM) and is based on program static analysis approach. keywords: analysis; data; defects; graph; pointer; program; sdg; tool; uaf; use cache: mpcs-121.pdf plain text: mpcs-121.txt item: #10 of 341 id: mpcs-122 author: Grigoryan, Hayk A. title: Automation Script for WRF Model Data Assimilation System date: 2021-12-10 words: 1926 flesch: 54 summary: Conclusion The provided automation script makes simplify the work of the climatologists by using a user friendly approach obtain the observation data in LITTLE_R format, which are ready to be used as an input for WRF model WRFDA system. SYNOP Code SYNOP (surface synoptic observations) is a numerical code called FM-12 by WMO used for reporting weather observations made by manned and automated weather stations [6]. keywords: assimilation; data; file; little_r; model; observation; system; weather; wrf; wrfda cache: mpcs-122.pdf plain text: mpcs-122.txt item: #11 of 341 id: mpcs-123 author: Aslanyan, Hayk K. title: Effective and Accurate Binary Clone Detection date: 2021-12-10 words: 3446 flesch: 65 summary: Detection of binary code clones is used for malware analysis, finding semantic errors, detecting copyright violation, etc. Detection of binary code clones has many practical applications such as finding functionally similar parts of the program, malware, semantic errors and copyright violations. keywords: approach; binary; clones; code; code clones; detection; graph; program; stage; tool; vertices cache: mpcs-123.pdf plain text: mpcs-123.txt item: #12 of 341 id: mpcs-124 author: Ter-Vardanyan, Lilit A. title: Graphical Representations of E-Achievability Region for Identification and Secret-Key date: 2021-12-10 words: 1732 flesch: 55 summary: Keywords: Biometric identification system, Secret key, Rate-reliability, R environment. Depending on applications, different models of biometric identification and secret-key generation were considered [4]. keywords: identification; key; secret; system; 𝑅𝑅𝐼𝐼 cache: mpcs-124.pdf plain text: mpcs-124.txt item: #13 of 341 id: mpcs-125 author: Gevorgyan, Aram V. title: Point Clouds Preprocessing for Better Registration date: 2021-12-10 words: 2141 flesch: 70 summary: aramgv@gmail.com Abstract In this article, we review point clouds preprocessing algorithms that enhance the results and performance of point clouds registration. [8] [Online].Available: http://www.pointclouds.org/documentation/tutorials/remove_outliers.php#remove-outliers [9] A. V. Gevorgyan, “Point clouds registration and generation from stereo images”, ITHEA Journal, Information Content and Processing, vol. keywords: clouds; filter; icp; outlier; point; registration; results cache: mpcs-125.pdf plain text: mpcs-125.txt item: #14 of 341 id: mpcs-126 author: Aghajanyan, Ruben B. title: Modeling of Compliance Processes with Specified Criteria in Complex Dynamic Systems date: 2021-12-10 words: 3244 flesch: 48 summary: For each 𝑠𝑠𝑛𝑛 element, it is necessary to execute the sequence of the following 5 procedures: 1) Generating a value chain 𝐹𝐹(𝐺𝐺𝑖𝑖1), 𝐹𝐹(𝐺𝐺2), … 𝐹𝐹(𝐺𝐺𝑖𝑖), (1) where 𝑖𝑖 – the number of criteria groups 2) Calculation of the average values for each group, taking into account the weighting factors: 𝐹𝐹(𝑠𝑠𝑚𝑚, 𝐺𝐺1)𝜆𝜆1, (𝑠𝑠𝑚𝑚, 𝐺𝐺2)𝜆𝜆2,… 𝐹𝐹(𝑠𝑠𝑚𝑚, 𝐺𝐺𝑖𝑖)𝜆𝜆𝑖𝑖 , where 𝐹𝐹(𝑠𝑠𝑚𝑚, 𝐺𝐺𝑖𝑖) – the mean value according to expression (3) 3) Calculation of the integral sum 𝐼𝐼(𝑠𝑠𝑚𝑚), according to expression (4) 4) The definition of 𝐾𝐾𝑖𝑖 (i=1,2…z) for which 𝐼𝐼(𝑠𝑠𝑚𝑚) ∈ 𝐾𝐾𝑖𝑖, i.e., the definition of the group that includes the given integral sum 𝐼𝐼(𝑠𝑠𝑚𝑚) (5) 5) Generation of actions (expert opinion) according to the estimation of 𝐼𝐼(𝑠𝑠𝑚𝑚) and the corresponding group 𝐾𝐾𝑖𝑖 A practical example (pharmaceutical production) Consider the foregoing with the example of evaluating and selecting a supplier of ingredients and packaging materials in a pharmaceutical company. • Expert opinion • Calculation of new values of weight coefficients and evaluation criteria • Calculation of estimates according to given criteria • Calculation of estimates • System state analysis • Selection of the sequence of criteria • Defining assessment classes Selection of evaluation criteria Calculation of estimated values Comparison with given values Formation of new indicators R. Aghajanyan 91 keywords: criteria; evaluation; group; parameters; systems; values; 𝐴𝐴𝐴𝐴.; 𝐺𝐺1; 𝐺𝐺2; 𝐺𝐺𝑖𝑖 cache: mpcs-126.pdf plain text: mpcs-126.txt item: #15 of 341 id: mpcs-127 author: Harutyunyan, Hamlet H.; Avanesyan, Hmayak A. title: Consideration of Congestion Situations in Telecommunication Networks and Methods of Their Processing as a Special Type of Emergency Situations date: 2021-12-10 words: 2892 flesch: 56 summary: Currently, the main directions of research are conducted generally in the following areas:  increase the performance of switching centers (nodes);  increase the bandwidth of communication channels;  improvement of data transfer protocols;  creation of effective traffic processing algorithms; In this article, the congestion situation is considered as an emergency in switching centers. keywords: bandwidth; center; congestion; congestion situation; emergency; network; situation; switching; switching center; traffic cache: mpcs-127.pdf plain text: mpcs-127.txt item: #16 of 341 id: mpcs-128 author: Khachatrian, Hamlet K. title: Further Results for Encoding and Decoding Procedures of Asymmetric Low Magnitude Error Correcting Codes date: 2021-12-10 words: 2941 flesch: 71 summary: Further Results for Encoding and Decoding Procedures of Asymmetric Low Magnitude Error Correcting Codes Hamlet K. Khachatrian Institute for Informatics and Automation Problems of NAS RA e-mail: hamletkh@ipia.sci.am Abstract In this paper an implementation of encoding and decoding procedures for double ±1 error correcting optimal linear codes over rings 𝑍𝑍7 and 𝑍𝑍9 is presented. Also there are some papers regarding the construction of optimal double ±1 error correcting codes [3, 4]. keywords: code; 𝑍𝑍7; 𝑍𝑍9 cache: mpcs-128.pdf plain text: mpcs-128.txt item: #17 of 341 id: mpcs-130 author: Darbinyan, Samvel Kh. title: On Cyclability of Digraphs with a Manoussakis-type date: 2021-12-10 words: 19148 flesch: 110 summary: t h e o r e m s o n h a m t h e o r e m s o keywords: c e; e d; e e; e n; e s; e t; h e; n d; n t; o n; o t; r e; r t; s t; t h; t t cache: mpcs-130.pdf plain text: mpcs-130.txt item: #18 of 341 id: mpcs-131 author: Koulakzian, Mossine S.; Nikoghosyan, Zhora G. title: On Longest Cycles in 2-connected Graphs date: 2021-12-10 words: 5308 flesch: 108 summary: Th e fo llo win g t h e o r e m will b e u s e fu l. T heor em C: S in c e G is 2 -c o n n e c t e d , t h e n b y t h e V in e L e m m a , t h e r e is a vin e fL1; :::; Lmg o n P . keywords: e n; r e; t e cache: mpcs-131.pdf plain text: mpcs-131.txt item: #19 of 341 id: mpcs-132 author: Martirosyan, Narek H.; Karyan, Gevorg A. ; Akopov, Norayr Z. title: Statistical Tests for MIXMAX Pseudorandom Number Generator date: 2021-12-10 words: 4953 flesch: 65 summary: The results compared with those obtained from other PRNGs, e.g., Mersenne Twister, Ranlux, LCG reveal better qualities for MIXMAX in generating random numbers. When a specific statistical test is applied to random numbers produced by PRNG the p-value of the test is printed as a measure of deviation from null-hypothesis, which in our case is a uniform distribution of random numbers. keywords: chi; data; distribution; mersenne; mixmax; number; test; twister; vol cache: mpcs-132.pdf plain text: mpcs-132.txt item: #20 of 341 id: mpcs-133 author: Haroutunian, Mariam E.; Mkhitaryan, Karen K. title: Information-Theoretic Approach to Community Detection Problem date: 2021-12-10 words: 4847 flesch: 51 summary: Identifying graph communities is a popular topic in computer science. Solving community detection problems on modern real world network datasets can sometimes be very much complicated because of computational complexity as graphs may contain billions of nodes and edges and complexity of exact detection is NP-hard. keywords: algorithms; block; communities; community; detection; graph; information; model; networks; stochastic; theory; vertices cache: mpcs-133.pdf plain text: mpcs-133.txt item: #21 of 341 id: mpcs-136 author: Petrosyan, Arthur S.; Petrosyan, Gurgen S.; Tadevosyan, Robert N. title: Design and Implementation of "Handipum" WebRTCbased Conferencing Service in ASNET-AM Network date: 2021-12-10 words: 1928 flesch: 56 summary: Handipum և հասանելի է https://handipum.asnet.am հասցեով։ Մինչև Handipum համակարգի ներդրումը, մեր օգտագործողներից շատերը, որոնց թվում են՝ գիտնականները, գիտական և տեխնիկական աշխատողները, ասպիրանտները, ուսանողները և այլ մասնագետները, օգտվում էին տարբեր այլ արտաքին կոնֆերանս համակարգերից։ Այժմ, երբ Handipum համակարգը հասանելի է ողջ հայկական գիտակրթական հանրության համար և աշխատում է անմիջապես բրաուզերից, հույս ունենք, որ այն արժանի տեղական այլընտրանք կլինի մեր օգտագործողների համար։ Разработка и реализация сервиса конференций Handipum на основе протоколов WebRTC в сети ASNET-AM А. Петросян, Г. Петросян и Р․ Тадевосян Аннотация В статье описана разработка и реализация нового поколения сервиса веб конференций в сети ASNET-AM на основе протоколов WebRTC․ Реализация сервисов веб конференций в среде WebRTC в настоящее время пользуется большой популярностью по причине отсутствия необходимости установки специального клиентского приложения, в качестве которого выступает обычный веб браузер. Design and Implementation of Handipum WebRTC- based Conferencing Service in ASNET-AM Network Arthur S. Petrosyan, Gurgen S. Petrosyan and Robert N. Tadevosyan Institute for Informatics and Automation Problems of NAS RA e-mail: arthur@sci.am, gurgen@sci.am, robert@sci.am Abstract This paper presents the results of research and deployment experience with design and implementation of the ASNET-AM WebRTC-based audio/video conferencing service, called Handipum (handipum.asnet.am). keywords: asnet; conferencing; handipum; jitsi; media; room; server; service; video; webrtc cache: mpcs-136.pdf plain text: mpcs-136.txt item: #22 of 341 id: mpcs-137 author: Astsatryan, Hrachya V.; Gichunts, Edita E. title: Performances of Factorizations of Complex Hermitian Matrices in the Architecture of GPU Accelerator date: 2021-12-10 words: 2763 flesch: 59 summary: 2. LDLT Factorizationin CPU/GPU Hybrid Architecture Solutions of linear system of equations of the form 𝐴𝐴 ∗ 𝑍𝑍 = 𝐵𝐵 are being used in science on repeated occasions, where 𝐴𝐴 is a complex Hermitian matrix, and 𝐿𝐿𝐿𝐿𝐿𝐿𝑇𝑇 matrix factorization is used. 4. Conclusion We presented the performances of complex Hermitian matrix 𝐿𝐿𝐿𝐿𝐿𝐿𝑇𝑇 factorizations in CPU/GPU hybrid architecture. keywords: algorithm; factorization; matrix; 𝐿𝐿𝐿𝐿𝐿𝐿𝑇𝑇 cache: mpcs-137.pdf plain text: mpcs-137.txt item: #23 of 341 id: mpcs-138 author: Mkhitaryan, Andranik E. title: Mechanisms for Administrating Tasks and Editing Data Bases in Hybrid email/SMS Info-Communicational Systems date: 2021-12-10 words: 830 flesch: 48 summary: The problem of uncertainty over time of reading an email in addressee’s mailbox can be solved by using post informers (SMS servers) connected with the mail server and regional cellular network sending SMS to notify the addressee about receipting an email [2-5]. *notice to…(#phone)* - along with email send SMS notification to recipient  keywords: email; server; sms; technologies cache: mpcs-138.pdf plain text: mpcs-138.txt item: #24 of 341 id: mpcs-142 author: Darbinyan, Samvel Kh. title: On pre-Hamiltonian Cycles in Balanced Bipartite Digraphs date: 2021-12-10 words: 13891 flesch: 111 summary: On t h e o t h e r h a n d , u s in g ( 5 ) a n d ( 6 ) On t h e o t h e r h a n d , u s in g ( 7 ) a n d ux1 =2 A ( D ) , we o b t keywords: e n; e s; e t; h e; n d; n t; o n; o t; r e; r t; s s; s t; t h; t t cache: mpcs-142.pdf plain text: mpcs-142.txt item: #25 of 341 id: mpcs-143 author: Nikoghosyan, Zhora G. title: Spanning Trees with few Branch and end Vertices date: 2021-12-10 words: 8870 flesch: 109 summary: o b e a k-e n d e d t r e e 3x1 is a n f-e n d e d t r e e , c o n t r a keywords: e d; e e; e n; e s; e t; h e; n n; n t; o n; o t; r e; r t; t h cache: mpcs-143.pdf plain text: mpcs-143.txt item: #26 of 341 id: mpcs-144 author: Karapetyan, Martun M. title: Review of White-box Implementations of AES Block Cipher and Known Attacks date: 2021-12-10 words: 4485 flesch: 85 summary: p o r t 2 0 0 2 / 1 5 8 , For each of these dual ciphers, there exists an affine transformation ∆ that maps AES plaintext P, ciphertext C and key K into plaintext Pdual, ciphertext Cdual and key Kdual of a dual AES, i.e. Pdual = ∆(P), Cdual = ∆(C) and Kdual = ∆(K). keywords: aes; box; implementation; tables; white cache: mpcs-144.pdf plain text: mpcs-144.txt item: #27 of 341 id: mpcs-145 author: Haroutunian, Evgueni A. title: On Optimality of Tests of M-ary H ypotheses for Fixed Number of Independent date: 2021-12-10 words: 6625 flesch: 108 summary: r d e r t e s t s = ®m; m = 1 ; M ¡ 1 g a n d t h e n o r d e r t e s t s keywords: e n; e s; h e; n t; r e; s t; t e; t h; t t cache: mpcs-145.pdf plain text: mpcs-145.txt item: #28 of 341 id: mpcs-147 author: Petrosyan, Arthur S.; Petrosyan, Gurgen S. title: Selection of Methods to Provide End-to-End Email Traffic Security date: 2021-12-10 words: 1890 flesch: 61 summary: SMTP MTA STS has been designed to enhance the email communication security. The use of SMTP MTA STS would force MTA-MTA communication to be always encrypted. keywords: communication; email; end; mta; security; smtp; traffic cache: mpcs-147.pdf plain text: mpcs-147.txt item: #29 of 341 id: mpcs-148 author: Sahakyan, Vladimir G.; Shoukourian, Yuri H.; Astsatryan, Hrachya V. title: About Some Queueing Models for Computational Grid Systems date: 2021-12-10 words: 1647 flesch: 61 summary: Schemes based on the level of required resources -JU (Job Up): received to the job system, it is queued in order of required resources for the service ([service time] * Setting with interrupted service it is returned to the queue with the adjusted design parameters (service time, waiting time, etc.). keywords: job; jobs; maintenance; service; system; time cache: mpcs-148.pdf plain text: mpcs-148.txt item: #30 of 341 id: mpcs-149 author: Astsatryan, Hrachya V.; Gichunts, Edita E. title: Performances of Methods for Solving a Linear System of Equations in the Architecture of GPU Accelerator in Case of Small Matrices date: 2021-12-10 words: 2451 flesch: 60 summary: The versions with Partial Pivoting, without Pivoting and Random Butterfly Transformations of batched LU factorization for small matrices are presented and shown, which of these versions is the effective one, in which case we achieve high performance. In this work we consider the performances of methods for solving linear system of equations with batched LU factorization for small complex matrices on the graphic processor NVIDIA K40c. keywords: batched; equations; function; gpu; matrices; matrix; performance; pivoting; system cache: mpcs-149.pdf plain text: mpcs-149.txt item: #31 of 341 id: mpcs-150 author: Petrosyan, Arthur S. ; Petrosyan, Gurgen S. title: Development and Implementation of Some Advanced Web Server Protection Methods date: 2021-12-10 words: 2440 flesch: 54 summary: Additional strict filter that scans and detects all types of files and folders was written by ASNET-AM team: failregex = ^%(_apache_error_client)s File does not exist While it adds web site protection, it should be used very carefully, because the web site developers or content editors may include broken links to different files, pictures, etc. The above-described default functionality of fail2ban allows to protect website not only from the so-called brute force attacks, but also from automatic scanning of web site by means of some bot scripts. keywords: apache; methods; protection; server; site; web cache: mpcs-150.pdf plain text: mpcs-150.txt item: #32 of 341 id: mpcs-151 author: Muradian, David H. title: A Polynomial Algorithm for the Minimum Bandwidth of Interval Graphs date: 2021-12-10 words: 4669 flesch: 84 summary: + 1, 𝑛𝑛] is incident to an edge with the length above K. Proof: By Lemma 1 we have 𝑧𝑧 ⊂̇ 𝑥𝑥, and z together with x don’t have adjacent vertices in 𝑋𝑋𝜑𝜑𝑖𝑖[𝜑𝜑𝑖𝑖(𝑦𝑦) By definition u doesn’t have adjacent vertices in 𝑋𝑋𝜑𝜑𝑖𝑖−1[𝜑𝜑𝑖𝑖−1(𝑦𝑦) keywords: bandwidth; vertex; vertices cache: mpcs-151.pdf plain text: mpcs-151.txt item: #33 of 341 id: mpcs-152 author: Grigoryan, Hayk A. title: Increasing the Visibility of Scientific Data in Armenia Using Persistent Identifiers date: 2021-12-10 words: 1896 flesch: 52 summary: Because of the huge size of scientific data, it’s good practice to share not only the data but also the metadata (data about data). It can be used also for scientific data which is stored in the web network. keywords: data; infrastructure; metadata; persistent; pid; research; science; services; sharing cache: mpcs-152.pdf plain text: mpcs-152.txt item: #34 of 341 id: mpcs-153 author: Muradian, David H. title: Linear Orderings of Tridimensional Grids date: 2021-12-10 words: 2274 flesch: 86 summary: ⋯ < 𝑚𝑚�𝑋𝑋′�. Consider the following layout 𝜑𝜑′: 𝜑𝜑′�𝜑𝜑−1(𝑚𝑚𝑖𝑖)� = 𝑚𝑚 �𝑚𝑚 = 1, |𝑋𝑋′|���������. Definition: We say that a subgraph 𝐺𝐺′ is ordered minimally at 𝜑𝜑, if 𝜑𝜑′ is a minimal layout for 𝐺𝐺′. Consider the graph P2,m,n with the vertex set 𝛱𝛱2,𝑚𝑚,𝑛𝑛 = �𝑥𝑥𝑖𝑖,𝑗𝑗,𝑘𝑘/ 𝑚𝑚 = 1,2����; 𝑗𝑗 = 1, 𝑚𝑚������; 𝑘𝑘 = 1, 𝑚𝑚������ and the edge set U, where �𝑥𝑥𝑖𝑖,𝑗𝑗,𝑘𝑘, 𝑥𝑥𝑖𝑖′,𝑗𝑗′,𝑘𝑘′� ∈ 𝑈𝑈 if and only if |𝑚𝑚 − 𝑚𝑚 ′| + |𝑗𝑗 − 𝑗𝑗′| + |𝑘𝑘 − 𝑘𝑘′| 𝑚𝑚𝑚𝑚 − 𝜆𝜆0 2 > 0; Linear Orderings of Tridimensional Grids 90 δ𝜑𝜑 �𝛱𝛱2,1,1 2,𝜆𝜆0,𝜆𝜆0� = 2𝜆𝜆0 − 𝜆𝜆02 𝜆𝜆0 2 = 2 𝜆𝜆0 − 1 ≤ 0; δ𝜑𝜑�𝛱𝛱1,1,1 1,𝑚𝑚,𝑛𝑛\𝛱𝛱1,1,1 1,𝑚𝑚,1� = 𝑚𝑚(𝑚𝑚 − 1) − 𝑚𝑚 𝑚𝑚(𝑚𝑚 − 1) = 𝑚𝑚 − 2 𝑚𝑚 − 1 > 0; δ𝜑𝜑�𝛱𝛱2,1,1 2,𝑚𝑚,1� = 0. keywords: 𝑋𝑋′; 𝛱𝛱1,1,1 cache: mpcs-153.pdf plain text: mpcs-153.txt item: #35 of 341 id: mpcs-154 author: Hakobyan, Nairi P.; Vahradyan, Vachagan G. title: A Model of a High Level Chess Concept "Attack on a weak square" date: 2021-12-10 words: 3485 flesch: 76 summary: Firstly, consider “weak squares” from “squares under attack”. Furthermore, we are now implementing the already developed chess concepts (attack on the king, attack on weak field ...) into solver16 program, which allows us to insert problems of RGT class and relevant to them knowledge, also search for strategies based on that knowledge. keywords: attack; chess; concept; condition; cost; field; pawn; piece; pin; square; weakness cache: mpcs-154.pdf plain text: mpcs-154.txt item: #36 of 341 id: mpcs-155 author: Haroutunian, Evgueni A. ; Hakobyan, Parandzem M. title: On Neyman-Pearson Testing for Pair of Independent Objects date: 2021-12-10 words: 3841 flesch: 108 summary: Th e c o r r e s p o n d in g e r r o r p r o b a b ilit ie s a r e fo r m u la t e d a s a b o ve . e s e s t e s t in g p r o b le m fo r keywords: e s; e t; t h cache: mpcs-155.pdf plain text: mpcs-155.txt item: #37 of 341 id: mpcs-156 author: Berberyan, Levon S. title: Development of a Modular Tool for Regulating and Analyzing Activities in Chess date: 2021-12-10 words: 2862 flesch: 58 summary: Implementation was focused on tools abilities for working with chess engines. Tool contains components for running chess engines, communicating with them, representing chess pieces, chess boards, chess moves and chess games, also providing chess game logging. keywords: activities; api; board; chess; engine; game; module; session; software cache: mpcs-156.pdf plain text: mpcs-156.txt item: #38 of 341 id: mpcs-157 author: Nahapetyan, Hayk E. ; Poghosyan, Suren S. ; Poghosyan, Vahagn S. ; Shoukourian, Yuri H. title: The Parallel Simulation Method for d-dimensional Abelian Sandpile Automata date: 2021-12-10 words: 3217 flesch: 75 summary: ∈ V is connected with 2d vertices given by adjacency list Adj(v) In numerous works, in the absence of analytical relations for 117 118 The Parallel Simulation Method for d-dimensional Abelian Sandpile Automata various physical characterizers, different methods of statistical analysis have been applied for calculation or verification of hypothetical and analytical expressions for sandpile models. keywords: lattice; parallel; sandpile; star; vertex cache: mpcs-157.pdf plain text: mpcs-157.txt item: #39 of 341 id: mpcs-158 author: Hovnanyan, Vilyam H. title: Gossiping Properties of the Modified Knödel Graphs date: 2021-12-10 words: 7032 flesch: 110 summary: On t h e o t h e r h a n d , we h a ve t h a t SUBG0 is a t r e e r o o t e d a t e t h e r e is n o n e e d t o keywords: e n; e s; h e; o s; r e; r t; s s; t e; t h; t t cache: mpcs-158.pdf plain text: mpcs-158.txt item: #40 of 341 id: mpcs-159 author: Pahlevanyan , Narek S. ; Haroutunian, Mariam E. title: Results of Performance Analysis of Advanced Inftheo New Package for R date: 2021-12-10 words: 2719 flesch: 43 summary: Performance Analysis Results Here we provide performance analysis of Advanced Inftheo package functions and give general recommendations for setting optimal thread count for various N (count of input arguments) values. Technical solutions used inside Advanced Inftheo package for overcoming the existing limitations keywords: advanced; functions; gpu; information; inftheo; package; performance; results cache: mpcs-159.pdf plain text: mpcs-159.txt item: #41 of 341 id: mpcs-160 author: Yeghiazaryan, Eduard V. title: Asymptotic Estimates of the Number of Solutions of Systems of Equations with Partial Boolean Functions date: 2021-12-10 words: 4920 flesch: 109 summary: ic t e d , t h e n l2 = o ¡ 3 2 n ¢ is p e r fo r m e d , a n d , t h e r e fo r e , fo r a lm o s t a ll t h e s e t o keywords: e e; e n; h e; s e; t e; t h cache: mpcs-160.pdf plain text: mpcs-160.txt item: #42 of 341 id: mpcs-161 author: Nikoghosyan, Zhora G. title: On Some Versions of Conjectures of Bondy and Jung date: 2021-12-10 words: 6956 flesch: 108 summary: e t h e o r e m s o f B o n d a m e n t a l t h e o r e m s o n t h is s u b je c t d keywords: e n; e s; n t; o n; r e; t h cache: mpcs-161.pdf plain text: mpcs-161.txt item: #43 of 341 id: mpcs-162 author: Sivolenko, Eduard R. title: Determination of Received Unknown Signal Modulation Type Using Higher Order Statistics or Spectral Correlation Method date: 2021-12-10 words: 2158 flesch: 53 summary: Received signal modulation type automatic recognition plays an important role in various applications of signal analysis. Time domain and power spectrum of frequency modulated signal. keywords: amplitude; bispectrum; modulation; recognition; signal; type cache: mpcs-162.pdf plain text: mpcs-162.txt item: #44 of 341 id: mpcs-165 author: Haroutunian, Mariam E. ; Avetisyan, Varazdat K. title: Analysis of Experiments of a New Approach for Test Quality Evaluation date: 2021-12-10 words: 2644 flesch: 68 summary: 1. Introduction Test developers are basically concerned about the quality of test items and how examinees respond to it when constructing tests. A good test model might specify the precise relationships among test items and ability scores, so that careful design work can be done to produce desired test score distribution and errors of the size that can be allowed. keywords: irt; items; test; values; 𝑋𝑋𝑖𝑖; 𝑋𝑋𝑗𝑗 cache: mpcs-165.pdf plain text: mpcs-165.txt item: #45 of 341 id: mpcs-166 author: Astsatryan, Hrachya V.; Gichunts, Edita E. title: Performances of Methods for Solving a Linear System of Equations in the Architecture of GPU Accelerator date: 2021-12-10 words: 3075 flesch: 59 summary: System matrix factorization, 2. System solution through factorization. keywords: equations; factorization; gpu; linear; matrix; pivoting; solution; system cache: mpcs-166.pdf plain text: mpcs-166.txt item: #46 of 341 id: mpcs-167 author: Asatryan , Davit. G. ; Hakobyan, Gurgen H. title: Method for Analysis and Classification of Pavement Based on Quality date: 2021-12-10 words: 1931 flesch: 52 summary: D. Asatryan, G. Hakobyan 57 References [1] M. Mustaffar, T. C. Ling and O. C. Puan, “Automated pavement imaging program (APIP) for pavement cracks classification and quantification - a photogrammetric approach”, The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. As stated above, suitable description of pavement images may be the distribution of segment sizes, which may be counted with the method described in [4]. keywords: analysis; classes; classification; cracks; images; measure; method; pavement; quality; samples cache: mpcs-167.pdf plain text: mpcs-167.txt item: #47 of 341 id: mpcs-168 author: Danoyan, Davit H. title: Secure Multiparty Computations for Collaboration between Competing Service Providers date: 2021-12-10 words: 3691 flesch: 58 summary: Abstract We introduce a platform for secure computations and describe the platform workflow. 2.3 Optimizations White-Box Oblivious Transfer Oblivious transfer is an essential cryptographic primitive heavily used in secure computations. keywords: circuit; computations; multiparty; parties; protocol; shares; 𝐴𝐴𝐴𝐴𝐴𝐴; 𝑋𝑋𝑋𝑋𝑋𝑋 cache: mpcs-168.pdf plain text: mpcs-168.txt item: #48 of 341 id: mpcs-169 author: Manukian, Seda N. title: On Transitive Closures of Two-dimensional Strongly Positive Arithmetical Sets date: 2021-12-10 words: 5453 flesch: 77 summary: Let us recall that an 𝑚𝑚-dimensional arithmetical set, where 𝑚𝑚 ≥ 1, is said to be strongly positive if it is defined by an arithmetical formula 𝐹𝐹 which is constructed by logical operators & and ∨ from subformulas having the forms (𝑥𝑥 = 𝑎𝑎) (where 𝑎𝑎 is a constant, 𝑎𝑎 ∈ 𝑁𝑁), 𝑥𝑥 = 𝑦𝑦, 𝑦𝑦 = 𝑆𝑆(𝑥𝑥), ¬(𝑥𝑥 = 0), where 𝑥𝑥 and 𝑦𝑦 are variables. 𝐹𝐹𝑚𝑚, where any 𝐹𝐹𝑖𝑖 is the conjuction of subformulas having the following forms: 𝑥𝑥 = 𝑎𝑎, 𝑦𝑦 = 𝑏𝑏, (where 𝑎𝑎 and 𝑏𝑏 are constants, 𝑎𝑎 ∈ 𝑁𝑁, 𝑏𝑏 ∈ 𝑁𝑁), 𝑥𝑥 = 𝑦𝑦, 𝑦𝑦 = 𝑆𝑆(𝑥𝑥), 𝑥𝑥 = 𝑆𝑆(𝑦𝑦), ¬(𝑥𝑥 keywords: case cache: mpcs-169.pdf plain text: mpcs-169.txt item: #49 of 341 id: mpcs-170 author: Khachatryan, Gurgen H. ; Hovsepyan, Mihran M. ; Jivanyan, Aram H. title: Two-Party Regular Expression Matching Protocol without Asymmetric Cryptography Operations date: 2021-12-10 words: 5024 flesch: 71 summary: Create garbled DFA matrix 𝐺𝐺𝑀𝑀Γ by permuting each row of the 𝑀𝑀Γ matrix, then encrypting each cell of the matrix using one time pad. For each OT query token create an OT response token for the corresponding key [2] and send them together with the garbled DFA matrix 𝐺𝐺𝑀𝑀Γ to the Server. e) Server: From OT response tokens invoke the keys for positions of the string 𝑋𝑋, then compute Γ(𝑋𝑋) using those keys and 𝐺𝐺𝑀𝑀Γ garbled DFA matrix. keywords: dfa; matrix; protocol; |𝑄𝑄|; 𝑃𝑃𝑃𝑃𝑃𝑃[1 cache: mpcs-170.pdf plain text: mpcs-170.txt item: #50 of 341 id: mpcs-171 author: Sokhakyan, Tigran V. title: Optimization Techniques for Generic Secure Two-party Computation Platform date: 2021-12-10 words: 3093 flesch: 52 summary: During the construction and the evaluation of garbled circuit encryption function fixed by underlying garbling scheme is used extensively. Background In subsequent sections we briefly introduce the main cryptographic tools we have used in our framework: garbled circuits, white-box cryptography based oblivious transfer (OT) protocol and optimization techniques for Yao’s protocol. keywords: circuit; computation; cryptography; framework; function; implementation; input; party; protocol; yao cache: mpcs-171.pdf plain text: mpcs-171.txt item: #51 of 341 id: mpcs-172 author: Keyan, Arthur J. title: Discretization of Geometric Models date: 2021-12-10 words: 1896 flesch: 66 summary: Abstract We are interested in 2D cutting and packing problem with irregularly shaped objects. This is not the full list of papers on cutting and packing problem, but these papers indicate the amount of work and research performed in this field and emphasize the importance of the considered problem. keywords: area; bin; discretization; packing; problem; rectangle cache: mpcs-172.pdf plain text: mpcs-172.txt item: #52 of 341 id: mpcs-174 author: Kyureghyan, Melsik K.; Kyuregyan, Knarik M. title: Linear Cryptanalysis of Modified SAFER + Algorithm date: 2021-12-10 words: 8520 flesch: 73 summary: When 𝑆 (1), 𝑆(2), … , 𝑆(𝜌)are linked, then their modulo-two sum is also I/O sum, namely 𝑆(1…𝜌) ∶= ⨁ 𝑆(𝑖) 𝜌 𝑖=1 = 𝑓1(𝑌 (1)) Theorem 1.1: (Threefold sum imbalance and I/O sum average-key imbalance) Let 𝑇(1…𝜌) = 𝑆(1…𝜌) ⊕ ℎ𝑖 (𝐾 (1…𝜌)) be a threefold sum. keywords: function; n n; pht; round cache: mpcs-174.pdf plain text: mpcs-174.txt item: #53 of 341 id: mpcs-175 author: Harutyunyan , Arman H. ; Gharagyozyan , Sona H. title: Symbiosis of Email and SMS date: 2021-12-10 words: 1882 flesch: 45 summary: Such systems for mobile phones (designed mainly for typing SMS) have been known since 1999 with the development and encapsulation of the T9 system in mobile phone software and similar functions of iTAP and eZi systems [6,7,8]. These circumstances determine the feasibility of studies and the development of new solutions providing information on mobile devices of a similar class, the development of adaptive interactive comfort systems graphical interaction of mobile phone users with communication and information resources of mobile and IP networks (it is evident that this interaction is provided by GSM / IP servers). keywords: email; mobile; sms; system; typing; user cache: mpcs-175.pdf plain text: mpcs-175.txt item: #54 of 341 id: mpcs-176 author: Kyuregyan, Knarik M. title: Linear Cryptanalysis of SAFER-256 date: 2021-12-10 words: 18918 flesch: -40 summary: Computing all these I/O sums for EXP, establishes the following. Remark 1: 𝐼𝐼�𝑆𝑆01,01𝐸𝐸𝐸𝐸𝐸𝐸 � = 𝐼𝐼�𝑆𝑆02,01𝐸𝐸𝐸𝐸𝐸𝐸 � = 𝐼𝐼�𝑆𝑆03,01𝐸𝐸𝐸𝐸𝐸𝐸 � = 0. Linear Cryptanalysis of SAFER-256 132 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 𝑌𝑌9 7 6 5 4 3 2 1 0 𝑌𝑌1 0 7 6 5 4 3 2 1 0 𝑌𝑌1 1 7 6 5 4 3 2 1 0 𝑌𝑌1 2 7 6 5 4 3 2 1 0 𝑌𝑌1 3 0 𝑌𝑌1 4 0 𝑌𝑌1 5 0 𝑌𝑌1 6 0 K. Kyuregyan 133 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 n n n n n n 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n n n n n 0 0 1 n n n n 0 0 0 1 n n n 0 0 0 0 1 n n 0 0 0 0 0 1 n 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 𝑌𝑌1 7 7 6 5 4 3 2 1 0 𝑌𝑌1 8 7 6 5 4 3 2 1 0 𝑌𝑌1 9 7 6 5 4 3 2 1 0 𝑌𝑌2 0 7 6 5 4 3 2 1 0 𝑌𝑌2 1 0 𝑌𝑌2 2 0 𝑌𝑌2 3 0 𝑌𝑌2 4 0 keywords: n n; 𝑌𝑌1; 𝑌𝑌2 cache: mpcs-176.pdf plain text: mpcs-176.txt item: #55 of 341 id: mpcs-177 author: Poghosyan, Aghasi S. ,; Sarukhanyan, Hakob G. title: Image Visual Similarity Based on High Level Features of Convolutional Neural Networks date: 2021-12-10 words: 1927 flesch: 74 summary: First we have evaluated results per distance metric and averaged them across image categories: Tables 1, 2. Fe i-Fe i, Im a g e N e t : A L a r g e -S c a le H ie r a r c keywords: image cache: mpcs-177.pdf plain text: mpcs-177.txt item: #56 of 341 id: mpcs-178 author: Haroutunian, Mariam E. ; Avetisyan, Varazdat K. title: New Approach for Test Quality Evaluation Based on Shannon Information Measures date: 2021-12-10 words: 5065 flesch: 66 summary: It consists of the following main steps: (a) establishing the purpose of a test, (b) defining the construct of interest, (c) drafting test items, (d) conducting a pilot test, and (e) analyzing the item response data [9]. Item analysis is a procedure for quantifying various characteristics of test items. keywords: ability; difficulty; information; item; model; parameter; probability; response; test cache: mpcs-178.pdf plain text: mpcs-178.txt item: #57 of 341 id: mpcs-179 author: Gevorkyan, Ashot S. ; Sahakyan, Vahe V. title: Computation Statistical Properties of Disordered Spin Systems from the First Principles of Classical Mechanics date: 2021-12-10 words: 5098 flesch: 63 summary: Introduction A wide class of phenomena in physics, chemistry, material science, biology, nanoscience, neu- ral network, evolution, organization dynamics, hard-optimization, environmental and social structures, human logic systems, financial mathematics etc., are well described mathemati- cally by models of spin glasses [1]–[10]. Despite of numerous studies there are still a number of topical issues in the field of spin glasses and disordered systems as a whole, the solution of which is extremely important and useful in terms of developing modern technology. keywords: ensemble; j5,6; j6,7; j7,8; problem; spin cache: mpcs-179.pdf plain text: mpcs-179.txt item: #58 of 341 id: mpcs-180 author: Aslanyan, Levon H. ; Ryazanov, Vladimir V. ; Sahakyan, Hasmik A. title: Testor and Logic Separation in Pattern Recognition date: 2021-12-10 words: 3714 flesch: 60 summary: [26] L. A. Aslanyan, L. F. Mingo, J. B. Castellanos, F. B. Chelnokov, A. A. Dokukin and V. V. Ryazanov, “On logical correction of neural network algorithms for pattern recognition”, International Journal Information Theories & Applications, vol. 14, pp. 203-205, 2007. I. Zhuravlev, V. V. Ryazanov and O. V. Sen’ko, Recognition. keywords: classification; features; learning; logic; pattern; recognition; separation; set; testor; vol; zhuravlev cache: mpcs-180.pdf plain text: mpcs-180.txt item: #59 of 341 id: mpcs-181 author: Gevorgyan , Aram V. ; Sarukhanyan, Hakob G. title: 3D Scanner from Two Web Cameras date: 2021-12-10 words: 2499 flesch: 65 summary: Then we filter out our object from the scene and then merge object point clouds from different views to get a full 3D model. In other words, registration transforms multiple 3D point clouds into the same coordinate system so as to align overlapping components of these sets. keywords: cameras; cloud; depth; disparity; image; map; object; point; stereo cache: mpcs-181.pdf plain text: mpcs-181.txt item: #60 of 341 id: mpcs-182 author: Asatryan, David G. title: Structure-Based Technique for Object Detecting in UAV Imagery date: 2021-12-10 words: 3077 flesch: 61 summary: a- video frame with hidden object, b – image part without anomaly, c – binarized map of proximity measure, d – the part of whole image with minimal values of proximity measure. Two Approaches to Analyzing the Structure of an Image In this paper, we follow the statement that image structure which is perceived by HVS is basically identified via mutual dislocations of available segments and edges. keywords: detection; fig; image; map; object; problem; properties; segmentation; structure; uav cache: mpcs-182.pdf plain text: mpcs-182.txt item: #61 of 341 id: mpcs-183 author: Hakobyan, Gurgen H. title: Video-Based Automated System for Pavement Surface Quality Monitoring date: 2021-12-10 words: 2668 flesch: 57 summary: Usually, cracks and potholes in pavement images are characterized by dark intensity values, which are also noticeable from histograms. As it is visible on histograms (c, d), pavement images contain only one mode, which makes it almost impossible to separate cracks from background using the known threshold selection methods (such as Otsu method [8]). keywords: binarization; crack; detection; image; monitoring; pavement; processing; quality; segments; video cache: mpcs-183.pdf plain text: mpcs-183.txt item: #62 of 341 id: mpcs-184 author: Gevorgyan , Vahan V. ; Karapetyan, Gevorg A. ; Sarukhanyan, Hakob G. title: Modification of Exemplar-Based Inpainting Algorithm for Mobile Devices With of Patch Offsets date: 2021-12-10 words: 3330 flesch: 66 summary: a) the original image , b) inpainted image, c) result of Criminisi’s algorithm, d) our result (a) (b) (c) (d) Fig. 4. a) the original image , b) inpainted image, c) result of Criminisi’s algorithm, d) our result V. Gevorgyan, G. Karapetyan and H. Sarukhanyan 73 (a) (b) (c) (d) Fig. keywords: algorithm; approach; devices; exemplar; image; inpainting; patch; pixels; region; size; target cache: mpcs-184.pdf plain text: mpcs-184.txt item: #63 of 341 id: mpcs-186 author: Zakaryan, Manuk K. title: Video Shot Detection Method Based on Histogram Comparison Procedure date: 2021-12-10 words: 2017 flesch: 61 summary: In this paper we provide a comparative analysis of histogram and certain structural properties based methods for video cut detection problems.  Color distribution method - mostly used method is color histogram comparison. keywords: color; comparison; detection; histogram; image; method; results; video cache: mpcs-186.pdf plain text: mpcs-186.txt item: #64 of 341 id: mpcs-187 author: Derdzyan, Hasmik S. title: Combined Digital Methods for Solving Optimal Resource Allocation Problems date: 2021-12-10 words: 3498 flesch: 68 summary: By the analogy of thermodynamic systems, the simulated annealing method does not permanently move towards the reduction of objective function values during the minimization process. For the mentioned points the following condition is checked by order: if on the new point the value of the function 𝑓𝑓(𝒙𝒙�) is lower, than on 𝒙𝒙�𝒏𝒏+𝟏𝟏 point, replace vertex 𝒙𝒙�𝒏𝒏+𝟏𝟏 of the simplex with that point, go back to the step 2. keywords: function; method; point; simplex; step; value cache: mpcs-187.pdf plain text: mpcs-187.txt item: #65 of 341 id: mpcs-188 author: Astsatryan, Hrachya V. ; Gichunts, Edita E. title: Performance Comparisons of Eigensolutions Algorithms of a Symmetric Tridiagonal Matrix on GPU Accelerators date: 2021-12-10 words: 3228 flesch: 60 summary: On Tesla K40 GPU accelerator in case of 31744*31744 maximum input-dimensional complex matrix, the DC algorithm is carried out atgpu_time = 603sec., and in case of MRRR algorithm at gpu_time = 1680sec. . On Tesla K40 GPU accelerator in case of 21504*21504 maximum input- dimensional complex matrices, the DC algorithm is carried out at gpu_time = 603sec., and in case of MRRR algorithm at gpu_time = 1005sec.. Figures 7 and 8 show in a generalized form case the comparisons of GPU accelerators of time-dependent DC and MRRR algorithms with equal amounts of input matrices. keywords: algorithm; c1060; case; gpu; k40; matrices; matrix; mrrr; tesla cache: mpcs-188.pdf plain text: mpcs-188.txt item: #66 of 341 id: mpcs-189 author: Jivanyan , Aram H. ; Hovsepyan , Mihran M. title: Implementation Aspects of Search Functionality Over Encrypted Cloud Data date: 2021-12-10 words: 3041 flesch: 68 summary: File encryption works as follows: A. Jivanyan and M. Hovsepyan 103 Again the main drawback of nCryptedCloud is the fact that it can learn the secret keys and/or passwords used for file encryption. keywords: access; cloud; data; encryption; file; functionality; key; keys; search; skycryptor; user cache: mpcs-189.pdf plain text: mpcs-189.txt item: #67 of 341 id: mpcs-19 author: Ghulghazaryan, Ruben G.; Piliposyan, Davit G.; Shoyan, Misak T.; Nersisyan, Hayk V. title: Application of Machine Learning-Based Electrochemical Deposition Models to CMP Modeling date: 2021-12-10 words: 3276 flesch: 54 summary: In this paper, several machine learning approaches are used to model surface profiles after ECD that are used as input to CMP models. 7. XGBoost Method for Modeling ECD Surface Profiles Finally, algorithms of the XGBoost library [9] were used for ECD surface profile modeling. keywords: cmp; data; deposition; ecd; fig; input; model; modeling; process; profile; surface; xgboost cache: mpcs-19.pdf plain text: mpcs-19.txt item: #68 of 341 id: mpcs-190 author: Kyuregyan, Knarik M. title: On Optimality of Regular SAFER+ and Modified SAFER+ Diffusion date: 2021-12-10 words: 2708 flesch: 61 summary: [5] J. L. Massey, “On the optimum of SAFER+ diffusion”, The second AES candidate conference, March 22-23, Rome, Italy, 1999. There are another byte permutations equivalent to SAFER+ specific Armenian shuffle in the sense that they provide the same security level against differential cryptanalysis and don't reduce cipher processing speed. keywords: byte; pht; safer+;  ;   cache: mpcs-190.pdf plain text: mpcs-190.txt item: #69 of 341 id: mpcs-191 author: Grigoryan, Sedrak V. ; Berberyan, Levon S. title: Developing Interactive Personalized Tutors in Chess date: 2021-12-10 words: 6712 flesch: 54 summary: As an example node of chess concept king has the following regularities in it: 1) it is a figure, so king has a connection to figure concept (it is a “be” type of language derived connection), it has X, Y coordinates and figure color just like figure general concept, certain figure type concept value which identifies that this is a king (those are “have” type language derived connections) and king move definitions (those are “do” type connections). The software is interactive making level by level tutoring of chess concepts, their testing, also feedback provision and correction by detailed description. keywords: attack; chess; concept; explanation; game; goal; king; knowledge; learning; rook; software; solver; student; tool; tutoring cache: mpcs-191.pdf plain text: mpcs-191.txt item: #70 of 341 id: mpcs-192 author: Kyuregyan, Knarik M. title: On Optimality of SAFER-256 Diffusion date: 2021-12-10 words: 1969 flesch: 63 summary: Moreover, there are changes of an input bytes that will cause only this minimum number of output bytes to change, namely a change by 128 in any odd-numbered symbol position. Keywords: Diffusion, Shuffle, Byte Permutation, Differential cryptanalysis. keywords: bytes; cryptanalysis; output; safer-256 cache: mpcs-192.pdf plain text: mpcs-192.txt item: #71 of 341 id: mpcs-193 author: Akopov, Norayr Z. ; Martirosyan, Narek H. title: The Optimal Approach for Kolmogorov-Smirnov Test Calculation in High Dimensional Space date: 2021-12-10 words: 2040 flesch: 63 summary: The Optimal Approach for Kolmogorov-Smirnov Test Calculation in High Dimensional Space 140 In 1D case there exists the theoretical distribution function for the value of 𝐾𝐾𝑁𝑁 = √𝑁𝑁 𝐷𝐷𝑁𝑁 (also the mean value and dispersion for 𝐾𝐾𝑁𝑁), which is used to make a decision to accept or reject the hypothesis concerning the uniform distribution of the tested sample of random numbers. 𝑝𝑝1 − < 𝐾𝐾𝑁𝑁(𝑛𝑛 = 10) >, seems to be very interesting and effective in order to realize the procedure of the < 𝐾𝐾𝑁𝑁 > estimation in case of high dimensional space. keywords: case; number; test; 𝐷𝐷𝑁𝑁; 𝐾𝐾𝑁𝑁 cache: mpcs-193.pdf plain text: mpcs-193.txt item: #72 of 341 id: mpcs-194 author: Khachikyan, Tigran Z. ; Narimanyan, Sahak M. title: Application of Multivariate Statistical Analysis in Process Control date: 2021-12-10 words: 2058 flesch: 60 summary: For this, we take historical data of fixed sample size n before time t , and shifting time t forward, while keeping the sample size unchanged. An automatic alert messaging to system administrators can be organized to take measures. keywords: matrix; statistics; system cache: mpcs-194.pdf plain text: mpcs-194.txt item: #73 of 341 id: mpcs-195 author: Keyan, Arthur J. title: Modeling of Irregularly Shaped Two – Dimensional Objects date: 2021-12-10 words: 1563 flesch: 70 summary: Making Complex Shapes from Simple Ones Of course, the contur tool can be used for creating irregular shapes but in the more presice way it can be made from simple shapes. Modeling of Simple Geometrical Shapes In our program there are corresponding tools for creating simple shapes, the main shapes supported by the soft are: 1. keywords: coordinates; fig; modeling; objects; point; shapes cache: mpcs-195.pdf plain text: mpcs-195.txt item: #74 of 341 id: mpcs-20 author: Abrahamyan, Sergey E.; Zakaryan, Arman G. title: A Solution for Preventing the Rogue Certificate Attack date: 2021-12-10 words: 2945 flesch: 58 summary: Related Work Various attempts have been made to overcome forged certificate attacks. HTTP Public Key Pinning [1] is one such technique, which protects users from forged certificate attacks to some extent. keywords: attack; certificate; key; rogue; security; server; service; solution; user; web cache: mpcs-20.pdf plain text: mpcs-20.txt item: #75 of 341 id: mpcs-203 author: Darbinyan, Samvel Kh. title: On pre-Hamiltonian Cycles in Hamiltonian Digraphs date: 2021-12-10 words: 27763 flesch: 111 summary: [1 4 ]) we p r o ve t h e fo l- lo win g t h e o r e m : T heor em 1.10: Any strongly connected digraph D on n ¸ k + 2 : On t h e o t h e r h a n d , b y L e m m a 3 .3 a n d ( 1 ) we h a ve t h a t d¡ keywords: c e; e d; e e; e n; e s; e t; h e; n d; n s; n t; o n; o t; r e; r t; s s; s t; t d; t h; t t cache: mpcs-203.pdf plain text: mpcs-203.txt item: #76 of 341 id: mpcs-204 author: Nikoghosyan, Zhora G. title: On k-E nded Spanning and Dominating Trees date: 2021-12-10 words: 6653 flesch: 109 summary: o -k-e n d e d if G h a s n o s p a n n in g k-e n d e d t r e e , b u t fo r a n y v 2 V ( G) , G ¡v h a s a s p a n n in g k-e n d e d t r e e . A H a m ilt o n c yc le c a n b e in t e r p r e t e d a s a s p a n n in g 1 -e n d e d t r e e . keywords: e e; e n; e s; e t; h e; n d; n n; n t; o n; r e; t h; t r cache: mpcs-204.pdf plain text: mpcs-204.txt item: #77 of 341 id: mpcs-205 author: Manukian, Seda N. title: On Strongly Positive Multidimensional Arithmetical Sets date: 2021-12-10 words: 5794 flesch: 67 summary: Some subclass of the class of positive sets, namely, the class of strongly positive sets, is considered. The whole process of working of the given Ω - algorithm is described by the sequence of states ),( 11 wα , ),( 22 wα ,…, ),( kk wα ,…,(where S. Manukian 35 11 =α ) obtained during the working of this Ω -algorithm. keywords: + +; -algorithm; -operator; state cache: mpcs-205.pdf plain text: mpcs-205.txt item: #78 of 341 id: mpcs-206 author: Khachatryan, Mikayel H. title: On Generalized Primitive Recursive String Functions date: 2021-12-10 words: 1557 flesch: 62 summary: 42 On Generalized Primitive Recursive String Functions 1 Mikayel H. Khachatryan Institute for Informatics and Automation Problems of NAS RA e-mail: mikayel.khachatur@gmail.com Abstract The notion of generalized primitive recursive string function is introduced and relations between such functions and primitive recursive string functions in the usual sense ([1], [2]) are investigated. Namely, the definition of generalized primitive recursive string function is obtained from the definition of primitive recursive string function in the usual sense by adding the everywhere undefined one- dimensional string function to the set of basic functions. keywords: function; sense; string cache: mpcs-206.pdf plain text: mpcs-206.txt item: #79 of 341 id: mpcs-207 author: Khasikyan, Hovik G. title: A Modified Fuzzy Vault Scheme for Increased Accuracy date: 2021-12-10 words: 1720 flesch: 73 summary: Order invariance is a very important property, because not always we can obtain biometric data of a user in the same order. It was shown that during the vault construction the concatenation of biometric data affects the accuracy of the system. keywords: biometric; data; scheme; vault cache: mpcs-207.pdf plain text: mpcs-207.txt item: #80 of 341 id: mpcs-208 author: Alaverdyan, Souren B. title: Reconstruction of Distorted Images date: 2021-12-10 words: 1239 flesch: 64 summary: (3) Since 𝑓𝑓(𝑥𝑥, 𝑦𝑦) is a function of image describing the range of vision, and 𝑔𝑔(𝑥𝑥, 𝑦𝑦) is a function of registered image, we can see that ℎ(𝑥𝑥, 𝑦𝑦) is a noise describing function. Image reconstruction Let 𝑔𝑔(𝑥𝑥, 𝑦𝑦) be the given image and 𝑓𝑓(𝑥𝑥, 𝑦𝑦) be the reconstructing image. keywords: image cache: mpcs-208.pdf plain text: mpcs-208.txt item: #81 of 341 id: mpcs-209 author: Khachatryan, Hamlet K. title: Encoding and Decoding Procedures for Z5 Double ±1 Error Correcting Linear Code over date: 2021-12-10 words: 1833 flesch: 74 summary: Error correcting codes, Codes over the ring 𝑍𝑍5, Encoding and Decoding procedures. Implementation of codes over large alphabets is much more difficult compared with small alphabets. keywords: code; encoding; vector; 𝑍𝑍5 cache: mpcs-209.pdf plain text: mpcs-209.txt item: #82 of 341 id: mpcs-210 author: Grigoryan, Sedrak H. title: Structuring of Goals and Plans for Personalized Planning and Integrated Testing of Plans date: 2021-12-10 words: 5674 flesch: 66 summary: An algorithm needs to be developed to search for strategies using defined plans and goals. The algorithm needs to be generic and allow constructing strategies for any of defined plans. keywords: chess; goal; king; knowledge; list; moves; plans; problems; rook; situation cache: mpcs-210.pdf plain text: mpcs-210.txt item: #83 of 341 id: mpcs-211 author: Sargsyan, Vahe G. title: Zero-Free Sets in Abelian Groups date: 2021-12-10 words: 11847 flesch: 108 summary: L e t L b e a n in t e g e r a n d d 2 G; wh e r e in ord ( d) ¸ L; wh e r e ord( d) is t h e o r d e r o In p a r t ic u la r , t h e fo llo win g t wo t h e o r e m s keywords: e e; e m; e n; e t; h e; n o; n t; o t; r e; s e; t h; t r; t s; t t cache: mpcs-211.pdf plain text: mpcs-211.txt item: #84 of 341 id: mpcs-212 author: Haroutunian , Mariam E. ; Pahlevanyan, Narek S. title: Information Theoretical Analysis of Biometric Generated Secret Key Sharing Model date: 2021-12-10 words: 11845 flesch: 109 summary: h e fo llo win g t h e o r e m . t h e p la c e wh e r e a n a c keywords: e c; e e; e n; e t; h e; m e; n t; r e; s e; s s; s t; t h; t o; t r; t t cache: mpcs-212.pdf plain text: mpcs-212.txt item: #85 of 341 id: mpcs-213 author: Petrosyan, Petros A. ; Khachatryan, Nerses A. title: Interval Total Colorings of Complete Multipartite Graphs and Hypercubes date: 2021-12-10 words: 15180 flesch: 109 summary: On t h e o t h e r h a n d , s in c e jY j = 2 n, we h a ve 2 n ¸ ( l + 2 ) ( n ¡ l ) , wh ic h c o n t r a On t h e o t h e r h a n d , b y Th e o r e m 2 , w¿ ( Kn;n¢l ) ¸ Â00 ( Kn;n¢l ) = n ¢ l + 1 fo r l ¸ 2 a n d h e n c e , w¿ ( Kn;n¢l ) =  00 keywords: e n; e r; e s; n o; o r; o t; r t; t e; t h cache: mpcs-213.pdf plain text: mpcs-213.txt item: #86 of 341 id: mpcs-214 author: Hovnanyan, Vilyam H. ; Poghosyan, Suren S. ; Poghosyan, Vahagn S. title: Fault-tolerant Gossip Graphs Based on Wheel Graphs date: 2021-12-10 words: 9209 flesch: 109 summary: e n t e d h e r e in o r d e r t o a vo id a n a r t i¯ c ia l e o r e m keywords: e d; e e; e n; e s; h e; n s; n t; o s; r e; r t; s s; s t; t e; t h cache: mpcs-214.pdf plain text: mpcs-214.txt item: #87 of 341 id: mpcs-215 author: Sargsyan, Sevak S. ; Kurmangaleev, Shamil F. ; Baloian, Artiom V. ; Aslanyan, Hayk K. title: Scalable and Accurate Clones Detection Based on Metrics for Dependence Graph date: 2021-12-10 words: 7329 flesch: 100 summary: f c lo n e s a r e d e t e c t e d h e d e c r e keywords: c t; e c; e d; e n; e s; e t; h e; m e; n t; r e; r o; s t; t h; t r; t t cache: mpcs-215.pdf plain text: mpcs-215.txt item: #88 of 341 id: mpcs-216 author: Haroutunian, Evgueni A. ; Safaryan, Irina A. ; Nazaryan, Aram R. ; Harutyunyan, Narine S. title: Detection of Heterogeneity in Three-Dimensional Data Sequences: Algorithm and Applications date: 2021-12-10 words: 11503 flesch: 108 summary: e o t h e r . e t h e o r y o keywords: c e; d e; e e; e n; e t; h e; n s; n t; o n; r e; s e; s t; t h; t r; t t cache: mpcs-216.pdf plain text: mpcs-216.txt item: #89 of 341 id: mpcs-218 author: Petrosyan, Arthur S. ; Petrosyan, Gurgen S. title: Research and Deployment of Improved Web Server Protection Methods date: 2021-12-10 words: 1608 flesch: 60 summary: This article describes the research work done in Academic Scientific Research Computer Network of Armenia (ASNET-AM) managed by the Institute for Informatics and Automation Problems (IIAP) of the National Academy of Sciences of the Republic of Armenia (NAS RA), targeted to the research and deployment of the improved methods for Web server protection. But to obtain the best solution for Web server protection in shared hosting environment it would be important to have additional protection on the filesystem permissions level. keywords: apache; hosting; open_basedir; php; protection; server; web cache: mpcs-218.pdf plain text: mpcs-218.txt item: #90 of 341 id: mpcs-219 author: Chidemyan, Sergey S. ; Jivanyan, Aram H. ; Khachatryan, Gurgen H. title: Palm Vein Minutiae Feature Extraction for Human Identification date: 2021-12-10 words: 3760 flesch: 58 summary: In this paper an approach of image enhancement, vein pattern extraction and features extraction is presented. Fig.3 shows the extracted ROI image after median, wiener and anisotropic diffusion filter and after image enhancement with histogram equalization. keywords: diffusion; enhancement; extraction; feature; fig; filter; image; minutiae; palm; pattern; points; roi; vein cache: mpcs-219.pdf plain text: mpcs-219.txt item: #91 of 341 id: mpcs-220 author: Khachatrian, Gurgen H. ; Kyureghyan, Melsik K. ; Kyuregyan, Knarik M. title: Design and Cryptanalysis of a New Encryption Algorithm SAFER-256 date: 2021-12-10 words: 2940 flesch: 65 summary: Keywords: Cipher, Round, Shuffling, Encryption, Decryption, Differential cryptanalysis, Effective weight. 4. Implementation aspects Differential analysis has shown that new encryption algorithm SAFER-256 based on the structure of SAFER+ is secure after only 7 rounds. keywords: bit; block; bytes; encryption; round; safer-256 cache: mpcs-220.pdf plain text: mpcs-220.txt item: #92 of 341 id: mpcs-221 author: Petrosyan, Arthur S. ; Prohkorenko, Eugene B. title: Methods of Limiting the Domain Name Service Traffic Against Distributed Denial of Service Attacks date: 2021-12-10 words: 2028 flesch: 47 summary: Since DNS is a core network service, the protection of DNS servers is vital for the whole network infrastructure. In view of the different forms of DDoS attacks on DNS servers (like the DNS Amplification Attack), the implementation of effective preventive methods becomes very important. keywords: amplification; attacks; ddos; denial; dns; domain; servers; service; traffic cache: mpcs-221.pdf plain text: mpcs-221.txt item: #93 of 341 id: mpcs-222 author: Hakobyan, Sonik R. title: Fast Slant-Hadamard Transform Algorithm date: 2021-12-10 words: 3004 flesch: 82 summary: − − −− −    − − − − − − − − 3. Example 2.1: Below we present the Slant-Hadamard transform matrices of order 4 and 8 obtained from (1) and (2) 1 1 1 1 1 1 1 1 7 5 3 1 1 3 5 7 1 1 1 1 1 / 21 3 1 1 3 3 1 1 3 3 31 1 1 / 5 7 1 9 17 17 9 1 71 15 5 5 5 1 / 105(2) , (3) 1 1 1 1 1 1 1 1 1 1 1 14 8 3 31 1 1 1 1 1 1 1 1 1 1 / 5 5 5 5 5 1 3 3 1 1 3 3 1 1 / 5 1 3 3 1 1 3 3 1 S S ⋅ ⋅ ⋅ ⋅ ⋅ − − − −   − − − −  − −  − − − −  = = − − − − − −    − keywords: hadamard; slant; transform cache: mpcs-222.pdf plain text: mpcs-222.txt item: #94 of 341 id: mpcs-223 author: Gichunts, Edita E. title: Benchmarking of GPU NVIDIA CUDA, CUBLAS and MAGMA Libraries Based on Matrix Multiplication Problem date: 2021-12-10 words: 1908 flesch: 63 summary: Benchmarking of GPU NVIDIA CUDA, CUBLAS and MAGMA Libraries 124 Transferred matrices should be placed in GPU memory completely, which leads to the restriction of the total size of the two matrices with 4 GB. Fig. 121 Benchmarking of GPU NVIDIA CUDA, CUBLAS and MAGMA Libraries Based on Matrix Multiplication Problem Edita E. Gichunts Institute for Informatics and Automation Problems of NAS RA e-mail: editagich@ipia.sci.am Abstract Solving linear systems of equations is a fundamental problem in scientific computing. keywords: cublas; cuda; data; gpu; libraries; magma; matrix; memory; nvidia cache: mpcs-223.pdf plain text: mpcs-223.txt item: #95 of 341 id: mpcs-225 author: Hovnanyan, Vilyam H. ; Poghosyan, Suren S. ; Poghosyan, Vahagn S. title: Method of Local Interchange for the Investigation of Gossip Problems: part 2 date: 2021-12-10 words: 9750 flesch: 110 summary: h e c o r r e s p o im e r e qu ir e d t o keywords: e n; e s; e t; h e; n s; o n; o s; r e; r t; s s; s t; t h cache: mpcs-225.pdf plain text: mpcs-225.txt item: #96 of 341 id: mpcs-226 author: Darbinyan, Samvel Kh. ; Karapetyan, Iskandar A . title: On Hamiltonian Bypasses in one Class of Hamiltonian Digraphs date: 2021-12-10 words: 20043 flesch: 108 summary: t h e r e a d e r is fa m ilia S in c e d¡ ( xi; fy; xi¡2g ) = 0 a n d d¡ ( xi ) ¸ 2 , t h e r e is a n xk 2 C[xi+1; xi¡3] s u keywords: c e; e d; e n; e t; h e; n d; n t; o n; o t; r e; r t; s e; s s; s t; t d; t h; t t cache: mpcs-226.pdf plain text: mpcs-226.txt item: #97 of 341 id: mpcs-227 author: Arakelyan, Vahe A. title: Secure Online Testing System for LMS Moodle date: 2021-12-10 words: 9065 flesch: 109 summary: In t r o d u c t io n Th e t h e o r e t ic a l s e c r e c y o f S h a n n o n s̀ m o d e l o f c ip h e s o f t h e c o r r e s p o keywords: e c; e n; e s; h e; n o; n t; r e; r t; s s; s t; t e; t h; t o; t t cache: mpcs-227.pdf plain text: mpcs-227.txt item: #98 of 341 id: mpcs-229 author: Margaryan, Tigran M. title: The Shannon Cipher System With Correlated Source Outputs and Wiretapper Guessing Subject to Distorion date: 2021-12-10 words: 9065 flesch: 109 summary: In t r o d u c t io n Th e t h e o r e t ic a l s e c r e c y o f S h a n n o n s̀ m o d e l o f c ip h e s o f t h e c o r r e s p o keywords: e c; e n; e s; h e; n o; n t; r e; r t; s s; s t; t e; t h; t o; t t cache: mpcs-229.pdf plain text: mpcs-229.txt item: #99 of 341 id: mpcs-23 author: Petrosyan, Arthur S.; Petrosyan , Gurgen S. title: Development of Management System for eduroam Database Updated Specification date: 2020-07-10 words: 1433 flesch: 56 summary: It is currently implemented in ASNET-AM for managing the Armenian part of eduroam database. The solution we presented is all-in-one for NROs functions regarding the management of eduroam database, as well as for presenting this data on the service location map. keywords: database; eduroam; management; nro; online; service; system cache: mpcs-23.pdf plain text: mpcs-23.txt item: #100 of 341 id: mpcs-230 author: Topchyan, Tigran R. title: Engineering Competence Frameworks and Topic Modelling date: 2021-12-10 words: 10137 flesch: 108 summary: fa c ilit a t e t h e r o b u s t a n a lys is in -o r d e r t o r e ve a l r e la t io n s h ip s in t h e s e r e s u lt s a n d r e s e a r c h keywords: c e; c t; e n; e s; e t; h e; n t; p e; r e; r t; s t; t h; t o; t t cache: mpcs-230.pdf plain text: mpcs-230.txt item: #101 of 341 id: mpcs-231 author: Haroutunian, Evgueni A. ; Hakobyan, Parandzem M. ; Yesayan, Aram O. title: On LAO Two-stage Testing of Multiple Hypotheses Concerning Markov Chain date: 2021-12-10 words: 11115 flesch: 106 summary: In t h e fo llo win g t h e o r e m s h e c o r r e s p o n d in g s t a t io n a r y p r o b a b ilit y d is t r ib u t io n ( P D ) keywords: e e; e n; e o; e s; e t; h e; n s; n t; o n; r e; s t; t h; t o; t r; t t cache: mpcs-231.pdf plain text: mpcs-231.txt item: #102 of 341 id: mpcs-233 author: Abrahamyan, Ashot A. title: Stackelberg Security Games for Information Security Management of Financial Systems date: 2021-12-10 words: 2931 flesch: 53 summary: Keywords: Stackelberg security games, Information security, Financial systems. Leader in case of information security is a security officer and the follower is a hacker. keywords: financial; follower; games; information; leader; security; stackelberg; strategy cache: mpcs-233.pdf plain text: mpcs-233.txt item: #103 of 341 id: mpcs-234 author: Topchyan, Vardan H. title: Pair Correlations Preserving Model in Synthetic Data Generation date: 2021-12-10 words: 3946 flesch: 48 summary: The condition 1 ≤ ≤ defines the critical аrеа of attribute values . Thus, our task is protection / concealment of confidential attributes critical values, that are determined based on the threshold conditions set C = , ,…, , with the condition of maintaining pairing correlations of attributes A based on system R= , ,…, . keywords: analysis; attributes; correlations; data; information; set; values cache: mpcs-234.pdf plain text: mpcs-234.txt item: #104 of 341 id: mpcs-235 author: Darbinyan, Vahram H. title: A Probabilistic Model of User Navigation in a Digital Interactive Publication date: 2021-12-10 words: 4024 flesch: 56 summary: The client software is provided with the necessary publication metadata from the server side: number of publication pages, type of the publication, weight factors. Abstract A probabilistic model of user navigation in a digital interactive publication is considered. keywords: behavior; links; model; navigation; number; page; publication; user cache: mpcs-235.pdf plain text: mpcs-235.txt item: #105 of 341 id: mpcs-238 author: Manukian, Seda N. title: On an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems date: 2021-12-10 words: 5180 flesch: 63 summary: It is easily seen that the transformation of formulas generated in the proof of Lemma 3.2 by the operations iji T,,,,  gives positive formula being applied to positive formulas. We say that formulas F and G (respectively terms t and s ) are equivalent in the framework of the corresponding deductive system if the formula )(&)( FGGF  (respectively, the formula st  ) is deducible in this system. keywords: formula; lemma; proof; set; sets cache: mpcs-238.pdf plain text: mpcs-238.txt item: #106 of 341 id: mpcs-239 author: Avetisyan, Aram A. ; Hakobyan, Levon R. title: An Automated System for Correction of Rules of Transformation from Universal Networking Language into Natural Language date: 2021-12-10 words: 3256 flesch: 61 summary: Keywords: UNL, Machine translations, Transformation rules, Grammar. The Problem Setting Transformations in the UNDL Platform system are implemented by consequently applying transformation rules on the UNL sentence. keywords: algorithm; graph; process; rules; sentence; step; transformation; unl cache: mpcs-239.pdf plain text: mpcs-239.txt item: #107 of 341 id: mpcs-24 author: Petrosyan, Arthur S.; Petrosyan, Gurgen S.; Tadevosyan, Robert N.; Arsalanian, Kevork Kh. title: Development of Multi-EAP Radius Configuration for eduroam Service date: 2021-12-10 words: 965 flesch: 45 summary: In addition, some NROs provide hosted radius solutions for connecting institutions, and in case of such relatively 63 mailto:arthur@sci.am mailto:gurgen@sci.am mailto:robert@sci.am Development of Multi-EAP Radius Configuration for eduroam Service 64 small ones it would be much more cost-effective for NRO to use a single RADIUS server for multiple supported realms instead of creating separate radius servers for each supported realm. 5. Conclusion This solution may be interesting in cases, where NROs implement hosted radius solutions for relatively small connecting institutions (with hundreds or tens of users) to have a cost-effective single RADIUS server for multiple supported realms instead of creating separate radius servers for each supported realm. keywords: eap; eduroam; radius; server; solution cache: mpcs-24.pdf plain text: mpcs-24.txt item: #108 of 341 id: mpcs-240 author: Bantikyan, Hovhannes M. title: Image Denoising Using Wavelet Transform and CUDA date: 2021-12-10 words: 2706 flesch: 66 summary: Wavelet Thresholding Consider an image of size N×N. Assume that it is corrupted by independent and identically distributed (i.i.d) zero mean, white Gaussian noise with standard deviation σ. The approach, in which each coefficient is compared with a threshold in order to decide whether it constitutes a desirable part of the original signal or not, is called wavelet thresholding. keywords: coefficients; cuda; dwt; filter; image; signal; transform; wavelet cache: mpcs-240.pdf plain text: mpcs-240.txt item: #109 of 341 id: mpcs-241 author: Hakobyan, Levon R. title: A Method of Constructing and Using the Tree of Possible Transformations from UNL to the Natural Language date: 2021-12-10 words: 1776 flesch: 61 summary: Keywords: UNL, Machine translations, Transformation rules, Grammar. The Tree of Possible Transformations Transformations in the UNDL Platform system are implemented by consequently applying transformation rules on the UNL sentence. keywords: sentence; transformation; tree; undl; unl cache: mpcs-241.pdf plain text: mpcs-241.txt item: #110 of 341 id: mpcs-243 author: Hovnanyan, Vilyam H.; Poghosyan, Suren S.; Poghosyan, Vahagn S. title: Method of Local Interchange to Investigate Gossip Problems date: 2021-12-10 words: 10021 flesch: 110 summary: In t h is c a s e t h e r e is e o t h e r . keywords: e d; e n; e s; e t; h e; n t; o n; o s; r e; r t; s s; s t; t h; t t cache: mpcs-243.pdf plain text: mpcs-243.txt item: #111 of 341 id: mpcs-244 author: Nikoghosyan, Zhora G. title: Non-hamiltonian Graphs with Given Toughness date: 2021-12-10 words: 8203 flesch: 109 summary: On t h e o t h e r h a n d , t h e r e e r e fo r e , Ka;b is a n o n -h a m ilt o n ia n g r a p h . keywords: e n; e s; e t; h e; o n; r e; t h cache: mpcs-244.pdf plain text: mpcs-244.txt item: #112 of 341 id: mpcs-25 author: Tadevosyan, Robert N.; Petrosyan, Arthur S.; Petrosyan, Gurgen S. title: The Concept of Internal IP Addresses System for NRENs date: 2021-12-10 words: 1719 flesch: 54 summary: Internal IP address distribution system. This paper presents the concept of a new system of internal IP addresses proposed for use by National Research and Education Networks (NREN). keywords: addresses; addressing; network; system; vlan cache: mpcs-25.pdf plain text: mpcs-25.txt item: #113 of 341 id: mpcs-251 author: Minasyan, Lilit G. title: An Algorithm of Digital Image Interpolation date: 2021-12-10 words: 483 flesch: 70 summary: [1] J. Mukherjee, S. K. Mitra, “Image resizing in the compressed domain using subband DCT,” IEEE Trans. [2] S. A. Martucci, “Image resizing in the discrete cosine transform domain,” IEEE Proc. keywords: image; interpolation; processing cache: mpcs-251.pdf plain text: mpcs-251.txt item: #114 of 341 id: mpcs-252 author: Khachatryan, Mane title: Least Squares Fitting with Cubic Splines date: 2021-12-10 words: 244 flesch: 94 summary: Ùáï³ñÏáõÙÁ Ëáñ³Ý³ñ¹³ÛÇÝ ëåɳÛÝÝ»ñáí` ÷áùñ³·áõÛÝ ù³é³ÏáõëÇÝ»ñÇ Ù»Ãá¹áí: ²ñï³ÍíáõÙ ¿ ˳éÁ ïÇåÇ »½ñ³ÛÇÝ ë³Ñٳݳ÷³ÏáõÙÝ»ñáí Ëáñ³Ý³ñ¹³ÛÇÝ ëåɳÛÝÝ»ñÇ Ï³éáõóÙ³Ý ³É·áñÇÃÙÁ: Least Squares Fitting with Cubic Splines 54 Аппроксимация кубическими сплайнами по методу наименьших квадратов М. Хачатрян Аннотация В статье рассматривается аппроксимация экспериментальных данных методом наименьших квадратов с помощью кубических сплайнов. Выводится алгоритм построения интерполяционных кубических сплайнов с краевыми ограничениями смешанного типа. . keywords: методы; москва cache: mpcs-252.pdf plain text: mpcs-252.txt item: #115 of 341 id: mpcs-254 author: Manukian, Seda N. title: Some Algebraical and Logical Properties of Two-dimensional Arithmetical Sets Representable in Presburger’s System date: 2021-12-10 words: 548 flesch: 66 summary: 64 Some Algebraical and Logical Properties of Two- dimensional Arithmetical Sets Representable in Presburger’s System1 Seda N. Manukian Institute for Informatics and Automation Problems of NAS of RA e-mail: zaslav@ipia.sci.am Abstract A classification ...)2()1()0(  HHH of arithmetical sets representable in M.Presburger’s system ([1]-[4]) and a classification ...)2()1()0(  HHH of two- dimensional sets of the same kind are considered. Microsoft Word - Manukian-revised.doc Mathematical Problems of Computer Science 37, 64--74, 2012. keywords: hhh; manukian; sets cache: mpcs-254.pdf plain text: mpcs-254.txt item: #116 of 341 id: mpcs-255 author: Jivanyan, A. title: A New Approach to Receipt-Free E-Voting date: 2021-12-10 words: 571 flesch: 74 summary: “A verifiable secret shuffle and its application to E-Voting”, In Proc. of ACM CCS'01,ACM Press, pp. 116-125. 2001. “Making mix nets robust for electronic voting by randomized partial checking”, In Proc. keywords: proc; voting cache: mpcs-255.pdf plain text: mpcs-255.txt item: #117 of 341 id: mpcs-256 author: Khachatrian, Gurgen ; Malkhasyan, Narek title: Overview of Methods of Biometric Based Key Protection date: 2021-12-10 words: 567 flesch: 72 summary: <<մարտահրավեր-պատասխան>> արձանագրությունների միջոցով, որոնց օգնությամբ օգտագործողը կարող է ապացուցել որևէ բանալու պատկանելությունը իրեն: Սույն հոդվածում ներկայացված են բիոմետրիկ (կենսաչափական) տվյալներից գաղտնաբառերի ստացման մեթոդների, ինչպես նաև ոլորտի այլ մարտահրավերների և աշխատանքի ապագա հնարավոր ուղղությունների դիտարկումները: Обзор биометрических методов защиты ключей Г. Хачатрян и Н. Малхасян Аннотация Безопасность всех современных криптосистем базируется на предположении, что секретные ключи используемые в системе, такие как ключи для шифрования сообщений, ключи аутентикации и ключи криптосистем с открытым ключом, неизвестны. 83 Overview of Methods of Biometric Based Key Protection Gurgen Khachatrian and Narek Malkhasyan American University of Armenia, Institute for Informatics and Automation Problems of NAS of RA Abstract The security of any modern cryptosystem relies on the assumption that secret keys used for the system such as secret keys for message encryption and authentication as well as private keys of public key cryptosystem are unknown. keywords: keys; methods cache: mpcs-256.pdf plain text: mpcs-256.txt item: #118 of 341 id: mpcs-257 author: Khachaturyan, Armen title: Optimal Permissible Placement by the Height of the Transitive Directed Tree with One Root date: 2021-12-10 words: 633 flesch: 75 summary: References 1. A. H. Khachaturyan, “Necessary Conditions for Optimal Permissible Placement by the Height of the Transitive Directed Tree with One Root”, Mathematical Problems of Computer Science, vol. 3. A.H. Khachaturyan, “The optimal permissible placement by the height of the transitive oriented tree containing one vertex of branching”, Mathematical Problems of Computer Science, vol. keywords: placement; problems; vol cache: mpcs-257.pdf plain text: mpcs-257.txt item: #119 of 341 id: mpcs-258 author: Karapetyan, Gevorg title: Modification of FSE Method Based on Coefficients of Homogeneity date: 2021-12-10 words: 362 flesch: 72 summary: Hadamard Transforms, SPIE Press, 2011, ÐÀ¾ Ù»Ãá¹Ç í»ñ³÷áËáõÙÁ ѳٳë»éáõÃÛ³Ý ·áñͳÏÇóÝ»ñÇ ÑÇÙ³Ý íñ³ ¶. γñ³å»ïÛ³Ý ²Ù÷á÷áõÙ ²Ûë ³ß˳ï³ÝùáõÙ Ùß³Ïí³Í ¿ ѳ׳խաÏ³Ý ÁÝïñ³Ýù³ÛÇÝ ¿ùëïñ³åáÉÛ³ódzÛÇ (ÐÀ¾) Ù»Ãá¹Ç ÙÇ Ýáñ ï³ñµ»ñ³Ï: Üß»Ýù, áñ ÐÀ¾ Ù»Ãá¹Ý û·ï³·áñÍíáõÙ ¿ Ãí³ÛÇÝ å³ïÏ»ñÝ»ñáõÙ µÉáϳÛÇÝ ÏáñáõëïÝ»ñÇ ùáÕ³ñÏÙ³Ý Ýå³ï³Ïáí: ì»ñçÇÝÇë Ùá¹ÇýÇϳóÇ³Ý ÑÇÙÝí³Í ¿ ³ç³ÏóáÕ ïÇñáõÛÃÇ í»ñÉáõÍáõÃÛ³Ý keywords: fse; method; ðྠcache: mpcs-258.pdf plain text: mpcs-258.txt item: #120 of 341 id: mpcs-259 author: Khachaturyan, Armen title: Necessary Conditions for Optimal Permissible Placement by the height of the Transitive Directed Tree with One Root (part second) date: 2021-12-10 words: 480 flesch: 72 summary: A.H. Khachaturyan, “Necessary conditions for optimal permissible placement by the height of the transitive directed tree with one root”, Mathematical Problems of Computer Science, vol. 36, pp. 2. A.H. Khachaturyan, “The optimal permissible placement by the height of the transitive oriented tree containing one vertex of branching”, Mathematical Problems of Computer Science, vol. keywords: placement; problems cache: mpcs-259.pdf plain text: mpcs-259.txt item: #121 of 341 id: mpcs-26 author: Mokatsian, Arsen H. title: On Initial Segments of Turing Degrees Containing Simple T-Mitotic but not wtt-Mitotic Sets date: 2021-12-10 words: 7630 flesch: 109 summary: t A is T -mitotic (wtt-mitotic), if t h e r e is a s p lit t in g A1, A2 o Th u s , t h e r e is a n in ¯ n it e keywords: e e; e n; e t; h e; m e; n o; n t; o t; r e; s e; t h; t t cache: mpcs-26.pdf plain text: mpcs-26.txt item: #122 of 341 id: mpcs-263 author: Tarumyan, Lusine S. title: Analysis of Characteristics for Cyclic Business Processes date: 2021-12-10 words: 834 flesch: 60 summary: [2] H. Jonkers, H.M. Franken, “Quantitative modeling and analysis of business processes”, Simulation in Industry, 8th European Simulation Symposium, vol. [6] L. Tarumyan, “A System of performance characteristics analysis for business processes”, CSIT2011 Eighth International Conference on Computer Science and Information technologies, pp. keywords: analysis; business; process; processes; workflow cache: mpcs-263.pdf plain text: mpcs-263.txt item: #123 of 341 id: mpcs-264 author: Sahakyan, Armen title: Digital Mammogram Segmentation and Abnormal Masses Detection System date: 2021-12-10 words: 612 flesch: 58 summary: Digital Mammogram Segmentation and Abnormal Masses Detection System 42 [7] A. Sahakyan, H. Sarukhanyan, Automatic Segmentation of the Breast Region in Digital Mammograms, Computer Science and Information Technologies, Proceedings of the Conference, pp. 386 - 389, Yerevan, Armenia, September 26-30, 2011. [4] F. Aghdasi, R.Ward, and B. Palcic, “Restoration of mammographic images in the presence of signal-dependent noise”, in State of the Art in Digital Mammographic Image Analysis. keywords: breast; detection; segmentation; vol cache: mpcs-264.pdf plain text: mpcs-264.txt item: #124 of 341 id: mpcs-267 author: Hwang, I-Shyan ; Beybutyan, D. title: Designing a New Framework for the Patient Affected with Heart Problem date: 2021-12-10 words: 3843 flesch: 107 summary: le wa r e fo r s e n s o r n e t wo r ks : A n a p p lic a t io n c a s e s t u d y , fo r m o b ile c o m m e r c e ,Int. keywords: e n; t e cache: mpcs-267.pdf plain text: mpcs-267.txt item: #125 of 341 id: mpcs-270 author: Bolibekyan, Hovhannes R. ; Zaslavsky, Igor D. title: On Some Kinds of Constructive Fuzzy Logic date: 2021-12-10 words: 605 flesch: 88 summary: Mathematical Principles of Fuzzy Logic. Fuzzy Logic, Intelligence, Control, and Information. keywords: fuzzy; logic cache: mpcs-270.pdf plain text: mpcs-270.txt item: #126 of 341 id: mpcs-271 author: Hayrapetyan, Hayk G. title: A Processing Algorithm for Separation of Cardiac and Pulmonic Activities Reflected in Microwave Doppler Spectra date: 2021-12-10 words: 293 flesch: 53 summary: References [1] R.L.Yadava , “RF/Microwaves in bio-medical applications”, Proc. of 8th International Conference on Electromagnetic Interference and Compatibility (INCEMIC-2003), pp. 81-85, 2003. The problem of azimuthal scanning of the human body by CW Doppler radar is considered. keywords: doppler; microwave; radar cache: mpcs-271.pdf plain text: mpcs-271.txt item: #127 of 341 id: mpcs-272 author: Khachaturyan, Armen title: Necessary Conditions for Optimal Permissible Placement by the Height of the Transitive Directed Tree with One Root date: 2021-12-10 words: 620 flesch: 77 summary: In the present paper a partial case of this problem, i.e. the problem of optimal permissible placement by the height of the transitive directed tree with one root (which is a such transitive directed graph, the arc base of which forms a directed tree with one root), is formulated. 4. M. R. Garey, R. L. Graham, D. S. Johnson and D. E. Knuth, “Complexity results for bandwidth minimization”, SIAM J. Appl. keywords: graph; placement; problem; tree cache: mpcs-272.pdf plain text: mpcs-272.txt item: #128 of 341 id: mpcs-273 author: Khachaturyan, Vahe title: Off-Line Signature Verification and Recognition date: 2021-12-10 words: 503 flesch: 61 summary: The paper deals with the recognition of the signature, as human operator generally makes the work of signature recognition. [3] Evett and R. N. Totty, ”Study of the variation in the dimensions of genuine signatures”, Journal of the Forensic Science Society, vol. keywords: recognition; signature cache: mpcs-273.pdf plain text: mpcs-273.txt item: #129 of 341 id: mpcs-274 author: Sahakyan, Vladimir ; Petrosyan, Sergey title: Workload Management for Grid Environment with the Restriction on the Waiting Time date: 2021-12-10 words: 639 flesch: 65 summary: Այն տալիս է ընդհանրացված լուծման մեխանիզմ, որը կարելի է զարգացնել, հետերոգեն համակարգերի համար ավելացնելով նոր ֆունկցիոնալություն: Հոդվածում առաջարկվում է հերթի կազմակերպման պարամետրացված երկու մոտեցում ՖԻՖՈ վարքով` սպասման ժամանակի սահմանափակմամբ: Կատարվում է մոդելների համեմատություն և նշվում են մոտեցումների հիմնական կիրառման պայմանները: Սպասման ժամանակը դա այն ժամանակն է, երբ առաջադրանքը կարող է սպասել մինչև կատարման անցնելը: Սույն հոդվածում դիտարկվում է առաջադրանքների հերթի կառավարման նոր մոտեցում։ keywords: computer; management; time; waiting cache: mpcs-274.pdf plain text: mpcs-274.txt item: #130 of 341 id: mpcs-275 author: Asatryan, David ; Kurkchiyan, Vardan ; Bagramyan, Marine title: A Method for Quality Assessment of Image Resizing Algorithms date: 2021-12-10 words: 504 flesch: 65 summary: Wang Z., Bovik A.C. Modern Image Quality Assessment, San Rafael, CA: Morgan & Claypool. 2006. 6. Asatryan D., Egiazarian K. “Quality Assessment Measure Based on Image Structural Properties”, Proc. of the International Workshop on Local and Non-Local Approximation in Image Processing. keywords: assessment; image; quality; resizing; масштабирования cache: mpcs-275.pdf plain text: mpcs-275.txt item: #131 of 341 id: mpcs-276 author: Vardanyan, Ruben title: Interactive Multimedia Publication System for Building Web Services date: 2021-12-10 words: 492 flesch: 58 summary: “Modeling of adaptable multimedia documents”, In Proc. Interactive Multimedia Publication System for Building Web Services 134 ÆÝï»ñ³ÏïÇí ØáõÉïÇÙ»¹Ç³ Ðñ³å³ñ³ÏáõÙÝ»ñÇ Ñ³Ù³Ï³ñ·՝ í»µ ͳé³ÛáõÃÛáõÝÝ»ñ ëï»ÕÍ»Éáõ ѳٳñ è. keywords: multimedia; services; system; web cache: mpcs-276.pdf plain text: mpcs-276.txt item: #132 of 341 id: mpcs-280 author: Geoletsyan , Grigor H. ; Geoletsyan, Hrant G. title: We describe the implementation of modified initialization and load balancing methods during parallelization of search algorithms for solution of optimization problems on high performance computing structures. Most optimization problems in discrete mathema date: 2021-12-10 words: 410 flesch: 63 summary: [7] S.-Y. Kuo, W. K. Fuchs, “Efficient spare allocation in reconfigurable arrays”, DAC, pp. [4] I. Kim, Y. Zorian, G. Komoriya et al., “Built in self repair for embedded high density SRAM”, Proc. keywords: problems; геолецян cache: mpcs-280.pdf plain text: mpcs-280.txt item: #133 of 341 id: mpcs-293 author: Sahakyan, Armen title: Segmentation of Mammography Images Enhanced by Histogram Equalization date: 2021-12-10 words: 470 flesch: 58 summary: [10] J. Alex Stark, “Adaptive Image Contrast Enhancement Using Generalizations of Histogram Equalization” IEEE Trans. Image enhancement techniques, based on histogram equalization, are shown and used before image segmentation. keywords: enhancement; image; vol cache: mpcs-293.pdf plain text: mpcs-293.txt item: #134 of 341 id: mpcs-294 author: Khalili, Mehdi ; Asatryan , David G. title: Effective, Secure and Robust CDMA Digital Image Watermarking in YCbCr Channel Using DWT2 date: 2021-12-10 words: 638 flesch: 54 summary: [7] Y. Fang, J. Huang and Yun Q. Shi, “Image watermarking algorithm applying CDMA”, IEEE, 2003. [5] M. Khalili, “A comparison between digital images watermarking in two different color spaces using DWT2”, Proceedings of the 7th International Conference on Computer Science and Information Technologies, pp. keywords: image; vol; watermarking cache: mpcs-294.pdf plain text: mpcs-294.txt item: #135 of 341 id: mpcs-295 author: Avsharyan, Hayk B. ; Kirakossian, Ruben G. title: Tools Development of Ring Computing Network Structure Improvement date: 2021-12-10 words: 309 flesch: 86 summary: 128 Tools Development of Ring Computing Network Structure Improvement Hayk B. Avsharyan and Ruben G. Kirakossian Yerevan State University Abstract The current state of computer networks is discussed. M. Hatamleh, “Structural optimization of computer networks with the technology of MPLS with restrictions on the quality of service,” European Journal of Scientific Research, pp. keywords: network; ñ³ßíáõ³ï³ý cache: mpcs-295.pdf plain text: mpcs-295.txt item: #136 of 341 id: mpcs-296 author: Hakhoumian, Arsen ; Zakaryan, Tigran ; Muzhikyan, Aramazd ; Nikoghosyan, Vahan title: Compact High Performance Algorithm for Convolutional Decoder date: 2021-12-10 words: 282 flesch: 62 summary: ¨ ѳݷ»óÝáõÙ ¿ ³½¹³Ýß³Ý/³ÕÙáõÏ Ñ³ñ³µ»ñáõÃÛ³Ý 2 ¹´-áí ɳí³óÙ³ÝÁ, ϳñáÕ ¿ ¿³Ï³Ýáñ»Ý ٻͳóÝ»É Ñ³ßí³ñÏÇ Å³Ù³Ý³ÏÁ, áñÁ óáõóã³ÛÇÝ Ï³Ëí³ÍáõÃÛáõÝ áõÝÇ ÏïñÙ³Ý µáõý»ñÇ »ñϳñáõÃÛáõÝÇó: K=7 ûåïÇÙ³É »ñϳñáõÃÛ³Ý Ñ³Ù³ñ ëï³óíáõÙ ¿ 14 ص/í ³é³í»É³·áõÛÝ áõݳÏáõÃÛáõÝÁ: ´³ñÓñ ϳï³ñáճϳÝáõÃÛ³Ùµ ÷³ÃáõÛóÛÇÝ ³å³Ïá¹³íáñÙ³Ý ë»ÕÙ ³É·áñÇÃÙ ². keywords: buffer; cutoff cache: mpcs-296.pdf plain text: mpcs-296.txt item: #137 of 341 id: mpcs-297 author: Shoukourian, Yuri title: On Creation of Computational Infrastructure for Development of Science in Armenia. date: 2021-12-10 words: 1257 flesch: 37 summary: Taking into consideration that hardware performance has exponential growth and scientific researches require processing of very large scale data, it is possible to predict numerous problems coherent to computer and information science. They can be grouped in the following way: effective use of e-infrastructures for development of computer and information science; choice of scientific research directions for the creation and development of the corresponding computational solvers; creation of the general program of development of a computational infrastructure for e-science in Armenia in view of the above-stated components and formation of some conceptual documents determining the basic ways of its realization. keywords: armenia; development; science cache: mpcs-297.pdf plain text: mpcs-297.txt item: #138 of 341 id: mpcs-299 author: Sarukhanyan, Hakob title: Orthogonal Transforms for Digital Signal and Image Processing date: 2021-12-10 words: 1141 flesch: 64 summary: Later, in [4] were developed more general FHT which have the complexity  1log 2  knnknD with assumption that Hadamard matrix nH of order n has the following representation kkn AvAvAvH  2211 where iv are k-size (-1,+1) mutualy orthogonal vectors, and kjA j ,1,  are nk n  size (0,-1,+1) matrices with the following conditions .,,2,1, ,,,2,1,,,0 , ,)1,1( ,,,2,1,,, 1 1 kiIAA kjijiAA IAA matrixaisA kjijiAA k nk n i T i j T i nk n k i T ii k i i ji             12 A-S theorem and its generalization: In 1981 Agaian and Sarukhanyan [5] have offered a construction method of Hadamard matrix (H-matrix) of order mn/2 proceeding from existence H-matrices of order m and n (see Figure below). Recall that the DOT of the sequence )(nf is given by     1 0 1 ,1,0],[][][ N n nN NkknfkY  where ]}[{ kn is an orthogonal system. keywords: n n cache: mpcs-299.pdf plain text: mpcs-299.txt item: #139 of 341 id: mpcs-30 author: Haroutunian, Mariam E.; Badasyan, Tigran S. title: Information - Theoretic Methods for Anomaly Detection date: 2021-12-10 words: 13789 flesch: 109 summary: it is p a r a m e t e r fr e e ; it b u ild s In fo r m a t io n t h e o r e t ic t keywords: c t; e c; e d; e e; e n; e t; h e; n o; n t; r e; r o; s e; s t; t h; t r; t t cache: mpcs-30.pdf plain text: mpcs-30.txt item: #140 of 341 id: mpcs-300 author: Shoukourian, Samvel title: Multidimensional Tapes and Multitape Automata: Recent Results and Beyond date: 2021-12-10 words: 904 flesch: 54 summary: [2], which states that the equivalence problem of multidimensional multitape automata can be reduced to the equivalence problem of one- dimensional multitape automata and, thus, is also solvable. In 1991 T. Harju and J. Karhumäki proved the solvability of the equivalence problem for multitape automata without any restriction on the number of tapes [6]. keywords: automata; equivalence; problem cache: mpcs-300.pdf plain text: mpcs-300.txt item: #141 of 341 id: mpcs-301 author: Asatryan, David G. title: On some Problems of Signal and Image Processind, Analysing and Protection date: 2021-12-10 words: 1199 flesch: 50 summary: It is well known that the results of the evaluation of image quality by widely used criteria based on the mean square discrepancy of images, often does not match the quality assessment in visual manner. Audio and image watermarking. keywords: asatryan; image; watermarking cache: mpcs-301.pdf plain text: mpcs-301.txt item: #142 of 341 id: mpcs-303 author: none title: О необходимости восстановления специальности для подготовки программистов в бакалавриате технических вузов Армении (РА) date: 2021-12-10 words: 544 flesch: 98 summary: Данный перечень принят в большинстве вузов США в качестве стандарта де-факто . Для сохранения общего числа специальностей можно было бы объединить “Информационные системы” и “Информационные технологии” в одну специальность так, как сделано в РФ, достигая тем самым полного соответствия перечней РА и РФ. keywords: вузов; технических cache: mpcs-303.pdf plain text: mpcs-303.txt item: #143 of 341 id: mpcs-304 author: Haroutunian, Evgueni A.; Martirosyan, Artak R.; Yessayan, Aram O. title: On Application of Optimal Multihypothesis Tests for the Bounds Construction for the Increase of Growth Rate of Stock Market date: 2021-12-10 words: 7442 flesch: 108 summary: Th is m o d e l a n d t h e c o r r e s p o n d in g o o f t h e c o r r e s p o keywords: e n; e s; e t; h e; n t; r e; r t; s t; t h; t o cache: mpcs-304.pdf plain text: mpcs-304.txt item: #144 of 341 id: mpcs-307 author: Haroutunian, Evgueni A.; Hakobyan, Parandzem M. title: On Neyman-Pearson Principle in Multiple Hypotheses Testing date: 2021-12-10 words: 4502 flesch: 107 summary: e s e t s B1, B2 a n d B3 wit h t h e c o r r e s p o n d in g e r r o r p r o b a b ilit ie s ¯ljm, m; l = 1 ; 3 , if ¯1j1 · ®¤1j1, t h e n m a x( ¯1j2; ¯1j3 ) Th e t h e o r e m is p r o ve d . 3 . keywords: e s; e t cache: mpcs-307.pdf plain text: mpcs-307.txt item: #145 of 341 id: mpcs-308 author: Sahakyan, Vladimir title: About the Queue Organization in the Multiprocessor date: 2021-12-10 words: 709 flesch: 37 summary: Many tasks of modeling in science and technology require more and more accuracy and timeliness of their calculation, i.e. fast computational resources. Grid-systems are not intended for decision of parallel tasks, but are intended for the solution of batch tasks, when each separate parallel task is executed entirely on one node. keywords: computing; performance; tasks cache: mpcs-308.pdf plain text: mpcs-308.txt item: #146 of 341 id: mpcs-309 author: Haroutunian, E. A. title: On Close Interaction of Information Theory and Mathematical Statistics date: 2021-12-10 words: 1590 flesch: 51 summary: E. A. Haroutunian, M. E. Haroutunian, “Channel with random parameter, Proc. of 12-th Prague Conf. on Inform. E. A. Haroutunian, M. E. Haroutunian, “Bounds of E-capacity region for restricted two-way channel,” (in Russian), Probl. keywords: haroutunian; theory cache: mpcs-309.pdf plain text: mpcs-309.txt item: #147 of 341 id: mpcs-31 author: Poghosyan, Suren S.; Poghosyan, Vahagn S. title: Rumor Spreading and Invasion Percolation date: 2021-12-10 words: 14527 flesch: 110 summary: g e t t h e c o r r e s p o n d e n c e b e o r t e s t s p a n n in g t r e e o keywords: c t; e c; e d; e e; e n; e s; e t; h e; n d; n s; n t; o n; o t; r e; r t; s s; s t; t h; t t cache: mpcs-31.pdf plain text: mpcs-31.txt item: #148 of 341 id: mpcs-310 author: Gevorkyan, Ashot S. title: Mathematical Problems of Spin-Glass Systems in One-Dimension date: 2021-12-10 words: 835 flesch: 53 summary: But, numerical studies of spin-glass problem is difficult to accomplish and, in general, only for a small number of spins, the numerical simulation is effectively solvable. It is specifically shown that the dimensional effects in the form of set of local maximums in the energy distribution arise when the number of spin-chains M< 𝑛𝑛. Taking into account formulas (4) and (5) and the coset weight structures for considered codes, we may formulate the following: The code 𝐶𝐶 will be called linear if 𝐶𝐶 is a linear subspase of 𝐸𝐸𝑛𝑛. Denote by 𝑑𝑑𝐶𝐶 the minimum distance of code 𝐶𝐶 i.e. 𝑑𝑑𝐶𝐶 = 𝑚𝑚𝑖𝑖𝑛𝑛𝑐𝑐1,𝑐𝑐2∈𝐶𝐶 𝑐𝑐1≠𝑐𝑐2 𝑑𝑑(𝑐𝑐1, 𝑐𝑐2). keywords: algorithm; blocks; code 𝐶𝐶; codes; complexity; denote; error cache: mpcs-42.pdf plain text: mpcs-42.txt item: #203 of 341 id: mpcs-420 author: Ахумян, Арсен А. ; Товмасян , Вардан Ж. ; Ароян, Оганес C. title: Оптимальная передача информации через пороговую систему со стохастическим резонансом date: 2021-12-10 words: 304 flesch: 89 summary: Литература [1] R. Benzi, A. Sutera and A. Vulpiani, The mechanism of stochastic resonance, J. Phys. [2] B. McNamara and K. Wiesenfeld, Theory of stochastic resonance, Phys. keywords: resonance; stochastic cache: mpcs-420.pdf plain text: mpcs-420.txt item: #204 of 341 id: mpcs-421 author: Асланян, Левон ; Хачатрян, Роберт title: Построение ассоциативных правил путем цепного раздробления n-мерного единичного куба цепями date: 2021-12-10 words: 260 flesch: 96 summary: Ùdzíáñ Ëáñ³Ý³ñ¹Á ßÕóݻñÇ ïñáÑ»Éáõ »Õ³Ý³Ïáí È. ²ëɳÝÛ³Ý, è.ʳã³ïñÛ³Ý ²Ù÷á÷áõÙ ²ß˳ï³ÝùáõÙ ÉáõÍí³Í ¿ ³ëáódzïÇí ϳÝáÝÝ»ñÇ ÷ÝïñÙ³Ý ËݹÇñÁ ¨ µ»ñí³Í ¿ ѳÛïÝÇ APRIORI ³É·áñÇÃÙÇ ³ÛÉÁÝïñ³Ýù³ÛÇÝ ï³ñµ»ñ³ÏÁ ³Û¹ ËݹñÇ ÉáõÍÙ³Ý Ñ³Ù³ñ: ²ÛÝ ÑÇÙÝí³Í ¿ n-ã³÷³ÝÇ Ùdzíáñ Ëáñ³Ý³ñ¹Á ßÕóݻñÇ ïñáÑ»Éáõ íñ³, ²Ýë»ÉÇ ÏáÕÙÇó ³é³ç³ñÏí³Í »Õ³Ý³Ïáí: Üϳñ³·ñí³Í »Ý ·áñÍÇùÝ»ñ ßÕóݻñÇ Ñ»ï ³ß˳ï»Éáõ ѳٳñ, áñáÝù ¹áõñë Microsoft Word - Robert.doc Математические вопросы кибернетики и вычислительной техники 30, 92--104, 2008. keywords: стр cache: mpcs-421.pdf plain text: mpcs-421.txt item: #205 of 341 id: mpcs-422 author: Петросян, Г. title: Разработка пользовательского интерфейса управления распределенными базами данных в кластерных системах date: 2021-12-10 words: 264 flesch: 82 summary: Разработка интерфейса управления распределнными базами данных в кластерных системах 106 Îɳëï»ñ³ÛÇÝ Ñ³Ù³Ï³ñ·»ñáõÙ ï³ñ³µ³ßËí³Í ïíÛ³ÉÝ»ñÇ Ñ»Ýù»ñÇ Ñ³Ù³ñ û·ï³·áñÍáÕÇ Õ»Ï³í³ñÙ³Ý ինտերֆեյսի Ùß³ÏáõÙÁ: ¶. ä»ïñáëÛ³Ý ²Ù÷á÷áõÙ ²Ûë Ñá¹í³ÍáõÙ Ý»ñϳ۳óí³Í ¿ Ïɳëï»ñ³ÛÇÝ Ñ³Ù³Ï³ñ·»ñÇ Ñ³Ù³ñ ï³ñ³µ³ßËí³Í ïíÛɳݻñÇ Ñ»ÝùÇ Ñ³Ù³ñ ջϳí³ñÙ³Ý ինտերֆեյս, áñÁ ÃáõÛÉ ¿ ï³ÉÇë ¹ÇݳÙÇÏ Ï»ñåáí ջϳí³ñ»É Ïɳëï»ñ³ÛÇÝ ïíÛɳݻñÇ Ñ»Ýù»ñÁ: ²é³ç³ñÏí»É ¿ ݳ¨ Ïɳëï»ñ³ÛÇÝ Ñ³Ù³Ï³ñ·»ñÇ Ñ³Ù³ñ ïíÛ³ÉÝ»ñÇ ï³ñ³µ³ßË³Í Ùß³ÏÙ³Ý »ñÏáõ ٳϳñ¹³Ï³ÝÇ Ùá¹»É: Литература [1] А.Ю. Пушников, Введение в системы управления базами данных. keywords: данных; управления cache: mpcs-422.pdf plain text: mpcs-422.txt item: #206 of 341 id: mpcs-424 author: Zaslavsky, Igor D.; Khachatryan, Mikayel H. title: On the Comparative Complexity of Primitive Recursive Arithmetical and String Functions date: 2021-12-10 words: 3496 flesch: 79 summary: k k kh Q Q Q f g Q Q Q Q  for all values of the variables 1 2 1, , ... , .kQ Q Q  (3) ( ( ( )), ( ( )), ( ), , ,..., ),m mR Q Q Q R R R Q Q Q       that is 2 2 4 5 31 2 32 2 33 2 4 5( , , ,..., ) ( ( ), ( ), ( ), , ,..., ).m keywords: function; q q; term cache: mpcs-424.pdf plain text: mpcs-424.txt item: #207 of 341 id: mpcs-425 author: Haroutunian, Mariam E.; Ter-Vardanyan, Lilit A. title: Investigation of E-Capacity for Biometric Identification Protocol with Random Parameter date: 2021-12-10 words: 6427 flesch: 106 summary: we d e r ive t h e c o r r e s p o x2; ¢ ¢ ¢ ; xN g, wh e r e xn 2 X ; n = 1 ; N c o r r e s p o n d s t o e a c h in d ivid u a l m . keywords: e c; e n; e t; h e; n n; n o; n t; r e; s e; t h; t r cache: mpcs-425.pdf plain text: mpcs-425.txt item: #208 of 341 id: mpcs-426 author: Emin-Teryan, Grigor G. title: Radicals and Preradicals in the Category of Modules over All Rings date: 2021-12-10 words: 8009 flesch: 106 summary: e o r e m a b o ve a r e m u t u a lly in ve r s ive . e t h e o r e m fo keywords: e m; e n; h e; r e; t e; t h cache: mpcs-426.pdf plain text: mpcs-426.txt item: #209 of 341 id: mpcs-427 author: Barseghyan, Rafayel V. title: Searching Images by Using Color Structure date: 2021-12-10 words: 4399 flesch: 111 summary: im a g e s e a r c h wit h in m o r e t h e n 1 0 m illio n im t r ic e m e a n s qu a r e e r r o r is u s e d . keywords: e c; e d; e n; e s; r e; t e; t t cache: mpcs-427.pdf plain text: mpcs-427.txt item: #210 of 341 id: mpcs-428 author: Darbinyan, Samvel Kh.; Karapetyan, Iskandar A. title: On Cycles Through Vertices of Large Semidegree in Digraphs date: 2021-12-10 words: 18372 flesch: 111 summary: d o t h e r t h e o r e m s o n d On t h e o t h e r h a n d , p + 1 = d( xp¡2 ) = d( xp¡2; P keywords: c e; c t; e d; e n; e s; e t; h e; n d; n o; n t; o t; r e; r t; s t; t d; t h; t t cache: mpcs-428.pdf plain text: mpcs-428.txt item: #211 of 341 id: mpcs-429 author: Danoyan, Haykaz E. title: On Some Properties of Intersection and Union of Spheres in Hamming Metric date: 2021-12-10 words: 1895 flesch: 77 summary: Intersection of Spheres Centered at Codewords of Quasi-perfect Code Suppose we have spheres with radii centered at points respectively. Keywords: Nearest neighbors, best-match, Hamming spheres, concave function, quasi- perfect code. keywords: case; code; intersection; radius; spheres; union cache: mpcs-429.pdf plain text: mpcs-429.txt item: #212 of 341 id: mpcs-43 author: Poghosyan, Aghasi S.; Sarukhanyan, Hakob G. title: Image Caption Generation Model Based on Object Detector date: 2021-12-10 words: 3644 flesch: 62 summary: Image caption generation and object detection via a single model. There are works, which can extract image caption or object names and their coordinates. keywords: caption; detection; detector; generation; image; input; lstm; model; object; ssd cache: mpcs-43.pdf plain text: mpcs-43.txt item: #213 of 341 id: mpcs-430 author: Alaverdyan, Suren B. title: Moving Objects Detection on Colored Video Images date: 2021-12-10 words: 784 flesch: 64 summary: Original image with negative background Fig. 7. Original image with negative background Fig. 9. Objects Moving Objects Detection on Colored Video Images 128 References [1] У. Прэтт, Цифровая обработка изображений, М. Мир, т.2, 1982. keywords: background; fig; image; objects cache: mpcs-430.pdf plain text: mpcs-430.txt item: #214 of 341 id: mpcs-431 author: Arakelyan, Vahe A. title: Vulnerable Security Problems in Learning Management System (LMS) Moodle date: 2021-12-10 words: 2452 flesch: 56 summary: In this paper the security mechanisms of LMS Moodle are investigated. Having a number of functions and modules Moodle LMS competes with famous commercial learning systems such as Blackboard, Desire2Learn, SharePoint LMS and so on. keywords: attacks; data; learning; lms; moodle; security; session; system; user cache: mpcs-431.pdf plain text: mpcs-431.txt item: #215 of 341 id: mpcs-432 author: Baghdasaryan, Tadevos S. title: Adapting RGT Solver Interface to Management Strategy Search Problems date: 2021-12-10 words: 5119 flesch: 55 summary: In this paper we adapt the interface of RGT Solver for marketing and supply chain management (SCM) problems of the class presented by ValueWar and Trading Agents Competition models ValueWar (VW) integration includes: - presentation of its composing nucleous entities - presentation of actions and strategy plans - definitions of VW situations - embedding VW interface into RGT Solver TAC SCM integration includes: - presentation of SCM nucleous and composite entities - presentation of moves (actions) and strategy plans - definition of situation in TAC SCM - embedding TAC SCM interface into RGT Solver. keywords: action; component; price; ram; rgt; solver; strategy; tac; value; valuewar cache: mpcs-432.pdf plain text: mpcs-432.txt item: #216 of 341 id: mpcs-439 author: Далалян, Самвел title: О стратификации множества отображений групп date: 2021-12-10 words: 294 flesch: 107 summary: [H], [N]  S(M, A) для произвольных подгруппы H и, соответственно, нормального делителя N группы A, а также соответствующие стратификации. = (a)(b)(a, b), назовем правым сомножителем отклонения отображения  от гомоморфности в (или для) ab. keywords: группы cache: mpcs-439.pdf plain text: mpcs-439.txt item: #217 of 341 id: mpcs-44 author: Darbinyan, Samvel Kh. title: On the Manoussakis Conjecture for a Digraph to be Hamiltonian date: 2021-12-10 words: 9182 flesch: 96 summary: Since D is 2-strongly connected, it follows that D − u and D − v both are strongly connected. Since D is 2-strongly connected, it follows that both subdigraphs D − x and D − keywords: cycle cache: mpcs-44.pdf plain text: mpcs-44.txt item: #218 of 341 id: mpcs-440 author: Егиазарян, Э. title: Об асимптотических оценках числа решений систем булевых уравнений с зависимыми переменными date: 2021-12-10 words: 669 flesch: 108 summary: Е с л и   nmnm ,)log(  ,то для почти всех систем множества mlnS ,,' имеет место n lmSt 2)(2~)(  . Е с л и   nn  , то для почти всех систем S множества keywords: множества; решений; систем cache: mpcs-440.pdf plain text: mpcs-440.txt item: #219 of 341 id: mpcs-443 author: Mkoyan, Karen S. title: Steps Towards an LHC Computing Grid1 date: 2021-12-10 words: 375 flesch: 57 summary: The structure and mechanisms of the suggested interface, which uses DESY Grid site for accessing to LHC Grid are given. 1st EGEE Course at DESY, Introduction to Grid Computing with the LCG-2 middleware, DESY, Hamburg, Germany keywords: desy; grid; lhc cache: mpcs-443.pdf plain text: mpcs-443.txt item: #220 of 341 id: mpcs-45 author: Nikoghosyan, Zhora G. title: A Sharp Improvement of a Theorem of Bauer and Schmeichel date: 2021-12-10 words: 18713 flesch: 111 summary: im 5 , t h e r e a r e a t le a s t fo u r p a ir wis e c r o s s in g in t e B y L e m m a 3 , fo r e a c h d is t in c t u; v 2 V ( H ) , t h e r e is a p a t h in H o f le n g keywords: c e; c t; e d; e e; e n; e t; h e; m e; n t; o n; o t; r e; r t; s e; t h; t s; t t cache: mpcs-45.pdf plain text: mpcs-45.txt item: #221 of 341 id: mpcs-450 author: Варданян, Сейран М. title: О близости максимальных тупиковых распознающих систем в классе двухэлементных подмножеств date: 2021-12-10 words: 176 flesch: 97 summary: Ø. ì³ñ¹³ÝÛ³Ý ²Ù÷á÷áõÙ ê³ÑÙ³ÝíáõÙ ¿ »ñÏáõ ׳ݳãáÕ Ñ³Ù³Ï³ñ·»ñÇ ÙáïÇÏáõÃÛ³Ý ·³Õ³÷³ñÁ ¨ ³å³óáõóíáõÙ »Ý ûáñ»ÙÝ»ñ ïñí³Í ÙáïÇÏáõÃÛ³Ý Ù³ùëÇÙ³É ÷³ÏáõÕ³ÛÇÝ ×³Ý³ãáÕ Ñ³Ù³Ï³ñ·»ñÇ ù³Ý³ÏÝ»ñÇ í»ñ³µ»ñÛ³É: 85 Î áëèçîñòè ìàêñèìàëüíûõ òóïèêîâûõ ðàñïîçíà þùèõ ñèñòåì â êëàññå äâóõýëåìåíòíûõ ïîäìíîæåñòâ Ñåéðàí Ì. Âàðäàíÿí Институт проблем информатики и автоматизации НАН РА e-mail: seyranv@ipia.sci.am Аннотация  ñòàòüå îïðåäåëÿåòñÿ ïîíÿòèå áëèçîñòè ðàñïîçíà þùèõ ñèñòåì è äîêàçûâà þòñÿ íåêîòîðûå òåîðåìû î êîëè÷åñòâå ìàêñèìàëüíûõ òóïèêîâûõ ðàñïîçíà þùèõ ñèñòåì äàííîé áëèçîñòè. keywords: ðàñïîçíà; þùèõ cache: mpcs-450.pdf plain text: mpcs-450.txt item: #222 of 341 id: mpcs-454 author: Карапетян, Геворг title: Разработка стратегий в нардах с использованием индивидуализированных экспертных знаний date: 2021-12-10 words: 705 flesch: 70 summary: [14] Baghdasaryan T., Danielyan E, Pogossian E.: Supply Chain Management Strategy Provision by Game Tree Dynamic Analysis International Conference: Management of Small and Medium Business: Information Technologies (SBM2006), Sevastopol, Sept. 3-8, (2006) 37-41 [15] Pogossian E., Javadyan A., Ivanyan E.: Effective Discovery of Intrusion Protection Strategies. [11] Zermelo E. Uber eine Anwendung der Mengenlehre auf die theorie des Ðàçðàáîòêà ñòðàòåãèé â íàðäàõ* ñ èñïîëüçîâàíèåì èíäèâèäóàëèçèðîâàííûõ ýêñïåðòíûõ çíàíèé 108 Shachspiels. keywords: international; pogossian; çíàíèé; ñòðàòåãèé cache: mpcs-454.pdf plain text: mpcs-454.txt item: #223 of 341 id: mpcs-457 author: Darbinyan, Samvel Kh. title: A Note on Hamiltonian Bypasses in Digraphs with Large Degrees date: 2021-12-10 words: 6092 flesch: 93 summary: xp−1x1, x0 ∈ V (Cp−1) and y /∈ xp−2x1, x0 ∈ V (Cp−2) and x, y /∈ keywords: a(d; claim cache: mpcs-457.pdf plain text: mpcs-457.txt item: #224 of 341 id: mpcs-458 author: Haroutunian, Evgueni A. ; Yesayan, Aram O. title: A Neyman-Pearson Proper Way to Universal Testing of Multiple Hypotheses Formed by Groups of Distributions date: 2021-12-10 words: 6313 flesch: 68 summary: [21] E. A. Haroutunian, “Reliability in multiple hypotheses testing and identification prob- lems” Nato Science Series III, Computer and System Sciences, vol.198, IOS Press, pp. In [8] and in the following papers [9], [10], Cox formulated a number of divers examples of problems for two families of hypotheses testing and developed a general modification of the Neyman-Pearson maximum- likelihood ratio procedures for solving such problems. keywords: 1,k; gm∈bk; haroutunian; hypotheses; max; testing; tests cache: mpcs-458.pdf plain text: mpcs-458.txt item: #225 of 341 id: mpcs-46 author: Pogossian, Edward M. title: Constructing Adequate Mental Models date: 2021-12-10 words: 8639 flesch: 49 summary: Second, the units of languages, particularly, UW only partly representmss while for proper expression of certain mss m the interpreters can be forced to look iteratively for compositions of units of corpuses of languages that will acceptably activate m. 8. Algorithms are a type of regularized mss adequately modeling computations as well as systems and their doings that humans can code by numeric ones equally representing the originals. keywords: algorithms; classifiers; communities; doings; humans; ids; languages; members; mentals; modeling; models; mss; ones; problems; realities; regularized; rels; systems cache: mpcs-46.pdf plain text: mpcs-46.txt item: #226 of 341 id: mpcs-462 author: Gishyan, Karen M. title: Improving UAV Object Detection through Image Augmentation date: 2021-12-10 words: 5943 flesch: 57 summary: This work explores the performance of two state-of-art-object detection algorithms on the drone object detection task and proposes image augmentation 1 procedures to improve model performance. By using image augmentation sequences and techniques, we later generate 700 new images equal to the number of images in our training dataset, and our final dataset includes 1400 training, 200 validation and 100 test images. keywords: augmentation; blending; dataset; detection; grid; image; model; object; performance; results; sequence; spp; yolov3 cache: mpcs-462.pdf plain text: mpcs-462.txt item: #227 of 341 id: mpcs-464 author: Караханян, М. title: О представлении β-равномерных алгебр date: 2021-12-10 words: 863 flesch: 106 summary: Òåîðåìà 2 Ïóñòü A( ­) è B ( ­ ) åñòü ¯-ðàâíîìåðíûå àëãåáðû íà ­, ó êîòîðûõ îäíî è òîæå Áèøîï- Øèëîâñêîå ðàçëîæåíèå ­ ìàêñèìàëüíûìè ìíîæåñòâàìè àíòèñèììåòðèè. [3, 4]), ãäå ­ åñòü ëîêàëüíî êîìïàêòíîå õàóñäîðôîâî ïðîñòðàíñòâî, M ( ­) – ïðîñòðàíñòâî âñåõ êîíå÷íûõ êîìïëåêñíûõ ðåãóëÿðíûõ ìåð íà ­, à Lp ( ¹) – ñîîòâåòñòâóþùåå ïðîñòðàíñòâî, ïîðîæäåííîå ìåðîé ¹ 2 M ( ­) . keywords: àëãåáðû cache: mpcs-464.pdf plain text: mpcs-464.txt item: #228 of 341 id: mpcs-466 author: Grigoryan, Tigran A. title: An Approximate Method for Calculating the Distance Between Regular Languages for Multitape Finite Automata date: 2021-12-10 words: 4652 flesch: 76 summary: UDC 519.713, 004.43 An Approximate Method for Calculating the Distance Between Regular Languages for Multitape Finite Automata Tigran A. Grigoryan IT Educational and Research Center Yerevan State University, Armenia e-mail: tigran.grigoryan1995@gmail.com Abstract Sets of word tuples, accepted by multitape finite automata and a metric space for languages accepted by these automata, are considered. In [4], B. G. Mirkin has considered a special coding for the sets of words tuples accepted by multitape automata. keywords: automata; distance; finite; lg2; metric; multitape; semigroup; words cache: mpcs-466.pdf plain text: mpcs-466.txt item: #229 of 341 id: mpcs-468 author: Abgaryan, Gor A. title: A Built-in Self-Test System for External DRAM date: 2021-12-10 words: 2434 flesch: 68 summary: 4. Conclusion In this paper, different types of faults specific to external DRAM memories have been pre- sented as well as the steps of fault detection mechanisms were described. Keywords: Built-in Self-Test System, external DRAM memory, DRAM memory faults, System on Chip. keywords: bist; cell; dram; faults; memories; memory; self; system; test cache: mpcs-468.pdf plain text: mpcs-468.txt item: #230 of 341 id: mpcs-47 author: Manukian, Seda N. title: On Some Properties of Positive and Strongly Positive Arithmetical Sets date: 2021-12-10 words: 1858 flesch: 68 summary: Corollary: the logical description of the class of positive sets is obtained from the logical description of the class of strongly positive sets replacing the list of operations &,∨ by the list ∃, &,∨. It is proved (Theorem 2) that for any one-dimensional recursively enumerable set 𝑀𝑀 there exists 6-dimensional strongly positive set 𝐻𝐻 such that 𝑥𝑥 ∈ 𝑀𝑀 holds if and only if (1, 2𝑥𝑥, 0, 0, 1, 0) ∈ 𝐻𝐻+, where 𝐻𝐻+ is the transitive closure of 𝐻𝐻. Keywords: Positive set, Strongly positive set, Transitive closure, Signature. keywords: set; 𝐻𝐻+ cache: mpcs-47.pdf plain text: mpcs-47.txt item: #231 of 341 id: mpcs-471 author: Мирзоян, В.; Налбандян, Г.; Чахмахчян, Р. title: О структуре Ric-полусимметрических подмногообразий date: 2021-12-10 words: 1028 flesch: 108 summary: гиперповерхность в Тогда главное расслоение ортонормированных реперов в nE можно привести к главному расслоению  keywords: ric; г.в.к; нормально cache: mpcs-471.pdf plain text: mpcs-471.txt item: #232 of 341 id: mpcs-473 author: Яшин, А. title: Новые логические связки в суперинтуиционистских логиках: подход П.С. Новикова date: 2021-12-10 words: 810 flesch: 108 summary: -ëîãèêà L îïðåäåëÿåò íîâóþ ëîãè÷åñêóþ ñâÿçêó â L, åñëè âûïîëíåíû ñëåäóþùèå óñëîâèÿ: ² L ñîäåðæèò àêñèîìó çàìåíû äëÿ '; ² L êîíñåðâàòèâíà íàä L; ² äëÿ ëþáîé ÷èñòîé ôîðìóëû B '-ëîãèêà L + '( p) $ B íå êîíñåðâàòèâíà íàä L (íåâîçìîæíîñòü ïðèñîåäèíåíèÿ ÿâíûõ ñîîòíîøåíèé). Èìåííî, '-ëîãèêà L ïîëíà ïî Íîâèêîâó íàä L, åñëè 2 8 Íîâûå ëîãè÷åñêèå ñâÿçêè â ñóïåðèíòóèöèîíèñòñêèõ ëîãèêàõ: ïîäõîä Ï.Ñ.Íîâèêîâà ² L ñîäåðæèò àêñèîìó çàìåíû äëÿ '; ² L êîíñåðâàòèâíà íàä L; ² äëÿ ëþáîé ôîðìóëû B 2 F m ( ') n L '-ëîãèêà L + B íå êîíñåðâàòèâíà íàä L (íåâîçìîæíîñòü ïðèñîåäèíåíèÿ íîâûõ àêñèîì). keywords: äëÿ cache: mpcs-473.pdf plain text: mpcs-473.txt item: #233 of 341 id: mpcs-474 author: Огникян, А. title: О существовании композиций для бесконечномерной вещественной знакопеременной квадратичной формы date: 2021-12-10 words: 242 flesch: 104 summary: [3] äîêàçàíî ñóùåñòâîâàíèå áåñêîíå÷íîìåðíîé, ïîëíîé, íîðìèðîâàííîé àëãåáðû ñ ëåâîñòîðîííåé åäèíèöåé, ñ ëåâîñòðîííèì äåëåíèåì. [2], ÷òî íå ñóùåñòâóåò áåñêîíå÷íîìåðíàÿ âåùåñòâåííàÿ íîðìèðîâàííàÿ àëãåáðà ñ äâóõñòîðîííåé åäèíèöåé. keywords: àëãåáðû; áåñêîíå÷íîìåðíàÿ; åäèíèöåé cache: mpcs-474.pdf plain text: mpcs-474.txt item: #234 of 341 id: mpcs-476 author: Пилипосян, Э. title: Максимальное взвешенное независимое множество прямоугольников date: 2021-12-10 words: 507 flesch: 99 summary: [5]. Îñíîâíûå ðåçóëüòàòû Ïðÿìîóãîëüíèê íàçîâåì ëåâîñòîðîííèì, åñëè åãî ëåâàÿ ñòîðîíà îïèðàåòñÿ íà ëåâîé ñòîðîíå ïðÿìîóãîëüíîé ðàìêè M. Ìíîæåñòâî ëåâîñòîðîííèõ ïðÿìîóãîëüíèêîâ èç M îáîçíà÷èì ÷åðåç M L. Àíàëîãè÷íî îïðåäåëÿþòñÿ ìíîæåñòâà ïðàâîñòîðîííèõ M R, âåðõíèõ M U è íèæíèõ M D ïðÿìîóãîëüíèêîâ. ßñíî, ÷òî â îáùåì ñëó÷àå âñå ìíîæåñòâà M L; M R; M U ; M D ìîãóò áûòü íåïóñòûìè. Íàïðèìåð, åñëè M L 6= ;; M D 6= ;; M R = M U = ;, òî èìååì äåëî ñ äâóñòîðîííèì ñëó÷àåì LD èëè DL. keywords: ïðÿìîóãîëüíèêîâ cache: mpcs-476.pdf plain text: mpcs-476.txt item: #235 of 341 id: mpcs-478 author: Afshar, Nasrin; Haroutunian, Evgueni; Haroutunian, Mariam title: On Random Coding Bound for E-capacity Region of the Broadcast Channel With Confidential Messages date: 2021-12-10 words: 3522 flesch: 108 summary: e o t h e r r ive n e r r o r p r o b a b keywords: n e cache: mpcs-478.pdf plain text: mpcs-478.txt item: #236 of 341 id: mpcs-48 author: Nikoghosyan, Zhora G. title: Long Cycles in t-Tough Graphs with t > 1 date: 2021-12-10 words: 9056 flesch: 98 summary: If V (G\C) 6= {x1}, then choose x2 ∈ V (G\C) so that x2 6= x1. For x, y ∈ V (Q), we denote by x−→Q y the subpath of Q in the chosen direction from x to y. For x ∈ V (C), we denote the h-th successor and the h-th predecessor of x on −→C by x+h and x−h, respectively. keywords: e(g cache: mpcs-48.pdf plain text: mpcs-48.txt item: #237 of 341 id: mpcs-480 author: Aslanyan, L. title: Advanced Combinatorial Optimization date: 2021-12-10 words: 8295 flesch: 111 summary: e s e t e r m s . N e ve r t h e le s s , t h e r e is ve r y s t r o keywords: e n; e s; e t; r e; s t cache: mpcs-480.pdf plain text: mpcs-480.txt item: #238 of 341 id: mpcs-487 author: Asatryan, David G. ; Kurkchiyan, Vardan V. ; Sazhumyan, Grigor S. title: A Rational Approach to the Problem of Accurate UAV Landing Using Intelligent Image Processing Methods date: 2021-12-10 words: 2890 flesch: 60 summary: Table 1 lists three sample landing platform images and our proposed custom structure sample. In the review work [6], a comparative analysis of a number of UAV landing methods with or without GPS was carried out. keywords: angle; asatryan; image; landing; methods; platform; problems; processing; uav; use cache: mpcs-487.pdf plain text: mpcs-487.txt item: #239 of 341 id: mpcs-488 author: Kostanyan, Armen H. title: Fuzzy String Matching Using a Prefix Table date: 2021-12-10 words: 2285 flesch: 81 summary: Keywords: KMP algorithm, Approximate string matching, Fuzzy string matching 1. Fuzzy string matching process. keywords: matching; prefix; string cache: mpcs-488.pdf plain text: mpcs-488.txt item: #240 of 341 id: mpcs-49 author: Mkhitaryan, Karen K. title: Realization of Recommender Framework Based on Community Detection date: 2021-12-10 words: 3086 flesch: 51 summary: Finally, the predicted rating is obtained by normalizing the above weighted sum: 𝑀𝑀𝑢𝑢𝑢𝑢 = ∑ 𝑠𝑠𝑖𝑖𝑠𝑠(𝑢𝑢, 𝑞𝑞)𝑀𝑀𝑞𝑞𝑢𝑢𝑞𝑞∈𝑈𝑈 ∑ |𝑠𝑠𝑖𝑖𝑠𝑠(𝑢𝑢, 𝑞𝑞)|𝑞𝑞∈𝑈𝑈 . Item-item filtering uses the same idea but instead of user similarities, item similarities need to be calculated. Content-based and collaborative filtering approaches are the most popular techniques in recommender systems predicting users preferences based on “collaborative” data about users and items in the system. keywords: community; data; detection; filtering; framework; item; network; recommendation; recommender; system; user cache: mpcs-49.pdf plain text: mpcs-49.txt item: #241 of 341 id: mpcs-490 author: Petrosyan, Armen S. title: Vehicle Components Defect Detection via Machine Vision date: 2021-12-10 words: 1724 flesch: 58 summary: Automotive part processing software and pattern matching. At the same time, for the development of image processing algorithms and the extraction of information parameters of the image, an application is available called NI Vision Assistant. keywords: cameras; image; machine; parts; program; vision cache: mpcs-490.pdf plain text: mpcs-490.txt item: #242 of 341 id: mpcs-491 author: Tamazyan, Hakob A. ; Chubaryan, Anahit A. title: On Proof Complexities Relations in Some Systems of Propositional Calculus date: 2021-12-10 words: 3018 flesch: 95 summary: Если для двух систем B4 и B= для одних и тех же последовательностей формул ϕn имеет место CDE ��F � = Ω�2 HIJ �KL��, то считают, что для последовательности формул Повторяя этот вывод U раз можно получить вывод секвенции ∀��� ⊃ �=� → ∀��� ⊃ �= L �, а так как ∀��� ⊃ �=� выводится за конечное число шагов, то ∀��� ⊃ �= L �, а следовательно и → ⊃ = L выводится за M�U� шагов. keywords: qpk; spk; выводов; для; секвенции; системе; формул; шагов; ⊃ � cache: mpcs-491.pdf plain text: mpcs-491.txt item: #243 of 341 id: mpcs-495 author: Kocharyan, A .V . title: OTAS Program Tool for Text Matching Problems date: 2021-12-10 words: 323 flesch: 69 summary: Transactions of the Institute for Informatic and Automation P roblems of NAS R A. Vol 27,(2006), 54-62. DVI Mathematical Problems of Computer Science 28, 2007, keywords: otas cache: mpcs-495.pdf plain text: mpcs-495.txt item: #244 of 341 id: mpcs-50 author: Pogossian, Edward M. title: Challenging the Uniqueness of Being by Cognizing date: 2021-12-10 words: 8466 flesch: 51 summary: Constructive models of estranged acquisition of human classifiers present translators, interpreters from OO programs allowing the classifiers Cl of abstract classes represented, for example in Java, to correspond equal to Cl classifiers in computer codes. Inductors have to be interpreted as algorithms providing hypothesis on classifiers Clgi by extension of given matrices mpgi assumingly consistent with +Clgi [9]. 4.2.6. keywords: attributes; classifiers; classifying; clgi; doings; formation; goals; ids; matrices; mentals; models; ones; prints; realities; rels; types; wrt cache: mpcs-50.pdf plain text: mpcs-50.txt item: #245 of 341 id: mpcs-503 author: Aghazarian, Vahe ; Pedram, Hossein title: Network Resource Optimization for Quality of Service in Multimedia Multicasting date: 2021-12-10 words: 568 flesch: 51 summary: [5] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, “Network Flows: Theory, Algorithms, and Applications, “Prentice Hall, February 1993. To do so, it computes multicast trees by dynamically selecting the least loaded available paths, obtaining an optimal distribution of network resources. keywords: multicast; network; service cache: mpcs-503.pdf plain text: mpcs-503.txt item: #246 of 341 id: mpcs-504 author: Ghorbannia Delavar, Arash ; Navi, Keivan title: Arithmetic Operators Introducing Full Swing High Speed Current-Mode BiCMOS Technology date: 2021-12-10 words: 522 flesch: 65 summary: [13] Temel T., Current-mode CMOS Design of Multi-valued Logic Circuits, Ph.D Thesis, Bogazici University, Dep. of Electrical and Electronics Engineering, 2002. [10] James B. Kuo, JEA Honglou, Low - Voltage CMOS VLSI Circuits, John Willy 1999. keywords: circuits; cmos; mode cache: mpcs-504.pdf plain text: mpcs-504.txt item: #247 of 341 id: mpcs-505 author: Asatryan, David G. ; Sazhumyan, Grigor S. ; Shahverdyan, Hayk S. title: Technique for Coherent Segmentation of Image and Applications date: 2021-12-10 words: 486 flesch: 75 summary: Þ³Ñí»ñ¹Û³Ý ²Ù÷á÷áõÙ ä³ïÏ»ñÇ Ñ³ïí³Í³íáñÙ³Ý ËݹñáõÙ ¹Çï³ñÏí»É »Ý Ýáñ Ùáï»óáõÙ, »Õ³Ý³Ï ¨ ÏÇñ³éáõÃÛáõÝÝ»ñ, Ñ»Ýí³Í å³ïÏ»ñÇ ÏáÑ»ñ»Ýï ïñáÑÙ³Ý íñ³` í³éáõÃÛ³Ý ÙǨÝáõÛÝ ÙÇç³Ï³ÛùÇÝ å³ïϳÝáÕ Ï³å³Ïóí³Í ï³ññ»ñÇ ÁÝïñáõÃÛ³Ùµ: Üϳñ³·ñí»É »Ý ѳٳå³ï³ëË³Ý Íñ³·ñ³ÛÇÝ Ñ³Ù³Ï³ñ·Á ¨ ¹ñ³ ÑÇÙÝ³Ï³Ý ¨ Éñ³óáõóÇã Ñݳñ³íáñáõÃÛáõÝÝ»ñÁ: òáõÛó ¿ Proc. of XII Int. keywords: image; segmentation; ñ³ïí³í³íáñù³ý cache: mpcs-505.pdf plain text: mpcs-505.txt item: #248 of 341 id: mpcs-506 author: Погосян, Эдвард М. ; Ваградян, Вачаган Г. ; Григорян, Артур Н. title: Эксперименты согласования знаний экспертов с принятием решений в этюдах Рети и Нoдареишвили date: 2021-12-10 words: 800 flesch: 71 summary: A Game Model For Effective Counteraction Against Computer Attacks In Intrusion Detection Systems, NATO ASI, Data Fusion for Situation Monitoring, Incident Detection, Alert and Response Management, Armenia, August 19-30 (2003) 823-851 [19] Zermelo E. Uber eine Anwendung der Mengenlehre auf die theorie des Shachspiels. keywords: pogossian; systems; для; знаний; решений cache: mpcs-506.pdf plain text: mpcs-506.txt item: #249 of 341 id: mpcs-509 author: Harutyunyan, David M. title: Two-level Factorial Experiment for Measurement of Cd on Equipment AA Analyst date: 2021-12-10 words: 200 flesch: 67 summary: [3] Montgomery, D.C. (1996) Introduction to Statistical Quality Control, 3rd edition. “In the soup: A Case Study to Identify Contributors to Filling Variability,” Journal of Quality Technology, Vol. 20, p.36-43 keywords: new; wiley cache: mpcs-509.pdf plain text: mpcs-509.txt item: #250 of 341 id: mpcs-510 author: Карапетян, Геворг title: Разработка библиотеки трехмерной визуализации для мобильных устройств date: 2021-12-10 words: 188 flesch: 92 summary: [3] А. Ламот, Программирование трехмерных игр для Windows, изд. 128 Разработка библиотеки трехмерной визуализации для мобильных устройств Геворг Карапетян Институт проблем информатики и автоматизации НАН РА e-mail: gevorgk@gmail.com Аннотация Работа посвящена исследованиям в области библиотек трехмерной визуализации и разработке алгоритмов и методов оптимизации для них, с учетом их использования для мобильных устройств. keywords: для; համար cache: mpcs-510.pdf plain text: mpcs-510.txt item: #251 of 341 id: mpcs-514 author: Manukyan, Vardan A. title: On Switchbox Routing Algorithm date: 2021-12-10 words: 286 flesch: 74 summary: [5] Michael Burstein , Richard Pelavin, Hierarchical channel router, Proceedings of the 20th conference on Design automation, p.591-597, June 27-29, 1983, Miami Beach, Florida, United States [6] K. Chaudhary and P. Robinson. Preliminary results show that a class of switchbox routing problems can be routed by using smaller overall interconnection length than the Manhattan models provide. keywords: channel; routing cache: mpcs-514.pdf plain text: mpcs-514.txt item: #252 of 341 id: mpcs-515 author: Петросян, Вагинак С. title: Методы межкомпонентного взаимодействия в объектно-ориентированных каркасах приложений date: 2021-12-10 words: 246 flesch: 86 summary: ä»ïñáëÛ³Ý ²Ù÷á÷áõÙ ´³Õ³¹ñÇãÝ»ñÇ Ùǽ¨ ÷áËÝ»ñ·áñÍáõÃÛ³Ý Ñ³Ù³ñ, ³ÛëÇÝùÝ ·ñ³ýÇÏ³Ï³Ý µ³Õ³¹ñÇãÝ»ñÇ Ùǽ¨ ³ñӳݳ·ñáõÃÛáõÝÝ»ñÇ ÷á˳ÝóÙ³Ý [5] Trolltech - Qt - single source C++ cross-platform application development for Windows, Linux, Mac. keywords: взаимодействия; межкомпонентного cache: mpcs-515.pdf plain text: mpcs-515.txt item: #253 of 341 id: mpcs-516 author: Асатрян, Давид Г. title: Об одном методе пороговой локальной сегментации изображения date: 2021-12-10 words: 287 flesch: 92 summary: 15 Об одном методе пороговой локальной сегментации изображения* * Digital Image Processing. keywords: image; processing; сегментации cache: mpcs-516.pdf plain text: mpcs-516.txt item: #254 of 341 id: mpcs-522 author: Sargsyan, Gohar title: E-Learning Tool and Statistical Analysis of Video Tace Files Over the Network date: 2021-12-10 words: 545 flesch: 52 summary: [5] Sargsyan G. and others, E-Learning Assessment and E-Learning Tools for Armenia needs; , Multidementional Statistical Analysis and Econometrics, Moscow 2004, pp. [3] Sargsyan G., E-Learning Tools Dileco and VLS, New Information Technologies in Education, Collected Scientific Works 2005, pp. 140-144. keywords: learning; sargsyan; system cache: mpcs-522.pdf plain text: mpcs-522.txt item: #255 of 341 id: mpcs-523 author: Петросян, Гоар Р. title: Модифицированные сети Петри, описание поведения с помощью формальных языков date: 2021-12-10 words: 179 flesch: 100 summary: Литература [1] Питерсон Д., “Теория сетей Петри и моделирование систем”. По заданной КС- грамматике (контекстно-свободной грамматике) строится эквивалентная по порождаемому языку модифицированная сеть Петри, являющася расширением стандартной сети Петри с помощью сдерживаюших позиций. keywords: петри; сети cache: mpcs-523.pdf plain text: mpcs-523.txt item: #256 of 341 id: mpcs-524 author: Hayrapetyan, L. title: Operation of alternative combination of processes and its implementation date: 2021-12-10 words: 307 flesch: 63 summary: S. Shoukourian, A. Avagyan, D. Tavangarian, “Combination of separate processes in a distributed environment. An algorithm is proposed that constructs the optimal (by time) combination of given source processes. keywords: combination; processes cache: mpcs-524.pdf plain text: mpcs-524.txt item: #257 of 341 id: mpcs-527 author: Ayvazyan, A. title: Mathematical Model of the Traffic Intensity and of the Quantity of Poisonous Rubbish (On the Example of the Yerevan City) date: 2021-12-10 words: 241 flesch: 83 summary: »ñè»ÏáõÃÛ³Ý ÇÝï»ÝëÇíáõÃÛ³Ý ¨ ¹ñ³ Ñ»ï ϳåí³Í Ãáõݳíáñ ³ñï³Ý»ïáõÙÝ»ñÇ ù³Ý³ÏÇ Ñ³ßí³ñÏÁ ¨ ÑëÏáõÙÁ: àñå»ë »É³Ï»ï³ÛÇÝ ïíÛ³ÉÝ»ñ ÁݹáõÝí³Í ¿ ºñ¨³Ý ù³Õ³ùÇ ïÇ»½»ñ³Ï³Ý ÝϳñÁ, Ùß³Ïí³Í ¿ ѳٳå³ï³ëË³Ý ïíÛ³ÉÝ»ñÇ µ³½³ ¨ Íñ³·ñ³ÛÇÝ ³å³ÑáíáõÙ, áñÇ ÑÇÙ³Ý íñ³ ϳñáÕ ¿ ϳ½Ùí»É ºñ¨³Ý ù³Õ³ùÇ ïñ³Ýëåáñï³ÛÇÝ Ñáëù»ñÇ Í³Ýñ³µ»éÝí³ÍáõÃÛ³Ý Ù³ëݳ·Çï³óí³Í ù³ñ﻽Á: ¶ñ³Ï³ÝáõÃÛáõÝ [1] Ð.ì.سùë³å»ïÛ³Ý, ²íïáÙáµÇÉÇ ï»ËÝÇϳ߳ѳ·áñÍ³Ï³Ý Ñ³ïϳÝÇß- Ý»ñÇ í»ñÉáõÍáõÃÛáõÝ: ºñ¨³Ý, §ÈáõÛë¦, 1989Ã. The corresponding database is created and automatic system is developed in virtue of which the specialized map of the Yerevan City transport streams loading can be formed. keywords: yerevan cache: mpcs-527.pdf plain text: mpcs-527.txt item: #258 of 341 id: mpcs-53 author: Poghosyan, Aghasi S. title: Object Color Estimation with Dominant Color in Automated Image Semantic Description Generation Tasks date: 2021-12-10 words: 2281 flesch: 69 summary: Keywords: Dominant color, Image color palette, Color name selection, Object color detection, Image semantic analysis. To exact color name for each detected object, we will detect the dominant color and then select the correct name for it. keywords: algorithm; color; detection; image; object; ℎ1′ cache: mpcs-53.pdf plain text: mpcs-53.txt item: #259 of 341 id: mpcs-539 author: Haroutunian, Mariam E.; Ter-Vardanyan, Lilit A. title: Information-Theoretic Approach to Biometric Identification Problem date: 2021-12-10 words: 4157 flesch: 109 summary: d e c r e a s e in e r r o r p r o b a b ilit y ( n a m e ly, in u n wa n t o r u s e d t o r e in fo r c e t h e m . keywords: e n; e t cache: mpcs-539.pdf plain text: mpcs-539.txt item: #260 of 341 id: mpcs-54 author: Gevorkyan, Ashot S.; Aleksanyan, Alek A.; Alaverdyan, Suren B. title: On Homeomorphism Between Euclidean Subspace and Conformally Euclidean Manifold date: 2021-12-10 words: 3585 flesch: 74 summary: In particular, it is easy to verify that these A. Gevorkyan, A. Aleksanyan and S. Alaverdyan 105 terms are equal: d 11 = d 2 2 = d 3 3 = 2d 2 10 = 2d 4 11 = 2d 5 12 = 2d 3 13 = 2d 5 14 = 2d 6 15 = 2α1, d 24 = d 4 5 = d 5 6 = 2d 1 10 = 2d 2 11 = 2d 3 12 = 2d 3 16 = 2d 5 17 = 2d 6 18 = 2α2, d 37 = d 5 8 = d 6 9 = 2d 1 13 = 2d 2 14 = 2d 3 15 = 2d 2 16 = 2d 4 17 = 2d 5 18 = 2α3, d 17 = d 2 8 = d 3 9 = 2d 8 10 = 2d 10 11 = 2d 11 12 = 2d 9 13 = 2d 11 14 = 2d 12 15 = 2β1, d 84 = d 10 5 = d 6 11 = 2d 7 10 = 2d 8 11 = 2d 9 12 = 2d 9 16 = 2d 11 17 = 2d 12 18 = 2β2, d 97 = d 11 6 = d 6 12 = 2d 7 13 = 2d 8 14 = 2d 9 15 = 2d 8 16 = 2d 10 17 = 2d 11 18 = 2β3, d 113 = d 2 14 = d 3 15 = 2d 17 10 = 2d 16 11 = 2d 17 12 = 2d 15 13 = 2d 17 14 = 2d 18 15 = 2γ 33ζ1, d144 = d 16 5 = d 6 17 = 2d 13 10 = 2d 14 11 = 2d 15 12 = 2d 13 13 = 2d 14 14 = 2d 15 15 = 2γ 33ζ2, d157 = d 17 8 = d 9 18 = 2d 14 16 = 2d 16 17 = 2d 17 18 = 2d 15 16 = 2d 17 17 = 2d 18 18 = 2γ 33ζ3. = xµ, αxν, β δµν , (6) where xµ, α({ρ}) = ∂xµ/∂ρα and γαβ({ρ}) = γαᾱ({ρ})γββ̄({ρ})γᾱβ̄({ρ}). keywords: equations; m(3; manifold; system cache: mpcs-54.pdf plain text: mpcs-54.txt item: #261 of 341 id: mpcs-541 author: Hormozi, Farshin; Haroutunian, Evgueni title: Many Hypotheses Parallel Distributed Detection of the Pair of Families of Probability Distributions date: 2021-12-10 words: 5120 flesch: 108 summary: e s e s t e s t in g im a l t e s t in keywords: e s; s t; t e; t h cache: mpcs-541.pdf plain text: mpcs-541.txt item: #262 of 341 id: mpcs-546 author: Madoyan, Hakob title: On a Neo-logicistic Conception of Natural Number date: 2021-12-10 words: 222 flesch: 34 summary: In the report we discuss a neo-logicistic conception of natural number formulated by British philosopher Crispin Wright in his book Frege’s Conception of Numbers as Objects (1983). For appropriate understanding of the differences between logicistic and neo-logicistic conceptions of natural numbers, we recall Bertrand Russell’s criticism of formal axiomatic systems containing Peano axioms. keywords: logicistic cache: mpcs-546.pdf plain text: mpcs-546.txt item: #263 of 341 id: mpcs-55 author: Sargsyan, Shushanik A.; Gzoyan, Edita G. title: Computer Science in Transcaucasia and Baltic States: a Comparative Bibliometric Analysis date: 2021-12-10 words: 3031 flesch: 56 summary: International scientific collaboration of Azerbaijan showed a quite different pattern (see Fig. 4). International scientific collaboration of Georgia performed some similarities to Armenia (see Fig. 5). keywords: armenia; azerbaijan; baltic; collaboration; computer; countries; field; publications; science; states cache: mpcs-55.pdf plain text: mpcs-55.txt item: #264 of 341 id: mpcs-550 author: Manukyan, Vardan A. title: On New Algorithm for Channel Routing date: 2021-12-10 words: 270 flesch: 83 summary: Efficient algorithms for channel routing. On New Algorithm for Channel Routing Vardan A. Manukyan Abstract We present new channel routing algorithms that consider the characteristic of net crossings. keywords: channel; routing cache: mpcs-550.pdf plain text: mpcs-550.txt item: #265 of 341 id: mpcs-553 author: Avetisyan, Vahan title: A Rule System for Translation of Universal Networking Language (UNL) Expressions into Armenian date: 2021-12-10 words: 443 flesch: 48 summary: In this paper a system of rules is described for automatic translation (deconversion) of Universal Networking Language (UNL) expressions into Armenian sentences. Armenian Morphology Model for UNL Language Server. keywords: armenian; language; unl cache: mpcs-553.pdf plain text: mpcs-553.txt item: #266 of 341 id: mpcs-555 author: Петросян , Гоар Р. title: Взаимосвязь языков модифицированых сетей Петри с некоторыми классами формальных языков date: 2021-12-10 words: 279 flesch: 104 summary: = {a, b}}, который не является языком сетей Петри, построена модифицированная сеть Петри, для которой L(C) = {R / ,  = {a, b}}. Литература [1] Питерсон Д., “Теория сетей Петри и моделирование систем”. keywords: петри cache: mpcs-555.pdf plain text: mpcs-555.txt item: #267 of 341 id: mpcs-556 author: Manasyan, A. title: The New Method of Multidimensional Sequence Structure Snalysis and Its Implementation in STATISTICA System. date: 2021-12-10 words: 275 flesch: 61 summary: Microsoft Word - DSA.doc Îǵ»éÝ»ïÇϳÛÇ ¨ ѳßíáÕ³Ï³Ý ï»ËÝÇϳÛÇ Ù³Ã»Ù³ïÇÏ³Ï³Ý Ñ³ñó»ñ 25, 2006, 45–52. 45 ´³½Ù³ã³÷ ïíÛ³ÉÝ»ñÇ Ï³éáõóí³ÍùÇ í»ñÉáõÍáõÃÛ³Ý Ýáñ Ù»Ãá¹Á ¨ ¹ñ³ Çñ³Ï³Ý³óáõÙÁ STATISTICA Íñ³·ñ³ß³ñÇ ÙÇç³í³ÛñáõÙ ²ñë»Ý سݳëÛ³Ý Ê. ²µáíÛ³ÝÇ ³Ýí³Ý ºñ¨³ÝÇ å»ï³Ï³Ý Ù³Ýϳí³ñÅ³Ï³Ý Ñ³Ù³Éë³ñ³Ý Ðж²² e-mail arsen.manasyan@gmail.com ²Ù÷á÷áõÙ Ðá¹í³ÍáõÙ ì., ìÇ׳ϳ·ñ³Ï³Ý ÇÝï»ñ³ÏïÇí ·Í³å³ïÏ»ñÝ»ñÇ ·áñÍÁÝóóÇ û·ï³·áñÍٳٵ ïíÛ³ÉÝ»ñÇ Ñ³Ù³ë»éáõÃÛ³Ý keywords: data cache: mpcs-556.pdf plain text: mpcs-556.txt item: #268 of 341 id: mpcs-558 author: Петросян, Григор А. title: Программный пакет генерации целочисленных преобразований date: 2021-12-10 words: 269 flesch: 87 summary: [3] Emmanual C. Ifeachor, “Digital Signal Processing, A Practical Aproach”, Prentice Hall, 2002 Orthogonal Transforms for Digital Signal Processing. keywords: пакет; целочисленных cache: mpcs-558.pdf plain text: mpcs-558.txt item: #269 of 341 id: mpcs-559 author: Karapetyan, David A. title: Intelligent Agent Server (NetInt) System date: 2021-12-10 words: 240 flesch: 50 summary: The paper describes Intelligent Agent Server system, which employs software agents. [2] Michael W. and N. Jennings (1995), Agent Theories, Architectures, and Languages: a Survey, in Wooldridge and Jennings Eds., Intelligent Agents, Berlin: Springer- Verlag, pp. keywords: agents cache: mpcs-559.pdf plain text: mpcs-559.txt item: #270 of 341 id: mpcs-560 author: Хачатрян, Роберт Н. title: Алгоритм обнаружения и локализации утечек газа date: 2021-12-10 words: 280 flesch: 76 summary: [5] Westhoff M.A., “Using Operating Data at Natural Gas Pipelines”, Colorado Interstate Gas Company. [8] Òåõíè÷åñêîå îïèñàíè ñèñòåìû SCADA ÀðìÐîñãàçïðîìà, 2004 keywords: pipelines; утечек cache: mpcs-560.pdf plain text: mpcs-560.txt item: #271 of 341 id: mpcs-573 author: Petrosyan, Gohar title: Modeling FIFO Queues by Dynamic Petri Nets date: 2021-12-10 words: 3673 flesch: 110 summary: e r e a r t e r m in a l p o N0, wh e r e N0 is u s e d t o e n c o d e t h e n u m b e r o f t o ke n s in t h e p o keywords: e n; e t; n t cache: mpcs-573.pdf plain text: mpcs-573.txt item: #272 of 341 id: mpcs-574 author: Pogossian, Edward title: On Models of Meaning Processing date: 2021-12-10 words: 735 flesch: 51 summary: What follows, is an explanation of my understanding of certain meanings tended to provide a theoretically consistent specification of what I mean by “meanings” generally. We, a community, have meanings, and we present them via explanations. keywords: explanations; meanings; models cache: mpcs-574.pdf plain text: mpcs-574.txt item: #273 of 341 id: mpcs-576 author: Sahakyan, H.; Aslanyan, L. title: On Hypergraph Degree Sequence Characterisation date: 2021-12-10 words: 3700 flesch: 111 summary: e s s r e la t e d t o ¯ n d in g e s e t o keywords: e n; e t; s e cache: mpcs-576.pdf plain text: mpcs-576.txt item: #274 of 341 id: mpcs-578 author: Zolfaghari, Pervaneh title: About Order 3 Hypergroups Over Group Which Arisе From Groups of Order 18 date: 2021-12-10 words: 708 flesch: 75 summary: 93 About Order 3 Hypergroups Over Group Which Arisе From Groups of Order 18 Pervaneh Zolfaghari Yerevan State University Each (unitary) hypergroup M over a group H is isomorphic to a hypergroup over group associated with a complementary set M to a subgroup H of a group G. All unitary hypergroups of order 3 over group, associated with the complementary sets to a subgroup of symmetric groups S3 and S4 was described in [1] and [2]. Zolfaghary P., The hypergroups of order 3, arising from symmetric group S3. keywords: group cache: mpcs-578.pdf plain text: mpcs-578.txt item: #275 of 341 id: mpcs-58 author: Mkhitaryan, Andranik E.; Petrosyan, Arthur S.; Nanassian, Aram S. title: Notification Mechanisms by Initiative of E-mail Receiver in Systems Based on E-mail/SMS Technologies date: 2021-12-10 words: 1831 flesch: 61 summary: It’s a common practice for e-mail users to register some list of e-mail addresses to get notified in case someone from that list sends him a message. Many modern mobile devices allow you to get e-mail messages via mobile networks directly to the device. keywords: information; log; mail; server; sms; system cache: mpcs-58.pdf plain text: mpcs-58.txt item: #276 of 341 id: mpcs-59 author: Mkhitaryan, Karen K. title: Community Detection-Based Recommendation Framework date: 2021-12-10 words: 2343 flesch: 60 summary: In this work we propose community detection based recommendation framework which is more reasonable in certain applications compared with traditional recommendation tech- niques. In memory-based or neighborhood-based approach, ratings are predicted by applying similarity measure on user-item rating data, while in model-based approaches machine learning and data mining techniques (e.g., clustering, singular value de- composition, Bayesian networks, etc.) are used to predict users preferences. keywords: approaches; community; detection; filtering; item; recommendation; user cache: mpcs-59.pdf plain text: mpcs-59.txt item: #277 of 341 id: mpcs-593 author: Авагян, А. ; Милетбашян, А. title: О генерации среды фильтрации избыточной информации с использованием шаблонов date: 2021-12-10 words: 302 flesch: 99 summary: 120 О генерации среды фильтрации избыточной информации с использованием шаблонов А. Авагян, А. Милетбашян Ереванский государственный университет, Государственный инженерный университет Армении Àííîòàöèÿ Существующие методы проектирования систем фильтрации избыточности не всегда справляются с интенсивными изменениями форм избыточной информации (спама). А. Авагян и А. Милетбашян 121 keywords: edition; xml cache: mpcs-593.pdf plain text: mpcs-593.txt item: #278 of 341 id: mpcs-594 author: Мкртчян, Карен А. title: О статистическом подходе к обнаружению нарушений в телефонных сетях date: 2021-12-10 words: 245 flesch: 56 summary: Î ñòàòèñòè÷åñêîì ïîäõîäå ê îáíàðóæåíèþ íàðóøåíèé â òåëåôîííûõ ñåòÿõ 126 лé³Ëáë³ÛÇÝ ó³Ýó»ñáõ٠˳ËïáõÙÝ»ñÇ µ³ó³Ñ³ÛïÙ³Ý íÇ׳ϳ·ñ³Ï³Ý ÙÇ Ùáï»óÙ³Ý Ù³ëÇÝ Î. ØÏñïãÛ³Ý ²Ù÷á÷áõÙ Ðá¹í³ÍáõÙ 125 Î ñòàòèñòè÷åñêîì ïîäõîäå ê îáíàðóæåíèþ íàðóøåíèé â òåëåôîííûõ ñåòÿõ Êàðåí À. Ìêðò÷ÿí Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè ÍÀÍ ÐÀ e-mail: kamkrtchyan@ipia.sci.am, kamkrtchyan@yahoo.com Àííîòàöèÿ  ñòàòüå ïðåäëàãàåòñÿ ìåòîä ìîäåëèðîâàíèÿ îáðàçîâ îáúåêòîâ, ïîçâîëÿ þùèé îáíàðóæèâàòü íàðóøåíèÿ â òåëåôîííîé ñåòè, ñ ïðèìåíåíèåì ñòàòèñòè÷åñêîãî àíàëèçà. keywords: detection; fraud cache: mpcs-594.pdf plain text: mpcs-594.txt item: #279 of 341 id: mpcs-596 author: Варданян, Сейран М. title: Распознавание по пересечениям множеств date: 2021-12-10 words: 114 flesch: 109 summary: ì³ñ¹³ÝÛ³Ý ²Ù÷á÷áõÙ Ðá¹í³ÍáõÙ ¹Çï³ñÏíáõÙ ¿ ׳ݳãÙ³Ý ËݹÇñ Áëï µ³½ÙáõÃÛáõÝÝ»ñÇ Ñ³ïáõÙÝ»ñÇ: òáõÛó ¿ ïñíáõÙ áñáß ×³Ý³ãáÕ Ñ³Ù³Ï³ñ·»ñÇ ÙÇÝÇÙ³ÉáõÃÛáõÝÁ ¨ ÷³ÏáõÕ³ÛÝáõÃÛáõÝÁ: 144 Ðàñïîçíàâàíèå ïî ïåðåñå÷åíèÿì ìíîæåñòâ Ñåéðàí Ì. Âàðäàíÿí Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè ÍÀÍ ÐÀ e-mail seyranv@ipia.sci.am Àííîòàöèÿ  ñòàòüå ðàññìàòðèâà þòñÿ çàäà÷è ðàñïîçíàâàíèÿ ïî ïåðåñå÷åíèÿì ìíîæåñòâ è äîêàçûâàåòñÿ ìèíèìàëüíîñòü è òóïèêîâîñòü íåêîòîðûõ ñèñòåì. keywords: ìíîæåñòâ cache: mpcs-596.pdf plain text: mpcs-596.txt item: #280 of 341 id: mpcs-597 author: Григорян, Мигран С. title: Некоторые методы сжатия данных и их индексов в СУБД date: 2021-12-10 words: 413 flesch: 75 summary: IEEE Data Compression Conference, p. 519, 1999. [9] Iyer B. R. and Wilhite D. Data Compression Support in Databases. keywords: compression; data; proc cache: mpcs-597.pdf plain text: mpcs-597.txt item: #281 of 341 id: mpcs-60 author: Asryan, Seryozha A. title: Feedback Driven Grammar-Based Fuzzing date: 2021-12-10 words: 3524 flesch: 60 summary: The paper [11] describes a learn&fuzz algorithm that uses sample inputs and neural-network-based statistical machine-learning techniques to automatically generate input grammars for grammar-based fuzzing. It takes two main parameters as input – depth (D) for each rule (that is, the maximum number of recursive selection); length (L) of generated input. keywords: bnf; coverage; data; fuzzing; generation; grammar; information; input; method; program; rule; set; test cache: mpcs-60.pdf plain text: mpcs-60.txt item: #282 of 341 id: mpcs-605 author: Asatryan, Armen J. title: Consistency Management in Database Systems: Review date: 2004-05-26 words: 3606 flesch: 103 summary: e s e m a n t Th e o r e m P r o vin g , S p r in g e r V e r la g , 1 9 9 0 . keywords: t e cache: mpcs-605.pdf plain text: mpcs-605.txt item: #283 of 341 id: mpcs-61 author: Mkhitaryan, Andranik E.; Petrosyan, Arthur S.; Nanassian, Aram S. title: Use of Info-Communicational Resources in Software Systems date: 2021-12-10 words: 1810 flesch: 57 summary: Abstract The use of info-communicational resources in software systems is considered. 1. Introduction Nowadays, the creation of software systems considers the use of many different independent modules. keywords: mail; module; sms; software; systems; unimail cache: mpcs-61.pdf plain text: mpcs-61.txt item: #284 of 341 id: mpcs-614 author: Саакян, Мушег С. title: Об одном методе прогнозирования динамики ценных бумаг date: 2021-12-10 words: 141 flesch: 104 summary: ê³Ñ³ÏÛ³Ý ²Ù÷á÷áõÙ Ðá¹í³ÍáõÙ Ý»ñϳ۳óí³Í »Ý ³ñÅ»ÃÕûñÇ ¹ÇݳÙÇϳÛÇ Ï³Ý˳·áõß³ÏÙ³Ý ÙÇ Ù»Ãá¹ ¨ ¹ñ³ Íñ³·ñ³ÛÇÝ Çñ³·áñÍÙ³Ý ÷áñÓ³ñÏáõÙÝ»ñÇ ³ñ¹ÛáõÝùÝ»ñÁ: 2. Êîêñ Ä. Ð., Îêóñ Ä. Àíàëèç äàííûõ òèïà âðåìåíè æèçíè. keywords: динамики cache: mpcs-614.pdf plain text: mpcs-614.txt item: #285 of 341 id: mpcs-615 author: Гюрджян, Микаел К. title: Система управления заданиями на многомашинном вычислительном комплексе date: 2021-12-10 words: 418 flesch: 88 summary: Микаел К. Гюрджян Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè ÍÀÍ ÐÀ Àííîòàöèÿ Для эффективной организации высокопроизводительных кластерных вычислений разработана программная система для управления заданиями на многомашинном вычислительном комплексе(кластере). «MPICH–Portable Implementation of MPI» http://www-unix.mcs.anl.gov/mpi/mpich/ 7. keywords: ñ³ßíáõ³ï³ý; заданиями; системы; управления cache: mpcs-615.pdf plain text: mpcs-615.txt item: #286 of 341 id: mpcs-616 author: Нанасян, А.; Петросян, Д.; Тадевосян, Д. title: T-mail- телефонная голосовая почта в Интернет date: 2021-12-10 words: 109 flesch: 109 summary: ä»ïñáëÛ³Ý ¨ ¸. ³¹¨áëÛ³Ý ²Ù÷á÷áõÙ Ü»ñϳ۳óí³Í »Ý ÇÝï»ñÝ»ïáõÙ Ó³ÛݳÛÇÝ Ñ»é³Ëáë³ÛÇÝ ÷áëï³ÛÇÝ Ñ³Ù³Ï³ñ·Ç ϳéáõóÙ³Ý ÑÇÙÝ³Ï³Ý ëϽµáõÝùÝ»ñÁ: Microsoft Word - tmail1.doc Ìàòåìàòè÷åñêèå âîïðîñû êèáåðíåòèêè è âû÷èñëèòåëüíîé òåõíèêè 23, 2004, 163–165. 163 T-mail- телефонная голосовая почта в Интернет А. Нанасян, Д. Петросян è Д.Тадевосян Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè ÍÀÍ ÐÀ e-mail ananas@sci.am Àííîòàöèÿ Приводятся основные принципы построения голосовой телефонной почтовой системы в Интернет – t-mail, позволяющей обмен голосовыми письмами между телефонными абонентами АТС и пользователями e-mail. keywords: mail cache: mpcs-616.pdf plain text: mpcs-616.txt item: #287 of 341 id: mpcs-617 author: Гюрджян, Микаел К.; Саакян, Владимир Г. title: Mоделированиe очереди многомашинного вычислительного комплекса date: 2021-12-10 words: 207 flesch: 103 summary: В данной работе рассматривается некоторый набор параметров, позволяющий составить рекуррентную систему уравнений и Работа выполнена в рамках работ по проекту МНТЦ А-823 Микаел К. Гюрджян и Владимир Г. Саакян Èíñòèòóò ïðîáëåì èíôîðìàòèêè keywords: очереди cache: mpcs-617.pdf plain text: mpcs-617.txt item: #288 of 341 id: mpcs-618 author: Петросян, Давид title: Особенности построения диалоговых систем в комплексах компьютерной телефонии date: 2021-12-10 words: 69 flesch: 87 summary: ä»ïñáëÛ³Ý ²Ù÷á÷áõÙ øÝݳñÏíáõÙ »Ý ÏáÙåÛáõÝ»ñ³ÛÇÝ Ñ»é³Ëáë³Ï³åÇ »ñÏËáë³Ïó³Ï³Ý ѳٳϳñ·»ñÇ ûåïÇÙ³É Ï³éáõóÙ³Ý Ñݳñ³íáñ ëϽµáõÝùÝ»ñÁ ¨ ϳéáõóí³ÍùÝ»ñÁ: Microsoft Word - Pertosian.doc Ìàòåìàòè÷åñêèå âîïðîñû êèáåðíåòèêè è âû÷èñëèòåëüíîé òåõíèêè 23, 2004, 175–177. 175 Особенности построения диалоговых систем в комплексах компьютерной телефонии Давид Петросян Èíñòèòóò ïðîáëåì èíôîðìàòèêè è àâòîìàòèçàöèè ÍÀÍ ÐÀ Àííîòàöèÿ Обсуждаются возможные принципы и механизмы оптимального построения диалоговых систем компьютерной телефонии. keywords: диалоговых cache: mpcs-618.pdf plain text: mpcs-618.txt item: #289 of 341 id: mpcs-62 author: Grigoryan, Davit A. title: On Church-Rosser Property of Notion of βδ-Reduction for Canonical Notion of δ-Reduction date: 2021-12-10 words: 6952 flesch: 107 summary: t h e r e e xis t t e r m s t01; t 0 2 2 ¯ ¡ NF s a ¯-r e d e x, it s c o n vo lu t io n is t h e t e r m ¿ keywords: e e; e n; e t; h e; n o; n t; o t; r e; s e; t h; t t cache: mpcs-62.pdf plain text: mpcs-62.txt item: #290 of 341 id: mpcs-63 author: Hovsepyan, Levon M.; Mayilyan, Aren K. title: Secure Storage Implementation for Large Files in iOS Environment date: 2021-12-10 words: 2376 flesch: 58 summary: Particularly for iOS platform, the most common solutions for storing data are Core Data and Keychain. The overall process of file encryption is presented in Figure 3. https://www.cisco.com/c/en/us/about/press/internet-protocol-journal/back-issues/table-contents-21/code-signing.html https://www.researchgate.net/publication/261199437_Reverse_Engineering_iOS_Mobile_Applications https://www.researchgate.net/publication/220905226_On_The_Security_of_Key_Derivation_Functions https://dl.acm.org/citation.cfm?id=312213 https://github.com/RNCryptor/RNCryptor https://www.researchgate.net/lite.publication.PublicationDownloadCitationModal.downloadCitation.html?file-type-radio=RIS&citation-radio=citation&publicationUid=316263841 Secure Storage Implementation for Large Files in iOS Environment 92 Fig. keywords: algorithm; approach; data; device; encryption; files; ios; key; keychain; storage cache: mpcs-63.pdf plain text: mpcs-63.txt item: #291 of 341 id: mpcs-630 author: Babayan, Armen V. title: BIST Architecture for Magnetic Memories date: 2021-12-10 words: 1846 flesch: 69 summary: Keywords: Memory BIST, Memory testing, Magnetic memory, Emerging mem- ory, System on Chip. Trim Controller Executes search algorithms to find reference values for MRAM memories for efficient testing. keywords: bist; faults; memories; memory; mram; mtj; test cache: mpcs-630.pdf plain text: mpcs-630.txt item: #292 of 341 id: mpcs-64 author: Grigoryan, Sedrak V.; Hakobyan, Nairi P. title: Experimenting with Acquisition of and Matching to Systemic Classifiers date: 2021-12-10 words: 3157 flesch: 51 summary: Chess and chess-like games, network intrusion protection, management in oligopoly competition are considered as RGT class problems. We have a natural language, its description, we want to make the characteristics of a natural language that will be adequate and constructive to language classifiers. keywords: acquisition; algorithms; check; chess; classifiers; field; king; matching cache: mpcs-64.pdf plain text: mpcs-64.txt item: #293 of 341 id: mpcs-648 author: Darbinyan, Samvel Kh. title: A Theorem on Even Pancyclic Bipartite Digraphs date: 2021-12-16 words: 9873 flesch: 91 summary: Definition 1: For any integers n and m, (n + 1)/2 < m ≤ n − 1, let Φmn denote the set of digraphs D, which satisfy the following conditions: (i) V (D) = {x1, x2, . . . An analogue of Meyniel’s theorem for the hamiltonicity of balanced bipartite digraphs was given by Adamus et al. keywords: a(d; digraph cache: mpcs-648.pdf plain text: mpcs-648.txt item: #294 of 341 id: mpcs-649 author: Smbatyan, Khachik S. title: Some Results on Palette Index of Cartesian Product Graphs date: 2021-12-16 words: 4427 flesch: 84 summary: UDC 519.1 Some Results on Palette Index of Cartesian Product Graphs Khachik S. Smbatyan Abstract Given a proper edge coloring α of a graph G, we define the palette SG(v, α) of a vertex v ∈ V (G) as the set of all colors appearing on edges incident to v. The palette index š(G) of G is the minimum number of distinct palettes occurring in a proper edge coloring of G. The windmill graph Wd(n, k) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kk at a shared universal vertex. Proper edge colorings with the minimum number of distinct palettes were studied for the first time in 2014, by Horňák, 26 Yerevan State University e-mail: smbatyan1729@gmail.com K. Smbatyan 27 Kalinowski, Meszka, and Woźniak keywords: coloring; graph; index; palette cache: mpcs-649.pdf plain text: mpcs-649.txt item: #295 of 341 id: mpcs-65 author: Vardanyan, Artur P. title: Improved Model of Scheduling Algorithm date: 2021-12-10 words: 2689 flesch: 105 summary: Ta s k's r e s o u r c e u t iliz a t io n p a r a m e t e r is t h e n u m we h a ve a qu e u e , in wh ic h t h e r e keywords: t e cache: mpcs-65.pdf plain text: mpcs-65.txt item: #296 of 341 id: mpcs-650 author: Haroutunian, Mariam E.; Mastoyan, Karen A. title: The Role of Information Theory in the Field of Big Data Privacy date: 2021-12-16 words: 4154 flesch: 62 summary: A number of privacy preserving mechanisms have been developed [1], [2], however, the study on Big Data privacy issues are at a very early stage An organization seeking to exchange sensitive data should consider the logistics issues involved in the exchange process and carefully balance the confidentiality and usefulness of the published data. keywords: anonymity; data; distortion; doi; information; methods; model; noise; privacy; theory cache: mpcs-650.pdf plain text: mpcs-650.txt item: #297 of 341 id: mpcs-654 author: Shoyan, Misak T.; Hakobyan, Robert G.; Shoyan, Mekhak T. title: Application of Deep Learning-Based Methods to the Single Image Non-Uniform Blind Motion Deblurring Problem date: 2021-12-16 words: 3322 flesch: 57 summary: [9], etc. Image deblurring methods are also categorized as deep learning-based (DL) and non-deep learning-based (non-DL) or optimization-based methods. There are some traditional methods such as Wiener deconvolution [1] which is expressed as 𝐺(𝑓) = 𝐻 ∗(𝑓) 𝑆(𝑓) |𝐻(𝑓)|2 𝑆(𝑓)+ 𝑁(𝑓) , (2) where 𝑓 is the frequency in the frequency domain, 𝐺 is the Fourier transform of the estimated kernel, which then is convolved with the blurry image to estimate the latent sharp image, 𝐻 is the Fourier transform of the blur kernel, 𝑁 and 𝑆 are the mean power spectral density of the noise and latent sharp image respectively, ∗ denotes the complex conjugation. keywords: deblurring; image; kernel; learning; methods; motion; networks; problem cache: mpcs-654.pdf plain text: mpcs-654.txt item: #298 of 341 id: mpcs-655 author: Mayilyan, Aren K. title: Designing and Implementing a Method of Data Augmentation Using Machine Learning date: 2021-12-16 words: 2832 flesch: 60 summary: This means that the online augmentation will see different images at each epoch. In our case by generating new images using GAN, we can turn an image with 2nd degree burn into a 3rd degree burn image and decrease the accuracy of the CNN model. keywords: augmentation; case; cnn; data; dataset; degrees; images; model; training cache: mpcs-655.pdf plain text: mpcs-655.txt item: #299 of 341 id: mpcs-656 author: Mkrtchyan, Susanna M. title: Education Through Wikipedia date: 2021-12-16 words: 2456 flesch: 48 summary: During creating or developing Wikipedia articles, one studies the subject deeply and learns continuously to describe thoughts even better. Wiki Education, which supports the Wikipedia Education Process runs a program in which university instructors assign articles to their students on specific topics to add on Wikipedia [4]. keywords: armenia; ecosystem; education; knowledge; learning; projects; students; teachers; wikipedia cache: mpcs-656.pdf plain text: mpcs-656.txt item: #300 of 341 id: mpcs-658 author: Council, Editorial title: Professor Evgueni A. Haroutunian date: 2021-12-16 words: 256 flesch: 37 summary: Professor Evgueni A. Haroutunian, a recognized scientist and respected teacher, Chief Researcher of the Institute for Informatics and Automation Problems of the NAS of RA, Founder of the Scientific School of Information Theory in Armenia, was the Deputy Editor of Transactions of IIAP NAS RA “Mathematical Problems of Computer Science” for many years. Professor Haroutunian achieved great scientific achievements during his long and fruitful activity. keywords: haroutunian cache: mpcs-658.pdf plain text: mpcs-658.txt item: #301 of 341 id: mpcs-66 author: Mayilyan, Aren K.; Hovsepyan, Levon M. title: Research and Comparative Analysis of Build Technology Programming in Java date: 2021-12-10 words: 1274 flesch: 63 summary: [4]: So, let’s make a comparative analysis of the build tools described above and summarize in Table 1. Table 1: Comparative analysis of build tools. Comparison parameters Build tools Apache Ant Apache Maven Gradle Initial learning curve Learning is not hard, it takes a long time for the practical works done for build tools, dependency and XML. keywords: build; gradle; maven; tests; tools cache: mpcs-66.pdf plain text: mpcs-66.txt item: #302 of 341 id: mpcs-67 author: Galstyan, Tigran M. title: Performance Analysis of Matrix Multiplication Algorithms Using MPI and OpenMP date: 2021-12-10 words: 1842 flesch: 52 summary: MPI համադրությունը ծրագրավորման մեջ անվանում են հիբրիդային ծրագրավորում։ Հիբրիդային ծրագրավորումը ( հաղորդագրությունների և ընդհանուր հիշողությունների միջոցով) ձեռք է բերել մեծ համբավ կլաստերային ճարտարապետության հայտնվելուց հետո։ Հիբրիդային ծրագրավորումը միավորում է OpenMP և MPI գրադարանները բազմամիջուկային ճարտարապետություններում https://www.amazon.co.uk/Parallel-Programming-C-MPI-OpenMP/dp/0072822562 https://www.amazon.co.uk/Parallel-Programming-C-MPI-OpenMP/dp/0072822562 https://www.amazon.co.uk/Parallel-Programming-C-MPI-OpenMP/dp/0072822562 https://www.open-mpi.org/ https://www.open-mpi.org/ https://www.open-mpi.org/ https://www.open-mpi.org/ https://www.openmp.org/ https://www.openmp.org/ https://en.wikipedia.org/wiki/Message_Passing_Interface https://en.wikipedia.org/wiki/Message_Passing_Interface https://en.wikipedia.org/wiki/OpenMP https://en.wikipedia.org/wiki/OpenMP http://pages.tacc.utexas.edu/%7Eeijkhout/pcse/html/mpi-topo.html http://pages.tacc.utexas.edu/%7Eeijkhout/pcse/html/mpi-topo.html http://pages.tacc.utexas.edu/%7Eeijkhout/pcse/html/mpi-topo.html http://pages.tacc.utexas.edu/%7Eeijkhout/pcse/html/mpi-topo.html http://pages.tacc.utexas.edu/%7Eeijkhout/pcse/html/mpi-topo.html Performance Analysis of Matrix Multiplication Algorithms Using MPI and OpenMP 118 օգտագործելու համար։Այս աշխատանքի նպատակն է դուրս բերել մատրիցների բազմապատկման արտադրողականության վերլուծությունը կլաստերային համակարգում։ Յուրաքանչյուր հանգույց կլաստերում կազմված է Performance Analysis of Matrix Multiplication Algorithms Using MPI and OpenMP Tigran M. Galstyan Institute for Informatics and Automation Problems of NAS RA e-mail: tig.galstyan.96@gmail.com keywords: algorithms; hybrid; matrix; mpi; multiplication; openmp cache: mpcs-67.pdf plain text: mpcs-67.txt item: #303 of 341 id: mpcs-68 author: Gharibyan, Aram H .; Petrosyan, Petros A. title: On Locally-Balanced 2-Partitions of Complete Multipartite Graphs date: 2021-12-10 words: 10110 flesch: 108 summary: In [1 ], B e r g e o b t a in e d s o m e s u ± c ie n t c o n d it io n s fo r t h e e xis t e n c e o f e qu it a b le c o lo r in g it io n s fo r t h e e xis t e n c e o f lo keywords: e n; e t; n t; o n; r e; r t; s e; t h; t t cache: mpcs-68.pdf plain text: mpcs-68.txt item: #304 of 341 id: mpcs-697 author: Harutyunyan, Gurgen E.; Shoukourian, Samvel K.; Tshagharyan, Grigor A.; Zorian, Yervant A. title: Functional Safety Compliant Test & Repair Framework for System-on-Chip Lifecycle Management date: 2021-12-14 words: 5161 flesch: 55 summary: Periodic test in the field: blue-colored blocks are in idle state, green-colored blocks are in mission and orange-colored blocks are in test mode. In the second scenario, the memory blocks M1, M2, M8, M9, and M12 are in mission mode while M3, M5, M10, M14 and M16 are in test mode. keywords: asil; automotive; bist; faults; field; memory; mission; mode; production; repair; requirements; safety; system; test; testing; time cache: mpcs-697.pdf plain text: mpcs-697.txt item: #305 of 341 id: mpcs-699 author: Shoyan, Misak T. title: Single Image Joint Motion Deblurring and Super-Resolution Using the Multi-Scale Channel Attention Modules date: 2021-12-14 words: 7589 flesch: 57 summary: Therefore, upscaling LR images with the SR technique will cause distorted HR results. In this work, the problem of restoring the HR sharp image from a given motion blurry LR image is addressed. keywords: attention; blurry; channel; deblurring; et al; features; image; method; module; motion; network; resolution; super; training cache: mpcs-699.pdf plain text: mpcs-699.txt item: #306 of 341 id: mpcs-700 author: Tumanyan, Narek T. title: Deep Learning Approaches for Voice Emotion Recognition Using Sentiment-Arousal Space date: 2021-12-14 words: 4345 flesch: 66 summary: L e r e r , J. B r a d b u r y,G. Ch a n a n , T. K ille e n , Z. L in , N . 3.2 Technical Details For the extraction of audio signal features described in section 3.1, we use the “librosa“ library for python keywords: arousal; emotion; fig; frequency; recognition; sentiment; signal; space; voice cache: mpcs-700.pdf plain text: mpcs-700.txt item: #307 of 341 id: mpcs-702 author: Kostanyan, Armen H. title: Determining the Degree of Fuzzy Regularity of a String date: 2021-12-14 words: 3172 flesch: 69 summary: The investigation on fuzzy regularity of a string that we propose in this paper continues our previous research in the field of fuzzy string matching [7] A. Kostanyan, Fuzzy string matching with finite automata, Proc. on 2017 IEEE Con- ference CSIT-2017, Yerevan, Armenia, pp. 25-29. keywords: automaton; degree; matching; pattern; regularity; string cache: mpcs-702.pdf plain text: mpcs-702.txt item: #308 of 341 id: mpcs-703 author: Altunyan, Vahagn N.; Petrosyan, Garik V. title: On Proof Complexity of Some Type of Tautologies date: 2021-12-14 words: 3494 flesch: 82 summary: By deduction theorem the proof of the above formula is equivalent to the following proof: d2, ..., dm, (d1 ∧ d11 ∧ ... ∧ d 1 m1 ∨ Repeating this process, the proof of A will be reduced to the proof of the following formula: T1 ∧ T2 ∧ ... ∧ Tn ⊃ c1, where Ti(1 ≤ i ≤ n) are sat formulas and c1 is a literal. keywords: formula; proof cache: mpcs-703.pdf plain text: mpcs-703.txt item: #309 of 341 id: mpcs-73 author: Sergoyan, Henrik T. title: Estimating Time of Driver Arrival with Gradient Boosting Algorithms and Deep Neural Networks date: 2021-12-10 words: 3331 flesch: 60 summary: Thus, while OSRM exhibits errors of 205.796 seconds and 205.787 seconds for 36 Estimating Time of Driver Arrival with Gradient Boosting Algorithms and Deep Neural Networks test and train data respectively, CatBoost model exhibits errors of 92.34 and 94.97 seconds on train and test data respectively. Some urban areas currently use datasets that include information concerning GPS coordinates of origins and destinations, travel time, travel distance, pickup date, trip start-end times and the total fare to organize the road management. keywords: algorithms; boosting; catboost; data; networks; neural; osrm; paper; time; travel; xgboost cache: mpcs-73.pdf plain text: mpcs-73.txt item: #310 of 341 id: mpcs-730 author: Tumanyan, Narek T. title: Emotion Classification of Voice Recordings Using Deep Learning date: 2022-06-01 words: 3978 flesch: 69 summary: Abstract In this work, we present methods for voice emotion classification using deep learning techniques. Formally, given some representation X of voice recording data and a set of n emotion labels/classes {y1, y2, ..., yn}, the aim is to come up with a classifier F(X) keywords: classification; emotion; learning; processing; recordings; signal; speech; voice cache: mpcs-730.pdf plain text: mpcs-730.txt item: #311 of 341 id: mpcs-731 author: Ayunts, Hrach Y.; Agaian, Sos S. title: A New Image Decolorization Evaluation Quality Metric date: 2022-06-01 words: 3854 flesch: 62 summary: This paper proposes a new quality metric to evaluate image decolorization methods. The overall purpose of image decolorization is to preserve the visible color contrast, which usually suffers from information loss. keywords: conversion; decolorization; grayscale; image; methods; metric; new; quality; score; tis cache: mpcs-731.pdf plain text: mpcs-731.txt item: #312 of 341 id: mpcs-733 author: Avetisyan, Arman A. title: Electronic Voting System Essentials and Problems date: 2022-06-01 words: 2598 flesch: 56 summary: The study distinguishes the standard functionality of e-voting systems. This study proposes a baseline system architecture based on e-voting systems and protocols used nowadays, as well as their known vulnerabilities. keywords: data; security; server; systems; vote; voting cache: mpcs-733.pdf plain text: mpcs-733.txt item: #313 of 341 id: mpcs-753 author: Hakopian, Yuri R.; Manukyan, Avetik H. title: Analytical Inversion of Tridiagonal Hermitian Matrices date: 2022-12-01 words: 4303 flesch: 88 summary: j − 1, δj = t µjνj−1 + fj(tµjνj) + gj(tµj+1νj), z (j) i = t(µi−1 + fiµi + giµi+1)νj, j + 1 ≤ i −i 2   , the expressions (48) take the following form: xij =   (−1)j (n − j + 1)i n + 1 ii+j, i = 1, 2, . . keywords: hermitian; matrices; matrix cache: mpcs-753.pdf plain text: mpcs-753.txt item: #314 of 341 id: mpcs-754 author: Darbinyan, Samvel Kh. title: On an Extension of the Ghouila-Houri Theorem date: 2022-12-01 words: 6943 flesch: 93 summary: Therefore, D − xl is not strong, which contradicts that D is 2-strong. , xm}) = ∅, which in turn implies that D − xl+1 is not strong, a contradiction. keywords: digraph cache: mpcs-754.pdf plain text: mpcs-754.txt item: #315 of 341 id: mpcs-755 author: Adamyan, Garik L. title: Comparison of Model-Free Algorithms For Clustering GARCH Processes date: 2022-12-01 words: 3799 flesch: 65 summary: In particular, scholars discussed the difference between stationary and non-stationary time series [10], the presence of noise in time series samples [11], the presence of noise clusters in time series dataset [11]. Among the works that compare time series clustering models based on real-world datasets, we can mention ([4], [5], [6]) works. keywords: clustering; clusters; data; experiment; garch; means; model; series; time cache: mpcs-755.pdf plain text: mpcs-755.txt item: #316 of 341 id: mpcs-756 author: Bezirganyan, Grigor V.; Sergoyan, Henrik T. title: A Brief Comparison Between White Box, Targeted Adversarial Attacks in Deep Neural Networks date: 2022-12-01 words: 3653 flesch: 60 summary: This is why adversarial attacks make deep neural networks less reliable to be used in safety-critical areas. In this paper, we review four white box, targeted adversarial attacks, and compare them in terms of their misclassification rate, targeted misclassification rate, attack duration, and imperceptibility. keywords: attacker; attacks; autopgd; box; fgsm; image; misclassification; model; pgd cache: mpcs-756.pdf plain text: mpcs-756.txt item: #317 of 341 id: mpcs-757 author: Grigoryan, Sedrak V.; Pogossian, Edward M. title: Developing Aerial Unmanned Effective Decision Makers date: 2022-12-01 words: 3307 flesch: 57 summary: In it was shown that RGT problems are reducible to each other, particularly, to some standard kernel RGT problem K, say, chess, thus, we get an opportunity to integrate the best-known achievements in solving particular RGT problems into RGT Solvers letting us to apply those achievements to any of RGT problem [1]. We made S. Grigoryan and E. Pogossian 55 a grouping of some classes of influential for game G units into one class, later to be classified as the same. keywords: decision; detection; images; knowledge; problems; rgt; situations; solutions; target; uav; units cache: mpcs-757.pdf plain text: mpcs-757.txt item: #318 of 341 id: mpcs-758 author: Chubaryan, Anahit A. title: Proof Complexity of Hard-Determinable Balanced Tautologies in Frege Systems date: 2022-12-01 words: 2213 flesch: 62 summary: References [1] S. A. Cook and A. R. Reckhow, “The relative efficiency of propositional proof systems,” J. Symbolic Logic, vol. Keywords: Hard-determinable tautologies, Balanced tautologies, Frege systems, Proof complexity characteristics. keywords: determinable; frege; proof; systems; tautologies cache: mpcs-758.pdf plain text: mpcs-758.txt item: #319 of 341 id: mpcs-759 author: Jamgharyan, Timur V. title: Research of Obfuscated Malware with a Capsule Neural Network date: 2022-12-01 words: 6450 flesch: 61 summary: Steps 1, 2: input of the initial malware dataset into the trained neural networks and the conversion module, Step 3: converting the source dataset to javascript object notation (JSON) format and setting the CTPH step size, Step 4: calculation of the edit distance by the Levenshtein method, Step 5: computation CTPH using ssdeep software, Step 6: comparison of the values calculated by the Levenshtein method and using the ssdeep software, Step 7:filtering the training datasets of neural networks from «noise» (the full implementation of this part of the algorithm is presented in [33]), Step 8: training capsular neural network, Step 9 training convolutional neural network, Step 10 compute the Matthews correlation and resize the training datasets. 6 shows a report from the virustotal service when examining one of the mimikatz malware samples detected by neural networks. keywords: bytes; capsule; code; ctph; detection; ii iii; iii; learning; malware; network; neural; results; samples; software; source; training cache: mpcs-759.pdf plain text: mpcs-759.txt item: #320 of 341 id: mpcs-760 author: Hovhannisyan, Arman A. title: Data Processing and Persistence in Virtual Reality Systems date: 2022-12-01 words: 1378 flesch: 65 summary: Additionally, data types provided by the Unity Engine were reviewed. There are several methods of managing data storage, including SQL database, PlayerPrefs and OS File System. keywords: data; engine; fig; file; system; unity cache: mpcs-760.pdf plain text: mpcs-760.txt item: #321 of 341 id: mpcs-761 author: Manasyan, Arusyak D. title: Network Management Automation Through Virtualization date: 2022-12-01 words: 2505 flesch: 45 summary: To do this, it is necessary to obtain a large number of network devices that will be of a high quality, and have great features, such as a large amount of memory, many interfaces, and powerful processors, and all this is associated with high costs, which is one of the main prerequisites for the emergence automation and virtualization concepts. That is why a study of network automation and virtualization was carried out, their current applications were discussed and solutions to existing problems were proposed. keywords: automation; control; devices; management; network; openflow; sdn; software; virtualization cache: mpcs-761.pdf plain text: mpcs-761.txt item: #322 of 341 id: mpcs-78 author: Koulakzian, Mossine S.; Nikoghosyan, Zhora G. title: Two Generalized Lower Bounds for the Circumference date: 2021-12-10 words: 5273 flesch: 108 summary: S p e c ia l D e ¯ n it io n s Fo r t h e r e m a in d e r o f t h is s e c t io n , le t a s u b g r Cla im 1 in Th e o r e m 1 . keywords: e n cache: mpcs-78.pdf plain text: mpcs-78.txt item: #323 of 341 id: mpcs-784 author: Nikoghosyan, Zhora G. title: A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung date: 2023-05-31 words: 4011 flesch: 90 summary: Keywords: Hamilton cycle, Dominating cycle, Longest cycle, Large cycle. G. Nikoghosyan, “Cycle-Extensions and long cycles in graphs”, Transactions of the Institute for Informatics and Automation Problems (IIAP) of NAS of RA, Mathematical Problems of Computer Science, vol. 21, pp. keywords: cycle; δ − cache: mpcs-784.pdf plain text: mpcs-784.txt item: #324 of 341 id: mpcs-785 author: Aslanyan, Levon H.; Arsenyan, Irina A.; Karakhanyan, Vilik M.; Sahakyan, Hasmik A. title: RDNF Oriented Analytics to Random Boolean Functions date: 2023-05-31 words: 4717 flesch: 65 summary: In fact, these considera- tions are not only general tools of minimization investigations of Boolean functions, but they also prove useful structures, models, and analytics for constraint logic program- ming, machine learning, decision policy optimization and other domains of computer science. Keywords: Boolean function, Hypercube, Complexity, Asymptotic, Reduced disjunc- tive normal form. keywords: boolean; form; functions; intervals; number; values; vol cache: mpcs-785.pdf plain text: mpcs-785.txt item: #325 of 341 id: mpcs-786 author: Tamazyan, Hakob A. title: The Relationship Between the Proof Complexities of Linear Proofs in Quantified Sequent Calculus and Substitution Frege Systems date: 2023-05-31 words: 3306 flesch: 71 summary: References [1] S. A. Cook and A. R. Reckhow, “The relative efficiency of propositional proof systems”, Symbolic Logic, vol. A hierarchy of proof systems has been established based on two complexity measures (size and lines), and the relationships between these systems are being explored. keywords: linear; lines; proof; rule cache: mpcs-786.pdf plain text: mpcs-786.txt item: #326 of 341 id: mpcs-787 author: Lalayan, Arthur G. title: Data Compression-Aware Performance Analysis of Dask and Spark for Earth Observation Data Processing date: 2023-05-31 words: 4013 flesch: 63 summary: In conclusion, data compression methods can effectively reduce the amount of EO data stored and improve processing performance. The Zstandard compression method combined with the Dask environment offers benefits such as improved data storage efficiency and EO data processing time. keywords: compression; dask; data; earth; method; performance; processing; satellite; spark; storage; vol; zstandard cache: mpcs-787.pdf plain text: mpcs-787.txt item: #327 of 341 id: mpcs-788 author: Buniatyan, Mane P.; Grigoryan, Sedrak V.; Danielyan, Emma H. title: Expert Knowledge-Based RGT Solvers for Software Testing date: 2023-05-31 words: 4568 flesch: 63 summary: [2]. RGT Solver is a software that acquires expert knowledge and elaborates effective strate- gies for RGT problems [2]. It acquires expert knowledge and elaborates effective strategies for RGT problems [2]. keywords: actions; case; checklist; class; elementary; expert; knowledge; operation; problems; program; rgt; software; solver; testing cache: mpcs-788.pdf plain text: mpcs-788.txt item: #328 of 341 id: mpcs-789 author: Karamyan, Davit S.; Kirakosyan, Grigor A.; Harutyunyan, Saten A. title: Making Speaker Diarization System Noise Tolerant date: 2023-05-31 words: 4821 flesch: 53 summary: These datasets have pre-defined development and test sets, which allow for an objective and consistent evaluation of speaker recognition models. doi: 10.51408/1963-0102 UDC 004.934 Making Speaker Diarization System Noise Tolerant Davit S. Karamyan1,2, Grigor A. Kirakosyan2,3 and Saten A. Harutyunyan2 1Russian-Armenian University, Yerevan, Armenia 2Krisp.ai, Yerevan 3Institute of Mathematics of NAS RA, Yerevan, Armenia e-mail: {dkaramyan, gkirakosyan, sharutyunyan }@krisp.ai Abstract The goal of speaker diarization is to identify and separate different speakers in a multi-speaker audio recording. keywords: consistency; diarization; embeddings; loss; model; noise; processing; recognition; regularization; speaker; speaker diarization; speech; student; teacher; verification cache: mpcs-789.pdf plain text: mpcs-789.txt item: #329 of 341 id: mpcs-79 author: Darbinyan, Samvel Kh.; Karapetyan, Iskandar A. title: On a Problem of Wang Concerning the Hamiltonicity of Bipartite Digraphs date: 2021-12-10 words: 11077 flesch: 109 summary: a t h in D fo r e ve r y o r d e r e d p d ig r a p h s , t h e o r e m s a n d a l- keywords: e c; e n; e s; e t; h e; n d; n t; o n; o t; r e; r t; s t; t h; t t cache: mpcs-79.pdf plain text: mpcs-79.txt item: #330 of 341 id: mpcs-790 author: Jamgharyan, Timur V. title: Research of Model Increasing Reliability Intrusion Detection Systems date: 2023-05-31 words: 4378 flesch: 52 summary: But the problem is that, having determined the type of network IDS, attackers can design an attack taking into account the work of preprocessors, and malware embedded in the IDS itself will not go beyond the allowable statistical deviations. IDS preprocessor is a software module that receives data from the network traffic decoding module and outputs them to the input of intrusion detection modules. keywords: datasets; detection; fig; ids; malware; method; network; preprocessor; research; rnn; snort; traffic cache: mpcs-790.pdf plain text: mpcs-790.txt item: #331 of 341 id: mpcs-81 author: Nahapetyan, Hayk E.; Poghosyan, Suren S. title: Dynamic Task Scheduling Based on Abelian Sandpile and Rotor-Router Models date: 2021-12-10 words: 2810 flesch: 70 summary: References [1] D. Dhar, “Self-organized critical state of sandpile automaton models”, Phys. Rev. Lett., vol. There are a number of solutions for tasks scheduling and load balancing based on the Sandpile model [8]–[10]. keywords: abelian; model; rotor; router; sandpile; system; tasks cache: mpcs-81.pdf plain text: mpcs-81.txt item: #332 of 341 id: mpcs-82 author: Grigoryan, Hayk A.; Abrahamyan, Rita M. title: Cloud Service for Analysis and Interactive Visualization of Weather Data in Armenia date: 2021-12-10 words: 3420 flesch: 50 summary: The datasets layer combines two types of data platforms for further analysis: − Model output: outputs of weather prediction models; − Observation data: meteorological stations observations, as a base to investigate the deviation values with other model outputs. Armenias highlands extend up to Aragats mountain at 4090m where, 75% of the territory is above 1000m, 50% is above 2000m, and 3.4% is above 3000m. This paper presents a cloud service with interactive visualization and analytical capabilities for weather data in Armenia by integrating the two existing infrastructures for observational data and numerical weather prediction. keywords: analysis; armenia; data; information; model; olap; service; stations; temperature; visualization; weather cache: mpcs-82.pdf plain text: mpcs-82.txt item: #333 of 341 id: mpcs-83 author: Nahapetyan, Hayk E. title: Usage of Neural Networks for ASM Research date: 2021-12-10 words: 2512 flesch: 67 summary: For developing neural networks, Neuroph Studio has been chosen, and Abelian sandpile model has been considered on 2-dimensional grid. Introduction The structure and function of neural networks (NN) are based on our current understanding of the biological nervous system. keywords: function; networks; neural; results; sandpile cache: mpcs-83.pdf plain text: mpcs-83.txt item: #334 of 341 id: mpcs-87 author: Mkhitaryan, Andranik E.; Nanassian, Aram S.; Matveev, Eduard Z. title: Unimail Info-Communicational Software date: 2021-12-10 words: 1698 flesch: 61 summary: The received e-mails at first are being filtered by the following steps:  Acceptable and correct command exists in the subject of the e-mail  1. Structure of Unimail server. keywords: mail; phone; sms; unimail cache: mpcs-87.pdf plain text: mpcs-87.txt item: #335 of 341 id: mpcs-88 author: Khachatrian, Gurgen H.; Khachatrian, Hamlet K. title: Construction of Linear Codes over Rings Zm Correcting Double ±1 or ±2 Errors date: 2021-12-10 words: 3501 flesch: 69 summary: [2] H. Kostadinov, N. Manev and H. Morita, “On ±1 error correctable codes”, IEICE Trans. In this paragraph we will construct asymmetric low magnitude error correcting codes over different rings 𝑍𝑍𝑚𝑚. As it was mentioned above, in this paper we intend to construct codes correcting double ±1 and ±2 errors with the same magnitude. keywords: code; errors; 𝑍𝑍5; 𝑍𝑍7 cache: mpcs-88.pdf plain text: mpcs-88.txt item: #336 of 341 id: mpcs-89 author: Pogossian, Edward M. title: On the Way to Dominating Cognition date: 2021-12-10 words: 6613 flesch: 50 summary: Realities of Z can be interpreted as sets of Cns controlling in certain ways realities of R analogically to servers of “star” types controlling networks of computers or, seemingly, analogically to unicellular controllers. 4.2.1.The samples of classified realities r can be constructed deterministically and totally independent from cellulars in constructive regularization , conrgz, or can be regularized not constructively, particularly be provided not deterministically, be grown up from a priory given realities like cells or crystals, be a product of services to humans or machines. keywords: algorithms; classifiers; cognition; doers; doings; humans; ids; mentals; models; mss; nodes; ones; realities; regularized; rels; systems; types cache: mpcs-89.pdf plain text: mpcs-89.txt item: #337 of 341 id: mpcs-90 author: Mkhitaryan, Andranik E. title: Info-Communication Systems Based on E-mail and SMS Technologies date: 2021-12-10 words: 1511 flesch: 51 summary: In such systems, the ability of e-mail account users to send SMS notifications to the specified cellular networks is not the only possible way, because in these systems it is easy to integrate in one package for an e-mail user: a wide range of services related to the use of SMS technologies (transmission of SMS notifications via e-mail, group mailings of SMS, etc.). For the convenience of Webmail users, the mechanisms for accessing and managing SMS options are combined with e-mail preparation operations with a minimum number of request commands to the UNIMail server. keywords: mail; sms; system; technologies cache: mpcs-90.pdf plain text: mpcs-90.txt item: #338 of 341 id: mpcs-91 author: Gevorgyan, Ruben A.; Margaryan, Narek D. title: Existence of Maximum Entropy Problem Solution in a General N-Dimensional Case date: 2021-12-10 words: 2230 flesch: 79 summary: t0 − t < ϵ. Let r By the assumption there exists a t0 < t+ϵ, s.t. b = γ0a0 keywords: entropy; maximum cache: mpcs-91.pdf plain text: mpcs-91.txt item: #339 of 341 id: mpcs-94 author: Grigoryan, Davit A. title: On Dependence of Interpretation Algorithms of Typed Functional Programs on Canonical Notion of δ-Reduction date: 2021-12-10 words: 7573 flesch: 106 summary: 62 P rocA ( P ) fo r ±2, t h e r e fo r e In t e r p r e t a t io n A lg o r keywords: e e; e n; e t; h e; n o; n t; o t; r e; s e; t h cache: mpcs-94.pdf plain text: mpcs-94.txt item: #340 of 341 id: mpcs-95 author: Haroutunian, Evgueni; Yesayan, Aram; Harutyunyan, Narine title: On Multiple Hypotheses LAO Testing With Rejection of Decision for Two Dependent Objects date: 2021-12-10 words: 3801 flesch: 106 summary: e s e s t e s t in g im a l t e s t in keywords: e n; e s; e t cache: mpcs-95.pdf plain text: mpcs-95.txt item: #341 of 341 id: mpcs-97 author: Grigoryan, Sedrak V.; Hakobyan, Nairi P.; Vrtanesyan, Hovhannes S. title: Object-Oriented Modeling of Matching to Systemic Classifiers date: 2021-12-10 words: 2998 flesch: 51 summary: Algorithms for matching situations to each type of systemic classifiers are provided, where there are two types of matching algorithms, a. matching situations to the whole system of classifiers, where all the matched classifiers are activated and b. matching situations to certain classifiers, where only instances of expected classifiers are searched. Keywords: Modelling, Systemic classifiers, Mental, Matching, Chess. keywords: attack; attributes; chess; classifiers; concept; field; figure; matching cache: mpcs-97.pdf plain text: mpcs-97.txt