Skocz do pozycji: 1.

Tytuł:

On k-Path Pancyclic Graphs

Autorzy:

Bi, Zhenming
Zhang, Ping

Powiązania:

https://bibliotekanauki.pl/articles/31339488.pdf

Data publikacji:

2015-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

Hamiltonian
panconnected
pancyclic
path Hamiltonian
path pancyclic

Opis:

For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic

Źródło:

Discussiones Mathematicae Graph Theory; 2015, 35, 2; 271-281
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 2.

Tytuł:

On independent sets and non-augmentable paths in directed graphs

Autorzy:

Galeana-Sánchez, H.

Powiązania:

https://bibliotekanauki.pl/articles/744219.pdf

Data publikacji:

1998

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

digraph
independent set
directed path
non-augmentable path

Opis:

We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and sufficient condition for a digraph to have the following property: "In any induced subdigraph H of D, every maximal independent set meets every non-augmentable path". Also we obtain a necessary and sufficient condition for any orientation of a graph G results a digraph with the above property. The property studied in this paper is an instance of the property of a conjecture of J.M. Laborde, Ch. Payan and N.H. Huang: "Every digraph contains an independent set which meets every longest directed path" (1982).

Źródło:

Discussiones Mathematicae Graph Theory; 1998, 18, 2; 171-181
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 3.

Tytuł:

Changing the development path of a region - a case study of the Lower Silesian Voivodeship

Autorzy:

Peszat, Klaudia
Szlachta, Jacek

Powiązania:

https://bibliotekanauki.pl/articles/2108241.pdf

Data publikacji:

2017-07-10

Wydawca:

Uniwersytet Warszawski. Wydział Geografii i Studiów Regionalnych

Tematy:

Regional development
innovation
regional development path
path dependency

Opis:

A case study of the Lower Silesian Voivodeship is presented in this article. From the European Union's perspective, Lower Silesia is an example of a less developed region; however, it is also an example of a region that has improved significantly in regards to development due to a change in its innovation model. The purpose of this article is to identify the factors that have had an impact on the change in the region's development path (stimulants), as well as to indicate the weaknesses and barriers limiting further development. This article is based on a review of the literature, statistical data analysis as well as structured, in-depth interviews that were conducted with representatives of regional and local authorities, scientific units and business-related institutions. Recommendations for the regional policy of Lower Silesia have been formulated on this basis.

Źródło:

Miscellanea Geographica. Regional Studies on Development; 2017, 21, 2; 84-88
0867-6046
2084-6118

Pojawia się w:

Miscellanea Geographica. Regional Studies on Development

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 4.

Tytuł:

Problemy wyznaczania optymalnej trajektorii obiektu na obszarze ograniczonym
Problems of the shortest path selection in restricted area

Autorzy:

Dramski, Mariusz

Powiązania:

https://bibliotekanauki.pl/articles/41205253.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet Kazimierza Wielkiego w Bydgoszczy

Tematy:

trasa
optymalna trajektoria
obszar ograniczony
poszukiwanie drogi
route
path
optimal path
resticted area
path search

Opis:

Podstawowym celem systemów informatycznych w transporcie jest wspomaganie procesu przemieszczenia ładunku lub ludzi z punktu początkowego do punktu docelowego. Poza typowymi funkcjami związanymi z informatyczną obsługą przedsiębiorstwa, istnieje szereg metod wspomagających np. dobór optymalnej trasy dla środka transportu. Trasa optymalna to taka, której koszt (uwzględniając nie tylko odległość, ale także i inne czynniki) jest możliwie jak najmniejszy. W niniejszym artykule przedstawione są wyniki dotychczasowych prac prowadzonych w tym zakresie na Akademii Morskiej w Szczecinie.
The main task of the information systems in transport is supporting the process of the movement of cargo and people from the departure point to the destination. Besides the typical ERP functions, these systems have also some tools like searching for the optimal route etc. The optimal route is when it’s total cost (considering different factors) is minimal. In this paper the results of experiments carried out at The Maritime University of Szczecin are described.

Źródło:

Studia i Materiały Informatyki Stosowanej; 2014, 17; 16-21
1689-6300

Pojawia się w:

Studia i Materiały Informatyki Stosowanej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 5.

Tytuł:

On the path partition of graphs

Autorzy:

Kouider, Mekkia
Zamime, Mohamed

Powiązania:

https://bibliotekanauki.pl/articles/29519476.pdf

Data publikacji:

2023

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

path
partition
graphs

Opis:

Let $ G $ be a graph of order $ n $. The maximum and minimum degree of $ G $ are denoted by $ Δ $ and $ δ $, respectively. The path partition number $ μ(G) $ of a graph $ G $ is the minimum number of paths needed to partition the vertices of $ G $. Magnant, Wang and Yuan conjectured that $ μ(G) ≤ max { \frac{n}{δ+1} , \frac{(Δ-δ)n}{(Δ+δ)} } $. In this work, we give a positive answer to this conjecture, for $ Δ ≥ 2δ $.

Źródło:

Opuscula Mathematica; 2023, 43, 6; 829-839
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 6.

Tytuł:

Characterizations of Graphs Having Large Proper Connection Numbers

Autorzy:

Lumduanhom, Chira
Laforge, Elliot
Zhang, Ping

Powiązania:

https://bibliotekanauki.pl/articles/31340917.pdf

Data publikacji:

2016-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

edge coloring
proper-path coloring
strong proper-path coloring

Opis:

Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P is a proper u − v path of length d(u, v), then P is a proper u − v geodesic. An edge coloring c is a proper-path coloring of a connected graph G if every pair u, v of distinct vertices of G are connected by a proper u − v path in G, and c is a strong proper-path coloring if every two vertices u and v are connected by a proper u− v geodesic in G. The minimum number of colors required for a proper-path coloring or strong proper-path coloring of G is called the proper connection number pc(G) or strong proper connection number spc(G) of G, respectively. If G is a nontrivial connected graph of size m, then pc(G) ≤ spc(G) ≤ m and pc(G) = m or spc(G) = m if and only if G is the star of size m. In this paper, we determine all connected graphs G of size m for which pc(G) or spc(G) is m − 1,m − 2 or m − 3.

Źródło:

Discussiones Mathematicae Graph Theory; 2016, 36, 2; 439-453
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 7.

Tytuł:

An exact geometry-based algorithm for path planning

Autorzy:

Jafarzadeh, H.
Fleming, C. H.

Powiązania:

https://bibliotekanauki.pl/articles/331494.pdf

Data publikacji:

2018

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

shortest possible path algorithm
path planning
collision free path
algorytm najkrótszej ścieżki
planowanie ścieżki
ścieżka bezkolizyjna

Opis:

A novel, exact algorithm is presented to solve the path planning problem that involves finding the shortest collision-free path from a start to a goal point in a two-dimensional environment containing convex and non-convex obstacles. The proposed algorithm, which is called the shortest possible path (SPP) algorithm, constructs a network of lines connecting the vertices of the obstacles and the locations of the start and goal points which is smaller than the network generated by the visibility graph. Then it finds the shortest path from start to goal point within this network. The SPP algorithm generates a safe, smooth and obstacle-free path that has a desired distance from each obstacle. This algorithm is designed for environments that are populated sparsely with convex and nonconvex polygonal obstacles. It has the capability of eliminating some of the polygons that do not play any role in constructing the optimal path. It is proven that the SPP algorithm can find the optimal path in O(nn^’2) time, where n is the number of vertices of all polygons and n’ is the number of vertices that are considered in constructing the path network (n’ ≤ n). The performance of the algorithm is evaluated relative to three major classes of algorithms: heuristic, probabilistic, and classic. Different benchmark scenarios are used to evaluate the performance of the algorithm relative to the first two classes of algorithms: GAMOPP (genetic algorithm for multi-objective path planning), a representative heuristic algorithm, as well as RRT (rapidly-exploring random tree) and PRM (probabilistic road map), two well-known probabilistic algorithms. Time complexity is known for classic algorithms, so the presented algorithm is compared analytically.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 493-504
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 8.

Tytuł:

On the Isometric Path Partition Problem

Autorzy:

Manuel, Paul

Powiązania:

https://bibliotekanauki.pl/articles/32323579.pdf

Data publikacji:

2021-11-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

path cover problem
isometric path partition problem
isometric path cover problem
multi-dimensional grids
cylinder
torus

Opis:

The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality of a minimum isometric path cover (partition). We prove that the isometric path partition problem and the isometric k-path partition problem for k 3 are NP-complete on general graphs. Fisher and Fitzpatrick in [The isometric number of a graph, J. Combin. Math. Combin. Comput. 38 (2001) 97–110] have shown that the isometric path cover number of the (r × r)-dimensional grid is ⌈2r/3 ⌉. We show that the isometric path cover (partition) number of the (r × s)-dimensional grid is s when r s(s − 1). We establish that the isometric path cover (partition) number of the (r × r)-dimensional torus is r when r is even and is either r or r + 1 when r is odd. Then, we demonstrate that the isometric path cover (partition) number of an r-dimensional Benes network is 2^r. In addition, we provide partial solutions for the isometric path cover (partition) problems for cylinder and multi-dimensional grids. We apply two di erent techniques to achieve these results.

Źródło:

Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1077-1089
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 9.

Tytuł:

The directed path partition conjecture

Autorzy:

Frick, Marietjie
van Aardt, Susan
Dlamini, Gcina
Dunbar, Jean
Oellermann, Ortrud

Powiązania:

https://bibliotekanauki.pl/articles/744375.pdf

Data publikacji:

2005

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

longest path
Path Partition Conjecture
vertex partition
digraph
prismatic colouring

Opis:

The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path with more than λ vertices then, for every pair (a,b) of positive integers with λ = a+b, there exists a vertex partition (A,B) of D such that no path in D⟨A⟩ has more than a vertices and no path in D⟨B⟩ has more than b vertices. We develop methods for finding the desired partitions for various classes of digraphs.

Źródło:

Discussiones Mathematicae Graph Theory; 2005, 25, 3; 331-343
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 10.

Tytuł:

WORM Colorings of Planar Graphs

Autorzy:

Czap, J.
Jendrol’, S.
Valiska, J.

Powiązania:

https://bibliotekanauki.pl/articles/31341972.pdf

Data publikacji:

2017-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

plane graph
monochromatic path
rainbow path
WORM coloring
facial coloring

Opis:

Given three planar graphs $F$, $H$, and $G$, an $(F,H)$-WORM coloring of $G$ is a vertex coloring such that no subgraph isomorphic to $F$ is rainbow and no subgraph isomorphic to $H$ is monochromatic. If $G$ has at least one $(F,H)$-WORM coloring, then $ W_{F,H}^- (G)$ denotes the minimum number of colors in an $(F,H)$-WORM coloring of $G$. We show that (a) $W_{F,H}^- (G) \le 2 $ if $ |V (F)| \ge 3$ and $H$ contains a cycle, (b) $W_{F,H}^- (G) \le 3 $ if $ |V (F)| \ge 4$ and $H$ is a forest with $ \Delta (H) \ge 3$, (c) $W_{F,H}^- (G) \le 4 $ if $ |V (F)| \ge 5$ and $H$ is a forest with $1 \le \Delta (H) \le 2 $. The cases when both $F$ and $H$ are nontrivial paths are more complicated; therefore we consider a relaxation of the original problem. Among others, we prove that any 3-connected plane graph (respectively outerplane graph) admits a 2-coloring such that no facial path on five (respectively four) vertices is monochromatic.

Źródło:

Discussiones Mathematicae Graph Theory; 2017, 37, 2; 353-368
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 11.

Tytuł:

On the Path Sequence of a Graph

Autorzy:

Bakalarski, Sławomir
Zygadło, Jakub

Powiązania:

https://bibliotekanauki.pl/articles/1373669.pdf

Data publikacji:

2015

Wydawca:

Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego

Tematy:

$k$-path vertex cover
path sequence
list for small graphs

Opis:

A subset S of vertices of a graph $G = (V, E)$ is called a $k$-path vertex cover if every path on $k$ vertices 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$ and form a sequence $\psi(G) = (\psi_1 (G), \psi_2 (G), . . . , \psi_{|V|} (G))$, called the path sequence of $G$. In this paper we prove necessary and sufficient conditions for two integers to appear on fixed positions in $\psi(G)$. A complete list of all possible path sequences (with multiplicities) for small connected graphs is also given.

Źródło:

Schedae Informaticae; 2015, 24; 239-251
0860-0295
2083-8476

Pojawia się w:

Schedae Informaticae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 12.

Tytuł:

The depression of a graph and k-kernels

Autorzy:

Schurch, Mark
Mynhardt, Christine

Powiązania:

https://bibliotekanauki.pl/articles/30148230.pdf

Data publikacji:

2014-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

edge ordering of a graph
increasing path
monotone path
depression

Opis:

An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G) such that for any edge ordering f of G there exists a maximal f-ascent of length at most k which neither starts nor ends in U. Identifying a k-kernel of a graph G enables one to construct an infinite family of graphs from G which have depression at most k. We discuss various results related to the concept of k-kernels, including an improved upper bound for the depression of trees.

Źródło:

Discussiones Mathematicae Graph Theory; 2014, 34, 2; 233-247
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 13.

Tytuł:

A Survey of the Path Partition Conjecture

Autorzy:

Frick, Marietjie

Powiązania:

https://bibliotekanauki.pl/articles/30146727.pdf

Data publikacji:

2013-03-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

Path Partition Conjecture
Path Kernel Conjecture
generalized colourings
additive hereditary properties

Opis:

