• 제목/요약/키워드: distance functions

검색결과 681건 처리시간 0.023초

Transfer Matrix Algorithm for Computing the Geometric Quantities of a Square Lattice Polymer

  • Lee, Julian
    • Journal of the Korean Physical Society
    • /
    • 제73권12호
    • /
    • pp.1808-1813
    • /
    • 2018
  • I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as ${\lesssim}1.8^N$ with a chain length N, in contrast to the explicit enumeration where the scaling is ${\sim}2.7^N$. Various techniques for reducing memory requirements are implemented.

APPROXIMATION OPERATORS AND FUZZY ROUGH SETS IN CO-RESIDUATED LATTICES

  • Oh, Ju-Mok;Kim, Yong Chan
    • Korean Journal of Mathematics
    • /
    • 제29권1호
    • /
    • pp.81-89
    • /
    • 2021
  • In this paper, we introduce the notions of a distance function, Alexandrov topology and ⊖-upper (⊕-lower) approximation operator based on complete co-residuated lattices. Under various relations, we define (⊕, ⊖)-fuzzy rough set on complete co-residuated lattices. Moreover, we study their properties and give their examples.

WEAK INEQUALITIES WITH CONTROL FUNCTIONS AND FIXED POINT RESULTS

  • Choudhury, Binayak S.
    • Journal of applied mathematics & informatics
    • /
    • 제28권3_4호
    • /
    • pp.967-976
    • /
    • 2010
  • In recent times control functions have been used in several problems of metric fixed point theory. Also weak inequalities have been considered in a number of works on fixed points in metric spaces. Here we have incorporated a control function in certain weak inequalities. We have established two fixed point theorems for mapping satisfying such inequalities. Our results are supported by examples.

ON THE EXISTENCE OF A UNIQUE INVARIANT PROBABILITY FOR A CLASS OF MARKOV PROCESSES

  • Lee, Oesook
    • 대한수학회보
    • /
    • 제30권1호
    • /
    • pp.91-97
    • /
    • 1993
  • In this article, we consider the case that S is a topologically complete subspace of $R^{k}$ , and that .GAMMA. is a set of monotone functions on S into S. It is obtained the sugficient condition for the existence of a unique invariant probability to which $P^{(n}$/(x,dy) converges exponentially fast in a metric stronger than the Kolmogorov's distance. This extends the earlier results of Bhattacharya and Lee (1988) who considered the case .GAMMA. a set of nondecreasing functions.tions.

  • PDF

Widths and Positions of Isolated Resonances in the Predissociation of SH:Quantal Treatments

  • 이성율;선호성
    • Bulletin of the Korean Chemical Society
    • /
    • 제22권2호
    • /
    • pp.210-212
    • /
    • 2001
  • The predissociating resonances are treated for the SH molecule by quantal method. The isolated resonances (N'=0, v' = 0-6) are predicted to be highly Lorentzian. The widths and positions of the isolated resonances are computed as functions of v'. The magnitudes and signs of the widths and the shifts as functions of v' are discussed in terms of the distance of the resonance from the crossing points between the bound state (A 2Σ+ ) and the repulsive states ( 4Σ- , 2Σ- and 4Π).

소분자 도킹에서의 평가함수의 개발 동향 (Recent Development of Scoring Functions on Small Molecular Docking)

  • 정환원;조승주
    • 통합자연과학논문집
    • /
    • 제3권1호
    • /
    • pp.49-53
    • /
    • 2010
  • Molecular docking is a critical event which mostly forms Van der waals complex in molecular recognition. Since the majority of developed drugs are small molecules, docking them into proteins has been a prime concern in drug discovery community. Since the binding pose space is too vast to cover completely, many search algorithms such as genetic algorithm, Monte Carlo, simulated annealing, distance geometry have been developed. Proper evaluation of the quality of binding is an essential problem. Scoring functions derived from force fields handle the ligand binding prediction with the use of potential energies and sometimes in combination with solvation and entropy contributions. Knowledge-based scoring functions are based on atom pair potentials derived from structural databases. Forces and potentials are collected from known protein-ligand complexes to get a score for their binding affinities (e.g. PME). Empirical scoring functions are derived from training sets of protein-ligand complexes with determined affinity data. Because non of any single scoring function performs generally better than others, some other approaches have been tried. Although numerous scoring functions have been developed to locate the correct binding poses, it still remains a major hurdle to derive an accurate scoring function for general targets. Recently, consensus scoring functions and target specific scoring functions have been studied to overcome the current limitations.

확률함수를 이용한 비균질 Ti-6Al-4V 합금의 변형 및 파손해석 (Deformation and Failure Analysis of Heterogeneous Microstructures of Ti-6Al-4V Alloy using Probability Functions)

  • 김태원;고은영
    • 대한기계학회논문집A
    • /
    • 제28권6호
    • /
    • pp.685-692
    • /
    • 2004
  • A stochastic approach has been presented for superplastic deformation of Ti-6Al-4V alloy, and probability functions are used to model the heterogeneous phase distributions. The experimentally observed spatial correlation functions are developed, and microstructural evolutions together with superplastic deformation behavior have been investigated by means of the two-point and three-point probability functions. The results have shown that the probability varies approximately linearly with separation distance, and deformation enhanced probability changes during the process. The stress-strain behavior with the evolutions of probability function can be correctly predicted by the model. The finite element implementation using Monte Carlo simulation associated with reconstructed microstructures shows that better agreement with experimental data of failure strain on the test specimen.

Improved object recognition performance of UWB radar according to different window functions

  • Nguyen, Trung Kien;Hong, Ic-Pyo
    • 전기전자학회논문지
    • /
    • 제23권2호
    • /
    • pp.395-402
    • /
    • 2019
  • In this paper, we implemented an Ultra-Wideband radar system using Stripmap Synthetic Apertrure Radar algorithm to recognize objects inside a box. Different window functions such as Hanning, Hamming, Kaiser, and Taylor functions to improve image recognition performance are applied and implemented to radar system. The Ultra-Wideband radar system with 3.1~4.8 GHz broadband and UWB antenna were implemented to recognize the conductor plate located inside 1m3 box. To obtain the image, we use the propagation data in the time domain according to the 1m movement distance and use the Range Doppler algorithm. The effect of different window functions to improve the recognition performance of the image are analyzed. From the compared results, we confirmed that the Kaiser window function can obtain a relatively good image.

Quantification of Entire Change of Distributions Based on Normalized Metric Distance for Use in PSAs

  • Han, Seok-Jung;Chun, Moon-Hyun;Tak, Nam-Il
    • Nuclear Engineering and Technology
    • /
    • 제33권3호
    • /
    • pp.270-282
    • /
    • 2001
  • A simple measure of uncertainty importance based on normalized metric distance to quantify the entire change of cumulative distribution functions (CDFs) has been developed for use in probability safety assessments (PSAs). The metric distance measure developed in this study reflects the relative impact of distributional changes of inputs on the change of an output distribution, white most of the existing uncertainty importance measures reflect the magnitude of relative contribution of input uncertainties to the output uncertainty. Normalization is made to make the metric distance measure a dimensionless quantity. The present measure has been evaluated analytically for various analytical distributions to examine its characteristics. To illustrate the applicability and strength of the present measure, two examples are provided. The first example is an application of the present measure to a typical problem of a system fault tree analysis and the second one is for a hypothetical non-linear model. Comparisons of the present result with those obtained by existing uncertainty importance measures show that the metric distance measure is a useful tool to express the measure of uncertainty importance in terms of the relative impact of distributional changes of inputs on the change of an output distribution.

  • PDF

음함수 곡면의 날카로운 형상 가시화를 위한 확장 Adaptively Sampled Distance Fields 방법 (Extended Adaptively Sampled Distance Fields Method for Rendering Implicit Surfaces with Sharp Features)

  • 차주환;이규열;김태완
    • 한국CDE학회논문집
    • /
    • 제10권1호
    • /
    • pp.27-39
    • /
    • 2005
  • Implicit surfaces are geometric shapes which are defined by implicit functions and exist in three-dimensional space. Recently, implicit surfaces have received much attention in solid modeling applications because they are easy to represent the location of points and to use boolean operations. However, it is difficult to chart points on implicit surfaces for rendering. As efficient rendering method of implicit surfaces, the original Adaptively Sampled Distance Fields (ADFs) $method^{[1]}$ is to use sampled distance fields which subdivide the three dimensional space of implicit surfaces into many cells with high sampling rates in regions where the distance field contains fine detail and low sampling rates where the field varies smoothly. In this paper, in order to maintain the sharp features efficiently with small number of cells, an extended ADFs method is proposed, applying the Dual/Primal mesh optimization $method^{[2]}$ to the original ADFs method. The Dual/Primal mesh optimization method maintains sharp features, moving the vertices to tangent plane of implicit surfaces and reconstructing the vertices by applying a curvature-weighted factor. The proposed extended ADFs method is applied to several examples of implicit surfaces to evaluate the efficiency of the rendering performance.