نتایج جستجو برای: imperfect transformation

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

2015
Alan H. Welsh David B. Lindenmayer Christine F. Donnelly

In [1], we presented an example to show that using occupancy modelling to adjust for imperfect detection can make the bias worse than not making any adjustment for imperfect detection. The intuition behind the example is that imperfect detection is only one of a number of problems that can introduce measurement error into the data and it is a mistake to focus exclusively on only one kind of mea...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1997
Q Zhu D Hulen T Liu M Clarke

The cluA gene of Dictyostelium discoideum encodes a novel 150-kDa protein. Disruption of cluA results in clustering of mitochondria near the cell center. This is a striking difference from normal cells, whose mitochondria are dispersed uniformly throughout the cytoplasm. The mutant cell populations also exhibit an increased frequency of multinucleated cells, suggesting an impairment in cytokine...

Journal: :Sci. Ann. Comp. Sci. 2008
Vasile Anastasoaei Elefterie Olaru

The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...

Journal: :CoRR 2016
R. M. Farouk M. A. SayedElahl

One of the most challenging tasks in microarray image analysis is spot segmentation. A solution to this problem is to provide an algorithm than can be used to find any spot within the microarray image. Circular Hough Transformation (CHT) is a powerful feature extraction technique used in image analysis, computer vision, and digital image processing. CHT algorithm is applied on the cDNA microarr...

1994
Dattatraya Kulkarni Michael Stumm

Computational Alignment is a new class of program transformations suitable for both local and global optimization. Computational Alignment transforms all of the computations of a portion of the loop body in order to align them to other computations either in the same loop or in another loop. It extends along a new dimension and is signiicantly more powerful than linear transformations because i...

2013
Florian Hartmann Peter Flaschel

A baseline integration of commercial banks into the disequilibrium framework with behavioral traders of Charpe et al. (2011, 2012) is presented. At the core of the analysis is the impact the banking sector exerts on the interaction of real and financial markets. Potentially destabilizing feedback channels in the presence of imperfect macroeconomic portfolio adjustment and heterogeneous expectat...

Journal: :Journal of Logic, Language and Information 2005
Tom Sgouros

An explanation for the uncertain progress of formalist linguistics is sought in an examination of the concept of syntax. The idea of analyzing language formally was made possible by developments in 20th century logic. It has been pointed out by many that the analogy between natural language and a formal system may be imperfect, but the objection made here is that the very concept of syntax, whe...

Journal: :Insect molecular biology 1999
A C Pinkerton S Whyard H A Mende C J Coates D A O'Brochta P W Atkinson

Members of the hAT transposable element family are mobile in non-host insect species and have been used as transformation vectors in some of these species. We report that the Queensland fruit fly, Bactrocera tryoni, contains at least two types of insect hAT elements called Homer and a Homer-like element (HLE). The Homer element is 3789 bp in size and contains 12-bp imperfect inverted terminal r...

2009
Albert Hartono Muthu Manikandan Baskaran Cédric Bastoul Albert Cohen Sriram Krishnamoorthy Boyana Norris J. Ramanujam P. Sadayappan

Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multi-level tiled code is essential for maximizing data reuse in systems with deep memory hierarchies. Tiled loops with parametric tile sizes (not compile-time constants) facilitate runtime feedback and dynamic optimizations used in iterative compilation and automatic tu...

1998
Jens Lund Mats Rudemo

Consider a pair of point processes, X and Y , where X is regarded as a `true' point process and Y is an imperfect observation of X. For the transformation from X to Y , we consider a number of disturbance mechanisms covering random thinning, displacement, censoring of the displaced points and super-position of extra points. We present the conditional likelihood of Y given X. When both point pro...

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

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

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