• Title/Summary/Keyword: BIG TREE

Search Result 222, Processing Time 0.023 seconds

The Relationship of the Concentration in Physical space and the proliferation of Cyber space : focusing on the Concentration of Plastic Surgery Clinics at Kangnam-gu, Korea (사이버 공간의 확산과 물리적 공간에서의 집중화 현상의 관련성 : 성형외과의 강남구 집중현상 고찰)

  • Cho, Yeong-Bin;Choi, Young-Keun
    • Journal of Information Technology Applications and Management
    • /
    • v.19 no.1
    • /
    • pp.85-100
    • /
    • 2012
  • The development of technology causes a lot of change. Many researchers have insisted that the proliferation of cyber space changes the physical space. Their insistences have been accumulated into three aspects. Firstly, the proliferation of cyber space brings out the concentration in the physical space, secondly the decentralization and lastly both at the same time. In Korea, the concentration of plastic surgery clinics has taken place in Kangnam-gu area at similar period of the Internet proliferation. In this research, we execute empirical study of whether the concentration of plastic surgery in specific areas correlates with the proliferation of cyber space or not. In order to do this, we verified homogeneity of plastic surgery websites between Kangnam-gu and Non-Kangnam-gu areas. Also, we used three statistical and data-mining techniques which are Multi-discriminant analysis, Decision tree analysis and artificial neural network analysis. As a result, there was homogeneity between two different area plastic surgery clinics websites, but there was not big heterogeneity as well. Therefore, in this case of concentration of plastic surgery in Korea, the proliferation of cyber space restrictively correlates with the concentration of physical space.

An Exploratory Study on Green IT Revitalization in Korea : Perspective of Building a Standardized National Green IT Brand (Green IT 활성화를 위한 탐색적 연구 : 국가 표준 Green IT 브랜드 제정을 중심으로)

  • Kang, Sang-Baek Chris
    • Journal of Information Technology Applications and Management
    • /
    • v.18 no.4
    • /
    • pp.149-168
    • /
    • 2011
  • The current study initiated from an action-plan level perspective of revitalizing Green IT (Information Technology) in Korea by building a standardized national Green IT brand. In order to setting up a national level brand, there should be a big quantitative survey for identifying Green IT brand concepts. For this, the current study provides exploratory research results based on preliminary interviews and literature survey before the quantitative survey. The present article suggests a research framework and describes important factors for setting up a national level Green IT brand. In-depth interviews with panels were executed and existing Green IT brands in other countries are summarized and asked for evaluation to a small number of panels. The research results show that (1) National level Green IT brand should include wider concepts of IT, (2) Green IT brand will be more appealed by the public when it is simple, straightforward, and intuitive, (3) Earth, Tree, and/or Water show higher correlation with Green IT concepts. Green IT brand will offer marketing promotion effects to companies who adopt national level Green IT brand as well as increase public use of Green IT in daily life. For this reason, Green IT brand will be a win-win strategy and this should be cared and executed by the related government agencies with long term perspective.

A Speed-Based Dijkstra Algorithm for the Line Tracer Control of a Robot (로봇 경로 제어를 위한 속도기반 Dijkstra 알고리즘)

  • Cheon, Seong-Kwon;Kim, Geun-Deok;Kim, Chong-Gun
    • Journal of Information Technology Services
    • /
    • v.10 no.4
    • /
    • pp.259-268
    • /
    • 2011
  • A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

Development of Hybrid Manipulator for Melon Harvesting Works (멜론 재배작업용 하이브리드 매니플레이터 개발)

  • Kim, Y.Y.;Cho, S.I.;Hwang, H.;Hwang, K.Y.;Park, T.J.
    • Journal of Biosystems Engineering
    • /
    • v.31 no.1 s.114
    • /
    • pp.52-58
    • /
    • 2006
  • Various robots were developed for harvesting fruits and vegetables. However, each robot was designed for a specific task such as harvesting apples or vegetables. This has been a big hurdle in application of robots to agriculture. A new type of hybrid manipulator with both parallel and serial joints was developed and designed to apply to various kinds of field operations. The hybrid manipulator had 2 extra degree of freedom in serial joints which made it flexible in switching one to the other type of hybrid manipulator, for example, PUMA to SCARA. And it was designed to harvest heavy fruits such as musky melons or water melons even behind leaves or branches of tree. This hybrid manipulator showed less than $\pm1mm$ position error. It was concluded that the hybrid manipulator was an effective and feasible tool to perform various works and to increase working performance.

