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

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

2015
Marco Calautti Sergio Greco Cristian Molinaro Irina Trubitsyna

The Chase is a fixpoint algorithm enforcing satisfaction of data dependencies (also called constraints) in databases. It has been proposed more than thirty years ago [2,18] and has seen a revival of interest in recent years in both database theory and practical applications. Indeed, the availability of data coming from different sources easily results in inconsistent or incomplete data (i.e., d...

Journal: :IET Communications 2016
Jiancheng Zhao Li Chen Xiao Ma Martin Johnston

This study proposes a progressive algebraic Chase decoding (PACD) algorithm for Reed–Solomon (RS) codes. On the basis of the received information, 2 (η > 0) interpolation test-vectors are constructed for the interpolation-based algebraic Chase decoding. A test-vector reliability function is defined to assess their potential for yielding the intended message. The algebraic Chase decoding will th...

Journal: :Plant physiology 1996
V. V. Lozovaya O. A. Zabotina J. M. Widholm

Soybean (Glycine max [L.] Merr.) suspension cultures grown under photoautotrophic and photomixotrophic (1% sucrose) culture conditions were used in 14CO2 pulse-chase experiments to follow cell-wall polysaccharide and starch biosynthesis and turnover. Following a 30-min pulse with 14CO2, about one-fourth of the 14C of the photoautotrophic cells was incorporated into the cell wall; this increased...

Journal: :IEEE Trans. Information Theory 1999
Eran Fishler Ofer Amrani Yair Be'ery

The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by No;e = No + NBDD; where NBDD denotes the number of additional, noncodeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original Generalized Minimum Distance (GMD) and Chase decoding algorithms. After car...

2002
Nobuhiko Miki Sadayuki Abeta Mamoru Sawahashi

This paper presents the throughput performance employing hybrid automatic repeat request packet combining, i.e., Chase combining and incremental redundancy, in forward-link orthogonal frequency and code division multiplexing (OFCDM) broadband packet wireless access achieving a peak throughput above 100 Mbps. Simulation results elucidate that the achievable throughput at the average received sig...

Journal: :The Journal of biological chemistry 1991
M Saddik G D Lopaschuk

The objective of this study was to determine the contribution of myocardial triglycerides to overall ATP production in isolated working rat hearts. Endogenous lipid pools were initially prelabeled (pulsed) by perfusing hearts for 60 min with Krebs-Henseleit buffer containing 1.2 mM [1-14C]palmitate. During a subsequent 60-min period (chase), hearts were perfused with either no fat, low fat (0.4...

2015
Miika Hannula

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions.

2016
Liu Li Wang Jinkuan Liu Fulai Song Xin Han Yinghua Wang Yuhuan

In multiple-input multiple-output wireless communication system, the order of symbol detection in Chase framework is critical because of error propagation. In order to improve chase detector’s performance, sorted chase detection algortihm to reduce error propagation is proposed here. By setting parameters at different values, trade-off between performance and complexity can be obtained properly...

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

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

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