Filtry
wszystkich: 6887
wybranych: 4663
-
Katalog
- Publikacje 4663 wyników po odfiltrowaniu
- Czasopisma 20 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 86 wyników po odfiltrowaniu
- Wynalazki 5 wyników po odfiltrowaniu
- Projekty 18 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 118 wyników po odfiltrowaniu
- Wydarzenia 13 wyników po odfiltrowaniu
- Dane Badawcze 1960 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TREE SAPS
-
Determination of optimal rotational speeds of circular saws
PublikacjaW pracy przedstawiono możliwości diagnostyczne stanowiska HewSaw do badania zachowania się pił w funkcji prędkości obrotowej piły. Wykazano, ze wyznaczone wartości prędkości optymalnych badanych pił leżą poniżej wartości zalecanych przez producenta. Praca z prędkościami wyższymi od optymalnych może prowadzić do zwiększenia strat materiałowych, a także stwarzać zagrożenia dla obsługi.
-
Degree of T-equivariant maps in R^n
PublikacjaW pracy przedstawiona jest konstrukcja niezmienniczego stopnia topologicznego dla odwzorowań z symetriami działających na przestrzeni euklidesowej z inwolucją. Udowodnione jest twierdzenie, że dwa dopuszczalne i gradientowe odwzorowania niezmiennicze są niezmienniczo homotopijne wtedy i tylko wtedy, gdy są one homotopijne niezmienniczo i gradientowo.
-
Classification of homotopy classes of equivariant gradient maps
PublikacjaNiech V będzie ortogonalną reprezentacją zwartej grupy Liego Gi niech S(V),D(V) oznaczają sferę jednostkową i kulę jednostkową V.Jeżeli F jest G-niezmienniczą funkcją rzeczywistą klasy C^1 na Vto mówimy, że grad F (gradient F) jest dopuszczalny, jeżeli(grad F)(x) jest różny od zera dla x należących do S(V). Pracapoświęcona jest homotopijnej klasyfikacji dopuszczalnychG-niezmienniczych odwzorowań gradientowych.
-
A Hopf type theorem for equivariant local maps
PublikacjaWe study otopy classes of equivariant local maps and prove a Hopf type theorem for such maps in the case of a real finite-dimensional orthogonal representation of a compact Lie group.
-
On the homotopy equivalence of the spaces of proper and local maps
Publikacja -
SARS-CoV-2 Cluster in Nursery, Poland
Publikacja -
Software for calculation of noise maps implemented on the supercomputer
PublikacjaThis paper presents investigation results relevant to the implementation of the algorithms for the calculation of noise maps. The aim of the implementation of the algorithms on the computer cluster is explained. Selected implementation details of the software called the noise propagation model are described. The interaction of the software with the data acquisition system is presented. Noise maps obtained by exploitation of the...
-
Data visualization of marine objects on digital maps
PublikacjaThe paper presents the implementation of two multithreaded applications for data visualization of marine objects written in C#, designed to run on operator consoles with 32-bit or 64-bit Windows 7 OS. The article describes the most important functionality and features of the developed C# .NET user controls for data visualization on digital maps and in the configurable tables.
-
Creating Acoustic Maps Employing Supercomputing Cluster
PublikacjaThe implemented online urban noise pollution monitoring system is presented with regard to its conceptual assumptions and technical realization. A concept of the noise source parameters dynamic assessment is introduced. The idea of noise modeling, based on noise emission characteristics and emission simulations, was developer and practically utilized in the system. Furthermore, the working system architecture and the data acquisition...
-
On structural physical approximations and entanglement breaking maps
PublikacjaVery recently, a conjecture saying that the so-called structural physical approximations (SPAs) to optimal positive maps (optimal entanglement witnesses) give entanglement breaking (EB) maps (separable states) has been posed (Korbicz et al 2008 Phys. Rev. A 78 062105). The main purpose of this contribution is to explore this subject. First, we extend the set of entanglement witnesses supporting the conjecture. Then, we ask whether...
-
''Voice Maps'' - system supporting navigation of the blind
PublikacjaReferat wygłoszony na Konferencji SHA 2012,Gołuń, 22-25.V.2012.
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
An algorithm for listing all minimal double dominating sets of a tree
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
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 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,...
-
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 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,...
-
Hybridized PWM Strategy for Three- and Multiphase Three-Level NPC Inverters
PublikacjaA simple hybridized pulsewidth modulation (PWM) algorithm for three- and multiphase three-level neutral point clamped (NPC) inverters is proposed. The proposed solution is based on classical space vector PWM (SVPWM) algorithms for two-level inverters but can also be based on sinusoidal PWM with min–max injection. An additional level of output voltage is obtained by modifying the resulting switching patterns taking into account...
-
Isocyanate-Free Polyurethanes
PublikacjaIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
Paired bondage in trees
PublikacjaW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Preserving Trees in Automata
PublikacjaWe present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublikacjaWe describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublikacjaBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
Empirical analysis of tree-based classification models for customer churn prediction
PublikacjaCustomer churn is a vital and reoccurring problem facing most business industries, particularly the telecommunications industry. Considering the fierce competition among telecommunications firms and the high expenses of attracting and gaining new subscribers, keeping existing loyal subscribers becomes crucial. Early prediction of disgruntled subscribers can assist telecommunications firms in identifying the reasons for churn and...
-
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.
-
QUALITY GAPS IN HIGHER EDUCATION FROM THE PERSPECTIVE OF STUDENTS
PublikacjaThe presented research work relates to the category of quality in higher education. This article aims to present the determinants of the quality of education in the context of international standards. The background of the considerations is the Bologna Declaration and the European Higher Education Area. The results of the research carried out with the use of the nominal group method and the data analysis carried out based on the...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublikacjaConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Fixed point index for $G$-equivariant multivalued maps
Publikacja -
Shub’s conjecture for smooth longitudinal maps of S^m
PublikacjaLet f be a smooth map of the m-dimensional sphere Sm to itself, preserving the longitudinal foliation. We estimate from below the number of fixed points of the iterates of f , reduce Shub’s conjecture for longitudinal maps to a lower dimensional classical version, and prove the conjecture in case m = 2 and in a weak form for m = 3.
-
Plants sources of vitamins against SARS-CoV-2
Publikacja -
Geometrical effects of axial run-out in circular saws
PublikacjaW pracy omówione zostały efekty geometryczne jakie wywoływane są przez błąd bicia osiowego pił tarczowych.
-
Effects of workpiece feeding errors on multi-rip saws
PublikacjaW pracy przedstawiono przyczyny i efekty błędów prowadzenia materiału na wielopiłach tarczowych. Ich znajomość umożliwia szybką diagnostykę przyczyn, a także skuteczną minimalizację błędów prowadzenia materiału.
-
GIS for processing multidimensional marine data in SAAS model
PublikacjaGeographic Information Systems (GIS) have always been a useful tool for visualization and processing of geospatial data. However, their capabilities of analysis non-standard information such as hydroacoustic soundings has thus far been very limited. This paper proposes a general-purpose GIS which uses techniques such as OLAP, WCS and WCPS for processing of multidimensional spatio-temporal data. The versatility of the GIS is exemplified...
-
Music Mood Visualization Using Self-Organizing Maps
PublikacjaDue to an increasing amount of music being made available in digital form in the Internet, an automatic organization of music is sought. The paper presents an approach to graphical representation of mood of songs based on Self-Organizing Maps. Parameters describing mood of music are proposed and calculated and then analyzed employing correlation with mood dimensions based on the Multidimensional Scaling. A map is created in which...
-
Local fixed point indices of iterations of planar maps
PublikacjaW artykule podana zostaje postać indeksów iteracji dla pewnej klasy odwzorowań planarnych. Podstawowymi narzędziami stosowanym w pracy są liczba Nielsena i indeks Conleya.
-
Periodic points of latitudinal maps of the $m$-dimensional sphere
PublikacjaLet f be a smooth self-map of the m-dimensional sphere Sm. Under the assumption that f preserves latitudinal foliations with the fibres S1, we estimate from below the number of fixed points of the iterates of f. The paper generalizes the results obtained by Pugh and Shub and by Misiurewicz.
-
The Hopf type theorem for equivariant gradient local maps
PublikacjaWe construct a degree-type otopy invariant for equivariant gradient local maps in the case of a real finite-dimensional orthogonal representation of a compact Lie group. We prove that the invariant establishes a bijection between the set of equivariant gradient otopy classes and the direct sum of countably many copies of Z.
-
On the deformation and frequency analyses of SARS-CoV-2 at nanoscale
PublikacjaThe SARS-CoV-2 virus, which has emerged as a Covid-19 pandemic, has had the most significant impact on people's health, economy, and lifestyle around the world today. In the present study, the SARS-CoV-2 virus is mechanically simulated to obtain its deformation and natural frequencies. The virus under analysis is modeled on a viscoelastic spherical structure. The theory of shell structures in mechanics is used to derive the governing...
-
Multidimensional Feature Selection and Interaction Mining with Decision Tree Based Ensemble Methods
Publikacja -
INDIVIDUAL TREE DETECTION FROM UAV LIDAR DATA IN A MIXED SPECIES WOODLAND
Publikacja -
Tree-based homogeneous ensemble model with feature selection for diabetic retinopathy prediction
Publikacja -
Construction of a picewise-linear classifier by applaing discriminant analysis to decision tree induction
PublikacjaArtykuł prezentuje metodę konstrukcji drzew decyzyjnych. W odróżnieniu od większości popularnych algorytmów, które wybierają pojedyncze cechy do budowy reguł decyzyjnych w węzłach drzewa, ta metoda łączy wszystkie cechy. Używa ona wieloklasowego kryterium Fishera do wydzielenia nowych cech, które są liniowa kombinacją cech pierwotnych. Takie drzewa mogą aproksymować złożone regiony decyzyjne używając mniejszej liczby węzłów w porównaniu...
-
Fault Tree Analysis and Failure Diagnosis of Marine Diesel Engine Turbocharger System
Publikacja -
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
The complexity of list ranking of trees
PublikacjaUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...