نتایج جستجو برای: dual ov bases

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

Journal: :CoRR 2017
Daniel M. Kane Richard Ryan Williams

In the ORTHOGONAL VECTORS (OV) problem, we wish to determine if there is an orthogonal pair of vectors among n Boolean vectors in d dimensions. TheOV Conjecture (OVC) posits that OV requires n time to solve, for all d = ω(logn). Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in P, such as Edit Distance, Frechet Distance, Longest Common Subsequence, and ...

Journal: :Development 2011
Laina Freyer Vimla Aggarwal Bernice E Morrow

The inner ear and cochleovestibular ganglion (CVG) derive from a specialized region of head ectoderm termed the otic placode. During embryogenesis, the otic placode invaginates into the head to form the otic vesicle (OV), the primordium of the inner ear and CVG. Non-autonomous cell signaling from the hindbrain to the OV is required for inner ear morphogenesis and neurogenesis. In this study, we...

2005
HECHUN ZHANG R. B. ZHANG

Dual canonical bases of the quantum general linear supergroup are constructed which are invariant under the multiplication of the quantum Berezinian. By setting the quantum Berezinian to identity, we obtain dual canonical bases of the quantum special linear supergroup Oq(SLm|n). We apply the canonical bases to study invariant subalgebras of the quantum supergroups under left and right translati...

A. Sarpanah, H. Monsef Kasmaie, M. Abedi, M. Yasemi,

Caspian kutum fish (Rutilus frisii) wild broodstocks were caught by gillnet during their upstream migration and subjected to short-time confinement stress and their physiological responses have been examined. Thirty fish (average weight of 1217.6 g) were divided into three experimental groups CO (control), OV (ovaprim) and CO+OV (cortisol+ovaprim) and placed into rearing tanks (10 fish tank-1; ...

Journal: :J. Computational Applied Mathematics 2013
Pawel Wozny

Let Bn := {b0, b1, . . . , bn} (n = 0, 1, . . . , N ; N ∈ N) be the sets of linearly independent functions. We give a simple method of construction the dual functions Dn := { d (n) 0 , d (n) 1 , . . . , d (n) n } (0 ≤ n ≤ N) satisfying the following conditions: spanDn = spanBn and 〈 bi, d (n) j 〉 = δij (0 ≤ i, j ≤ n ≤ N), where δii = 1, δij = 0 for i 6= j, and 〈·, ·〉 is a given inner product. T...

2008
HECHUN ZHANG

The dual basis of the canonical basis of the modified quantized enveloping algebra is studied, in particular for type A. The construction of a basis for the coordinate algebra of the n × n quantum matrices is appropriate for the study the multiplicative property. It is shown that this basis is invariant under multiplication by certain quantum minors including the quantum determinant. Then a bas...

Journal: :International Journal of Numerical Methods and Applications 2016

ژورنال: دانشور پزشکی 2014
راهنمای بشم, مریم, روغنی, مهرداد, شیرازی, مونا, قوسیان مقدم, محمدحسن,

Background and Objective: Origanum vulgare (OV) has many beneficial effects in metabolic disorders from the viewpoint of traditional medicine. In this study, the effect of its administration on serum glucose and lipids and liver level of malondialdehyde (MDA) and aminotranferases were studied in streptozotocin-diabetic rats. Materials and Methods: Male rats (n = 32) were divided into 4 groups...

2004
Walter G. Kropatsch Yll Haxhimusa

We review multilevel hierarchies under the special aspect of their potential for abstraction and grouping. Motivated by claims to ’bridge the representational gap between image and model features’ and by the growing importance of topological properties we discuss several extensions to dual graph pyramids: structural simplification should preserve important topological properties and content abs...

2008
Takayuki Ishizeki Hiroki Nakayama Hiroshi Imai

To integer programming problems, computational algebraic approaches using Gröbner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time complexity bound compared with existing methods for solving integer programming problems, these give algebraic analysis of their structures. In this paper, we focus...

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

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

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