The Path Partition Conjecture (PPC) states that if G is any graph and (λ₁, λ₂) any pair of positive integers such that G has no path with more than λ₁ + λ₂ vertices, then there exists a partition (V₁, V₂) of the vertex set of G such that V_i has no path with more than λ_i vertices, i = 1, 2. We present a brief history of the PPC, discuss its relation to other conjectures and survey results on the PPC that have appeared in the literature since its first formulation in 1981.

Źródło:

Discussiones Mathematicae Graph Theory; 2013, 33, 1; 117-131
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 14.

Tytuł:

Etapy życia zawodowego a podstawa planowania ścieżki kariery zawodowej
PHASES OF VOCATIONAL LIFE AND FOUNDATIONS OF CAREER PATH PLANNING

Autorzy:

Łyszkowska, Edyta

Powiązania:

https://bibliotekanauki.pl/articles/417489.pdf

Data publikacji:

2010

Wydawca:

Akademickie Towarzystwo Andragogiczne

Tematy:

CAREER PATH
VOCATIONAL LIFE

Opis:

The aim of this paper is to discuss different theories of vocational consuelling concerning the career path planning. The autor characterizes conceptions of vocational development: tracits and factory, psychodynamic theories, developmental theories, cognitive-social theories. Then she diskusses the process of career path planning in four phases, paying special attention to changes in contemporary vocational life that make the process coutinning and multidimensional.

Źródło:

Rocznik Andragogiczny; 2010, R. 2010
1429-186X
2391-7571

Pojawia się w:

Rocznik Andragogiczny

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 15.

Tytuł:

Lightweight paths in graphs

Autorzy:

Harant, Jochen
Jendrol, Stanislav

Powiązania:

https://bibliotekanauki.pl/articles/255411.pdf

Data publikacji:

2019

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

weighted graph
lightweight path

Opis:

Let k be a positive integer, G be a graph on V(G) containing a path on k vertices, and w be a weight function assigning each vertex v ∈ V(G) a real weight w(y). Upper bounds on the weight [formula] of P are presented, where P is chosen among all paths of G on k vertices with smallest weight.

Źródło:

Opuscula Mathematica; 2019, 39, 6; 829-837
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 16.

Tytuł:

Multicolor Ramsey numbers for some paths and cycles

Autorzy:

Bielak, Halina

Powiązania:

https://bibliotekanauki.pl/articles/743153.pdf

Data publikacji:

2009

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

cycle
path
Ramsey number

Opis:

We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, generalizing a results of Faudree and Schelp [4], and Dzido, Kubale and Piwakowski [2,3].

Źródło:

Discussiones Mathematicae Graph Theory; 2009, 29, 2; 209-218
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 17.

Tytuł:

Connectivity of path graphs

Autorzy:

Knor, Martin
Niepel, L'udovít

Powiązania:

https://bibliotekanauki.pl/articles/743766.pdf

Data publikacji:

2000

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

connectivity
path graph
cycle

Opis:

We prove a necessary and sufficient condition under which a connected graph has a connected P₃-path graph. Moreover, an analogous condition for connectivity of the Pₖ-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.

Źródło:

Discussiones Mathematicae Graph Theory; 2000, 20, 2; 181-195
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 18.

Tytuł:

Short paths in 3-uniform quasi-random hypergraphs

Autorzy:

Polcyn, Joanna

Powiązania:

https://bibliotekanauki.pl/articles/744576.pdf

Data publikacji:

2004

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

hypergraph
path
quasi-randomness

Opis:

Frankl and Rödl [3] proved a strong regularity lemma for 3-uniform hypergraphs, based on the concept of δ-regularity with respect to an underlying 3-partite graph. In applications of that lemma it is often important to be able to "glue" together separate pieces of the desired subhypergraph. With this goal in mind, in this paper it is proved that every pair of typical edges of the underlying graph can be connected by a hyperpath of length at most seven. The typicality of edges is defined in terms of graph and hypergraph neighborhoods, and it is shown that all but a small fraction of edges are indeed typical.

Źródło:

Discussiones Mathematicae Graph Theory; 2004, 24, 3; 469-484
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 19.

Tytuł:

The Changes in the Position of Poland on Its Investment Development Path: the Results of the Empirical Analysis

Autorzy:

Majewska, Maria
Buszkowska, Eliza

Powiązania:

https://bibliotekanauki.pl/articles/429883.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet w Białymstoku. Wydawnictwo Uniwersytetu w Białymstoku

Tematy:

economic development path
Polska

Opis:

The aim of this paper was to indicate on which stage of an economic development path is probably Poland. The subject of this paper was one of the economic development paths, named usually the investment development path, which model has been shaped mainly by J. H. Dunning and R. Narula. This model is also similar to the model of the economic development path proposed by M. Porter. Therefore, were discussed the changes in the main elements of this model, which took place in the Polish economy in 1995-2012. Those elements were the trade structure diveded by the degree of technological sophistication, direct investment and indicators of economic performance. In order to verify if in the case of Poland have been occurred economic dependences assumed by the representatives of this model also was carried out correlation and regression analysis. The results of the study suggest that Poland shifted to the third stage of analyzed economic development path where more emphasis is placed on innovations as the country moves toward producing more technology intensive products.

Źródło:

Optimum. Economic Studies; 2014, 5(71)
1506-7637

Pojawia się w:

Optimum. Economic Studies

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 20.

Tytuł:

Graphs maximal with respect to absence of hamiltonian paths

Autorzy:

Zelinka, Bohdan

Powiązania:

https://bibliotekanauki.pl/articles/744225.pdf

Data publikacji:

1998

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

Hamiltonian path
block graph

Opis:

Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are presented. Block graphs with this property are characterized.

Źródło:

Discussiones Mathematicae Graph Theory; 1998, 18, 2; 205-208
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 21.

Tytuł:

The Path-Distance-Width of Hypercubes

Autorzy:

Otachi, Yota

Powiązania:

https://bibliotekanauki.pl/articles/30146525.pdf

Data publikacji:

2013-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

path-distance-width
hypercube

Opis:

The path-distance-width of a connected graph G is the minimum integer w satisfying that there is a nonempty subset of S ⊆ V (G) such that the number of the vertices with distance i from S is at most w for any nonnegative integer i. In this note, we determine the path-distance-width of hypercubes.

Źródło:

Discussiones Mathematicae Graph Theory; 2013, 33, 2; 467-470
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 22.

Tytuł:

Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers

Autorzy:

Samodivkin, Vladimir

Powiązania:

https://bibliotekanauki.pl/articles/32083856.pdf

Data publikacji:

2021-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

domination number
path addition

Opis:

Given a graph $G=(V, E)$ and two its distinct vertices $u$ and $v$, the $(u, v)$-$P_k$-addition graph of $G$ is the graph $G_{u,v,k−2}$ obtained from disjoint union of $G$ and a path $P_k : x_0, x_1,...,x_{k−1}, k ≥ 2$, by identifying the vertices $u$ and $x_0$, and identifying the vertices $v$ and $x_{k−1}$. We prove that $\gamma(G) − 1 ≤ \gamma(G_{u,v,k})$ for all $k ≥ 1$, and $\gamma(G_{u,v,k})>\gamma(G)$ when $k ≥ 5$. We also provide necessary and sufficient conditions for the equality $\gamma(G_{u,v,k})=\gamma(G)$ to be valid for each pair $u, v ∈ V(G)$. In addition, we establish sharp upper and lower bounds for the minimum, respectively maximum, $k$ in a graph $G$ over all pairs of vertices $u$ and $v$ in $G$ such that the $(u, v)$-$P_k$-addition graph of $G$ has a larger domination number than $G$, which we consider separately for adjacent and non-adjacent pairs of vertices.

Źródło:

Discussiones Mathematicae Graph Theory; 2021, 41, 2; 365-379
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 23.

Tytuł:

Optimizing of the piezo-optic interaction geometry in SrB4O7 crystals

Autorzy:

Buryy, O.
Demyanyshyn, N.
Mytsyk, B.
Andrushchak, A.

Powiązania:

https://bibliotekanauki.pl/articles/174724.pdf

Data publikacji:

2016

Wydawca:

Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej

Tematy:

piezo-optical effect
optical path
path difference
SrB4O7 crystals

Opis:

The optimal geometries of the piezo-optic interaction are determined for SrB₄O₇ crystals by the extreme surfaces method. The goal functions of optimization are the change of optical path length and optical path difference, normalized on mechanical stress and crystal thickness, and the parameters of optimization are the spherical angles determining the directions of the light beam propagation and the uniaxial pressure action. It is shown that the maximal changes of optical path length for the orthogonal polarized waves are equal to 2.09 or 1.65 B (1 B = 1 brewster = 10^–12 m²/N) and the maximal change of optical path difference is equal to 2.22 B respectively in transversal geometry of the piezo-optic interaction (for λ =633nm and T =20ºC).

Źródło:

Optica Applicata; 2016, 46, 3; 447-459
0078-5466
1899-7015

Pojawia się w:

Optica Applicata

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 24.

Tytuł:

Transforming innovation models in European regions: Breaking out of path dependency and growing faster?

Autorzy:

Pylak, Korneliusz
Wojnicka-Sycz, Elżbieta

Powiązania:

https://bibliotekanauki.pl/articles/2046895.pdf

Data publikacji:

2017-07-10

Wydawca:

Uniwersytet Warszawski. Wydział Geografii i Studiów Regionalnych

Tematy:

Regional development
development path
path dependency
less
developed region
innovation model
innovativeness

Opis:

The aim of the paper is to verify whether a change in innovation model by less-developed regions may speed up development processes and if innovativeness plays crucial role in these processes. Cluster analysis conducted for the years 1994-2014 showed that the majority of lessdeveloped regions in 1994-2000 that experienced significant growth by 2011-2014 changed their innovation models. Logit regression confirmed that innovation factors play a crucial role in high growth rates. The findings suggest that less-developed regions can break out of path dependency by increasing their shares of high-tech industries and employment in science and technology and boosting technology transfer, which usually involves changing and improving their innovation models.

Źródło:

Miscellanea Geographica. Regional Studies on Development; 2017, 21, 2; 51-59
0867-6046
2084-6118

Pojawia się w:

Miscellanea Geographica. Regional Studies on Development

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 25.

Tytuł:

Metodyka badania zmiany ścieżek rozwoju słabo rozwiniętych regionów

Autorzy:

Pylak, Korneliusz

Powiązania:

https://bibliotekanauki.pl/articles/2022495.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

adaptability
adaptation
crisis
economic shocks
path dependency
regional development path
regional resilience

Źródło:

Studia komitetu przestrzennego zagospodarowania kraju PAN; 2017, 179; 73-91
0079-3507

Pojawia się w:

Studia komitetu przestrzennego zagospodarowania kraju PAN

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 26.

Tytuł:

Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having $k$ Edges

Autorzy:

Jeevadoss, Shanmugasundaram
Muthusamy, Appu

Powiązania:

https://bibliotekanauki.pl/articles/31234097.pdf

Data publikacji:

2015-11-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

path
cycle
graph decomposition
multigraph

Opis:

