| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 24
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
Optimization methods for solving transportation problems on networks
Katja Prnaver, 2011, doktorska disertacija

Opis: In this thesis we study problems from real situations, which can be applied to network graphs and solved using mathematical graph theory. We start with the problem of oriented network design. The problem originates from networks, where the flow over the arcs is important and many times limited with the capacity of the networks. There are several techniques and results on the problem of assigning the flow through the network channels. In our problem, we try to find the optimal network structure, which could be used in the design phase of the network. With metaheuristics, we search for optimal network structures for a given number of nodes. We define triangle neighborhood and compare the results of the algorithm with the conjecture by Choplin et al. [8]. Further, we study the problem of order picking and order batching in block structured warehouses. For order picking problem, we present the extension of a dynamic programming algorithm by Ratliff and Rosenthal [42], which enables the development of an algorithm for an unlimited number of blocks. In order to achieve this, a new presentation of states and transitions of dynamic programming algorithm is given. We prove that the resulting path is optimal for the given structure. We compare the optimal path lengths to the results found in literature and also investigate the impact of warehouse layout parameters onto the routing. Closely related to the problem of order picking, we investigate the order batching problem. We discuss the variation of the order batching problem with time windows and present the algorithmic approach to solving the problem. The previously presented optimal path algorithm is applied in the algorithm to ensure even better quality of results. We introduce the evaluation function of a batch and compare the results of the algorithm with the test data from the literature as well as with data from the real warehouse. We conclude by summarizing the results and stating some possible extensions and further work.
Ključne besede: graph theory, networks, optimization, shortest path problem, traveling salesman problem, algorithms, metaheuristics, order batching
Objavljeno: 03.06.2011; Ogledov: 3767; Prenosov: 147
.pdf Celotno besedilo (925,86 KB)

2.
PREVAJANJE »CRASH BLOSSOMS«
Pija Samec, 2011, diplomsko delo

Opis: Enega izmed najstarejših virov novic predstavljajo tiskani mediji, med njimi predvsem časopisi in revije. Z razmahom interneta se je večina časopisnih hiš odločila, da bo tiskanim izdajam dodala še spletne in svojim bralcem tako omogočila še lažje in hitrejše dostopanje do aktualnih novic. Pri prebiranju časopisa (pa naj bo to tiskana ali spletna izdaja) našo pozornost najprej pritegnejo veliki naslovi časopisnih člankov, ki pa so večkrat površno napisani in zaradi tega tudi dvoumni. Taki naslovi so v novinarstvu prisotni že od samega začetka, vendar se je z razmahom spletnih izdaj časopisov njihovo število drastično povečalo. Šele pred kratkim so ti ponesrečeni časopisni naslovi dobili ime »crash blossoms« in hitro postali predmet jezikoslovnih raziskovanj. Ker živimo v času, ko »primanjkuje informacij«, je večina novinarjev prisiljenih novice iskati v tujih virih in jih povzemati. Nato jih tudi prevajajo in to brez pomoči prevajalca. Prevajanje že dvoumnih naslovov pa lahko predstavlja veliko težavo, če novinar ni usposobljen za tako delo. Namen mojega diplomskega dela je bil, ugotoviti razlike med metodami prevajanja dvoumnih naslovov časopisnih člankov (»crash blossoms«), ki jih uporabljajo študenti prevajalstva in študenti novinarstva. Te razlike sem osvetlila s pomočjo teorije skoposa, ki predstavlja univerzalen pristop k prevajanju in prevajalcu pomaga doseči ustrezen namen. Ugotovila sem, da med študenti prevajalstva in študenti novinarstva obstajajo razlike v načinu prevajanja. Študenti prevajalstva so, zaradi svojega šolanja, primere dvoumnih časopisnih naslovov prevajali bolje kot študenti novinarstva, ki za to delo niso dobro usposobljeni. S pomočjo teorije skoposa sem dokazala, da take vrste naslovov lahko prevajamo dobesedno ali pa prosto, vendar nikoli ne smemo zanemariti bralčevega razumevanja. Tisti novinarji, ki povzemajo tuje novice in nimajo dovolj znanja o angleškem jeziku ali prevajanju, bi v takih primerih za nasvet morali prositi šolanega prevajalca, ki bi jim pomagal prepoznati in odpraviti dvoumnost.
Ključne besede: • prevajanje časopisnih naslovov, • »crash blossoms«, • »headlinese«, • »garden-path sentences«, • prevajalske metode, • teorija skoposa, • vpliv prevajanja »crash blossoms« na slovenski jezik
Objavljeno: 27.02.2012; Ogledov: 1856; Prenosov: 184
.pdf Celotno besedilo (435,50 KB)

