Informacja

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

Wyszukujesz frazę "bound" wg kryterium: Temat


Tytuł:
Ergodicity and perturbation bounds for inhomogeneous birth and death processes with additional transitions from and to the origin
Autorzy:
Zeifman, A.
Korotysheva, A.
Satin, Y.
Korolev, V.
Shorgin, S.
Razumchik, R.
Powiązania:
https://bibliotekanauki.pl/articles/331214.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
inhomogeneous birth process
inhomogeneous death process
ergodicity bound
perturbation bound
Opis:
Service life of many real-life systems cannot be considered infinite, and thus the systems will be eventually stopped or will break down. Some of them may be re-launched after possible maintenance under likely new initial conditions. In such systems, which are often modelled by birth and death processes, the assumption of stationarity may be too strong and performance characteristics obtained under this assumption may not make much sense. In such circumstances, time-dependent analysis is more meaningful. In this paper, transient analysis of one class of Markov processes defined on non-negative integers, specifically, inhomogeneous birth and death processes allowing special transitions from and to the origin, is carried out. Whenever the process is at the origin, transition can occur to any state, not necessarily a neighbouring one. Being in any other state, besides ordinary transitions to neighbouring states, a transition to the origin can occur. All possible transition intensities are assumed to be non-random functions of time and may depend (except for transition to the origin) on the process state. To the best of our knowledge, first ergodicity and perturbation bounds for this class of processes are obtained. Extensive numerical results are also provided.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 787-802
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On The Roman Domination Stable Graphs
Autorzy:
Hajian, Majid
Rad, Nader Jafari
Powiązania:
https://bibliotekanauki.pl/articles/31341613.pdf
Data publikacji:
2017-11-27
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman domination number
bound
Opis:
A Roman dominating function (or just 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 $f$ is the value $f(V (G)) = \Sigma_{ u \in V(G) } f(u) $. The Roman domination number of a graph $G$, denoted by $ \gamma_R (G)$, is the minimum weight of a Roman dominating function on $G$. A graph $G$ is Roman domination stable if the Roman domination number of $G$ remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class $ R_{UV R} $, Discrete Math. Algorithms Appl. 8 (2016) 1650049].
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 859-871
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of performance for the DIRECT global optimization algorithm
Analiza działania algorytmu optymalizacji globalnej DIRECT
Autorzy:
Borowik, P.
Chwastek, K.
Powiązania:
https://bibliotekanauki.pl/articles/159401.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
Tematy:
algorithm "branch-and-bound"
optimization
simulations
algorytm "branch-and-bound"
optymalizacja
symulacje
Opis:
The usefulness of the "branch-and-bound" algorithm for solving chosen optimization problems is considered in the paper. Simulations have been carried out for chosen benchmark tasks with different complexity and number of dimensions.
W pracy dokonano oceny użyteczności algorytmu "branch-and-bound" do rozwiązywania wybranych zadań optymalizacji. Przeprowadzono symulacje dla wybranych zadań testowych o różnej złożoności i liczbie wymiarów.
Źródło:
Prace Instytutu Elektrotechniki; 2016, 273; 55-62
0032-6216
Pojawia się w:
Prace Instytutu Elektrotechniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bounding neighbor-connectivity of Abelian Cayley graphs
Autorzy:
Doty, Lynne
Powiązania:
https://bibliotekanauki.pl/articles/743950.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Cayley graphs
neighbor-connectivity bound
Opis:
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is bounded above by κ. Doty has sharpened that bound in abelian Cayley graphs to approximately (1/2)κ. The main result of this paper is the constructive development of an alternative, and often tighter, bound for abelian Cayley graphs through the use of an auxiliary graph determined by the generating set of the abelian Cayley graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 3; 475-491
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Short Proof for a Lower Bound on the Zero Forcing Number
Autorzy:
Fürst, Maximilian
Rautenbach, Dieter
Powiązania:
https://bibliotekanauki.pl/articles/32083733.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
zero forcing
girth
Moore bound
Opis:
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at least 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 355-360
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Little pro’s, but how many of them? – On 3SG null pronominals in Hungarian
Autorzy:
Dalmi, Gréte
Powiązania:
https://bibliotekanauki.pl/articles/1040224.pdf
Data publikacji:
2017-12-30
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II
Tematy:
null pronominal
generic
bound variable
Opis:
While Hungarian 3SG individual reference null pronominals are in free variation with their lexical counterparts, 3SG generic reference null pronominals do not show such variation. This follows from the fact that Hungarian 3SG generic null pronominals behave like bound variables, i.e. they always require a 3SG generic lexical antecedent in an adjacent clause. Both the 3SG generic lexical antecedent and the 3SG generic null pronominal must be in the scope of the GN operator, which is seated in SpeechActParticipantPhrase (SAPP), the leftmost functional projection of the left periphery in the sentence (see Alexiadou & D’Alessandro, 2003; Bianchi, 2006). GN binds all occurrences of the generic variable in accessible worlds (see Moltmann 2006 for English one/oneself). These properties distinguish Hungarian from the four major types of Null Subject Languages identified by Roberts & Holmberg (2010).
Źródło:
Linguistics Beyond and Within; 2017, 3; 61-73
2450-5188
Pojawia się w:
Linguistics Beyond and Within
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nordhaus-Gaddum bounds for upper total domination
Autorzy:
Haynes, Teresa W.
Henning, Michael A.
Powiązania:
https://bibliotekanauki.pl/articles/2216175.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
upper total domination
Nordhaus-Gaddum bound
Opis:
A set S of vertices in an isolate-free graph G is a total dominating set if every vertex in G is adjacent to a vertex in S. A total dominating set of G is minimal if it contains no total dominating set of $\bar{G}$ as a proper subset. The upper total domination number $Γ_t(G)$ of G is the maximum cardinality of a minimal total dominating set in G. We establish Nordhaus-Gaddum bounds involving the upper total domination numbers of a graph G and its complement $\bar{G}$. We prove that if G is a graph of order n such that both G and $\bar{G}$ are isolate-free, then $Γ_t(G) + Γ_t(\bar{G}) ≤ n + 2$ and $Γ_t(G)Γ_t(\bar{G}) ≤ 1/4 (n + 2)^2$, and these bounds are tight.
Źródło:
Opuscula Mathematica; 2022, 42, 4; 573-582
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new upper bound for the chromatic number of a graph
Autorzy:
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/743711.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Vertex colouring
chromatic number
upper bound
Opis:
Let G be a graph of order n with clique number ω(G), chromatic number χ(G) and independence number α(G). We show that χ(G) ≤ [(n+ω+1-α)/2]. Moreover, χ(G) ≤ [(n+ω-α)/2], if either ω + α = n + 1 and G is not a split graph or α + ω = n - 1 and G contains no induced $K_{ω+3}- C₅$.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 1; 137-142
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
When the group-counting function assumes a prescribed integer value at squarefree integers frequently, but not extremely frequently
Autorzy:
Spiro-Silverman, Claudia
Powiązania:
https://bibliotekanauki.pl/articles/1391970.pdf
Data publikacji:
1992
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
group-counting
squarefree order
lower bound
Źródło:
Acta Arithmetica; 1992, 61, 1; 1-12
0065-1036
Pojawia się w:
Acta Arithmetica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Culture-bound elements: Rendering and preserving in translation
Autorzy:
Maksvytytė, Jūratė
Powiązania:
https://bibliotekanauki.pl/articles/1191841.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Wrocławski. Oficyna Wydawnicza ATUT – Wrocławskie Wydawnictwo Oświatowe
Tematy:
culture-bound elements
translation
strategies
rendering
preserving
Opis:
Each culture is unique and has its own unique objects or phenomena related to its history, traditions, and cultural identity. These specific objects, otherwise called culture-bound elements, may be strange and unrecognizable to another culture. Translators are often challenged to translate the text of one culture to another and to convey the names of cultural elements, while still preserving their unique meaning, as well as their national and cultural colour. The aim of the article is to analyse the strategies and techniques by means of which the names of Lithuanian culture-bound elements are translated into English in a work devoted to public affairs. To what extent the original is preserved in the foreign-language environment clarifies the (dis)harmony. In short, the name of a culture-bound element is an integral part of such work that otherwise would not accomplish its purpose.
Źródło:
Studia Translatorica; 2019, 10; 253-264
2084-3321
2657-4802
Pojawia się w:
Studia Translatorica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the multiplicative Zagreb coindex of graphs
Autorzy:
Xu, K.
Das, K. Ch.
Tang, K.
Powiązania:
https://bibliotekanauki.pl/articles/254706.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
vertex degree
tree
upper or lower bound
Opis:
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first and second Zagreb indices of G are defined as [formula] and [formula] respectively, where dG(v) is the degree of vertex v in G. The alternative expression of M1 (G) is [formula]. Recently Ashrafi, Doslic and Hamzeh introduced two related graphical invariants [formula] and [formula] named as first Zagreb coindex and second Zagreb coindex, respectively. Here we define two new graphical invariants [formula] and [formula] as the respective multiplicative versions of [formula]. In this paper, we have reported some properties, especially upper and lower bounds, for these two graph invariants of connected (molecular) graphs. Moreover, some corresponding extremal graphs have been characterized with respect to these two indices.
Źródło:
Opuscula Mathematica; 2013, 33, 1; 191-204
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spectra of Orders for k-Regular Graphs of Girth g
Autorzy:
Jajcay, Robert
Raiman, Tom
Powiązania:
https://bibliotekanauki.pl/articles/32222719.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cage
k -regular graph
girth
Sauer bound
Opis:
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n exists; we choose to call the set of all such orders the spectrum of orders of (k, g)-graphs. The smallest of these orders (the first element in the spectrum) is the order of a (k, g)-cage; the (k, g)-graph of the smallest possible order. The exact value of this order is unknown for the majority of parameters (k, g). We determine the spectra of orders for (2, g), g ≥ 3, (k, 3), k ≥ 2, and (3, 5)-graphs, as well as the spectra of orders of some families of (k, 4)-graphs. In addition, we present methods for obtaining (k, g)-graphs that are larger then the smallest known (k, g)-graphs, but are smaller than (k, g)-graphs obtained by Sauer. Our constructions start from (k, g)-graphs that satisfy specific conditions derived in this paper and result in graphs of orders larger than the original graphs by one or two vertices. We present theorems describing ways to obtain ‘starter graphs’ whose orders fall in the gap between the well-known Moore bound and the constructive bound derived by Sauer and are the first members of an infinite sequence of graphs whose orders cover all admissible orders larger than those of the ‘starter graphs’.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1115-1125
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Input Variable Partitioning Method for Decomposition-Based Logic Synthesis targeted Heterogeneous FPGAs
Autorzy:
Rawski, M.
Powiązania:
https://bibliotekanauki.pl/articles/227236.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
functional decomposition
heterogeneous FPGA
bound set selection
Opis:
The functional decomposition has found an application in many fields of modern engineering and science, such as combinational and sequential logic synthesis for VLSI systems, pattern analysis, knowledge discovery, machine learning, decision systems, data bases, data mining etc. It is perceived as one of the best logic synthesis methods for FPGAs. However, its practical usefulness for very complex systems depends on efficiency of method used in decomposition calculation. One of the most important steps in functional decomposition construction is selection of the appropriate input variable partitioning. In case of modern heterogeneous programmable structures efficiency of methods used to solve this problem becomes especially important. Since the input variable partitioning problem is an NP-hard, heuristic methods have to be used to efficiently and effectively search for optimal or near-optimal solutions. The paper presents a method for bound set selection in functional decomposition targeted FPGAs with heterogeneous structure. This heuristic algorithm delivers optimal or near optimal results and is much faster than other methods.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 1; 15-20
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bean cotyledons microporosity under hydration conditions
Autorzy:
Golonka, P.
Dryzek, J.
Kluza, M.
Powiązania:
https://bibliotekanauki.pl/articles/147053.pdf
Data publikacji:
2002
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
bound water
free volume
PAS
proton NMR
Opis:
Positron Annihilation Spectroscopy (PAS), proton Nuclear Magnetic Relaxation (NMR) and hydration kinetics measurements were applied to study the free volume formation process in the initial stages of bean cotyledons imbibition. These methods allowed us to analyse the behaviour of bound water in the bean cotyledon molecular structure, and to observe free volume regions formed there. They also made it possible to describe their dimensions and concentration quantitatively. Good correlation was found between the increase of the free volume radius and the amount of water bound to the bean cotyledon solid matrix.
Źródło:
Nukleonika; 2002, 47, 4; 137-140
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł

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