Sökning: "path way"

Visar resultat 11 - 15 av 263 avhandlingar innehållade orden path way.

  1. 11. Provisioning Strategies for Transparent Optical Networks Considering Transmission Quality, Security, and Energy Efficiency

    Författare :Amornrat Jirattigalachote; Lena Wosinska; Paolo Monti; Biswanath Mukherjee; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; transparent optical networks; routing and wavelength assignment; physical-layer impairments; signal quality; differentiation of services; physical-layer attacks; power equalizers; Greedy Randomized Adaptive Search Procedure GRASP ; green networks; energy awareness; dedicated path protection; shared path protection; survivable WDM networks;

    Sammanfattning : The continuous growth of traffic demand driven by the brisk increase in number of Internet users and emerging online services creates new challenges for communication networks. The latest advances in Wavelength Division Multiplexing (WDM) technology make it possible to build Transparent Optical Networks (TONs) which are expected to be able to satisfy this rapidly growing capacity demand. LÄS MER

  3. 12. Multi-oriented Symplectic Geometry and the Extension of Path Intersection Indices

    Författare :Serge de Gosson de Varennes; Andrei Khrennikov; Ernst Binz; Växjö universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Symplectic geometry; algebraic topology; mathematical physics; Maslov index; Conley-Zehnder index; Leray index path intersection indices.; MATHEMATICS; MATEMATIK;

    Sammanfattning : Symplectic geometry can be traced back to Lagrange and his work on celestial mechanics and has since then been a very active field in mathematics, partly because of the applications it offers but also because of the beauty of the objects it deals with.I this thesis we begin by the simplest fact of symplectic geometry. LÄS MER

  4. 13. Sensitivity, Variation, and Application of Least-Cost Path Models in Landscape Connectivity Analysis and Corridor Planning

    Författare :Rachel Mundeli Murekatete; Takeshi Shirabe; Gyözö Gidofalvi; Jean Pierre Bizimana; Gerhard Navratil; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Landscape connectivity; Conservation corridor; Stepping stones; Effective distance; Geographic Information Systems; Raster data; Land evaluation; Suitability analysis; Cost surface; Suitability surface; Ordinal scale; Least-cost path; Spatial resolution; Landskapsanslutning; Bevarandekorridor; Stegbräda; Effektivt avstånd; Geografiska informationssystem; Rasterdata; Markutvärdering; Lämplighetsanalys; Kostnadsyta; Lämplighetsyta; Ordinal skala; Lägsta kostnadsväg; Rumslig upplösning; Geoinformatik; Geoinformatics;

    Sammanfattning : In recent decades, Rwanda has been affected by the loss and fragmentation of natural habitats for native species of animals and plants. As a consequence, landscape connectivity—i.e. LÄS MER

  5. 14. Driver-Vehicle Interaction : Identification, Characterization and Modelling of Path Tracking Skill

    Författare :Andreas Erséus; Stensson Trigell Annika; David Cole; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Vehicle engineering; Farkostteknik; Psychology; Psykologi;

    Sammanfattning : Since the dawn of the automobile, driver behaviour has been an issue. Driving can result in accidents that may harm not only the driver but also passengers and the surroundings. This calls for measures that restrict the usage of vehicles and to assist the individual driver to conduct the driving in a safe, yet practically efficient manner. LÄS MER

  7. 15. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER