• Title/Summary/Keyword: 처리 계층

Search Result 1,897, Processing Time 0.03 seconds

A Question Example Generation System for Multiple Choice Tests by utilizing Concept Similarity in Korean WordNet (한국어 워드넷에서의 개념 유사도를 활용한 선택형 문항 생성 시스템)

  • Kim, Young-Bum;Kim, Yu-Seop
    • The KIPS Transactions:PartA
    • /
    • v.15A no.2
    • /
    • pp.125-134
    • /
    • 2008
  • We implemented a system being able to suggest example sentences for multiple choice tests, considering the level of students. To build the system, we designed an automatic method for sentence generation, which made it possible to control the difficulty degree of questions. For the proper evaluation in the multiple choice tests, proper size of question pools is required. To satisfy this requirement, a system which can generate various and numerous questions and their example sentences in a fast way should be used. In this paper, we designed an automatic generation method using a linguistic resource called WordNet. For the automatic generation, firstly, we extracted keywords from the existing sentences with the morphological analysis and candidate terms with similar meaning to the keywords in Korean WordNet space are suggested. When suggesting candidate terms, we transformed the existing Korean WordNet scheme into a new scheme to construct the concept similarity matrix. The similarity degree between concepts can be ranged from 0, representing synonyms relationships, to 9, representing non-connected relationships. By using the degree, we can control the difficulty degree of newly generated questions. We used two methods for evaluating semantic similarity between two concepts. The first one is considering only the distance between two concepts and the second one additionally considers positions of two concepts in the Korean Wordnet space. With these methods, we can build a system which can help the instructors generate new questions and their example sentences with various contents and difficulty degree from existing sentences more easily.

An analysis on the relative importance of aptitude test items for integrated pilot aptitude evaluation (종합적 조종적성 판단을 위한 적성 검사 항목의 상대적 중요도 분석)

  • 유희천;이달호;김영준
    • Proceedings of the ESK Conference
    • /
    • 1993.10a
    • /
    • pp.46-55
    • /
    • 1993
  • 조종사가 수행하는 조종 업무는 여러 정보를 동시에 지각하여 처리하여 야 하는 복잡한 작업으로 구성되어 있어, 조종사에게는 고도의 인간성능이 요구되고 있다. 또한 조종기술을 습득하기 위해서는 많은 훈련시간과 비용 이 소요되며, 조종사의 실수는 치명적인 사고를 초래한다. 따라서 조기에 비행 부적격자를 판별하고, 미흡한 조종 적성을 함양시킬 수 있는 교육 . 훈련 프로그램을 조종 후보생에게 적용시키는 분석적 조종적성 진단 체계 개발은 조 종사의 도태율 감소, 효율적인 비행훈련, 비행 안전사고 감소 등의 측면에서 절실하게 요구되고 있다. 본 연구에서는 조종 업무 수행시 요구되는 여러 인간 기능의 중요도 차이를 조종 적성 평가 체제에 적용하기 위해서, 각 적성 검사 항목들의 상대적 중요도를 분석하고 이의 타당성을 평가하였다. 적성검사 항목의 상대적 중요도 분석은 조종적성검사 계층구조의 각 수준별 쌍체 비교 평가와 AHP(Analytic Hierarchy Process) 분석에 의한 상대적 중요도 산출 및 평가, 그리고 일관성 지수(Consistency Index)에 의한 분석 결과의 조정을 통해 이루어 졌다. 적성검사 항목의 쌍체 비교 평가는 심리기능검사, 비행자질 검사 등 총 29개 적성검사 항목에 대해 검사를 받았고 또한 초등비행 훈련과정을 수료한 조종 학생들에 의해 이루어 졌다. 상대적 중요도를 분석한 결과 심리기능 검사(W=0.30)가 다른 검사에 비하여 조종적성 평가에 중요한 검사로 나타났으며, 세부 항목으로는 주의 분배력(W=0.13), 추적능력(0.06) 등이 상대적으로 중요한 검사 항목으로 나타났다. 또한 상대적 중요도 결과를 적용한 적성검사 성적이 적용하지 않은 적성검사 성적에 비해 비행성적에 대한 예측 능력이 좋은 것으로 평가되었다.al age)가 있다는 것을 의미하는 것이다. 한편, 생산현장에서는 자동화, 기계화가 진보되어 육체적인 노동이 경감된 결과, 중고령자라도 할 수 있는 작업이 많아지고 있다. 또, VDT (Visual Dislay Terminal) 작업과 같은 정보처리 작업의 수요가 증가하여 그 인재의 부족이 지적되고 있다. 따라서 중고령자의 기능을 조사하여 어떠한 작업에 적합한가를 판단하는 것이 중요한 과제로 되었다. 그러나 노동에는 많은 기능이 관여 하고, 그 내용에 따라서 요구되는 기능이 서로 다르기 때문에 노동적응능력의 기본적인 기능으로 보여지는 것에 좁혀서 작업능력의 연령증가 변화에 대하여다원적 평가를 하는 것이 실제적이라고 할 수 있다. 따라서 본 연구에서는 인간이 가지고 있는 다수의 기능중에서 수지교 치성과 연령증가와의 관계를 조사한다. 만약 연령증가 만으로 수지교치성을 평가 할 수 없는 경우에는 어떠한 요인이 수지기민성의 변화에 영향을 미치는가를 검토한다.t list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다._3$", chain segment, with the activation energy of carriers from the shallow trap with 0.4[eV], in he amorphous regions.의 증발산율은 우기의 기상자료를 이용하여 구한 결과

  • PDF

