Media occupy a large place in society. On the other hand, the field of information and communication technologies has become an indispensable media tool. Accordingly, it is necessary to investigate how and in what way information technologies, from computers as the means of production of media content, transmission and publication of the same, to modern software solutions, internet and mobile technology influence the rise or fall of certain media. A particular aspect of the research we put on the impact of IT on the profitability and unprofitability of some other media.

In this paper we give one new proposal in finding optimal triangulation which is based on our authorial method for generating triangulation (Block method). We present two cases in calculation the triangulation weights (classical case and case based on block method). We also provide their equality and established relationship in calculation the weights for both models, with an emphasis on simplicity of calculations which occurs in the second case. The main goal of this paper is on the speed of obtaining optimal triangulation.

In this paper we present a method for Catalan number decomposition in the expressions of the form (2+i). This method gives convex polygon triangulations in Hurtado–Noy ordering. Therefore, we made a relationship between the expressions and the ordering mentioned above. The corresponding algorithm for Catalan number decomposition is developed and implemented in Java, as well as the algorithm which generates convex polygon triangulations. At the end, we have provided the comparison of Hurtado's algorithm and our algorithm based on the decomposition method.

. In this paper we provide a new way for constructing and storing the convex polygon triangulations. The main motivation for the presented method is derived from two combinatorial problems: ballot problem and problem of lattice path . The method is derived upon the so-called movement through polygon. The movement is de(cid:12)ned on ballot records and validity of the lattice path through the grid. We give two algorithms: Triangulation to ballot and Ballot to triangulation . Also, we give a method to make coding for a ballot record or the corresponding triangulation even more compact using a stack. All mentioned algorithms are implemented in the Java programming language.

Triangulation of the polygon is a fundamental algorithm in computational geometry. This paper considers techniques of object-oriented analysis and design as a new tool for solving and analyzing convex polygon triangulation. The triangulation is analyzed from three aspects: forward, reverse and round-trip engineering. We give a suggestion for improving the obtained software solution of the polygon triangulation algorithm using technique that combines UML modeling and Java programming.

Triangulation of the polygon is one of the fundamental algorithm computational geometry. This paper describes one method triangulations of a convex polygon. The notation that is obtained is expressed in the form of binary records. A presented method of triangulations is based on Lukasiewicz's algorithm and binary trees. Particularly, we present the implementation for creating binary for triangulation polygons. As evaluation of presented method we provide Java implementation for binary notation for triangulation polygons. Java application displays a correlation betwe notation and the graphical representation. of recording of polygon

This paper describes the concepts and methodologies of business intelligence system that enables users to improve the e-payment service quality and business improvement. The aim is to demonstrate that the use of business intelligence combined with epayment systems may lead to a better understanding of customers and improve the monitoring and analysis of their behavior. These analyzes can be used to improve customer relations and to gain a competitive advantage over other Saracevic M. Model implementacije sistema za E-placanje FBIM Transactions Vol.1 No.2 pp. 136 – 144 Published: July 2013 MESTE | 137 systems. In this paper, we gave the proposal of integration with the advanced tools and technologies (OLAP, Data Mart and CRM analysis) which would help in shaping the processes that collect data and transform it into useful information and knowledge. Practical part of the paper is implementation of the model of e-payment with elements of business intelligence using advanced Java technologies. The advantages of this type of implementation are given in the last segment of the paper.

This paper present a way of developing web applications for mobile devices in NetBiscuit platform which is implemented at the University of Novi Pazar. The process of implementation is based on project management of e-learning, more precisely on the application of project management (through four phases: definition, planning, management and evaluation). It's designed the combination of project management phase which enables more efficient planning and performing online education with the procedure of design courses for e-learning. The final part contains the process of integration of mobile web applications with Learning Management System (LMS).

In this paper is listed the analysis and implementation of possible solutions to the vehicle routing problem based on simulated annealing method, which belongs to the category of meta-heuristics approaches. The described method is a complex problem of linear programming from the field of operations research. This paper presents testing results of applications developed in programming package MATHEMATICA which provides great features when it comes to working with numerical algorithms, as well as in the field of symbolic and algebraic calculations.

In this paper, the block method for convex polygon triangulation is presented. The method is based on the usage of the previously generated triangulations for polygon with smaller number of vertices. In the beginning, we establish some relations between the triangulations of the polygons having the consecutive number of vertices. Using these relations, we decompose the triangulation problem into subproblems which are themselves smaller instances of the starting problem. The recursion with memoization is used to avoid repeating the calculation of results for previously processed inputs. The corresponding algorithm is developed and implemented.

The major purpose of this paper is to present a way of solving problems through so-called visual planning and programming using object-oriented concepts. This paper describes the process of UML modeling for solving the traveling salesman problem using one of the metaheuristic-genetic algorithms. The analysis and problem solving in this way has many advantages just because it provides a clear definition of requirements and specific plan that we will later use to create specific applications. This is a good way to resolve because the UML describes the source code, models help to visualize the system as it is or what it should be and allow you to determine the structure and behavior of the system. Static and dynamic diagrams implemented in developing tools for modeling, as well as a description of specific applications and testing are mentioned. With this approach we describe modeling tool that can be used in the development of specific solutions and a way of establishing explicit links between concepts and execution code.

In this paper we presents process of UML modeling for algorithm which is used in computational geometry and computer graphics. Implementation of algorithm for triangulation polygon is given in programming language JAVA. The main motivation is to present a way of solving problems through so-called visual planning and programming using object-oriented concepts. Dynamic and static model processing show the problem and give the plan for solving and implementation in some of objective-oriented program language. In one section of this paper we will list some research of authors and their results in the application of programming languages in the field of computer graphics. We specify reason for programming in Java in computer graphics and compared with other programming languages.