We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph $ K_{m,n} ( \lambda )$ into paths and cycles having $k$ edges. In particular, we show that such decomposition exists in $ K_{m,n} ( \lambda )$, when $ \lambda \equiv 0 (mod 2) $, $ m,n \geq k/2, m+n > k $ and $ k(p + q) = 2mn $ for $ k \equiv 0 (mod 2) $ and also when $ \lambda \geq 3 $, $ \lambda m \equiv \lambda n \equiv 0(mod 2) $, $ k(p + q) =\lambda m n $, $m, n \geq k $, (resp., $ m, n \geq 3k//2$) for $ k \equiv 0(mod 4)$ (respectively, for $ k \equiv 2(mod 4)$). In fact, the necessary conditions given above are also sufficient when $ \lambda = 2 $.

Źródło:

Discussiones Mathematicae Graph Theory; 2015, 35, 4; 715-731
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 27.

Tytuł:

Магія простору та часу: хронотоп в романі Казимєжа Трухановського «Божі млини»
The magic of space and time: the chronotope in Kazimierz Truchanowskis novel "Boże młyny"

Autorzy:

Hajder, Tatiana

Powiązania:

https://bibliotekanauki.pl/articles/1376043.pdf

Data publikacji:

2019

Wydawca:

Uniwersytet Zielonogórski. Wydział Humanistyczny

Tematy:

chronotope
maze
path
City
hell

Opis:

Abstract. The analysis of time-space coordinates of an artistic work. in the circle of scientific interests of literary critics, is increasingly being analyzed from the second half of the twentieth century. M. Bakhtin's term for introduction to the interconnection of time and space coordinates of an artistic product today encompasses wider spectra of philological analysis of the text. After all, the chronotope is functionally associated with such concepts as plot and genre (plot-based and genre-specific functions), semantics of the text, mythopoetics, etc. Universals like "man", "time", "space" are necessary attributes of the semantic space of artistic text, since these categories organize the text (they perform the text-creation function). . In the article the author considers the key plot chronotopes - the chronotope of the meeting, the chronotope of the road, which is modified by the author - K. Trukhanovsky - into the chronotope of the labyrinth. The latter acquires specific features in the novel. The writer applied to mythologization and the magic properties of time-space measurements in the novel. Mythological and literary traditions are superimposed, as a result of which the author creates a complicated model of a labyrinthine novel. K. Trukhanovsky immerses the protagonist in the world of masks, forcing him to travel through the labyrinth of both his own soul and the quaint world of the City into which he falls.

Źródło:

International Journal of Slavic Studies Transgressive, Pragmatic and Speculative Horizons of Popular Literature and Culture; 2019, 1, 1; 85-98
2658-154X

Pojawia się w:

International Journal of Slavic Studies Transgressive, Pragmatic and Speculative Horizons of Popular Literature and Culture

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 28.

Tytuł:

Cycles through specified vertices in triangle-free graphs

Autorzy:

Paulusma, Daniel
Yoshimoto, Kiyoshi

Powiązania:

https://bibliotekanauki.pl/articles/743729.pdf

Data publikacji:

2007

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

cycle
path
triangle-free graph

Opis:

Let G be a triangle-free graph with δ(G) ≥ 2 and σ₄(G) ≥ |V(G)| + 2. Let S ⊂ V(G) consist of less than σ₄/4+ 1 vertices. We prove the following. If all vertices of S have degree at least three, then there exists a cycle C containing S. Both the upper bound on |S| and the lower bound on σ₄ are best possible.

Źródło:

Discussiones Mathematicae Graph Theory; 2007, 27, 1; 179-191
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 29.

Tytuł:

Method of Path Selection in the Graph - Case Study

Autorzy:

Neumann, T.

Powiązania:

https://bibliotekanauki.pl/articles/116904.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet Morski w Gdyni. Wydział Nawigacyjny

Tematy:

Path Selection
Method of Path Selection
graph theory
Dijkstra algorithm
route planning
Cutting-Edge Thinking Mechanisms
New Paths Searching
shortest path

Opis:

This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector. In many cases, the best solution for a single criterion is not sufficient. I would be the search for more effective solutions of the starting point to use for subsequent analysis or decision making by the captain of the ship. Using cutting-edge thinking mechanisms, it is possible to create a decision support system based on known Dijkstra's algorithm.

Źródło:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 557-562
2083-6473
2083-6481

Pojawia się w:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 30.

Tytuł:

A scalable tree based path planning for a service robot

Autorzy:

Nippun Kumaar, A. A.
Kochuvila, Sreeja
Nagaraja, S. R.

Powiązania:

https://bibliotekanauki.pl/articles/2204556.pdf

Data publikacji:

2022

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

learning from demonstration
path mapping
path planning
navigation system
mobile robot
service robot

Opis:

Path planning plays a vital role in a mobile robot navi‐ gation system. It essentially generates the shortest tra‐ versable path between two given points. There are many path planning algorithms that have been proposed by re‐ searchers all over the world; however, there is very little work focussing on path planning for a service environ‐ ment. The general assumption is that either the environ‐ ment is fully known or unknown. Both cases would not be suitable for a service environment. A fully known en‐ vironment will restrict further expansion in terms of the number of navigation points and an unknown environ‐ ment would give an inefficient path. Unlike other envi‐ ronments, service environments have certain factors to be considered, like user‐friendliness, repeatability, sca‐ lability, and portability, which are very essential for a service robot. In this paper, a simple, efficient, robust, and environment‐independent path planning algorithm for an indoor mobile service robot is presented. Initially, the robot is trained to navigate to all the possible desti‐ nations sequentially with a minimal user interface, which will ensure that the robot knows partial paths in the en‐ vironment. With the trained data, the path planning al‐ gorithm maps all the logical paths between all the des‐ tinations, which helps in autonomous navigation. The al‐ gorithm is implemented and tested using a 2D simulator Player/Stage. The proposed system is tested with two dif‐ ferent service environment layouts and proved to have features like scalability, trainability, accuracy, and repe‐ atability. The algorithm is compared with various classi‐ cal path planning algorithms and the results show that the proposed path planning algorithm is on par with the other algorithms in terms of accuracy and efficient path generation.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2022, 16, 1; 31--45
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 31.

Tytuł:

Using Diagnostic Information for Planning an Energy-Optimal Path of an Autonomous Vehicle

Autorzy:

Szulim, Przemysław

Powiązania:

https://bibliotekanauki.pl/articles/503690.pdf

Data publikacji:

2014

Wydawca:

Międzynarodowa Wyższa Szkoła Logistyki i Transportu

Tematy:

path planning
bldc motor
diagnosis

Opis:

The article has presented a general idea for an algorithm that would allow for determining the optimal parameters of vehicle movement. The sources of energy dissipation have been assumed as follows: damage to the engine and the drive. In addition, the mathematical basis have been presented for assessing the impact of damage resulting from problems such as axial misalignment on the dissipated energy. In the second part of the paper, the concept of the algorithm has been detailed, paying special attention to certain problems that have arisen, and an algorithm has been proposed that determines the optimal movement parameters for a simplified case, when the vehicle is moving along a path determined in advance. In addition, the results of applying the algorithm for a simple case have been presented, as well as the impact of the particular energy dissipation parameters of the model on the optimal velocity profile of the vehicle. The plans for further research include estimating the impact of other damages, such as damaged bearings or demagnetising, on the energy dissipation. Further work on an algorithm is also planned that would allow for simultaneous determining of an optimal path as well as an optimal velocity profile.

Źródło:

Logistics and Transport; 2014, 21, 1; 104-114
1734-2015

Pojawia się w:

Logistics and Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 32.

Tytuł:

On the longest path in a recursively partitionable graph

Autorzy:

Bensmail, J.

Powiązania:

https://bibliotekanauki.pl/articles/255403.pdf

Data publikacji:

2013

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

recursively partitionable graph
longest path

Opis:

A connected graph G with order n ≥ 1 is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to K1, or for every sequence (n1, . . . , np) of positive integers summing up to n there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected R-AP subgraph of G on ni vertices. Since previous investigations, it is believed that a R-AP graph should be “almost traceable” somehow. We first show that the longest path of a R-AP graph on n vertices is not constantly lower than n for every n. This is done by exhibiting a graph family C such that, for every positive constant c ≥ 1, there is a R-AP graph in C that has arbitrary order n and whose longest path has order n−c. We then investigate the largest positive constant c’ < 1 such that every R-AP graph on n vertices has its longest path passing through n • c’ vertices. In particular, we show that c’ ≥ 2/3 . This result holds for R-AP graphs with arbitrary connectivity.

Źródło:

Opuscula Mathematica; 2013, 33, 4; 631-640
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 33.

Tytuł:

Propagation Path Loss Modeling in Container Terminal Environment

Autorzy:

Katulski, R. J.
Stefański, J.
Sadowski, J.

Powiązania:

https://bibliotekanauki.pl/articles/308910.pdf

Data publikacji:

2009

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

path loss modeling
radio propagation

Opis:

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.

Źródło:

Journal of Telecommunications and Information Technology; 2009, 3; 38-42
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 34.

Tytuł:

A collision avoidance algorithm in Simultaneous Localization and Mapping problem for mobile platforms

Autorzy:

Małecki, Tomasz
Narkiewicz, Janusz

Powiązania:

https://bibliotekanauki.pl/articles/2086976.pdf

Data publikacji:

2022

Wydawca:

Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej

Tematy:

algorithm
modeling
path planning
SLAM

Opis:

A collision avoidance algorithm applicable in simultaneous localization and mapping (SLAM) has been developed with a prospect of an on-line application for mobile platforms to search and map the operation area and avoid contact with obstacles. The algorithm, which was implemented in MATLAB software, is based on a linear discrete-time state transition model for determination of the platform position and orientation, and a ‘force’ points method for collision avoidance and definition of the next-step of platform motion. The proposed approach may be incorporated into real-time applications with limited on-board computational resources.

Źródło:

Journal of Theoretical and Applied Mechanics; 2022, 60, 2; 317--328
1429-2955

Pojawia się w:

Journal of Theoretical and Applied Mechanics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 35.

Tytuł:

Kręte drogi sufich. Turecko-bałkańskie wątki sufickiej koncepcji „drogi” we współczesnej odsłonie (na wybranych przykładach literackich)

Autorzy:

Kaim, Agnieszka Aysen

Powiązania:

https://bibliotekanauki.pl/articles/677392.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Instytut Slawistyki PAN

Tematy:

Sufism
tarika
path
dervish
tauhid

Opis:

The twisting paths of the sufis – the Turkic-Balkan motifs in the sufi ‘tariqa’ concept in selected examples of contemporary literary works The first part of this paper summarises how Sufi brotherhoods formed in the Balkans with some references to their Turkic-Ottoman sources. Islamic mystical movements constituted part of the Islamisation initiatives in the territories occupied by the Ottoman Empire: mystical teaching was apparently more successful among the local people than conservative Islam. Crypto-Christianism was a typical phenomenon among converted Slavs. Orders using the language of symbolic tales (like the Bektashi) involved some Christian rites. The orders which proved most popular were the Mevlevi, Naqshbandi, Chalwati and Bektashi, which are still active in some parts of the Balkans. Their role also reconciled the national thought of newly forming national identities in the Balkans. In the novels Death and the Dervish by Meša Selimović and Konak by Ćamil Sijarić, the mystical idea of the Arab tariqa (tarika), i.e. „path,” meets the modern literary concepts of fate and the search for truth and sense of life. The paper constitutes an attempt to present how these two aesthetics have been unwoven into modern literary texts. Kręte drogi sufich. Turecko-bałkańskie wątki sufickiej koncepcji „drogi” we współczesnej odsłonie (na wybranych przykładach literackich) Tekst jest próbą przybliżenia mistycznej koncepcji drogi tarika i jej realizacji przez różne bractwa sufickie (m.in. bektaszytów, mewlewitów, malamitów, chalwetytów, nakszbandytów), które z Anatolii rozprzestrzeniły się na Bałkany. Praca odwołuje się do znanych postaci derwiszy, zarówno tych z epoki literatury świętych podbojów islamu, jak i tych wykreowanych postaci zasłużonych derwiszy noszących cechy chrześcijańskich „świętych”. W części analitycznej tekst podejmuje interpretację współczesnych literackich kreacji ascetów i mistyków oraz realizowania przez nich koncepcji „drogi”. Służy temu analiza poszczególnych wątków z powieści Mešy Selimovicia Derwisz i śmierć i Sijaricia Ćamila Ja, eunuch. Całość jest próbą przyjrzenia się na wybranych przykładach, jak i czy współczesna literatura południowosłowiańska splata koncepcję literacką z filozofią mistycyzmu bałkańskiego, tworząc oryginalne, autorskie odsłony.

Źródło:

Slavia Meridionalis; 2017, 17
1233-6173
2392-2400

Pojawia się w:

Slavia Meridionalis

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 36.

Tytuł:

Histories in path graphs

Autorzy:

Niepel, Ludovít

Powiązania:

https://bibliotekanauki.pl/articles/743803.pdf

Data publikacji:

2007

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

path-graph
graph dynamics
history

Opis:

For a given graph G and a positive integer r the r-path graph, $P_r(G)$, has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r-1, and their union forms either a cycle or a path of length k+1 in G. Let $P^k_r(G)$ be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of $P^k_r(G)$. The k-history $P^{-k}_r(H)$ is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.

Źródło:

Discussiones Mathematicae Graph Theory; 2007, 27, 2; 345-357
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 37.

Tytuł:

Downhill domination in graphs

Autorzy:

Haynes, Teresa W.
Hedetniemi, Stephen T.
Jamieson, Jessie D.
Jamieson, William B.

Powiązania:

https://bibliotekanauki.pl/articles/30148687.pdf

Data publikacji:

2014-08-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

downhill path
downhill domination number

Opis:

A path $π = (v_1, v_2, . . ., v_{k+1})$ in a graph $G = (V,E)$ is a downhill path if for every $i, 1 ≤ i ≤ k, deg(v_i) ≥ deg(v_{i+1})$, where $deg(v_i)$ denotes the degree of vertex $v_i ∈ V$. The downhill domination number equals the minimum cardinality of a set $S ⊆ V$ having the property that every vertex $v ∈ V$ lies on a downhill path originating from some vertex in $S$. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds.

Źródło:

Discussiones Mathematicae Graph Theory; 2014, 34, 3; 603-612
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 38.

Tytuł:

Worm Colorings

Autorzy:

Goddard, Wayne
Wash, Kirsti
Xu, Honghai

Powiązania:

https://bibliotekanauki.pl/articles/31339329.pdf

Data publikacji:

2015-08-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

coloring
rainbow
monochromatic
forbidden
path

Opis:

Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F. We present some results on this concept especially as regards to the existence, complexity, and optimization within certain graph classes. The focus is on the case that F is the path on three vertices.

Źródło:

Discussiones Mathematicae Graph Theory; 2015, 35, 3; 571-584
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 39.

Tytuł:

Vertex Colorings without Rainbow Subgraphs

Autorzy:

Goddard, Wayne
Xu, Honghai

Powiązania:

https://bibliotekanauki.pl/articles/31340560.pdf

Data publikacji:

2016-11-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

coloring
rainbow
monochromatic
forbidden
path

Opis:

Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G such that there is no rainbow copy of F. We present some results on this parameter for certain graph classes. The focus is on the case that F is a star or triangle. For example, we show that the K₃-upper chromatic number of any maximal outerplanar graph on n vertices is [n/2] + 1.

Źródło:

Discussiones Mathematicae Graph Theory; 2016, 36, 4; 989-1005
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 40.

Tytuł:

Decomposing 10-Regular Graphs into Paths of Length 5

Autorzy:

Xie, Mengmeng
Zhou, Chuixiang

Powiązania:

https://bibliotekanauki.pl/articles/32222554.pdf

Data publikacji:

2022-11-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

10-regular graph
decomposition
path

Opis:

Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.

Źródło:

Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1089-1097
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 41.

Tytuł:

Strategia, niezamierzony proces czy przypadek? Weryfikacja hipotez badawczych w zakresie zmiany ścieżek rozwoju i wyrwania się regionu z zależności od śceżki

Autorzy:

Pylak, Korneliusz

Powiązania:

https://bibliotekanauki.pl/articles/2022516.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

adaptation
innovation process models
less-developed regions
path dependency
regional development path
regional strategy

Źródło:

Studia komitetu przestrzennego zagospodarowania kraju PAN; 2017, 179; 340-351
0079-3507

Pojawia się w:

Studia komitetu przestrzennego zagospodarowania kraju PAN

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 42.

Tytuł:

Geometric modeling of reflected sound waves in the threecentred arch
Modelowanie geometryczne odbitych fal dźwiękowych w sklepieniu koszowym

Autorzy:

Kernytskyy, I.
Nikitenko, O.

Powiązania:

https://bibliotekanauki.pl/articles/40300.pdf

Data publikacji:

2018

Wydawca:

Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie

Tematy:

threecentred arch
geometrical modelling
reflected sound wave
orthotomic path
caustic path
envelope
architecture
orthotomics

Źródło:

Acta Scientiarum Polonorum. Architectura; 2018, 17, 1
1644-0633

Pojawia się w:

Acta Scientiarum Polonorum. Architectura

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 43.

Tytuł:

Modification and reliability estimation of vector based Dubins path approach for autonomous ground vehicles path re-planning
Poprawa i ocena niezawodności opartej na wektorowej metodzie trajektorii Dubinsa dla korekty trajektorii pojazdów autonomicznych

Autorzy:

Skačkauskas, P.
Sokolovskij, E.

Powiązania:

https://bibliotekanauki.pl/articles/300985.pdf

Data publikacji:

2018

Wydawca:

Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN

Tematy:

autonomous ground vehicle
Dubins path
path re-planning
path following
performance
reliability estimation
samochód autonomiczny
trajektoria Dubinsa
przeplanowanie trajektorii
śledzenie trajektorii
skuteczność
ocena niezawodności

Opis:

Due to global purposes to ensure growth of a competitive and sustainable transport system, also to solve traffic safety and environmental problems, various engineering solutions are being sought out. It can be assumed that autonomous vehicles are the technology, which will ensure the positive change in the transport system. Even though many studies successfully advanced toward realisation of autonomous vehicles, a significant amount of technical and policy framework problems still has to be solved. This paper addresses the problem of predefined path feasibility and proposes an effective methodology for a path to follow re-planning. The proposed methodology is composed of three parts and is based on the Dubins path approach. In order to modify the vector based Dubins path approach and to ensure the path feasibility, the optimisation problem was solved. A cost function with different inequality constraints was formulated. The performance and reliability of the proposed methodology were analysed and evaluated by carrying out an experimental research while using the autonomous test vehicle.
Dla zapewnienia rozwoju konkurencyjnego i zrównoważonego systemu transportowego, oraz w celu rozwiązania problemów związanych z bezpieczeństwem ruchu i środowiskiem, poszukiwane są różne rozwiązania techniczne. Można założyć, że autonomiczne pojazdy są technologią, która zapewni pozytywną zmianę w systemie transportowym. Mimo że wiele badań z powodzeniem dotyczyło realizacji autonomicznych pojazdów, należy jeszcze rozwiązać wiele problemów technicznych i prawnych. W niniejszym dokumencie poruszono problem predefiniowanej wykonalności ścieżki i zaproponowano skuteczną metodologię dla ścieżki do śledzenia ponownego planowania. Proponowana metodologia składa się z trzech części i opiera się na metodzie Dubinsa. Aby zmodyfikować metodę trajektorii Dubinsa i zapewnić optymalną trajektorię, w publikacji rozwiązano zadanie optymalizacji. Sformułowana funkcja celu z różnymi nieliniowymi ograniczeniami. Skuteczność i niezawodność proponowanej metodologii została przeanalizowana i oceniona po przeprowadzeniu eksperymentalnych badań z wykorzystaniem autonomicznego pojazdu badawczego.

Źródło:

Eksploatacja i Niezawodność; 2018, 20, 4; 549-557
1507-2711

Pojawia się w:

Eksploatacja i Niezawodność

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 44.

Tytuł:

Uwarunkowania i czynniki zmiany ścieżek rozwoju słabo rozwiniętych regionów w świetle badań empirycznych

Autorzy:

Pylak, Korneliusz

Powiązania:

https://bibliotekanauki.pl/articles/2022518.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

adaptation
crisis
economic shocks
innovation process models
less-developed regions
path dependency
regional development path

Źródło:

Studia komitetu przestrzennego zagospodarowania kraju PAN; 2017, 179; 111-133
0079-3507

Pojawia się w:

Studia komitetu przestrzennego zagospodarowania kraju PAN

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 45.

Tytuł:

Minimal vertex degree sum of a 3-path in plane maps

Autorzy:

Borodin, O.

Powiązania:

https://bibliotekanauki.pl/articles/971951.pdf

Data publikacji:

1997

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

planar graph
structure
degree
path
weight

Opis:

Let wₖ be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w₂ = 6, then w₃ may be arbitrarily big, (2) if w₂ < 6, then either w₃ ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w₂ < 7, then w₃ ≤ 17.

Źródło:

Discussiones Mathematicae Graph Theory; 1997, 17, 2; 279-284
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 46.

Tytuł:

PIV method as a means of optimization and validation of fluid flow in flue gas path

Autorzy:

Sulovcova, K.
Papučík, Š.
Patsch, M.
Kapjor, A.
Medvecký, Š.

Powiązania:

https://bibliotekanauki.pl/articles/402563.pdf

Data publikacji:

2014

Wydawca:

Politechnika Świętokrzyska w Kielcach. Wydawnictwo PŚw

Tematy:

CFD simulation
gas path
PIV method

Opis:

The production of flue gases and particulate matters also take part in combustion process. Solid particulate matters are dragged into the air with fumes and adversely affect the air quality, environment, human and animal health. Reducing of particulate matter emissions is very important not only for large particle sources but also for small sources that are involved in environmental pollution, too. Those small producers are for example small heat sources. In this paper reduction of particulate matter production in small heat source by modification of the flue gas path by using CFD simulation and PIV method is considered.

Źródło:

Structure and Environment; 2014, 6, 3; 41-44
2081-1500

Pojawia się w:

Structure and Environment

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 47.

Tytuł:

Facial rainbow edge-coloring of simple 3-connected plane graphs

Autorzy:

Czap, Julius

Powiązania:

https://bibliotekanauki.pl/articles/255771.pdf

Data publikacji:

2020

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

plane graph
facial path
edge-coloring

Opis:

A facial rainbow edge-coloring of a plane graph G is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of G. The minimum number of colors used in such a coloring is denoted by erb(G). Trivially, erb(G) ≥ L(G) + 1 holds for every plane graph without cut-vertices, where L(G) denotes the length of a longest facial path in G. Jendrol’ in 2018 proved that every simple 3-connected plane graph admits a facial rainbow edge-coloring with at most L(G) + 2 colors, moreover, this bound is tight for L(G) = 3. He also proved that erb(G) = L(G) + 1 for L(G) ∉ {3,4, 5}. He posed the following conjecture: There is a simple 3-connected plane graph G with L(G) = 4 and erb(G) = L(G) + 2. In this note we answer the conjecture in the affirmative. Keywords: plane graph, facial path, edge-coloring.

Źródło:

Opuscula Mathematica; 2020, 40, 4; 475-482
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 48.

Tytuł:

Path and cycle factors of cubic bipartite graphs

Autorzy:

Kano, M.
Lee, Changwoo
Suzuki, Kazuhiro

Powiązania:

https://bibliotekanauki.pl/articles/743085.pdf

Data publikacji:

2008

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

cycle factor
path factor
bipartite graph

Opis:

For a set S of connected graphs, a spanning subgraph F of a graph is called an S-factor if every component of F is isomorphic to a member of S. It was recently shown that every 2-connected cubic graph has a {Cₙ | n ≥ 4}-factor and a {Pₙ | n ≥ 6}-factor, where Cₙ and Pₙ denote the cycle and the path of order n, respectively (Kawarabayashi et al., J. Graph Theory, Vol. 39 (2002) 188-193). In this paper, we show that every connected cubic bipartite graph has a {Cₙ | n ≥ 6}-factor, and has a {Pₙ | n ≥ 8}-factor if its order is at least 8.

Źródło:

Discussiones Mathematicae Graph Theory; 2008, 28, 3; 551-556
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 49.

Tytuł:

Note on the weight of paths in plane triangulations of minimum degree 4 and 5

Autorzy:

Madaras, Tomás

Powiązania:

https://bibliotekanauki.pl/articles/743763.pdf

Data publikacji:

2000

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

weight of path
plane graph
triangulation

Opis:

The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P₅ on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P₄ on 4 vertices of weight at most 31.

Źródło:

Discussiones Mathematicae Graph Theory; 2000, 20, 2; 173-180
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 50.

Tytuł:

Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM

Autorzy:

Stojadinovic, S. M.
Majstorovic, V. D.
Durakbasa, N. M.
Sibalija, T. V.

Powiązania:

https://bibliotekanauki.pl/articles/221131.pdf

Data publikacji:

2016

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

path planning
ACO
CMM
prismatic parts

Opis:

This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i) the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii) the solution of Travelling Salesman Problem (TSP) obtained with Ant Colony Optimisation (ACO). In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path) is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.

