• Journal of Korean Ophthalmic Optics Society
• /
• v.15 no.1
• /
• pp.25-30
• /
• 2010

Purpose: This study was conducted to estimate the changes of corrected diopter and corrected visual acuity with the change in vertex distance. Also we aimed to provide basic data for refraction test. Methods: Using the trial lens, we measured the corrected diopter and corrected visual acuity after performing binocular balance test. We measured the changes of corrected diopter and corrected visual acuity in change of vertex distance. We analyzed statistical significance and relations between vertex distance and corrected diopter and corrected visual acuity. Results: There was no difference in corrected diopter with the change of vertex distance within -1.00D, but the corrected diopter increased with it over - 1.25D. In particular, the change of diopter was largest when the vertex distance increased 15 mm. At over 11.00D, there was large changes of diopter with the changes of vertex distance at 5 mm, 10 mm and 15 mm. On correlation analysis between the vertex distance and the corrected diopter, there was strong correlation (r=0.999 at 5 mm increase of vertex distance, r=0.982 at 10 mm increase and r=0.957 at 15 mm increase) and also there was significant (p<0.01). At the change of visual acuity in increased of vertex distance, the range of a decrease in visual acuity was large when the changes of vertex distance was largest. On correlation analysis between the vertex distance and the corrected visual acuity, there was strong correlation (r=0.969 at 5 mm increase of vertex distance, r=0.985 at 10 mm increase and r=0.994 at 15 mm increase) and also there was significant (p<0.01). Conclusions: The vertex distance was very important at the refraction test and at wearing spectacle. On correlation analysis between the vertex distance and the corrected diopter, and the corrected visual acuity, there was strong correlation and statistically significant. Therefore, the vertex distance should be kept at the refraction using trial lens, and the best fitting was made not to slipping forward, and so we suggested regular refitting of spectacle and the managing method of spectacle were educated to the spectacle wearers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1017-1027
• /
• 2000

In this paper, we propose a new coding method based on the distance between vertex segments for vertex positions in the vertex-based shape coding. The pixel lines are divided into the segments of a fixed length, and the segments that have vertex pixels are called vertex segments. We analyze the probability distribution of the relative distance between vertex segments and prove that it depends only on the ratio between the number of vertices and the number of segments. Considering the coding efficiency and implementation complexity, we choose a particular ratio to make a code table. For each input image, the segment size is chosen according tothe ratio, and the relative segment distances are entropy coded. It is shown that the proposed method is efficient for the images with many vertices.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.741-752
• /
• 2023

A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γ_stve(G)- set and its cardinality is denoted by γ_stve(G). Bounds for γ_stve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.2
• /
• pp.206-216
• /
• 1986

In this paper, the moving distance and velocity of a single moving object are measured by sampling three frames in a two-dimensional line sequence image. The brightness of each frame is analyzed, and the bit data of their pixel are rearranged so that the difference image may be extracted. The parameters for recognition of the object are the gray level of the object, the number of vertex points and the distance between the vertex points. The moving distance obtained from the coordinate which is constructed by the bit processing of the data in the memory map of a microcomputer, and the moving velocity is obtained from the moving distance and the time interval between the first and second sampled frames.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.247-256
• /
• 2004

This paper presents an efficient collision detection algorithm the performance of which is independent of animation speed. Most of the previous collision detection algorithms are incremental and discrete methods, which find out the neighborhood of the extreme vertex at the previous time instance in order to get an extreme vertex at each time instance. However, if an object collides with another one with a high torque, then the angular speed becomes faster. Hence, the candidate by the incremental algorithms may be farther from the real extreme vertex at this time instance. Therefore, the worst time complexity nay be $O(n^2)$, where n is the number of faces. Moreover, the total time complexity of incremental algorithms is dependent on the time step size of animation because a smaller time step yields more frequent evaluation of Euclidean distance. In this paper, we propose a new method to overcome these drawbacks. We construct a spherical extreme vertex diagram on Gauss Sphere, which has geometric properties, and then generate the distance function of a polyhedron and a plane by using this diagram. In order to efficiently compute the exact collision time, we apply the interval Newton method to the distance function.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.387-401
• /
• 2001

If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

• Journal of Korean Ophthalmic Optics Society
• /
• v.9 no.1
• /
• pp.19-27
• /
• 2004

The purpose of this study is to survey spectacle wearers's way of thinking through the questionaire and to investigate their wearing conditions through fitting conditions, the pantascopic angle, vertex distance, the coincidence of vertical and horizontal distance between optical center of the lens and pupillary distance of the eye in random selected 150 ametropic corrective wearers in the age of 17 to 19. The results are as follows : 1. The most popular causes of physical complaints in the ex-wearing spectacle are frame pressure(34.0%), slipping forward(30.0%) and most popular visual complaints are blur vision(30.0%) and asthenopia(20.0%). 2. The most common physical or visual complaints in the present wearing spectacle are slipping forward(30.0%), pressure (50.0%), color(10.0%). 3. Myopic glasses wearers accounted for 56.7% of the subjects, the others were compound myopic astigmatism. In 60% of the subjects' binocular diopter did not coincide. 4. In the pantascopic angle of the both eyes coincide in 66.7% of the subjects. The average of pantascopic angle is $10.07^{\circ}$. 5. In the vertex distance of the both eyes coincided in 65.3% of the subjects. the he average of vertex distance is 13.6 mm. 6. Among 150 eyes with monocular, the vertical distance between optical center of the lens and pupillary distance of the eye is within the RAL-RG 915 that is tolerance of ophthalmic dispensing in German Standards in 82 eyes (54.6%). 7. Among 150 eyes with monocular, the horizontal distance between optical center of the lens and pupillary distance of the eye is within the RAL-RG915 that is tolerance of ophthalmic dispensing in German Standards in 86 eyes(57.3 %).

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.81-94
• /
• 2023

The study aims to compare and analyze the social network structures of Qatar Airways,s Singapore Airlines, Emirates Airlines, and ANA Airlines, recording the top 1 to 4, and Korean Air in ninth by Skytrax's airline evaluations in 2022. This study uses NodeXL, a social network analysis program, to analyze the social networks of 5 airlines, Vertex, Unique Edges, Single-Vertex Connected Components, Maximum Geodesic Distance, Average Geodesic Distance, Average Degree Centrality, Average Closeness Centrality, and Average Betweenness Centrality as indicators to compare the differences in these social networks of the airlines. As a result, Singapore's social network has a better network structure than the other airlines' social networks in terms of sharing information and transmitting resources. In addition, Qatar Airways and Singapore Airlines are superior to the other airlines in playing roles and powers of influencers who affect the flow of information and resources and the interaction within the airline's social network. The study suggests some implications to enhance the usefulness of social networks for marketing.

• Kyungpook Mathematical Journal
• /
• v.61 no.1
• /
• pp.61-74
• /
• 2021

Let G = (V, E) be a connected graph. The eccentric connectivity index of G is defined by ��C (G) = ∑u∈V (G) deg(u)e(u), where deg(u) and e(u) denote the degree and eccentricity of the vertex u in G, respectively. In this paper, we introduce a new formulation of ��C that will be called the distance eccentric connectivity index of G and defined by $${\xi}^{De}(G)\;=\;{\sum\limits_{u{\in}V(G)}}\;deg^{De}(u)e(u)$$ where degDe(u) denotes the distance eccentricity degree of the vertex u in G. The aim of this paper is to introduce and study this new topological index. The values of the eccentric connectivity index is calculated for some fundamental graph classes and also for some graph operations. Some inequalities giving upper and lower bounds for this index are obtained.