BS CS Capstone Papers

Interactive Platform for Visualizing Fundamental Mathematical Concepts

Mathematical learning is an integral part of computer science. Through the years of undergraduate Computer Science, students are introduced to a large number of mathematical concepts, some of which are not intuitively visualizable, particularly when traditional teaching relies heavily on static representations. To address this, we developed an interactive web-based platform that visualizes fundamental mathematical ideas dynamically and accessible. Employing our combined expertise in mathematics and software development, the platform integrates modern frameworks, including ASP.NET Core for server-side architecture and React for front-end interactivity. We utilized the Manim library in Python to dynamically generate mathematical animations. Using the tool, the users will be able to not only learn, but also save and share mathematical visualizations with other users. The goal of the project is to deploy a learning environment for students that will bridge the gap between abstract mathematics and intuitive understanding.

Students: Hrach Sahakyan, Hayk Ashughyan

Supervisor: Gagik Khalafyan

 

Diary: Blog-Post Management Web Application

The diary blog platform is a secure, AI-enhanced web application that enables users to write, manage, and analyze personal journal entries. Designed with user privacy and personal reflection in mind, the system provides a seamless registration and login process secured by verification codes to ensure account authenticity. Once authenticated, users can create, edit, and organize diary-style posts using a robust text editor that supports rich formatting options such as headings, hyperlinks, and other styling tools, allowing for expressive and structured entries. In addition, users can like and comment on posts, and receive notifications about new interactions. Beyond traditional blogging capabilities, the platform integrates artificial intelligence to provide meaningful insights into the user’s writing. An AI engine analyzes each entry to detect emotional tone and mood, and suggests improvements to enhance clarity and self-expression. This allows users to reflect more deeply and observe patterns in their emotional state over time. A personalized dashboard complements this experience by visualizing key metrics such as post frequency and mood trends, offering a broader perspective on journaling habits. While all user-generated content is stored securely and accessible only to authenticated users, posts can be marked as either private or public. Even for public posts, full access is restricted to registered users, keeping a controlled sharing environment. A publicly accessible home page organizes post summaries by category, allowing visitors to explore post titles and previews without viewing full content. In summary, the platform integrates secure account management, personalized creative expression, and intelligent feedback to deliver a digital journaling experience that is both personal and insightful. It demonstrates the power of combining modern web technologies with AI-driven analysis in an innovative and thoughtful way.

Student: Syuzanna Aleksanyan

Supervisor: Khachatur Virabyan

 

A Comparative Study of Linear Programming Solvers on Practical Optimization Problems

Linear Programming is a viable tool for solving optimization problems. With almost eight decades of history and an extensive theoretical and practical background developed by mathematicians and computer scientists over this time frame, it is applicable to a wide range of real-world problems. There are many linear and integer linear programming solvers which were developed with the purpose of solving any linear programming problem as efficiently as possible. With so many solvers available from both open-source and commercial communities, one might raise a question regarding which one of these LP solvers is the most feasible option in terms of efficiency, ease of use, available resources, and other criteria. One might also be interested in how a given real-world problem can be efficiently converted to a linear program. This report aims to examine several linear programming solvers from different origins and compare them using various real-world optimization problems, while also showing how each problem is modeled as a linear program and what results are obtained in each case. The outcomes should give the reader insights about linear program modeling and which of the on-hand tools is the best option in a given setting.

Student: Suren Hakobyan

Supervisor: Hayk Grigoryan

 

A Blink-Based Eye-Tracking Communication System

This project presents a low-cost, webcam-based eye-tracking communication system designed for individuals with severe motor impairments, such as those affected by locked-in syndrome. The system enables users to select among five directional gaze inputs—left, right, center, up, and down—confirmed through an intentional blink. Horizontal gaze is determined using a dark-pixel ratio between the left and right halves of the eye, while vertical gaze is detected using Eye Aspect Ratio (EAR) thresholds. Blink confirmation is implemented using blink duration filtering, with a pre-blink label retrieval mechanism to avoid misclassification caused by pupil movement during blinking. Thresholds for each gaze zone were empirically adjusted based on testing under various lighting and distance conditions. Data collected from manually labelled sessions were used to measure system accuracy. Preliminary results demonstrate high reliability for most gaze directions, with ongoing refinements aimed at improving downward gaze classification. Future extensions include predictive text integration, text-to-speech output, and adaptive machine learning-based gaze calibration to enhance usability and responsiveness.

Student: Tamara Nazaryan

Supervisor: Suren Khachatryan

 

Towards Scaling Laws for Language Model Powered Evolutionary Algorithms

The performance improvement of large language models (LLMs) mainly came from scaling pretraining. However, a new scaling paradigm emerged called test-time compute, which uses more computation at the inference time of language models to get better results. There have been extensive works suggesting various test-time compute scaling strategies, but the derivation of laws (in functional form) describing the scaling dynamics of these methods is still an underexplored research question. In this capstone project, we try to bridge this gap. We consider evolutionary algorithms as a means for scaling language model test-time compute. We propose a parametric law for modeling the expected performance of language model-powered evolutionary algorithms depending on the language model parameters (N) and the number of evolutionary algorithm iterations (k). We show that in molecular optimization tasks, our law is able to accurately extrapolate in N and k. Moreover, we find a tradeoff between language model size and the number of evolutionary algorithm iterations.

