| | 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


21 - 30 / 310
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
21.
22.
23.
Modelling airport congestion charges
Milan Janić, 2005, izvirni znanstveni članek

Opis: This article deals with modelling congestion charges at an airport. In this context, congestion charging represents internalizing the cost of marginal delays that a flight imposes on other flights due to congestion. The modelling includes estimating congestion and flight delays, the cost of these delays and the efficiency of particular flights following the introduction ofa congestion charge. The models are applied to an airport / New York LaGuardia / to illustrate their ability to handle more realistic congestion scenarios as well as the nature of the congestion to be charged, the effectiveness of the congestion charge and a sensitivity analysis based on changes in the nature of congestion as well as characteristics of demand in terms of flight-aircraft type and airport capacity.
Ključne besede: airport, congestion charging, queueing theory, diffusion approximation, New York LaGuardia airport
Objavljeno: 05.06.2012; Ogledov: 721; Prenosov: 46
URL Povezava na celotno besedilo

24.
25.
Embedding of complete and nearly complete binary trees into hypercubes
Aleksander Vesel, 2011, objavljeni znanstveni prispevek na konferenci

Opis: A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.
Ključne besede: mathematics, graph theory, embedding, binary trees, algorithm
Objavljeno: 07.06.2012; Ogledov: 899; Prenosov: 18
URL Povezava na celotno besedilo

26.
Otherness - challenge or obstacle in multimedia translation
Barbara Majcenovič Kline, 2011, strokovni članek

Opis: As the world becomes increasingly unified, there is a growing tendency for language transfer in audiovisual media. Media are one of many different channels through which globalization is rapidly occurring. Although audiovisual (or multimedia) translation may not have been discussed much until recently, in the last twenty years, awareness of the importance of this kind of communication has grown considerably because the development of new technologies. This paper will examine whether translation training is keeping up with theory on the translation process and its product. It will address such issues as how to acquire multimedia translation competence, how to design a lesson to achieve long-term goals, and how to determine the teacher's and the student's roles in translation activities. I will discuss possible ways of introducing the predominant and/or prevailing types of multimedia translation to students of translation, giving some practical examples for classroom dynamics.
Ključne besede: translation, theory of translation, multimedia translation, audiovisual translation, classroom dynamics
Objavljeno: 07.06.2012; Ogledov: 743; Prenosov: 11
URL Povezava na celotno besedilo

27.
Wide diameter of Cartesian graph bundles
Iztok Banič, Janez Žerovnik, 2010, objavljeni znanstveni prispevek na konferenci

Opis: Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width ▫$k$▫ of a graph ▫$G$▫, ▫$k$▫-diameter, is defined as the minimum integer ▫$d$▫ for which there exist at least ▫$k$▫ internally disjoint paths of length at most ▫$d$▫ between any two distinct vertices in ▫$G$▫. Denote by ▫${mathscr D}_c(G)$▫ the ▫$c$▫-diameter of ▫$G$▫ and ▫$kappa(G)$▫ the connectivity of ▫$G$▫. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a Cartesian graph bundle with fiber ▫$F$▫ over base ▫$B$▫, ▫$0 < a le kappa(F)$▫, and ▫$0 < b le kappa(B)$▫. We prove that ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B) + 1$▫. Moreover, if ▫$G$▫ is a graph bundle with fiber ▫$F ne K_2$▫ over base ▫$B ne K_2$▫, then ▫${mathscr D}_{a+b}(G) le {mathscr D}_a(F) + {mathscr D}_b(B)$▫. The bounds are tight.
Ključne besede: mathematics, graph theory, Cartesian graph products, Cartesian graph bundles, wide diameter
Objavljeno: 07.06.2012; Ogledov: 1005; Prenosov: 49
URL Povezava na celotno besedilo

28.
The problem of gender in English-Slovene translation
Tamara Žerjav, 2010, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: translation, feminist translation theory, gender markedness, androcentrism
Objavljeno: 07.06.2012; Ogledov: 823; Prenosov: 32
URL Povezava na celotno besedilo

29.
30.
The b-chromatic number of cubic graphs
Marko Jakovac, Sandi Klavžar, 2009, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: graph theory, chromatic number, graphs, Petersen graph, cubic graphs
Objavljeno: 07.06.2012; Ogledov: 983; Prenosov: 82
URL Povezava na celotno besedilo

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