نتایج جستجو برای: identifying code

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

2016
Rupal Bhargava Bapiraju Vamsi Tadikonda Yashvardhan Sharma

Automating the process of Named Entity Recognition has received a lot of attention over past few years in Social Media Text. Named Entities are real world objects such as Person, Organization, Product, Location. Identifying these entities in social media text is an important challenging task due the informal nature of text present on social media. One such challenge that is faced in recognizing...

Journal: :J. Comb. Theory, Ser. A 2009
Svante Janson Tero Laihonen

In this paper, we consider identifying codes in binary Hamming spaces F, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. Currently, the subject forms a topic of its own with several possible applications, for example, to sensor networks. Let C ⊆ F. For any X ⊆ F, denote by Ir(X) = Ir(C;X) the set of elements of C within ...

Journal: :Inf. Comput. 2007
Iiro S. Honkala Tero Laihonen

Assume that G = (V ,E) is an undirected graph, and C ⊆ V . For every v ∈ V , denote Ir(G; v) = {u ∈ C : d(u, v) ≤ r}, where d(u, v) denotes the number of edges on any shortest path from u to v in G. If all the sets Ir(G; v) for v ∈ V are pairwise different, and none of them is the empty set, the codeC is called r-identifying. Themotivation for identifying codes comes, for instance, from finding...

Journal: :ITOR 2010
David Auger Irène Charon Olivier Hudry Antoine Lobstein

Let G be a simple, undirected, connected graph with vertex set V (G) and C ⊆ V (G) be a set of vertices whose elements are called codewords. For v ∈ V (G) and r ≥ 1, let us denote by I r (v) the set of codewords c ∈ C such that d(v, c) ≤ r, where the distance d(v, c) is defined as the length of a shortest path between v and c. More generally, for A ⊆ V (G), we define I r (A) = ∪v∈AI C r (v), wh...

Journal: :American journal of hematology 2012
Deirdra R Terrell Laura A Beebe Sara K Vesely Barbara R Neas Jodi B Segal James N George

The objective of this study is to establish a method to identify patients with primary immune thrombocytopenia (ITP) utilizing administrative data from diverse data sources that would be appropriate for epidemiologic studies of ITP, regardless of patients' age and source of health care. Medical records of the Oklahoma University Medical Center, 1995-2004, were reviewed to document the accuracy ...

2012
Ashay Rane James Browne

Accelerators like Graphics Processing Units (GPUs) or coprocessors like Intel’s MIC (Many Integrated Core) provide means to exploit large-scale SIMT/SIMD parallelism in applications. Tools for converting CPU code to code for accelerators/coprocessors are available. Application developers could quickly exploit these accelerators/coprocessors with modest effort if they could identify the code seg...

Journal: :J. UCS 2014
Luiz Laerte Nunes da Silva Junior Alexandre Plastino Leonardo Gresta Paulino Murta

In the software development field, the amount of data related to documentation and to the source code itself is huge. Relevant knowledge can be extracted from these data, provided that the adequate tools are in place. In this context, data mining can be seen as an important tool. This paper presents a new approach for code completion based on sequential patterns mined from previous developed so...

2002
Richard Markeloff

A new package has been developed to provide classes for identifying and analyzing muons in simulated LCD events using Java Analysis Studio. The classes in the package are described. Sample code for performing a JAS LCD muon analysis is presented.

2004
A. Georges D. Buytaert L. Eeckhout K. De Bosschere

We present MONITORMETHOD, a tool which helps Java programmers gain insight in the behavior of their applications. MONITORMETHOD instruments the Java application and relates hardware performance monitors (HPMs) to the methods in the Java application’s source code. We present a detailed case study showing that linking microprocessorlevel performance characteristics to the source code is helpful f...

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

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

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