• Title/Summary/Keyword: Adjacency

Search Result 234, Processing Time 0.026 seconds

A Study on The Risk Level of Work Types in Urban Railway Construction (도시철도 건설공사의 공종별 위험도에 관한 연구)

  • Lee, Jong-Bin;Han, In-Kuk;Chang, Seong Rok
    • Journal of the Korean Society of Safety
    • /
    • v.31 no.2
    • /
    • pp.98-103
    • /
    • 2016
  • The goals of this study were to investigate some significant factors to judge level of safety at urban railway construction field and to analyze degree of risk by work classification. Currently, there are lots of construction fields for the urban railway for national transportation, and our government also planned constructing more urban railway in near future. However, most of the researches on safety neglected the degree of risk factors on the urban railway construction field. Safety managers participated in the brainstorming session for deriving decision criteria of the degree of risk (i.e., significant factors). Then, they were asked to answer a structured questionnaire which was developed for deriving most important factors. Finally, the analytic hierarchy process (AHP) was used to analyze level of risk by work classification. The following results were obtained. First, total twelve factors judging degree of risk were found in the brainstorming session. Second, the questionnaire showed four significant factors, including adjacency of obstacle, intensity of work, unsafe condition and work space. Third, the results of AHP showed civil work is the most dangerous work among 6 work types. The results could be used to give the safety management priority on accident prevention efforts among several hazards and to reduce degree of risk in construction field of the urban railway.

Reconstructing Curves With Self-intersections (자기교차를 가지는 곡선 재구성)

  • Kim, Hyoung-Seok B.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2016-2022
    • /
    • 2010
  • We propose a new algorithm for reconstructing curves with self-intersections from sample points. In general, the result of curve reconstruction depends on how to select and order the representative points to resemble the shape of sample points. Most of the previous point ordering approaches utilize the Euclidean distance to compute the proximity of sample points without directional information, so they can not solve the non-simple curve reconstruction problem. In this paper, we develop a new distance estimating the adjacency between sample points, which is derived from the standard normal distribution of Brownian motion. Experimental results show that this approach is very effective to non-simple curve reconstruction.

Distributed Processing Method of Hotspot Spatial Analysis Based on Hadoop and Spark (하둡 및 Spark 기반 공간 통계 핫스팟 분석의 분산처리 방안 연구)

  • Kim, Changsoo;Lee, Joosub;Hwang, KyuMoon;Sung, Hyojin
    • Journal of KIISE
    • /
    • v.45 no.2
    • /
    • pp.99-105
    • /
    • 2018
  • One of the spatial statistical analysis, hotspot analysis is one of easy method of see spatial patterns. It is based on the concept that "Adjacent ones are more relevant than those that are far away". However, in hotspot analysis is spatial adjacency must be considered, Therefore, distributed processing is not easy. In this paper, we proposed a distributed algorithm design for hotspot spatial analysis. Its performance was compared to standalone system and Hadoop, Spark based processing. As a result, it is compare to standalone system, Performance improvement rate of Hadoop at 625.89% and Spark at 870.14%. Furthermore, performance improvement rate is high at Spark processing than Hadoop at as more large data set.

Variation of Cannonical Sentence Structure in Korean & Japanese Dialects & its Implication

  • Khym, Han-gyoo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.142-148
    • /
    • 2015
  • The main purpose of this squib is to provide a new principled account for variation of canonical sentence structure in Korean and Japanese based on the linguistic data commonly observed in some dialects of Korean and Japanese. Unlike the English case in which Comp(lementizer) such as 'that' in an embedded clause freely drops as far as the ECP (Lasnik & Saito 1992) is obeyed, some dialects of both Korean and Japanese show interesting linguistic data very different from those of English, thereby leading us to reasonably doubt the traditionally-accepted paradigm of the canonical sentence structure of CP for all languages. In this squib I propose, based on Korean & Japanese dialects and by developing the Minimal Structure Principle (MSP) ($Bo{\check{s}}kovi{\acute{c}}$ 1997, p. 25), that the cannonical structure of a sentence is not fixed, from the beginning at all, to be one single maximal category, CP. Instead, it should be decided to be either CP or IP, based on the feature of [${\pm}$markedness] and MSP, and the marked (or non-cannonical) embedded sentence needs to satisfy ECP for adjacency (or feature-licensing by the matrix verb in the MP terminology).

An Interdependent Data Allocation Scheme Using Square Root Rule of Data Access Probability (데이터 액세스 확률의 제곱근 법칙을 이용한 상호 관련 데이터 할당 기법)

  • Kwon, Hyeokmin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.75-84
    • /
    • 2015
  • A data allocation technique is essential to improve the performance of data broadcast systems. This paper explores the issues for allocating data items on broadcast channels to process multiple-data queries in the environment where query profiles and query request rates are given, and proposes a new data allocation scheme named IDAS. The proposed scheme employs the strategy that the broadcast frequency of each data is determined by the square root value of its relative access probability. IDAS could enhance the performance of query response time since it can process queries of high request rate fast and show a resonable degree of query data adjacency. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that IDAS outperforms other schemes in terms of the average response time.