3.
4.
Intelligent programming of CNC turning operations using genetic algorithm
Jože Balič, Miha Kovačič, Boštjan Vaupotič, 2006, izvirni znanstveni članek

Opis: CAD/CAM systems are nowadays tightly connected to ensure that CAD data can be used for optimal tool path determination and generation of CNC programs for machine tools. The aim of our research is the design of a computer-aided, intelligent and genetic algorithm(GA) based programming system for CNC cutting tools selection, tool sequences planning and optimisation of cutting conditions. The first step is geometrical feature recognition and classification. On the basis of recognised features the module for GA-based determination of technological data determine cutting tools, cutting parameters (according to work piece material and cutting tool material) and detailed tool sequence planning. Material, which will be removed, is split into several cuts, each consisting of a number of basic tool movements. In thenext step, GA operations such as reproduction, crossover and mutation are applied. The process of GA-based optimisation runs in cycles in which new generations of individuals are created with increased average fitness of a population. During the evaluation of calculated results (generated NC programmes) several rules and constraints like rapid and cutting tool movement, collision, clamping and minimum machining time, which represent the fitness function, were taken into account. A case study was made for the turning operation of a rotational part. The results show that the GA-based programming has a higher efficiency. The total machining time was reduced by 16%. The demand for a high skilled worker on CAD/CAM systems and CNC machine tools was also reduced.
Ključne besede: CNC programming, genetic algorithm, intelligent CAM, turning, tool path generation
Objavljeno: 30.05.2012; Ogledov: 1312; Prenosov: 54
URL Povezava na celotno besedilo

5.
System for precise balancing and controlled unbalancing of fiber-optic interferometers
Irvin Sirotić, Denis Đonlagić, 2002, izvirni znanstveni članek

Opis: A system for accurate balancing and controlled unbalancing of the optical path difference in all-fiber optical interferometers is described. Interferometers with various arm lengths (1-30m) and with initial optical pathdifferences of as much as 1 cm have been successfully balanced within a 5 ▫$mu$▫m range. In addition, the proposed system allows for controlled unbalancing of arbitrary all-fiber optical interferometers with a precision better than 5 ▫$mu$▫m.
Ključne besede: electrical measurements, optical instruments, interferometers, fiber interferometers, optical path difference, sensor systems
Objavljeno: 01.06.2012; Ogledov: 720; Prenosov: 51
URL Povezava na celotno besedilo

6.
An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
Ignasi Sau Walls, Janez Žerovnik, 2006

Opis: In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination of no more than one packet. We study this problem in an hexagonal network (that is, a finite convex subgraph of a triangular grid), a widely used network in practical applications. We use the addressing scheme described by F.G. Nocetti, I. Stojmenovic and J. Zhang (2002, IEEE Trans. on Parallel and Distrib. Systems). In this paper, a distributed optimal routing algorithm for full-duplex hexagonal mesh networks is presented. Furthermore, we prove that this algorithm is oblivious and translation invariant.
Ključne besede: mathematics, hexagonal networks, permutation routing, shortest path, distributed algorithm, communication networks, oblivious algorithm
Objavljeno: 10.07.2015; Ogledov: 370; Prenosov: 21
URL Povezava na celotno besedilo