Student: Tigran Fahradyan

Supervisor: Hrant Khachatrian

 

Unveiling the Unseen: Face Generation from Text Using Artificial Intelligence

This study investigates the generation of realistic human faces from textual descriptions for use in law enforcement, particularly suspect identification. We curate a demographically balanced subset consisting of 10,000 images from the Illinois DOC Labeled Faces dataset. We also introduce a fully automated annotation pipeline that uses a multimodal large language model to generate descriptive captions. We hypothesize that data quality, including alignment, and demographic balance, significantly improve the performance of pretrained generative models. Experimental results using state-of-the-art text-to-image models support this. These findings highlight the importance of task-specific datasets for accurate and reliable AI-generated facial imagery in investigative contexts.

Students: Ani Nersisyan, Hasmik Andreasyan

Supervisor: Varduhi Yeghiazaryan

 

Reasoning Augmented Retrieval

Large Language Models have transformed how we interact with information, yet they can hallucinate and struggle with complex, multimodal inputs. Retrieval-Augmented Generation (RAG) improves factuality by grounding models in external data, but traditional RAG still falls short on visually rich documents and complex, multi-step questions. To overcome these limitations, we present Activeloop-L0, a reasoning-augmented retrieval pipeline designed for open-domain Question-Answering (QA) over a large set of user-uploaded multimodal documents. At query time, Activeloop-L0 dynamically interleaves retrieval and inference: it decomposes complex questions into subqueries, refines each search result using a vision-language perception module, and applies lateinteraction multimodal retrieval to surface the most relevant passages from text, tables, charts, and diagrams. By iteratively filtering and compressing results based on the user’s intent, our system achieves 85.6% QA accuracy on a visually rich data benchmark, setting a new state-of-the-art.

Student: Davit Gyulnazaryan

Supervisor: Davit Buniatyan

 

Spatiotemporal Reconstruction in Super-Resolution Microscopy

Super-resolution microscopy techniques have enabled imaging at the nanometer scale using fluorescent molecules (fluorophores), overcoming the diffraction limit of conventional light microscopy. Among these techniques, single-molecule localization microscopy (SMLM) achieves high spatial resolution by sequentially capturing numerous frames to localize individual fluorophores. However, this process results in low temporal resolution, often taking several minutes to generate a single image, which hinders the ability to study dynamic biological processes. This work aims to address this limitation by exploring deep-learning-based spatiotemporal interpolation methods to reconstruct videos from raw SMLM frame sequences, which are typically summed into static images. We explore hybrid architectures combining convolutional neural networks for spatial feature extraction and recurrent neural networks for temporal feature extraction, reconstructing the videos and enabling the visualization of nanoscale dynamics.

Student: Nazeli Ter-Petrosyan

Supervisor: Varduhi Yeghiazaryan

 

AI-Powered Video Editing: Motion-Aware Object Replacement Using Generative Models

Artificial Intelligence today has the power to generate realistic text, images, and videos. However, editing existing videos—particularly changing specific objects while keeping the visual consistency of the video—remains a nontrivial challenge. This research investigates the use and adaptation of generative models to build a system for automated object replacement in videos. The core challenge lies not only in visually replacement but also in ensuring that the introduced object inherits the original object's motion patterns and interactions within the scene. Rather than building novel models from scratch, this work focuses on reusing and augmenting pre-trained architectures, both to promote methodological efficiency and to alleviate the carbon footprint issue associated with extensive GPU usage. This research aims to develop an ecologically mindful, motion-aware object replacement system for videos, with promising applications in intelligent video editing, film post-production, augmented reality, experimental data generation, and event reconstruction.

Student: Satine Aghababyan

Advancing Armenian Inscription Recognition

The past is never silent. It speaks to us in many ways, often quite literally, through handwritten manuscripts or carved stone inscriptions. Armenian monuments are particularly rich in the latter. These inscriptions serve as vital records of cultural and linguistic heritage, offering insights into the lives, beliefs, and traditions of Armenians during the Middle ages. However, reading, comprehending, and even detecting these inscriptions pose significant challenges. Due to weathering, vandalism, erosion, and the complexity of ancient scripts, many of these texts remain unreadable. Yet, the few existing studies indicate that deciphering these messages from the past is feasible with technological advancements. The modern inscription recognition methods are dominated by a two-phase approach – a character detection followed by their classification. Most notably, an end-to-end pipeline for reading Armenian stone inscriptions has been recently developed based on visual transformers, with the scarcity of available training data highlighted as the major limitation. In the present project we study a unique, newly created and unexplored collection of digital twins of Armenian tapanakars (tombstones) and khachkars (cross-stones). We process both 2D images and full 3D models aiming at the improvement of the detection accuracy. In the current stage we focus on hierarchical segmentation of the images using the detected geometrical and statistical features. The segmentation is implemented at three levels – multi-line texts, individual text lines and characters or strokes in the text line. Next, we apply the results to character classification and estimate the accuracy of the generated character images. Since the detection stage of the algorithm is universal for any kind of shapes, it opens up new research avenues that extend beyond text recognition alone. The same pipeline can be adapted to identify decorative motifs, geometric symbols, and other visual patterns commonly found on tapanakar surfaces.

