• Journal of Applied and Pure Mathematics
• /
• v.4 no.5_6
• /
• pp.249-262
• /
• 2022

Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. The research on determining extremal values for the Sombor index of a graph is very popular recently. In this paper, we present the maximum Sombor index of bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal bicyclic graphs.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2009.06a
• /
• pp.307-308
• /
• 2009

We have proposed an index matching film to improve the emitting efficiency of green OLED. Here, SiO2 and TiO2 were selected to coat the green OLED. The structures of index matching film were designed in G1ass/TiO2/SiO2/ITO and SiO2/TiO2/Glass/ITO. Then, these materials were deposited by ion-assisted deposition system. Transmittances of deposited devices were 86.14 and 85.07 %, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.492-506
• /
• 2009

Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards ('*' and '//' ).

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.91-99
• /
• 2019

In this paper, we propose partial denoising boundary matching based on an index for faster matching in very large image databases. Attempts have recently been made to convert boundary images to time-series with the objective of solving the partial denoising problem in boundary matching. In this paper, we deal with the disk I/O overhead problem of boundary matching to support partial denoising in a large image database. Although the solution to the problem superficially appears trivial as it only applies indexing techniques to boundary matching, it is not trivial since multiple indexes are required for every possible denoising parameters. Our solution is an efficient index-based approach to partial denoising using $R^*-tree$ in boundary matching. The results of experiments conducted show that our index-based matching methods improve search performance by orders of magnitude.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2014.02a
• /
• pp.339.2-339.2
• /
• 2014

터치패널은 저항막 방식, 정전용량 방식, 적외선방식, Camera방식 등을 사용하고 있으며 현재 널리 상용화 되어 있는 방식은 정전용량 방식이다. 최근 터치스크린의 면적이 점점 커지게 되면서 점차 저저항, 고투과율을 가지는 IM ITO (Index matching ITO)를 요구하고 있다. 본 연구에서는 중대형 사이즈(15inch 이상)의 Cover glass 일체형 터치센서 구현을 위한 저저항(60ohm/sq이하), 고투과(88% 이상)의 IMITO Glass를 제작하여 전기적,광학적 특성을 분석하여 IMITO 성막조건을 최적화시키는 연구를 하였다. 또한 TSP의 Pattern 시인성을 향상시키기 위해 Index matching층을 고굴절재료와 저굴절 재료를 사용한 다층박막을 형성하여 반사율(0.5% 이하)을 최소화시켜 구현하였다.

• 한국가시화정보학회:학술대회논문집
• /
• 2004.12a
• /
• pp.57-63
• /
• 2004

various applications is presented. It is based on rapid-prototyping of transparent model for flow visualization and on the use of refractive index matching that enables efficient and clear visualization of the flow inside the model. The model is immersed in the index-matching fluid in a glass tank so that any displacement and rotation of the model in the tank have no influence on the optical setup for image acquisition to be made through a glass wall. This can facilitate greatly the camera calibration for stereo PIV and 3-D PTV. As the flow model is generated directly from 3-D surface data, no laborious preparation of the flow model is needed. This approach for seamless linking of model generation and PIV measurement is applicable to various flow measurements in automobile, ship building, fluid machinery, turbine, electrical appliances, heat exchanger, electronic cooling, bio-engineering and so on.

• Proceedings of the SCSK Conference
• /
• 2003.09a
• /
• pp.374-386
• /
• 2003

Two ways of making clear emulsions\ulcornerMicroemulsion Visible light λ = 400-700 nm Microemulsion, d < 50 nmㆍRefractive Index Matching(omitted)

• Korean Journal of Remote Sensing
• /
• v.23 no.2
• /
• pp.113-117
• /
• 2007

In this paper, we propose a new method for determining automatically the size of the matching window using histogram of the gradient in order to improve the performance of stereo matching using one-meter resolution satellite imagery. For each pixel, we generate Flatness Index Image by calculating the mean value of the vertical or horizontal intensity gradients of the 4-neighbors of every pixel in the entire image. The edge pixel has high flatness index value, while the non-edge pixel has low flatness index value. By using the histogram of the Flatness Index Image, we find a flatness threshold value to determine whether a pixel is edge pixel or non-edge pixel. If a pixel has higher flatness index value than the flatness threshold value, we classify the pixel into edge pixel, otherwise we classify the pixel into non-edge pixel. If the ratio of the number of non-edge pixels in initial matching window is low, then we consider the pixel to be in homogeneous region and enlarge the size of the matching window We repeat this process until the size of matching window reaches to a maximum size. In the experiment, we used IKONOS satellite stereo imagery and obtained more improved matching results than the matching method using fixed matching window size.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.11
• /
• pp.1343-1350
• /
• 2019

Converting boundary images to time-series makes it feasible to perform boundary matching even on a very large image database, which is very important for interactive and fast matching. In recent research, there has been an attempt to perform fast matching considering partial denoising by converting the boundary image into time series. In this paper, to improve performance, we propose an index-building method considering all possible arbitrary denoising parameters for removing arbitrary partial noises. This is a challenging problem since the partial denoising boundary matching must be considered for all possible denoising parameters. We propose an efficient single index-building algorithm by constructing a minimum bounding rectangle(MBR) according to all possible denoising parameters. The results of extensive experiments conducted show that our index-based matching method improves the search performance up to 46.6 ~ 4023.6 times.