نتایج جستجو برای: admissibility

تعداد نتایج: 1798  

2013
JUDICAEL DEGUENON ALINA BĂRBULESCU

In this article we analyze the admissibility and the exact observability of a body-beam system when the output is taken in a point of attachment from the beam to the body. The single output case chosen here is the practical measurement of the strength, its velocity or its moment. We prove the exact observability for the moment and the admissibility for the other cases. These results are obtaine...

Journal: :Int. J. Approx. Reasoning 2007
Matthias C. M. Troffaes

Various ways for decision making with imprecise probabilities—admissibility, maximal expected utility, maximality, E-admissibility, Γ-maximax, Γ-maximin, all of which are well-known from the literature—are discussed and compared. We generalize a well-known sufficient condition for existence of optimal decisions. A simple numerical example shows how these criteria can work in practice, and demon...

2017
Christoph Jansen Georg Schollmeyer Thomas Augustin

We introduce three different approaches for decision making under uncertainty, if (I) there is only partial (both cardinal and ordinal) information on an agent’s preferences and (II) the uncertainty about the states of nature is described by a credal set. Particularly, (I) is modeled by a pair of relations, one specifying the partial rank order of the alternatives and the other modeling partial...

2005
Luigi Sauro

This work studies how goal-directed agents can form profitable coalitions. A coalition is formed when some agents agree to cooperate for the achievement of a shared goal or to exchange with each other the achievement of their own goals. We define two criteria of admissibility that establish which coalitions can be formed under the assumption that agents are self-interested. The first admissibil...

2002
Hartmut Führ

Given a representation of a unimodular locally compact group, we discuss criteria for associated coherent state expansions in terms of the commuting algebra. It turns out that for those representations that admit such expansions there exists a unique finite trace on the commuting algebra such that the admissible vectors are precisely the tracial vectors for that trace. This observation is immed...

2006
Yuzo Maruyama Akimichi Takemura

Abstract: We give a sufficient condition for admissibility of generalized Bayes estimators of the location vector of spherically symmetric distribution under squared error loss. Compared to the known results for the multivariate normal case, our sufficient condition is very tight and is close to being a necessary condition. In particular we establish the admissibility of generalized Bayes estim...

2017
Lawrence D. Brown

The "procedures" discussed in this paper are of the following type: The statistician makes a conventional decision (in a multiple decision problem). He also provides a statement of the guaranteed conditional probability that his decision will be correct, given the observed value of some conditioning random variable. Various admissibility criteria to relate such procedures are proposed. For exam...

2014
Martin Caminada

The current document contains the proofs of the COMMA 2014 submission “Strong Admissibility Revisited” and should be read in conjunction with it.

Journal: :Logical Methods in Computer Science 2015
Leonardo Manuel Cabrer George Metcalfe

A new hierarchy of “exact” unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always h...

2014
Patryk Dziurosz-Serafinowicz

This paper shows how to apply a particular chance-credence principle, called the General Principle, to the case of two divergent level-relative chances of a given proposition in order to single out level-relative chance that should underpin one’s credence in that proposition. It is shown that the key move hinges on the use of admissibility clause in the GP. This principle is, then, tested again...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->