نتایج جستجو برای: temporal partitioning

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

1999
E. Cantó Juan Manuel Moreno Joan Cabestany Julio Faura Josep Maria Insenser

Most partitioning algorithms have been developed for conventional programmable logic (especially FPGAs), being their main goal the minimisation of the signals constituting the interface (cutsize) between partitions, while balancing partition sizes. New families of dynamic reconfigurable programmable logic (DRPL) offer new possibilities to improve functional density of circuits, but traditional ...

2006
Yixin Chen

In this paper, we study efficient temporal planning based on a continuous and differentiable nonlinear programming transformation of the planning problem. Based on the observation that many large planning problems have constraint locality, we have previously proposed the constraint partitioning approach that utilizes the constraint structure by partitioning the constraints of a planning problem...

2008
W. RONALD HEYER W. Ronald Heyer

Heyer, W. Ronald. Studies in Larval Amphibian Habitat Partitioning. Smithsonian Contributions to Zoology, number 242, 27 pages, 3 figures, 14 tables, 1976.—Habitat partitioning by larval amphibians was studied in two environments. A two-year study was undertaken at the Chesapeake Bay Center for Environmental Studies and a comparative dry and wet season study was completed at Barro Colorado Isla...

2014
Luis J. Villanueva-Rivera

Individuals in acoustic communities compete for the use of the sound resource for communication, a problem that can be studied as niche competition. The acoustic niche hypothesis presents a way to study the partitioning of the resource, but the studies have to take into account the three dimensions of this niche: time, acoustic frequency, and space. I used an Automated Digital Recording System ...

Journal: :EURASIP J. Adv. Sig. Proc. 2003
Camel Tanougast Yves Berviller Serge Weber Philippe Brunet

We provide a methodology used for the temporal partitioning of the data-path part of an algorithm for a reconfigurable embedded system. Temporal partitioning of applications for reconfigurable computing systems is a very active research field and some methods and tools have already been proposed. But all these methodologies target the domain of existing reconfigurable accelerators or reconfigur...

1999
Awartika Pandey Ranga Vemuri

Dynamically Reconngurable processors are becoming increasingly viable with the advent of modern eld-programmable devices. A key feature of dynamically reconngurable FPGAs is that the logic, and interconnect is time-multiplexed. This enables the implementation of large circuits by partitioning the speciication into multiple segments, that execute one after the other on the reconngurable processo...

2016
Mylswamy Mahendiran

Resource partitioning is well known along food and habitat for reducing competition among sympatric species, yet a study on temporal partitioning as a viable basis for reducing resource competition is not empirically investigated. Here, I attempt to identify the mechanism of temporal partitioning by intra- and interspecific diving analyses of three sympatric cormorant species at different fresh...

2015
D. Fitrianah A. N. Hidayanto H. Fahmi

This paper is aimed to propose a grid density clustering algorithm for spatio-temporal data that is based on the adaptation of the grid density based clustering algorithm. The algorithm is based on AGRID+ algorithm with 7 steps: partitioning, computing distance threshold, calculating densities, compensating densities, calculating density threshold (DT), clustering and removing noises. The adapt...

2015
Nathan J Kuwada Beth Traxler Paul A Wiggins

Bacterial cells display both spatial and temporal organization, and this complex structure is known to play a central role in cellular function. Although nearly one-fifth of all proteins in Escherichia coli localize to specific subcellular locations, fundamental questions remain about how cellular-scale structure is encoded at the level of molecular-scale interactions. One significant limitatio...

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

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

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