Wyszukiwarka
Filtry
wszystkich: 715
wybranych: 463
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: TURBULENT VORTEX
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
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...
-
Optimizing CO2 Purification in a Negative CO2 Emission Power Plant
PublikacjaIn the pursuit of mitigating CO2 emissions, this study investigates the optimisation of CO2 purification within a Negative CO2 Emission Power Plant using a spray ejector condenser (SEC) coupled with a separator. The approach involves direct-contact condensation of vapour, primarily composed of an inert gas (CO2), facilitated by a subcooled liquid spray. A comprehensive analysis is presented, employing a numerical model to simulate...
-
Analysis of cyclone separator solutions depending on SEC outlet conditions in nCO2PP
PublikacjaUtilization of spray ejector condenser in order to carry out direct-contact condensation of vapour with inert gas (CO2) on a spray of subcooled liquid integrated with separator (to make pure CO2) has been proposed for the task of condensation and CO2 separation in the negative CO2 emission gas power plant. Condensation and separation has a significant impact on the thermodynamic efficiency of the entire negative CO2 emission gas...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Analysis of unsteady flow forces on the thermowell of steam temperature sensor
PublikacjaIn this paper, 3D numerical analysis of unsteady flow forces acting on the measuring sheath of steam temperature is presented. According to that purpose, the CFD (Computation Fluid Dynamic [1]) approach has been used. The nonstationary of fluid acting on the measuring sheath such as: Strouhal frequency, amplitude of pressure, structure of vortex, peak of pressure, field of pressure, field of velocity etc. are studied analytically...
-
Możliwości zamiany elektrycznych przepływomierzy powietrza stosowanych w silnikach spalinowych samochodów
PublikacjaW artykule przedstawiono podstawowe typy przepływomierzy powietrza, stosowane w silnikach spalinowych samochodów: z klapąspiętrzającą, HLM, HFM, Vortex i MAP. Przedstawiono wyniki badania tych przepływomierzy na specjalnie przygotowanym stanowisku pomiarowym. Przeanalizowano możliwość ich zamiany i zweryfikowano taką możliwość w praktyce.
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Electronic Voting: 8th International Joint Conference, E-Vote-ID 2023, Luxembourg City, Luxembourg, October 3–6, 2023, Proceedings
Publikacja -
Electronic Voting: 8th International Joint Conference, E-Vote-ID 2023, Luxembourg City, Luxembourg, October 3–6, 2023, Proceedings
Publikacja -
Derecho Evolving from a Mesocyclone—A Study of 11 August 2017 Severe Weather Outbreak in Poland: Event Analysis and High-Resolution Simulation
PublikacjaThis study documents atmospheric conditions, development, and evolution of a severe weather outbreak that occurred on 11 August 2017 in Poland. The emphasis is on analyzing system morphology and highlighting the importance of a mesovortex in producing the most significant wind damages. A derecho-producing mesoscale convective system (MCS) had a remarkable intensity and was one of the most impactful convective storms in the history...
-
The nonlinear effects of sound in a liquid with relaxation losses
PublikacjaThe nonlinear effects of sound in electrolyte with a chemical reaction are examined. The dynamic equations that govern non-wave modes in the field of intense sound are derived, and acoustic forces of vortex, entropy, and relaxation modes are determined in the cases of low-frequency sound and high-frequency sound. The difference in the nonlinear effects of sound in electrolyte and in a gas with excited vibrational degrees of molecules,...
-
Influence of nanoparticle concentration on convective heat transfer of water-Al2O3 nanofluids inside horizontal tubes
PublikacjaNanofluids came to be seen as a new generation of coolants, especially in single-phase systems. Conducted experiments indicate that the increase in thermal conductivity is not the only reason for the intensification of heat transfer when using nanofluids. Preliminary results of the experimental investigation of the forced convection heat transfer of water-Al2O3 nanofluids inside stainless steel tube with 8 mm internal diameter...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
Scale effect in the self-propulsion prediction for Ultra Large Container Ship with contra-rotating propellers
PublikacjaThis article addresses the problem of the scale effect for an Ultra Large Container Ship (ULCS) with a novel twin-crp-pod propulsion system. Twin-crp-pod steering-propulsion arrangement is an innovative solution that gains from three well-known systems: twin-propeller, contra-rotating propellers and pod propulsors. It is expected that applying the twin-crp-pod system to the analysed Ultra Large Container Ship will increase propulsion...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Air flow phenomena in the model of the blind drift
PublikacjaIn the presented paper, Particle Image Velocimetry (PIV) has been used to investigate flow pattern and turbulent structure in the model of blind drift. The presented model exist in mining, and has been analyzed to resolve ventilation issues. Blind region is particularly susceptible to unsafe methane accumulation. The measurement system allows us to evaluate all components of the velocity vector in channel cross-section simultaneously....
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Experimental investigation of forced convection of water-Al2O3 nanofluids inside horizontal tubes,
PublikacjaIn this paper, forced convection of water–Al2O3 nanofluids inside horizontal copper tube is studied experimentally. Experiments were conducted for three, i.e. 0.1%, 1% and 5% nanoparticle mass concentrations under transition and turbulent flow regimes. Average heat transfer coefficients and pressure drop values were determined and compared to distilled water. Enhancement of heat transfer for lower nanoparticle concentration and...
-
How to Sort Them? A Network for LEGO Bricks Classification
PublikacjaLEGO bricks are highly popular due to the ability to build almost any type of creation. This is possible thanks to availability of multiple shapes and colors of the bricks. For the smooth build process the bricks need to properly sorted and arranged. In our work we aim at creating an automated LEGO bricks sorter. With over 3700 different LEGO parts bricks classification has to be done with deep neural networks. The question arises...
-
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...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
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,...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Experimental Validation of Numerical Model within a Flow Configuration of the Model Kaplan Turbine
PublikacjaThis paper investigates validation of flow within a model Kaplan turbine. This includes comparison of various turbulence models and their influence on torque and power generated by the turbine. Numerical results were compared with experimental data.
-
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...
-
Investigation of the Aerodynamics of an Innovative Vertical-Axis Wind Turbine
PublikacjaThe paper presents the results of an experimental investigation and a three dimensional numerical analysis of the transient aerodynamic phenomena occurring in the innovative modification of classic Savonius wind turbine. An attempt to explain the increased efficiency of the innovative design a comparison with the traditional solution is undertaken. A vorticity measure based on the integral of the velocity gradient tensor second...
-
Investigations of the Working Process in a Dual-Fuel Low-Emission Combustion Chamber for an FPSO Gas Turbine Engine
PublikacjaThis investigation is devoted to an analysis of the working process in a dual-fuel low-emission combustion chamber for a floating vessel’s gas turbine. The low-emission gas turbine combustion chamber with partial pre-mixing of fuel and air inside the outer and inner radial-axial swirlers was chosen as the object of research. When modelling processes in a dual-flow low-emission gas turbine combustion chamber, a generalized method...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
3D Hand Shape Modeling for Automatic Assessing Motor Performance in Parkinson's Disease
PublikacjaIn this paper a method for hand pattern processing to create a 3D hand model is presented. By applying a complete hand armature to the model obtained, an interpolation of three motor tests for an individual Parkinson's disease patient can be performed. To obtain the 3D hand model the top view of the hand from a web cam is analyzed. The hand contour is examined to find characteristic points that allows for dividing hand image into...
-
Experimental investigation of forced convection of water/EGAl2O3 nanofluids inside horizontal tube
PublikacjaIn this paper, forced convection of water/EG-Al2O3 nanofluids inside horizontal stainless steel tube is studied experimentally. As base fluid served water/EG mixture of two ratios (60:50 and 50:50). Nanoparticle mass concentrations was 0.1% or and 1%. Transition and turbulent flow regimes were tested. Average heat transfer coefficient and pressure drop values were determined for nanofluids and compared to base fluids. Deterioration...
-
Recent progress in experimental studies of electrohydrodynamic flow in electrostatic precipitators
PublikacjaMany experimental, theoretical and numerical works were devoted to the electrohydrodynamic (EHD) flow generated in electrostatic precipitators (EPSs). The generally accepted conclusion from these studies is that the EHD flow plays an important role in the particle collection in ESPs. However, despite of the recent fast progress in numerical simulation and experimental techniques used in the ESPs studies many problems related to...
-
Graph Decomposition for Memoryless Periodic Exploration
PublikacjaWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
Independent dynamics of low, intermediate, and high frequency spectral intracranial EEG activities during human memory formation
PublikacjaA wide spectrum of brain rhythms are engaged throughout the human cortex in cognitive functions. How the rhythms of various frequency ranges are coordinated across the space of the human cortex and time of memory processing is inconclusive. They can either be coordinated together across the frequency spectrum at the same cortical site and time or induced independently in particular bands. We used a large dataset of human intracranial...
-
Ruch wirowy wywoływany przez ultradźwięk w płynach z relaksacją
PublikacjaRozprawa doktorska poświęcona jest badaniu ruchu wirowego wywoływanego przez ultradźwięk w różnych modelach płynów z relaksacją. Ma ona charakter teoretyczny, jednak wykorzystanie uzyskanych dzięki niej wyników może przynieść lepsze zrozumienie ruchu wirowego wywoływanego przez siłę akustyczną. W I rozdziale rozprawy przedstawione zostały ogólne rozważania dotyczące akustyki nieliniowej. Rozdział II dotyczy ruchu wirowego wywoływanego...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
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...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
ARRAY OF MINIJETS – THERMAL AND HYDRAULIC PHENOMENA IN BOUNDARY LAYER
PublikacjaPresented work considers flow and thermal phenomena occurring in the system consisting of minijets array and heated with constant heat flux surface. Numerical analyses, based on the mass, momentum and energy conservation laws, were conducted. Focus was placed on the proper model construction, in which turbulence and boundary layer modelling was crucial. Calculations were done for various mass flow rates. The main calculations were...
-
New Product Creativity Dimensions and Performance
PublikacjaA new product’s meaningfulness and novelty are recognized as two distinct and important dimensions. Thus, researchers started to investigate their impact on new product performance. However, researchers’ reports on the impact of novelty on performance are still mixed, and several issues need to be solved. One of these problems is comparing how strongly each of these dimensions affects the new product performance. The other is to...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Investigation of the aerodynamics of an innovative verticalaxis wind turbine
PublikacjaThis paper presents a preliminary three dimensional analysis of the transient aerodynamic phenomena occurring in the innovative modification of classic Savonius wind turbine. An attempt to explain the increased efficiency of the innovative design in comparison with the traditional solution is undertaken. Several vorticity measures such as enstrophy, absolute helicity and the integral of the velocity gradient tensor second invariant...
-
Design of horizontal axis wind and water turbines
PublikacjaThe basic hydrodynamic principles of horizontal axis turbines are presented. Computational methods based on vortex theory for design of such turbines and for calculation of their hydro or aerodynamic characteristics are described in detail. These methods are applicable both to wind and water turbines. The influence of detailed turbine geometry on its characteristics is presented. Several practical computational examples of different...
-
Revalorisation of the Szewalski’s concept of the law of varying the last-stage blade retraction in a gas-steam turbine
PublikacjaThe article presents the implementations of the free vortex law to the blade of the last stage of a gas-steam turbine. First, a thermodynamic analysis was carried out, determining the parameters at the inlet, then the number of stages of the high and low-pressure part of the turbine was constructed, together with the kinematics and velocity vectors for subsequent stages of the axial turbine. The last step of article was to take...