Źródło:

Metrology and Measurement Systems; 2016, 23, 1; 119-132
0860-8229

Pojawia się w:

Metrology and Measurement Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 51.

Tytuł:

The major stages in the development of a regional centre. The case of Pécs (Hungary)

Autorzy:

Horeczki, Réka

Powiązania:

https://bibliotekanauki.pl/articles/2211604.pdf

Data publikacji:

2022-09-28

Wydawca:

Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie

Tematy:

development path
Hungary
Pécs
regional centre

Opis:

The aim of the study is to provide an overview of the main milestones in the development of a regional centre in Hungary. Pécs is a centre of a depressed region. The Transdanubian region is among the 20 most disadvantaged regions of the European Union which shows a significant decline compared to previous years. This justifies the need for professional research directed at changing this situation by performing some tangible efforts. Pécs is a 2,000-years old city, acquiring various historical and mutually reinforcing central functions, by virtue of which it has developed into a regional centre. Of the historical drivers of the development of Pécs, the study is able to identify three groups of factors 1) centrality within its region, the regional functions it has fulfilled throughout its history, 2) culture and multiculturalism, and 3) industrial development. This study will analyse the relation of the cultural centre position and the other function of Pécs. The study is the first descriptive result of a research project1 that reviews the development and governance characteristics of a typical case of peripheral regions. Ongoing empirical analysis will allow the development of a development policy concept.

Źródło:

Prace Komisji Geografii Przemysłu Polskiego Towarzystwa Geograficznego; 2022, 36, 3; 30-42
2080-1653

Pojawia się w:

Prace Komisji Geografii Przemysłu Polskiego Towarzystwa Geograficznego

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 52.

Tytuł:

End Simplicial Vertices in Path Graphs

Autorzy:

Gutierrez, Marisa
Tondato, Silvia B.

Powiązania:

https://bibliotekanauki.pl/articles/31340940.pdf

Data publikacji:

2016-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

chordal graphs
clique trees
path graphs

Opis:

A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV -model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some UV -model where the maximal clique containing x is a leaf in this UV -model.

Źródło:

Discussiones Mathematicae Graph Theory; 2016, 36, 2; 393-408
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 53.

Tytuł:

Influence of the path type on selected technological effects in the trochoidal milling

Autorzy:

Waszczuk, K.
Karolczak, P.
Wiśniewska, M.
Kowalski, M.

Powiązania:

https://bibliotekanauki.pl/articles/103363.pdf

Data publikacji:

2017

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

hard machining
trochoidal milling
tool path

Opis:

The article presents basic information about machining materials in hardened state – it particularly describes a method of the so called hard milling. The paper discusses strategies and methods in hard milling, presents trochoidal milling, its advantages and disadvantages. It also presents research methodology and effects which concerned determination of a tool path impact on selected technological effects after trochoidal milling of the groove.

Źródło:

Advances in Science and Technology. Research Journal; 2017, 11, 1; 147-153
2299-8624

Pojawia się w:

Advances in Science and Technology. Research Journal

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 54.

Tytuł:

Borderland location as a factor of the development of the Terespol commune
Przygraniczne położenie jako czynnik rozwoju gminy Terespol

Autorzy:

Guzal-Dec, D.
Bartniczuk, K.
Zwolińska-Ligaj, M.

Powiązania:

https://bibliotekanauki.pl/articles/2048613.pdf

Data publikacji:

2021

Wydawca:

Akademia Bialska Nauk Stosowanych im. Jana Pawła II w Białej Podlaskiej

Tematy:

borderland commune
local development
path dependence

Opis:

Subject and purpose of work: The aim of the study was to determine the significance of the borderland location as a factor in the development of the Terespol commune. The paper answers the questions how the borderland location is perceived by the inhabitants, whether it gives an opportunity for the development of the Terespol commune, and what is the significance of the borderland location compared to other factors in the commune's development. Materials and methods: The study uses the method of a survey with a representative sample of 50 inhabitants of the Terespol commune. The literature on the subject related to the factor of the borderland location and its role in local development as well as planning documents concerning the development of the commune were investigated. The analyzes were supplemented with a review of official statistical databases describing economic activity in the commune. The time scope of the research covers the years 1990-2021. Results: In the light of the research, the borderland location is the leading factor in the development of the commune, and keeping it on the current development path and the growing significance of this factor may increase the chance of building a “New Silk Road”. Other development potential are rich natural and landscape values which favour the expansion of tourism and agriculture. The potential of the local community – residents, local entrepreneurs, and local government – is assessed as low. In the opinion of the inhabitants the potential of the location is also not fully used. Conclusions: The commune's potential should be used in the development of additional production specialties, its multifunctionality and better adaptation to new socio-economic conditions resulting from the economic transformation and the challenges of increasing competitiveness. It is necessary to activate other functions and factors, whose significance has decreased over the years, including human capital activation. A fuller use of the commune's potential should be based to a greater extent on the participation of the local community

