نتایج جستجو برای: lifting problem

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

2008
HOWARD A. MASUR YAIR N. MINSKY

In this paper we continue our geometric study of Harvey’s Complex of Curves [12], a finite dimensional and locally infinite complex C(S) associated to a surface S, which admits an action by the mapping class group Mod(S). The geometry and combinatorics of C(S) can be applied to study grouptheoretic properties of Mod(S), and the geometry of Kleinian representations of π1(S). In [19] we showed th...

1999
Juan Jos e Salazar

The generalized steiner tree problem (GSTP) is a variant of the classical Steiner tree problem (STP), in which a family of node clusters is given and the tree must span at one node for each cluster. This note introduces a lifting procedure for obtaining polyhedral information on GSTP from polyhedral results of STP. New classes of facet-de ning inequalities are presented. ? 2000 Elsevier Science...

2010
R. Barták D. Toropila

Planning problems deal with finding a sequence of actions that transfer the initial state of the world into a desired state. Frequently such problems are solved by dedicated algorithms but there exist planners based on translating the planning problem into a different formalism such as constraint satisfaction or Boolean satisfiability and using a general solver for this formalism. This paper de...

2006
Shigeru Takano Koichi Niijima

This paper produces a person authentication system using learned lifting dyadic wavelet filters. Our system has the capability of identifying persons whose facial image is changed the size and angle of an original image. The learning algorithm is done by training free parameters in the lifting filters so as to maximize the cosine between a vector whose components are the lifting filters and a v...

Journal: :Sig. Proc.: Image Comm. 2005
Nan Zhang Yan Lu Feng Wu Baocai Yin

In this paper, a new multiple description image coding scheme using directional lifting transform is proposed. The basic idea is to divide an image into two descriptions with quincunx segmentation. The traditional spatial domain multiple description image coding techniques usually result in the very low coding efficiency. To tackle this problem, we propose a directional lifting technique to ext...

Journal: :Scientific Papers Collection of the Angarsk State Technical University 2020

1999
Arun K. Tangirala Dongguang Li Rohit Patwardhan Sirish L. Shah Tongwen Chen

Multirate systems are encountered when some signals of interest are sampled at a di erent rate than others. For example, in the process industry, composition measurements in distillation columns are typically sampled at a slower rate than temperatures and ow rates. In the context of closed-loop control, such multirate systems pose a challenging problem due to several reasons such as increased c...

2009
Eugenio Moggi

The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of this approach is that the operations associated to the pre-existing monad need to be lifted to the new monad. In a companion paper by Jaskelioff, the lifting problem has been addressed in the setting of system Fω. Her...

2007
David R. Kohel

The problem of constructing CM invariants of higher dimensional abelian varieties presents significant new challenges relative to CM constructions in dimension 1. Algorithms for p-adic canonical lifts give rise to very efficient means of constructing high-precision approximations to CM points on moduli spaces of abelian varieties. In particular, algorithms for 2-adic and 3-adic lifting of Frobe...

2016
Yohei Hosoe

Since modeling of real plants inevitably gives rise to modeling errors regarded as uncertainties, considering robustness for the uncertainties is important in actual control problems. For tackling issues of analyzing robust stability of closed-loop systems in a less conservative fashion, the μ-analysis method is known to be effective. As an alternative approach to robust stability analysis, on ...

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

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

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