A Study on a Delivery System for the Effects of Using in the Public Libraries (공공도서관 활성화를 위한 Delivery System에 관한 연구 - 이동문고를 중심으로 -)

  • 이상근
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.9 no.1
    • /
    • pp.153-179
    • /
    • 1998
  • This study attempt to suggest a policy for the effect of using in the public libraries by the verification that are different between groups by their using patterns and types of book collections. by using patterns and system of desired-book for user. by using patterns and system of desired-book for user. The questionnaire is distributed to the delivery lending library's user and librarian in public libraries. The summary of results are as follows 1 The Circulation period of public library is one month per every delivery lending library. 2. The Circulation volume of public library is '100-200' books per every times. 3. There are significant differences by their using patterns and types of book collections. 4. There are significant differences by their using patterns and system of desired-book for user. 5. There are significant differences by their using patterns and placement of book collections. Their results show that library is most effective place of book collection services. 6. Circulation services must carry out only in the sphere of jurisdiction 7. A Lost books must set up treatment basis of natural reduction ratio 8. The Interference factors of delivery lending library are lacks of human power, lost books and negative attitute of user in order 9. The Effects of using a delivery lending library are a positive attitute and specialty of top management, the optimum of budget and the effect of deposit system 10. Natural reduction ratio of lost books appropriates 0.5-0.6% of total loaned books

  • PDF

A Design and Implementation for a Reliable Data Storage in a Digital Tachograph (디지털 자동차운행기록계에서 안정적인 데이터 저장을 위한 설계 및 구현)

  • Baek, Sung Hoon;Son, Myunghee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.71-78
    • /
    • 2012
  • The digital tachograph is a device that automatically records speed and distance of a vehicle, together with the driver's activity and vehicle status at an accident. It records vehicle speed, break status, acceleration, engine RPM, longitude and latitude of GPS, accumulated distance, and so on. European Commission regulation made digital tachographs mandatory for all trucks from 2005. Republic of Korea made digital tachographs mandatory for all new business vehicles from 2011 and is widening the range of vehicles that must install digital tachographs year by year. This device is used to analyze driver's daily driving information and car accidents. Under a car accident that makes the device reliability unpredictable, it is very important to store driving information with maximum reliability for its original mission. We designed and implemented a practical digital tachograph. This paper presents a storage scheme that consists of a first storage device with small capacity at a high reliability and a second storage device with large capacity at a low cost in order to reliably records data with a hardware at a low cost. The first storage device records data in a SLC NAND flash memory in a log-structured style. We present a reverse partial scan that overcomes the slow scan time of log-structured storages at the boot stage. The scheme reduced the scan time of the first storage device by 1/50. In addition, our design includes a scheme that fast stores data at a moment of accident by 1/20 of data transfer time of a normal method.

Trajectory Clustering in Road Network Environment (도로 네트워크 환경을 위한 궤적 클러스터링)

  • Bak, Ji-Haeng;Won, Jung-Im;Kim, Sang-Wook
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.317-326
    • /
    • 2009
  • Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.

A Strategy To Reduce Network Traffic Using Two-layered Cache Servers for Continuous Media Data on the Wide Area Network (이중 캐쉬 서버를 사용한 실시간 데이터의 좡대역 네트워크 대역폭 감소 정책)

  • Park, Yong-Woon;Beak, Kun-Hyo;Chung, Ki-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3262-3271
    • /
    • 2000
  • Continuous media objects, due to large volume and real-time consiraints in their delivery,are likely to consume much network andwidth Generally, proxy servers are used to hold the fiequently requested objects so as to reduce the network traffic to the central server but most of them are designed for text and image dae that they do not go well with continuous media data. So, in this paper, we propose a two-layered network cache management policy for continuous media object delivery on the wide area networks. With the proposed cache management scheme,in cach LAN, there exists one LAN cache and each LAN is further devided into a group of sub-LANs, each of which also has its own sub-LAN eache. Further, each object is also partitioned into two parts the front-end and rear-end partition. they can be loaded in the same cache or separately in different network caches according to their access frequencics. By doing so, cache replacement overhead could be educed as compared to the case of the full size daa allocation and replacement , this eventually reduces the backbone network traffic to the origin server.

  • PDF