Student: Gevorg Nersesian

Supervisor: Suren Khachatryan

 

Automated Character Rigging Using Graph Neural Networks

Animating 3D characters is often labor-intensive, requiring careful rigging and masking of models to prepare them for animation. Many game developers lack the specialized skills needed for rigging, while animators aim to minimize the time spent on this repetitive task. This project aims to automate the process of making arbitrary humanoid 3D models ani- matable. We propose a data-driven method that uses graph neural networks to automatically rig and mask characters in the widely-used Mixamo format. Our method explores and compares different design choices. Specifically, it examines incorporating priors about joint locations by predicting them in 2D space versus relying purely on geometric and topological cues. We find that including joint-based priors can significantly improve the accuracy and robustness of the rigging process, particularly for models with unusual proportions or noisy geometry.

Student: Vahe Petrosyan

Supervisors: Varduhi Yeghiazaryan, Irina Tirosyan, Yeva Gabrielyan

 

Spectral Image Generation Using Deep Neural Networks

Spectral imaging has been a reliable tool for terrain analysis, giving valuable information about soil quality, vegetation type, and much more. Only recently has its potential been discovered in a broader range of fields such as biomedical imaging, the manufacturing sector, art restoration, and forensics. With the introduction of other fields, automating the processing of huge information obtained from spectral imaging has become necessary, making machine learning a common tool used for working with spectral data. However, gathering enough data for a model to successfully train on raises the need for new methods of spectral image acquisition or generation, especially in data-scarce or cost-sensitive contexts. Currently, spectral image generation is a poorly explored domain, and most of the works related to it are tailored to work with terrain data. In this report, a novel method for spectral image generation is proposed which is targeted for a hyperspectral fruit image dataset. More specifically, this report combines and adapts conventional RGB image processing, augmentation, and generation techniques for a new experimental method for working with and generating spectral images. Using the nature of hyperspectral images, the proposed methods boosts and optimizes the training process for image generation.

Student: Gevorg Khachatryan

Supervisor: Varduhi Yeghiazaryan

 

Automated Seasonal Color Classification and Makeup Recommendation

We propose an automated data-driven seasonal color profile classifier that generates personalized palette suggestions by extracting color-based features from face images. [1]. The project aims at the implementation of a virtual makeup try-on tool that will allow users to apply the recommendations in real time. This research offers a scalable solution for personalized color analysis, bringing image processing, computer vision, color theory, fashion, and cosmetic science together to support individuals in making more confident and color-informed choices in personal style and makeup. It is addressed in four directions: Detection of skin-related colored pixels in different color spaces using already-established color theory and image processing methods to enable the segmentation of different skin regions across varying lighting conditions; Formation of a skin-specific color palette using the extracted skin regions and identification of non-skin facial features such as the eyes, lips, and hair. These facial components are separately color-clustered to form a unique palette representing that individual’s natural coloring. Based on the observed color patterns, such as the skin undertone (cool, warm, neutral), the contrast level (high, medium, or low) of facial features, and the clarity (clear or soft), the person’s seasonal type (e.g., Soft Summer, True Autumn, Deep Winter, Clear Spring) is identified; - Finally, the seasonal types are mapped to makeup products to generate personalized recommendations and best-suited clothing color solutions.

Students: Sona Khachatryan, Jemma Asryan, Mariana Sargsyan

Supervisor: Suren Khachatryan

 

Matrace: eBPF Based Malware Analysis Engine

Analyzing malicious programs deployed during cyberattacks is crucial for decoding attacker’s methodologies and developing proactive defense. Malware analysis, while invaluable, is a slow process - particularly in Linux environments where automated analysis capabilities lag significantly behind their Windows counterparts. Current solutions addressing the Linux ecosystem typically suffer from limited kernel visibility and inconsistency across Linux distributions. This paper presents Maltrace, a malware analysis system built on extended Berkeley Packet Filtering technology. It works by tracing the execution of malicious programs at the Linux kernel level, collecting a large amount of data about malware’s behavior, and then using analysis engines to turn this raw data into practical insights about the malware’s actions and goals.

Student: Suren Petrosyan

Supervisor: Norayr Chilingaryan

 

DATAVOR: Data Architecture as Translation, Artificial Validation, Orchestration and Refinement

