• Title/Summary/Keyword: proximity

Search Result 1,564, Processing Time 0.021 seconds

SOME RESULTS ON COMMON BEST PROXIMITY POINT AND COMMON FIXED POINT THEOREM IN PROBABILISTIC MENGER SPACE

  • Shayanpour, Hamid
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.5
    • /
    • pp.1037-1056
    • /
    • 2016
  • In this paper, we define the concepts of commute proximally, dominate proximally, weakly dominate proximally, proximal generalized ${\varphi}$-contraction and common best proximity point in probabilistic Menger space. We prove some common best proximity point and common fixed point theorems for dominate proximally and weakly dominate proximally mappings in probabilistic Menger space under certain conditions. Finally we show that proximal generalized ${\varphi}$-contractions have best proximity point in probabilistic Menger space. Our results generalize many known results in metric space.

SOME RESULTS ON BEST PROXIMITY POINT FOR CYCLIC B-CONTRACTION AND S-WEAKLY CYCLIC B-CONTRACTION MAPPINGS

  • V. Anbukkarasi ;R. Theivaraman;M. Marudai ;P. S. Srinivasan
    • The Pure and Applied Mathematics
    • /
    • v.30 no.4
    • /
    • pp.417-427
    • /
    • 2023
  • The purpose of this paper is establish the existence of proximity point for the cyclic B-contraction mapping on metric spaces and uniformly convex Banach spaces. Also, we prove the common proximity point for the S-weakly cyclic B-contraction mapping. In addition, a few examples are provided to demonstrate our findings.

A Study on the Proximity of Clothing to Self and Proximity of Cosmetic to Self by Degree of Cosmetics (화장도(化粧度)에 따른 의복근접도(衣服近接度) 및 화장근접도(化粧近接度)에 관(關)한 연구(硏究))

  • Jo, Ki-Yeu;Yoo, Tai-Soon
    • Journal of Fashion Business
    • /
    • v.2 no.2
    • /
    • pp.66-76
    • /
    • 1998
  • The purpose of this study was to examine the proximity of clothing to self and proximity of cosmetic to self by Degree of Cosmetics. The scales used in this study include the arranged on the basis of Sontag (1978) 's study for proximity of clothing to self, and the scale developed by the researcher for proximity of cosmetic to self. The subjects of this study were 885 adult women in Taegu. The data collected were analyzed by using MANOVA, ANOVA, and the Cronbach a was also applied. The results of this study were summarized as follows: 1. The persons with high degree of cosmetics showed high degrees of joy of change, self-value expression, novelty, self-consciousness and consciousness to others in the sub-factors of proximity of clothing to self, while there was not significant difference in physical satisfaction. 2. The persons with high degree of cosmetics showed high degrees of social confidence, skin care, joy of change, self-satisfaction, instrument of disguise in the sub-factors of proximity of cosmetic to self.

  • PDF

BEST RANDOM PROXIMITY PAIR THEOREMS FOR RELATIVELY U-CONTINUOUS RANDOM OPERATORS WITH APPLICATIONS

  • Okeke, Godwin Amechi
    • East Asian mathematical journal
    • /
    • v.33 no.3
    • /
    • pp.271-289
    • /
    • 2017
  • It is our purpose in this paper to introduce the concept of best random proximity pair for subsets A and B of a separable Banach space E. We prove some best random approximation and best random proximity pair theorems of certain classes of random operators, which is the stochastic verse of the deterministic results of Eldred et al. [22], Eldred et al. [18] and Eldred and Veeramani [19]. Furthermore, our results generalize and extend recent results of Okeke and Abbas [42] and Okeke and Kim [43]. Moreover, we shall apply our results to study nonlinear stochastic integral equations of the Hammerstein type.

A Fast Algorithm for the k-Keyword Ordered Proximity Problem (순서를 고려하는 k-키워드 근접도 문제를 위한 빠른 알고리즘)

  • Kim, Jin-Wook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.281-288
    • /
    • 2010
  • In the web search engines, the proximity is used to compute the relevance of a document to the given query. There exist various research results about the proximity problems and the ordered proximity problems. In this paper, we present O(n) time algorithms for the k-keyword ordered proximity problems where n is the total number of occurrences of the k keywords in a document. Experimental results show that the proposed algorithms are about 1.2 times and over 3 times faster than the previous results when k=2 and k=5, respectively.

