Search
Filters
total: 2926
filtered: 2027
displaying 1000 best results Help
Search results for: VORTEX VALVE
-
Gender belief systems through the lens of culture—Differences in precarious manhood beliefs and reactions to masculinity threat in Poland and Norway.
Publication -
Independent dynamics of low, intermediate, and high frequency spectral intracranial EEG activities during human memory formation
PublicationA 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...
-
Graph Decomposition for Memoryless Periodic Exploration
PublicationWe 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...
-
Ruch wirowy wywoływany przez ultradźwięk w płynach z relaksacją
PublicationRozprawa 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
PublicationA 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
PublicationThe 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
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 gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Fast collaborative graph exploration
PublicationWe 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
PublicationWe 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...
-
Revalorisation of the Szewalski’s concept of the law of varying the last-stage blade retraction in a gas-steam turbine
PublicationThe 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...
-
Investigation of the aerodynamics of an innovative verticalaxis wind turbine
PublicationThis 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
PublicationThe 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...
-
Hardware cryptography coprocessor for system on chip soft processor
PublicationW artykule przedstawiono realizację sprzętową i programową szyfrującejo i deszyfrującego algorytmu AES.Obydwie implementacje zostały zralizowane z wykorzystaniem układu Virtex II i przetestowane. Jako kryterium porónawcze wybrano zużycie zasobów układu oraz wydajność. Realizacja sprzętowa wykonuje operację szyfrowania 2 dekady szybcie niż wersja programowa, ale wymaga pięciokrotnie więcej zasobówIn this paper hardware and software...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Electrohydrodynamic Flow Patterns in a Narrow Electrostatic Precipitator with Longitudinal Wire Electrode for Various Electrode Geometries
PublicationRecently narrow electrostatic precipitators (ESPs) have become a subject of interest because of their possible application in diesel engines. In this paper results of 2-dimensional (2D) Particle Image Velocimetry (PIV) measurements of the flow patterns in a narrow ESP for a various electrode geometries are presented. The PIV measurements were carried out in the observation plane that is perpendicular to the ESP duct. The ESP was...
-
Design and realization of two-operand modular adders in the FPGA
PublicationW pracy zaprezentowano strukturę sumatorów modularnych w środowisku Xilinx z użyciem rodziny układów Virtex-6. Rozważono dwa typy sumatorów, jeden dla modułów 5-bitowych i drugi dla 6-bitowych. Zaprojektowano ich struktury i podano eksperymentalne wyniki implementacji.
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
Common Independence in Graphs
PublicationAbstract: 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
PublicationIn 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.
-
Constructing a map of an anonymous graph: applications of universal sequences
PublicationWe 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
PublicationThe 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”,...
-
Double bondage in graphs
PublicationA 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...
-
Experimental studies on the impact of changing the pipe material on the propagation of the pressure wave during water hammer
PublicationAim of the paper is to present the results studying the water hammer phenomenon in pipes made of different materials, and to show the impact of changing the type of material of the pipe on the velocity of the pressure wave during the transient flow in the pipes. In terms of research material and methods, pipes made of galvanized steel and high-density polyethylene were tested. Measurements were made using strain gauges with a high...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe 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
PublicationLet 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
PublicationIn 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...
-
NUMERICAL SIMULATIONS OF GAP FLOW ABOVE ROTATING DISK
PublicationA 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....
-
AKUSTYCZNY ASPEKT ZASTOSOWANIA BLACHY KORTENOWEJ W EUROPEJSKIM CENTRUM SOLIDARNOŚCI W GDAŃSKU
PublicationArtykuł 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...
-
Independent dynamics of slow, intermediate, and fast intracranial EEG spectral activities during human memory formation
PublicationA 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
PublicationShort-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...
-
Sport-related concussion alters cerebral hemodynamic activity during controlled respiration
PublicationThis 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
PublicationIn 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
PublicationWe 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
PublicationA 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
PublicationA 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
Publicationw 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ść...
-
COMPARISON OF SOFTWARE AND HARDWARE REALIZATION OF AES CRYPTOGRAPHIC ALGORITHM
PublicationIn 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
PublicationW 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...
-
Hardware realization of shadow detection algorithm in FPGA
PublicationW 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
PublicationDirect 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...
-
Clinical anatomy of the spatial structure of the right ventricular outflow trac
PublicationBackground. The right ventricular outflow tract (RVOT) is located above the supraventricular crest and reaches the level of the pulmonary valve. Detailed knowledge of the RVOT spatial structure and its morphology is extremely important for cardiac invasive therapeutic procedures. Objectives. To examine the spatial structure of the RVOT using virtual models of the right ventricle (RV) interior obtained post mortem. Material and...
-
Application of additional factors supporting the microextraction process
PublicationDue 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
PublicationNowadays, 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...
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe 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
PublicationRecently, 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...
-
Brushing with additional cleaning restrictions
PublicationIn 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...
-
Secure Italian domination in graphs
PublicationAn 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
PublicationImagine 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...
-
Human verbal memory encoding is hierarchically distributed in a continuous processing stream
PublicationProcessing 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...
-
Strategic balance in graphs
PublicationFor 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,...