Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "RAD." wg kryterium: Autor

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 49
Tytuł:
On the Complexity of Reinforcement in Graphs
Autorzy:
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/31340751.pdf
Data publikacji:
2016-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
total domination
total restrained domination
p- domination
k-rainbow domination
reinforcement
NP-hard
Opis:
We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 877-887
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Investigating durability time interval of three-dimensional steel frame with angle connections under elevated temprature
Autorzy:
Rad, H.
Yahyayi, M.
Powiązania:
https://bibliotekanauki.pl/articles/957965.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
steel structures
fire loading
temperature
connection
Opis:
During recent years, much attention has been paid to the analysis of fire effect on steel structures because of fire importance and its effect on the stability of steel structures. Considering steel sensitivity to heat and high costs of steel frames retrofitting with the help of thermal covers, accurate behavior analysis of metal frames in elevated tem-peratures is required in order to reduce undesirable effects of temperature increase. To do so and taking into account the high costs of lab tests and their limitations in investigation of numerous parameters during any test, finite element method is used as a powerful and valuable tool in modeling of steel frames under thermal conditions. In this study, the fire effect on steel beams is studied considering the softening of connec-tion and decrease of materials strength. Then, structure durability in fire will be ana-lyzed in the ANSYS software. The analyzed frame is a single span three dimensional one and different conditions including connection type, longitudinal expansion effect, thermal loading and the kind of fire will be analyzed and compared. The obtained computer results will be compared with other researches results.
Źródło:
Advances in Science and Technology. Research Journal; 2016, 10, 29; 28-40
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Rapid design and development of control applications for electrical engineering
Szybkie tworzenie aplikacji kontrolno-pomiarowych na potrzeby elektrotechniki
Autorzy:
Wojnicki, I.
Rad, M.
Powiązania:
https://bibliotekanauki.pl/articles/282188.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
programming
control systems
software design
electric machines
programowanie
systemy sterowania
projektowanie oprogramowania
maszyny elektryczne
Opis:
This paper presents a control application programming concept based on attributive logic and context-based reasoning. General features and benefits, comparied with other contemporary approaches, are given. The proposed solution is targeted at electric machine tests and diagnostics. An illustrative example of programming an induction motor no-load test which compares the proposed solution with a Matlab-based application is also given.
Artykuł prezentuje koncepcję programowania aplikacji kontrolno-pomiarowych opartą na logice atrybutowej i wnioskowaniu kontekstowym. Przedstawione są ogólne zasady proponowanego podejścia i osiągane korzyści w stosunku do używanych obecnie metod. Przykładem, na którym omówiono sposób tego rodzaju programowania są aplikacje kontrolno-pomiarowe tworzone z myślą o próbach i diagnostyce maszyn elektrycznych. Zamieszczono przykład zaimplementowanej procedury pomiarowej: próby biegu jałowego maszyny indukcyjnej.
Źródło:
Automatyka / Automatics; 2013, 17, 2; 263-270
1429-3447
2353-0952
Pojawia się w:
Automatyka / Automatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Roman bondage in graphs
Autorzy:
Rad, Nader
Volkmann, Lutz
Powiązania:
https://bibliotekanauki.pl/articles/743601.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
Roman domination
Roman bondage number
Opis:
A Roman dominating function on a graph G is a function f:V(G) → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value $f(V(G)) = ∑_{u ∈ V(G)}f(u)$. The Roman domination number, $γ_R(G)$, of G is the minimum weight of a Roman dominating function on G. In this paper, we define the Roman bondage $b_R(G)$ of a graph G with maximum degree at least two to be the minimum cardinality of all sets E' ⊆ E(G) for which $γ_R(G -E') > γ_R(G)$. We determine the Roman bondage number in several classes of graphs and give some sharp bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 4; 763-773
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Optical Hydrophone for the Single-Shot Field Measurements of High Power Pressure Pulse Fields
Autorzy:
Jamshidi-Rad, A.
Ueberle, F.
Powiązania:
https://bibliotekanauki.pl/articles/1383349.pdf
Data publikacji:
2015-01
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
06.20.-f
42.25.Fx
43.35.Sx
43.35.Yb
Opis:
The measurements of ultrasonic fields are often performed using polyvinylidene fluoride (PVDF) membrane hydrophones. Recently, optical hydrophones have gained popularity. Refractive type optical hydrophones are based on the change of refractive index at a glass-water interface when the shockwave passes the sensitive area. A major disadvantage of the optical and the PVDF hydrophones is the fact that they provide a single spot sensitive area, with the result that field measurements need a repositioning of the probe. In this work we introduce a multi-spot optical hydrophone with six measurement spots, for the single shot field measurement of shockwave fields. We measure a highly stable shockwave source with a calibrated hydrophone and the multi-spot optical hydrophone and we find good agreement for the calculated energy values of the shockwave field (depending on the energy settings 4% ± 1%).
Źródło:
Acta Physica Polonica A; 2015, 127, 1; 69-71
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fair Domination Number in Cactus Graphs
Autorzy:
Hajian, Majid
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/31343422.pdf
Data publikacji:
2019-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
fair domination
cactus graph
unicyclic graph
Opis:
For k ≥ 1, a k-fair dominating set (or just kFD-set) in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V \ S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating set, abbreviated FD-set, is a kFD-set for some integer k ≥ 1. The fair domination number, denoted by fd(G), of G that is not the empty graph, is the minimum cardinality of an FD-set in G. In this paper, aiming to provide a particular answer to a problem posed in [Y. Caro, A. Hansberg and M.A. Henning, Fair domination in graphs, Discrete Math. 312 (2012) 2905–2914], we present a new upper bound for the fair domination number of a cactus graph, and characterize all cactus graphs G achieving equality in the upper bound of fd1(G).
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 489-503
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Progress on the Double Roman Domination in Graphs
Autorzy:
Rad, Nader Jafari
Rahbani, Hadi
Powiązania:
https://bibliotekanauki.pl/articles/31343730.pdf
Data publikacji:
2019-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination
double Roman domination
Opis:
For a graph $ G = (V,E) $, a double Roman dominating function (or just DRDF) is a function $ f : V \rightarrow {0, 1, 2, 3} $ having the property that if $ f(v) = 0 $ for a vertex $ v $, then $ v $ has at least two neighbors assigned 2 under $ f $ or one neighbor assigned 3 under $ f $, and if $ f(v) = 1 $, then vertex $ v $ must have at least one neighbor $ w $ with $ f(w) \ge 2 $. The weight of a DRDF $f$ is the sum $f(V) = \Sigma_{ v \in V } f(v) $, and the minimum weight of a DRDF on $G$ is the double Roman domination number of $G$, denoted by $ \gamma_{dR} (G) $. In this paper, we derive sharp upper and lower bounds on $ \gamma_{dR} (G) + \gamma_{dR} ( \overline{G} ) $ and also $ \gamma_{dR} (G ) \gamma_{dR} ( \overline{G} ) $, where $ \overline{G} $ is the complement of graph $G$. We also show that the decision problem for the double Roman domination number is NP- complete even when restricted to bipartite graphs and chordal graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 41-53
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fair Total Domination Number in Cactus Graphs
Autorzy:
Hajian, Majid
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/32083904.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
fair total domination
cactus graph
Opis:
For k ≥ 1, a k-fair total dominating set (or just kFTD-set) in a graph G is a total dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V\S. The k-fair total domination number of G, denoted by ftdk(G), is the minimum cardinality of a kFTD-set. A fair total dominating set, abbreviated FTD-set, is a kFTD-set for some integer k ≥ 1. The fair total domination number of a nonempty graph G, denoted by ftd(G), of G is the minimum cardinality of an FTD-set in G. In this paper, we present upper bounds for the 1-fair total domination number of cactus graphs, and characterize cactus graphs achieving equality for the upper bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 647-664
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounds on the Double Italian Domination Number of a Graph
Autorzy:
Azvin, Farzaneh
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/32222552.pdf
Data publikacji:
2022-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Italian domination
double Italian domination
probabilistic methods
Opis:
For a graph G, a Roman {3}-dominating function is a function f : V → {0, 1, 2, 3} having the property that for every vertex u ∈ V, if f(u) ∈ {0, 1}, then f(N[u]) ≥ 3. The weight of a Roman {3}-dominating function is the sum w(f) = f(V) = Σv∈V f(v), and the minimum weight of a Roman {3}-dominating function is the Roman {3}-domination number, denoted by γ{R3}(G). In this paper, we present a sharp lower bound for the double Italian domination number of a graph, and improve previous bounds given in [D.A. Mojdeh and L. Volkmann, Roman {3}-domination (double Italian domination), Discrete Appl. Math. 283 (2022) 555–564]. We also present a probabilistic upper bound for a generalized version of double Italian domination number of a graph, and show that the given bound is asymptotically best possible.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1129-1137
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number
Autorzy:
Poureidi, Abolfazl
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/32312036.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independent 2-rainbow dominating function
independent Roman {2}-dominating function
algorithm
3-SAT
Opis:
A 2-rainbow dominating function (2RDF) of a graph $G$ is a function $g$ from the vertex set $V (G)$ to the family of all subsets of $ \{1, 2\}$ such that for each vertex $v$ with $g(v) =\emptyset $ we have \( \bigcup_{u∈N(v)} g(u) = \{ 1, 2 \} \). The minimum of $ g(V (G)) = \Sigma_{v \in V (G)} |g(v)| $ over all such functions is called the 2-rainbow domination number. A 2RDF $g$ of a graph $G$ is independent if no two vertices assigned non empty sets are adjacent. The independent 2-rainbow domination number is the minimum weight of an independent 2RDF of $G$. A Roman {2}-dominating function (R2DF) $ f : V \rightarrow \{ 0, 1, 2 \} $ of a graph $G = (V, E)$ has the property that for every vertex $ v \in V$ with $f(v) = 0$ either there is $ u \in N(v)$ with $f(u) = 2$ or there are $x, y \in N(v)$ with $f(x) = f(y) = 1$. The weight of $f$ is the sum $f(V) = \Sigma_{v \in V} f(v) $. An R2DF $f$ is called independent if no two vertices assigned non-zero values are adjacent. The independent Roman {2}-domination number is the minimum weight of an independent R2DF on $G$. We first show that the decision problem for computing the independent 2-rainbow (respectively, independent Roman {2}-domination) number is NP-complete even when restricted to planar graphs. Then, we give a linear algorithm that computes the independent 2-rainbow domination number as well as the independent Roman {2}-domination number of a given tree, answering problems posed in [M. Chellali and N. Jafari Rad, Independent 2-rainbow domination in graphs, J. Combin. Math. Combin. Comput. 94 (2015) 133–148] and [A. Rahmouni and M. Chellali, Independent Roman {2}-domination in graphs, Discrete Appl. Math. 236 (2018) 408–414]. Then, we give a linear algorithm that computes the independent 2-rainbow domination number of a given unicyclic graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 709-726
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
Autorzy:
Chellali, Mustapha
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/30146596.pdf
Data publikacji:
2013-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination
independent Roman domination
strong equality
trees
Opis:
A Roman dominating function (RDF) on a graph $G = (V,E)$ is a function $ f : V \rightarrow {0, 1, 2} $ satisfying the condition that every vertex $ u $ for which $ f(u) = 0 $ is adjacent to at least one vertex $v$ for which $f(v) = 2$. The weight of an RDF is the value $ f(V (G)) = \Sigma_{u \in V (G) } f(u) $. An RDF $f$ in a graph $G$ is independent if no two vertices assigned positive values are adjacent. The Roman domination number $ \gamma_R (G) $ (respectively, the independent Roman domination number $ i_R(G) $) is the minimum weight of an RDF (respectively, independent RDF) on $G$. We say that $ \gamma_R(G)$ strongly equals $ i_R(G)$, denoted by $ \gamma_R (G) \equiv i_R(G)$, if every RDF on $G$ of minimum weight is independent. In this paper we provide a constructive characterization of trees $T$ with $ \gamma_R(T) \equiv i_R(T) $.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 2; 337-346
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounds on the Locating Roman Domination Number in Trees
Autorzy:
Jafari Rad, Nader
Rahbani, Hadi
Powiązania:
https://bibliotekanauki.pl/articles/16647912.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination number
locating domination number
locating Roman domination number
tree
Opis:
A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = ∑u∈V(G) f(u). An RDF f can be represented as f = (V0, V1, V2), where Vi = {v ∈ V : f(v) = i} for i = 0, 1, 2. An RDF f = (V0, V1, V2) is called a locating Roman dominating function (or just LRDF) if N(u) ∩ V2 ≠ N(v) ∩ V2 for any pair u, v of distinct vertices of V0. The locating Roman domination number $\gamma _R^L (G)$ is the minimum weight of an LRDF of G. In this paper, we study the locating Roman domination number in trees. We obtain lower and upper bounds for the locating Roman domination number of a tree in terms of its order and the number of leaves and support vertices, and characterize trees achieving equality for the bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 49-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on the independent Roman domination in unicyclic graphs
Autorzy:
Chellali, M.
Rad, N. J.
Powiązania:
https://bibliotekanauki.pl/articles/255989.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Roman domination
independent Roman domination
strong equality
Opis:
A Roman dominating function (RDF) on a graph G= (V, E) is a function ƒ : V → {0, 1, 2} satisfying the condition that every vertex u for which ƒ(u) = 0 is adjacent to at least one vertex v for which ƒ(v)=2. The weight of an RDF is the value [formula]. An RDF ƒ in a graph G is independent if no two vertices assigned positive values are adjacent. The Roman domination number ΥR (G) (respectively, the independent Roman domination number ΥR(G) is the minimum weight of an RDF (respectively, independent RDF) on G. We say that ΥR(G) strongly equals iR(G), denoted by ΥR(G) ≡ iR(G), if every RDF on G of minimum weight is independent. In this note we characterize all unicyclic graphs G with ΥR(G) ≡ iR(G).
Źródło:
Opuscula Mathematica; 2012, 32, 4; 715-718
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unfocused/Weakly Focused Pressure Pulse Sources for Pain Therapy: Measurements in Water and in a Dry Test Bench
Autorzy:
Ueberle, F.
Jamshidi-Rad, A.
Powiązania:
https://bibliotekanauki.pl/articles/1383801.pdf
Data publikacji:
2015-01
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
43.80.Gx
43.20.Px
87.50.yt
87.50.yk
Opis:
Unfocused/weakly focused pressure pulses (UPP) are generated by an "air-gun" like mechanism, with a projectile accelerated by pressurized air and impinging on a metal applicator. They were introduced in 1998 for the treatment of orthopedic soft tissue pain. The patient side of the applicator (a circular piston of 6-30 mm diameter) releases single pressure pulses of 2-10 MPa and 4-5 μs duration. Up today, there is no standard for the measurement of UPP sources (UPPS), so data are often reported on the basis of the focused lithotripter standard IEC61846. The purpose of this research is to establish methods to reliably measure UPPS acoustic parameters and establish a parameter set based on definitions from focused lithotripsy sources as applicable. Therefore, acoustic characteristics and wave fields of the pressure pulses of UPPS from different manufacturers were measured in a water bath and in a dry test bench. It was demonstrated by comparison with optical hydrophones that piezoelectric hydrophones are appropriate for the measurements of UPP. For on-axis measurements at a fixed distance, measurements in the dry test bench can replace water-bath measurements. Additionally, the dry test bench allows for reliable results at pulse rates >1 Hz.
Źródło:
Acta Physica Polonica A; 2015, 127, 1; 135-137
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 49

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies