Wyszukiwarka
Filtry
wszystkich: 7148
-
Katalog
- Publikacje 6559 wyników po odfiltrowaniu
- Czasopisma 7 wyników po odfiltrowaniu
- Konferencje 7 wyników po odfiltrowaniu
- Osoby 84 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 13 wyników po odfiltrowaniu
- Aparatura Badawcza 9 wyników po odfiltrowaniu
- Kursy Online 100 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 365 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: M5 MODEL TREE
-
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...
-
Tree-based homogeneous ensemble model with feature selection for diabetic retinopathy prediction
Publikacja -
A Fuzzy Event Tree Model for Accident Scenario Analysis of Ship Stuck in Ice in Arctic Waters
Publikacja -
Expression-based decision tree model reveals distinct microRNA expression pattern in pediatric neuronal and mixed neuronal-glial tumors
Publikacja -
Laxer Clinical Criteria for Gaming Disorder May Hinder Future Efforts to Devise an Efficient Diagnostic Approach: A Tree-Based Model Study
PublikacjaInternet Gaming Disorder (IGD) has been recognized in May 2013 and can be evaluated using the criteria developed by American Psychiatric Association (APA). The present study investigated the role each IGD criteria plays in diagnosing disordered gaming. A total of 3,377 participants (mean age 20 years, SD = 4.3 years) participated in the study. The data collected was scrutinized to detect patterns...
-
Estimation of the Ultimate Strength of FRP Strips-to-Masonry Substrates Bond
PublikacjaFiber-Reinforced Polymers (FRP) were developed as a new method over the past decades due to their many beneficial mechanical properties, and they are commonly applied to strengthen masonry structures. In this paper, the Artificial Neural Network (ANN), K-fold Cross-Validation (KFCV) technique, Multivariate Adaptive Regression Spline (MARS) method, and M5 Model Tree (M5MT) method were utilized to predict the ultimate strength of...
-
Komputerowo wspomagana klasyfikacja wybranych sygnałów elektromiografii powierzchniowej
PublikacjaWykorzystywanie sygnałów elektromiografii powierzchniowej (ang. Surface Electromyography, SEMG) w procesach sterowania systemami rehabilitacyjnymi stanowi obecnie standardową procedurę. Popularność SEMG wynika z nieinwazyjności metody oraz możliwości szybkiej i precyzyjnej identyfikacji funkcji mięśniowej. W przypadku osób małoletnich proces klasyfikacji sygnałów jest utrudniony ze względu na mniejsze rozmiary i wyższą dynamikę...
-
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Average Size of a Suffix Tree for Markov Sources
PublikacjaWe study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular applications, and so forth. We prove that the average size of such a suffix tree is asymptotically equivalent to the average size of a trie built over n independentsequences from the same Markovian source. This equivalenceis only known for memoryless...
-
The reliability of tree and star networks
PublikacjaThis paper investigated the reliability of tree and star networks. Following measures of network reliability are assumed: the expected number of nodes, that can communicate with the central node; the expected number of node pairs, that are connected by a path through the central node; the expected number of node pairs communicating.
-
Evaluation of the content of inorganic anions in tree saps
PublikacjaTree saps were once commonly used in the countries of Northern, Central and Eastern Europe. Although once almost forgotten, their popularity has been growing recently as part of an interest in organic food and traditional medicine. Tree saps, tapped mainly from birch and maple trees, are drunk both fresh and fermented or are used as raw material for the production of food products, e.g. syrups. The aim of this study was to determine...
-
The reliability of tree and star networks.
PublikacjaOne of the important parameters characterizing the quality of computer networks is the network's reliability with respect to failures of the communication links and nodes. This chapter investigated the reliability of tree and star networks. The tree and star topology is used in centralized computer networks. In centralized computer networks all communication must take place through some central computer. Following measures of network...
-
JOz Model AiR
Kursy Online -
Incremental construction of Minimal Tree Automata [online]
PublikacjaWe describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...
-
Reduced model of gyroscopic system
PublikacjaThe paper presents the method of model reduction for the system with gyroscopic interactions. Two methods were used to obtain the approximate discrete models of the continuous structure: the modal decomposition method and the rigid finite element method. The first approach is used for this part of a system for which it is easy to formulate orthogonality conditions, meanwhile the second one is used for other part. The method enables...
-
Perfect hashing tree automata
PublikacjaWe present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.Przedstawiamy algorytm, który oblicza...
-
User satisfaction model
PublikacjaRaport techniczny - opis metody ''User Satisfaction Methods'' wykorzystywanej w projektowaniu komunikacji człowiek-komputer oraz doskonaleniu interfejsu użytkownika.
-
TREE PHYSIOLOGY
Czasopisma -
A simple model of circular hydraulic pump
PublikacjaRozpatrzono warunki powstawania osiowosymetrycznego uskoku hydraulicznego. Przedstawiono model, w którym rozpatrzono obecność dodatkowych strat w równaniu Bernoulliego. Przyczyniają się one do powstawania dodatkowego wiru w miejscu uskoku. Porównanie z wynikami badań eksperymentalnych potwierdza słuszność przyjętych tez.
-
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.
-
Spirometry measurement model - the diagnostic purpose support
Publikacjathe paper presents a new model of respiratory mechanism based on the spirometry measurements. the spirometry test assesses the efficiency of the lung ventilation. the respiratory system functioning is based on the ventilation mechanism. thus the quality of the lung depends on the quality of lung ventilation. modelling of the respiratory system supports a diagnostic process. the model parameter estimates are obtained on the basis...
-
MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION
Publikacjabut also as medicinal substance in folk medicine. Traditionally, it was used to treat various conditions, mostly anaemia and chronic fatigue. This study has been designed to establish the content of metallic elements (sodium, potassium, calcium, magnesium, zinc and copper) in sap collected from eight different species (silver birch, downy birch, hornbeam, Norway maple, boxelder maple, black walnut, black alder and white willow)...
-
Reliability model of the crankshaft-piston assembly
PublikacjaThe laws that govern the durability of crankshaft-piston assembly friction nodes can be proved or at least derived or justified in an intuitive way. Operation of all the friction nodes is disturbed by external factors occurring with randomly changing intensity and also appearing at random. As the crankshaft-piston assembly friction nodes have a series structure and effects of those disturbances accumulate, their fitness for use...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
A Quality Model for UML tools
PublikacjaJakość narzędzi UML wpływa na efektywność wykonywania zadań związanych z modelowaniem systemów w procesie wytwarzania oprogramowania. Celem badań prezentowanych w tym referacie jest wyodrębnienie kryteriów jakości narzędzi UML. Omówiono rolę narzędzi UML w projekcie informatycznym, a następnie zaprezentowano szereg kryteriów jakości narzędzi UML wraz z aspektami oceny oraz opisem ankiety, która służy do oceny narzędzi względem...
-
The elasto-viscoplstic Chaboche model
PublikacjaW artykule przedstawiono rozwoj i numeryczną aplikacje sprężysto-lepkoplastycznego modelu Chabocha. Przedstawione są także szczegółowe opisy kilkunastu wariantów modelu Chaboche'a wraz z parametrami materiałowymi.
-
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...
-
Atmospheric deposition in coniferous and deciduous tree stands in Poland
PublikacjaThe objective of this study was to assess the transformation of precipitation in terms of quantity and chemical composition following contact with the crown layer in tree stands with varied species composition, to investigate the effect of four predominant forest-forming species (pine, spruce, beech, and oak) on the amount and composition of precipitation reaching forest soils, and to determine the sources of pollution in atmospheric...
-
Gossiping by energy-constrained mobile agents in tree networks
PublikacjaEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Update a simple hypoplastic constitutive model
PublikacjaW artykule omówiono uproszczona formę hipoplastycznego konstytutywnego prawa materiałowego do opisu zachowania się materiałów granulowanych. Wykonano symulacje testów elementów i porównano wyniki z doświadczeniami.
-
The model of photovoltaic phenomenon in thin inhomogeneously organic film
PublikacjaW pracy przedstawiono model zjawiska fotowoltaicznego w obecności gradientu pułapek nośników ładunku. Zakładając, że długość dyfuzji ekscytonów związana jest z koncentracją pułapek, wykazano, że napięcie fotowoltaiczne silnie zależy od gradientu koncentracji pułapek.
-
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...
-
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,...
-
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...
-
Tree-Ring Research
Czasopisma -
Tree Genetics & Genomes
Czasopisma -
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...
-
Model of distributed learning objects repository for a heterogenic internet environment
PublikacjaW artykule wprowadzono pojęcie komponentu edukacyjnego jako rozszerzenie obiektu edukacyjnego o elementy zachowania (metody). Zaproponowane podejście jest zgodne z paradygmatem obiektowym. W oparciu o komponent edukacyjny zaprojektowano model budowy repozytorium materiałów edukacyjnych. Model ten jest oparty o usługi sieciowe i rejestry UDDI. Komponent edukacyjny oraz model repozytorium mogą znaleźć zastosowanie w konstrukcji zbiorów...
-
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...
-
Use of Bi-Temporal ALS Point Clouds for Tree Removal Detection on Private Property in Racibórz, Poland
PublikacjaTrees growing on private property have become an essential part of urban green policies. In many places, restrictions are imposed on tree removal on private property. However, monitoring compliance of these regulations appears difficult due to a lack of reference data and public administration capacity. We assessed the impact of the temporary suspension of mandatory permits on tree removal, which was in force in 2017 in Poland,...
-
The energy consumption during the birch tree sap concentration process using the reverse osmosis system
PublikacjaBirch tree sap was concentrated by mens of the reversed osmosis technique. The energy consumption in a small-scale pilot apparatus was estimated. The threshold value for the water removal above which the specific energy consumption significantly increased was identified. Below the threshold value the reversed osmosis had low energy demand and could be an attractive method for the production of birch tree sap-based beverages.
-
Geoscientific Model Development
Czasopisma -
2D Mathematical Model of the Commutator Sliding Contact of an Electrical Machine
PublikacjaW artykule przedstawiono model matematyczny 2D komutatorowego zestyku ślizgowego z wieloma stopniami swobody. W modelu uwzględniono zmienne wymuszenia działające na szczotkę. Wymuszenia te są wynikiem falistości wirującego komutatora. Szczotka została zamodelowana jako system wielu mas, elementów sprężystych i tłumików rozłożonych w kierunku stycznym i promieniowym. Zamodelowano wszystkie oddziaływania lepkosprężyste pomiędzy komutatorem...
-
General Active-RC filter model for computer-aided design
PublikacjaW pracy przedstawiono ogólną topologię filtru aktywnego RC czasu ciągłego. Proponowany model umożliwia zunifikowaną analizę wszystkich możliwych realizacji układowych filtrów aktywnych RC jako szczególnych przypadków danej struktury ogólnej. Poprawność modelu teoretycznego została zweryfikowana poprzez symulacje w programie SPICE.
-
A note on mixed tree coloring
PublikacjaZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
Tree rings as an indicator of atmospheric pollutant deposition to subalpine spruce forests in the Sudetes (Southern Poland)
PublikacjaIn spite of their moderate altitude (1000–1600m a.s.l.), the Western SudetyMountains belong to areas with the most efficient fog precipitation in Europe. Intense industrial activity in the area of windward western foothills caused an exceptional intensification of atmospheric pollutant deposition via precipitation and fog to take place since the 1950s. In the second half of the 1970s a massive spruce forest dieback began affecting...