Search results for: TWEETS

• NUCLEAR DATA SHEETS

  Journals

  ISSN: 0090-3752 , eISSN: 1095-9904

• Water Needs of Sweet Cherry Trees in the Light of Predicted Climate Warming in the Bydgoszcz Region, Poland

  Publication

  • S. Rolbiecki
  • R. Rolbiecki
  • B. Jagosz
  • W. Kasperska-Wołowicz
  • E. Kanecka-Geszke
  • P. Stachowski
  • J. Kocięcka
  • B. Bąk

  - Atmosphere - Year 2023

  Full text to download in external service

• Forests Trees and Livelihoods

  Journals

  ISSN: 1472-8028

• Trees Forests and People

  Journals

  eISSN: 2666-7193

• TREES-STRUCTURE AND FUNCTION

  Journals

  ISSN: 0931-1890 , eISSN: 1432-2285

• Trees as a Shading System for Streets on the East–West Axis: Computer Simulations for the Selected Geometrical Proportions of Building Developments in Humid Continental Climate

  Publication

  • K. Zielonko-Jung
  • J. Janiak

  - Sustainability - Year 2019

  The study is aimed at investigating the possibilities for solar protection provided to the street canyon located on the E–W axis and with the following profiles: shallow (height/width (H/W) = 0.2, 0.6, and 1) and deep (H/W = 2) by two rows of trees located at a distance of 3 m away from southern and northern façades. The research was based on numerical simulation analyses conducted in the Rhinoceros® program, with the application...

  Full text available to download

• Paired bondage in trees

  Publication

  • J. Raczek

  - DISCRETE MATHEMATICS - Year 2008

  W 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.

  Full text to download in external service

• On the partition dimension of trees

  Publication

  • J. A. Rodriguez-Velazguez
  • I. G. Yero
  • M. Lemańska

  - DISCRETE APPLIED MATHEMATICS - Year 2014

  Given 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...

  Full text available to download

• Preserving Trees in Automata

  Publication

  • J. Daciuk

  - Year 2015

  We 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.

  Full text to download in external service

• Twenty five years of the School of Hydraulics

  Publication

  • T. Jarzębińska

  - Year 2005

  Podsumowano dorobek naukowy 25 lat Ogólnopolskiej Szkoły Hydrauliki. Przedstawiono historię szkoły, tematykę naukową, wycieczki studialne i inne formy aktywności. Przypomniano również rozwój karier naukowych uczestników Szkół.