A Dynamic Programming for Solving Resource Allocation Problems in Video-on-Demand Service Networks (Video-on-Demand 서비스망의 자원 할당 문제를 위한 동적계획법)

  • Cho, Myeong-Rai
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3182-3194
    • /
    • 2000
  • It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

  • PDF

Analysis of Block FEC Symbol Size's Effect On Transmission Efficiency and Energy Consumption over Wireless Sensor Networks (무선 센서 네트워크에서 전송 효율과 에너지 소비에 대한 블록 FEC 심볼 크기 영향 분석)

  • Ahn, Jong-Suk;Yoon, Jong-Hyuk;Lee, Young-Su
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.803-812
    • /
    • 2006
  • This paper analytically evaluates the FEC(Forward Error Correction) symbol size's effect on the performance and energy consumption of 802.11 protocol with the block FEC algorithm over WSN(Wireless Sensor Network). Since the basic recovery unit of block FEC algorithms is symbols not bits, the FEC symbol size affects the packet correction rate even with the same amount of FEC check bits over a given WSN channel. Precisely, when the same amount of FEC check bits are allocated, the small-size symbols are effective over channels with frequent short bursts of propagation errors while the large ones are good at remedying the long rare bursts. To estimate the effect of the FEC symbol site, the paper at first models the WSN channel with Gilbert model based on real packet traces collected over TIP50CM sensor nodes and measures the energy consumed for encoding and decoding the RS (Reed-Solomon) code with various symbol sizes. Based on the WSN channel model and each RS code's energy expenditure, it analytically calculates the transmission efficiency and power consumption of 802.11 equipped with RS code. The computational analysis combined with real experimental data shows that the RS symbol size makes a difference of up to 4.2% in the transmission efficiency and 35% in energy consumption even with the same amount of FEC check bits.

Design and Implementation of Co-Verification Environments based-on SystemVerilog & SystemC (SystemVerilog와 SystemC 기반의 통합검증환경 설계 및 구현)

  • You, Myoung-Keun;Song, Gi-Yong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.4
    • /
    • pp.274-279
    • /
    • 2009
  • The flow of a universal system-level design methodology consists of system specification, system-level hardware/software partitioning, co-design, co-verification using virtual or physical prototype, and system integration. In this paper, verification environments based-on SystemVerilog and SystemC, one is native-code co-verification environment which makes prompt functional verification possible and another is SystemVerilog layered testbench which makes clock-level verification possible, are implemented. In native-code co-verification, HW and SW parts of SoC are respectively designed with SystemVerilog and SystemC after HW/SW partitioning using SystemC, then the functional interaction between HW and SW parts is carried out as one simulation process. SystemVerilog layered testbench is a verification environment including corner case test of DUT through the randomly generated test-vector. We adopt SystemC to design a component of verification environment which has multiple inheritance, and we combine SystemC design unit with the SystemVerilog layered testbench using SystemVerilog DPI and ModelSim macro. As multiple inheritance is useful for creating class types that combine the properties of two or more class types, the design of verification environment adopting SystemC in this paper can increase the code reusability.

  • PDF

Topology of High Speed System Emulator and Its Software (초고속 시스템 에뮬레이터의 구조와 이를 위한 소프트웨어)

  • Kim, Nam-Do;Yang, Se-Yang
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.479-488
    • /
    • 2001
  • As the SoC designs complexity constantly increases, the simulation that uses their software models simply takes too much time. To solve this problem, FPGA-based logic emulators have been developed and commonly used in the industry. However, FPGA-based logic emulators are facing with the problems of which not only very low FPGA resource usage rate due to the very limited number of pins in FPGAs, but also the emulation speed getting slow drastically as the complexity of designs increases. In this paper, we proposed a new innovative emulation architecture and its software that has high FPGA resource usage rate and makes the emulation extremely fast. The proposed emulation system has merits to overcome the FPGA pin limitation by pipelined ring which transfers multiple logic signal through a single physical pin, and it also makes possible to use a high speed system clock through the intelligent ring topology. In this topology, not only all signal transfer channels among EPGAs are totally separated from user logic so that a high speed system clock can be used, but also the depth of combinational paths is kept swallow as much as possible. Both of these are contributed to achieve high speed emulation. For pipelined singnals transfer among FPGAs we adopt a few heuristic scheduling having low computation complexity. Experimental result with a 12 bit microcontroller has shown that high speed emulation possible even with these simple heuristic scheduling algorithms.

  • PDF