نتایج جستجو برای: alternating set

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

Journal: :iranian endodontic journal 0
ângelo josé da silva beraldo rogério vieira silva alberto nogueira da gama antunes frank ferreira silveira eduardo nunes

introduction: the aim of this study was to verify the effect of alternating 2.5% sodium hypochlorite (naocl) and 17% ethylenediaminetetraacetic acid (edta) on the smear layer removal from root canal surfaces. methods and materials: a total of 15 single-rooted human teeth, instrumented with protaper files, were randomly distributed in 3 groups. in group 1 ( n =7) the canals were irrigated with 1...

R. Shamani, S.R. AllahKaram,

Abstract: Due to the expansion of high voltage Alternating Current (AC) power transmission lines and cathodically protected buried pipelines, it is becoming more and more difficult to construct them with enough safe distances between them. Thus, the pipelines are frequently exposed to induced AC interferences, which result in perturbation of Cathodic Protection (CP) due to AC corrosion. To s...

2009
Brett Stevens Khaled Salem Nacho López David A. Richter

Open problems submitted to the 2nd Canadian Discrete and Algorithmic Mathematics Conference will be held on May 25-28, 2009, at the Centre de recherches mathématiques in Montréal, Canada. put brief summary here Comments and questions of a technical nature about a particular problem should be sent to the correspondent for that problem. Please send other comments and information about partial or ...

2008
Toufik Mansour

We study the generating functions for pattern-restricted k-ary words of length n corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

Journal: :Graphs and Combinatorics 2006
Csaba D. Tóth

It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length Ω( √ n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both...

2009
Suzana Andova Sonja Georgievska

A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axio...

2015
Haris Aziz Toby Walsh Lirong Xia

A simple mechanism for allocating indivisible resources is sequential allocation in which agents take turns to pick items. We focus on possible and necessary allocation problems, checking whether allocations of a given form occur in some or all mechanisms for several commonly used classes of sequential allocation mechanisms. In particular, we consider whether a given agent receives a given item...

2008
Shinji Tanimoto

We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...

2008
Toshiki Endo Tomoko Itoh Kouki Taniyama

We say that a link L1 is an s-major of a link L2 if any diagram of L1 can be transformed into a diagram of L2 by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knots and links with the crossing number less than or equal to six. The proofs are given by g...

2012
Henryk Michalewski Damian Niwinski

We identify the class of Σ1–inductive sets studied by Moschovakis as a set theoretical generalization of the class (1, 3) of the Rabin-Mostowski index hierarchy of alternating automata on infinite trees. That is, we show that every tree language recognized by an alternating automaton of index (1, 3) is Σ1–inductive, and exhibit an automaton whose language is complete in this class w.r.t. contin...

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

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

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