The emergence of Large Language Models has been instrumental in the automation and advancement of numerous fields ranging from Natural language processing and Healthcare to Biological Structure Prediction tasks. However, the LLMs have been predominantly limited to English and have limited development in low-resource languages. This is primarily due to the lack of datasets for pre-training or fine-tuning. This work explores the possibility of generating and validating synthetic data for low-resource languages through the existing LLMs. We particularly focus on the development of Question Answering datasets as they have been shown to be the fundamental component for achieving human-like performance on numerous tasks and the principal evaluation benchmark for the state-of-the-art (SOTA) LLMs. We demonstrate the effectiveness of our approach by generating synthetic data for the Armenian language. The dataset allows us to evaluate and compare the zero-shot performance of the SOTA LLMs in the Armenian language. We perform a complete analysis of the generated syntactic data to show that the generated data is of high quality and can be used to bootstrap the development of NLP models for low-resource languages.

Student: Gayane Ghazaryan

Supervisor: Erik Arakelyan

 

Armenian Speech-to-Text Recognition

This project aims to address the need for Speechto-Text Recognition (STR) technology in the Armenian language by creating a practical and efficient system. Leveraging pretrained Automatic Speech Recognition (ASR) models, the project fine-tunes them using the latest releases (16.1 and 17.0) of the Common Voice Armenian Audio Dataset. Through a sophisticated ecosystem comprising frontend and backend components integrated with MongoDB for data management and hosted on a cloud-based server, the project aims to deliver a practical and efficient web app. The web app offers users a user-friendly platform to experiment with different speech recognition models, such as Whisper, Vaw2Vec2, Quartznet, Citrinet, and more, to transcribe audio recordings and manage their transcription history. Through a comprehensive account of the development process, including encountered challenges and implemented solutions, this project seeks to advance the field of speech-to-text recognition while advocating for the integration of the Armenian language into modern digital communication.

Students: Tigran Gaplanyan, Sanasar Hambardzumyan, Anahit Baghdasaryan

Supervisor: Elen Vardanyan

Detecting Key Events from Cell Mass Time Series Data

This paper is based on yeast cell mass time-series data collected by an innovative method called interferometric scattering microscopy (iSCAT). This data consists of 43 data sets of different lengths, many of which are very dense and high-frequency. Hence, this paper aspires to perform analysis for motif(pattern) and discord(anomaly) discovery within the datasets as well as joint analysis of different combinations of two datasets. The entire coding part of the project was implemented in Python. The analysis of this yeast cell mass timeseries data is performed by a novel technique called the Matrix Profile, which makes possible the discovery of interesting occurrences in this rather complex data. Thus, this paper will also cover the specifics of working with the Matrix Profile on various types of data. Additionally, forecasting methods were applied on the data for a deeper understanding of the movement of the cell mass. Therefore, the paper also discusses the approaches and challenges when forecasting such complex data. Overall, the thoroughly adapted codes and the guidelines provided by this project will contribute to the further research of this yeast cell mass data from a biological perspective and perhaps lead to an interesting connection of events. Moreover, as this paper covers the theoretical and practical discussions of the implementations of the algorithms, this will be a base for analyzing other data in the future without the need for extensive prior research about the applications of the methods.

Keywords: Matrix Profile, Stumpy, Discord, Motif, Exponential Smoothing

Student: Araks Hovhannisyan

Supervisor: Rafayel Petrosyan

Deep Learning Based Old Photo Restoration and Colorization Web Service

This paper presents a comprehensive approach for restoring and colorizing old photographs using neural networks and image processing techniques. The objective was to develop a user-friendly web service that allows effortless enhancement and modification of images. By utilizing convolutional neural networks and deep learning techniques, we trained a model capable of restoring damaged images. The web service, built using React.js and integrated with a Flask backend server, provides a fast and accessible platform for users to interact with the models. Evaluation metrics such as Mean Squared Error (MSE) and Structural Similarity Index (SSIM) were used to assess model performance, showing competitive results, especially in the restoration and colorization of human faces. Challenges were encountered with more complex images, indicating the need for further advancements. The successful deployment of the models on the web service demonstrates their capabilities and offers a convenient tool for users without technical expertise. Future research directions include improving model accuracy and robustness, incorporating user feedback, and expanding the training dataset for more tailored results. Additionally, adding features to the website, such as multiple image uploads and cloud storage, and improving the user interface and experience are also considered.

Students: Narek Okroyan, Karen Petrosyan

Supervisor: Arnak Poghosyan

 

Test Plan/Strategy Definition and Implementation for Decentralized Applications. Test Framework Implementation from Scratch.

This capstone project aims to explore the complexities of creating a decentralized application(dApp) while emphasizing the importance of a thorough testing process for a dApp. To ensure the accurate functionality of these applications, the project highlights the essential role of testing approaches such as Shift-Left and Test-Driven Development (TDD), which involve early testing across all development lifecycle phases. This project addresses all test levels and crucial testing components, such as Unit Testing of Smart Contracts and Test Automation of the User Interface. The Unit Testing for this project ensures that the Voting Platform's underlying logic and functionalities are accurate. The project also addresses the Test Automation of the User Interface to validate the dApp's functionality, which includes interaction with Metamask. Therefore, the project's outcome is to implement the Voting platform dApp for testing purposes and gain a comprehensive understanding of the development process for decentralized applications, which is crucial for designing and implementing a complete Test Strategy covering all development activities and test levels for dApp.