A Study on Segmentation of Building Points Utilizing Scan-line Characteristic of Airborne Laser Scanner (항공레이저측량 자료의 스캔라인 특성을 활용한 건물 포인트 분리에 관한 연구)

  • Han, Su-Hee;Lee, Jeong-Ho;Yu, Ki-Yun;Kim, Yong-Il;Lee, Byung-Kil
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.13 no.4 s.34
    • /
    • pp.33-38
    • /
    • 2005
  • The goal of this study is to segment building points effectively utilizing scan-line characteristics of airborne laser scanner. Points are classified as to their altitude similarity and adjacency with other classified points, and point searching range for the classification is restricted within some number of scan-lines, preventing classification speed from lowering as the process goes on. Besides, we detected wrong discrimination of one object into more than two classes, then integrated them into a single class. Consequently we could discriminate points of each building from others, its annexes and none building points simultaneously.

  • PDF

DIGITAL TOPOLOGICAL PROPERTY OF THE DIGITAL 8-PSEUDOTORI

  • LEE, SIK;KIM, SAM-TAE;HAN, SANG-EON
    • Honam Mathematical Journal
    • /
    • v.26 no.4
    • /
    • pp.411-421
    • /
    • 2004
  • A digital $(k_0,\;k_1)$-homotopy is induced from digital $(k_0,\;k_1)$-continuity with the n kinds of $k_i$-adjacency relations in ${\mathbb{Z}}^n$, $i{\in}\{0,\;1\}$. The k-fundamental group, ${\pi}^k_1(X,\;x_0)$, is derived from the pointed digital k-homotopy, $k{\in}\{3^n-1(n{\geq}2),\;3^n-{\sum}^{r-2}_{k=0}C^n_k2^{n-k}-1(2{\leq}r{\leq}n-1(n{\geq}3)),\;2n(n{\geq}1)\}$. In this paper two kinds of digital 8-pseudotori stemmed from the minimal simple closed 4-curve and the minimal simple closed 8-curve with 8-contractibility or without 8-contractibility, e.g., $DT_8$ and $DT^{\prime}_8$, are introduced and their digital topological properties are studied by the calculation of the k-fundamental groups, $k{\in}\{8,\;32,\;64,\;80\}$.

  • PDF

Channel Reordering and Prefetching Techniques for Efficient Channel Navigation in IPTVs (효율적인 IPTV 채널 탐색을 위한 채널 재배치 및 프리페칭 기법)

  • Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.1-6
    • /
    • 2016
  • As IPTV has become one of the major Internet services, IPTV users and channels increase rapidly. However, the increased number of channels makes users difficult to find their desired channels. Along with this, the channel switching time of IPTV incurs serious user-perceived delay. To alleviate these problems, this paper presents hybrid schemes that combine channel prefetching and reordering schemes. Simulation experiments show that combining adjacency based prefetching and popular channel reordering reduces the channel seek time by up to 44.7% in comparison with the conventional channel seeking interfaces.

East Asian Trade Flows of Cultural Goods: A Gravity Model Approach

  • Yu, Shasha;Park, Eui Burm
    • Asia-Pacific Journal of Business
    • /
    • v.2 no.1
    • /
    • pp.49-73
    • /
    • 2011
  • With the market evaluation of economic globalization exchanges between different cultures, cultural trade has been developing at an accelerated speed, and also playing an important role in East Asian intra-regional trade. In this research the author used gravity trade model to explain the causal relationship between dependent variable trade flows and several independent variables applying with five categories cultural goods which classified in HS codes. Firstly for cultural heritage trade flow, the results indicated that economic masses of bilateral countries have no significant influences on it; GDP per capita of host country and adjacency factor with partner country have significant negative influences on it; Internet coverage ratio has improved cultural heritages exchanges in East Asian regions. Secondly for printed matter cultural goods trade flow, the distance factor has significant negative influence but common language has significant positive influence on it. Thirdly for recorded media cultural goods, only economic masses and GDP per capita of bilateral countries can improved their trade flows. Fourthly for visual arts cultural products trade flows, almost all variables we tested have significant influences on it. Fifthly for cinema photography cultural goods trade flow, the influenced factor are same with cultural heritage products except they have strong positive interaction relationship with economic masses and common language. At last, the paper figured out some important and potential sectors for cultural goods trade in East Asia and gave some suggestions to government and cultural goods product enterprises.

  • PDF

Where a Null C Fails to PF-merge

  • Hong, Sung-Shim
    • Language and Information
    • /
    • v.9 no.2
    • /
    • pp.69-83
    • /
    • 2005
  • This paper discusses the distribution of a null complementizer C, as opposed to an overt counterpart 'that', presenting empirical support both for and against the PF-merge analysis of C proposed by Boscovic and Lasnik (2003, henceafter B&L) who in turn attribute to the proposal in Pesetsky (1992) and Halle & Marantz (1993). In Section I, as a background, I discuss B&L's proposal that a null complementizer C is a PF-affix which undergoes a PF-merger operation at the PF component. In Section 2, after a brief sketch of the distribution of a null C mostly in bare-relatives, I explore the possibility of extending B&L's analysis to accomodate the null C's in the bare-relative constructions. In Section 3, I argue that despite some empirical difficulties, B&L's analysis of a null C as a PF-affix can still be maintained, if Adverb Fronting is an operation to Spec-C position. Furthermore, I propose a rule - PF Spell-Out Constraint - to account for the C-trace (i.e. that-trace) effect in relative constructions. With the PF Spell-Out Constraint and B&L's PF-merge account, the distribution of a null C can better be analyzed.

  • PDF