Filtry
wszystkich: 1650
wybranych: 1194
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: THEORY
-
COLREGS compliance in Evolutionary Sets of Cooperating Ship Trajectories
PublikacjaIn general, Evolutionary Sets of Cooperating Ship Trajectories combine some of the assumptions of game theory with evolutionary programming and aim to find optimal set of cooperating trajectoriesof all ships involved in an encounter situation. In a two-ship encounter situation the method enables the operator of an on-board collision-avoidance system to predict the most probable behaviour of atarget and to plan the own manoeuvres...
-
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
PublikacjaWe consider two versions of the rendezvous problem: exact RV, when the points representing agents have to coincide at some time, and e-RV, when these points have to get at distance less than e in the terrain. In any terrain, each agent chooses its trajectory, but the movements of the agent on this trajectory are controlled by an adversary that may, e.g. speed up or slow down the agent.
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
The impact of filler thermomechanical modifications on static and dynamic mechanical performance of flexible foamed polyurethane/ground tire rubber/zinc borate composites
PublikacjaThe rapid development of the automotive industry is very beneficial to many aspects of human life, but it is also a very significant environmental burden. The most straightforward impact is related to the generation of exhaust, but the management of post-consumer car parts is also a major challenge. Among them, waste tires are very burdensome due to their enormous numbers. Therefore, it is essential to develop novel, environmentally...
-
WYBRANE WŁAŚCIWOŚCI FIZYCZNO-CHEMICZNE MIKROSFER I MOŻLIWOŚĆ ICH WYKORZYSTANIA W KOMPOZYTACH CEMENTOWYCH : The selected physico-chemical properties of microspheres and possibility of their use in cement composites
PublikacjaMicrospheres are formed during the mineral transformation stage in coal combustion. Their content in fly ashes from the combustion of different types of coals varies over a rather wide range from 0.01 to 4.8 wt.%. The microspheres have three main elements, silicon, aluminum and iron, the oxides of which account for about 89.0 wt.% of the material. Mineralogical analysis using XRD shows that microspheres mainly contain mullite and...
-
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Prevention of resonance oscillations in gear mechanisms using non-circular gears
PublikacjaOne of the main disadvantages of gear mechanisms is the occurrence of noise and vibrations. This study investigated the applicability of non-circular gears for preventing resonance oscillations in gear mechanisms. The influence of a small deviation of the gear centrodes from the nominal circles on kinematic and oscillatory characteristics was analysed. It was shown that a larger deviation results in a smaller resonance amplitude...
-
On topology optimization of large deformation contact-aided shape morphing compliant mechanisms
PublikacjaA topology optimization approach for designing large deformation contact-aided shape morphing compliant mechanisms is presented. Such mechanisms can be used in varying operating conditions. Design domains are described by regular hexagonal elements. Negative circular masks are employed to perform dual task, i.e., to decide material states of each element and also, to generate rigid contact surfaces. Each mask is characterized by...
-
MODEL OF MULTILEVEL STOCHASTIC ANALYSIS OF ROAD SAFETY ON REGIONAL LEVEL
PublikacjaIn this paper multilevel approach to the issue of road safety level on the road network of European regions, classified as NUTS 2 in statistical databases of the European Union, has been presented. Following the pattern of many publications on road safety it has been assumed that the risk calculated as the number of death casualties in road accidents per 100,000 inhabitants of a given region has Poisson distribution. Therefore,...
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublikacjaWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
Preface of guest editors
PublikacjaA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
Average Redundancy of the Shannon Code for Markov Sources
PublikacjaIt is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...
-
Restrained differential of a graph
PublikacjaGiven a graph $G=(V(G), E(G))$ and a vertex $v\in V(G)$, the {open neighbourhood} of $v$ is defined to be $N(v)=\{u\in V(G) :\, uv\in E(G)\}$. The {external neighbourhood} of a set $S\subseteq V(G)$ is defined as $S_e=\left(\cup_{v\in S}N(v)\right)\setminus S$, while the \emph{restrained external neighbourhood} of $S$ is defined as $S_r=\{v\in S_e : N(v)\cap S_e\neq \varnothing\}$. The restrained differential of a graph $G$ is...
-
Preface
PublikacjaThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
PublikacjaWe study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
-
Anharmonic Infrared Spectroscopy through the Fourier Transform of Time Correlation Function Formalism in ONETEP
PublikacjaDensity functional theory molecular dynamics (DFT-MD) provides an efficient framework for accurately computing several types of spectra. The major benefit of DFTMD approaches lies in the ability to naturally take into account the effects of temperature and anharmonicity, without having to introduce any ad hoc or a posteriori corrections. Consequently, computational spectroscopy based on DFT-MD approaches plays a pivotal role in...
-
General paradigm for distilling classical key from quantum states
PublikacjaIn this paper, we develop a formalism for distilling aclassical key from a quantum state in a systematic way, expandingon our previous work on a secure key from bound entanglement(Horodecki et al., 2005). More detailed proofs, discussion, andexamples are provided of the main results. Namely, we demonstratethat all quantum cryptographic protocols can be recast in away which looks like entanglement theory, with the only changebeing...
-
Types of Markov Fields and Tilings
PublikacjaThe method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to one-dimensional Markov processes, and it has not been thoroughly studied for general Markov fields. Markov fields over a finite alphabet of size m ≥ 2 can be viewed as models for multi-dimensional systems with local interactions. The locality of these interactions is represented...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publikacja -
T-colorings, divisibility and circular chromatic number
PublikacjaLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Iterative‐recursive estimation of parameters of regression models with resistance to outliers on practical examples
PublikacjaHere, identification of processes and systems in the sense of the least sum of absolute values is taken into consideration. The respective absolute value estimators are recognised as exceptionally insensitive to large measurement faults or other defects in the processed data, whereas the classical least squares procedure appears to be completely impractical for processing the data contaminated with such parasitic distortions. Since...
-
Invariant Measures for Uncountable Random Interval Homeomorphisms
PublikacjaA necessary and sufficient condition for the iterated function system { f (·, ω) | ω ∈ } with probability P to have exactly one invariant measure μ∗ with μ∗((0, 1)) = 1 is given. The main novelty lies in the fact that we only require the transformations f (·, ω) to be increasing homeomorphims, without any smoothness condition, nei- ther we impose conditions on the cardinality of . In particular, positive Lyapunov exponents conditions...
-
Domination numbers in graphs with removed edge or set of edges
PublikacjaW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
Periodic Solutions of Generalized Lagrangian Systems with Small Perturbations
PublikacjaIn this paper we study the generalized Lagrangian system with a small perturbation. We assume the main term in the system to have a maximum, but do not suppose any condition for perturbation term. Then we prove the existence of a periodic solution via Ekeland’s principle. Moreover, we prove a convergence theorem for periodic solutions of perturbed systems.
-
Combining the MARTINI and Structure-Based Coarse-Grained Approaches for the Molecular Dynamics Studies of Conformational Transitions in Proteins
Publikacja -
A few steps more towards NPT bound entanglement
PublikacjaIn this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of...
-
Positive solutions of one-dimensional p-Laplacian boundary value problems for fourth-order differential equations with deviating arguments
PublikacjaPraca dotyczy istnienia dodatnich rozwiązań dla równań różniczkowych rzędu czwartego z warunkami brzegowymi z odchylonymi argumentami. Stosując twierdzenie o punkcie stałym dla stożków podano warunki dostateczne na istnienia takich rozwiązań.
-
Graphs with equal domination and 2-distance domination numbers
PublikacjaW publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.
-
Non-quadratic quality criteria in parameter estimation of continuous-time models
PublikacjaW pracy wykorzystuje się procedury estymacji parametrycznej do identyfikacji modeli z czasem ciągłym. Rozważane algorytmy minimalizują wskaźnik jakości w postaci sumy lub całki wartości bezwzględnej błędu predykcji. Zastosowanie techniki zmiennych instrumentalnych umożliwia ponadto znaczące polepszenie dokładności ocen parametrów, a wprowadzony do w procedur estymacji mechanizm ważenia błędów predykcji pozwala identyfikować modele...
-
Multiple solutions of boundary-value problems for fourth-order differential equations with deviating arguments
PublikacjaPraca dotyczy równań różniczkowych rzędu czwartego z warunkami brzegowymi i odchylonymi argumentami. Podano wystarczające warunki, dla których problemy dotyczące takich równań mają dodatnie rozwiązania. W pracy rozważa się przypadki kiedy argumenty odchylone są typu opóźnionego lub wyprzedzonego. W celu zapewnienia istnienia przynajmniej trzech dodatnich rozwiązań wykorzystano twierdzenie Avery-Petersona.
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
The complexity of node blocking for dags
PublikacjaRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
Total outer-connected domination in trees
PublikacjaW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublikacjaArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof
PublikacjaNew measures of multipartite entanglement are constructedbased on two definitions of multipartite information anddifferent methods of optimizing over extensions of the states. Oneis a generalization of the squashed entanglement where one takesthe mutual information of parties conditioned on the state's extensionand takes the infimum over such extensions. Additivity ofthe multipartite squashed entanglement is proved for both versionsof...
-
Four-point boundary-value problems for differential-algebraic systems
PublikacjaBadane są czteropunktowe problemy brzegowe dla układów równań różniczkowo-algebraicznych. Stosując metodę iteracji monotonicznych, podano warunki dostateczne na istnienie rozwiązań (jednego lub ekstremalnych) takich problemów. Podano przykład ilustrujacy otrzymane wyniki teoretyczne.
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublikacjaW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Trees with equal restrained domination and total restrained domination numbers
PublikacjaW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Boundary value problems for ordinary differential equations with deviated arguments
PublikacjaDyskutowane są równania różniczkowe z dwupunktowym nieliniowym warunkiem brzegowym z argumentami typu odchylonego. Podano warunki dostateczne które gwarantują iż problem wyjściowy ma kwazi-rozwiązania. Podano też warunki przy których problem ten ma rozwiązanie. Wyniki uzyskano stosując metodę iteracji monotonicznych.Badano też pewne nierówności różniczkowe z odchylonymi argumentami.
-
Some remarks on the Euler ring U(G)
PublikacjaNiech G będzie zwartą grupą Liego i niech U(G) oznacza pierściń Eulera G skonstruoawany przez tom Diecka w [5,6]. Główny wynikpracy (Twierdzenie 4.1) opisuje homomorfizm pierścienia U(SO(3)) w pierścień U(SO(2))indukowany przez włożenie grupy SO(2) w grupę SO(3).
-
Physics-Based Potentials for the Coupling between Backbone- and Side-Chain-Local Conformational States in the United Residue (UNRES) Force Field for Protein Simulations
Publikacja -
Dynamic Formation and Breaking of Disulfide Bonds in Molecular Dynamics Simulations with the UNRES Force Field
Publikacja -
Application of Multiplexed Replica Exchange Molecular Dynamics to the UNRES Force Field: Tests with α and α+β Proteins
Publikacja -
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.