Student: Lilit Goyunyan

Supervisor: Artur Mkrtchyan

 

Development and Training of a Deep Learning Approach to Estimate Latency of Deep Neural Network Inference

This academic paper introduces a deep learning estimator model designed to predict the latency of the inference stage in fully connected deep neural networks (DNNs) running on laptop CPUs. As the size and computational requirements of DNNs continue to increase over time, it becomes crucial to estimate their performance measures in order to optimize them effectively. The primary objective of this paper is to estimate one of the key performance measures of DNNs, which is latency. This research and the proposed prediction model contribute to the broader field of optimizing modern neural network architectures, specifically in the context of hardware-aware neural architecture search (HW-NAS). The paper draws comparisons between existing latency prediction methodologies, focusing on those that are relevant for integration into HW-NAS algorithms based on their exhibited results. This work represents a small step towards addressing the urgent issue of latency optimization. This research achieved strong performance metrics and loss values (MSE=0.0007, MAE=0.0211, RMSE=0.0261). The model showed a small average latency deviation (0.02) between predicted and actual latency values. Experiments focused on estimating latencies of DNN architectures with up to 5 layers with ReLU activation (up to 50 neurons per layer), limiting generalizability to similar setups. The study exclusively targeted laptop CPUs, restricting applicability to similar hardware platforms. Overall, this paper contributes to the field by offering a deep learning estimator model for predicting latency in fully connected DNNs running on laptop CPUs and by discussing its implications within the context of HW-NAS.

Keywords: latency estimation, deep FCNN, HW-NAS (NAS), FLOPs, Prediction model, Analytical model, Real-time measurement, Look-Up table, GCN, CPU, GPU, Gradient Boosting, MSE, ReLU, RMSE, MAE

Students: Lilit Beglaryan

Supervisor: Christopher Ringhofer

 

Dynamic Networks Research Kit

The paper is dedicated to the in-depth analysis of open-source software assisting research in the dynamic networks field. The paper discusses what problem the software solves, what features it has, what kind of research can be conducted with it. The paper contains a detailed description of the underlying properties of the graph generated using the software. There will be a feature guide describing the main features of the app, their theoretical aspects and usage tips.

Student: Lilit Karapetyan

Supervisor: Louisa Harutyunyan

 

Library Management System

Reading is an essential part of everybody’s life, mainly students, despite their chosen profession. Throughout our lifetime, everybody interacts with libraries, and unfortunately, some of us have had unpleasant experiences that deprived us of further interactions. Consequently, this project aims to present a comfortable and easy-to-use Library Management System for students and administrators. The project provides solutions for Web and Mobile applications. It is designed to guarantee simple and effective access to library resources using modern approaches and technologies such as QR scanning. We hope that ensuring high-quality library experiences with the following software will bring solutions to the field's existing problems and increase the number of library users.

Keywords: Books, Library, Administrator, Student, React, JavaScript, Swift, iOS, Swagger, Component, TypeScript, Firebase, Database, JWT, Docker

Students: Alisa Martirosyan, Haykuhi Safaryan, Hovhannes Vardanyan

Supervisor: Saro Deravanesian

 

Simulation on Road Networks

Road networks are used to describe a city's transportation infrastructure. They are one of the most helpful indicators for determining the sustainability of an existing transportation area or a planned new transportation development region. Thus, studying road networks and experimenting with them is essential for developing urban areas. In this project's scope, we will model the road network of the traffic area of Yerevan and analyze its structure by applying different measurements to it. Overall, the main idea is to examine the paths between any source and destination taken from our data of crossroads in Yerevan, considering the distance and traffic between them. By collecting and analyzing this data, we would like to minimize the traffic in Yerevan.

Students: Anna Tatinyan, Knarik Manukyan

Supervisor: Louisa Harutyunyan

 

Automatic Vehicle Number Plate Detection and Recognition

Automatic license plate detection and recognition is a big step towards intelligent transportation systems. The introduction of advanced data collection hardware, like the traffic monitoring cameras, assumes the development of corresponding software, which automates the processing and analysis of the generated data. This project explores the theoretical basis for the development of such software. The task of automatic license plate recognition is composed of two main stages: symbol extraction from the plate and symbol recognition. Our approach is an implementation of a novel hybrid system using the cutting-edge tools of image processing and machine learning. When applied on an image dataset, our method achieves accuracy above 97% for the extraction phase and above 93% for the recognition phase, thus showcasing promising results.

Students: Maro Grigoryan, Arpen Matinyan 

Supervisor: Varduhi Yeghiazaryan

Analysis of Transcriptome and Survival Patterns in BRCA1- and BRCA2-Positive Breast and Ovarian Cancers