7.
Characterizing posets for which their natural transit functions coincide
Boštjan Brešar, Manoj Changat, Sandi Klavžar, Joseph Mathews, Antony Mathews, Prasanth G. Narasimha-Shenoi, 2009, izvirni znanstveni članek

Opis: Standardna tranzitna funkcija delno urejene množice ▫$P$▫ je funkcija ▫$T_P$▫, ki vsakemu paru primerljivih elementov priredi interval med njima, za neprimerljiva elementa ▫$x,y$▫ pa je ▫$T_P(x,y) = {x,y}$▫. Na tri načine, tudi s prepovedanimi delno urejenimi podmnožicami, okarakteriziramo tiste delno urejene množice, v katerih standardna tranzitna funkcija sovpada s tranzitno funkcijo najkrajših poti njenega grafa pokritij-neprimerljivosti.
Ključne besede: matematika, teorija grafov, tranzitna funkcija, rangirana delno urejena množica, temeljni graf, geodetski interval, interval induciranih poti, mathematics, graph theory, transit function, ranked poset, underlying graph, geodesic interval, induced-path interval
Objavljeno: 10.07.2015; Ogledov: 497; Prenosov: 58
URL Povezava na celotno besedilo

8.
Graphʼs theory approach for searching the shortest routing path in RIP protocol
Saša Klampfer, Jože Mohorko, Žarko Čučej, Amor Chowdhury, 2012, izvirni znanstveni članek

Opis: Routing is a problem domain with an infinite number of final-solutions. One of the possible approaches to solving such problems is using graph theory. This paper presents mathematical analysis methodologies based on circular graphs for solving a shortest path routing problem. The problem is focused on searching for the shortest path within a circular graph. Such a search coincides with the network routing problem domain. In this paper, we introduce in the detail all necessary parts needed to understand such an approach. This includes: definition of the routing problem domain, introduction to circular graphs and their usage, circular graphʼs properties, definition of walks through a circular graph, searching and determining the shortest path within a circular graph, etc. The state of the art routing methods, implemented in contemporary highly sophisticated routers, includes well-known weight-based algorithms and distance-vectors-based algorithms. The proposed solution can be placed between the two abovementioned methods. Each of these known methods strives for optimal results, but each of them also has its own deficiencies, which should be rectified with the proposed new method. This theoretically presented method is argued by a practical example and compared with the RIP (Routing Information Protocol) technique, where we look for the shortest path and possible walks through a specified circular graph.
Ključne besede: circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph
Objavljeno: 10.07.2015; Ogledov: 930; Prenosov: 43
URL Povezava na celotno besedilo

9.
On the k-path vertex cover of some graph products
Marko Jakovac, Andrej Taranenko, 2013, izvirni znanstveni članek

Opis: A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ▫$psi_k$▫(G) the minimum cardinality of a k-path vertex cover in G. In this paper, improved lower and upper bounds for ▫$psi_k$▫ of the Cartesian and the strong product of paths are derived. It is shown that for ▫$psi_3$▫ those bounds are tight. For the lexicographic product bounds are presented for ▫$psi_k$▫, moreover ▫$psi_2$▫ and ▫$psi_3$▫ are exactly determined for the lexicographic product of two arbitrary graphs. As a consequence the independence and the dissociation number of the lexicographic product are given.
Ključne besede: matematika, teorija grafov, vozliščno pokritje, po poteh vozliščno pokritje, disociacijsko število, neodvisnostno število, grafovski produkti, mathematics, graph theory, vertex cover, path vertex cover, dissociation number, independence number, graph products
Objavljeno: 10.07.2015; Ogledov: 416; Prenosov: 7
URL Povezava na celotno besedilo

10.
Iskanje izvedeno v 0.26 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici