• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1814-1821
• /
• 2002

NC cutting simulation is an important factor in the development of products. The geometric modelling of cutter swept surface should be done in NC cutting simulation. A part of cutter swept surface is a ruled surface blended with silhouette curve and cutter path. Finding an intersection point between cutter swept surface and a line is one of major problems in Z-map based cutting simulation. In this paper, cutter swept surface is defined parametrically and it's intersection point with Z-map is found in an exact form. Triangular grid Z-map based 3-axis NC cutting simulation is performed.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.6 no.4
• /
• pp.76-80
• /
• 2007

Two roll straightener showed the remarkable improvement in straightness betterment of the bar compared with other types of straightener. So, in this study we designed a two-cross straightener curvature for the straightness improvement of a bar and contact sections with respect to the variation of the gap between two-cross roll using nonlinear contact analysis. The Displacement in terms of a intersection angle between roll and bar was predicted on with the effect of a straightness and plastic deformation behaviors of the bar according to the roll drive of a two cross-roll straightener.

• The Mathematical Education
• /
• v.13 no.2
• /
• pp.6-10
• /
• 1974

We consider 'ordinary' graphs: that is, finite undirected graphs with no loops or multiple edges. An intersection representation of a graph G is a function r from V(G), the set of vertices of G, into a family of sets S such that distinct points $\chi$$_{\alpha}$ and $\chi$$_{\beta}$/ of V(G) are. neighbors in G precisely when ${\gamma}$($\chi$$_{\alpha}$)∩${\gamma}$($\chi$$_{\beta}$/)$\neq$ø, A graph G is a rigid circuit grouph if every cycle in G has at least one triangular chord in G. In this paper we consider the main theorem; A graph G has an intersection representation by arcs on an acyclic graph if and only if is a normal rigid circuit graph.uit graph.d circuit graph.uit graph.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.8
• /
• pp.1832-1843
• /
• 1995

Tool interference is one of the most critical problems in sculptured surface machining. When machining cavities and concaves, the tool frequently overcuts the portions of the surface, which cause inaccuracy in machining. So tool interference-free paths must be generated for rough cutting more efficiently. In this paper a software using SSI(Surface/Surface intersection) algorithm is developed for eliminating tool interference which occurs in an offset surface in 3-dimensional free form surface modeling. this work consists of two stages : using the offset data, the intersection curves are rapidly checked by this algorithm at the first stage. CL(cutter location) data are obtained by deleting the loop section of intersected offset patches at the second stage. This algorithm can reduce the amount of memory required to store machining data and also easily check region which have the possibility of intersection. Also, This software is verified to be useful in machining a curved object on a DNC milling machine.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.121-126
• /
• 1998

It is one of important issues to find intersection curve? in representation of complex surfaces on a computer. Three typical methods, i.e. the tracing method, the subdivision method, and hybrid method, are often applied to find intersection curves between sculptured surfaces. In this paper two topics are dealt with for efficiency and robustness of the hybrid method. One tropic is about how to determine step sizes variably during tracing, the ethel is about how to find tangential points between surfaces. Tracing by variable step size finds intersections rapidly and requires less memory size. Some illustrations show tangential points between surfaces.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.43-51
• /
• 1999

Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.6
• /
• pp.501-509
• /
• 2004

The frequency of car accidents is very high at the intersection. Because of the state of a traffic signal, quarrels happen after accidents. At night many cars run away after causing an accident. In this case, accident analyses have been conducted by investigating evidences such as eyewitness accounts, tire tracks, fragments of the car or collision traces of the car. But these evidences that don't have enough objectivity cause an error in judgment. In the paper, when traffic accidents happen, the traffic accident detection system that stands on the basis of images and sounds detects traffic accidents to acquire abundant evidences. And, this system transmits 10 seconds images to the traffic center through the wired net and stores images to the Smart Media Card. This can be applied to various ways such as accident management, accident DB construction, urgent rescue after awaring the accident, accident detection in tunnel and in inclement weather.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.251-257
• /
• 2003

In this paper, we wish to construct a optimal traffic cycle using wire remote control. if police vehicle or ambulance suddenly enter the traffic Intersection, it will increase the traffic accident. In this paper, wireless traffic light use the radio traffic control signal and research about the hardware manufacture to check special detectors on urgency vehicles may safety and rapidly enter traffic intersection. Also, this paper present a traffic signal control conditions that analyzes different traffic intersection flows in cases of saturated flows, where the real traffic volume demand is large and the capacity constraints of bottlenecks have significant effects on the flow patterns. Through computer simulation this wireless traffic light has been proven to be much more safety and efficient than fixed traffic signal light which does not consider emergency vehicles for safety escort.

• Communications for Statistical Applications and Methods
• /
• v.25 no.5
• /
• pp.559-568
• /
• 2018

Gene classification can involve complex order-restricted inference. Examining gene expression pattern across groups with order-restriction makes standard statistical inference ineffective and thus, requires different methods. For this problem, Roy's union-intersection principle has some merit. The M-estimator adjusting for outlier arrays in a microarray study produces a robust test statistic with distribution-insensitive clustering of genes. The M-estimator in conjunction with a union-intersection principle provides a nonstandard robust procedure. By exact permutation distribution theory, a conditionally distribution-free test based on the proposed test statistic generates corresponding p-values in a small sample size setup. We apply a false discovery rate (FDR) as a multiple testing procedure to p-values in simulated data and real microarray data. FDR procedure for proposed test statistics controls the FDR at all levels of ${\alpha}$ and ${\pi}_0$ (the proportion of true null); however, the FDR procedure for test statistics based upon normal theory (ANOVA) fails to control FDR.

• Honam Mathematical Journal
• /
• v.39 no.1
• /
• pp.127-136
• /
• 2017

For a quadrangle P, we consider the centroid $G_0$ of the vertices of P, the perimeter centroid $G_1$ of the edges of P and the centroid $G_2$ of the interior of P, respectively. If $G_0$ is equal to $G_1$ or $G_2$, then the quadrangle P is a parallelogram. We denote by M the intersection point of two diagonals of P. In this note, first of all, we show that if M is equal to $G_0$ or $G_2$, then the quadrangle P is a parallelogram. Next, we investigate various quadrangles whose perimeter centroid coincides with the intersection point M of diagonals. As a result, for an example, we show that among circumscribed quadrangles rhombi are the only ones whose perimeter centroid coincides with the intersection point M of diagonals.