• Title/Summary/Keyword: 탐색적 특징

Search Result 869, Processing Time 0.03 seconds

Formation and Evolution of Ulsan Automobile Cluster (울산 자동차클러스터의 형성과 발전전망)

  • Lee, Jeong-Hyop
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.10 no.1
    • /
    • pp.1-18
    • /
    • 2007
  • This study examines the development direction of Ulsan automobile cluster and suggests strategic interventions, based on the possibility of system transformation in the open economic system. The spatial characteristics of global, national and local production and R&D networks were analyzed to investigate the conditions of Ulsan automobile cluster. And the agglomeration process of automobile industry and the capabilities accumulated in Ulsan were analyzed and alternative developmental path and policy suggestions were proposed.

  • PDF

Study for searching optimal parameters for analog based downscaling method (아날로그 공간상세화 기법의 적정 매개변수 탐색 연구)

  • Kim, Seon-Ho;Bae, Deg-Hyo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2022.05a
    • /
    • pp.66-66
    • /
    • 2022
  • 아날로그 기법은 대표적인 공간상세화 기법 중 하나로써, 과거 기상 현상이 미래 재현된다는 가정 하에 목표 시점과 가장 유사한 기상패턴을 보이는 과거 시점을 활용하여 공간상세화를 수행하는 방법이다. 상세화 목표 시점과 가장 유사한 과거 시점을 찾기 위해서는 선결되어야 하는 매개변수가 존재한다. 특히 상세화 성능에 민감한 것으로 알려진 매개변수로는 목표 시점과 유사한 과거 시점 탐색에 활용되는 시공간 범위, 상세화 변수와 역학적 관계를 가지고 있는 종관기상변수, 상세화에 활용되는 과거 시점의 개수 등이 있다. 아날로그 기법의 매개변수를 탐색하고자 하는 시도는 국외에서 여러 차례 진행되어 왔으나, 각 매개변수는 지역의 기상특징에 따라 상이한 결과를 나타내었다. 국내에서는 국외에서 수행한 탐색 결과를 활용하여 공간상세화를 주로 수행하여 왔지만, 보다 높은 성능의 상세화를 수행하기 위해서는 국내 지역에 맞는 매개변수를 활용하는 것이 타당하다. 본 연구에서는 국내 지역에 적합한 아날로그 공간상세화 매개변수를 탐색하고 이를 제시하고자 한다. 탐색된 매개변수는 아날로그 공간상세화 기법뿐만 아니라 다양한 공간상세화 기법에 활용하능한 정보이기 때문에, 연구결과의 활용성이 높을 것으로 판단된다.

  • PDF

Study on the the Emergence and Characteristics of Private Social Service Organizations in the Mokpo Region (목포지역 민간 사회사업기관의 출현과 특징에 관한 연구)

  • Choi, Jeong-Min
    • Korean Journal of Social Welfare Studies
    • /
    • v.45 no.3
    • /
    • pp.209-235
    • /
    • 2014
  • This is an exploratory study that has formulated the formulation and development processes of private social service organizations in the Mokpo region and has drawn the social background in their hidden side and social service-oriented implications. To this end, this study examined the formation and development processes of private social service organizations from 1897 when Mokpo opened its port to the late 1960s when private social services were actively carried out in order to examine the formation and practice processes of social service organizations in Mokpo. The analysis results were as follows. First, the response of private social service organizations to the social desires of Mokpo residents played a major role. Second, even if private organizations played a large role in the formation and development processes of social service, the government's support and Social support was confirmed to be essential for consistent development.

Space Exploration Using Real-time Graph Search Algorithms (실시간 그래프 탐색 알고리즘을 이용한 공간 탐사)

  • Choi, Eun-Mi;Kim, In-Cheol
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.595-597
    • /
    • 2005
  • 본 논문에서는 자율 에이전트에 의해 미지의 공간을 탐사하는 실시간 그래프 탐색 알고리즘 DFS-RTA*와 DFS-PHA*를 제안하고 그 효율성을 비교한다. 두 알고리즘들은 모두 깊이-우선 탐색(DFS)을 기초로 하고 있으며, 직전 노드로의 빠른 후진(backtrack) 을 위해 각각 실시간 최단 경로 탐색 방법인 RTA*와 PHA*를 적용하는 것이 특징이다. 본 논문에서는 대표적인 3차원 온라인 게임 환경인 Unreal Tournament 게임과 지능형 캐릭터 에이전트인 KGBot를 이용한 실험을 통해 두 탐색 알고리즘의 완전성과 효율성을 분석해본다.

  • PDF

미지의 공간 탐사를 위한 실시간 그래프 탐색

  • Choe, Eun-Mi;Kim, In-Cheol
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.05a
    • /
    • pp.222-231
    • /
    • 2005
  • 본 논문에서는 자율 에이전트에 의해 미지의 공간을 탐사하는 실시간 그래프 탐색 알고리즘 $DFS-RTA^{\ast}$$DFS-PHA^{\ast}$를 제안하고 그 효율성을 비교한다. 두 알고리즘들은 모두 깊이-우선 탐색(DFS)을 기초로 하고 있으며, 직전 노드로의 빠른 후진(backtrack) 을 위해 각각 실시간 최단 경로 탐색 방법인 $RTA^{\ast}$$PHA^{\ast}$를 적용하는 것이 특징이다. 본 논문에서는 대표적인 3차원 온라인 게임 환경인 Unreal Tournament 게임과 지능형 캐릭터 에이전트인 KGBot를 이용한 실험을 통해 두 탐색 알고리즘의 완전성과 효율성을 분석해본다.

  • PDF

Relationship between Appearance Management Behavior and Information Search of Male Workers (남성의 외모관리 행동과 정보탐색과의 관계 고찰)

  • Kim, Hye-Kyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.11
    • /
    • pp.6484-6491
    • /
    • 2014
  • The human's basic desire for aesthetics, which has existed along with human history, has been more individualized and diversified according to the progress of modern economic social change. In the case of men, who have a relatively higher connection and experience of mass media compared to women, there is a characteristic to apply and utilize information acquisition and share appearance management quickly on the media. This paper classified and arranged the image and characteristics of the modern male image analyzed the relationship between men's appearance management and information exploration. In addition, exploration relation per information medium was considered by dividing the men's appearance management behavior and characteristics into make-up, hair management, skin care, hands and feet care, and plastic surgery. This appears to be useful for the industrial group, e.g. beauty treatment, cosmetics, hospital, etc. as advertisement marketing information.

Fast Multi-Resolution Exhaustive Search Algorithm Based on Clustering for Efficient Image Retrieval (효율적인 영상 검색을 위한 클러스터링 기반 고속 다 해상도 전역 탐색 기법)

  • Song, Byeong-Cheol;Kim, Myeong-Jun;Ra, Jong-Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.117-128
    • /
    • 2001
  • In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

  • PDF

Vision-based Camera Localization using DEM and Mountain Image (DEM과 산영상을 이용한 비전기반 카메라 위치인식)

  • Cha Jeong-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.177-186
    • /
    • 2005
  • In this Paper. we propose vision-based camera localization technique using 3D information which is created by mapping of DEM and mountain image. Typically, image features for localization have drawbacks, it is variable to camera viewpoint and after time information quantify increases . In this paper, we extract invariance features of geometry which is irrelevant to camera viewpoint and estimate camera extrinsic Parameter through accurate corresponding Points matching by Proposed similarity evaluation function and Graham search method we also propose 3D information creation method by using graphic theory and visual clues, The Proposed method has the three following stages; point features invariance vector extraction, 3D information creation, camera extrinsic Parameter estimation. In the experiments, we compare and analyse the proposed method with existing methods to demonstrate the superiority of the proposed methods.

  • PDF

Landmark Recognition Method based on Geometric Invariant Vectors (기하학적 불변벡터기반 랜드마크 인식방법)

  • Cha Jeong-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.173-182
    • /
    • 2005
  • In this paper, we propose a landmark recognition method which is irrelevant to the camera viewpoint on the navigation for localization. Features in previous research is variable to camera viewpoint, therefore due to the wealth of information, extraction of visual landmarks for positioning is not an easy task. The proposed method in this paper, has the three following stages; first, extraction of features, second, learning and recognition, third, matching. In the feature extraction stage, we set the interest areas of the image. where we extract the corner points. And then, we extract features more accurate and resistant to noise through statistical analysis of a small eigenvalue. In learning and recognition stage, we form robust feature models by testing whether the feature model consisted of five corner points is an invariant feature irrelevant to viewpoint. In the matching stage, we reduce time complexity and find correspondence accurately by matching method using similarity evaluation function and Graham search method. In the experiments, we compare and analyse the proposed method with existing methods by using various indoor images to demonstrate the superiority of the proposed methods.

  • PDF

A Study on Hybrid Fuzzing using Dynamic Analysis for Automatic Binary Vulnerability Detection (바이너리 취약점의 자동 탐색을 위한 동적분석 정보 기반 하이브리드 퍼징 연구)

  • Kim, Taeeun;Jurn, Jeesoo;Jung, Yong Hoon;Jun, Moon-Seog
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.6
    • /
    • pp.541-547
    • /
    • 2019
  • Recent developments in hacking technology are continuing to increase the number of new security vulnerabilities. Approximately 80,000 new vulnerabilities have been registered in the Common Vulnerability Enumeration (CVE) database, which is a representative vulnerability database, from 2010 to 2015, and the trend is gradually increasing in recent years. While security vulnerabilities are growing at a rapid pace, responses to security vulnerabilities are slow to respond because they rely on manual analysis. To solve this problem, there is a need for a technology that can automatically detect and patch security vulnerabilities and respond to security vulnerabilities in advance. In this paper, we propose the technology to extract the features of the vulnerability-discovery target binary through complexity analysis, and select a vulnerability-discovery strategy suitable for the feature and automatically explore the vulnerability. The proposed technology was compared to the AFL, ANGR, and Driller tools, with about 6% improvement in code coverage, about 2.4 times increase in crash count, and about 11% improvement in crash incidence.