Wyniki wyszukiwania dla: K-SHORTEST PATH - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: K-SHORTEST PATH

Wyniki wyszukiwania dla: K-SHORTEST PATH

  • Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing

    Publikacja

    - Rok 2006

    Pełny tekst do pobrania w serwisie zewnętrznym

  • k-Penalty: A Novel Approach to Find k-Disjoint Paths with Differentiated Path Costs

    Publikacja

    W artykule rozpatrywany jest problem ochrony dedykowanej na wypadek awarii wielokrotnej elementów sieci teleinformatycznej. Wspomniana ochrona jest możliwa do zapewnienia poprzez wyznaczenie i zainstalowanie zbioru k rozłącznych ścieżek dla każdego żądania. W szczególności rozpatrywany jest problem wyznaczenia k rozłącznych ścieżek w sieciach typu ''multi-cost'', w przypadku których koszt dowolnego łącza może być różny dla każdej...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios

    Publikacja
    • T. Gomes
    • L. Jorge
    • R. Girão-Silva
    • J. Yallouz
    • P. Babarczi
    • J. Rak

    - Rok 2020

    Disjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Sylwester Kaczmarek dr hab. inż.

    Sylwester Kaczmarek ukończył studia w 1972 roku jako mgr inż. Elektroniki, a doktorat i habilitację uzyskał z technik komutacyjnych i inżynierii ruchu telekomunikacyjnego w 1981 i 1994 roku na Politechnice Gdańskiej. Jego zainteresowania badawcze ukierunkowane są na: sieci IP QoS, sieci GMPLS, sieci SDN, komutację, ruting QoS, inżynierię ruchu telekomunikacyjnego, usługi multimedialne i jakość usług. Aktualnie jego badania skupiają...

  • Exploiting multi-interface networks: Connectivity and Cheapest Paths

    Publikacja

    - WIRELESS NETWORKS - Rok 2010

    Let G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Dynamic unattended measurement based routing algorithm for diffServ architecture

    Publikacja

    - Rok 2010

    Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Simulation model for evaluation of QoS routing algorithm in large packet networks

    The variety of traffic transferred via current telecommunication networks includes also voice, which should meet quality requirements. One of mechanisms, which can support QoS in current packet networks, is routing. There exist many routing proposals which should introduce the QoS into the network but practically they don't. Following paper presents the realization of simulation model for evaluation of a new routing algorithm DUMBRA...

  • Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm

    The paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework

    Publikacja

    - OCEAN & COASTAL MANAGEMENT - Rok 2024

    The rapid development of shipping trade pushes automated container terminals toward the direction of intelligence, safety and efficiency. In particular, the formulation of AGV scheduling tasks and the safety and stability of transportation path is an important part of port operation and management, and it is one of the basic tasks to build an intelligent port. Existing research mainly focuses on collaborative operation between...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Routing decisions independent of queuing delays in broadband leo networks

    Publikacja

    - Rok 2009

    This paper presents an analysis of queuing and propagation delays of Inter-Satellite Links (ISLs) in broadband Low-Earth Orbit (LEO) satellite networks. It is shown that queuing delays are negligible in all reasonable working conditions of the broadband ISL network. This fact makes it possible to simplify the routing protocols in such networks and permits using already known multi-commodity flow solutions for routing. The performance...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Using River Formation Dynamics Algorithm in Mobile Robot Navigation

    River Formation Dynamics is a heuristic optimization algorithm based on the manner, in which drops of water form the river bed. The idea is to imitate the movement of drops on the edges between given nodes thus performing a search based on their height, which is modified through the mechanism of soil erosion and sediment deposition. In this way decreasing gradients are constructed, and these are followed by subsequent drops to...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The convex domination subdivision number of a graph

    Publikacja

    Let G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...

    Pełny tekst do pobrania w portalu

  • Weakly convex and convex domination numbers of some products of graphs

    If $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...

  • Detection of the First Component of the Received LTE Signal in the OTDoA Method

    In a modern world there is a growing demand for localization services of various kinds. Position estimation can be realized via cellular networks, especially in the currently widely deployed LTE (Long Term Evolution) networks. However, it is not an easy task in harsh propagation conditions which often occur in dense urban environments. Recently, time-methods of terminal localization within the network have been the focus of attention,...

    Pełny tekst do pobrania w portalu

  • Lower bound on the distance k-domination number of a tree

    W artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • An Efficient Noisy Binary Search in Graphs via Median Approximation

    Publikacja

    - LECTURE NOTES IN COMPUTER SCIENCE - Rok 2021

    Consider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Data Mining Path

    Kursy Online
    • G. Gołaszewski
    • T. Zawadzka
    • A. Karpus
    • M. Wróbel
    • A. Przybyłek
    • W. Waloszek
    • A. Landowska

    Within this path, various issues regarding data mining and their practical application in various systems are discussed.   4 semestr specjalności ISI i ZAD

  • The complexity of minimum-length path decompositions

    Publikacja

    We consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • A Framework for Searching in Graphs in the Presence of Errors

    Publikacja

    - Rok 2019

    We consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Basics of Data Warehouses Path

    Kursy Online
    • A. Nabożny
    • G. Gołaszewski
    • T. Zawadzka
    • K. Goczyła

    Within this path the basic aspects of data warehouses (architecture, star schema, etc.) are discussed. The course is intended for students of the 1st degree of Informatics Field (semester 5) -  Kurs planowany dla studentów I stopnia kierunku informatyka (semestr 5) - przedmiot Hurtownie danych oraz dla studentów II stopnia kierunku informatyka, specjalność ZAD.

  • Finding small-width connected path decompositions in polynomial time

    Publikacja

    A connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...

    Pełny tekst do pobrania w portalu

  • (Vapour + liquid) equilibrium in (n,n-dimethylacetamide + ethanol + water) at the temperature 313.15 K

    W pracy prezentowane są pomiary całkowitej prężności pary dla tytułowego układu trójskładnikowego oraz dla składowych układów binarnych. Uzyskane w pracy wyniki porównane zostały z wcześniejszymi danymi dla podobnych układów. Znaleziono w przybliżeniu liniową zależność pomiędzy wartościami nadmiarowej entalpii swobodnej Gibbsa a objętością molową amidu, spełnianą w układach dwuskładnikowych: amid + alkohol alifatyczny.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Termination functions for evolutionary path planning algorithm

    Publikacja

    In this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...

  • Path-based methods on categorical structures for conceptual representation of wikipedia articles

    Machine learning algorithms applied to text categorization mostly employ the Bag of Words (BoW) representation to describe the content of the documents. This method has been successfully used in many applications, but it is known to have several limitations. One way of improving text representation is usage of Wikipedia as the lexical knowledge base – an approach that has already shown promising results in many research studies....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The Niching Mechanism in the Evolutionary Method of Path Planning

    This paper presents the concept of the niching mechanism in the evolutionary method of path planning. The problem is considered based on the example of a ship path planning. In this method the diversity of individuals is tested in respect to their physical distance, not the fitness function value. The researches show that such an approach increases effectiveness of solution space exploration, what results in a final solution with...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Impact of Initial Population on Evolutionary Path Planning Algorithm

    Publikacja

    In this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal shippaths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....

  • Measurement of Latency in the Android Audio Path

    Publikacja

    This paper provides a description of experimental investigations concerning comparison between the audio path characteristics of various Android versions. First, information about the changes in each system version in the context of latency caused by them is presented. Then, a measurement procedure employing available applications to measure latency is described comparing to results contained in the Internet. Finally, a comparison...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Impact of Initial Population on Evolutionary Path Planning Algorithm

    Publikacja

    In this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....

  • K-THEORY

    Czasopisma

    ISSN: 0920-3036

  • Path dependence, modularity and the offshoring of (some) physician services

    Publikacja

    - Rok 2010

    This paper integrates ideas from modularity and path dependency to explain the potential for and limitations of the offshoring of high value added physician services. While not all medical services are amenable to offshoring, a growing number of physician activities can be viewed as modular components which, at least technically, could be performed remotely. As a result, the presumption that concerns for efficiency dictate how...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Propagation Path Loss Modeling in Container Terminal Environment

    This paper describes novel method of path loss modeling for radio communication channels in container port area. Multi-variate empirical model is presented, based on multidimensional regression analysis of real path loss measurements from container terminal environment. The measurement instruments used in propagation studies in port area are also described.

    Pełny tekst do pobrania w portalu

  • Evaluation of Path Based Methods for Conceptual Representation of the Text

    Publikacja

    Typical text clustering methods use the bag of words (BoW) representation to describe content of documents. However, this method is known to have several limitations. Employing Wikipedia as the lexical knowledge base has shown an improvement of the text representation for data-mining purposes. Promising extensions of that trend employ hierarchical organization of Wikipedia category system. In this paper we propose three path-based...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Zuschrift zu Stiglat K.: Bauingenieure und ihr Werk: ein Arbeitsbericht. // Stahlbau 73 (2004), H. 11, S. 873-878

    Publikacja

    - STAHLBAU - Rok 2006

    W dyskusji poruszono związki humanistyki, a głównie - poezji, z techniką.

  • Reactivity induced at 25 K by low-energy electron irradiation of condensed NH3-CH3COOD (1:1) mixture

    Publikacja
    • A. Lafosse
    • M. Bertin
    • A. Domaracka
    • D. Pliszka
    • E. Illenberger
    • R. Azria

    - PHYSICAL CHEMISTRY CHEMICAL PHYSICS - Rok 2006

    W wyniku bombardowania niskoenergetycznymi elektronami skondensowanej mieszaniny kwasu octowego (CH3COOD) i amoniaku (NH3) następuje synteza najprostszego aminokwasu - glicyny - bez potrzeby dodatkowej aktywacji termicznej. Filmy molekularne przed i po bombardowaniu elektronami były badane techniką HREELS.

  • Path Loss Analysis in Off-Body Channels in Indoor Environment

    Publikacja

    - Rok 2015

    This temporary document describes an analysis of path loss in off-body channels in an indoor environment. The influence of body orientation and on-body antenna placement on path loss in off-body communications as well as of different bodies has been investigated. Five static scenarios, six distances between body and antenna and eight body orientations were analysed; moreover, two dynamic scenarios were investigated. The smallest...

  • Path Loss Modelling in the Untypical Outdoor Propagation Environments

    Publikacja

    In the paper three ways of path loss modelling in the untypical outdoor environments are presented. The exemplary untypical outdoor environment is analyzed. The investigated environment is characterized, and the measurement campaign are shortly described. The following models have been analyzed: the COST231 Walfisch-Ikegami model, the modified COST231Walfisch-Ikegami model tuned on the basis of empirical data, and the empirical...

  • Measurements of Path Loss in Off-Body Channels in Indoor Environments

    Publikacja

    - Rok 2014

    This paper presents a measurements of the path loss for validation of a statistical model for off-body radio channels in an indoor multipath environment, which considers the distance dependent mean path loss, and describes body shadowing and fast fading components in a statistical way. The measurement equipment and propagation indoor environment have been presented. Two different bodies and five static and two walking scenarios...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On extremal sizes of locally k-tree graphs

    Publikacja

    - CZECHOSLOVAK MATHEMATICAL JOURNAL - Rok 2010

    A graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • New First - Path Detector for LTE Positioning Reference Signals

    Publikacja

    - Rok 2014

    In today's world, where positioning applications reached a huge popularity and became virtually ubiquitous, there is a strong need for determining a device location as accurately as possible. A particularly important role in positioning play cellular networks, such as Long Term Evolution (LTE). In the LTE Observed Time Difference of Arrival (OTDOA) positioning method, precision of device location estimation depends on accuracy...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Comparison of Selection Schemes in Evolutionary Method of Path Planning

    Publikacja

    - LECTURE NOTES IN COMPUTER SCIENCE - Rok 2011

    This article compares an impact of using various selection schemes on the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. In study case problem of avoiding collisions at sea is analyzed. The modelled environment includes static constraints (lands, canals, etc.) and dynamic objects (moving ships). Article analyses behaviour of selection schemes in two similar environments...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Path Loss Modelling for Location Service Applications

    The aim of this paper is the path loss modeling for the radiolocation services in radiocommunication networks, particularly in cellular networks. The main results of the measurements obtained in the physical layer of the UMTS are introduced. A new method for the utilization of the multipath propagation phenomenon to improve the estimation of the distance between the mobile station (MS) and the base station (BS) is outlined. This...

  • Path Loss Measurements in Wideband Radio Link Designed for Maritime Environment

    In the article, the research and analysis of path loss in designed and evaluated digital radio link for high-speed data transmission in maritime environment is presented. Collected samples of received signal were used to determine the mean path loss and its standard deviation. Measuring campaign was carried out in a real maritime conditions. The mean value of path loss reached 126 dB on a distance of 11.16 km.

  • K & K (formerly Kultur og klasse)

    Czasopisma

    ISSN: 0905-6998

  • Measurements of Path Loss in Off-Body Channels in Indoor Environments

    Publikacja

    - Rok 2015

    The main goal of the paper is to investigate the influence of body orientation and on-body antenna placement on the path loss in off-body communications. In addition, the influence of different bodies is analysed.

  • Selection Pressure in the Evolutionary Path Planning Problem

    This article compares an impact of using various post-selection methods on the selection pressure and the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. The concept of selection pressure and different methods of post-selection are presented. Article analyses behaviour of post-selection for four options of evolutionary algorithms. Based on the results achieved, waveform...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Distributed Evolutionary Algorithm for Path Planning in Navigation Situation

    This article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...

    Pełny tekst do pobrania w portalu

  • Distance paired domination numbers of graphs

    Publikacja

    W pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • An Approach to Mean Path Loss Model Estimation for Off-Body Channels

    Publikacja

    - Rok 2017

    This paper presents an approach to estimation of the mean path loss model parameters in off-body Body Area Networks channels. In this approach, the path loss exponent is constrained to a value obtained for the line-of-sight (LoS) propagation in the co-polarised channel, considering a generalised static scenario. The comparison of the goodness of fit between the proposed approach and other approaches, for a set of measurements obtained...

  • Influence of Urea and Dimethyl Sulfoxide on K-Peptide Fibrillation

    Protein fibrillation leads to formation of amyloids—linear aggregates that are hallmarks of many serious diseases, including Alzheimer’s and Parkinson’s diseases. In this work, we investigate the fibrillation of a short peptide (K-peptide) from the amyloidogenic core of hen egg white lysozyme in the presence of dimethyl sulfoxide or urea. During the studies, a variety of spectroscopic methods were used: fluorescence spectroscopy...

    Pełny tekst do pobrania w portalu

  • Path planning algorithm for ship collisions avoidance in environment with changing strategy of dynamic obstacles

    In this paper a path planning algorithm for the ship collision avoidance is presented. Tested algorithm is used to determine close to optimal ship paths taking into account changing strategy of dynamic obstacles. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of evolutionary algorithm and based on it dedicated application...

    Pełny tekst do pobrania w serwisie zewnętrznym