نتایج جستجو برای: several multi

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

An efficient and eco-friendly method for the one-pot synthesis of 14-aryl-14H-dibenzo [a,i]xanthene-8,13-dione derivatives has been developed in the presence of Fe3O4@SiO2 core-shell nanoparticles. The multi-component reactions of 2-hydroxy-1,4-naphthoquinone, β-naphthol and aldehydes were efficiently catalyzed using novel nano-scale materials under reflux conditions. The present method offers ...

1993
Pascal Brisset

Metastructures and metaterms have been proposed to extend Prolog systems 6, 5]. They enable special purpose uniications to be speciied. They are useful to implement for example coroutining and new domains of computation. In both cases, information is attached to variables, which then are encoded with metaterms or metastructures. This information must be taken into account during uniication. Pro...

Journal: :Combinatorics, Probability & Computing 2007
Daniela Kühn Deryk Osthus

Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we have eGi(A,B) ≥ mi/2 − √ mi. This answers a question of Bollobás and Scott. We also prove results about partitions into more than two vertex classes.

Journal: :amirkabir international journal of modeling, identification, simulation & control 2014
b. karimi h. ghiti sarand

this paper is concerned with the consensus tracking problem of high order mimo nonlinear multi-agent systems. the agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. the communication network topology of agents is assumed to be a fixed undirected graph. a distributed adaptive control method is proposed to solve the consensus problem utilizing re...

Journal: :Computers & Chemical Engineering 2006
Mehrdad Sahebsara Tongwen Chen Sirish L. Shah

This paper studies the parameter estimation of a general multi-input, multi-output multi-rate system in the frequency-domain. Two methods, named dividing to subsystems and input extension, are introduced for dealing with multi-rate systems and the later method is easily used to convert a multi-input, multi-output multi-rate system to several sub-problems with fast input updating and slow output...

2011
W. T. SULAIMAN

In the present paper several q−integral inequalities are presented, some of them are new and others are generalizations of known results.

2011
EVANDRO AGAZZI

Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of “logical consequence” or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneou...

1999
P. J. Lyons

Writing a program to solve a problem is a process that can be divided into two phases: first, we invent a mental model of the solution; secondly, we map the mental model onto a physical representation. The mental model is multidimensional and syntax-free; in today’s textual programming languages, the physical representation is singledimensional and syntax-burdened. In fact, it hasn’t changed gr...

2004
Olga Rozanova

We consider solutions to the Euler equations in the whole space from a certain class, which can be characterized, in particular, by finiteness of mass, total energy and momentum. We prove that for a large class of right-hand sides, including the viscous term, such solutions, no matter how smooth initially, develop a singularity within a finite time. We find a sufficient condition for the singul...

1993
Tudor Jebelean

0 binary, I-binary: The binary GCD algorithm ([lS]) and its improvement for multidigit integers (Gosper, see [12]). We compare the executron times of several algoixtliiiis for computing the G‘C‘U of arbitrary precasion iirlegers. These algorithms are the known ones (Euclidean, brnary, plus-mrnus), and the improved variants of these for multidigit compzltation (Lehmer and similar), as well as ne...

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

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

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