Somatic and germline mutations in BRCA1 and BRCA2 are widely implicated in breast and ovarian cancer progression, treatment, and survival. However, a few studies addressed the differences between BRCA1- and BRCA2-mutation associated gene expression profiles and disease progression. In this study, we performed BRCA1/2 mutation-centered RNA-seq data analysis of breast and ovarian cancers from TCGA repository using machine learning and bioinformatics approaches. The results revealed considerable differences in BRCA1- and BRCA2-dependent transcriptome landscapes in studied cancers. Furthermore, our data indicated that somatic and germline mutations for both genes are characterized by the deregulation of different biological functions. Finally, the data showed considerable variability in transcriptome and survival patterns between BRCA1- and BRCA2-mutated cancers and necessitates further research aimed at molecular subtyping of ovarian cancers.

Student: Arman Simonyan

Supervisor: Arsen Arakelyan

Mobile Application for Location Sharing

This paper aims at describing the work of a mobile application from scratch. We will dig into the language in which the application is written, understand the basic concepts of frameworks and libraries that are used, look at examples and cases that could happen, and talk about plans. This application, which has an unofficial name PartoMan in its kind, is a social network application. In the scopes of the project, we will see the problems and challenges that PartoMan tries to solve. Overall, the main idea of the app is to provide people with a tool to understand the activity level of different places all over the world. People will be able to communicate with their friends and to gain new relationships. The whole application is written in JavaScript and is divided into three main parts: back-end, front-end, and mobile part. Several libraries and frameworks are used, such as React JS, React Native, Nest JS, Redux, etc. As a result, a competitive and comfortable mobile application, which has all the chances to become a new name in the world of social apps.

Student: Levon Avetisyan

Supervisor: Saro Deravanesian

 

Development Process Improvement & User Activity Visualization Tool: Loolp

This paper aims to provide an in-depth overview of all aspects surrounding Loolp, chronicling the origins, usages, inner workings, and auxiliary concepts directly linked to the application. This will be an extensive tour spanning across a vast array of discrete stages. First and foremost, the readers will be provided with an informative exploration of the main concepts and principles of Loolp, what the application has been created to achieve, with what exact means it aims to achieve it, as well as why it is so critical that it is successful at fulfilling its established goals. Subsequently, the paper includes an elaborate overview of the technical prowess which fuels Loolp at its core. This will be a deep dive into the technologies that have been implemented to elevate Loolp to supreme levels of practicality and effective performance. Further down the line, the paper delves deep into the varied array of use cases of the applications, promoting the full extent of the latter’s flexibility as well as providing comprehensible instructions of how one is capable of making full use of Loolp’s extensive list of functionalities. The surge of information is concluded with a dedicated section where readers will get a glimpse into the future of the application. The paper provides an overview of all updates and supplementations planned to be implemented in the later stages of Loolp’s lifecycle, solidifying the latter as a timeless, flexible tool that aims to accompany the IT sphere at every subsequent step of the industry’s evolution.

Keywords: Version Control System, Git, Team Collaboration Tool, OAuth, Authorization Code Flow, Database Systems, GitHub, Slack

Student: Rebeka Asryan

Supervisor: Saro Deravanesian

 

Speech Emotion Recognition using Recurrent Neural Networks

Automatic emotion recognition in speech is the latest research area in the field of human-machine interaction and speech processing. Many significant research works have been done on speech emotion recognition. The primary challenges while solving this task are finding good databases, identification of different features related to speech and an appropriate choice of a classification model. In this paper, eight emotions are recognized using Mel Frequency Cepstral Coefficient (MFCC) features. Many classification algorithms are considered for classifying emotions, but the best results were obtained using Recurrent Neural Networks (RNN). RAVDESS emotional database is chosen for the task. A good recognition rate of 94% was obtained for the test set, which contained recordings for all actors, including ones from a new actor, which is not in the train or in the validation dataset. In addition, a recognition rate of 83.75% was obtained when the test contained only the recordings from the new actor.

Keywords: Emotion recognition, Feature extraction, MFCC (Mel Frequency Cepstral Coefficient), Recurrent Neural Networks (RNN), Classifier

Student: Liana Harutyunyan

Supervisor: Vazgen Mikayelyan

 

Yerevan Transportation System

The project’s aim is to help local people as well as tourists to easily orientate and transfer in Yerevan. It suggests the user the best paths and transport options for moving from one place to another in Yerevan based on different criterias they choose. The algorithms and tools used to implement the project will be represented and a github link for the code will be provided in the end of the paper.

Keywords: Yerevan, transportation, criteria, cost, shortest path, minimum transfers, Python, JavaScript, Angular7

Student: Syuzanna Loretsyan, David Shadunts

Supervisor: Louisa Harutyunyan

 

Universal Fast Neural Doodling

Universal fast doodling aims to transfer arbitrary visual style with corresponding style mask to an absolutely new piece of art with the same style but already with the new mask. In this work, we present an algorithm which uses whitening and coloring transform(Li et al. 2017) and adaptive instance normalization(Huang and Belongie 2017) with a new application on neural doodles. Key ingredients of our method are image reconstruction and deep feature transformations. Even though the algorithm is working without training of styles , we train new decoders for image reconstruction to improve results. We demonstrate the effectiveness of our algorithm by generating high-quality neural doodles and compare it with doodles created with other methods.

