نتایج جستجو برای: proximity

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

Journal: :international journal of nonlinear analysis and applications 0
konrawut khammahawong king mongkut's university of technology thonburi (kmutt), 126 pracha-uthit road, bang mod, thrung khru, bangkok 10140, thailand parinya sa ngiamsunthorn department of mathematics, faculty of science, king mongkut’s university of technology thonburi (kmutt), 126 pracha-uthit road, bang mod, thrung khru, bangkok 10140, thailand. poom kumam king mongkut's university of technology thonburi (kmutt), 126 pracha-uthit road, bang mod, thrung khru, bangkok 10140, thailand

in this paper, we establish and prove the existence of best proximity points for multivalued cyclic $f$- contraction mappings in complete metric spaces. our results improve and extend various results in literature.

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

Journal: :ادیان و عرفان 0
اسماعیل علی خانی استادیار مؤسسة پژوهشی حکمت و فلسفة ایران

one of the important issues in the monotheistic religions is the felicity and perfection of man. this felicity in islam and christianity is the felicitous transformation of the person so that one becomes near to god or achieves proximity to him. from the perspective of the noble qur’an and the new testament, this is a real ontological transformation, although it is gradual. according to these t...

Journal: :bulletin of the iranian mathematical society 0
a. amini-harandi

this paper is concerned with the best proximity pair problem in hilbert spaces. given two subsets $a$ and $b$ of a hilbert space $h$ and the set-valued maps $f:a o 2^ b$ and $g:a_0 o 2^{a_0}$, where $a_0={xin a: |x-y|=d(a,b)~~~mbox{for some}~~~ yin b}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in a$ such that $$d(g(x_0),f(x_0))=d(a,b).$$

Journal: :journal of linear and topological algebra (jlta) 0
a ansari karaj branch, islamic azad university a razani n hussain king abdulaziz university

best approximation results provide an approximate solution to the fixed point equation $tx=x$, when the non-self mapping $t$ has no fixed point. in particular, a well-known best approximation theorem, due to fan cite{5}, asserts that if $k$ is a nonempty compact convex subset of a hausdorff locally convex topological vector space $e$ and $t:krightarrow e$ is a continuous mapping, then there exi...

Objectives Aging and its associated problems are one of the challenges in the country. This necessitates the need for proper planning during this period. In this regard, the present study was conducted with the aim of fitting the indicators for choosing optimal sports location for the elderly. Methods & Materials The present study is a descriptive-analytic research that determined the weights ...

Cement-based materials are fundamental resources used to in construction. The increase in requests for and consumption of cement products, especially in Iran, indicates that more cement plants should be equipped. This study developed a geographical information system using pairwise comparison based on grey numbers to identify potential sites in which to set up cement plants. A group of five exp...

Journal: :Int. J. Satellite Communications Networking 2002
Kul B. Bhasin Jeffrey L. Hayden

NASA‘s future communications services will be supplied through a space communications network that mirrors the terrestrial Internet in its capabilities and flexibility. The notional requirements for future data gathering and distribution by this Space Internet have been gathered from NASA’s Earth Science Enterprise (ESE), the Human Exploration and Development in Space (HEDS), and the Space Scie...

2016
Masajiro Iwasaki

In this paper, we address the problems with fast proximity searches for high-dimensional data by using a graph as an index. Graphbased methods that use the k-nearest neighbor graph (KNNG) as an index perform better than tree-based and hash-based methods in terms of search precision and query time. To further improve the performance of the KNNG, the number of edges should be increased. However, ...

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

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