Informacja

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

Wyszukujesz frazę "BRANCH" wg kryterium: Temat


Tytuł:
Bakteriologiczne badanie czystości konwi mleczarskich
Bacteriologic examination of the cleanliness of milk cans
Autorzy:
Gruszczynski, T.
Grubner, M.
Powiązania:
https://bibliotekanauki.pl/articles/873433.pdf
Data publikacji:
1956
Wydawca:
Narodowy Instytut Zdrowia Publicznego. Państwowy Zakład Higieny
Tematy:
naczynia
mleczarstwo
mleko
higiena
woda destylowana
metody badan
dish
dairy branch
milk
hygiene
distilled water
test method
Źródło:
Roczniki Państwowego Zakładu Higieny; 1956, 07, 5
0035-7715
Pojawia się w:
Roczniki Państwowego Zakładu Higieny
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ł:
Target assignment problem for air raid
Autorzy:
Chudy, M.
Powiązania:
https://bibliotekanauki.pl/articles/205571.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
problem przyporządkowania adresów
air raid planning
assignment problem
branch-and-bound method
Opis:
The article deals with two formulations of the target assignment problem. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogencous collection of means. To describe this problem a new algebra is introduced
Źródło:
Control and Cybernetics; 1999, 28, 1; 101-113
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
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ł:
Metody oceny ekonomicznej i finansowej publicznych inwestycji w dziedzinie ochrony środowiska
Methods of economical and financial estimation of the public investments in environmental protection branch
Autorzy:
Rudnicki, Maciej
Powiązania:
https://bibliotekanauki.pl/articles/1817910.pdf
Data publikacji:
2005-12-31
Wydawca:
Uniwersytet Kardynała Stefana Wyszyńskiego w Warszawie
Tematy:
inwestycje w ochronie środowiska
inwestycje publiczne
usługi publiczne
Komisja Europejska
Europejski Bank Inwestycyjny
investments in environmental protection branch
public investments
public service
European Committee
European Investment Bank
Opis:
Nowadays, the realization of public, infrastructural investments in the area of environmental protection, is inseparably connected with financing them from various sources, public and private. The majority of funds which finance the investments like this, have very strict criterions of economical and financial evaluation of investment project. Although the public proecologic infrastructural investments concern the area of public services, they are treated like typical economical undertakings by financial institutions. Often , it turns out that well prepared and well organized undertaking does not meet the economical or financial demands of the fund which finances the investment. It is worth, then , to pay attention to some issues about criterions of economical and financial evaluation which are used in respect of public, infrastuctural, proecological investments. The author focused on criterions which are universal so that they recognized and used by many financial institutions and European Committee, European Investment Bank and National Fund of Environmental Protection and Water Economy.
Źródło:
Studia Ecologiae et Bioethicae; 2005, 3, 1; 329-338
1733-1218
Pojawia się w:
Studia Ecologiae et Bioethicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Aktualny stan i trendy w kuźnictwie światowym i europejskim
The present state-of-the-art and the trends in the world and European forging industry
Autorzy:
Szyndler, R.
Powiązania:
https://bibliotekanauki.pl/articles/211762.pdf
Data publikacji:
2006
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Obróbki Plastycznej
Tematy:
branża kuźnicza
rynek odkuwek
producent odkuwek
forging industry branch
market of forgings
producer of forgings
Opis:
W artykule omówiono aktualny stan światowego, europejskiego i krajowego przemysłu kuźniczego. Określono wielkość produkcji odkuwek swobodnych i matrycowanych 12 krajów europejskich. Scharakteryzowano krajowy przemysł kuźniczy i produkcję odkuwek swobodnych i matrycowanych w Polsce. Określono stan i główne kierunki rozwoju przemysłu kuźniczego na świecie oraz uwarunkowania rozwoju produkcji odkuwek na świecie i w Polsce na podstawie perspektywicznych wymagań odbiorców odkuwek.
The paper describes the present condition of the world, European and domestic forging industry. The magnitude of the production of blacksmith forgings and die forgings of 12 European countries has been defined. The domestic forging industry and the production of blacksmith and die forgings in Poland have been described. The state and main development directions of forging industry in the world have been presented. The conditions of the development of forging production in the world and in Poland have been determined basing on the predictable forging purchasers' requirements.
Źródło:
Obróbka Plastyczna Metali; 2006, 17, 3; 3-8
0867-2628
Pojawia się w:
Obróbka Plastyczna Metali
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Processes of concentration and cooperation in the dairy subcomplex
Autorzy:
Kretskaya, V.
Powiązania:
https://bibliotekanauki.pl/articles/573063.pdf
Data publikacji:
2006
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
concentration process
cooperation
dairy branch
economic efficiency
milk production
Belorussia
milk yield
modernization
management form
enterprise
dairy product
Opis:
The future of dairy branch belongs to major concerns producing milk, in which high parameters of milk yields are achieved and wider opportunities for modernization of production exist. Indisputable advantage of scale enjoyed by large production units over the small-sized ones is an objective law which has world recognition. Besides when reforming the branch it is necessary to create a range of large corporate enterprises which will be based on modern market relations and various forms of management. Various cooperation-integration structures are being created in the republic today. They unite several enterprises within the limits of one area, and the interregional and republican specialized complexes both.
Źródło:
Zeszyty Naukowe Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie. Problemy Rolnictwa Światowego; 2006, 14
2081-6960
Pojawia się w:
Zeszyty Naukowe Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie. Problemy Rolnictwa Światowego
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Coherent synthesis of heterogeneous system - an ant colony optimization approach
Autorzy:
Drabowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/93002.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
synthesis
scheduling
task
selection
resource coherent
ant colony
branch
bound
Opis:
The paper presents an innovative approach to solving the problems of computer system synthesis based on ant colony optimization method. We describe algorithm realizations aimed to optimize resource, selection and task scheduling, as well as the adaptation of those algorithms for coherent synthesis realization. We then present selected analytical experiments proving the correctness of the coherent synthesis concept and indicate its practical motivations.
Źródło:
Studia Informatica : systems and information technology; 2007, 2(9); 9-18
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applied a new method for multi-mode project scheduling
Autorzy:
Pisz, I.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/117890.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
project
project scheduling
resource-constrained project scheduling
project-driven
manufacturing
multi-mode
heuristic
branch and bound scheme
make-to-order
Opis:
The aim of this paper is to present a modelling heuristic framework that enables one to cope with a problem of a project-driven manufacturing. The objective is to find computationally effective method aimed at scheduling of a new project subject to constraints imposed by a multi-project environment. The application of a heuristic method of scheduling is demonstrated on one example of a makespan-feasible schedule that follows the constraints imposed by the precedence relation and by the time-constrained resources availability. This heuristic method is based on concept of critical path and branch and bound scheme.
Źródło:
Applied Computer Science; 2008, 4, 1; 114-123
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Configuring a sensor network for fault detection in distributed parameter systems
Autorzy:
Patan, M.
Uciński, D.
Powiązania:
https://bibliotekanauki.pl/articles/929887.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
metoda podziału i ograniczeń
ograniczony plan eksperymentu
układ o parametrach rozłożonych
detekcja uszkodzeń
estymacja parametryczna
rozmieszczanie czujników
branch-and-bound
constrained experimental design
distributed parameter system
fault detection
parameter estimation
sensor location
Opis:
The problem of fault detection in distributed parameter systems (DPSs) is formulated as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A computational scheme is provided for the design of a network of observation locations in a spatial domain that are supposed to be used while detecting changes in the underlying parameters of a distributed parameter system. The setting considered relates to a situation where from among a finite set of potential sensor locations only a subset can be selected because of the cost constraints. As a suitable performance measure, the Ds-optimality criterion defined on the Fisher information matrix for the estimated parameters is applied. Then, the solution of a resulting combinatorial problem is determined based on the branch-and-bound method. As its essential part, a relaxed problem is discussed in which the sensor locations are given a priori and the aim is to determine the associated weights, which quantify the contributions of individual gauged sites. The concavity and differentiability properties of the criterion are established and a gradient projection algorithm is proposed to perform the search for the optimal solution. The delineated approach is illustrated by a numerical example on a sensor network design for a two-dimensional convective diffusion process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 4; 513-524
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fungi colonizing shoots of common yew [Taxus baccata L.] in the Jagiellonian University Botanic Garden in Cracow
Grzyby zasiedlajace pedy cisa pospolitego [Taxus baccata L.] w Ogrodzie Botanicznym UJ w Krakowie
Autorzy:
Mirski, W
Powiązania:
https://bibliotekanauki.pl/articles/26767.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Botaniczne
Tematy:
needle
Taxus baccata
common yew
branch
disease symptom
fungi
yew
plant
Botanical Garden in Krakow
Opis:
The aim of the investigations was determination the reasons of dying down of needles and branches of common yew (Taxus baccata L.) in the park collection of Botanic Garden of Jagiellonian University in Cracow. The disease changes of infectious nature were observed on the examined plants’ parts. The changes’appearance, its location and extent were described in details. At fi rst the spots were brown colour with distinct hem. Then the needle and branch tissues were dying down. From end of May to July mass falling down of infesteted needles was observed. Mycological analysis of diseased tissues showed 34 fungi species. To the dominant species belonged: Alternaria alternata, Colletotrichum gloeosporioides, Fusarium spp., Pestalotiopsis guepinii, Phomopsis juniperivora and Zythiostroma pinastri. Common yew pathogens: Phomopsis juniperivora and Sclerophoma pityophila were found among the isolated fungi.
Badania miały na celu określenie przyczyn zamierania igieł i gałązek cisa pospolitego (Taxus baccata L.) w kolekcji Ogrodu Botanicznego UJ w Krakowie. Na badanych częściach roślin występowały zmiany chorobowe o charakterze infekcyjnym. Opisywano szczegółowo ich wygląd, zlokalizowanie i zasięg. Początkowo były to plamy brązowawo zabarwione z wyraźną obwódką. Następnie tkanki igieł i gałązek zamierały. Obserwowano też masowe opadanie porażonych igieł w okresie od końca maja do lipca. Przeprowadzona analiza mikologiczna chorych tkanek wykazała w nich obecność 34 gatunków grzybów, wśród których dominowały: Alternaria alternata, Colletotrichum gloeosporioides, Fusarium spp., Pestalotiopsis guepinii, Phomopsis juniperivora oraz Zythiostroma pinastri. W populacji wyizolowanych grzybów stwierdzono obecność patogenów cisa pospolitego, tj.: Phomopsis juniperivora i Sclerophoma pityophila.
Źródło:
Acta Agrobotanica; 2008, 61, 1
0065-0951
2300-357X
Pojawia się w:
Acta Agrobotanica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strategiczne rozwidlanie w tworzeniu Wolnego i Otwartego Oprogramowania
Strategic Forking in the Development of Free/Open-Source Software
Autorzy:
Konat, Grzegorz
Powiązania:
https://bibliotekanauki.pl/articles/574829.pdf
Data publikacji:
2008-10-31
Wydawca:
Szkoła Główna Handlowa w Warszawie. Kolegium Analiz Ekonomicznych
Tematy:
strategic forking
free/open-source software
software production branch
user-driven innovation
hackers’ ethic
public goods
operating system
Opis:
The paper discusses a trend in the development of computer software known as “strategic forking.” This trend is an intrinsic feature of today’s “open-source community,” according to Konat. To begin with, the article defines the term “source code” in reference to software” and it also explains the terms “open source” and “free software.” Moreover, it introduces the definition of Free/Open-Source Software (FOSS). In the following part of the article, Konat offers a microeconomic analysis of “strategic forking” to determine the motives guiding software engineers taking part in FOSS projects. The problem is discussed from the perspective of the theory of public goods, the demand-side approach to innovation, and other theories concerned with issues such as “hackers’ ethic” and “ego boosting.” Konat pays special attention to describing the “strategic forking” phenomenon with the use of classical microeconomic and enterprise theory tools developed by researchers Jean Tirole and Josh Lerner. The author follows up with a comprehensive analysis of strategic forking as a key to explaining a fundamental discrepancy in the assessment of the motives that guide programmers taking part in the development of open-source software. The analysis focuses on the definition of strategic forking, the conditions determining this trend and its direct causes. Konat also looks at the implications of strategic forking and the factors due to which this approach has not become more widespread around the world. The article closes with a review of issues that require further analysis, according to Konat. These include the issue of software distribution.
Źródło:
Gospodarka Narodowa. The Polish Journal of Economics; 2008, 227, 10; 23-43
2300-5238
Pojawia się w:
Gospodarka Narodowa. The Polish Journal of Economics
Dostawca treści:
Biblioteka Nauki
Artykuł

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