• Title/Summary/Keyword: Group Intersection

Search Result 90, Processing Time 0.025 seconds

Feasibility Evaluation of Lane Grouping Methods for Signalized Intersection Performance Index Analysis in KHCM (도로용량편람 신호교차로 성능지표 분석을 위한 차로군 분류의 적정성 평가)

  • Kim, Sang-Gu;Yun, Ilsoo;Oh, Young-Tae;Ahn, Hyun-Kyung;Kwon, Ken-An;Hong, Doo-Pyo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.1
    • /
    • pp.109-126
    • /
    • 2014
  • The level of service (LOS) of the Highway Capacity Manual (KHCM) has been used as a basic criterion at decision making processes for signalized intersections in Korea. The KHCM provides five steps for the signalized intersection analysis. Among them, lane grouping, which is the third step, significantly influence the final LOS. The current method presented in the KHCM, however, classifies a shared lane as a de facto turning lane group, even though the turning traffic of the shared lane is few. Thus, this research was initiated to provide an alternative. To this end, three alternatives were suggested, including the method based on the lane grouping presented in the U.S. Highway Capacity Manual, the method using turning ratio of shared turning lane, and the method using a threshold traffic volume in lane grouping. The feasibilities of the three methods were evaluated using a calibrated CORSIM model. Conclusively, the method using a threshold traffic volume in lane grouping outperformed.

ON THE RESIDUAL FINITENESS OF FUNDAMENTAL GROUPS OF GRAPHS OF CERTAIN GROUPS

  • Kim, Goansu
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.5
    • /
    • pp.913-920
    • /
    • 2004
  • We give a characterization for fundamental groups of graphs of groups amalgamating cyclic edge subgroups to be cyclic subgroup separable if each pair of edge subgroups has a non-trivial intersection. We show that fundamental groups of graphs of abelian groups amalgamating cyclic edge subgroups are cyclic subgroup separable, hence residually finite, if each edge subgroup is isolated in its containing vertex group.

Chow groups on complete regular local rings II

  • Si Chang Lee;Kyu Bum Hwang
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.3
    • /
    • pp.569-573
    • /
    • 1996
  • We study some special cases of Chow groups of a ramified complete regular local ring R of dimension n. We prove that (a) for codimension 3 Gorenstein ideal I, [I] = 0 in $A_{n-3}(R)$ and (b) for a particular class of almost complete intersection prime ideals P of height i, [P] = 0 in $A_{n-i}(R)$.

  • PDF

FINITE NON-NILPOTENT GENERALIZATIONS OF HAMILTONIAN GROUPS

  • Shen, Zhencai;Shi, Wujie;Zhang, Jinshan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.6
    • /
    • pp.1147-1155
    • /
    • 2011
  • In J. Korean Math. Soc, Zhang, Xu and other authors investigated the following problem: what is the structure of finite groups which have many normal subgroups? In this paper, we shall study this question in a more general way. For a finite group G, we define the subgroup $\mathcal{A}(G)$ to be intersection of the normalizers of all non-cyclic subgroups of G. Set $\mathcal{A}_0=1$. Define $\mathcal{A}_{i+1}(G)/\mathcal{A}_i(G)=\mathcal{A}(G/\mathcal{A}_i(G))$ for $i{\geq}1$. By $\mathcal{A}_{\infty}(G)$ denote the terminal term of the ascending series. It is proved that if $G=\mathcal{A}_{\infty}(G)$, then the derived subgroup G' is nilpotent. Furthermore, if all elements of prime order or order 4 of G are in $\mathcal{A}(G)$, then G' is also nilpotent.

Estimation of Traffic Accident Effectiveness of Zig-zag Marking Using a Comparison Group Method (C-G Method를 이용한 지그재그 노면표시의 교통사고 감소효과 분석)

  • Kwon, Seong-Keun;Lee, Young-Ihn;Cho, Song-Jun
    • International Journal of Highway Engineering
    • /
    • v.14 no.6
    • /
    • pp.149-158
    • /
    • 2012
  • PURPOSES : This research is to evaluate the effects of zig-zag marking. METHODS : Based on the literature review, This research adopt Comparison Group method which was developed by Hauer. RESULTS : The findings are as follows. Effectiveness of treatment at all site 1.06, intersection 0.92, median bus lane 1.93, school zone 0.50, below 6-lane 0.48, above 6-lane 1.19, cat vs person 0.57, car vs car 1.36, car only 1.29. CONCLUSIONS : Though the analysis, it was founded that zig-zag marking on the small scale road(below 6-lane) and school zone contribute to reduce traffic accidents(effectiveness of the treatment : 0.50, 0.48). But the accidents at large scale road and median bus lane where installed zig-zag marking demonstrated negative result.(effectiveness of the treatment indicates exceed 1.0).

