Filters
total: 1865
displaying 1000 best results Help
Search results for: BEHAVIORAL TREES
-
Atmospheric deposition in coniferous and deciduous tree stands in Poland
PublicationThe 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...
-
MINERAL CONTENT OF TREE SAP FROM THE SUBCARPATHIAN REGION
Publicationbut 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)...
-
Lower bound on the weakly connected domination number of a tree
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery 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...
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Behavioral Psychology-Psicologia Conductual
Journals -
Paladyn, Journal of Behavioral Robotics
Journals -
Current Opinion in Behavioral Sciences
Journals -
Journal of Behavioral and Experimental Economics
Journals -
Journal of Contextual Behavioral Science
Journals -
Health Psychology and Behavioral Medicine
Journals -
Journal of Workplace Behavioral Health
Journals -
International Journal of Behavioral Medicine
Journals -
Behavioral and Social Sciences Librarian
Journals -
Integrative Psychological and Behavioral Science
Journals -
INTERNATIONAL JOURNAL OF BEHAVIORAL DEVELOPMENT
Journals -
Current Topics in Behavioral Neurosciences
Journals -
Advances in Learning and Behavioral Disabilities
Journals -
Hispanic Journal of Behavioral Sciences
Journals -
Current Behavioral Neuroscience Reports
Journals -
JOURNAL OF APPLIED BEHAVIORAL SCIENCE
Journals -
Journal of Emotional and Behavioral Disorders
Journals -
Journal of Developmental and Behavioral Pediatrics
Journals -
Journal of Psychopathology and Behavioral Assessment
Journals -
Journal of Behavioral and Cognitive Therapy
Journals -
Journal of Educational and Behavioral Statistics
Journals -
Current Research in Behavioral Sciences
Journals -
JOURNAL OF BEHAVIORAL DECISION MAKING
Journals -
Journal of Cognitive and Behavioral Psychotherapies
Journals -
SYSTEMS RESEARCH AND BEHAVIORAL SCIENCE
Journals -
Addictive Behaviors
Journals -
Eating Behaviors
Journals -
Selection of physiological parameters for optoelectronic system supporting behavioral therapy of autistic children
PublicationIn this article the procedure of selection of physiological parameters for optoelectronic system supporting behavioral therapy of autistic children is proposed. Authors designed and conducted an experiment in which a group of 30 health volunteers (16 females and 14 males) were examined. Under controlled conditions people were exposed to a stressful situation caused by the picture or sound (1kHz constant sound, which was gradually...
-
In vivoevaluation of the CB1allosteric modulator LDK1258 reveals CB1-receptor independent behavioral effects
PublicationIn the present study, we examined whether LDK1258, which produces strong CB1receptor allosteric effects ininvitroassays, would elicitin vivoeffects consistent with allosteric activity. In initial studies, LDK1258 reducedfood consumption and elicited delayed antinociceptive effects in the chronic constrictive injury of the sciaticnerve (CCI) model of neuropathic pain, which unexpectedly emerged 4 h post-injection. UPLC-MS/MS analysisquantified...
-
On a flexomagnetic behavior of composite structures
PublicationThe popularity of the studies is getting further on the flexomagnetic (FM) response of nano-electro-magneto machines. In spite of this, there are a few incompatibilities with the available FM model. This study indicates that the accessible FM model is inappropriate when considering the converse magnetization effect that demonstrates the necessity and importance of deriving a new FM relation. Additionally, the literature has neglected...
-
Trees as a solar control measure for southern-oriented street frontages. Analysis of a selected street model for a humid continental climate
PublicationThe present study is aimed at the analysis of possibilities for shading southern frontage of street oriented along the E-W axis by the single row of trees, parallel to the southern elevations. The effectiveness of solar control shading was tested depending on the geometric relationships between trees and buildings. Numerical simulation analyses were conducted in Rhinoceros® program for the street located in humid continental climate...
-
Assessment of damage to trees in the Herby Forestry District caused by glazed frosts and snow during severe weather in January 2010
Publication -
Narratives on cutting down trees on private land. A comparison of urban and rural municipalities in Poland using the Q-deliberation method
PublicationIncreased development in rural and urban areas leads to a decrease in tree cover and reduces the ecosystem services that trees provide. Municipal authorities must consider managing trees on private land to ensure that residents have access to trees and green spaces. In doing so, they must frequently confront conflicting stakeholder views, which are driven by diverse public and private interests and impacted by the type of landscape...
-
Behavioural categories of professionalism of nurses in Poland and Belarus: A comparative survey
Publication -
An upper bound for 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 γ_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
PublicationA 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
PublicationA 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
PublicationA 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
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...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA 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 Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublicationWe 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
PublicationWe 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.
-
BEHAVIOR GENETICS
Journals -
CYBERPSYCHOLOGY & BEHAVIOR
Journals -
BEHAVIOR THERAPY
Journals