Wyszukiwarka
Filtry
wszystkich: 515
wybranych: 377
Wyniki wyszukiwania dla: MINIMUM RASAUERA-TOWNSENDA
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
The high-energy critical minimum in elastic electron scattering by argon.
PublikacjaZostało zbadane położenie wysokoenergetycznego minimum krytycznego w rozpraszaniu elektronów na argonie. W celu przeprowadzenia dyskusji zachowania się czynnego przekroju różniczkowego w okolicy minimum krytycznego przeprowadzono analizę położenia minimum zarówno dla energii, jak i kątów.
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Elastic electron scattering by argon in the vicinity of the high-energy critical minimum.
PublikacjaZostały obliczone różniczkowe przekroje czynne na sprężyste rozpraszanie elektronów na argonie. Przedział energetyczny rozpraszanych elektronów został tak dobrany, aby zbadać położenie tzw. minimum krytycznego.
-
Minimum drag shape bodies moving in inviscid fluid - revisited
PublikacjaThis paper presents the classic approach to minimum drag shape body problem, moving at hypersonic speeds, leading to famous power law shapes with value of the exponent of 3/4. Two- and three-dimensional cases are considered. Furthermore, an exact pseudo solution is given and its uselessness is discussed. Two new solutions are introduced, namely an approximate solution due to form of the functional and solution by means of optimisation...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Objective selection of minimum acceptable mesh refinement for EMC simulations
PublikacjaOptimization of computational electromagnetics (CEM) simulation models can be costly in both time and computing resources. Mesh refinement is a key parameter in determining the number of unknowns to be processed. In turn, this controls the time and memory required for a simulation. Hence, it is important to use only a mesh that is good enough for the objectives of the simulation, whether for direct handling of high-fidelity EM...
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
A framework estimating the minimum sample size and margin of error for maritime quantitative risk analysis
PublikacjaThe average accident frequency is essential for quantitative risk analysis and is conventionally estimated from accident statistics. This paper has systematically synthesised the knowledge on statistical errors and offered the missing instructions, a framework, for determining the minimum sample size and the margin of error (MOE) when calculating the average accident frequency from an accident database at hand. We have applied...
-
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...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Looking for a minimum exergy destruction in hierarchical cycle
PublikacjaThe paper presents results of energy analysis, complemented with an exergy balance, of hierarchical thermodynamic cycle. Proposed cycle is a binary vapour cycle based on a model of real supercritical steam power plant. Energy analysis is used to preliminary optimization of the cycle and the exergy losses analysis is proposed to perform optimization of heat transfer processes, which are essential for hierarchical cycles. Proposed...
-
A note on the strength and minimum color sum of bipartite graphs
PublikacjaSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
Power quality conditioners with minimum number of current sensor requirement
Publikacja -
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
Measures for interoperability of phenotypic data: minimum information requirements and formatting
Publikacja -
Verification of Formulas for Periods of Adjacent Buildings Used to Assess Minimum Separation Gap Preventing Structural Pounding during Earthquakes
PublikacjaInsufficient separation distance between adjacent buildings may lead to serious damages during earthquakes due to structural pounding. The best way to prevent collisions is to provide sufficiently large separation distance between the structures. In this paper, the periods of two closely-spaced linear and nonlinear buildings have been investigated so as to accurately assess the minimum in-between separation gap. A new equation...
-
Metrological analysis of surface quality aspects in minimum quantity cooling lubrication
Publikacja -
Using Minimum Actuators to Control Shape and Stress of a Double Layer Spherical Model Under Gravity and Lateral Loadings
PublikacjaSpherical domes are picturesque structures built in developed countries to attract tourists. Due to horizontal and vertical overloading, the structures’ attractive shapes may be disturbed, and some members' stress may exceed the elastic level. In this paper, the shape and stress of a deformed double-layer spherical numerical model due to simultaneous lateral and vertical loadings are controlled, meanwhile, the number of actuators...
-
Minimum Information about T Regulatory Cells: A Step toward Reproducibility and Standardization
Publikacja -
Structural and Microhardness Changes After Turning of the AISI 1045 Steel for Minimum Quantity Cooling Lubrication
Publikacja -
Minimum mean square error estimation of speech short-term predictor parameters under noisy conditions
Publikacja -
Examining Impact of Speed Recommendation Algorithm Operating in Autonomous Road Signs on Minimum Distance between Vehicles
PublikacjaAn approach to a new kind of recommendation system design that suggests safe speed on the road is presented. Real data obtained on roads were used for the simulations. As part of a project related to autonomous road sign development, a number of measurements were carried out on both local roads and expressways. A speed recommendation model was created based on gathered traffic data employing the traffic simulator. Depending on...
-
Estimation of Minimum Uncut Chip Thickness during Precision and Micro-Machining Processes of Various Materials—A Critical Review
Publikacja -
The study on minimum uncut chip thickness and cutting forces during laser-assisted turning of WC/NiCr clad layers
Publikacja -
The Influence of the Application of EP Additive in the Minimum Quantity Cooling Lubrication Method on the Tool Wear and Surface Roughness in the Process of Turning 316L Steel
Publikacja -
A dressing of zero-range potentials and electron-molecule scattering problem at low energies
PublikacjaTechnika ''ubierania'' jest używana do poprawy modelu potencjału zerowego promienia (ZRP). Rozważamy przekształcenia Darboux zaczynające się od ZRP, wynik ''ubierania'' daje potencjał z niezerowym promieniem, który zależy od parametrów rozwiązania.
-
Electron scattering on N2O - from cross section to diffusion coefficients.
PublikacjaW pracy przedstawiono wyniki pomiarów współczynników transportu: stosunek współczynnika dyfuzji w kierunku prostopadłym do pola elektrycznego do ruchliwości, stosunek współczynnika dyfuzji podłużnej do ruchliwości oraz prędkość dryfu elektronów w funkcji zredukowanego pola elektrycznego. Współczynniki zmierzono metodą Townsenda-Huxley´a a prędkość dryfu otrzymano wykorzystując metodę Bradbury - Nielsena. Zmierzone współczynniki...
-
ANALYSIS OF CLIMATIC ZONES IN POLAND WITH REGARD TO ASPHALT PERFORMANCE GRADING
PublikacjaTowards the end of the last century a new system of bitumen grading was developed and implemented as part of the American Strategic Highway Research Program (SHRP). Its aim was to better adjust the testing methods and requirements for road bitumens to the actual conditions in which those bitumens serve in road pavements. Currently in Poland, similarly as in the other EU countries, road bitumens are tested and classified with regard...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
A model of liquid film breakdown formed due to impingement of a two-phase jet on a horizontal surface
PublikacjaThe present work aims to provide an explanation to the phenomenon of breakdown of the thin liquid film created by impinging two-phase, liquid-gas jet. Existing in the literature models describe merely thebreakdown of single phase liquid films. The model presented here is based on examination of mass and energy equations under the applied criterion of the minimum of total energy. That allows to determinethe minimum thickness of...
-
Wpływ nagniatania ślizgowego na chropowatość zewnętrznych powierzchni obrotowych w częściach maszyn
PublikacjaPodano wyniki badań technologicznych nagniatania ślizgowego wałków ze stali C45.Obróbkę przeprowadzono na tokarce CNC z użyciem nagniataka z tensometrycznym pomiarem siły docisku.Zamieszczono wytyczne dla doboru parametrów obróbki według kryterium wymaganej chropowatości powierzchni obrobianej.
-
Experimental research on water lubricated three layer sliding bearing with lubrication grooves in the upper part of the bush and its comparison with a rubber bearing
Publikacjacomposite. Eachofitslayershasanimportantfunction.Speciallypreparedslidingsurfaceensures minimum resistance.Followingrunning-initssmoothnessbecomesveryhighandthebearingmay continue workingunder fluid lubricationregime.NBRlayerensuresbearingelasticity,goodvibration damping propertiesandinsusceptibilitytoshaftaxismisalignment.Theexternalbrasslayermakes fitting thebearingeasier. Experiment resultsoftheconductedresearchwerecomparedwiththoseforarubberbearingof similar...
-
Sposób segmentacji przebiegu losowego, złożonego z szumu białego i impulsów prostokątnych o stałych amplitudach oraz przypadkowych czasach trwania i przerw
PublikacjaPodano sposób segmentacji sygnału losowego o składowej stacjonarnej będącej szumem białym oraz niestacjonarnej w formie impulsów prostokątnych o stałych amplitudach oraz przypadkowych czasach trwania i przerw. Obserwowany sygnał jest dzielony na N segmentów, w których składowa niestacjonarna, impulsowa posiada ustaloną amplitudę. Momenty czasu, w których zaczynają się i kończą kolejne segmenty określono przez wyznaczenie minimum...
-
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...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Mechanizacja napraw głównych podtorza i nawierzchni szynowych
PublikacjaSzybki rozwój techniki i znaczący wzrost kosztów pracy wymusza na wykonawcach robót ograniczenie do niezbędnego minimum liczby robotników, i wto miejsce wprowadzenie nowoczesnych, bardzo wydajnych maszyn, które skracają czas wykonania naprawy. Druga zasadniczą przyczyną wprowadzenia nowoczesnych maszyn jest ograniczenie do niezbędnego minimum czasu zamknięcia torów, co zmniejsza utrudnienia w prowadzeniu ruchu pociągów, a ponadto...
-
Mechanizacja napraw głównych dróg szynowych
PublikacjaSzybki rozwój techniki i znaczący wzrost kosztów pracy wymusza na wykonawcach robót ograniczenie do niezbędnego minimum liczby robotników, i w to miejsce wprowadzenie nowoczesnych, bardzo wydajnych maszyn, które skrócą czas wykonania napraw.Drugą zasadniczą przyczyną wprowadzenia nowoczesnych maszyn jest skrócenie do niezbędnego minimum czasu zamknięcia toru, co ogranicza utrudnienia w prowadzeniu ruchu pociągów, a dodatkowo...
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Properties of the triset metric for phylogenetic trees
Publikacjathe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
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...
-
Critical minima in elastic scattering of electrons from Ar and Zn.
PublikacjaDokonano obliczeń różniczkowych przekrojów czynnych na sprężyste rozpraszanie elektronów na atomach argonu i cynku. Otrzymane minimum krytyczne z tych przekrojów porównano z niedawno otrzymanymi danymi doświadczalnymi.
-
Feature Reduction Using Similarity Measure in Object Detector Learning with Haar-like Features
PublikacjaThis paper presents two methods of training complexity reduction by additional selection of features to check in object detector training task by AdaBoost training algorithm. In the first method, the features with weak performance at first weak classifier building process are reduced based on a list of features sorted by minimum weighted error. In the second method the feature similarity measures are used to throw away that features...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Three-objective antenna optimization by means of kriging surrogates and domain segmentation
PublikacjaIn this paper, an optimization framework for multi-objective design of antenna structures is discussed which exploits data-driven surrogates, a multi-objective evolutionary algorithm, response correction techniques for design refinement, as well as generalized domain segmentation. The last mechanism is introduced to constrain the design space region subjected to sampling, which permits reduction of the number of training data samples...