نتایج جستجو برای: regular dually

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

2013
Daniel A. Romano Guanghao Jiang Luoshan Xu

Following Jiang Guanghao and Xu Luoshan’s concept of conjugative, dually conjugative, normal and dually normal relations on sets, the concept of quasi-regular relations is introduced. Characterizations of quasi-regular relations are obtained and it is shown when an anti-order relation is quasiregular. Some nontrivial examples of quasi-regular relations are given. At the end we introduce dually ...

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

Journal: :categories and general algebraic structures with applications 2014
hanamantagouda p. sankappanavar

this paper is the first of a two part series. in this paper, we first prove that the variety of dually quasi-de morgan stone semi-heyting algebras of level 1 satisfies the strongly blended $lor$-de morgan law introduced in cite{sa12}. then, using this result and the results of cite{sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...

2014
Hanamantagouda P. Sankappanavar

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended ∨-De Morgan law introduced in [20]. Then, using this result and the results of [20], we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) in the variety o...

Journal: :categories and general algebraic structures with applications 2014
hanamantagouda p. sankappanavar

this paper is the second of a two part series. in this part, we prove, using the description of simples obtained in part i, that the variety $mathbf{rdqdstsh_1}$ of regular dually quasi-de morgan stone semi-heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{rdqdstsh_1}$-chains and the variety of dually quasi-de morgan boolean semi-heyting algebras--...

Journal: :Theor. Comput. Sci. 2016
Prateek Karandikar Matthias Niewerth Philippe Schnoebelen

The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of L are obtained dually by collecting words having all their subwords and superwords in L, respectively. We provide lower and upper bounds on the size of the smallest automata recognizing these closures and interior...

Journal: :iranian journal of science and technology (sciences) 2014
e. peyghan

dually flat finsler metrics form a special and valuable class of finsler metrics in finsler information geometry,which play a very important role in studying flat finsler information structure. in this paper, we prove that everylocally dually flat generalized randers metric with isotropic s-curvature is locally minkowskian.

2004
K. J. Ray Liu C. T. Chiu

In this paper, a new scheme employing the time-recursive approach to compute the discrete cosine transform (DCT) and discrete sine transform (DST) is presented. Using such approach, parallel lattice structure that can dually generate the DCT and DST simultaneously is developed. The resulting architecture is regular, module, and without global communication and can be applied to any transform si...

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

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

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