Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "BRANCH" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 155
Tytuł:
Branch-Weight Unique Trees
Autorzy:
Shang, Jen-Ling
Powiązania:
https://bibliotekanauki.pl/articles/32361727.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
branch-weight
branch-weight sequence
branch-weight unique
tree
spider
Opis:
A branch at a vertex x in a tree is a maximal subtree containing x as an endvertex. The branch-weight of x is the maximum number of edges in any branch at x. The branch-weight sequence of a tree is the multiset consisting of the branch-weights of all vertices arranged in nonincreasing order. Non-isomorphic trees may have the same branch-weight sequence. A tree T is said to be branch-weight unique in a family of trees if T is uniquely determined in the family by its branch-weight sequence. A spider is a tree in which exactly one vertex has degree exceeding two. It is known that spiders are branch-weight unique in the family of spiders but not in the family of all trees. In this study, a necessary and sufficient condition is obtained whereby a spider may be branch-weight unique in the family of all trees. Moreover, two types of trees are proposed to be branch-weight unique in the family of all trees.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 405-416
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of performance for the DIRECT global optimization algorithm
Analiza działania algorytmu optymalizacji globalnej DIRECT
Autorzy:
Borowik, P.
Chwastek, K.
Powiązania:
https://bibliotekanauki.pl/articles/159401.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
Tematy:
algorithm "branch-and-bound"
optimization
simulations
algorytm "branch-and-bound"
optymalizacja
symulacje
Opis:
The usefulness of the "branch-and-bound" algorithm for solving chosen optimization problems is considered in the paper. Simulations have been carried out for chosen benchmark tasks with different complexity and number of dimensions.
W pracy dokonano oceny użyteczności algorytmu "branch-and-bound" do rozwiązywania wybranych zadań optymalizacji. Przeprowadzono symulacje dla wybranych zadań testowych o różnej złożoności i liczbie wymiarów.
Źródło:
Prace Instytutu Elektrotechniki; 2016, 273; 55-62
0032-6216
Pojawia się w:
Prace Instytutu Elektrotechniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Autorzy:
Yan, Zheng
Powiązania:
https://bibliotekanauki.pl/articles/31340783.pdf
Data publikacji:
2016-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
spanning tree
stem
branch vertex
Opis:
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T). The subtree T − Leaf(T) of T is called the stem of T and denoted by Stem(T). In this paper, we give two sufficient conditions for a connected graph to have a spanning tree whose stem has a bounded number of branch vertices, and these conditions are best possible.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 3; 773-778
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Historia Oddziału Szczecińskiego Polskiego Towarzystwa Geologicznego
History of the Szczecin Branch of the Polish Geological Society
Autorzy:
Piotrowski, Andrzej
Sydor, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2074313.pdf
Data publikacji:
2022
Wydawca:
Państwowy Instytut Geologiczny – Państwowy Instytut Badawczy
Tematy:
Oddział Szczecin
Polskie Towarzystwo Geologiczne
historia oddziału
Szczecin Branch
Polish Geological Society
branch history
Opis:
The Szczecin Branch of the Polish Geological Society was established on 24th April 1959, initially as the Szczecin Circle. The organizational meeting was held at the Science Workers Club of the Szczecin University of Technology. There were 14 founders. The first Chairman was Eugeniusz Kozioł. On 12th. September 1971, the Szczecin Circle was transformed into the Szczecin Branch. The Szczecin Branch was the organizer of four Polish Geological Society annual meeting - in Szczecin (years 1983 and 2010), in Międzyzdroje (1999) and in Koszalin (2017). Scientific meetings of the members were carried out once a month. Almost every year, field conferences were held around Western Pomerania, Mecklenburg and Brandenburg.
Źródło:
Przegląd Geologiczny; 2022, 70, 4; 314--318
0033-2151
Pojawia się w:
Przegląd Geologiczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Behavior of Steel Branch Connections during Fatigue Loading
Autorzy:
Sládek, A.
Patek, M.
Mičian, M.
Powiązania:
https://bibliotekanauki.pl/articles/353905.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
branch connection
stress analysis
fatigue bending test
Opis:
Fatigue behavior of the branch connection made of low-alloyed steel with yield stress of 355 MPa during low-cycle bending test is investigated in the article. Numerical prediction of the stress and strain distribution are described and experimentally verified by fatigue test of the branch connection sample. Experimental verification is based on low-cycle bending testing of the steel pipes welded by manual metal arc process and loaded by external force in the appropriate distance. Stresses and displacement of the samples induced by bending moment were measured by unidirectional strain gauges and displacement transducers. Samples were loaded in different testing levels according to required stress for 2.106 cycles. Increase of the stress value was applied until the crack formation and growth was observed. Results showed a high agreement of numerical and experimental results of stress and displacement.
Źródło:
Archives of Metallurgy and Materials; 2017, 62, 3; 1597-1601
1733-3490
Pojawia się w:
Archives of Metallurgy and Materials
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Prawo żywnościowe jako nowa dziedzina prawa
Food law as a new branch of law
Autorzy:
Korzycka, Małgorzata
Wojciechowski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/953047.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet w Białymstoku. Wydawnictwo Temida 2
Tematy:
food law
branch of law
food safety
Opis:
Food law is currently starting to separate itself as a new branch of law. It is gaining autonomy owing to its particular object of regulation, that is food, which requires a special system of protection; therefore the ‚product-oriented’ nature of this law must be emphasized. Nowadays, the purpose of food law is to protect health and life of human beings (food safety), as well as economic interests of consumers, the wellbeing of farm animals, the health of plants and of the natural environment. Food law worldwide has been developing since ancient times, and in Poland - since the Middle Ages. Following Poland’s accession to the European Union, it has been to a large extent unified with the EU laws. Food law is an academically separate area, it is taught at law departments of universities, numerous Master’s or Ph.D.’s theses have been devoted to this subject, as well as a habilitation thesis. The development of food law is clearly destined toward codification, whose weakness would be to consolidate the current regulatory loopholes. All the more so, codification is not currently possible under national legislation.
Źródło:
Studia Iuridica Agraria; 2016, 14; 275-296
1642-0438
Pojawia się w:
Studia Iuridica Agraria
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Właściwości programowej realizacji zadania programowania całkowitoliczbowego
Look-and-feel realization of integer programming problems
Autorzy:
Ostanin, A.
Wasiluk, J.
Powiązania:
https://bibliotekanauki.pl/articles/341141.pdf
Data publikacji:
2008
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
programowanie całkowitoliczbowe
metoda gałęzi i granic
decyzja o rozgałęzieniu
integer programming
branch-and-bound method
deciding whether to branch
Opis:
Praca poświęcona jest problemom realizacji nowej optymalizacyjnej funkcji bintprog jako nieodłącznej części Optimization Toolbox 3.0 programowego pakietu MATLAB 7. Wprowadzenie nowej funkcji istotnie poszerza skalę rozwiązywanych optymalizacyjnych zadań, ponieważ potwierdza fakt realizowania metody gałęzi i granic. Badanie tej metody wchodzi w skład programu wielu uczelnianych kursów i daje podstawędo rozwiązywania większości zadań programowania całkowitoliczbowego. Na zakończenie podano przykłady niektórych reprezentatywnych wyników uzyskanych w badaniach.
The paper is dedicated to the problems of realization a new optimization function bintprog as inseparable part of Optimization Toolbox 3.0, pack MATLAB 7. Introduction of the new function essentially extends the scale of optimization assignments that should be solved, because it confirms the fact of realizing the branch-and-bound method. Investigation of this methods is included in many of educational courses and gives base to solving most of integer programming problems. Some representative results of tests are given at the end of the paper.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2008, 3; 97-110
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907991.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
survivable networks
ATM
branch and bound algorithm
Opis:
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 257-267
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A branch&bound algorithm for solving one-dimensional cutting stock problems exactly
Autorzy:
Scheithauer, Guntram
Terno, Johannes
Powiązania:
https://bibliotekanauki.pl/articles/1340291.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
rounding
cutting stock problem
branch&bound
integer optimization
Opis:
Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP.
Źródło:
Applicationes Mathematicae; 1995-1996, 23, 2; 151-167
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An exact algorithm for design of content delivery networks in MPLS environment
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/308183.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
content delivery network
optimization
branch-and-cut algorithm
Opis:
Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 2; 13-22
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm improvement in divisible load scheduling with result collection on heterogeneous systems by new heuristic function
Autorzy:
Fard, F. N.
Mohammadi, S.
Parvizi, P.
Powiązania:
https://bibliotekanauki.pl/articles/385127.pdf
Data publikacji:
2012
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
divisible load scheduling
heterogeneous systems
branch and bound algorithm
Opis:
In this paper we propose a new heuristic function for branch and bound algorithm. By this function we can increase the efficiency of branch and bound algorithm. Divisible loads represent computations which can be arbitrarily divided into parts and performed independently parallel. The scheduling problem consists in distributing the load in a heterogeneous system taking into account communication and computation times, so that the whole processing time is as short as possible. Since our scheduling problem is computationally hard, we propose a branch & bound algorithm. By simulating and comparing results it is observed which this result produces better answers than other methods, it means that branch and bound algorithm have less total average of relative error percentage in the variety Heuristic functions.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2012, 6, 3; 47-50
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of Changes in the Branch and Educational Structure of the Labour Force in the Czech Republic with an Emphasis on Manufacturing and Services
Autorzy:
Šerý, Ondřej
Toušek, Václav
Powiązania:
https://bibliotekanauki.pl/articles/439119.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie
Tematy:
labour force
branch structure
educational structure
transformation
Czech Republic
Opis:
This paper deals with the evaluation of changes in the labour force in the Czech Republic after 1989 and focuses on the branch and educational structure. The changes are also compared with processes in other countries of Central Europe. In the late 1980s the employment rate by sectors of the economy was different in Central European countries when compared with the situation in Western countries. Even subsequent transformation did not change the high share of industry and construction in total employment in the Czech Republic and Slovakia or a lower share of services. Within the manufacturing industry two stages can be distinguished. In the nineties, the majority of branches experienced a decrease in employment, whereas in the first decade of the 21st century stagnation or even reindustrialization occurred, especially when the branches associated with the automotive industry grew (other branches continued to decline). At the regional level, a diversification process was taking place all the time, if you like the transition from the specialization to the diversification. The importance of education is constantly increasing and the number of people with secondary education with GCE and tertiary education is growing. The relationship between the unemployment rate in districts of the Czech Republic and the share of employed people with tertiary education intensifies. The tertiary sector shows the highest level of education (in some branches of services more than onethird of employed has a tertiary education).
Źródło:
Prace Komisji Geografii Przemysłu Polskiego Towarzystwa Geograficznego; 2013, 22; 133-146
2080-1653
Pojawia się w:
Prace Komisji Geografii Przemysłu Polskiego Towarzystwa Geograficznego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On branchwise commutative pseudo-BCH algebras
Autorzy:
Walendziak, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/747105.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
(Pseudo-)BCK/BCI/BCH-algebra
atom
branch
branchwise commutativity
Opis:
Basic properties of branches of pseudo-BCH algebras are described. Next, the concept of a branchwise commutative pseudo-BCH algebra is introduced. Some conditions equivalent to branchwise commutativity are given. It is proved that every branchwise commutative pseudo-BCH algebra is a pseudo-BCI algebra.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica; 2017, 71, 2
0365-1029
2083-7402
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
POJĘCIE LINII REDAKCYJNEJ ORAZ POSZUKIWANIE JEJ OBRAZU W POLSKIEJ OPINII PUBLICZNEJ I CZASOPIŚMIE BRANŻOWYM W 2017 ROKU
THE CONCEPT OF AN EDITORIAL LINE AND THE SEARCH FOR ITS IMAGE IN POLISH PUBLIC OPINION AND A TRADE MAGAZINE IN 2017
Autorzy:
Furman, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/513152.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Rzeszowski. Wydawnictwo Uniwersytetu Rzeszowskiego
Tematy:
Editorial line,
journalistic social roles,
public opinion,
branch magazine
Opis:
The press law requires the journalist to follow the editorial line. However, attempts to find a clearly formulated editorial line, sought after on the websites of press titles, did not provide unequivocal results. Public opinion polls were only indirectly related to the editorial line. Therefore, the statements of journalists remained to be examined. They have been referred to four normative journalistic social roles. Most often, the role of the reporter and advocate was mentioned, and the role of a debater or moderator of the discussion was the least frequently stated.
Źródło:
Polityka i Społeczeństwo; 2018, 16, 3; 81-94 (13)
1732-9639
Pojawia się w:
Polityka i Społeczeństwo
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 155

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies