Wyszukiwarka
Filtry
wszystkich: 553
wybranych: 411
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: VORTEX VENTILATION
-
Three-dimensional printed trachea helps to design tailored treatment for tracheobronchomalacia
PublikacjaTracheobronchomalacia is a rare respiratory disease that is manifesting by impaired ventilation with expiratory collapse of the tracheal wall due to softening of the supporting cartilage and hypotonia of myoelastic elements [1]. Surgery is the mainstay of treatment. We report the case of 39 -year old man with exacerbation of chronic respiratory distress. The membranous wall of the trachea and the large bronchi was stretched to...
-
Experimental tests for the determination of mechanical properties of PVC foil
PublikacjaThe paper presents an application of the PVC film in civil engineering. Mechanical behaviour of the PVC film applied for suspended ceilings, in the form of a stretch ceiling is investigated under uniaxial and biaxial tensile tests. The study is focused on the determination of mechanical properties from experimental data (uniaxial and biaxial tensile tests). The uniaxial cyclic tests are performed in order to observe a variation...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Agricultural products' storage control system
PublikacjaThe paper discusses the idea and the design of a remote control system for storage management of agricultural products which temperature may rise as the result of biological processes during the storage. An actual potatoes storehouse is discussed as an application for the proposed automation system. Because of existing buildings and infrastructure at the farm, wireless data transfer system has been proposed for communication between...
-
Sposoby zagospodarowania ciepła odpadowego z silników napędowych jednostek pływających Cześć 1. Wykorzystanie ciepła do napędu urządzeń chłodniczych
PublikacjaEnergia chemiczna paliwa jest w wielu przypadkach zaledwie w połowie wykorzystana jako energia napędowa silnika. Pozostała część jako ciepło odpadowe przekazywana jest do otoczenia. Dzięki odpowiednim układom przetwarzania ciepło ze spalin można wykorzystać do wytwarzania chłodu lub jako ciepło użytkowe, w systemach HVAC (ang. heating, ventilation, air conditioning – ogrzewanie, wentylacja, klimatyzacja). Tym samym koszty pracy...
-
COMBINING FUNCTIONAL AND AESTHETIC ASPECTS OF DAYLIGHTING IN SUSTAINABLE ARCHITECTURE WITH THE USE OF DIGITAL DESIGN METHODS
PublikacjaThe aesthetics of modern architecture should relate to its origins and goals - the environment, function, sustainability and its users. One of the conditions that meet the criteria is the presence of daylight and the use of its potential. The contemporary digital tools that support the design process allow to controlling the use of difficult and capricious materials, such as daylight. They also combine daylighting aspects with...
-
Double bondage in graphs
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) 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, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Constructing a map of an anonymous graph: applications of universal sequences
PublikacjaWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
AKUSTYCZNY ASPEKT ZASTOSOWANIA BLACHY KORTENOWEJ W EUROPEJSKIM CENTRUM SOLIDARNOŚCI W GDAŃSKU
PublikacjaArtykuł opisuje użycie blachy kortenowej jako dominującego materiału wykończeniowego na elewacjach i we wnętrzach budynku o przesłaniu symbolicznym. Przedstawiono architektoniczne przesłanki, uzasadniające jednorodność zastosowanego materiału. Na tym tle omówiono wpływ blachy kortenowej na akusty-kę pomieszczeń, wraz z podaniem kroków zaradczych redukujących nadmierną pogłosowość i zwiększających stopień rozproszenia dźwięku. Pozytywnym...
-
NUMERICAL SIMULATIONS OF GAP FLOW ABOVE ROTATING DISK
PublikacjaA rotating disk can be considered a basic configuration for the investigati ons of the impact of various conditions on the flow through the clearance between the s hrouded turbine blade and the casing. Numerical calculations using Fine/Turbo Numeca were conducted to examine the influence of the rotational velocity and the pressure differ ence across the disk on the flow conditions, especially the mass flow through the clearance....
-
Independent dynamics of slow, intermediate, and fast intracranial EEG spectral 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 low and high frequencies are spatiotemporally coordinated across the human brain during memory processing is inconclusive. They can either be coordinated together across a wide range of the frequency spectrum or induced in specific bands. We used a large dataset of human intracranial electroencephalography...
-
Distinct hippocampal-prefrontal neural assemblies coordinate memory encoding, maintenance, and recall
PublikacjaShort-term memory enables incorporation of recent experience into subsequent decision-making. This processing recruits both the prefrontal cortex and hippocampus, where neurons encode task cues, rules, and outcomes. However, precisely which information is carried when, and by which neurons, remains unclear. Using population decoding of activity in rat medial prefrontal cortex (mPFC) and dorsal hippocampal CA1, we confirm that mPFC...
-
Wind Conditions at Pedestrian Level in Different Types of Residential Urban Development for a High Degree of Land Use Efficiency
PublikacjaThe paper concerns wind conditions around urban building development at the pedestrian level. The article aims to identify aerodynamic phenomena around three types of multi-family housing developmentswith different forms and the same urban parameters of building development intensity (high intensity was taken into account). The aim of the research was mainly to achieve qualitative results that would lead to understanding fundamental...
-
Sport-related concussion alters cerebral hemodynamic activity during controlled respiration
PublikacjaThis study investigated cerebral hemodynamic activity following sport-related concussion. Prefrontal cortex oxygenation was assessed by near-infrared spectroscopy (NIRS) during a controlled breathing protocol. Wavelet transformation of the NIRS signals showed significant decreases in HbO2 and HbD amplitude at the respiratory frequency interval (0.10–0.6 HZ) from preseason baseline to acute concussion. These results suggest a decreased...
-
Fully Separated Flow Control Using DBD Plasma Actuators Located at the Leading Edge of an Airfoil
PublikacjaIn the framework of the PLASMAERO European project, experiments were conducted to investigate the authority of surface DBD plasma actuators to alter a fully separated flow around an airfoil in order to improve its aerodynamic performances in its natural stall regime. In this paper, unsteady excitation control is more specifically investigated. The key control parameter studied here is the burst frequency which periodically imposes...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
The prns butterfly synthesis in the FPGA
Publikacjaw pracy przedstawiono sprzętową implementację elementarnych obliczeń, określanych jako obliczenia motylkowe, dla splotu realizowanego z użyciem wielomianowego systemu resztowego(ang. polynomial residue number system - prns). obliczenia są wykonywane z zastosowaniem reprezentacji systemu diminished-1. opisano syntezę układu realizującego obliczenie motylkowe w środowisku xilinx w układzie virtex 4. podano również wymaganą ilość...
-
Application of TMS320c67xx signal processors for SONIC-self-optimizing narrowband interference canceler
PublikacjaThe paper presents a laboratory system for testing active control algorithms of acoustics noise in ducts. An applied algorithm - self-optimizing narrowband interference canceller (SONIC), allows one to remove narrowband disturbances of constant or slowly time-varying frequencies. Example experimental results of using the laboratory system for supression of sinusoidal disturbance are described. An electronic part of the system was...
-
COMPARISON OF SOFTWARE AND HARDWARE REALIZATION OF AES CRYPTOGRAPHIC ALGORITHM
PublikacjaIn this paper hardware and software realization of direct and inverse AES cryptographic algorithm is presented. Both implementations were made using the Virtex-II FPGA and were practically tested. As the criteria of comparison, the resource utilization, achieved performance and power dissipation were chosen. Hardware realization increases throughput of conversion about 190 times over software implementation and decreases the energy...
-
Sprzętowa i programowa realizacja algorytmu szyfrującego AES = Hardware and software implementation of AES algorithm
PublikacjaW artykule przedstawiono sprzętową i programową realizację algorytmu szyfrującego i deszyfrującego AES. Obydwie implementacje zostały zrealizowane z wykorzystaniem platformy Virtex-II i praktycznie zweryfikowane. Jako kryteria do porównania wybrano: zużycie zasobów, przepustowość i zużycie mocy. Wersja sprzętowa charakteryzuje się 190-krotnie większą przepustowością, 80-krotnie mniejszym zużyciem energii na przetworzenie jednego...
-
Areas of Fan Research—A Review of the Literature in Terms of Improving Operating Efficiency and Reducing Noise Emissions
PublikacjaFans as industrial devices are among the most significant single recipients of driving energy. Therefore, they represent an important area of energy savings to reduce CO2 emissions. The ubiquity of fans and their operation under conditions different from the optimum provides an opportunity for more significant global reductions in the energy used to drive them. The second important aspect, besides energy efficiency, related to...
-
Will NILM Technology Replace Multi-Meter Telemetry Systems for Monitoring Electricity Consumption?
PublikacjaThe estimation of electric power utilization, its baseload, and its heating, light, ventilation, and air-conditioning (HVAC) power component, which represents a very large portion of electricity usage in commercial facilities, are important for energy consumption controls and planning. Non-intrusive load monitoring (NILM) is the analytical method used to monitor the energy and disaggregate total electrical usage into appliance-related...
-
Hardware realization of shadow detection algorithm in FPGA
PublikacjaW referacie opisano problem detekcji cieni w sekwencjach wideo. Na podstawie metod znanych z literatury opracowano algorytm detekcji cieni, działający w czasie rzeczywistym i przeznaczony do realizacji sprzętowej w układzie FPGA. Algorytmy zostały przetestowane i porównane w środowisku MATLAB. Za pomocą języka VHDL zrealizowano system detekcji cieni wykorzystujący opracowany algorytm i zaimplementowano go w układzie Virtex-4. Został...
-
Electrical Stimulation Modulates High Gamma Activity and Human Memory Performance
PublikacjaDirect electrical stimulation of the brain has emerged as a powerful treatment for multiple neurological diseases, and as a potential technique to enhance human cognition. Despite its application in a range of brain disorders, it remains unclear how stimulation of discrete brain areas affects memory performance and the underlying electrophysiological activities. Here, we investigated the effect of direct electrical stimulation...
-
Application of additional factors supporting the microextraction process
PublikacjaDue to the fact that green analytical chemistry is of high importance, the past two decades have witnessed a rapid growth in the sample preparation area with special emphasis on simplification, miniaturization and automation of extraction procedures. In addition, to accelerate the extraction processes and to improve the separation of analytes, several enhanced parameters are applied. These factors include, ultrasounds, microwaves,...
-
The use of liquid crystal thermography TLC and particle image velocimetry PIV in selected technical applications
PublikacjaNowadays, the energy cost is very high and this problem is carried out to seek techniques for improvement of the aerothermal and thermal (heat flow) systems performances in different technical applications. The transient and steady-state techniques with liquid crystals for the surface temperature and heat transfer coefficient or Nusselt number distribution measurements have been developed. The flow pattern produced by transverse...
-
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
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...
-
Implementation of Coprocessor for Integer Multiple Precision Arithmetic on Zynq Ultrascale+ MPSoC
PublikacjaRecently, we have opened the source code of coprocessor for multiple-precision arithmetic (MPA). In this contribution, the implementation and benchmarking results for this MPA coprocessor are presented on modern Zynq Ultrascale+ multiprocessor system on chip, which combines field-programmable gate array with quad-core ARM Cortex-A53 64-bit central processing unit (CPU). In our benchmark, a single coprocessor can be up to 4.5 times...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Human verbal memory encoding is hierarchically distributed in a continuous processing stream
PublikacjaProcessing of memory is supported by coordinated activity in a network of sensory, association, and motor brain regions. It remains a major challenge to determine where memory is encoded for later retrieval. Here we used direct intracranial brain recordings from epilepsy patients performing free recall tasks to determine the temporal pattern and anatomical distribution of verbal memory encoding across the entire human cortex. High...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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 in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA 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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Radix-4 dft butterfly realization with the use of the modified quadratic residue number system
PublikacjaW pracy zaprezentowano projektowanie i realizację obliczenia motylkowego dft dla podstawy 4 z użyciem zespolonego systemu resztowego (CRNS) i zmodyfikowanego kwadratowego systemu resztowego (MQRNS). System MQRNS oprócz własności dekompozycyjnych pozwala na realizację mnożenia zespolonego przy zastosowaniu trzech mnożeń rzeczywistych. Przedstawiono konwertery wejściowy CRNS/MQRNS i wyjściowy MQRNS/CRNS, mnożenie zespolone w MQRNS,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 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 a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
STM32: Aplikacje i ćwiczenia w języku C. - M. Galewski. -
PublikacjaW książce przedstawiono nowoczesne, 32-bitowe mikrokontrolery z rodzeniem ARM Cortex-M3. Oprócz opisu poszczególnych ich podukładów, zawarto w niej przede wszystkim wiele przykładowych ćwiczeń, których zaawansowanie jest stopniowane, dzięki czemu czytelnicy są łagodnie wprowadzani w omawianie zagadnienia. Przykłady zamieszczone w książce są bardzo różnorodne, bazują m.in. na czujnikach przyspieszenia i ciśnienia MEMS, interfejsie...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
On trees attaining an upper bound on the total domination number
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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
COMPARISON OF INFINITE ELEMENT MODELS
PublikacjaThe main objective of this paper is to show the comparison of two models of infinite ab- sorbing layer with increasing damping in numerical investigations of elastic wave prop- agation in unbounded structures. This has been achieved by the Authors by a careful in- vestigation of two different engineering structures characterised by gradually increasing geometrical and mathematical description complexities. The analysis included...
-
Performance analyses of helical coil heat exchangers. The effect of external coil surface modification on heat exchanger effectiveness
PublikacjaThe shell and coil heat exchangers are commonly used in heating, ventilation, nuclear industry, process plant, heat recovery and air conditioning systems. This type of recuperators benefits from simple construction, the low value of pressure drops and high heat transfer. In helical coil,centrifugal force is acting on the moving fluid due to the curvature of thetube results in the development. It has been long recognized that the...