Wyszukiwarka
Filtry
wszystkich: 1867
wybranych: 1314
-
Katalog
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VORTEX SEPARATOR
-
Electrohydrodynamic Flow Patterns in a Narrow Electrostatic Precipitator with Longitudinal Wire Electrode for Various Electrode Geometries
PublikacjaRecently 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...
-
On the crack front curvature in bonded joints
PublikacjaStandard tests of adhesively bonded specimens are likely to produce heterogeneous stress distribution along the crack front and its vicinity. High separation rate mode I dominated fracture test is performed.Observation of post mortem fractured surfaces with an optical microscope reveals characteristic features of mixed mode I/III fracture near the sides of the specimen but not in the middle. At first, finite elements calculations...
-
Design and realization of two-operand modular adders in the FPGA
PublikacjaW 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.
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Turán numbers for odd wheels
PublikacjaThe 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...
-
Ring thruster - a preliminary optimisation study
PublikacjaThe ring thruster is a new type of propeller, for which there is no experimental data to verify analytical design calculations. A significant feature of the ring thruster is the absence of a shaft. Propeller blades are mounted to the ring rotating inside the housing, which has the shape of a nozzle. For this reason the ring thruster is closest, with respect to both the construction and principle of operation, to the Kort nozzle...
-
A novel methodology for the enantiomeric resolution of methamphetamine, its precursors and intermediates by GC-MS
PublikacjaImpurity profiling and classification of abused drugs using chiral analytical techniques is of particular interest and importance because of the additional information obtained from this approach. When these methods are applied to the synthesis of illicitly used substances, they can supply valuable information about the conditions/chemicals used in the synthesis. In this study, simultaneous chiral separation of methylamphetamine,...
-
Photosensitization of TiO2 and SnO2 by Artificial Self-Assembling Mimics of the Natural Chlorosomal Bacteriochlorophylls
PublikacjaOf all known photosynthetic organisms, the green sulfur bacteria are able to survive under the lowest illumination conditions due to highly efficient photon management and exciton transport enabled by their special organelles, the chlorosomes, which consist mainly of self-assembled bacteriochlorophyll c, d, or e molecules. A challenging task is to mimic the principle of self-assembling chromophores in artificial light-harvesting...
-
UV-Vis-Induced Degradation of Phenol over Magnetic Photocatalysts Modified with Pt, Pd, Cu and Au Nanoparticles
PublikacjaThe combination of TiO2 photocatalyst and magnetic oxide nanoparticles enhances the separation and recoverable properties of nanosized TiO2 photocatalyst. Metal-modified (Me = Pd, Au, Pt, Cu) TiO2/SiO2@Fe3O4 nanocomposites were prepared by an ultrasonic-assisted sol-gel method. All prepared samples were characterized by X-ray powder diffraction (XRD) analysis, Brunauer-Emmett-Teller (BET) method, X-ray photoelectron spectroscopy...
-
Cyclodextrin polymers as efficient adsorbents for removing toxic non-biodegradable pimavanserin from pharmaceutical wastewaters
PublikacjaPresence of even small amount of active pharmaceutical ingredients in the environment carries risks tohuman and animal health, presenting an important issue. The paper presents issues related to the newdrug - pimavanserin (PMV). Biological treatment efficiency of pimavanserin (PMV) was evaluated usinglab-scale Sequencing Batch Reactor (SBR). It has been shown to have a negative effect on aquatic or-ganisms by classifying it as...
-
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.
-
Comprehensive determination of flavouring additives and nicotine in e-cigarette refill solutions. Part I: Liquid chromatography-tandem mass spectrometry analysis
PublikacjaLiquid chromatography-tandem mass spectrometry with electrospray ionization (HPLC-ESI–MS/MS) methods were developed for the simultaneous determination of 42 flavouring compounds and nicotine in liquids for e-cigarettes. The chromatographic separation was performed using an Ace® Ultracore™ SuperC18™ (100 × 2.1 mm, 2.5 μm) column in both acidic and alkaline pH conditions to separate all the compounds. A simple “dilute & shoot” approach...
-
FDTD Simulations on Disjoint Domains with the Use of Discrete Green's Function Diakoptics
PublikacjaA discrete Green's function (DGF) approach to couple disjoint domains in the finite-difference time-domain (FDTD) grid is developed. In this method, total-field/scattered-field (TFSF) FDTD domains are associated with simulated objects whereas the interaction between them is modeled with the use of the DGF propagator. Hence, source and scatterer are simulated in separate domains and updating of vacuum cells, being of little interest,...
-
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...
-
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”,...
-
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...
-
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.
-
Determination of cyanide in urine and saliva samples by ion chromatography with pulsed amperometric detection
PublikacjaCommonly known as a highly toxic chemical, cyanide is also an essential reagent for many industrial processes. It naturally occurs in plant seeds as a cyanogenic glycosides. Another relatively common mode of cyanide exposure is inhalation of environmental tobacco smoke. This study concerns importance to determine cyanide ion in human biological samples. Urine and saliva samples were collected healthy volunteers exposed to tobacco...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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),...
-
The geometry of free-standing titania nanotubes as a critical factor controlling their optical and photoelectrochemical performance
PublikacjaTitanium dioxide nanotubes are regarded as one of the most important functional materials and due to their unique electronic properties, chemical stability and photocorrosion resistance, they find applications in, for example, highly efficient photocatalysis or perovskite solar cells. Nevertheless, modification of TiO2 nanotubes is required to overcome their main drawback, i.e. large energy bandgap (>3.2 eV) limiting their ability...
-
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ść...
-
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...
-
A new relevant membrane application: CO2 direct air capture (DAC)
PublikacjaSince carbon dioxide (CO2) is the primary greenhouse gas emitted into the atmosphere due to human activities, strong research efforts have been developed towards capturing and decreasing its production. Unfortunately, specific processes and activities make it impossible to avoid CO2 emissions. Among the different strategies scientists propose for CO2 reduction, direct CO2 capture from the atmosphere, also known as direct air capture...
-
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...
-
Characterization of glucoamylase immobilized on magnetic nanoparticles
PublikacjaMagnetic support was prepared by precipitation from an alkaline solution of divalent and trivalent iron ions and subsequently was modified with 3-aminopropyltriethoxysilane. FTIR analysis showed existence of a new Si-O-Fe bond in obtained particles. Scanning electronic microscopy images shows that the nanoparticles of all samples have particle size below 30 nm. Glucoamylase AMG 300L was immobilized onto the modified magnetic support...
-
Volumetric incorporation of NV diamond emitters in nanostructured F2 glass magneto-optical fiber probes
PublikacjaIntegration of optically-active diamond particles with glass fibers is a powerful method of scaling diamond's magnetic sensing functionality. We propose a novel approach for the integration of diamond particles containing nitrogen-vacancy centers directly into the fiber core. The core is fabricated by stacking the preform from 790 soft glass canes, drawn from a single rod dip-coated with submicron diamond particles suspended in...
-
Crystal Facet Engineering of TiO2 from Theory to Application
PublikacjaRecently, the surface structure effect on photocatalytic activity has gathered increasing attention due to its reported influence on the charge carrier trapping and separation. Detailed control over the surface structure can be achieved by exposing the specific crystal facets. As a result, the photogenerated electrons and holes can be effectively separated between the different facets of semiconductor crystals. TiO2 is the most...
-
Boron-Enhanced Growth of Micron-Scale Carbon-Based Nanowalls: A Route toward High Rates of Electrochemical Biosensing
PublikacjaIn this study, we have demonstrated the fabrication of novel materials called boron-doped carbon nanowalls (B:CNWs), which are characterized by remarkable electrochemical properties such as high standard rate constant (k°), low peak-to-peak separation value (ΔE) for the oxidation and reduction processes of the [Fe(CN)6]3–/4– redox system, and low surface resistivity. The B:CNW samples were deposited by the microwave plasma-assisted...
-
Molecularly imprinted polymers applied in capillary electrochromatography and electrophoresis techniques
PublikacjaMolecularly imprinted polymers (MIPs) are synthetic materials with predetermined selectivity for a particular analyte or group of structure-linked chemicals which make them an ideal separation component. The process of developing and applying new types of MIPs in the field of environmental analytical chemistry has been broadly discussedi n many scientific studies in recent years. The use of new types of MIP sorbents as unique sorption...
-
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...
-
The Influence of Abrasive Machine on Temperature During One Side Lapping
PublikacjaPrzedstawiono wyniki badań temperatury układu wykonawczego docierarki jednotarczowej. Analizowano temperaturę trzech pierścieni prowadzących separatory przy wykorzystaniu kamery termograficznej V-20 II firmy VIGO System S.A.
-
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...
-
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...
-
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...
-
Chemically Selective Alternatives to Photoferroelectrics for Polarization-Enhanced Photocatalysis: The Untapped Potential of Hybrid Inorganic Nanotubes
PublikacjaLinear-scaling density functional theory simulation of methylated imogolite nanotubes (NTs) elucidates the interplay between wall-polarization, bands separation, charge-transfer excitation, and tunable electrostatics inside and outside the NT-cavity. The results suggest that integration of polarization-enhanced selective photocatalysis and chemical separation into one overall dipole-free material should be possible.
-
Developments in Green Chromatography
PublikacjaGreen analytical chemistry is a widely recognized concept that has led to the development of new analytical methods with reduced environmental impact and minimized analyst occupational exposure. Achievements include the development of microextraction, ultrasound-assisted extraction (UAE), and microwave-assisted extraction (MAE) techniques. Research towards greener separation processes focuses on the elimination of toxic solvents...
-
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...
-
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...