Link to the implementation https://github.com/mmash98/Universal-fast-neural-doodling

Student: Marianna Ohanyan

Supervisor: Shant Navasardyan

 

Automatic Color Scheme Generation

Color plays a big role in our everyday life. It can directly affect the way we interpret certain things, change actions and even affect our health. Hence, by selecting the right color scheme one can attract the viewer, convey a message or set a mood. For some people, especially non-designers, choosing colors can be overwhelming and intimidating. Sometimes choosing a color involves manually exploring the color space, usually with simple tools like color sliders or squares, which is both time-consuming and fairly subjective. This search may involve looking for examples of successful color combinations which can be used as a starting point. Scientists have also been interested in understanding color compatibility and have proposed numerous theories. This project aims at exploring the idea of color schemes and color compatibility. It consists of several parts, which are the analysis of hue templates model and its implementation; the analysis of color palette data, exploration and implementation of models for evaluating the quality of a color scheme, and new applications for choosing and using color schemes.

Keywords: color schemes, color compatibility, machine learning, image processing, Python, Wolfram Mathematica

Students: Irina Tirosyan, Yeva Gabrielyan

Supervisor: Suren Khachatryan

ML Analysis on Black Friday Data

For this capstone project, I choose a dataset from Kaggle, "Black Friday." In the dataset, you could see users their gender, city, age, city where they are from what category product they bought. As for the product itself, the only information that we had was the category 1,2,3 and ProductID with no specification of what kind of product it was. It was a challenge to get much from this data as even though the number of observation was big there was a very small number of variables. The problems that we tried to solve are the revenue prediction by customer (Purchase); likelihood of a customer to buy the second or the third product, and cluster analysis of products. As an additional feature, the project also includes data visualization to understand the relation between variables more clearly.

Student: Nane Vardanyan

Segmentation using Front Propagation and Partitioned Images

This work aims to discuss image processing algorithms that particularly focus on image segmentation. Throughout the thesis, we will cover gradient magnitude on several convolution filters, boundary detection, image thresholding, region growing, watershed, fast marching, and fast dashing methods. We have written the code for each of them in Python language using exclusively our knowledge and analysis (no built-in functions are used). For our testing purposes, we use the Berkeley Segmentation Data Set and Benchmarks 500 (BSDS500 [5]). The purpose of this work is to compare and discuss various image segmentation techniques and their results.

Students: Elen Tumasyan, Larisa Malkhasyan, Nelli Hovhannisyan

Supervisor: Varduhi Yeghiazaryan

 

Automated Custom Named Entity Recognition and Disambiguation

Named Entity Recognition and Disambiguation are sub-tasks in Natural Language Processing that seek to identify and classify named entities in the text into their designated categories. The use of NER ranges from profanity detection to extracting meta-data from documents. The goal of the project is to develop a tool/framework for creating end to end Custom Named Entity Recognition models. Entities are not limited to the usual predefined classes of Person (PER), Location (LOC), Companies/institutions (ORG), etc. We are using Neural Networks, an ensemble of several word embeddings and parallel contexutalization modules in order to tackle this task.

Keywords: NLP, NER, Neural Networks, CRF, Parallelization, databases, API.

Student: Erik Arakelyan

Supervisor: Adam Mathias Bittlingmayer

Experimental Evaluation of Optimal Sampling Rates of Data Center Indicators Subject to Information Loss Criterion

Within this project, we experimentally evaluate the maximum possible reduction of the sampling rate of a time series dataset representing a cloud application subject to the required information loss criterion. We apply measures in information theory to quantify the information loss that sampling rate reduction results in. Such a reduction is of great interest in cloud applications management to reduce the cost of monitoring solutions through measuring data and building data-driven analytics on top of that. We investigate on how the sampling rate reduction based on information loss criterion impacts outliers (important for managing cloud infrastructures and applications) and reliability of forecasting.

Keywords: Time Series, Sampling Rate, Information Theory, Jensen-Shannon divergence, Recurrent Neural Nets, Markov Models, Dirichlet Process, Classification, Outlier Detection.

Students: Hasmik Chalabyan, Tigran Bunarjyan

Supervisor: Ashot Harutyunyan

Order Revealing Encryption: Algorithm and Implementation

The aim of this project is to present an algorithm for Order Revealing Encryption (ORE). The method described here is significantly more secure than some of the publicly available ones, in terms of both ciphertext size and speed. This report contains the algorithm, a protocol for secure range queries and a sample implementation.

Keywords: Order Revealing Encryption, Cloud Computing, Encrypted Database.

Student: Arman Zakaryan

Supervisor: Gurgen Khachatryan

Recommender System: A Recent Method for Matrix Completion

