• Title/Summary/Keyword: intersection

Search Result 1,793, Processing Time 0.033 seconds

THE SCHWARZ LEMMA AT THE BOUNDARY FOR THE INTERSECTION OF TWO BALLS

  • Hanjin Lee
    • Honam Mathematical Journal
    • /
    • v.45 no.4
    • /
    • pp.648-654
    • /
    • 2023
  • Schwarz lemma at the non-smooth boundary point for holomorphic self-map on the intersection of two balls in ℂ2 is obtained. At the complex tangent point in the corner of the boundary of the domain, the tangential eigenvalue of the complex Jacobian of the holomorphic map is estimated if the map is transversal.

ON THE INTERSECTION OF TWO TORUS KNOTS

  • Lee, Sang-Youl;Lim, Yong-Do
    • East Asian mathematical journal
    • /
    • v.16 no.1
    • /
    • pp.61-69
    • /
    • 2000
  • We show that the intersection of two standard torus knots of type (${\lambda}_1$, ${\lambda}_2$) and (${\beta}_1$, ${\beta}_2$) induces an automorphism of the cyclic group ${\mathbb{Z}}_d$, where d is the intersection number of the two torus knots and give an elementary proof of the fact that all non-trivial torus knots are strongly invertiable knots. We also show that the intersection of two standard knots on the 3-torus $S^1{\times}S^1{\times}S^1$ induces an isomorphism of cyclic groups.

  • PDF

The Design an Implementation of Content-based Image Retrieval System Using Color Features (칼라 특징을 이용한 내용기반 화상검색시스템의 설계 및 구현)

  • 정원일;박정찬;최기호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.111-118
    • /
    • 1996
  • A content-based image retrieval system is designed and implemetned using the color featurees which are histogram intersection and color pairs. The preprocessor for the image retrieval manage linearly the existing HSI(hue, saturation, saturation, intensity). Hue and intensity histogram thresholding for each color attribute is performed to split the chromatic and achromatic regions respectively. Grouping te indexes produced by the histogram intersection is used to save the retrieval times. Each image is divided into the cells of 32$\times$32 pixels, and color pairs are used to represent the query during retrievals. The recall/precision of histogram intersection is 0.621/0.663 and recall/precision of color pairs is 0.438/0.536. And recall/precision of proposed method is 0.765/0.775/. It is shown that the proposed method using histogram intersection and color pairs improves the retrieval rates.

  • PDF

Toolpath Generation for Three-axis Round-end Milling of Triangular Mesh Surfaces (삼각망 곡면의 3축 라운드엔드밀 가공을 위한 공구경로 생성)

  • Chung, Yun-Chan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.26 no.2
    • /
    • pp.133-140
    • /
    • 2009
  • Presented in this paper is a method to generate round-endmill toolpaths for sculptured surfaces represented as a triangular mesh model. The proposed method is applicable in toolpath generation for ball-endmills and flat-endmills because the round-endmill is a generalized tool in three-axis NC (numerical control) milling. The method uses a wireframe model as the offset model that represents a cutter location surface. Since wireframe models are relatively simple and fast to calculate, the proposed method can process large models and keep high precision. Intersection points with the wireframe offset model and a tool guide plane are calculated, and intersection curves are constructed by tracing the intersection points. The final step of the method is extracting regular curves from the intersection curves including degenerate and self-intersected segments. The proposed method is implemented and tested, and a practical example is presented.

Fuzzy Adaptive Traffic Signal Control of Urban Traffic Network (퍼지 적응제어를 통한 도시교차로망의 교통신호제어)

  • 진현수;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.127-141
    • /
    • 1996
  • This paper presents a unique approach to urban traffic network signal control. This paper begins with an introduction to traffic control in general, and then goes on to describe the approach of fuzzy control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic network condition and adjacent intersection. The signal timing parameters evolve dynamically using only local information to improve traffic signal flow. The signal timing at an intersection is defined by three parameters : cycle time, phase split, off set. Fuzzy decision rules are used to adjust three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. In this paper the effectiveness of this method is showed through simulation of the traffic signal flow in a network of controlled intersection.

  • PDF

섬유배향각 분포측정에 잇어서 교점계수법의 정밀도에 미치는 섬유종횡비와 면적비의 영향

  • 이상동;김혁;한길영;김이곤
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.659-663
    • /
    • 1995
  • The fiber oriented conditied inside fiber reinforced composite material is a basic factor of mechanical properties of composite materials. It is very important to measure the fiber orientation angel for the determination of molding conditions, mechanical charactistics, and the design of composite materials. In the work, the fiber orientation distribution of simulation figure plotted by PC is measured using image processing in order to examine thr accuracy of intersection counting method. The fiber orientation function measured by intersection countingmethod using image processing is compared with the calculated fiber orientation function. The results show that the measured value of fiber orientation function using intersection counting method is lower than the calculated value, because the number of intersection between the secant line and the fiber with smaller fiber aspect ratio is counted less than with larger fiber aspect ratio.

Accuracy of lntersection Counting Method in Measurement of Short Fiber Orientation Distribution by lmage Processing (화상처리에 의한 단섬유배향각 분포측정에 있어서 교점계수법의 정밀도)

  • 이상동;이동기;한길영;김이곤
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.556-560
    • /
    • 1996
  • In order to examine thd accuracy of intersection counting method, the fiber orientation distribution of simulation figure platted by PC is measured using image processing. The fiber orientation distribution obtained by an image processing method is compared with those by the intersection counting method. The result shows that the errors of the intersection counting method are large because its measurement is made by the cross point of the scanning line and the fiber.

  • PDF

Calculation of Intersection between Z-map Vectors and Circularly Moving Filleted-end Mills (원호운동 필렛 엔드밀과 Z-맵 벡터의 교점 계산)

  • 맹승렬;백낙훈;신성용;최병규
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.4
    • /
    • pp.278-288
    • /
    • 2003
  • Presented in this paper is a numerical method for calculating the intersection points between Z-map vectors and the tool swept surface for circularly moving filleted-end mills. In numerically controlled(NC) machining simulation for large moulds and dies, a workpiece is frequently approximated as a set of z-axis aligned vectors, called Z-map vectors, and then the machining processes can be simulated through updating the Z-map with the intersection points. Circular motions are typically used for machining the free-form surfaces. For fast computation, we express each of intersection points with a single-variable non-linear equation and calculate the candidate interval in which the unique solution exists. Then, we prove the existence of a solution and its uniqueness in this candidate interval. Based on these properties, we can effectively apply numerical methods to finally calculate the solution of the nonlinear equation within a given precision. Experimental results are given for the case of a TV monitor and the hood of a car.

A Method of Polygonal Approximation of Digital Curves (디지탈 곡선의 다각형 근사화)

  • Lyu, Sung-Pil;Kwon, O-Sok;Kim, Tae-Kyun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.47-53
    • /
    • 1990
  • Polygonal approximation of digital curves is useful for the image analysis or data compression. There are methods of polygonal approximation using cone intersection using cone intersection which have relatively smaller number of break points and are executed in sequential process. Here a method of polygonal approximation is proposed, which is modified from Sklansky and Gonzales' method, and improves the speed by using integer operations.

  • PDF