• Title/Summary/Keyword: ITS 영역

Search Result 4,198, Processing Time 0.034 seconds

Development of Shortest Path Searching Network Reduction Algorithm (최단경로 탐색영역 축소 알고리즘 개발)

  • Ryu, Yeong-Geun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.2
    • /
    • pp.12-21
    • /
    • 2013
  • This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

Detecting Salient Regions based on Bottom-up Human Visual Attention Characteristic (인간의 상향식 시각적 주의 특성에 바탕을 둔 현저한 영역 탐지)

  • 최경주;이일병
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.189-202
    • /
    • 2004
  • In this paper, we propose a new salient region detection method in an image. The algorithm is based on the characteristics of human's bottom-up visual attention. Several features known to influence human visual attention like color, intensity and etc. are extracted from the each regions of an image. These features are then converted to importance values for each region using its local competition function and are combined to produce a saliency map, which represents the saliency at every location in the image by a scalar quantity, and guides the selection of attended locations, based on the spatial distribution of saliency region of the image in relation to its Perceptual importance. Results shown indicate that the calculated Saliency Maps correlate well with human perception of visually important regions.

A Study on the Smart Workers' Perception of the Boundary Strength Between Work and Nonwork (스마트워크 이용자의 업무와 비업무간 경계 강도 인식에 관한 연구)

  • Kim, Yong-Young;Oh, Sangjo;Lee, Heejin
    • Information Systems Review
    • /
    • v.15 no.3
    • /
    • pp.71-87
    • /
    • 2013
  • Companies as well as the Korean government show growing attention to the Smart Work which is enabled by the ongoing development of information and communication technologies (ICTs). Smart Work can be regarded as an extended version of telecommuting or distance work and defined as "working efficiently and conveniently regardless of time and place utilizing ICTs." Smart Work currently puts its emphasis on the work and life balance by changing the ways of working. Despite its emphasis on work and life balance, it is expected the boundaries between work and nonwork would blur, work and nonwork boundaries may become more permeable, and role conflicts would occur more times than before. To find ways to enhance work and life balance while escaping from expected conflicts in the context of Smart Work, we investigate the work and nonwork boundary strengths and the factors affecting them. In the course, we consider asymmetries between the work and nonwork boundary strengths and bidirectional nature of work and nonwork permeability. We develop two research models having work and nonwork boundary strengths as respective dependent variables. We empirically found that work role identification and nonwork-to-work permeability had influences on the boundary strength at work and that work-to-nonwork permeability affected the boundary strength at nonwork. However, nonwork role identification did not show any significant influence on the boundary strength at nonwork.

  • PDF

Phylogenetic Analysis on Wild Cordyceps Collected from Miryang Region of South Korea (밀양근교에서 채집한 야생 동충하초 계통의 PCR 산물에 근거한 계통 유전학적 연구)

  • Park, Hyeancheal;Lee, Sangmong;Park, Namsook
    • Korean Journal of Plant Resources
    • /
    • v.34 no.1
    • /
    • pp.1-16
    • /
    • 2021
  • The phylogenetic relationships among thirty-two strains (P1~P32; including Cordyceps sp., Paecilomyces sp., Beauveria sp., Aranthomyces sp., Isaria sp. and Himenostilbe sp.) in Miryang region located in the southern part of Korea, were investigated based on internal transcribed spacer (ITS) sequences of ribosomal DNA. A fragment of ITS region was amplified by polymerase chain reaction (PCR) using the specific primer pairs ITS1 and ITS4. After obtained same size of PCR products from various strains, we cloned them into a pGEM-T easy vector to determine their sequences. BLAST analyses of the nucleotide sequence ITS1, 5.8S and ITS2 gene fragments revealed the identity and their phylogenetic relationship. Among 32 strains isolated from Miryang region, Cordyceps militaris was shared 100% sequences with Genbank (AY49191, EU825999, AY491992), while some species are not shared perfectly with reported sequences. For example, strain P17 (P. tenuipes in Ulju-gun Gaji Mountain) has some differences among the other strains of P. tenuipes (Miryang-si Jocheon-eup, Miryang-si Gaji Mountain) and those of gene bank. We conclude that ITS analyses with strains in the suburbs of Miryang in this study can be effectively used as a tool for classification, evaluation and collection of the natural eco-type genetic resources.

An Adaptive ROI Mask Generation for ROI coding of JPEG2000 (JPEG200의 관심영역 부호화를 위한 적응적인 관심영역 마스크 생성 방법)

  • Kang, Ki-Jun;Seo, Yeong-Geon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.5
    • /
    • pp.39-47
    • /
    • 2007
  • In this thesis, a method of generating an adaptable Region-Of-Interest(ROI) Mask for the Region-Of-Interest coding is suggested. In the method, an ROI Mask is generated using the information of the ROI designated by a user. In the existed method of ROI coding, after scanning all the pixels in order and discriminating an ROI, an ROI Mask is generated. But, in our method, after scanning a part of pixels based on the shape pattern of an ROI and discriminating a ROI by one code block unit, an ROI Mask is generated. Moreover, from the method, a pattern number, threshold of a ROI and background threshold parameter are provided. According to the result of its comparing test with the existed methods to show the usability, it is proved that our method is superior in speed to the existed ones.

  • PDF

Exploring the direction of Assessment in Korean High School Mathematics through College Scholastic Ability Test Mathematics Domain Changes (대학수학능력시험 수학 영역의 변화를 통해 살펴본 고등학교 수학 평가의 방향 탐색)

  • Choi, Inseon;Lee, Sehyung;Moon, Duyeol
    • Journal of the Korean School Mathematics Society
    • /
    • v.26 no.2
    • /
    • pp.137-158
    • /
    • 2023
  • This study aimed to analyze the shifts in the mathematics domains of the College Scholastic Ability Test (CSAT) since its inception in 1993, with the intent of identifying improvements for the future. The goal is to provide insights for exploring the direction of assessment in Korean high school mathematics education. To this end, we focused on the test system, content area, and behavioral area within the CSAT mathematics domains. Key findings include: first, the test structure influences the assessment factors and item types, in addition to the examination time and number of items. Second, by analyzing the content area, we established a correlation between the national curriculum and assessment area, and confirmed the importance of setting the assessment area. Third, the examination of the behavioral area tended to the item-type fixation, demonstrating the necessity of the ongoing modifications in evaluation item types. Building upon these findings, we discuss the direction of an evaluation that considers the evolving demands and shifts within mathematics education.

Extraction of Text Alignment by Tensor Voting and its Application to Text Detection (텐서보팅을 이용한 텍스트 배열정보의 획득과 이를 이용한 텍스트 검출)

  • Lee, Guee-Sang;Dinh, Toan Nguyen;Park, Jong-Hyun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.11
    • /
    • pp.912-919
    • /
    • 2009
  • A novel algorithm using 2D tensor voting and edge-based approach is proposed for text detection in natural scene images. The tensor voting is used based on the fact that characters in a text line are usually close together on a smooth curve and therefore the tokens corresponding to centers of these characters have high curve saliency values. First, a suitable edge-based method is used to find all possible text regions. Since the false positive rate of text detection result generated from the edge-based method is high, 2D tensor voting is applied to remove false positives and find only text regions. The experimental results show that our method successfully detects text regions in many complex natural scene images.

Variations of Autocovariances of Speech and its related Signals in time, frequency and quefrency domains (음성 및 음성 관련 신호의 주파수 및 Quefrency 영역에서의 자기공분산 변화)

  • Kim, Seon-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.340-343
    • /
    • 2011
  • To distinguish between a group of speech signals and nonspeech signals, you can use several features in domains like frequency, quefrency and time. It is very important to use features that differentiate two signal groups. As a feature to separate two signal groups, autocorrelation method was proposed and the variances between groups were studied. Autocovariances were just calculated for the time domain signal. Signals were divided into segments which consist of 128 data to be transformed to the frequency and quefrency domains. Autocovariances between each coefficient of segments in FFTs and quefrencies were found and they were averaged over wide spectrum. It is clear that the autocovariances in frequency domain show great differences between groups of signals.

  • PDF

Triangular Mesh Segmentation Based On Surface Normal (표면 법선 기반의 삼각형 메쉬 영역화 기법)

  • Kim, Dong-Hwan;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.22-29
    • /
    • 2002
  • This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property Thus, each region can be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the Proposed algorithm is peformed efficiently.

Fast Scattered-Field Calculation using Windowed Green Functions (윈도우 그린함수를 이용한 고속 산란필드 계산)

  • 주세훈;김형훈;김형동
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.7
    • /
    • pp.1122-1130
    • /
    • 2001
  • In this paper, by applying the spectral domain wavelet concept to Green function, a fast spectral domain calculation of scattered fields is proposed to get the solution for the radiation integral. The spectral domain wavelet transform to represent Green function is implemented equivalently in space via the constant-Q windowing technique. The radiation integral can be calculated efficiently in the spectral domain using the windowed Green function expanded by its eigen functions around the observation region. Finally, the same formulation as that of the conventional fast multipole method (FMM) is obtained through the windowed Green function and the spectral domain calculation of the radiation integral.

  • PDF