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

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

Journal: :Fractal and fractional 2022

This paper provides a unified framework for the admissibility of class singular fractional-order systems with given fractional order in interval (0, 2). These necessary and sufficient conditions are derived terms linear matrix inequalities (LMIs). The considered orders range from 0 to 2 without separating ranges into 1) [1, 2) discuss admissibility. Moreover, uncertain system is norm-bounded. q...

2009
BERNHARD H. HAAK

Volterra observations systems with scalar kernels are studied. New sufficient conditions for admissibility of observation operators are developed. The obtained results are applied to time-fractional diffusion equations of distributed order.

2008
Hai-Liang Lu

The admissibility condition of a mother wavelet is explored in the context of quantum optics theory. By virtue of Dirac’s representation theory and the coherent state’ property we derive a general formula for finding Mexican hat wavelets.

Journal: :Annals of Statistics 2022

Methods of merging several p-values into a single p-value are important in their own right and widely used multiple hypothesis testing. This paper is the first to systematically study admissibility (in Wald’s sense) p-merging functions domination structure, without any information on dependence structure input p-values. As technical tool, we use notion e-values, which alternatives recently prom...

Journal: :SIAM J. Numerical Analysis 2007
Ivan G. Graham Lars Grasedyck Wolfgang Hackbusch Stefan A. Sauter

In this paper we propose and analyse a new enhanced version of the panel-clustering algorithm for discrete boundary integral equations on polyhedral surfaces in 3D, which is designed to perform efficiently even when the meshes contain the highly stretched elements needed for efficient discretisation when the solution contains edge singularities. The key features of our algorithm are: (i) the em...

Journal: :IEEE Trans. Information Theory 2000
Junshan Zhang Edwin K. P. Chong

We study the admissibility and network capacity of imperfect power-controlled Code-Division Multiple Access (CDMA) systems with linear receivers in fading environments. In a CDMA system, a set of users is admissible if their simultaneous transmission does not result in violation of any of their Quality-of-Service (QoS) requirements; the network capacity is the maximum number of admissible users...

1998
James P. Hobert

Suppose that X is a random variable with density f(xj ) and that ( jx) is a proper posterior corresponding to an improper prior ( ). The prior is called P-admissible if the generalized Bayes estimator of every bounded function of is almost-admissible under squared error loss. Eaton (1992) showed that recurrence of the Markov chain with transition density R( j ) = R ( jx)f(xj )dx is a su cient c...

Journal: :IJWMIP 2008
Stephan Dahlke Gitta Kutyniok Peter Maass Chen Sagiv Hans-Georg Stark Gerd Teschke

Finding optimal representations of signals in higher dimensions, in particular directional representations, is currently the subject of intensive research. Since it might be difficult to obtain directional information by means of wavelets, several new representation systems were proposed in the past, including ridgelets, curvelets and, more recently, shearlets. In this paper we study and visual...

Journal: :journal of the iranian statistical society 0
shirin moradi zahraie hojatollah zakerzadeh

‎consider an estimation problem in a one-parameter non-regular distribution when both endpoints of the support depend on a single parameter‎. ‎in this paper‎, ‎we give sufficient conditions for a generalized bayes estimator of a parametric function to be admissible‎. ‎some examples are given‎. ‎

In this paper, the estimation of a scale parameter t under a new and bounded loss function, based on a reflection of the gamma density function, is discussed. The best scale-invariant estimator of tis obtained and the admissibility of all linear functions of the sufficient statistic, for estimating t in the absence of a nuisance parameter, is investigated

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

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

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"; } -->