A study on the Robust and Systolic Topology for the Resilient Dynamic Multicasting Routing Protocol

  • Lee, Kang-Whan;Kim, Sung-Uk
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.255-260
    • /
    • 2008
  • In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

On the performance of the hash based indexes for storing the position information of moving objects (이동체의 위치 정보를 저장하기 위한 해쉬 기반 색인의 성능 분석)

  • Jun, Bong-Gi
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.9-17
    • /
    • 2006
  • Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

  • PDF

A Study on the Data Mining Preprocessing Tool For Efficient Database Marketing (효율적인 데이터베이스 마케팅을 위한 데이터마이닝 전처리도구에 관한 연구)

  • Lee, Jun-Seok
    • Journal of Digital Convergence
    • /
    • v.12 no.11
    • /
    • pp.257-264
    • /
    • 2014
  • This paper is to construction of the data mining preprocessing tool for efficient database marketing. We compare and evaluate the often used data mining tools based on the access method to local and remote databases, and on the exchange of information resources between different computers. The evaluated preprocessing of data mining tools are Answer Tree, Climentine, Enterprise Miner, Kensington, and Weka. We propose a design principle for an efficient system for data preprocessing for data mining on the distributed networks. This system is based on Java technology including EJB(Enterprise Java Beans) and XML(eXtensible Markup Language).

HTSC and FH HTSC: XOR-based Codes to Reduce Access Latency in Distributed Storage Systems

  • Shuai, Qiqi;Li, Victor O.K.
    • Journal of Communications and Networks
    • /
    • v.17 no.6
    • /
    • pp.582-591
    • /
    • 2015
  • A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

Optimized Ballast Water Exchange Management for Tanker (탱커선 전용의 최적화된 밸러스트수 교체 관리)

  • Hong, Chung-You;Chang, Hyeong-Joon;Kwon, Sung-Jin;Choi, Young-Dal;Kim, Dong-Eon;Park, Je-Woong
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.225-230
    • /
    • 2003
  • Many port states such as New Zealand, the USA, Australia and Canada have strict regulations to prevent ships which arrive in their port from discharging polluted ballast water which contain harmful aquatic organisms and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, they perceived that the ballast exchange in deep sea is the most effective method, together with submitting the ballast management plan which contains the effective exchange method, ballast system and safety consideration. In this study, we make an effort to develop optimum ballast water exchange management and in result of that, it provide more convenient and stable process for preparing ballast water management plan.

  • PDF

A Study on the Aesthetic Preference for Rural Landscapes: urban and rural resident differences (도시 및 농촌거주자의 농촌경관선호도에 관한 연구)

  • 윤진옥;김유일;정기호
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.23 no.2
    • /
    • pp.93-103
    • /
    • 1995
  • The changes of rural landscape are currently spread everywhere and are rapidily being processed both in quality and in quantities of changes From such aspects, it is urgent to control the land scape change, and is required to know what is valued or preferred in rural landscape, This study was conducted to investigate preferences and differences of the responses between urban and rural residents to rural scenery. As a method, color-slide surrogates for rural landscape settings are shown to urban and rural residents, For a given 52 scenes of rural landscapes the respondents judged the familiarity, orality, and preference along a ten point scale. The following facts are found: 1) Refponses to certain types of landscape settings are influenced by the place of residence of the respondents. The urban residents highly rated natural components of the rural landscape. In contrast rural residents preferred the scenes with visible sign of development 2) The relations among the estimation of preference, familiarity and rurality in rural landscape were deeply correlated. When the rural lands(:ape is adequately ref resented as 'familiarity' or 'rurality' well the landscape is more preferred 3) It is found what is valued or preferred in rural landscape : Readjusted agricultural land, big tree, grassland hi dominated visually were preferred in rural landscape. The implication of this study is that successful planning of development or management in rural area will occur only when these different needs and values are acknowledged and accommodated.

  • PDF