Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 12

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  formula
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The existing formulae, like the well-known Penman-Monteith equation, used for calculating evapotranspiration are characterized by great differences concerning their results. These differences stem from the diversified climatic conditions and vegetation specifics during their development. Every formula of evapotranspiration only delivers 100% correct results, if it is used under the same climatic condition it was developed in. Therefore, a new method for calculating evapotranspiration via specific, but comparatively easily established formula was presented. After a theoretical introduction for illustrating some fundamental aspects for this work, the test setup and approach for creating these formulae are described in detail. The test set up considers typical climatic conditions and simulates, for example, the average temperature of Vienna, a summer day and an extremely hot day. While using a polynomial correlation, a formula for calculating evapotranspiration at any temperature is possible. For determining the evapotranspiration rate (in mm/m2 per 24 hours day) due to the presented formula, only temperature, sort of vegetation and technical soil has to be defined. As a result, the relevance of this work is the presentation of a method to determine the evapotranspiration of any technical substrates (used for e.g. green roofs, façade greenery, indoor greenery, raingardens…) with or without any kind of vegetation, while using the created formula.
4
Content available Some Parity Statistics in Integer Partitions
EN
We study integer partitions with respect to the classical word statistics of levels and descents subject to prescribed parity conditions. For instance, a partition with summands λ1≥⋯≥λk may be enumerated according to descents λi >λi+1 while tracking the individual parities of λi and λi+1. There are two types of parity levels, E=E and O=O, and four types of parity-descents, E>E, E>O, O>E and O>O, where E and O represent arbitrary even and odd summands. We obtain functional equations and explicit generating functions for the number of partitions of n according to the joint occurrence of the two levels. Then we obtain corresponding results for the joint occurrence of the four types of parity-descents. We also provide enumeration results for the total number of occurrences of each statistic in all partitions of n together with asymptotic estimates for the average number of parity-levels in a random partition.
PL
Wykazano, że umieszczony na rys. 9.2 w Eurokodzie 2 – część 1-1 wzór dotyczący elementu zginanego z niezerową siłą podłużną jest błędny. Przedstawiono wzór poprawny.
EN
Author demonstrates that the formula placed in fig. 9.2 in Eurocode 2 – Part 1-1 is wrong and shows the correct one (fig. 3 in the paper).
PL
W artykule przedstawiono badania dotyczące jakości pieczywa sporządzonego według różnych receptur, wypieczonego w domowym automacie do wypieku chleba. Materiał badawczy stanowiły bochenki chleba trzech grup receptur: firmowe z instrukcji do automatów, mieszanka handlowa, receptury własne. Poszczególne chleby wypiekano w automacie do wypieków pieczywa. Badane próbki pieczywa poddano badaniu sensorycznemu, fizykochemicznemu oraz ocenie punktowej. Oceniono skład surowcowy pieczywa do zastosowania w automacie.
EN
The article presents a study on the quality of breads made with different recipes, baked in a home bread machine. The experimental material comprised three groups of loaves of bread recipes: company of instructions to the machine, a mixture of commerce, own recipe. The various breads baked in the machine for baking bread. Test samples were subjected to sensory examination bread, physicalchemistry and score evaluation. Composition was evaluated for use in the bread machine.
PL
W artykule przedstawiono budowę modelu podsystemu optymalizacji formuł algebry algorytmów metodą wprowadzenia dodatkowego warunku. Podsystem opisany został w postaci formuły algebry algorytmów. Przeprowadzono dekompozycje podsystemu na unitermy funkcyjne i zmienne. Opisano modele unitermów funkcyjnych i przedstawiono fragment implementacji podsystemu w języku C#.
EN
The subsystem model designed for algorithm algebra formula optimization by the introducing the additional condition there is described in the paper. The theory description and the example of an application are shown in the section 2. Next the subsystem model decomposition into variables and functional uniterms, by the introducing the additional condition is realized. Variables are used for the storage of data needed for algorithm formula transformations. The construction of functional algorithms is described using algorithm algebra expressions. Functional algorithms perform the following tasks: initiate variables, set and release elements of the table retaining engaged conditions, and choose first free condition. The subsystem model contains functional uniterms used for the checking of the ability to transformation, as well as perform the optimization itself. The model allows to introduce the additional condition by two ways, automatically or manually. In automatic mode the system itself set variables, while in manual mode the user chooses conditions by the keyboard. The implementation of the subsystem model performing the optimization by the introducing the additional condition is shown in C # program language. In conclusions some advantages of the using of the algorithm formula optimization computer system are pointed out. Sources bounded with algorithm algebra are given in the bibliography.
8
Content available Model systemu do przekształceń formuł algorytmów
PL
W artykule przedstawiono budowę złożonego komputerowego systemu do przekształceń formuł algorytmów przy wykorzystaniu właściwości operacji algebry algorytmów. Budowany model systemu nazwano komputerowym systemem optymalizacji (KSO) i dokonano jego dekompozycji na dwóch poziomach, poziomie systemu i podsystemu. Na poziomie systemu w logiczny sposób wyodrębniono podsystemy pełniące oraz wspomagające zadania optymalizacji formuł algorytmów, a na poziomie podsystemu utworzono unitermy zmienne i funkcyjne. Dla opisania modelu systemu wykorzystano algebrę algorytmów. Fragment modelu systemu zaimplementowano w języku C#.
EN
The model of algorithm algebra formulae optimization system is presented in the paper. The decomposition of the system into subsystems is performed using algebra algorithm expressions, and is described in terms of the expressions. The following algorithm algebra operation optimization subsystem models are formed: sequencing, elimination, parallelization, reversing, cycle operations, basic subsystem, subsystem introducing additional condition, subsystem rendering data accessible, and the one generating indices for xml code of algorithm formula. The basic subsystem model and the rendering data accessible one in the 3rd section there are described. Algorithm algebra expressions there are used consistently. Models are composed of variables and functional uniterms, which are also used by other subsystems. Variables are used for the data storage. Functional uniterms of the basic subsystem there are the following: extracting, substituting the xml code fragment, checking the separator kind in the uniterm, as well as the one checking if the uniterm is a number. Additionally there are included functional uniterms absorbing other uniterms, and the one informing on optimization process run. The basic and rendering data models are implemented in C# . In conclusions some advantages of both the algorithm formula optimization computer system and model decomposition into subsystem are given. Bibliography contains a set of intuitive and formal works describing the algorithms algebra.
9
Content available Algebra algorytmów w przykładach
PL
Artykuł zawiera opis podstawowych operacji algebraicznych jakie można stosować w algorytmice. Przedstawiono kilka prostych przykładów ilustrujących możliwości i aplikacje tematyki. Każda operacja została odzwierciedlona w języku C, bądź została porównana z odpowiadającym jej schematem blokowym.
EN
Algebra of algorithms is a form of mathematical description of an algorithm. The algorithm described in form of formulas can be subjected to algebraic operations and transformations. Properties of these operations are defined in an axiomatic way. The mathematic description of the algorithm is simple, intuitive, and allows to subsequent automatic generation of program code. The main advantage of such approach is possibility to analyze the algorithm at any level of nesting. Some functions (blocks) the algorithm can be treated as uniterms, thus one can look into what happens inside them. A description of basic algebraic operations that can be applied in the study of algorithm operations is presented in the paper. It has been quoted two of the most elementary examples in order to better acquaint with the subject. Each operation is reflected in the C language, and is compared with the corresponding block diagram. Langton algorithm is analyzed as well as the function approximation algorithm for finding the 3-rd order polynomial. These algorithms are described and presented in the form of block diagrams as well as using formulas of algebra algorithms.
EN
This paper presents a comparison of three algorithms for assigning the drivelane gains: the longest queue algorithm, the relative longest queue algorithm and the most congested node algorithm. For the comparison two factor are specified: total waiting queue length vs. time and average waiting time vs. time.
11
Content available remote A theoretical model of the human eye based on ultrasound and corneal data
EN
The purpose of this study was to create a theoretical model of the eye based on a comparison of the real spherical equivalent of the eye and the calculated value of the axial refraction. The main contribution of this model is that it enables calculation of the equatorial plane of the lens for accurate assessment of the IOL position for a spherical eye model. The Gullstrand model of the eye was used as the source eye model and this was modified for the purposes of this study. The axial refraction of the final model of the eye was compared with the spherical equivalent. The accuracy of the developed model was statistically confirmed using statistic tests. Individual calculation of the axial refraction using it shows that IOL calculation is possible without any general statistical presumptions. It permits the calculation of variables with an accuracy accepted by inferential statistics. The accuracy of this theoretical eye model however, is limited by extreme values of variables - an extreme value provides a less accurate result.
12
Content available remote Uproszczone wzory na pojemność między kulami zewnętrznymi
PL
Przedstawiono sposób uzyskania kilku przybliżonych wzorów na pojemność dwóch kuł zewnętrznych oraz kuli naładowanej w sąsiedztwie kuli obojętnej, a także wzory na dokładne błędy towarzyszące wzorom uproszczonym.
EN
Method of to getting some simplified formulas for capacity of spheres and formulas for errors.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.