Search
Search results for: VORTEX VENTILATION
-
ASIC Design Example of Complex SoC with FPGA Prototyping
PublicationThe 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
PublicationThe 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...
-
Portes-Revista Mexicana de Estudios sobre la Cuenca del Pacifico
Journals -
Verification of the compatibility of TOC, TOKC duct silencers with selected EN standards
PublicationThe TOC and TOKC ventilation silencers tested during the a.m. procedures are compatible with selected standards to the extents and classes as stated above without further limitations.
-
The Impact of Forms of Buildings on the Air Exchange in Their Environment. Based on the Example of Urban Development in Warsaw
PublicationPossibilities for energy-efficient, natural ventilation of buildings in an urban environment depend on the airflow around them. This chapter deals with the issue of dependence of air exchange in urban spaces on the building forms used in them and on relative position of these buildings. The authors focused on the problem of air stagnation in dense urban development. This phenomenon increases the energy demand of buildings. The...
-
Towards Designing an Innovative Industrial Fan: Developing Regression and Neural Models Based on Remote Mass Measurements
PublicationThis article presents the process of the construction and testing a remote, fully autonomous system for measuring the operational parameters of fans. The measurement results obtained made it possible to create and verify mathematical models using linear regression and neural networks. The process was implemented as part of the first stage of an innovative project. The article presents detailed steps of constructing a system to...
-
Integrating modelling, simulation and data management tools to create a planning support system for the improvement of air quality by urban planning solutions
PublicationThe urbanization pressure requires urban planners, designers, and policy makers to be more responsive to the challenges related to improving the quality of the urban environment and the living conditions of the inhabitants. One of the many environmental issues that need to be taken into account is urban air pollution. As the process of urban ventilation and air pollution dis-persion is significantly affected by the urban layout,...
-
Can unequal distributions of wealth influence vote choice? A comparative study of Germany, Sweden and the United States.
PublicationIt 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
PublicationIn 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
PublicationIn 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
PublicationA 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
PublicationA 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
PublicationA 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,...
-
CORTE E CONFORMAÇÃO DE METAIS
Journals -
Influence of external walls' thermal capacitance on indoor thermal comfort
PublicationThe doctoral thesis presents the results of numerical investigations on the influence of walls’ thermal capacitance on indoor thermal comfort. A proper set of thermal parameters of a building structure can considerably limit the heating / cooling demand, and passively increase the indoor thermal comfort. However the effect of building thermal capacitance on indoor conditions is complex and not always beneficial. Among a great number...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract 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
PublicationA 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...
-
Some Progress on Total Bondage in Graphs
PublicationThe 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
PublicationGiven 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
PublicationIn 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
PublicationW 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.
-
Coupling between Blood Pressure and Subarachnoid Space Width Oscillations during Slow Breathing
PublicationThe precise mechanisms connecting the cardiovascular system and the cerebrospinal fluid (CSF) are not well understood in detail. This paper investigates the couplings between the cardiac and respiratory components, as extracted from blood pressure (BP) signals and oscillations of the subarachnoid space width (SAS), collected during slow ventilation and ventilation against inspiration resistance. The experiment was performed on...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA 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...
-
Air flow phenomena in the model of the blind drift
PublicationIn 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....
-
Efficiency of Biomass Energy used for Heating Purposes in a Residential Building in Comparison with other Energy Sources
PublicationThis paper discusses the results of analyses investigating the energy efficiency of biomass in comparison with other popular energy carriers used for heating, ventilation and water heating in residential buildings. The compared energy sources were lignite, natural gas, heating oil and electricity produced by conventional and integrated power generation plants. The most efficient variant relying on biomass and the least efficient...
-
Derecho Evolving from a Mesocyclone—A Study of 11 August 2017 Severe Weather Outbreak in Poland: Event Analysis and High-Resolution Simulation
PublicationThis 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...
-
A framework for Air Quality Management Zones - Useful GIS-based tool for urban planning: Case studies in Antwerp and Gdańsk
PublicationThere is a growing recognition of the importance of proper urban design in the improvement of air flow and pollution dispersion and in reducing human exposure to air pollution. However, a limited number of studies have been published so far focusing on the development of standard procedures which could be applied by urban planners to effectively evaluate urban conditions with respect to air quality. To fill this gap, a new approach...
-
The nonlinear effects of sound in a liquid with relaxation losses
PublicationThe 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
Publication -
Electronic Voting: 8th International Joint Conference, E-Vote-ID 2023, Luxembourg City, Luxembourg, October 3–6, 2023, Proceedings
Publication -
Total Domination Versus Domination in Cubic Graphs
PublicationA 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...
-
Rational Use of Primary Energy in Single-Family Residential Houses
PublicationThis work presents results of the primary energy use for heating residential single-family house. Analysis includes domestic hot water system (DHW) and heating, ventilation and air condition system (HVAC). During researches the conventional and alternative energy sources (natural gas, biomass, fuel oil, bituminous coal, lignite or electric energy obtained from electric power system – EPS) were used in DHW and HVAC systems. Furthermore...
-
On the hat problem on a graph
PublicationThe 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....
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor 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...
-
Three-fast-searchable graphs
PublicationIn 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...
-
Model obliczania kosztu cyklu życia obiektu na przykładzie budynku mieszkalnego jednorodzinnego
PublicationW artykule przedstawiono model obliczania kosztu cyklu życia budynku mieszkalnego jednorodzinnego oraz wskazano możliwości ograniczenia wydatków związanych z jego użytkowaniem w okresie trzydziestu lat. Celem prezentowanej analizy rachunku kosztu cyklu życia jest porównanie i ocena kosztów nabycia i użytkowania domu realizowanego według alternatywnych technologii z uwzględnieniem przyjętych rozwiązań w zakresie pozyskania energii,...
-
Dynamic F-free Coloring of Graphs
PublicationA 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
PublicationA 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...
-
Reducing Air Pollutant Emissions from the Residential Sector by Switching to Alternative Energy Sources in Single-Family Homes
PublicationThe paper discusses a scenario for adapting residential buildings to the requirements of the EU climate and energy package. It analyzes the option of reducing pollutant emissions to ambient air by switching to alternative energy sources in a typical single-family residential building. The most common sources of energy in central heating and ventilation systems and water heating systems were compared, and the analyzed energy carriers...
-
How to Sort Them? A Network for LEGO Bricks Classification
PublicationLEGO 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
PublicationIn 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
PublicationWe 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
PublicationWe 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
PublicationA 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...
-
All graphs with paired-domination number two less than their order
PublicationLet 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...
-
Computational Fluid Dynamic study on the wind characteristics of a multifunctional building system model in developed coastal cities
PublicationThis paper presents an approach for providing innovative technology by applying fluid mechanics to the field of architectural design. The aim is to make a building’s shape profitable and strengthen environmental protection by using the wind force to create an integrated wind absorption definition for a multifunctional building system model. Furthermore, taking control of the wind flow over an object can have an impact on not only...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet 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
PublicationThe 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...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn 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
PublicationIn 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...