|
|
Information system for registration of meetings in trading companies
Pohl, Martin ; Morávek, Petr (referee) ; Šeda, Miloš (advisor)
This work has been created to keep file of descriptions of salesmen negotiations for the company management. The application uses relational database system MySQL to store the data and a web interface as the program access. It was written in PHP script language. The data from the records will be used for evaluating and assessment. A part of the work is original graphic template that uses CSS cascade style and jQuery libraries. A reminding module has bee added, which notifies the terms of negotiations, meetings, and e-mails to reduce the danger of missing a term. The data is used to create graphs showing the monitored values, status and progress of events.
|
|
|
Implementation of SolidWorks Enterprise PDM in a design company
Krajger, Oliver ; Morávek, Petr (referee) ; Šeda, Miloš (advisor)
This bachelor work deals with the problem of implementation of company management of construction data called PDM (Product Data Management). The aim of this work is to present SolidWorks Enterprise PDM, its options during implementation and especially the processes of the lifecycle of the PDM implementation. Additionally it presents its linking to company information systems, which, together with CAD (Computer-aided design) systems, make up the core of PLM solutions (Product Lifecycle Management) of management of products. The closing part of the work shows a summary of all information into a particular example of analysis, solution concept, and configuration of SolidWorks Enterprise PDM in T Machinery a.s. construction company as well as the benefits of the implemented system.
|
|
|
Description Methods for Electrical Systems and Their Solving
Křižka, Jakub ; Němec, Zdeněk (referee) ; Šeda, Miloš (advisor)
The objective of bachelor thesis is a searching description of methods, which are usually used for calculation of circuit variable values in electric circuits. At the beginning is thesis concerning with description of individual components (power supplies, electronic components) used in electric circuits, then also with analysis of rules, which are the fundamental for a calculation of values in electronic circuit – Ohm’s rule and Kirchhoff’s rules. Indivisible part of thesis is also summary of special methods, such as method of loop currents (mesh analysis), method of nodal voltage (nodal analysis) etc. and their demonstration on examples of electric circuits. The structure of thesis is coursebook and gives successive summary of information in area calculations of electric circuits.
|
|
| |
|
|
Application of Voronoi Diagrams in Robot Motion Planning
Chaloupka, Luděk ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
This bachelor thesis is focused on the theme of robot motion planning. The motion of dimensionless (i.e. point) robot without any restriction of motion and on the stage with static obstacles (also point) forms the fundamental issue of the thesis. The thesis also contains the implementation of presented algorithm of given level of exercises and definition of appropriate method.
|
|
|
Minimisation of Logical Functions
Horký, Miroslav ; Davidová, Olga (referee) ; Šeda, Miloš (advisor)
For minimisation of logical functions, laws of the Boolean algebra and the Karnaugh maps are mostly used. However, use of Karnaugh's maps is based on visual recognition of adjacent cells for functions with no more than 6 variables and, therefore, the method is not suitable for automated processing on computers. A direct application of the Boolean algebra laws is not restricted in this way, but there is no general algorithm defining the sequence of their application and thus this approach is not suitable for computer implementation either. The well-known method usable on computers is the algorithm proposed by E. J. McCluskey and W. Orman Quine.
|
|
|
Sorting Algorithms
Richter, Jan ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The bachelor thesis deals with basic types of sorting algorithms. We are able to divide these algorithms into two groups, which are elementary (direct) sorting algorithms and difficult (optimized) ones. From the group of direct algorithms, the thesis is dedicated to algorithms of direct paste, direct selection, and direct exchange, which could be further divided into bubblesort and shakersort. From the second group of optimized algorithms in the thesis, sorting with miniaturizing of steps (Shellsort) and dividing sorting (Quicksort) are described. In context of these algorithms, I deal with syntaxes and also effectiveness, with which they are able to sort the given system. Criteria of effectiveness are comparison and movement calculations, which are the function of only one parameter – the number of members in the system.
|
|
|
Winery Stock Management
Michlík, Pavel ; Šeda, Miloš (referee) ; Poliščuk, Radek (advisor)
This bachelor thesis deals with the analysis of available solutions and the creation of a new simple application of stock holdings for vinotheque. The main task was to build a simple corporate data management system in order to manage certain agendas and presentation of wine products in the form of an e-shop. The result of the work is presented an www application based on PHP5 scripting language and MySQL5 database system.
|
|
|
Sorting algorithms
Lýsek, Jiří ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
|
|
| |
guest ::
RSS feed.