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ę "probabilistic" wg kryterium: Temat


Tytuł:
A Typology of Polish Farms Using Probabilistic D-Clustering
Autorzy:
Młodak, Andrzej
Kubacki, Jan
Powiązania:
https://bibliotekanauki.pl/articles/465786.pdf
Data publikacji:
2010
Wydawca:
Główny Urząd Statystyczny
Tematy:
probabilistic dclustering
Opis:
The Agricultural Census conducted in Poland in 2010 was partially based on administrative sources. These data collection will be supplemented by sample survey of agricultural farm. This research is aimed at creation of an effective typology of Polish farms, which is necessary for proper sampling and reflection of many special types of agricultural activity, such as combining it with non. agricultural work. We propose some universal form of such typology constructed using data collected from administrative sources during the preliminary agricultural census conducted in autumn 2009. It is based on the especially prepared method of fuzzy clustering, i.e. probabilistic d-clustering adopted for interval data. For this reason, and because of an ambiguous impact of some key variables on classification, relevant criterions are presented as intervals. They are arbitrarily established, but also - as an alternative way - are generated endogenically, using an original optimization algorithm. For a better comparison, relevant classification for data collected “from nature” is provided.
Źródło:
Statistics in Transition new series; 2010, 11, 3; 187-210
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling and control of an unstable system using probabilistic fuzzy inference system
Autorzy:
Sozhamadevi, N.
Sathiyamoorthy, S.
Powiązania:
https://bibliotekanauki.pl/articles/229309.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
inverted pendulum and cart system
probabilistic fuzzy set
probabilistic fuzzy relation
probabilistic fuzzy inference system
probabilistic fuzzy logic controller
Opis:
A new type Fuzzy Inference System is proposed, a Probabilistic Fuzzy Inference system which model and minimizes the effects of statistical uncertainties. The blend of two different concepts, degree of truth and probability of truth in a unique framework leads to this new concept. This combination is carried out both in Fuzzy sets and Fuzzy rules, which gives rise to Probabilistic Fuzzy Sets and Probabilistic Fuzzy Rules. Introducing these probabilistic elements, a distinctive probabilistic fuzzy inference system is developed and this involves fuzzification, inference and output processing. This integrated approach accounts for all of the uncertainty like rule uncertainties and measurement uncertainties present in the systems and has led to the design which performs optimally after training. In this paper a Probabilistic Fuzzy Inference System is applied for modeling and control of a highly nonlinear, unstable system and also proved its effectiveness.
Źródło:
Archives of Control Sciences; 2015, 25, 3; 377-396
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determining transition probabilities in probabilistic algotithms
Wyznaczanie prawdopodobieństw przejść w algorytmach probabilistycznych
Autorzy:
Borowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/341029.pdf
Data publikacji:
2002
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
algorytm probabilistyczny
program probabilistyczny
probabilistic algorithm
probabilistic programme
Opis:
The main problem of the paper is related to the algebraic method for determining transition probabilities in probabilistic algorithms interpreted in finite structures. The correctness of this method is based on a lemma stating that the determinant of a matrix (being of a special form) is different from zero. The paper contains two proofs of this lemma, formulated without a proof in [3].
Poniższa praca zawiera dwa dowody lematu opublikowanego w pracy [3] bez dowodu. Algebraiczny fakt rozważany w lemacie jest punktem wyjściowym dla metody wyznaczania prawdopodobieństw przejść w iteracyjnych algorytmach probabilistycznych interpretowanych w skończonych dziedzinach. Dotyczy on niezerowości wyznacznika macierzy o pewnej specyficznej postaci.
Źródło:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2002, Z.1; 7-19
1644-0331
Pojawia się w:
Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving modified policy iteration for probabilistic model checking
Autorzy:
Mohagheghi, Mohammadsadegh
Karimpour, Jaber
Isazadeh, Ayaz
Powiązania:
https://bibliotekanauki.pl/articles/27312850.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
probabilistic model checking
Markov decision processes
modified policy iteration
probabilistic reachability
Opis:
Along with their modified versions, value iteration and policy iteration are well-known algorithms for the probabilistic model checking of Markov decision processes. One challenge with these methods is that they are time-consuming in most cases. Several techniques have been proposed to improve the performance of iterative methods for probabilistic model checking; however, the running times of these techniques depend on the graphical structure of the utilized model. In some cases, their performance can be worse than the performance of standard methods. In this paper, we propose two new heuristics for accelerating the modified policy iteration method. We first define a criterion for the usefulness of the computations of each iteration of this method. The first contribution of our work is to develop and use a criterion to reduce the number of iterations in modified policy iteration. As the second contribution, we propose a new approach for identifying useless updates in each iteration. This method reduces the running time of the computations by avoiding the useless updates of states. The proposed heuristics have been implemented in the PRISM model checker and applied on several standard case studies. We compare the running time of our heuristics with the running times of previous standard and improved methods. Our experimental results show that our techniques yields a significant speed-up.
Źródło:
Computer Science; 2022, 23 (1); 63--80
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On -independence in graphs
Autorzy:
Göring, Frank
Harant, Jochen
Rautenbach, Dieter
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/744400.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independence
complexity
probabilistic method
Opis:
Let be a set of graphs and for a graph G let $α_{}(G)$ and $α*_{}(G)$ denote the maximum order of an induced subgraph of G which does not contain a graph in as a subgraph and which does not contain a graph in as an induced subgraph, respectively. Lower bounds on $α_{}(G)$ and $α*_{}(G)$ are presented.
Źródło:
Discussiones Mathematicae Graph Theory; 2009, 29, 2; 377-383
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling and analysis of probabilistic real-time systems through integrating event-b and probabilistic model checking
Autorzy:
Debbi, Hichem
Powiązania:
https://bibliotekanauki.pl/articles/27312896.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
event-B
probabilistic event-B
real-time probabilistic model checking
PTA
PRISM
Opis:
Event-B is a formal method that is used in the development of safety-critical systems; however, these systems may introduce uncertainty and also need to meet real-time requirements, which make the modeling and analysis of such systems a challenging task. While some works exist that try to extend Event-B with probability and over time, they fail to address both in a single framework. Besides, these works mainly addressed extending the language itself, not integrating extended Event-B with verification. In this paper, we aim to represent both probability and time in the Event-B language, and we will show how such a representation can be automatically translated into the probabilistic timed automata (PTA) that are described in the language of the PRISM probabilistic model checker. This transformation approach would allow us to analyze the probabilistic and time-bounded probabilistic reachability properties of probabilistic real-time systems through probabilistic timed CTL (PTCTL) logic.
Źródło:
Computer Science; 2022, 23 (4); 545--570
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient method for calculating system non-probabilistic reliability index
Autorzy:
Liu, Hui
Xiao, Ning-Cong
Powiązania:
https://bibliotekanauki.pl/articles/2038190.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
non-probabilistic model
non-probabilistic reliability index
system reliability
implicit function
Kriging model
Opis:
Collecting enough samples is difficult in real applications. Several interval-based non-probabilistic reliability methods have been reported. The key of these methods is to estimate system non-probabilistic reliability index. In this paper, a new method is proposed to calculate system non-probabilistic reliability index. Kriging model is used to replace time-consuming simulations, and the efficient global optimization is used to determine the new training samples. A refinement learning function is proposed to determine the best component (or performance function) during the iterative process. The proposed refinement learning function has considered two important factors: (1) the contributions of components to system nonprobabilistic reliability index, and (2) the accuracy of the Kriging model at current iteration. Two stopping criteria are given to terminate the algorithm. The system non-probabilistic index is finally calculated based on the Kriging model and Monte Carlo simulation. Two numerical examples are given to show the applicability of the proposed method.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 3; 498-504
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Translation of probabilistic games in J2TADD
Translacja gier probabilistycznych w J2TADD
Autorzy:
Rataj, A.
Powiązania:
https://bibliotekanauki.pl/articles/375653.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
model checking
Java
probabilistic game
Opis:
A new version of J2TADD - a translator from Java to automatons- is described, which adds support for a translation of Markov processes with non-dcterministic players, that can form coalitions, which in turn strive for different aims. In order to ease the definition of a probabilistic game using a plain Java application, several new constructs, and also a special library, are supported within the input language.Ranges on variables or on expressions can be defined, what helps in checking the self-consistency of a model, and can also make the solving of the model faster.
Artykuł prezentuje nową wersję translatora J2TADD. Dodane zostało tłumaczenie procesów markowowskich z niedelerministycznymi graczami, mogącymi formować koalicje mające różne cele. By ułatwić pisanie gier probabilistycznych dodane zostało kilka specyficznych dla gier konstrukcji, jak również specjalna biblioteka. Aktualnej wersja posiada również kilka innych usprawnień: ● wybory, które są zwykłymi wyrażeniami języka Java, jednak hc tłumaczy je na specyficzne dla automatów rozgałęzienia probabilistyczne lub niedeterministyczne; ● można definiować dopuszczalne wartości zmiennych, co pomaga w sprawdzaniu wewnętrznej spójności modelu, a także może przyspieszyć jego rozwiązanie; ● różne metody specyfikacji niezmienników i warunków zegarowych. Artykuł prezentuje jako przykład prostą grę probabilistyczną, modelującą rynek lokalnego dostawcy energii elektrycznej. W ramach przykładu omawiane są wersje automatów do rozwiązywania metodą analityczną i symulacyjną.
Źródło:
Theoretical and Applied Informatics; 2013, 25, 3-4; 157-182
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Structural analysis for ships in arctic conditions
Autorzy:
Ehlers, S.
Powiązania:
https://bibliotekanauki.pl/articles/135490.pdf
Data publikacji:
2017
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
probabilistic ice loads
mission-based design
damage mitigation
low temperature response
probabilistic approach
collision scenario
Opis:
Ships are operating in regions with seasonal ice coverage outside the Baltic Sea. Due to the lack of experience operating in regions such as the Arctic Sea, existing design guidelines may not lead to reliable and safe ships. This article summarises regulatory aspects of ship design for ice-covered waters, focusing on structural compliance and design ice load determination. The latter will be obtained using a probabilistic approach and compared to the current rule-based load. Based on the discrepancy and the existence of ice induced damage, different measures aimed at mitigating damage are presented. Furthermore, the influence of sub-zero temperature (SZT) in a collision scenario on the material response is presented.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2017, 52 (124); 9-18
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of real underkeel clearance for Świnoujście–Szczecin waterway in years 2009-2011
Autorzy:
Schoeneich, M.
Sokołowska, S.
Powiązania:
https://bibliotekanauki.pl/articles/360553.pdf
Data publikacji:
2012
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
real data
probabilistic model
underkeel clearance
Opis:
The paper presents the practical using of model for underkeel clearance evaluation. Real data from Maritime Office concerning ships which enter ports was used to analysis of results first probabilistic model of underkeel clearance and next integrated system. During analysis mean probability that underkeel clearance will be less than zero was determined for ports in Świnoujście, Szczecin and Police. Results of this analysis can be used for further research connected with integrated system for underkeel clearance calculation.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 32 (104) z. 2; 162-166
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Diffusion in Networks
Autorzy:
Kasprzak, R.
Powiązania:
https://bibliotekanauki.pl/articles/309179.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
complex network
diffusion
probabilistic finitestate machine
Opis:
In this paper a concept of method and its application examining a dynamic of diffusion processes in networks is considered. Presented method was used as a core framework for system CARE (Creative Application to Remedy Epidemics).
Źródło:
Journal of Telecommunications and Information Technology; 2012, 2; 99-106
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic methodologies for reliability and probabilistic risk assessment (PRA)
Autorzy:
Aldemir, T.
Powiązania:
https://bibliotekanauki.pl/articles/2069563.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
reliability
dynamic methodologie
probabilistic risk assessment
Opis:
Dynamic methodologies in reliability and PRA are those that explicitly account for the time element in probabilistic system evolution. Dynamic methodologies are usually needed when the system has more than one failure mode, control loops, and/or hardware/process/ software/human interaction. An overview of the dynamic methodologies proposed to date is given, including those that use dynamic event tree generation, continuous time-state space representation, the cell-to-cell mapping technique and graphical schemes. The use of dynamic methodologies for state/parameter estimation in on-line applications is also discussed. Potential on-line use of dynamic methodologies as operator assistance tools for risk informed accident management or normal operation is described and illustrated.
Źródło:
Journal of Polish Safety and Reliability Association; 2008, 1; 7--12
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Probabilistic Scheme with Uniform Correlation Structure
Autorzy:
Calabrese, Raffaella
Powiązania:
https://bibliotekanauki.pl/articles/465800.pdf
Data publikacji:
2013
Wydawca:
Główny Urząd Statystyczny
Tematy:
probabilistic scheme
uniform correlation
binary event
Opis:
The probabilistic schemes with independence between the trials show different dispersion characteristics depending on the behaviour of the probabilities of the binary event in the trials. This work proposes a probabilistic scheme with uniform correlation structure that leads to different dispersion characteristics depending on the sign of the linear correlation. Finally, a hypothesis test is proposed to identify the type of the dispersion of the probabilistic scheme.
Źródło:
Statistics in Transition new series; 2013, 14, 1; 129-138
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metropolis-Hastings method for Wohler curve parameter identification
Autorzy:
Woch, M.
Corbetta, M.
Giglio, M.
Sbarufatti, C.
Kamiński, G.
Powiązania:
https://bibliotekanauki.pl/articles/2069517.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
Wohler curve
Metropolis-Hastings
probabilistic fatigue
Opis:
In this work, the Metropolis-Hastings sampling technique has been used for the parameter identification of Wohler curve of aluminium alloy 2024-T4. The Metropolis-Hasting algorithm is one of the most widespread Markov chain Monte Carlo methods for posterior distribution estimation, and it is presented with an adaptive formulation to estimate the probability density functions of Wohler parameters. Results are presented in terms of distribution shape and parameter correlations. The information about parameter distributions of Wohler equation is useful to prepare risk analyses based on statistical safe life approach.
Źródło:
Journal of Polish Safety and Reliability Association; 2014, 5, 2; 143--150
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
How much truth is in stereotypes?
Autorzy:
Czarnik, Szymon
Powiązania:
https://bibliotekanauki.pl/articles/691332.pdf
Data publikacji:
2020
Wydawca:
Copernicus Center Press
Tematy:
stereotypes
stereotype accuracy
epistemology
probabilistic approach
Opis:
Stereotype accuracy is a contentious topic. Part of the problem is that typically stereotypes are generic statements whose truth status is unclear due to the fact that they are ill-defined quantitatively. The article focuses on the epistemic aspect of stereotypical beliefs. In the ongoing debate, I side with those who argue against stereotypes being wrong or inaccurate by virtue of definition alone. I propose that, when possible, stereotype accuracy should be assessed in probabilistic terms by inspecting how likely a generic statement is to be true when applied to individual(s) representative of the relevant group(s). This approach applies equally well to investigating the actual and the perceived accuracy of stereotypes.
Źródło:
Zagadnienia Filozoficzne w Nauce; 2020, 68; 243-279
0867-8286
2451-0602
Pojawia się w:
Zagadnienia Filozoficzne w Nauce
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