Automatic Calculation of Interior Volume of Refrigerator by Hole Filling Algorithm (분해모델과 구멍 메움 알고리즘을 이용한 냉장고 내부 용적의 자동 계산)

  • Park, Raesung;Fu, Jianhui;Jung, Yoongho;Park, Mingeun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.22 no.1
    • /
    • pp.59-69
    • /
    • 2017
  • Internal capacity of a refrigerator is an important indicator for design and purchasing criteria. The components facing the internal space may have holes or gaps between parts. In traditional way, design engineers manually remodeled the parts to fill the holes and the gaps for enclosed boundary of the internal space. Then they calculated internal volume by subtracting the assembly of parts from its enclosing volume. However, filling holes and gaps is not an automated process requiring a plenty of labor and time. In this research, we have developed a voxel-based method to estimate the internal volume of a refrigerator automatically. It starts transforming all components facing the interior space into voxels and fills all holes and gaps automatically by the developed hole-filling algorithm to form a completely closed boundary of the assembly. Then, it identifies the boundary voxels that are facing to the internal voxels with any part of the component. After getting the intersection points between the boundary voxels and the surfaces of components, it generates the boundary surface of triangular facets with the intersection points. Finally, it estimates the internal volume by adding volume of each tetrahedron composed of a triangle of boundary surface and an arbitrary point.

The View Character of Mountainscape of a City according to Visual Point Level - In a Case of Mt. Uam - (시가지내 산악경관의 시점 높이별 조망 특성 - 청주시 우암산을 대상으로 -)

  • Jeong, Jeong Seop;Gwon, Sang Jun;Jo, Tae Dong
    • Journal of Environmental Science International
    • /
    • v.13 no.6
    • /
    • pp.497-503
    • /
    • 2004
  • In this research, we have performed a T-test to see how the relationship between dependent variable or visual point level and independent variable or visual quantity is in order to clear up the correlation between pattern of visual point and visual quantity by the constituents of a view from a different visual point level and the results are as follows: 1) In case of the character of Mt. Uam landscape of the city, Uamsan is set as a fixed point and about a direction of view(D), the north is a datum point from which the range of direction is distributed within 1800 westwardly and the visual range(R) is also within 2000m. An elevation is an average of 7.40 and the average story of the buildings is 3.85. Here the height of a story is about 4m so the average of the visual point difference is estimated at 15.4m. 2) The type of visual point is divided into the intersection group and the front of the highly used public buildings group. Double intersection types account for about 78.80%(52 spots) which forms a majority part of LCP. 3) The analysis of the difference of visual point level divided by eye level and that of the top of the buildings has been proved that there's a sharp difference resulted from t-test at 1 % significant level. The significant difference of elevation from height difference(l5.93m), however, has not been shown. 4) From the result of T-test about visual quantity by the elements of a view from a different visual point level, the visual quantity of mountain(VQM), sky(VQS), ground(VQG) is significant at about 1% each and that of building(VQB) is at about 5%. The difference in visual quantity of a mountain by the visual point level is at about 4% which can meet a marginal level of LCP necessary for evaluation of mountainscape.

Fair Private Matching with Semi-Trusted Third Party (STTP를 활용한 공평한 비밀 매칭)

  • Kim, E-Yong;Hong, Jeong-Dae;Cheon, Jung-Hee;Park, Kun-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.446-450
    • /
    • 2008
  • Private Matching is the problem of computing the intersection of private datasets of two parties without revealing their own datasets. Freedman et al.[1] introduced a solution for the problem, where only one party gets private matching. When both parties want to get private matching simultaneously, we can consider the use of Kissner and Song[2]'s method which is a privacy-preserving set intersection with group decryption in multi-party case. In this paper we propose new protocols for fair private matching. Instead of group decryption we introduce a Semi-Trusted Third Party for fairness. We also propose an update procedure without restarting the PM protocol.

Road network data matching using the network division technique (네트워크 분할 기법을 이용한 도로 네트워크 데이터 정합)

  • Huh, Yong;Son, Whamin;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.285-292
    • /
    • 2013
  • This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

An Regression Analysis for Variables on Effect of Development of Scientific Thinking (과학적 사고력 발달에 영향을 미치는 변인의 회귀분석 결과)

  • Kim, Young-Shin;Chung, Wan-Ho
    • Journal of The Korean Association For Science Education
    • /
    • v.21 no.4
    • /
    • pp.710-724
    • /
    • 2001
  • The purpose of this study was to regression analysis for variables on effect of development of scientific thinking. The subjects sampled in this study was 117 5th grade students, 131 8th grade students, and 127 11th grade students. The students were administered test of 10 questionnaires. The GALT(group assessment of logical thinking), FIT(figured intersection test), and GEFT(group embedded figural intersection test) were used which developed previous researchers. And other questionnaires were modified. The result of this study showed that cognitive variables, psychological variables, home variables and learning environment variables made effects on scientific thinking. Cognitive variables, psychological variables, home variables, and learning environment variables explained 60%, 10%, 5% and 10% to scientific thinking. All of those variables explained around 86%. Overall, 5th, 8th and 11th grade models were similar but with some differences in the effects of contextual variables with in the models.

  • PDF