Źródło:

Economic and Regional Studies; 2021, 14, 3; 320-345
2083-3725
2451-182X

Pojawia się w:

Economic and Regional Studies

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 55.

Tytuł:

The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths

Autorzy:

Bielak, Halina
Dąbrowska, Kinga

Powiązania:

https://bibliotekanauki.pl/articles/747276.pdf

Data publikacji:

2015

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Tematy:

Cycle
path
Ramsey number
Turan number

Opis:

The Ramsey number \(R(G, H)\) for a pair of graphs \(G\) and \(H\) is defined as the smallest integer \(n\) such that, for any graph \(F\) on \(n\) vertices, either \(F\) contains \(G\) or \(\overline{F}\) contains \(H\) as a subgraph, where \(\overline{F}\) denotes the complement of \(F\). We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers \(R(K_1+L_n, P_m)\) and \(R(K_1+L_n, C_m)\) for some integers \(m\), \(n\), where \(L_n\) is a linear forest of order \(n\) with at least one edge.

Źródło:

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2015, 69, 2
0365-1029
2083-7402

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 56.

Tytuł:

Independent cycles and paths in bipartite balanced graphs

Autorzy:

Orchel, Beata
Wojda, A.

Powiązania:

https://bibliotekanauki.pl/articles/743087.pdf

Data publikacji:

2008

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

bipartite graphs
bi-placing
path
cycle

Opis:

