Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Importance Of Cryptography In The Government, Gazmend Krasniqi, Agnesa Pefqeli Oct 2021

Importance Of Cryptography In The Government, Gazmend Krasniqi, Agnesa Pefqeli

UBT International Conference

This paper first of all reflects the need for encryption and then the importance it has managed to accumulate over thousands of years of use. Various factors, mainly of a purpose; being powerful, have influenced the rapid development and stressed the importance of encryption in governing bodies.

Depending on in which part of the world it is used and for what reasons it is developed, the importance of cryptography in different governments has shifted to the more powerful states.

Governments have encountered conflicts due to the popularization of encryption, where users of encryption belonging to the non-governmental communities have declined …


The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica Oct 2018

The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica

UBT International Conference

Digital image processing is an area that finds many applications in three-dimensional graphics. One of the subjects considered in image processing is detection of moving objects. In this paper, we have analyzed the performance of an algorithm that detects a moving object. The performance relates to the speed of moving object during a pre-determined time interval. The methodology supports Matlab integrated with built-in functions. Specifically, as input of the simulation model is a video material containing moving objects. The model reads a video file presenting moving objects; after the model is executed in Matlab, the output emits moving objects associated …


Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini Oct 2018

Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini

UBT International Conference

Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.


A Summary Of Classification And Regression Tree With Application, Adem Meta Oct 2016

A Summary Of Classification And Regression Tree With Application, Adem Meta

UBT International Conference

Classification and regression tree (CART) is a non-parametric methodology that was introduced first by Breiman and colleagues in 1984. CART is a technique which divides populations into meaningful subgroups that allows the identification of groups of interest. CART as a classification method constructs decision trees. Depending on information that is available about the dataset, a classification tree or a regression tree can be constructed. The first part of this paper describes the fundamental principles of tree construction, pruning procedure and different splitting algorithms. The second part of the paper answers the questions why or why not the CART method should …


Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri Nov 2014

Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri

UBT International Conference

In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-level of computing. The algorithm is O(n2) and running sequentially achieves at least ~1/5 n2 number of basic necessary accesses of data structures. In this paper is also presented a comparison of running performances in practice between the new algorithm and the current most famous algorithm for 3SUM which is in-place and also based on sorting.