نتایج جستجو برای: hyper edge

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

Afsun Nodehi moghadam, Fatemeh Khassaf, Poorya Yaghmaei, Sirvan Ghorbanipour,

Objectives: It is important to recognize any risk factors for the development of injuries in the athletic population. The aim of this study was to investigate the association between joint hyper mobility and low back pain in Iranian hyper mobile and non-hyper mobile athletes. Methods: 50 athletic patients with low back pain (age=23.20±12.79 years) and 51 healthy athletes (age=24.28&pl...

2017
Aldrian Obaja Muis Wei Lu

This is the supplementary material for “Labeling Gaps Between Words: Recognizing Overlapping Mentions with Mention Separators” (Muis and Lu, 2017). This material explains in more depth the issue of spurious structures and also the experiments settings. 1 Details on Spurious Structures About mention hypergraph, we remarked in Section 3.1 that the normalization term calculated by the forward-back...

2014
Xiaoyan Mao Huijie Zhou

We consider the notion of an isomorphism between two hyper BCI-algebras and obtain all of the hyper BCI-algebras of order 3. It is shown that there exist 14 proper hyper BCI-algebras and 5 proper weak hyper BCI-algebras of order 3 up to isomorphism. Finally, further study on the theory of hyper BCI-algebra and its related hyper structure and applications of our results in information sciences a...

Journal: :IEEE Access 2021

This paper aims at highlighting cutting-edge research results in the field of visual tracking by deep reinforcement learning. Deep learning (DRL) is an emerging area combining recent progress and It showing interesting computer vision and, recently, it has been applied to problem yielding rapid development novel strategies. After providing introduction learning, this compares approaches based o...

Journal: :international journal of nanoscience and nanotechnology 2008
a. r. ashrafi f. gholami-nezhaad

the edge szeged index is a new molecular structure descriptor equal to the sum of products mu(e)mv(e) over all edges e = uv of the molecular graph g, where mu(e) is the number of edges which its distance to vertex u is smaller than the distance to vertex v, and nv(e) is defined analogously. in this paper, the edge szeged index of one-pentagonal carbon nanocone cnc5[n] is computed for the first ...

2011
Min Su Kang C. C. Chang E. Eslami MIN SU KANG

The notions of bipolar fuzzy hyper MV-subalgebras, (weak) bipolar fuzzy hyper MV-deductive system and precisely weak bipolar fuzzy hyper MV-deductive system are introduced, and their relations are investigated. Characterizations of bipolar fuzzy hyper MV-subalgebras and weak bipolar fuzzy hyper MV-deductive systems are provided.

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

Journal: :iranian journal of allergy, asthma and immunology 0
soheila aleyacin mozhgan moghtaderi reza amin sayyed yahya attaran

hyper - immunoglobulin e syndrome is a rare primary immunodeficiency disease characterized by recurrent abscess formation, respiratory tract infections and very high titers of serum ige associated with peculiar face and skeletal features. we report a seven-year old  girl  presenting with persistent productive cough and  history of chronic eczematoid facial lesions since infancy  and  two episod...

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

2014
Ahmed Kheiri

There is a growing interest towards self configuring/tuning automated general-purpose reusable heuristic approaches for combinatorial optimisation, such as, hyper-heuristics. Hyper-heuristics are search methodologies which explore the space of heuristics rather than the solutions to solve a broad range of hard computational problems without requiring any expert intervention. There are two commo...

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

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

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