The FON University is the second private university established in the Republic of Macedonia, after the liberalization of the High education law's in 2002. After its establishment great number of professors from the Ss. Cyril and Methodius University of Skopje transferred to the new university and contributed to building a better educational system in Republic of Macedonia. Present day the university has grown to 10 faculties with total academic staff of 250, and supporting technical staff of 80 people. The university is the first high education institution in Macedonia that has implemented fully the Bologna requirements, and the European Credit Transfer System. Total of more than 5300 students study at the university campus. The University has two campuses based in Skopje and Struga on more than 30.000 square meters. Wikipedia.
Skakov M.,East-Kazakhstan State Technical University |
Rakhadilov B.,East-Kazakhstan State Technical University |
Sheffler M.,FON University
Key Engineering Materials | Year: 2013
Microhardness of nitrated and carbonitriding in electrolyte plasma steel P6M5 surface layers are investigated in the research. It shows perspectiveness of the cutting tool electrolyteplasma treatment technology. Operating conditions for the technology realization are defined. It was also indicated the desired content of components in saturating mixtures by nitriding and carbonitriding. Comparative research of structure, phase composition of fast-cutting P6M5 steel modified surface layers after electrolyte plasma treatment was carried out by scanning-electron and light microscopy, and X-ray structure analysis methods. The way of electrolytic plasma nitriding in cathodic mode, to provide fast-cutting steels which allows for modification the surface and high kinetic efficiency the process diffusion saturation. It was established that as a result of nitriding and nitrocarburizing in plasma electrolyte has been a significant increase in microhardness in the surface layers of steel P6M5. © (2013) Trans Tech Publications, Switzerland.
Dimovski A.,FON University
Communications in Computer and Information Science | Year: 2011
One of the major challenges in computer science is to put programming on a firmer mathematical basis, in order to improve the correctness of programs. This paper describes a concrete implementation of a semantic-based approach for verifying termination of open nondeterministic programs with finite data types. The presentation is focused on Erratic Idealized Algol, which represents a nondeterministic programming language that embodies many of the core ingredients of imperative and higher-order functional languages. The fully abstract game semantics of the language is used to obtain a compositional, incremental way of generating accurate models of programs. The CSP process algebra is used as a concrete formalism for representation of game models and their efficient verification. Termination of programs is decided by checking divergence-freedom of CSP processes using the FDR tool. The effectiveness of this method is presented by several examples. © 2011 Springer-Verlag.
Dimovski A.S.,FON University
Theoretical Computer Science | Year: 2014
We introduce a new symbolic representation of algorithmic game semantics, and show how it can be applied for efficient verification of open (incomplete) programs. The focus is on an Algol-like programming language which contains the core ingredients of imperative and functional languages, especially on its second-order recursion-free fragment with infinite data types. We revisit the regular-language representation of game semantics of this language fragment. By using symbolic values instead of concrete ones, we generalize the standard notions of regular-language and automata representations of game semantics to those of corresponding symbolic representations. In this way programs with infinite data types, such as integers, can be expressed as finite-state symbolic-automata although the standard automata representation is infinite-state, i.e. the standard regular-language representation has infinite summations. Moreover, in this way significant reductions of the state space of game semantics models are obtained. This enables efficient verification of programs by our prototype tool based on symbolic game models, which is illustrated with several examples. © 2014 Elsevier B.V.
Djinevski L.,FON University |
Ristov S.,University of Macedonia |
Gusev M.,University of Macedonia
Advances in Intelligent Systems and Computing | Year: 2013
Speedup in parallel execution on SIMD architecture according to Amdahl's Law is finite. Further more, according to Gustrafson's Law, there are algorithms that can achieve almost linear speedup. However, researchers have found some examples of superlinear speedup for certain types of algorithms executed on specific multiprocessors. In this paper we achieved superlinear speedup for GPU devices, which are also categorized as SIMD. We implement a structure persistent algorithm which efficiently exploits the shared cache memory and avoids cache misses as much as possible. Our theoretical analysis and experimental results show the existence of superlinear speedup for algorithms that run on existing GPU device. © 2013 Springer-Verlag.
Dimovski A.S.,FON University
ACM International Conference Proceeding Series | Year: 2012
This paper describes a concrete implementation of a gamesemantics based approach for verification of open program terms parameterized by a data type. The programs are restricted to be data-independent with respect to the data type treated as a parameter, which means that the only operation allowed on values of that type is equality testing. The programs can also input, output, and assign such values. This provides a method for verifying a range of safety properties of programs which contain data-independent infinite types. In order to enable verification of programs with arbitrary infinite (integer) types, the proposed method can be extended by combining it with an abstraction refinement procedure. We have developed a tool which implements this method as well as its extension, and we present its practicality by several academic examples. Copyright 2012 ACM.