Development of Tracking Technique against FMCW Proximity Fuze (FMCW방식 근접신관 신호 추적 기법 개발)

  • Hong, Sang-Geun;Choi, Song-Suk;Shin, Dong-Cho;Lim, Jae-Moon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.5
    • /
    • pp.910-916
    • /
    • 2010
  • A modern artillery use a FMCW Proximity Fuze for effectively target destruction. FMCW Proximity Fuze can be deceived by Jamming Technique because it uses RF for distance estimation. FMCW Proximity Fuze algorithm is similar to FMCW radar's, but normal Jamming Tech. like Noise and Mulitone is useless. Most Shots with FMCW Proximity Fuze have a additional mechanical fuze against RF Jamming. Shots explode by mechanical fuze when Proximity Fuse is Jammed. However, distance Deception is available because shots can not distinguish between deception jamming signal and ground reflected signal. For making Distance Deception Jamming, FMCW signal tracking is demanded. In this paper, we propose a FMCW tracking method and develop the Jammer to show Jamming signal.

Comparison of Voxel Map and Sphere Tree Structures for Proximity Computation of Protein Molecules (단백질 분자에 대한 proximity 연산을 위한 복셀 맵과 스피어 트리 구조 비교)

  • Kim, Byung-Joo;Lee, Jung-Eun;Kim, Young-J.;Kim, Ku-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.6
    • /
    • pp.794-804
    • /
    • 2012
  • For the geometric computations on the protein molecules, the proximity queries, such as computing the minimum distance from an arbitrary point to the molecule or detecting the collision between a point and the molecule, are essential. For the proximity queries, the efficiency of the computation time can be different according to the data structure used for the molecule. In this paper, we present the data structures and algorithms for applying proximity queries to a molecule with GPU acceleration. We present two data structures, a voxel map and a sphere tree, where the molecule is represented as a set of spheres, and corresponding algorithms. Moreover, we show that the performance of presented data structures are improved from 3 to 633 times compared to the previous data structure for the molecules containing 1,000~15,000 atoms.

Histomorphometric evaluation of the bone surrounding orthodontic miniscrews according to their adjacent root proximity

  • Oh, Hyun-Ju;Cha, Jung-Yul;Yu, Hyung-Seog;Hwang, Chung-Ju
    • The korean journal of orthodontics
    • /
    • v.48 no.5
    • /
    • pp.283-291
    • /
    • 2018
  • Objective: This study was conducted to perform histomorphometric evaluations of the bone surrounding orthodontic miniscrews according to their proximity to the adjacent tooth roots in the posterior mandible of beagle dogs. Methods: Four male beagle dogs were used for this study. Six orthodontic miniscrews were placed in the interradicular spaces in the posterior mandible of each dog (n = 24). The implanted miniscrews were classified into no loading, immediate loading, and delayed loading groups according to the loading time. At 6 weeks after screw placement, the animals were sacrificed, and tissue blocks including the miniscrews were harvested for histological examinations. After analysis of the histological sections, the miniscrews were categorized into three additional groups according to the root proximity: high root proximity, low root proximity, and safe distance groups. Differences in the bone-implant contact (BIC, %) among the root proximity groups and loading time groups were determined using statistical analyses. Results: No BIC was observed within the bundle bone invaded by the miniscrew threads. Narrowing of the periodontal ligament space was observed in cases where the miniscrew threads touched the bundle bone. BIC (%) was significantly lower in the high root proximity group than in the low root proximity and safe distance groups. However, BIC (%) showed no significant differences among the loading time groups. Conclusions: Regardless of the loading time, the stability of an orthodontic miniscrew is decreased if it is in contact with the bundle bone as well as the adjacent tooth root.

Intravenous Infusion Monitoring Sensor Based on Longitudinal Electric Field Proximity Sensing Technique (종방향 전기장 근접 감지 방식 수액 주입 측정 센서)

  • Kim, Young Cheol;Ahmad, Sheikh Faisal;Kim, Hyun Deok
    • Journal of Sensor Science and Technology
    • /
    • v.26 no.2
    • /
    • pp.101-106
    • /
    • 2017
  • A novel intravenous (IV) infusion monitoring sensor is presented to measure the drop rate in the drip chamber of an IV infusion set. It is based on a capacitive proximity sensor and detects the variation of the longitudinal electric field induced by the drop falling into the drip chamber. Unlike the conventional capacitor sensor with two semi-cylindrical conductor plates, the proximity sensor for IV monitoring is composed of a pair of conductor rings which are mounted on the outer surface of the drip chamber with a specific gap between them. The characteristics of the proximity sensor for IV monitoring were investigated through three dimensional electrostatic simulations. It showed quite superior performances in comparison with the conventional capacitor sensor. Especially, the proposed proximity sensor exhibits consistent sensitivity regardless of its mounting position on the drip chamber, operates normally though the drip chamber is tilted and shows robustness to the changes of the drop size and the drip factor of the IV infusion set. Thus, the proximity sensor for IV monitoring is more suitable for use in actual environment of IV therapy compared with the conventional capacitor sensor.