نتایج جستجو برای: fuzzy reflexive subsemihypergroup

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

Journal: :Inf. Sci. 2009
Balasubramaniam Jayaram Radko Mesiar

A T-fuzzy equivalence relation is a fuzzy binary relation on a set X which is reflexive, symmetric and T-transitive for a t-norm T. Recently, Mesiar et al. [R. Mesiar, B. Reusch, H. Thiele, Fuzzy equivalence relations and fuzzy partitions, J. Multi-Valued Logic Soft Comput. 12 (2006) 167–181] have generalised the t-norm T to any general conjunctor C and investigated the minimal assumptions requ...

Journal: :Int. J. Approx. Reasoning 2010
Qinghua Hu Lei Zhang Degang Chen Witold Pedrycz Daren Yu

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary conce...

2009
Luis Garmendia Ramón González Victoria López Jordi Recasens

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...

2009
Poom Kumam Narin Petrot

Some existence theorems for the mixed variational-like inequality for fuzzy mappings FMVLIP in a reflexive Banach space are established. Further, the auxiliary principle technique is used to suggest a novel and innovative iterative algorithm for computing the approximate solution. Consequently, not only the existence of solutions of the FMVLIP is shown, but also the convergence of iterative seq...

Journal: :Soft Comput. 2003
Martina Danková Irina Perfilieva

The paper continues a study of extensional formulas and their representation by normal forms. The notion of extensional formula is extended to the case when extensionality is considered with respect to a binary reflexive relation. It has been proved that extensional formulas can be represented by normal forms of infinite type and “approximated” by normal forms of finite type. All proofs are giv...

2010
F. BERNA DANYAL SOYBAŞ

Let F be the set of all fuzzy numbers. In this study, we embed F into a nonseparable and non-reflexive unital Banach algebra A containing F by means of a norm defined on A, which enable us to consider F as a subset of A. Besides, the Banach lattice structure of the space A according to a partial order, we define on A has been touched on.

M. Salimi

Let R be a commutative Noetherian ring. The k-torsionless modules are defined in [7] as a generalization of torsionless and reflexive modules, i.e., torsionless modules are 1-torsionless and reflexive modules are 2-torsionless. Some properties of torsionless, reflexive, and k-torsionless modules are investigated in this paper. It is proved that if M is an R-module such that G-dimR(M)

2003
A. Boulmakoul

− Spatial data mining knows a more and more important interest. Fundamental processes of spatial data mining are in particular clustering and structural patterns detection. These processes are influenced strongly by the concept of proximity or neighborhood. This paper introduces some structures to the construction of a spatial data mining integrating fuzzy structural primitives and propose to o...

Journal: :Fuzzy Sets and Systems 2015
José Carlos Rodriguez Alcantud Susana Díaz

The problem of embedding incomplete into complete relations has been an important topic of research in the context of crisp relations and their applications. Several variations of the acclaimed Szpilrajn’s theorem have been provided, inclusive of the case when some order conditions between elements are imposed on the extension. We extend the analysis of that topic by Alcantud to the fuzzy case....

2007
Luis Garmendia Jordi Recasens

Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T -transitive one where T is a continuous archimedean t-norm are given. The first one aggregates the transitive closure R of R with a (maximal) T -transitive relation B contained in R. The second one modifies the values of R or B to better fit them with the ones of R.

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

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

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