Bipartite graphs G = (L,R;E) and H = (L',R';E') are bi-placeabe if there is a bijection f:L∪R→ L'∪R' such that f(L) = L' and f(u)f(v) ∉ E' for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H| = 2p ≥ 4 such that the sizes of G and H satisfy ||G|| ≤ 2p-3 and ||H|| ≤ 2p-2, and the maximum degree of H is at most 2, then G and H are bi-placeable, unless G and H is one of easily recognizable couples of graphs. This result implies easily that for integers p and k₁,k₂,...,kₗ such that $k_i ≥ 2$ for i = 1,...,l and k₁ +...+ kₗ ≤ p-1 every bipartite balanced graph G of order 2p and size at least p²-2p+3 contains mutually vertex disjoint cycles $C_{2k₁},...,C_{2kₗ}$, unless $G = K_{3,3} - 3K_{1,1}$.

Źródło:

Discussiones Mathematicae Graph Theory; 2008, 28, 3; 535-549
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 57.

Tytuł:

A New Strategy of Tool Path Planning Based on Hydrodynamic Data to Machine Marine Propeller

Autorzy:

Breteau, T.
Damay, T.
Duc, E.
Hascoët, J.-Y.

Powiązania:

https://bibliotekanauki.pl/articles/971234.pdf

Data publikacji:

2009

Wydawca:

Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych

Tematy:

propeller
tool path planning
machining methodology

Opis:

Marine propellers are complex surfaces that are usually machined with a perfect roughness in order not to disturb the theoretical flow. Because this requirement is penalizing from a manufacturing point of view, the global objective of the study is to propose an approach in which the machining parameters are linked to functional properties of the blade in order to remove the polishing phase. To reach this objective, hydrodynamic data are used: streak lines, that are computed during the propeller design phase, characterize the fluid behavior at the close vicinity of the blade. Those lines, which are theoretically continuous at the leading edge, turn out to be discontinuous, due to the computing method. To be consistent with the fluid behavior as much as possible, the idea presented in the paper is to compose a continuous trajectory, especially at the leading edge, to mill the surface. Thus, an algorithm is developed to plan tool paths which are smoothed at leading edge using Bezier curves. Moreover, this algorithm allows to quantify the cusp height at the leading edge to avoid a drop in performance using criteria linked to the dynamical behavior of a five axis machine tool. In this work, a strategy is developed and enables multiaxial milling of a blade surface by using geometric and hydrodynamic data and by respecting the associated constraints.

Źródło:

Journal of Machine Engineering; 2009, 9, 1; 29-40
1895-7595
2391-8071

Pojawia się w:

Journal of Machine Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 58.

Tytuł:

Distributed Evolutionary Algorithm for Path Planning in Navigation Situation

Autorzy:

Śmierzchalski, R.
Kuczkowski, Ł.
Kolendo, P.
Jaworski, B.

Powiązania:

https://bibliotekanauki.pl/articles/116175.pdf

Data publikacji:

2013

Wydawca:

Uniwersytet Morski w Gdyni. Wydział Nawigacyjny

Tematy:

evolutionary algorithm
path planning
simulation environment

Opis:

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 several independent populations leads to an improvement of the ultimate solution compared to a single population approach. The concept was checked against a problem of maritime collision avoidance.

Źródło:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2013, 7, 2; 293-300
2083-6473
2083-6481

Pojawia się w:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 59.

Tytuł:

Zastosowanie path dependence do badań nad przemianami instytucji kultury w Polsce

Autorzy:

Cyboran, Beata

Powiązania:

https://bibliotekanauki.pl/articles/28407816.pdf

Data publikacji:

2021

Wydawca:

Uniwersytet Komisji Edukacji Narodowej w Krakowie

Tematy:

path dependence
sektor kultury
polityka kulturalna

Opis:

Dynamika procesów kulturowych, jakie zachodzą we współczesnym świecie, skłania ku poszukiwaniu uwarunkowań ich przebiegu. Szczególnie intrygujące, a zarazem bardzo trudne do analizy wydają się zjawiska, których trajektorie rozwojowe uzależnione są od wielu różnorodnych czynników. W niniejszym artykule podjęto próbę przybliżenia koncepcji path dependence, mieszczącej się w nurcie nowego instytucjonalizmu historycznego, która może stanowić ciekawe podejście w analizowaniu trajektorii rozwojowych różnych zinstytucjonalizowanych zjawisk społeczno-kulturowych. Przydatność analityczną charakteryzowanej koncepcji można wykazać na przykładzie przemian instytucji kultury w Polsce po 1989 roku w odniesieniu do polityki kulturalnej państwa z początkowego okresu transformacji ustrojowej.

Źródło:

Annales Universitatis Paedagogicae Cracoviensis. Studia de Arte et Educatione; 2021, 16, 363; 114-128
2081-3325
2300-5912

Pojawia się w:

Annales Universitatis Paedagogicae Cracoviensis. Studia de Arte et Educatione

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 60.

Tytuł:

Colorings of Plane Graphs Without Long Monochromatic Facial Paths

Autorzy:

Czap, Július
Fabrici, Igor
Jendrol’, Stanislav

Powiązania:

https://bibliotekanauki.pl/articles/32222689.pdf

Data publikacji:

2021-08-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

plane graph
facial path
vertex-coloring

Opis:

Let G be a plane graph. A facial path of G is a subpath of the boundary walk of a face of G. We prove that each plane graph admits a 3-coloring (a 2-coloring) such that every monochromatic facial path has at most 3 vertices (at most 4 vertices). These results are in a contrast with the results of Chartrand, Geller, Hedetniemi (1968) and Axenovich, Ueckerdt, Weiner (2017) which state that for any positive integer t there exists a 4-colorable (a 3-colorable) plane graph G_t such that in any its 3-coloring (2-coloring) there is a monochromatic path of length at least t. We also prove that every plane graph is 2-list-colorable in such a way that every monochromatic facial path has at most 4 vertices.

Źródło:

Discussiones Mathematicae Graph Theory; 2021, 41, 3; 801-808
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 61.

Tytuł:

Parsing based on n-path tree - controlled grammars

Autorzy:

Čermák, M.
Koutný, J.
Meduna, A.

Powiązania:

https://bibliotekanauki.pl/articles/375747.pdf

Data publikacji:

2011

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

regulated rewriting
derivation tree
tree-controlled grammars
path-controlled grammars
parsing
n-path tree-controlled grammars

Opis:

This paper discusses recently introduced kind of linguistically motivated restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees restricted by a control language. We deal with restrictions placed on n greater-than or equal to 1 paths controlled by a deterministic context-free language, and we recall several basic properties of such a rewriting system. Then, we study the possibilities of corresponding parsing methods working in polynomial time and demonstrate that some non-context-free languages can be generated by this regulated rewriting model. Furthermore, we illustrate the syntax analysis of LL grammars with controlled paths. Finally, we briefly discuss how to base parsing methods on bottom-up syntax-analysis.

Źródło:

Theoretical and Applied Informatics; 2011, 23, 3-4; 213-228
1896-5334

Pojawia się w:

Theoretical and Applied Informatics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 62.

Tytuł:

Mysticism in Tibetan Buddhism. A study into the Path of Insight

Autorzy:

Wysocki, Adam

Powiązania:

https://bibliotekanauki.pl/articles/951732.pdf

Data publikacji:

2019

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

mind
preliminary practices
tranquility meditation
penetrating insight meditation
the Path of Insight
the Path of Liberation

Opis:

The Path of Insight is a spiritual path of Tibetan Buddhism tradition. The fundamental part consists of three elements, such like: preliminary practices, the tranquility meditation and the penetrating insight meditation. However, counted three parts one ought to perceive as aspects of one process aiming to realize of the soteriology purpose. The achievement of the non-dual state has its own development process, which consists experience of the non-dual state, stabilise it and then development of it. Outline of development process is contained in the Path o Insight and relies on exceeding of subjective-objective divisibility. It isperceived as an effect of the ignorance of true nature of the individual. The achievement of the non-dual state, that is nature of the mind (tib. sems nyid) constitutes the purpose of the Path of Insight and it is described by concept-symbol called mahamudra.

Źródło:

Kultura-Społeczeństwo-Edukacja; 2019, 16, 2
2300-0422

Pojawia się w:

Kultura-Społeczeństwo-Edukacja

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 63.

Tytuł:

Ewolucyjna metoda wyznaczania zadanej trajektorii statku z zastosowaniem mechanizmu niszowania
Evolutionary method of ship path planning with the application of niching mechanism

Autorzy:

Kolendo, P.
Jaworski, B.
Kuczkowski, Ł.
Śmierzchalski, R.
Witkowska, A.

Powiązania:

https://bibliotekanauki.pl/articles/267296.pdf

Data publikacji:

2013

Wydawca:

Politechnika Gdańska. Wydział Elektrotechniki i Automatyki

Tematy:

algorytmy ewolucyjne
niszowanie ścieżek przejść
planowanie ścieżek przejść
evolutionary algorithms
niching path planning
ship path planning

Opis:

Artykuł prezentuje implementację mechanizmu niszowania do ewolucyjnej metody wyznaczania zadanej trajektorii statku. W metodzie proponowane jest porównywanie różnorodności osobników w oparciu o fizyczną odległość między trajektoriami. Badania pokazują, że takie podejście zwiększa efektywność eksploracji przestrzeni rozwiązań dzięki czemu osiąga się poprawę końcowej wartości funkcji przystosowania. Problem poszukiwania ścieżki przejścia rozpatrywany jest w oparciu o sytuacje kolizyjne na morzu.
Paper presents the application of niching mechanism in the ship evolutionary path planning method. In presented method the comparison of individuals diversity is proposed according to physical distance between paths. Paper presents advantages and disadvantages of such approach in comparison to classic method. The problem is considered for several ship collision avoidance scenarios at different levels of difficulty.

Źródło:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2013, 36; 97-101
1425-5766
2353-1290

Pojawia się w:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 64.

Tytuł:

Texture evolution in Mg during rolling with a change of deformation path – a modeling approach

Autorzy:

Sułkowski, Bartosz

Powiązania:

https://bibliotekanauki.pl/articles/29520073.pdf

Data publikacji:

2022

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

Mg
deformation path
modeling
texture
modelowanie
tekstura

Opis:

The weakening of strong textures in Mg alloys is a crucial factor in obtaining good quality final products that are less anisotropic. Considerable attention has been focused on experiments to find the optimal chemical composition of alloys or processing conditions. However, to reduce time-consuming experiments, texture simulations can help in specifying future research directions. In the present work, the texture evolution in rolled Mg and its alloys was studied using the viscoplastic self-consistent model. The texture simulations presented in the study cover unidirectional rolling, reverse rolling, and cross rolling of Mg and its alloys to check if the change in deformation path has an impact on the activation of non-basal slip systems. The results obtained in the study may help to design the best processing technology and reduce the mechanical anisotropy of magnesium alloys. Slip systems such as basal, prismatic, and pyramidal were taken into consideration. To reflect the effect of alloying elements on hardening, different values for critical resolved shear stress were considered. Pole figures and slip system activity were investigated to understand the texture evolution during rolling as the deformation path changes. It was found that cross rolling may be the most effective processing technology to reduce strong textures during the rolling of Mg alloys. To activate non-basal systems, critical resolved shear stresses and the Schmid factor must be modified. The former can be changed by increasing the processing temperature, proper alloying elements, or change in the strain rate sensitivity; the latter by changing the deformation path.

Źródło:

Computer Methods in Materials Science; 2022, 22, 2; 101-109
2720-4081
2720-3948

Pojawia się w:

Computer Methods in Materials Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 65.

Tytuł:

Edge decompositions of multigraphs into multi-2-paths

Autorzy:

Kratochvil, J.
Lonc, Z.
Meszka, M.
Skupień, Z.

Powiązania:

https://bibliotekanauki.pl/articles/2050185.pdf

Data publikacji:

2004

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

edge decomposition
multigraph
multipath
path
time complexity

Opis:

We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.

Źródło:

Opuscula Mathematica; 2004, 24, 1; 97-102
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 66.

Tytuł:

Flight path management of an aircraft in emergency situation

Autorzy:

Majka, A.

Powiązania:

https://bibliotekanauki.pl/articles/248107.pdf

Data publikacji:

2014

Wydawca:

Instytut Techniczny Wojsk Lotniczych

Tematy:

general aviation
flight path optimization
flight safety

Opis:

A distress event i.e. loss of engine power, structural damage etc., creates a major emergency situation in General Aviation (GA) aircraft. It requires location of a safe-to-land runway within reach, and immediately planning and executing an effective flight path towards it. Currently, technological development in avionics allows creating a flight deck decision support tool for trajectory planning of GA aircraft in emergency situation. Principal part of the system constitutes flight path optimization module. The automated path-planning algorithm generates within seconds an optimized trajectory to be followed by the pilot to safe landing. The trajectory planning is formulated as an optimal control problem, with the aircraft kinematics and dynamics expressed by the state equations, and objective functional that may capture the time, length, energy loss, etc. Obstacles and restricted or prohibited zones are represented as constraints on the positional state variables. The purpose of the paper is to present the method of flight path optimization of an aircraft in emergency, after a distress event, which makes impossible continuation of the original flight. The methods allow determining optimal escape flight path from special protection areas (e.g. cities etc.) or danger zones, as well. The simplified realization of the Ritz-Galerkin method was used in this work, which uses an approximate solution to boundary value problems for determining the optimal flight trajectory. The method allows determining the optimal trajectory of the flight satisfying the initial/final conditions and control functions and path constrains for an aircraft.

Źródło:

Journal of KONES; 2014, 21, 4; 327-334
1231-4005
2354-0133

Pojawia się w:

Journal of KONES

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 67.

Tytuł:

The Traces of Mining on the Krzeszowice Land – Geotouristic Path
Ścieżka dydaktyczno-przyrodnicza: Śladami górnictwa Ziemi Krzeszowickiej

Autorzy:

Mikołajczyk, A.
Odrzywołek, T.
Piechnik, P.
Gliniak, M.

Powiązania:

https://bibliotekanauki.pl/articles/319069.pdf

Data publikacji:

2016

Wydawca:

Polskie Towarzystwo Przeróbki Kopalin

Tematy:

geoturystyka
Krzeszowice
ścieżka geologiczna
geotouristic
geological path

Opis:

The paper shows the idea of a geological and didactic path “The traces of mining on the Krzeszowice Land”. The route was located in the three villages: Zalas, Tenczynek and Krzeszowice. The main purpose of the path is promoting the values of the scientific and geological heritage in the Krzeszowice Land. Designed path has 16 km long and 5 stops. The path is designed for people of any age, the most convenient to travel the route by bike.
W niniejszym artykule przedstawiono koncepcję utworzenia geologicznej ścieżki dydaktyczno-przyrodniczej: Śladami górnictwa Ziemi Krzeszowickiej. Trasa ścieżki zlokalizowana została na terenie miejscowości Zalas, Tenczynek i Krzeszowice. Głównym założeniem ścieżki jest propagowanie walorów naukowych dziedzictwa geologicznego na terenie Ziemi Krzeszowickiej. Opracowana ścieżka liczy 16 km długości, a na jej trasie zlokalizowano 5 przystanków. Ścieżka przeznaczona jest dla ludzi w dowolnym wieku, jej trasę najwygodniej pokonać rowerem.

Źródło:

Inżynieria Mineralna; 2016, R. 17, nr 1, 1; 1-6
1640-4920

Pojawia się w:

Inżynieria Mineralna

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 68.

Tytuł:

Pre-filtered backstepping control for underactuated ship path following

Autorzy:

Liu, Zhiquan

Powiązania:

https://bibliotekanauki.pl/articles/259576.pdf

Data publikacji:

2019

Wydawca:

Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa

Tematy:

underactuated ships
path following
backstepping
pre-filter

Opis:

Robust path following control for underactuated surface ships is an important issue in marine control practice. This paper aims to improve the robustness of the close-loop system with model uncertainties and time-varying disturbances. A practical adaptive backstepping control scheme with a pre-filter is proposed to force a surface vessel to track the predefined path generated by the virtual ship. Based on the Lyapunov stability theorem, this algorithm can guarantee all error signals in the overall system to be uniformly ultimately bounded, and it can be implemented without exact knowledge of the nonlinear damping structure and environmental disturbances. The proposed pre-filter can smooth the commanded heading order and obtain a better performance of the waypoint-based navigation control system. Two simulation cases are drawn to illustrate the validity of the proposed control strategy.

Źródło:

Polish Maritime Research; 2019, 2; 68-75
1233-2585

Pojawia się w:

Polish Maritime Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 69.

Tytuł:

Decompositions into two paths

Autorzy:

Skupień, Zdzisław

Powiązania:

https://bibliotekanauki.pl/articles/744378.pdf

Data publikacji:

2005

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

graph
multigraph
path decomposition
hamiltonian decomposition
traceable

Opis:

It is proved that a connected multigraph G which is the union of two edge-disjoint paths has another decomposition into two paths with the same set, U, of endvertices provided that the multigraph is neither a path nor cycle. Moreover, then the number of such decompositions is proved to be even unless the number is three, which occurs exactly if G is a tree homeomorphic with graph of either symbol + or ⊥. A multigraph on n vertices with exactly two traceable pairs is constructed for each n ≥ 3. The Thomason result on hamiltonian pairs is used and is proved to be sharp.

Źródło:

Discussiones Mathematicae Graph Theory; 2005, 25, 3; 325-329
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 70.

Tytuł:

ŚCIEŻKA PRZYRODNICZO-HISTORYCZNA „BOLKO” W HNISZOWIE
THE BOLKO NATURE-HISTORICAL PATH IN HNISZÓW

Autorzy:

Lipnicka, Zofia

Powiązania:

https://bibliotekanauki.pl/articles/536130.pdf

Data publikacji:

2006

Wydawca:

Narodowy Instytut Dziedzictwa

Tematy:

'BOLKO' - HISTORICAL PATH (HNISZÓW)
NATURE-HISTORICAL PARK

Opis:

Park premises deprived of buildings frequently become forgotten and vanish owing to assorted natural processes or human ventures. Eastern Poland has preserved numerous traces of nineteenth-century or older manorial complexes. One of them - the post-manorial park in Hniszow on the Bug (commune of Ruda-Huta) - includes a nature-historical path known as 'Bolko' from an oak tree-monument of Nature situated within this historical premise. Up to the opening of the path, Bolko remained the prime tourist attraction, which today encompasses also remnants of the historical premise. Due to the prolonged neglect of the object, the establishment of the path called for a great input of work, which involved also the local inhabitants. The presentation portrays the nineteenth-century composition of the park, although its origins go back to the sixteenth century. The landscape park combined the extant regular elements of a garden with the plants and landscape typical for the Bug river valley. The fundamental purposes of the trail include a revitalisation of the park, its accessibility to residents and tourists, and a display of the beauty of local Nature and unique trees. This type of an undertaking offers immense opportunities for numerous parts of Poland threatened with unemployment and possessing longforgotten parks.

Źródło:

Ochrona Zabytków; 2006, 1; 103-108
0029-8247

Pojawia się w:

Ochrona Zabytków

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 71.

Tytuł:

The Role of Foreign Direct Investment in Economic Growth. The Production Function Perspective

Autorzy:

Napiórkowski, Tomasz M

Powiązania:

https://bibliotekanauki.pl/articles/429670.pdf

Data publikacji:

2017

Wydawca:

Uniwersytet w Białymstoku. Wydawnictwo Uniwersytetu w Białymstoku

Tematy:

economic growth
foreign direct investment
absorption path

Opis:

Throughout the studies on the impact of foreign direct investment (FDI) on the economic growth of the host economy, there is a significant heterogeneity in terms of the results; not only between the theory and empirics, but also within empirics itself. The aim of this study is to explain the heterogeneity of results of the previous studies on the benefits of hosting FDI. This work uses the topic-relevant literature to present the key benefits of inward FDI, which are then translated into a mathematical model, which the direct and indirect benefits are derived from and differentiated between. Firstly, this work develops a production function including the key direct and indirect effects of hosting FDI in order to (through the proof of endogenization of FDI) show that a simple inclusion of FDI as the next (usually along with capital and labor) factor of growth may lead to spurious and, therefore, inconsistent results. Secondly, the study introduces the Foreign Direct Investment Benefits Absorption Path, which due to its classification of host economies into four distinctive groups, differentiating between direct and indirect benefits of FDI, and showing their different ways of impacting the host’s economy provides a unique insight into the topic of heterogeneity of results on the impact of hosting FDI. It also provides a blueprint for further research into this topic. Lastly, the Foreign Direct Investment Benefits Absorption Path is used to develop FDI-related strategies aimed at increasing the economic growth of host countries.

Źródło:

Optimum. Economic Studies; 2017, 5(89)
1506-7637

Pojawia się w:

Optimum. Economic Studies

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 72.

Tytuł:

Selection of sound insulating elements in hydraulic excavators based onidentification of vibroacoustic energy propagation paths

Autorzy:

Dąbrowski, Z.
Dziurdź, J.
Pakowski, R.

Powiązania:

https://bibliotekanauki.pl/articles/177189.pdf

Data publikacji:

2013

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

noise and vibration
propagation path
coherence function

Opis:

In spite of the fact that standardizing operations and increased awareness of hazards led to a significant improvement of vibroacoustic climate of operator’s stands of new machines, their long-term operation - often under difficult conditions - leads to a fast degradation of acoustic qualities of machines. Temporary operations performed during surveys and periodical overhauls are rarely effective, due to the lack of any guidelines. In this situation the authors propose the algorithm for selection of eventual screens or sound absorbing and sound insulating partitions, utilizing the measuring procedure aimed at identification, at the operator’s stand, of main noise components originated from various sources. On the basis of this procedure, the vibroacoustic energy propagation paths in the machine was estimated.

Źródło:

Archives of Acoustics; 2013, 38, 4; 471-478
0137-5075

Pojawia się w:

Archives of Acoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 73.

Tytuł:

Following 3D paths by a manipulator

Autorzy:

Mazur, A.
Płaskonka, J.
Kaczmarek, M.

Powiązania:

https://bibliotekanauki.pl/articles/230073.pdf

Data publikacji:

2015

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

path following
Serret-Frenet parametrization
orthogonal projection

Opis:

In the paper a description of a manipulator relative to a desired three-dimensional path was presented. The path is parameterized orthogonally to the Serret-Frenet frame which is moving along the curve. For the path two different time parameterizations were chosen. The control law for the RTR manipulator which ensures realization of the task was specified. Theoretical considerations were illustrated by simulation results.

Źródło:

Archives of Control Sciences; 2015, 25, 1; 117-133
1230-2384

Pojawia się w:

Archives of Control Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 74.

Tytuł:

A local model and calibration set ensemble strategy for open-path FTIR gas measurement with varying temperature

Autorzy:

Cięszczyk, S.

Powiązania:

https://bibliotekanauki.pl/articles/220752.pdf

Data publikacji:

2013

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

ensemble methods
FTIR
open path
temperature variation

Opis:

Open-Path Fourier Transform Infrared OP-FTIR spectrometers are commonly used for the measurement of atmospheric pollutants and of gases in industrial processes. Spectral interpretation for the determination of gas concentrations is based on the HITRAN database line-by-line modeling method. This article describes algorithms used to model gas spectra and to determine gas concentration under variable temperatures. Integration of individual rotational lines has been used to reduce the impact of spectrometer functions on the comparison of both measured and synthetic modeled spectra. Carbon monoxide was used as an example. A new algorithm for gas concentration retrieval consisting of two ensemble methods is proposed. The first method uses an ensemble of local models based on linear and non-linear PLS (partial least square) regression algorithms, while the second is an ensemble of a calibration set built for different temperatures. It is possible to combine these methods to decrease the number of regression models in the first ensemble. These individual models are appropriate for specific measurement conditions specified by the ensemble of the calibration set. Model selection is based on comparison of gas spectra with values determined from each local model.

Źródło:

Metrology and Measurement Systems; 2013, 20, 3; 513-524
0860-8229

Pojawia się w:

Metrology and Measurement Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 75.

Tytuł:

Biologically Inspired Energy Efficient Routing Protocol in Disaster Situation

Autorzy:

Chavan, Shankar D.
Thorat, Amruta S.
Gunjal, Monica S.
Vibhute, Anup S.
Desai, Kamalakar R.

Powiązania:

https://bibliotekanauki.pl/articles/2202999.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

WSN
ACO
AAR
path optimization
efficient routing

Opis:

Wireless sensor network (WSN) plays a crucial role in many industrial, commercial, and social applications. However, increasing the number of nodes in a WSN increases network complexity, making it harder to acquire all relevant data in a timely way. By assuming the end node as a base station, we devised an Artificial Ant Routing (AAR) method that overcomes such network difficulties and finds an ideal routing that gives an easy way to reach the destination node in our situation. The goal of our research is to establish WSN parameters that are based on the biologically inspired Ant Colony Optimization (ACO) method. The proposed AAR provides the alternating path in case of congestion and high traffic requirement. In the event of node failures in a wireless network, the same algorithm enhances the efficiency of the routing path and acts as a multipath data transmission approach. We simulated network factors including Packet Delivery Ratio (PDR), Throughput, and Energy Consumption to achieve this. The major objective is to extend the network lifespan while data is being transferred by avoiding crowded areas and conserving energy by using a small number of nodes. The result shows that AAR is having improved performance parameters as compared to LEACH, LEACH-C, and FCM-DS-ACO.

Źródło:

International Journal of Electronics and Telecommunications; 2023, 69, 1; 163--168
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 76.

Tytuł:

Asteroidal Quadruples in non Rooted Path Graphs

Autorzy:

Gutierrez, Marisa
Lévêque, Benjamin
Tondato, Silvia B.

Powiązania:

https://bibliotekanauki.pl/articles/31339314.pdf

Data publikacji:

2015-11-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

clique trees
rooted path graphs
asteroidal quadruples

Opis:

A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.

Źródło:

Discussiones Mathematicae Graph Theory; 2015, 35, 4; 603-614
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 77.

Tytuł:

The Alive-in-Range Medium Access Control Protocol to Optimize Queue Performance in Underwater Wireless Sensor Networks

Autorzy:

Raina, V.
Jha, M. K.
Bhattacharya, P. P.

Powiązania:

https://bibliotekanauki.pl/articles/308608.pdf

Data publikacji:

2017

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

Alive-in-Range MAC
effective path determination
mobile sink
optimum throughput path determination
underwater wireless sensor network

Opis:

Time synchronization between sensor nodes to reduce the end-to-end delay for critical and real time data monitoring can be achieved by cautiously monitoring the mobility of the mobile sink node in underwater wireless sensor networks. The Alive-in-Range Medium Access Control (ARMAC) protocol monitors the delay of sensitive, critical and real-time data. The idea evolves as it involves reduction in duty cycle, precise time scheduling of active/sleep cycles of the sensors, monitoring the mobility of the sink node with the selection of appropriate queues and schedulers. The model for the path loss due to attenuation of electromagnetic wave propagation in the sea water is explained. The three-path reflection model evaluating reflection loss from the air-water and watersand interfaces as a function of distance between sensors and water depth is introduced. The algorithms for effective path determination and optimum throughput path determination are elaborated. The results verify that implementation of the Alive-in-Range MAC protocol has reduced the total number of packets dropped, the average queue length, the longest time in queue, the peak queue length and the average time in queue significantly, making it relevant for critical and real-time data monitoring.

Źródło:

Journal of Telecommunications and Information Technology; 2017, 4; 31-46
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 78.

Tytuł:

Uwarunkowania zmian ścieżek rozwoju słabo rozwiniętych regionów w świetle teorii rozwoju regionalnego

Autorzy:

Pylak, Korneliusz

Powiązania:

https://bibliotekanauki.pl/articles/2022519.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

adaptability
adaptation
crisis
economic shocks
innovation process models
less-developed regions
path dependency
regional development path
regional resilience

Źródło:

Studia komitetu przestrzennego zagospodarowania kraju PAN; 2017, 179; 59-72
0079-3507

Pojawia się w:

Studia komitetu przestrzennego zagospodarowania kraju PAN

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 79.

Tytuł:

Diffusion Path in Ternary One-Phase Systems: An Overview

Autorzy:

Serafin, D.
Nowak, W. J.
Wierzba, P.
Wędrychowicz, S.
Wierzba, Bartek

Powiązania:

https://bibliotekanauki.pl/articles/175705.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

inter-diffusion
up-hill diffusion
diffusion path

Opis:

In this article, the fundamental questions concerning the diffusion path, in particular, what is the shape of diffusion path in ternary systems and how to approximate it from the initial concentration profile, will be answered. The new rules were found which allow for determining the diffusion path from a known initial concentration of the components. This approximation will allow for designing new materials without a time-consuming numerical simulation of the full system of equations. It is shown that the difference in intrinsic diffusion coefficients determines the up-hill diffusion.

Źródło:

Advances in Manufacturing Science and Technology; 2020, 44, 1; 1-8
0137-4478

Pojawia się w:

Advances in Manufacturing Science and Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 80.

Tytuł:

Network routing method for ships and other moving objects using MATLAB

Autorzy:

Sakharov, Vladimir V.
Chertkov, Alexandr A.
Ariefjew, Igor B.

Powiązania:

https://bibliotekanauki.pl/articles/135140.pdf

Data publikacji:

2020

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

algorithm
path
optimization
transport
automation
moving object

Opis:

Task planning involves automating the creation of the routes for vessels with known coordinates in a confined space. The management of vessel release in a given area affects the time required for a vessel to complete its voyage, and maximizing vessel performance involves identifying the shortest route. A key issue in automating the generation of the optimal (shortest) routes is selecting the appropriate mathematical apparatus. This paper considers an optimization method based on a recursive algorithm using Bellman-Ford routing tasks for large dimensions. Unlike other optimization techniques, the proposed method enables the shortest path to be assessed in a network model with a complex topology, even if there are arcs with negative weights. The practical implementation of the modified Floyd algorithm was demonstrated using a sample automated build and using it to calculate a network model with a complex topology, using an iterative procedure for a program prepared in MATLAB. Implementation of the computer model is simple, and unlike existing models, it eliminates restrictions associated with the presence of negative weights and cycles on a network and automates search shortcuts in ground branch functional means in MATLAB. To confirm the accuracy of the obtained results, we performed an example calculation using the network. The proposed algorithm and recursive procedure are recommended for finding energy-efficient solutions during the management of mobile objects on waterways.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2020, 62 (134); 61-68
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 81.

Tytuł:

Real-time coordinated trajectory planning and obstacle avoidance for mobile robots

Autorzy:

McNinch, L. C.
Soltan, R. A.
Muske, K. R.
Ashrafiuon, H.
Peyton, J. C.

Powiązania:

https://bibliotekanauki.pl/articles/384978.pdf

Data publikacji:

2011

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

path planning
obstacle avoidance
ODE
mobile robots

Opis:

A novel method for real-time coordinated trajectory planning and obstacle avoidance of autonomous mobile robot systems is presented. The desired autonomous system trajectories are generated from a set of first order ODEs. The solution to this system of ODEs converges to either a desired target position or a closed orbit de.ned by a limit cycle. Coordinated control is achieved by utilizing the nature of limit cycles where independent, non-crossing paths are automatically generated from different initial positions that smoothly converge to the desired closed orbits. Real-time obstacle avoidance is achieved by specifying a transitional elliptically shaped closed orbit around the nearest obstacle blocking the path. This orbit determines an alternate trajectory that avoids the obstacle. When the obstacle no longer blocks a direct path to the original target trajectory, a transitional trajectory that returns to the original path is defined. The coordination and obstacle avoidance methods are demonstrated experimentally using differential-drive wheeled mobile robots.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 23-29
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 82.

Tytuł:

Reduced number of design parameters in optimum path synthesis with timing of four-bar linkage

Autorzy:

Buśkiewicz, J.

Powiązania:

https://bibliotekanauki.pl/articles/279257.pdf

Data publikacji:

2018

Wydawca:

Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej

Tematy:

path synthesis
evolutionary algorithm
four-bar linkage

Opis:

The paper presents the method for the optimal synthesis of four-link mechanism generating open/closed paths with time prescription. Although the method is suitable for both closed and open paths, it enables decreasing the number of design parameters describing dimensions, orientation and position of a path generator. Compared to the methods presented in the references, this is a one-phase synthesis method; although the number of design parameters is reduced, the method does not require affine transformations to be performed on the synthesised mechanism. The effectiveness of the method is discussed based on examples of three paths, with two taken from the literature.

Źródło:

Journal of Theoretical and Applied Mechanics; 2018, 56, 1; 43-55
1429-2955

Pojawia się w:

Journal of Theoretical and Applied Mechanics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 83.

Tytuł:

Universal test stand for research of aeronautical multi - power path gear demonstrators

Autorzy:

Kozik, B.
Budzik, G.
Cieplak, M.

Powiązania:

https://bibliotekanauki.pl/articles/246565.pdf

Data publikacji:

2012

Wydawca:

Instytut Techniczny Wojsk Lotniczych

Tematy:

test stand
multi-power path gear
demonstrator

Opis:

Gears used for the tests may be made of metal or plastic [1, 2, 5]. The stand has been designed in an open system and it is powered by a three-phase electric motor. The control is provided by a single-phase inverter with three outputs, which provides full speed control. All components have been installed on a table equipped with T-slots in order to determine the optimal position of the drive and the tested gear. The load of the stand is realized by an electromagnetic powder brake. Load torque of the gear depends on the supplied current. During the test, you can change settings such as speed or load torque. Torque meters installed on input and output of the demonstrator let you control the work of the whole gear. Values supplied by the torque meters (torque and speed) are recorded on a computer in real time (according to PC RTC) and archived by specialized software. The software installed on your computer allows you to view results of the measurements. The possibility to control working time lets you precisely define the time intervals of various stages of the research. Using timer makes it possible to observe the current consumption of the transmission and helps to establish the research process. Thanks to data, recording you will know when the gear is damaged. Tests at this stand allow for obtaining stable working parameters, and thus for obtaining not distorted, accurate results of the demonstrator operation. Changing the gear is exceptionally simple because of the use of sliding splined connections of the couplings. Separating couplings between which the gear is situated and unlocking, the terminal allows exchanging it.

Źródło:

Journal of KONES; 2012, 19, 3; 233-238
1231-4005
2354-0133

Pojawia się w:

Journal of KONES

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 84.

Tytuł:

Contested identities and symbolic changes in the urban space of Bytom (Poland). The historical-geographical approach

Autorzy:

Lamparska, Marzena

Powiązania:

https://bibliotekanauki.pl/articles/1199465.pdf

Data publikacji:

2020-12-31

Wydawca:

Uniwersytet Gdański. Instytut Geografii

Tematy:

identity
heritage
development path
questioning
contradiction
conflict

Opis:

Bytom is a city located in Upper Silesia, in the southern part of Poland which after World War II found itself within the boundaries of Poland after several hundred years. For many centuries, the main function of the city has been metal-ore and hard coal mining, which considerably contributed to its historical identity. The over 800-year history is full of numerous social, economic and ethnic conflicts caused by frequent changes in the city’s political affiliation and frequent redefinitions of its identity. After the collapse of communism, during the political and economic transformation, there arose a need to determine a new development path, in particular a new perspective on the heritage from the times of German dominance and from the times of communism. The mining and heavy industries have already ceased to be the basis of Bytom’s identity. Taking account of these historical rationales, this article attempts to answer the question of whether, among a number of contradictions and conflicts, the urban community of today’s Bytom, heterogeneous in terms of its origin, will be able to generate a model of cultural identity and historical remembrance accepted by all. All these complex and at the same time contradictory processes have been discussed through the prism of their reflection in the urban space and examined by means of historical analysis and contemporary cartographic and photographic sources.

Źródło:

Journal of Geography, Politics and Society; 2020, 10, 4; 33-48
2084-0497
2451-2249

Pojawia się w:

Journal of Geography, Politics and Society

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 85.

Tytuł:

The crossing numbers of certain Cartesian products

Autorzy:

Klešč, Marián

Powiązania:

https://bibliotekanauki.pl/articles/971930.pdf

Data publikacji:

1995

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

graph
drawing
crossing number
path
Cartesian product

Opis:

In this article we determine the crossing numbers of the Cartesian products of given three graphs on five vertices with paths.

Źródło:

Discussiones Mathematicae Graph Theory; 1995, 15, 1; 5-10
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 86.

Tytuł:

Characterization of Propagation Models in Wireless Communications for 4G Network

Autorzy:

Al-Aamri, Nawal
Nadir, Zia
Al-Lawati, Hassan
Suwailam, Mohammed Bait

Powiązania:

https://bibliotekanauki.pl/articles/2055256.pdf

Data publikacji:

2022

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

path loss model
prediction
4G
RMSE

Opis:

Estimating the pathloss and signal strength of the transmitted signal at specific distances is one of the main objectives of network designers. This paper aims to provide generalized pathloss models appropriate for urban areas in Muscat the capital city of the Sultanate of Oman environment. The research includes studying different models of pathloss for the 4G cellular network at Muttrah Business District (MBD) at Muscat. Different models (Free Space model, Okumura Hata, Extended Sakagami, Cost231 Hata, ECC-33 Hata – Okumura extended, Ericsson, Egli, and SUI) are used with 800MHz. The results of the prediction models are compared with real measured data by calculating RMSE. The generalized models are created by modified original models to get accepted RMSE values. Different cells at MBD are tested by modified models. The RMSE values are then calculated for verification purposes. To validate the modified pathloss models of 4G, they are also applied at different cells in a different city in the capital. It has approximately the same environment as MBD. The modified pathloss models provided accepted predictions in new locations.

Źródło:

International Journal of Electronics and Telecommunications; 2022, 68, 1; 137--143
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 87.

Tytuł:

The Path to Holiness According to Origen

Autorzy:

Romanek, Jacek

Powiązania:

https://bibliotekanauki.pl/articles/2037649.pdf

Data publikacji:

2017

Wydawca:

Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL

Tematy:

path of spiritual perfection
holiness
baptism
Origen

Opis:

The article displays the concept of the path leading to saintliness found within the extant early Christian works of the renowned theologian – Origen of Alexandria (185-253/254). The Alexandrian theologian creatively construes Saint Paul’s notions simultaneously employing allegorical exegesis to the biblical texts of the Old Testament. According to Origen, a Christian life is a dynamic process driven by two important life moments: 1) the conversion and baptism as a recovery of the slurred by sin God’s image and attaining of the state of initial holiness; 2) complete state of saintliness in the last days, towards which a Christian is progressing in his earthly life in order to perfect the semblance to God in himself through the acquisition of virtues. In Origen’s view of holiness, it is neither a state intricate to attain nor reserved only for the chosen ones, yet a bequest given by God at baptism, and at the same time tasked to every believer for life.