One of the trends of the last decade was the creation of Recommender Systems (RS), which are aimed to make personalized recommendations online, based on some data. This technique has become a part of provided services of most of the large scale companies; including Netflix, LinkedIn, Facebook, Amazon, Youtube, Spotify, and many more. Recommender Systems are used in order to recommend the users a great variety of items; including movies, songs, friends, customer products, etc. These systems have become a very important technology component in many companies. The Netflix, for example, reports that at least 75 percent of their movie downloads and rentals are due to the Recomennder System that they have. Hence, this system has a huge strategic importance for the company. We will give further information about the Recomennder System of Netflix company later in this paper. In our next chapters we are going to give some brief introduction to Recommender Systems and Matrix Completion Method, descirbe the 1-Bit Matrix Completion Method, consider an algorithm to implement the latter using Python and make some numerical experiments.

Student: Tatevik Matevosyan

Supervisor: Arnak Dalalyan

Per-Company Text Analysis Profiles for Stock Market Prediction

Price charts and the financial state of a company, are an ongoing subject of extensive analysis. With the resent surge of social networks and online news aggregators, alternative techniques are being established on stock market prediction. In this paper we have presented our approach to analysing and predicting NASDAQ stock price fluctuations using textual data from Twitter and Reddit. In contrast to previous studies, profiles of multiple models are created to extract company specific and company related indicators. Implementations of the FastText neural network and Naive Bayes Classifier are used for prediction. We show that significant increase in prediction accuracy can be achieved through incorporating datasets from related companies. Our models were not trained on human annotated sentiment, relying solely on stock value changes for classification. The results are comparable to state of the art sentiment analysis prediction techniques.

Keywords: Stock Prediction, Text Analysis, FastText, Naive Bayes

Students: Karen Galstyan, Sergey Hovakimyan 

Supervisor: Vahe Pezeshkian

Offline Armenia Lab

In this capstone report the authors have discussed and given possible solutions to a situation that can have fatal outcomes during wartime. As we are living in a century of technologies and everyone has access to information (as opposed to several decades ago), it is very essential to be up-to-date every single hour. The most part of the information we receive, is coming from the Internet. So, what will happen if a country falls into an information blockade? Each user types are affected differently by the absence of the Internet. While the end users will not suffer much of being isolated from the world of Internet for several hours and even days, businesses and other corporations might suffer seriously by the Internet absence losing their clients and other essential sources. Now imagine a certain country at war, and the population gets updated with info each second from trusted Internet sources. What will happen in this case, if the Internet is gone? The authors have simulated a local Internet network to test different scenarios in the simulated environment and given possible solutions to each scenario.

Students: Edita Sahakyan, Mane Grigoryan, Narek Jilavyan

Supervisor: Satenik Mnatsakanyan, Vaagn Toukharian

 

1-Movable 2-Dominating Set in Wireless Sensor Networks

In this project we model the WSN as a graph, where the sensor nodes are the vertices and the transmission links between sensors are the edges. Hence, WSN is the undirected graph G = (V, E), where V is the set of vertices and E is the set of edges. An edge between any two vertices u and v is denoted as (u, v). The open neighborhood of v, denoted N(v), is the set of all vertices u adjacent to v, i.e. N(v) = {u|(u, v) ∈ E}. The closed neighborhood of v, denoted N[v], is the set of all vertices adjacent to v, including v, i.e. N[v] = N(v) ∪ v. A dominating set D is a set of vertices such that for any u /∈ D, there exists a vertex v ∈ D such that (u, v) ∈ E. A 1-movable dominating set D is a dominating set such that any vertex v ∈ D satisfies one of the two conditions: (1) D\{v} is a dominating set; or (2) ∃ u ∈ (V \D)∩ N(v) such that D\{v} ∪ {u} is a dominating set. A 1-movable 2-dominating set is a 1-movable dominating set D such that every vertex u /∈ D is adjacent to at least two vertices in D. Dominating sets and variations of dominating sets are vastly used in WSNs as a choice of backbone for the network. Hence, finding a dominating set for a given graph (i.e. network) is equivalent to finding a small subset of sensors in a WSN designated to provide full coverage of the area they are deployed in. Other sensors in the network can be put to energy-efficient sleep mode to conserve energy. We also design centralized and distributed approximation algorithms in unit disk graphs to find 1-movable 2-dominating set.

Students: Anastasia Karapetyan, Talin Saghdasaryan

Application of Anomaly Detection in Biomedical Hyperspectral Image Analysis

Hyperspectral images (HSIs) have attracted a lot of attention in image processing field for their ability to capture information beyond the visible range. Methods for their analysis, such as hyperspectral unmixing and classification, quickly became popular, especially in the biomedical field for disease diagnosis and surgical guidance. At the same time, anomaly detection techniques gained big traction in remote sensing. This report aims to make a contribution by employing anomaly detection on biomedical data—something that has never been tested before, to the best of our knowledge—with an intention to bring this class of hyperspectral algorithms from one field (remote sensing) to another (biomedicine).

Student: Alexander Israelyan

Supervisor: Varduhi Yeghiazaryan