Filtry
wszystkich: 711
-
Katalog
Wyniki wyszukiwania dla: TURBULENT VORTEX
-
Determination of Mechanical Energy Loss in Steady Flow by Means of Dissipation Power
PublikacjaWhen systems of simple geometry like pipes or regular channels are considered, the mechan- ical energy loss of the fluid flow can be expressed by local and longitudinal empirical energy loss coefficients. However, in the case of large spatially distributed objects, there are no simple approaches to this task. In practice, general recommendations addressing different types of objects are used, but they usually provide very coarse...
-
ASIC Design Example of Complex SoC with FPGA Prototyping
PublikacjaThe paper presents an example of the System on a Chip design, where the FPGA prototyping has been used. Two FPGA prototypes have been realized. The first FPGA prototype uses AVNET board containing Xilinx Virtex4 device accompanied by custom board with required devices. The second FPGA prototype has been built using the custom PCB with Xilinx Virtex-4 XC4VLX60 FPGA accompanied by all needed external components. The final system...
-
ASIC Design Example of Complex SoC with FPGA Prototyping
PublikacjaThe paper presents an example of the System on a Chip design, where the FPGA prototyping has been used. Two FPGA prototypes have been realized. The first FPGA prototype uses AVNET board containing Xilinx Virtex4 device accompanied by custom board with required devices. The second FPGA prototype has been built using the custom PCB with Xilinx Virtex-4 XC4VLX60 FPGA accompanied by all needed external components. The final system...
-
Koło Naukowe Vertex
Kursy OnlineForum spotkań członków Koła Naukowego "VERTEX"
-
Portes-Revista Mexicana de Estudios sobre la Cuenca del Pacifico
Czasopisma -
CO2 capture through direct-contact condensation in a spray ejector condenser and T- junction separator
PublikacjaThe design principle underlying the steam condensation and CO2 purification in a gas power plant with a focus on reducing CO2 emissions encompasses the deployment of a spray ejector condenser (SEC) and separator. This innovative system facilitates direct-contact condensation of steam with non-condensable gas (CO2) by inter acting with a spray of subcooled water, seamlessly integrated with a T-junction separator mechanism aimed...
-
Numerical analysis of the ostiomeatal complex aeration using the CFD method
PublikacjaWe aimed to analyse ostiomeatal complex (OMC) aeration using the computational fluid dynamics (CFD) method of simulation based on human craniofacial computed tomography (CT) scans. The analysis was based on CT images of 2 patients: one with normal nose anatomy and one with nasal septal deviation (NSD). The Reynolds-Average Simulation approach and turbulence model based on linear eddy viscosity supplemented with the two-equation...
-
Fluid Mechanics, L/L/E, DaPE, sem. 04, summer 21/22 (PG_00050282)
Kursy OnlineLECTURES Introduction and basic definitions. Properties of fluids. Models of fluids. Fluids in equilibrium. Determination of hydrostatic forces. Archimedes" law. Methods of fluid flow description. General motion of fluid. Deformation of fluid element. Vortex motion of fluid. Principles of conservation of mass, momentum and energy. Balance of entropy. Navier-Stokes equation. Bernoulli equation. Similarity of flow phenomena. Potential...
-
Can unequal distributions of wealth influence vote choice? A comparative study of Germany, Sweden and the United States.
PublikacjaIt is widely accepted that income influences voting behavior. Does wealth? Is the effect similar across countries? Studies of wealth and voting behavior have not existed until recently, in part because of the absence of data on wealth holdings. The findings in this chapter indicate that wealth is related to voting behavior in some countries but not in others. The chapter models the effects of wealth on one form of voting behavior,...
-
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:...
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total 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. A 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 total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Influence of nanoparticle concentration on convective heat transfer of water-Al2O3 nanofluids inside horizontal tubes
PublikacjaThis work presents 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 and 2000 mm length. Nanoparticles were tested at the concentrations of 0.01%, 0.1%, 1% and 5% by weight and the Reynolds number range encompasses laminar as well as turbulent flows.
-
CORTE E CONFORMAÇÃO DE METAIS
Czasopisma -
Fast Low-fidelity Wing Aerodynamics Model for Surrogate-Based Shape Optimization
PublikacjaVariable-fidelity optimization (VFO) can be efficient in terms of the computational cost when compared with traditional approaches, such as gradient-based methods with adjoint sensitivity information. In variable-fidelity methods, the directoptimization of the expensive high-fidelity model is replaced by iterative re-optimization of a physics-based surrogate model, which is constructed from a corrected low-fidelity model. The success...
-
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...
-
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...
-
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...
-
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...
-
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,...
-
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 -
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...
-
AeroSense Measurements: Wind Tunnel Ecole Centrale Lyon
Dane BadawczeData from wind tunnel tests of Aerosesne measurement system installed on NACA 63418 aerfoil in the anechoic wind tunnel at the Ecole Centrale Lyon.
-
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...
-
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,...
-
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...
-
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.
-
Ocean mixed layer dynamics: high-resolution simulations of wind, wave and convective effects
Dane BadawczeThis dataset contains results of high-resolution numerical simulations of the ocean mixed layer (OML) forced by wind, waves and cooling from the atmosphere, i.e., under strongly turbulent, convective conditions. The goal is to provide detailed, three-dimensional information about OML circulation, turbulent kinetic energy, and temperature and salinity...
-
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...