Źródło:

Roczniki Teologiczne; 2017, 64, 4 English Online Version; 5-20
2353-7272

Pojawia się w:

Roczniki Teologiczne

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 88.

Tytuł:

Loading velocity in consolidation analysis

Autorzy:

Dobak, P.

Powiązania:

https://bibliotekanauki.pl/articles/2059630.pdf

Data publikacji:

2003

Wydawca:

Państwowy Instytut Geologiczny – Państwowy Instytut Badawczy

Tematy:

consolidation
CL test programming
loading velocity path

Opis:

In consolidation CL test programming various recommendations are encountered with regard to the selection of loading velocity. The criterion of consistency of CL test results with the traditional IL system is not fully justifiable. The behaviour of soil in conditions of constant load increase shows peculiar theoretical and experimental characteristics, different from IL tests. An optimummethod of proper CL test velocity is the analysis of loading velocity path in subsoil. Thismethod allows for taking into consideration the effect of permeability decrease during increase of pore water pressure. The basic factors, scaling loading velocities in field and in laboratory conditions, are the conditions of drainage of pore water.

Źródło:

Geological Quarterly; 2003, 47, 1; 13-20
1641-7291

Pojawia się w:

Geological Quarterly

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 89.

Tytuł:

The critical path method in estimating project duration

