Wyszukiwarka
Filtry
wszystkich: 1253
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SHANNON CAPACITY OF GRAPHS
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Bearing capacity of working platform using distinct layout optimization method
PublikacjaBearing capacity of the working platforms from sandy soil resting on NC and OC clays was analyzed using LimitState GEO program. Different failure modes are considered using distinct layout optimization (DLO) method, which forms the upper bound solution of limit state analysis. Different mechanisms of failure were observed as a function of the platform thickness, angle of internal friction of the platform material and undrained...
-
Estimation of Screw Displacement Pile-Bearing Capacity Based on Drilling Resistances
PublikacjaThis article presents an engineering, empiricalmethod of estimating the bearing capacity and settlementcharacteristics Q-s of screw displacement piles andcolumns, based on soil resistance encountered during thedrilling to form piles/columns in the ground. The methodwas developed on the basis of correlation analyses of thetest results of 24 piles made during the “DPDT-Auger”research project (Krasiński et al., 2022a). In the proposedmethod,...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
On the deficiency of bipartite graphs
Publikacja -
Named Property Graphs
Publikacja -
Serialization for Property Graphs
Publikacja -
Rank Coloring of Graphs.
PublikacjaRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublikacjaRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
Harmonions Coloring of Graphs.
PublikacjaProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublikacjaNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Classical coloring of graphs.
PublikacjaRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Capacity Estimation of the OFDMA and SC-FDMA Radio Interface for UMTS-LTE
PublikacjaIn the paper a method of capacity estimation for the UMTS-LTE interface is presented. Both the OFDMA and SC-FDMA technology has been considered. A method of physical resource allocation for users is mentioned and analytical results of theoretical throuhput calculation are described.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
CFD-based evaluation of current-carrying capacity of power cables installed in free air
PublikacjaEvaluation of current-carrying capacity of power cables and selection of cross-sectional area of their conductors are mainly performed in accordance with requirements of EN, IEC or IEEE standards. However, these standards do not provide all methods of cables installation and location which occur in practice. Thus, in some cases, performance of advanced modeling of various thermal phenomena, affecting power cables current-carrying...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Analysis of sloping brace stiffness influence on stability and load bearing capacity of a truss
PublikacjaThe paper is focused on the numerical study of stability and load bearing capacity of a truss with side elastic braces. The structure is made in reality. The rotational and sliding brace stiffnesses were taken into account. Linear buckling analysis and non-linear static analysis with geometric and material nonlinearity were performed for the beam and shell model of the truss with respect to the angle of sloping braces. As a result...
-
Effect of soil moisture on current-carrying capacity of low-voltage power cables
PublikacjaOne of the factors affecting current-carrying capacity of underground power cables is the thermal resistivity of soil. Its value in the close proximity of the cable is the most important, and for this reason, in some cases, the local soil is replaced with an another soil type or with a cement-sand mixture. The thermal resistivity of the soil is strongly affected by moisture, and in the case of a cement-sand mixture – as tested...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Impact of thermal backfill parameters on current-carrying capacity of power cables installed in the ground
PublikacjaProper design of power installations with the participation of power cables buried in homogeneous and thermally well-conductive ground does not constitute a major problem. The situation changes when the ground is non-homogeneous and thermally low-conductive. In such a situation, a thermal backfill near the cables is commonly used. The optimization of thermal backfill parameters to achieve the highest possible current-carrying capacity...
-
Simulation Results of Dynamic Capacity Reallocation in Hierarchical Cell Structure of UMTS Network
PublikacjaIn the paper simulation results of dynamic capacity reallocation between different layers of hierarchical cell structure of UMTS network has been described. This approach for load management seems to be useful for improving the resource utilization perfmorance.
-
Parametrical Method for Determining Optimal Ship Carrying Capacity and Performance of Handling Equipment
PublikacjaThe paper presents a method of evaluating the optimal value of the cargo ships deadweight and the coupled optimal value of cargo handling capacity. The method may be useful at the stage of establishing the main owners requirements concerning the ship design parameters as well as for choosing a proper second hand ship for a given transportation task. The deadweight and the capacity are determined on the basis of a selected economic...
-
Capacity Transforming challenges into opportunities
PublikacjaThe Urban Initiative Laboratory (UIL) aims to upgrade the smart city concept in Gdańsk by introducing the Food-Water-Energy (FWE) nexus to the city. It was agreed in the CRUNCH international consortium that projects on different scales would be implemented in the individual countries to test the Integrated Decision Supportive system platform, which would, in principle, concern urban scale. The regular urban scale was to be researched...
-
Bearing capacity for random subsoil.
PublikacjaW pracy zaproponowano modyfikację metody charakterystyk bazującej na stochastycznej metodzie różnic skończonych. Podejście takie pozwoliło na uwzględnienie przestrzennej zmienności podłoża gruntowego przy ocenie nośności granicznej ławy fundamentowej posadowionej na losowym podłożu. Przeprowadzono analizę wpływu dyskretyzacji ośrodka gruntowego na rozwiązanie oraz rozpatrzono jego zbieżności.
-
Evaluation of the Impact of Different Types of Uncoupling on the Processing Capacity of Hump Yards
PublikacjaThe paper considers the issue of evaluating the impact of different types of uncoupling to increase the processing capacity of hump yards to ensure high technical-economic indicators in the conditions of limited capital funds. Moreover it describes the mathematical formulation of the sorting slide. For the mathematical formulation, the sorting slide is taken as a surface that is uniquely projected onto a horizontal plane. Based...
-
Predicting the seismic collapse capacity of adjacent structures prone to pounding
PublikacjaIn crowded cities, many structures are often constructed in a very close vicinity; therefore, during severe earthquakes, pounding phenomenon occurs due to out-of-phase vibrations of adjacent structures. In this study, pounding of adjacent structures is investigated up to the occurrence of total collapse. The novelty of this study is performing incremental dynamic analyses to compute the seismic collapse capacities of both pounding...
-
ANALYSIS OF THE LOAD-CARRYING CAPACITY OF A HYDRODYNAMIC WATER-LUBRICATED BEARING IN A HYDROELECTRIC POwER PLANT
PublikacjaThe paper presents an analysis of the load-carrying capacity of a historic hydrodynamic water-lubricated radial bearing of an unconventional segment design installed in the Braniewo Hydroelectric Power Plant. The aim of the calculations was to determine whether the bearing operates in the conditions of hydrodynamic or mixed lubrication, as well as to establish the optimal geometry of the axial grooves allowing for the highest load-carrying...
-
Influence of local bush wear on water lubricated sliding bearing load carrying capacity
PublikacjaOne of main problems concerning water-lubricated bearings is their durability. There are known cases of bearings with life time measured in decades, and some, whose refurbishment was necessary just days after start-up. Obtaining stable fluid film friction plays key role in the durability of these bearings. Unfortunately, their load-carrying capacity is limited due to water's low-viscosity. The conducted experimental...
-
Interval Edge-Coloring of Graphs
Publikacja -
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Greedy T-colorings of graphs
PublikacjaTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Correction to: Serialization for Property Graphs
Publikacja -
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublikacjaThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
Capacity of Surface Production of Band Sawing in Manufacture of Oak Floor Upper Layers
PublikacjaThin lamellae, corresponding to the layer components of structural glued members, i.e., 2-ply or 3-ply glued flooring, can be manufactured in re-sawing operations of kiln-dried wood blocks or in wet technologies, which currently seem to be more common because of the shorter drying time. The re-sawing process in wet technology is conducted on dedicated thin-cutting band sawing machines with stellite-tipped band saws. The goal of...
-
Effect of solar radiation on current-carrying capacity of PVC-insulated power cables – the numerical point of view
PublikacjaPower cables are usually buried in the soil, which results in their relatively high current-carrying capacity. However, there are cases in which the starting/final section of a cable line runs along a pole of an overhead power line. Power cables can be directly exposed to solar radiation then, and this negatively influences their current-carrying capacity as well as estimated life of the cables’ insulation. An analysis of thermal...
-
Load carrying capacity of the eccentric joint in the truss made of open cross-sections
PublikacjaThe influence of eccentricity at intersections of truss members on the load carrying capacity of the truss joint is presented in the paper. The research truss elements were designed as cold-formed open cross section. Analytical calculations, numerical analysis and experimental research were conducted to reveal how the eccentricity affects the effort of material in the joint area. The results of analysis and investigations are compared...
-
Method of determining the degree of liquid aeration in a variable capacity displacement pump
PublikacjaThe Author concludes, that there is a possibility of determining a concrete value of the liquid aeration coefficient during the pump operation by finding such value of coefficient with which the increase of torque of mechanical losses is proportional to the indicated torque determined with a fixed value of increase of pressure in the pump working chambers. The fixed value of increase of pressure assumed in searching the liquid...
-
Evaluation the P-Delta Effect on Collapse Capacity of Adjacent Structures Subjected to Far-field Ground Motions
PublikacjaIn urban areas, adjacent structures can be seen in any insufficient distance from each other, because of economic reasons and refusal of acquired minimum separation distance according to seismic previsions. Collapse capacity assessment of structures is one of the important objectives of performance-based seismic engineering. The purpose of this study is to consider the pounding phenomenon and P-Delta effect in seismic collapse...
-
Predicting the seismic collapse capacity of adjacent SMRFs retrofitted with fluid viscous dampers in pounding condition
PublikacjaSevere damages of adjacent structures due to structural pounding during earthquakes have emphasized the need to use some seismic retrofit strategy to enhance the structural performance. The purpose of this paper is to study the influence of using linear and nonlinear Fluid Viscous Dampers (FVDs) on the seismic collapse capacities of adjacent structures prone to pounding and proposing modification factors to modify the median...
-
Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels
PublikacjaWe study subadditivity of the minimum output entropy (Hmin) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for Hmin known in classical information theory. Our result is based on a fundamental property of MACs, i.e., independence of each sender. The channels used in the example can be constructed explicitly. On the basis of subadditivity of Hmin we also provide an example...