The aim of this work was to create an original and unique design of a door handles, which naturally fits into contemporary architectural space. Another goal was to create a project which could be realized in practice and would be successful in compares with mass produced handles.

The subject of this thesis is design of stand for assembly of srew-inserts into car door handles. It contains of search of possible technical solutions of part handling and available technologies of screw-insert instalation. In design part of thesis contains of analysis of construction and choice of technologies. In construction part of my thesis u can find description construction of stand and risk analysis of this machine. Moreover there are calculations, drawings of main assemblies of machine and model of stand modeled in Autodesk Inventor.

<p>Doktorska disertacija se bavi temama rešavanja računarski teških<br />problema kombinatorne optimizacije. Istaknut je problem maksimalne<br />klike kao predstavnik određenih struktura u grafovima. Problem<br />maksimalne klike i sa njim povezani problemi su formulisani kao<br />nelinearne funkcije. Rešavani su sa ciljem otkrivanja novih metoda<br />koje pronalaze dobre aproksimacije rešenja za neko razumno vreme.<br />Predložene su varijante Metode promenljivih okolina na rešavanje<br />maksimalne klike u grafu. Povezani problemi na grafovima se mogu<br />primeniti na pretragu informacija, raspoređivanje, procesiranje<br />signala, teoriju klasifikacije, teoriju kodiranja, itd. Svi algoritmi<br />su implementirani i uspešno testirani na brojnim različitim<br />primerima.</p> / <p>This Ph.D. thesis addresses topics NP hard problem solving approaches in<br />combinatorial optimization and according to that it is highlighted maximum<br />clique problem as a representative of certain structures in graphs. Maximum<br />clique problem and related problems with this have been formulated as non<br />linear functions which have been solved to research for new methods and<br />good solution approximations for some reasonable time. It has been<br />proposed several different extensions of Variable Neighborhood Search<br />method. Related problems on graphs could be applied on information<br />retrieval, scheduling, signal processing, theory of classi_cation, theory of<br />coding, etc. Algorithms are implemented and successfully tested on various<br />different tasks.</p>

The dissertation consists of two parts. In the first part several asymptotic properties of random intersection graphs are studied. They include birth thresholds for small complete subgraphs in the binomial random intersection graph, the clique number in sparse random intersection graphs and the chromatic index of random uniform hypergraphs. Several new methods and theoretically and practically relevant algorithms are proposed. Some results are illustrated with data from real-world networks. The second part deals with asymptotic enumeration and properties of graphs from minor-closed classes in the case when the excluded minors are disjoint. The class of graphs without k+1 (vertex-)disjoint cycles and more general classes of graphs without k+1 disjoint excluded minors (satisfying a condition related to fans) are considered. Typical graphs in such classes are shown to have a simple “k apex vertex” structure. Other asymptotic properties (connectivity, number of components, chromatic number, vertex degrees) are also determined. Finally, it is shown that typical graphs without k+1 disjoint minors K4 have a more complicated “2k+1 apex vertex” structure, and properties of such graphs are investigated. Part of the results is proved in greater generality. A variety of methods from computer science, graph theory, combinatorics and the theory of generating functions are applied. / Disertacijoje yra dvi pagrindinės dalys. Pirmojoje dalyje gaunami keli nauji rezultatai uždaviniams, susijusiems su atsitiktiniais sankirtų grafais. Nagrinėjamas pilnojo pografio gimimo slenkstis binominiame atsitiktiniame sankirtų grafe, didžiausios klikos eilė atsitiktiniame retame sankirtų grafe ir chromatinio indekso eilė atsitiktiniame reguliariajame hipergrafe. Sprendimams pasiūloma keletas naujų metodų, taip pat pateikiami teoriškai ir praktiškai svarbūs algoritmai. Kai kurie rezultatai iliustruojami duomenimis iš realių tinklų. Antrojoje dalyje pristatomi rezultatai grafų su uždraustaisiais minorais tematikoje, nagrinėjamas atvejis kai uždraustieji minorai yra nejungūs. Čia tiriamas asimptotinis grafų, neturinčių k+1 nepriklausomų ciklų, skaičius, rezultatai apibendrinami grafų, neturinčių k+1 uždraustųjų minorų, tačiau tenkinančių tam tikrą „vėduoklės“ apribojimą, klasėms. Įrodoma, kad tipiniai tokių klasių grafai turi paprastą „k dydžio blokatoriaus“ struktūrą, nustatomos kitos tokių grafų asimptotinės savybės (jungumas, komponenčių skaičius, viršūnių laipsniai). Galiausiai parodoma, kad tipiniai grafai, neturintys k+1 nepriklausomų minorų K4 turi sudėtingesnę „2k+1 dydžio blokatoriaus“ struktūrą ir ištiriamos kitos jų savybės. Dalis šių rezultatų įrodoma daug bendresniu atveju. Darbe pasitelkiami įvairūs informatikos, kombinatorikos, grafų, tikimybių ir generuojančiųjų funkcijų teorijos metodai.