Autorzy:

Nafkha, R.
Wiliński, A.

Powiązania:

https://bibliotekanauki.pl/articles/94943.pdf

Data publikacji:

2016

Wydawca:

Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie

Tematy:

critical path method
CPM algorithm
PERT method

Opis:

Undoubtedly, the most important criterion for assessing any project success is to achieve the planned main objective within scheduled time, under the assumed costs and corresponding to established project quality parameters. The article presents critical path method, that aims to determine project schedule which ensure an implementation shortest time. Ultimately, however the optimal project duration is designated after solving human resource deficiencies or conflicts occurring in the generated schedule.

Źródło:

Information Systems in Management; 2016, 5, 1; 78-87
2084-5537
2544-1728

Pojawia się w:

Information Systems in Management

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 90.

Tytuł:

Ścieżki i trasy rowerowe na terenie Raciborza, Rybnika i Wodzisławia Śląskiego jako elementy zrównoważonego rozwoju turystyki i rekreacji miejskiej
Bicycle paths and bicycle routes in the city Racibórz, Rybnik and Wodzisław śląski as element of sustainable development tourism and recreation

Autorzy:

Ryszka, Dariusz
Jęczmionka, Katarzyna

Powiązania:

https://bibliotekanauki.pl/articles/1181240.pdf

Data publikacji:

2020

Wydawca:

Państwowa Wyższa Szkoła Zawodowa w Raciborzu

Tematy:

bicycle path
sustainable development
investments
bike
tourism

Opis:

The article applies to bicycle paths and routes as an element of balanced tourism and urban recreation. In the article the areas of Racibórz, Rybnik and Wodzisław Śląski are compared in terms of bicycle infrastructure and ease of access to information about tchem, which are posted on the Internet. The article also informs about planned investments in the above-mentioned areas in the coming years.

Źródło:

Eunomia – Rozwój Zrównoważony – Sustainable Development; 2020, 1(98); 129-137
1897-2349
2657-5760

Pojawia się w:

Eunomia – Rozwój Zrównoważony – Sustainable Development

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 91.

Tytuł:

Numerical detection of bifurcation point in the curve

Autorzy:

Gulgowski, Jacek

Powiązania:

https://bibliotekanauki.pl/articles/748467.pdf

Data publikacji:

2015

Wydawca:

Polskie Towarzystwo Matematyczne

Tematy:

path following algorithm
bifurcation point
bifurcation simplex

Opis:

We are presenting a numerical method which detects the presence and position of a  bifurcation simplex, the regular $(k+1)$-dimensional simplex, which may be considered as "fat bifurcation point", in the curve of zeroes of the $C^1$ map $f:{\mathbb R}^{k+1}\to{\mathbb R}^k$. On the other hand the bifurcation simplex appears in the neighbourhood of the bifurcation point, meaning that we have the method to locate the bifurcation point as well. The method does not require any estimation of the derivative of the function $f$ and refers to the values of the map $f$ only in the vertices of certain triangulation. The bifurcation simplex is detected by change of the Brouwer degree value of the restriction of the map $f$ to the appropriate $k$-simplex.This publication is co-financed by the European Union as part of the European Social Fund within the project Center for Applications of Mathematics.

Źródło:

Mathematica Applicanda; 2015, 43, 1
1730-2668
2299-4009

Pojawia się w:

Mathematica Applicanda

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 92.

Tytuł:

The vertex monophonic number of a graph

Autorzy:

Santhakumaran, A.
Titus, P.

Powiązania:

https://bibliotekanauki.pl/articles/743760.pdf

Data publikacji:

2012

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

monophonic path
monophonic number
vertex monophonic number

Opis:

For a connected graph G of order p ≥ 2 and a vertex x of G, a set S ⊆ V(G) is an x-monophonic set of G if each vertex v ∈ V(G) lies on an x -y monophonic path for some element y in S. The minimum cardinality of an x-monophonic set of G is defined as the x-monophonic number of G, denoted by mₓ(G). An x-monophonic set of cardinality mₓ(G) is called a mₓ-set of G. We determine bounds for it and characterize graphs which realize these bounds. A connected graph of order p with vertex monophonic numbers either p - 1 or p - 2 for every vertex is characterized. It is shown that for positive integers a, b and n ≥ 2 with 2 ≤ a ≤ b, there exists a connected graph G with radₘG = a, diamₘG = b and mₓ(G) = n for some vertex x in G. Also, it is shown that for each triple m, n and p of integers with 1 ≤ n ≤ p -m -1 and m ≥ 3, there is a connected graph G of order p, monophonic diameter m and mₓ(G) = n for some vertex x of G.

Źródło:

Discussiones Mathematicae Graph Theory; 2012, 32, 2; 191-204
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 93.

Tytuł:

The crossing numbers of join products of paths with graphs of order four

Autorzy:

Klešč, Marián
Schrötter, Stefan

Powiązania:

https://bibliotekanauki.pl/articles/743896.pdf

Data publikacji:

2011

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

graph
drawing
path
crossing number
join product

Opis:

Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87-97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained as join product of two graphs. In the paper, the exact values of crossing numbers for join of paths with all graphs of order four, as well as for join of all graphs of order four with n isolated vertices are given.

Źródło:

Discussiones Mathematicae Graph Theory; 2011, 31, 2; 321-331
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 94.

Tytuł:

Numerical modelling of innovative manufacturing processes with induced strain path changes

Autorzy:

Muszka, K.
Madej, Ł.
Graca, P.
Majta, J.

Powiązania:

https://bibliotekanauki.pl/articles/100123.pdf

Data publikacji:

2013

Wydawca:

Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych

Tematy:

strain path
accumulative angular drawing
FE modelling

Opis:

A review of various bulk metal forming processes that take into account influence of strain path changes on material flow is presented in this paper. Particular attention is put on computer aided design of innovative angular accumulative drawing (AAD) operation. Research in the area of development of metal forming processes taken advantage of strain path phenomena is conducted in many scientific laboratories as the strain patch change effect influences many crucial properties of the deformed material. As a result it provides a possibility of forming materials, which are e.g. difficult to form in a conventional manner. Advantages and limitations of the AAD process are summarized and presented in this work. Difficulties in development of the complex rheological model that takes in to account strain path changes in the deformed material are also presented and discussed.

Źródło:

Journal of Machine Engineering; 2013, 13, 2; 59-68
1895-7595
2391-8071

Pojawia się w:

Journal of Machine Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 95.

Tytuł:

Staying on the old development path, but 'smartly' - a case study of Warmia and Masuria

Autorzy:

Dziemianowicz, Wojciech

Powiązania:

https://bibliotekanauki.pl/articles/2108244.pdf

Data publikacji:

2017-07-10

Wydawca:

Uniwersytet Warszawski. Wydział Geografii i Studiów Regionalnych

Tematy:

Regional development
innovation
development path
smart specialisation

Opis:

Between 1989 and 2014, the Warmian-Masurian Voivodeship (one of the poorest regions in the European Union) was subjected to a number of external stimuli. However, not only has its position in the ranking of provinces failed to improve - it has actually worsened. Despite this, positive adaptive changes have occurred in the region, although they are limited in scope. The attitude of peripheral regions towards external stimuli can be quite reactive, as seen in the case of Warmia and Masuria. It can be assumed that the province's smart specialisations (water economics, high-quality food, and wood and furniture) will contribute to further quality in the economic structure of the region, but it will not necessarily improve its position in relation to other regions in Poland.

Źródło:

Miscellanea Geographica. Regional Studies on Development; 2017, 21, 2; 73-78
0867-6046
2084-6118

Pojawia się w:

Miscellanea Geographica. Regional Studies on Development

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 96.

Tytuł:

On Path-Pairability in the Cartesian Product of Graphs

Autorzy:

Mészáros, Gábor

Powiązania:

https://bibliotekanauki.pl/articles/31340793.pdf

Data publikacji:

2016-08-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

path-pairable graphs
Cartesian product of graphs

Opis:

We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product. We present path-pairable graph families that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented.

Źródło:

Discussiones Mathematicae Graph Theory; 2016, 36, 3; 743-758
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 97.

Tytuł:

Two graphs with a common edge

Autorzy:

Badura, Lidia

Powiązania:

https://bibliotekanauki.pl/articles/30148254.pdf

Data publikacji:

2014-08-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

graph
adjacency matrix
determinant of graph
path
cycle

Opis:

Let $G = G_1 ∪ G_2$ be the sum of two simple graphs $G_1,G_2$ having a common edge or $G = G_1 ∪ e_1 ∪ e_2 ∪ G_2$ be the sum of two simple disjoint graphs $G_1,G_2$ connected by two edges $e_1$ and $e_2$ which form a cycle $C_4$ inside $G$. We give a method of computing the determinant $det A(G)$ of the adjacency matrix of $G$ by reducing the calculation of the determinant to certain subgraphs of $G_1$ and $G_2$. To show the scope and effectiveness of our method we give some examples.

Źródło:

Discussiones Mathematicae Graph Theory; 2014, 34, 3; 497-507
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 98.

Tytuł:

Advanced open CNC system with in process tool path compensation

Autorzy:

Hascoet, J.-Y.
Rauch, M.

Powiązania:

https://bibliotekanauki.pl/articles/99609.pdf

Data publikacji:

2014

Wydawca:

Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych

Tematy:

open NC controller
simulation,manufacturing
tool path
compensation

Opis:

Despite several technical advances over the last decade, CNC controlled manufacturing still bases upon outdated paradigms: manufacturing data are generated and transferred along a heterogeneous and divided CAD/CAM/CNC data chain. The role of the NC controller is limited to the execution of tool paths generated beforehand and the possibility of online tool path adaptation is not planned in legacy NC controllers. In contrast, practical observations make this legacy approach quite inappropriate in an industrial framework. Significant geometrical variability is sometimes observed both prior and after milling in parts that belong to the same batch. In that context, the integration of online tool path adaptation strategies appears to be essential. In this paper, a methodology for correcting the tool path in real-time thanks to measurements provided by a laser scanner moving with the tool is introduced. The resulting local information is used to approximate the workpiece exact geometry by using a POD (Prosper Orthogonal Decomposition) snapshot technique and to adjust the path in accordance. This method has the great advantage of taking into consideration geometrical features such as curvature, twist but also additional parameters whose impact on the tool path is significant (unexpected initial setup of the part for example). This method has been implemented on the advanced CNC programming platform of the laboratory, which hosts in particular a high speed machining centre equipped with an open NC controller.

Źródło:

Journal of Machine Engineering; 2014, 14, 3; 48-57
1895-7595
2391-8071

Pojawia się w:

Journal of Machine Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 99.

Tytuł:

Sample-path average cost optimality for semi-Markov control processes on Borel spaces: unbounded costs and mean holding times

Autorzy:

Vega-Amaya, Oscar
Luque-Vásquez, Fernando

Powiązania:

https://bibliotekanauki.pl/articles/1208171.pdf

Data publikacji:

2000

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Tematy:

sample-path average costs
semi-Markov control processes

Opis:

We deal with semi-Markov control processes (SMCPs) on Borel spaces with unbounded cost and mean holding time. Under suitable growth conditions on the cost function and the mean holding time, together with stability properties of the embedded Markov chains, we show the equivalence of several average cost criteria as well as the existence of stationary optimal policies with respect to each of these criteria.

Źródło:

Applicationes Mathematicae; 2000, 27, 3; 343-367
1233-7234

Pojawia się w:

Applicationes Mathematicae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 100.

Tytuł:

Гностические мотивы в творчестве Владимира Набокова (на примере повести Соглядатай)

Autorzy:

Kortus, Nadzieja

Powiązania:

https://bibliotekanauki.pl/articles/1023417.pdf

Data publikacji:

2019-09-05

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

Gnostic symbols
Vladimir Nabokov
The Eye
initiation path

Opis:

There are many works that discuss the prose of Vladimir Nabokov in the Gnostic context. The article is an attempt to confront the short novel The Eye of this outstanding writer with the most important determinants of the Gnostic initiation.

Źródło:

Studia Rossica Posnaniensia; 2019, 44, 2; 101-112
0081-6884

Pojawia się w:

Studia Rossica Posnaniensia

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce