• Title/Summary/Keyword: 중간 표현

Search Result 285, Processing Time 0.026 seconds

Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network (MPLS 망에서 칼라 스레드의 루프방지 알고리즘 개선)

  • 전환식;김한경
    • Journal of Internet Computing and Services
    • /
    • v.3 no.1
    • /
    • pp.41-49
    • /
    • 2002
  • Ohba has suggested the Colored Thread Algorithm to prevent looped path when LSP is to be setup. M immediate node sends thread information such as color, hop count. ill, to downs1ream node via LDP message for the set-up of LSP. Afterward, decides that the looped path is formed when it receives a message with a same colored thread that was sent to downs1ream node, and it searches another path. If the message reaches to the egress node, then acknowledged message is sent to upstream node as reverse direction to the ingress node to set up loop-free path. For the algorithm, Ohva has defined three thread states as Null, Colored, Transparent. In this paper, the state of thread is extended to 5 states such as Extending, Merging, Stalling, Null, and Transparent. By the way, related FSM and TCB was redefined to make clear the ambiguity of thread states which causes faulty actions and to remove overhead. And, to improve performance, it limits to generate a thread in the state of Stalling.

  • PDF

A Design of Teaching Unit for Secondary Pre-service Teachers to Explore Generalized Fobonacci Sequences (일반화된 피보나치수열의 탐구를 위한 예비중등교사용 교수단원의 설계)

  • Kim, Jin-Hwan;Park, Kyo-Sik
    • School Mathematics
    • /
    • v.11 no.2
    • /
    • pp.243-260
    • /
    • 2009
  • In this paper, we have designed a teaching unit for the learning mathematising of secondary pre-service teachers by exploring generalized fibonacci sequences. First, we have found useful formulas for general terms of generalized fibonacci sequences which are expressed as combinatoric notations. Second, by using these formulas and CAS graphing calculator, we can help secondary pre-service teachers to conjecture and discuss the limit of the sequence given by the rations of two adjacent terms of an m-step fibonacci sequence. These processes can remind secondary pre-service teachers of a series of some mathematical principles.

  • PDF

Hierarchical Modulation Scheme for 3D Stereoscopic Video Transmission Over Maritime Channel Environment (해양 채널 환경에서 3D 입체영상의 전송을 위한 계층변조 기법)

  • You, Dongho;Lee, Seong Ro;Kim, Dong Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1405-1412
    • /
    • 2015
  • Recently, Due to the rapid growth of broadcasting communication and video coding technologies, the demands for immersive media contents based on 3D stereoscopic video will increase steadily. And the demands must ultimately provide the contents for users which are in wireless channel such as vehicle, train, and ship. Thus, in this paper, we transmit the 3D stereoscopic video over the maritime Rician channel that direct wave is more dominant than reflective wave. Besides, we present unequel error protection (UEP) by applying hierarchical 4/16-QAM to V+D(Video plus Depth) format which can represent 3D stereoscopic video. We expect our system to provide seamless broadcasting service for users with poor reception condition.

A Study on the Theme Selection and Prototype Production for the LX Information Map Service (LX의 정보지도 서비스를 위한 주제선정 및 시범제작)

  • Jeong, Dong-Hoon;Bae, Sang-Keun;Lee, Seong-Gyu
    • Journal of Cadastre & Land InformatiX
    • /
    • v.45 no.1
    • /
    • pp.123-135
    • /
    • 2015
  • In order to satisfy the high expectations of consumers for a variety of consumer's desired subject area, information could be provided in the form of a map according to the analysis information. With the name change in 2015, LX would intend to play a role in building the information infrastructure that can be supported government policy as an intermediary between the government and private sector. Therefore, in this study, we would like to propose a plan that provide personalized information to the consumer. Through compositing a variety of time-series data(inner or outer of LX) based on public information, and analyzing spatially and temporally the rapidly changing land status. For these purpose, prior research and domestic or abroad thematic map service about thematic map making were reviewed. And the reason why the LX makes information map was presented. Also, themes of 3 field were selected, and depending on the data processing or analysis level and theme were subdivided, and then production and expression method were proposed.

XSTAR: XQuery to SQL Translation Algorithms on RDBMS (XSTAR: XML 질의의 SQL 변환 알고리즘)

  • Hong, Dong-Kweon;Jung, Min-Kyoung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.3
    • /
    • pp.430-433
    • /
    • 2007
  • There have been several researches to manipulate XML Queries efficiently since XML has been accepted in many areas. Among the many of the researches majority of them adopt relational databases as underlying systems because relational model which is used the most widely for managing large data efficiently. In this paper we develop XQuery to SQL Translation Algorithms called XSTAR that can efficiently handle XPath, XQuery FLWORs with nested iteration expressions, element constructors and keywords retrieval on relational database as well as constructing XML fragments from the transformed SQL results. The entire algorithms mentioned in XSTAR have been implemented as the XQuery processor engine in XML management system, XPERT, and we can test and confirm it's prototype from "http ://dblab.kmu.ac.kr/project.jsp".

Automatic Generation of Code Optimizer for DFA Pattern Matching (DFA 패턴 매칭을 위한 코드 최적화기의 자동적 생성)

  • Yun, Sung-Lim;Oh, Se-Man
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.31-38
    • /
    • 2007
  • Code Optimization is converting to a code that is equivalent to given program but more efficient, and this process is processed in Code Optimizer. This paper designed and processed Code Optimizer Generator that automatically generates Code Optimizer. In other words Code Optimizer is automatically generated for DFA Pattern Matching which finds the optimal code for the incoming pattern description. DFA Pattern Matching removes redundancy comparisons that occur when patterns are sought for through normalization process and improves simplification and structure of pattern shapes for low cost. Automatic generation of Code Optimization for DFA Pattern Matching eliminates extra effort to generate Code Optimizer every time the code undergoes various transformations, and enables formalism of Code Optimization. Also, the advantage of making DFA for optimization is that it is faster and saves cost of Code Optimizer Generator.

Selection of early maturing rice varieties suitable for early cropping before Alisma plantago (택사 앞작물 재배에 적응한 벼품종 선발)

  • 권병선;현규환;신정식;신동영
    • Korean Journal of Plant Resources
    • /
    • v.15 no.2
    • /
    • pp.123-127
    • /
    • 2002
  • In order to obtain basic informations for selecting early maturing rice varieties which is suitable for early cropping before Alisma plantago in the southern part of Korea. Eleven rice varieties were grown from May to September in 1999∼2001 at Sunchon Youngieon Experiment Field and yield components and yield of plants were investingated. Early maturing rice cv. Jinbubyeo showed higher rough rice yield than any other varieties used in the experiment. It showed high yield components, culm length, panicle length, number of panicles per plant, number of spikelets per panicle and ratio of ripened grains. therefore, it was concluded that Jinbubyeo was the most suitable variety with high yield for the cultivation before Alisma plantago at the southern part of Korea. The heritability of culm length number of spikelets per panicle and rough rice yield were high and that of panicle length number of panicle per plant, ratio of ripened grain and 1,000 grain wt. of milled rice were low. The rough rice yield showed highly significant positive correlations with culm length, panicle length, number of spikelets per panicles and ratio of ripened grains.

Design of Adaptive Retrieval System using XMDR based knowledge Sharing (지식 공유 기반의 XMDR을 이용한 적응형 검색 시스템 설계)

  • Hwang Chi-Gon;Jung Kye-Dong;Choi Young-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.716-729
    • /
    • 2006
  • The information systems in the most enterprise environments are distributed locally and are comprised with various heterogeneous data sources, so that it is difficult to obtain necessary and integrated information for supporting user decision. For solving 'this problems efficiently, it provides uniform interface to users and constructed database systems between heterogeneous systems make a consistence each independence and need to provide transparency like one interface. This paper presents XMDR that consists of category, standard ontology, location ontology and knowledge base. Standard ontology solves heterogeneous problem about naming, attributes, relations in data expression. Location ontology is a mediator that connects each legacy systems. Knowledge base defines the relation for sharing glossary. Adaptive retrieve proposes integrated retrieve system through reflecting site weight by location ontology, information sharing of various forms of knowledge base and integration and propose conceptual domain model about how to share unstructured knowledge.

Study on Selection of Optimized Segmentation Parameters and Analysis of Classification Accuracy for Object-oriented Classification (객체 기반 영상 분류에서 최적 가중치 선정과 정확도 분석 연구)

  • Lee, Jung-Bin;Eo, Yang-Dam;Heo, Joon
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.6
    • /
    • pp.521-528
    • /
    • 2007
  • The overall objective of this research was to investigate various combination of segmentation parameters and to improve classification accuracy of object-oriented classification. This research presents a method for evaluation of segmentation parameters by calculating Moran's I and Intrasegment Variance. This research used Landsat-7/ETM image of $11{\times}14$ Km developed area in Ansung, Korea. Segmented images are generated by 75 combinations of parameter. Selecting 7 combinations of high, middle and low grade expected classification accuracy was based on calculated Moran's I and Intrasegment Variance. Selected segmentation images are classified 4 classes and analyzed classification accuracy according to method of objected-oriented classification. The research result proved that classification accuracy is related to segmentation parameters. The case of high grade of expected classification accuracy showed more than 85% overall accuracy. On the other hand, low ado showed around 50% overall accuracy.

Implementation of Loop Peeling in CTOC (CTOC에서 루프 벗기기 구현)

  • Kim, Ki-Tae;Kim, Je-Min;Yoo, Weon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.27-35
    • /
    • 2008
  • The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis. and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form In order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

  • PDF