Filtry
wszystkich: 3381
wybranych: 2616
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: reclaimed rubber
-
Complex multiplier based on the polynomial residue number system
PublikacjaPrzedstawiono próbę zaprojektowania mnożnika zespolonego 4x4 opartego na algorytmie Skavantzosa i Stouraitisa. W algorytmie stosuje siękodowanie liczb n-bitowych jako wielomianów stopnia 7 w pierścieniu wielomianów modulo (x^8-1) z n/4-bitowymi współczynnikami. Mnożenie zespolone jest wykonywane jako 8-punktowy splot cykliczny. Podanoopóżnienie i złożoność sprzętową jak również porównanie ze standardowym.rozwiązaniem.
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Local Nusselt number evaluation in the case of jet impingement
PublikacjaJet impingement still is one of demanding cases regarding computational fluid dynamics, due to its highly turbulent behaviour, with occurrence of turbulent-laminar transition. Even recently developed methods exhibit some drawbacks – RANS based simulations lack accuracy, LES and DNS based ones require too much computational time. Hybrid methods also exist, but their development and validation is in progress. Nevertheless, CFD application...
-
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...
-
On the independence number of some strong products of cycle-powers
PublikacjaIn the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish...
-
Mutual hydrodynamic interaction between the operating propeller and the rudder
PublikacjaPraca przedstawia opis algorytmu i programu do analizy oddziaływania hydrodynamicznego pomiędzy pracującą śrubą a sterem. Algorytm jest oparty na jednoczesnym rozwiązaniu zadania brzegowego dla śruby i steru. Wyniki obliczeń obejmują rozkłady ciśnienia i zmienne siły hydrodynamiczne na śrubie i sterze oraz niestacjonarne zjawiska kawitacyne na obu obiektach. Wyniki obliczeń porównano z rezultatami badań eksperymentalnych.
-
Block graphs with large paired domination multisubdivision number
PublikacjaThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
The influence of screw configuration and screw speed of co-rotating twin screw extruder on the properties of products obtained by thermomechanical reclaiming of ground tire rubber
PublikacjaThe results of our investigations on the process of continuous thermomechanical reclaiming of ground tire rubber (GTR) carried out using a twin screw extruder are presented.We used a co-rotating twin screw extruder with a special configuration of plasticizing unit, enabling generation of considerable shear forces. The influence of screw configuration and screw speed on breaking of chemical crosslink bonds contained in ground tire...
-
Activity and primary characterization of enzyme from Thermus ruber cells catalyzing conversion of maltose into trehalose
PublikacjaTermofilna bakteria Thermus ruber wytwarza syntazę trehalozy użyteczną do jednoetapowego przekształcania maltozy w trehalozę. Enzym ten wykazuje największą aktywność w temperaturze 65 C przy pH 6,5. Największą wydajność wytwarzania enzymu osiągano podczas hodowli drobnoustroju w temp. 55 stC w podłożu zawierającym 0,5% peptonu,0,1% ekstraktu drożdżowego oraz 0,% maltozy lub skrobi.
-
Power quality conditioners with minimum number of current sensor requirement
Publikacja -
Two-dimensional rotation-symmetric number-conserving cellular automata
Publikacja -
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
PublikacjaPraca dotyczy problemu minimalizacji energii poprzez selektywne odłączanie urządzeń komunikacyjnych w wielointerfejsowych sieciach bezprzewodowych w taki sposób, by zapewnić realizację wymaganego grafu połączeń. Sformułowano problem optymalizacyjny, podano wyniki dotyczące jego trudności i zaproponowano algorytmy optymalizacyjne. Rozważono zarówno wariant, w którym liczba interfejsów komunikacyjnych jest parametrem stałym (narzuconym...
-
Estimation of Quantities Related to the Multinomial Distribution with Unknown Number of Categories
Publikacja -
The presence of prostate cancer at biopsy is predicted by a number of genetic variants
Publikacja -
total number and biomass of bacteria in drinking water distribution systems.
PublikacjaIn the vast water supply network using traditional methods of treatment it is often impossible to maintain a constant and acceptable microbiological quality of water. In Poland the main reason of bacterial re-growth is presence of organic matter and nutrients in the circulating water and prolonged water retention in the network systems due to the decrease of water consumption, which has been observed for the last 20 years. In the...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublikacjaArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
P-653 The impact of clinical factors on the number of MII oocytes
Publikacja -
Sharp transitions in low-number quantum dots Bayesian magnetometry
PublikacjaWe consider Bayesian estimate of static magnetic field, characterized by a prior Gaussian probability distribution, in systems of a few electron quantum dot spins interacting with infinite temperature spin environment via hyperfine interaction. Sudden transitions among optimal states and measurements are observed. Usefulness of measuring occupation levels is shown for all times of the evolution, together with the role of entanglement...
-
Impact of Cyclist Facility Availability at Work on the Number of Bike Commuters
PublikacjaThe article describes the results of research designed to establish whether cycle provision can influence the number of employees commuting by bike. To that end, employee surveys were conducted in three IT companies in 2012 and 2016. The questionnaire asked about travel behaviour and what the staff thought about their company’s provision of cyclist facilities. Since 2012 each of the companies has moved its head office and the...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
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...
-
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,...
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublikacjaThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(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 tree T of order n >= 4, with l leaves and s support vertices we have...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
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,...
-
Vegetable derived-oil facilitating carbon black migration from waste tire rubbers and its reinforcement effect
PublikacjaThree dimensional chemically cross-linked polymer networks present a great challenge for recycling and reutilization of waste tire rubber. In this work, the covalently cross-linked networks of ground tire rubber (GTR) were degraded heterogeneously under 150 °C due to the synergistic effects of the soybean oil and controlled oxidation. The degradation mechanism was discussed using Horikx theory and Fourier transformation infrared...
-
Properties comparison of rubber and three layer PTFE-NBR-bronze water lubricated bearings with lubricating grooves along full bush circumference based on experimental tests
PublikacjaWater lubricated bearings have been in industrial use for well over a century. During the last decade their traditional range has been expanded with new, modern products. Despite that fact, certain solutions continue to employ the standard rubber bearing with lubricating grooves located along entire bush circumference. The work presents experimental research conducted on comparable sliding bearings with lubrication grooves along...
-
Minimal number of periodic points for smooth self-maps of RP^3
PublikacjaNiech f będzie gładkim odwzorowaniem 3-wymiarowej rzeczywistej przestrzeni rzutowej w siebie, r będzie ustaloną liczbą naturalną. W artykule wyznaczona została minimalna liczba punktów r-periodycznych w gładkiej klasie homotopii odwzorowania f.
-
All graphs with restrained domination number three less than their order
PublikacjaW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
Minimal number of periodic points for smooth self-maps of S^3
PublikacjaW pracy wyznaczona została najmniejsza liczba punktów periodycznych w gładkiej klasie homotopii odwzorowania sfery trójwymiarowej w siebie.
-
Reducing the Number of Microlocations in Oligonucleotide Microchip Matrices by the Application of Degenerate Oligonucleotides
Publikacja -
Maximum A Posteriori Bayesian Estimation of Chromatographic Parameters by Limited Number of Experiments
Publikacja -
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublikacjaIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
Emphysema affects the number and characteristics of solitary pulmonary nodules. Authors' reply
Publikacja -
An Approach to the Detection of Bank Robbery Acts Employing Thermal Image Analysis
PublikacjaA novel approach to the detection of selected security-related events in bank monitoring systems is presented. Thermal camera images are used for the detection of people in difficult lighting conditions. Next, the algorithm analyses movement of objects detected in thermal or standard monitoring cameras using a method evolved from the motion history images algorithm. At the same time, thermal images are analyzed in order to detect...
-
Realistic noise-tolerant randomness amplification using finite number of devices
PublikacjaRandomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification...
-
Electromagnetic interference frequencies prediction model of flyback converter for snubber design
PublikacjaSnubber design for flyback converters usually requires experimental prototype measurements or simulation based on accurate and complex models. In this study simplified circuit modelling of a flyback converter has been described to dimension snubbers in early stage of design process. Simulation based prediction of the transistor and diode ringing frequencies has been validated by measurements in a prototype setup. In that way obtained...
-
On the growth of the number of periodic points for smooth self maps of a compact manifold
PublikacjaDla ciągłego przekształcenia jednospójnej rozmaitości wymiaru co najmniej 3 w siebie, wykazujemy, że wzrost liczby punktów r-periodycznych w klasie homotopii może być nie szybszy niż liniowy, dla dowolnego, ustalonego r.
-
Quasi-resonant dc-link inverter with a reduced number of active elements
PublikacjaW artykule przedstawiono nową topologię równoległego quasi-rezonansowego obwodu pośredniczącego falownika napięcia. Opisano sekwencje miękkiej komutacji falownika w dwukierunkowym trybie pracy falowniczej i prostowniczej. Analiza układu została zweryfikowana badaniami symulacyjnymi i eksperymentalnymi. Przedstawiona topologia odznacza się prostą strukturą oraz małą ilością elementów aktywnych. Dzięki zastosowaniu krzepkiej strategii...
-
Mechanical exfoliation and layer number identification of single crystal monoclinic CrCl3
PublikacjaAfter the recent finding that CrI3, displays ferromagnetic order down to its monolayer, extensive studies have followed to pursue new two-dimensional (2D) magnetic materials. In this article, we report on the growth of single crystal CrCl3 in the layered monoclinic phase. The system after mechanical exfoliation exhibits stability in ambient air (the degradation occurs on a time scale at least four orders of magnitude longer than...
-
Buckling and shape control of prestressable trusses using optimum number of actuators
PublikacjaThis paper describes a method to control the nodal displacement of prestressable truss structures within the desired domains. At the same time, the stress in all members is unleashed to take any value between the allowable tensile stress and critical buckling stress. The shape and stresses are controlled by actuating the most active members. The technique considers the members’ initial crookedness, residual stresses, and slenderness...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Accuracy Of The GPS Positioning System In The Context Of Increasing The Number Of Satellites In The Constellation
Publikacja -
A new endophyte Monascus ruber SRZ112 as an efficient production platform of natural pigments using agro-industrial wastes
Publikacja -
Emission and properties of airborne wear particles from train brake friction materials based on novolac phenolic resins and butadiene rubbers
PublikacjaThe emission of airborne particulate matter from a train brake depends on the formulation of its friction material. This study investigates the emission and properties of wear particles from train brake friction materials based on straight or resorcinol-modified novolac phenolic resin and nitrile or styrene butadiene rubber used as binding ingredients. The wear particles are generated by a pin-on-disc tribomachine inside an aerodynamic...