• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.5
• /
• pp.10-17
• /
• 1994

Two protocols inclouding the receiver collision avoidance function are proposed for high-speed optical fiber LANs with finite users. The basic idea to avoid receiver collision is the grouping of destination nodes by the number of channels and it is accomplished in the architecture with or without one separate control channel. While the protocol with a control channel requires a tunable optical transmitter, a fixed optical transmitter and two fixed optical receiver, the other protocol requires a tunable optical transmitter and one fixed optical receiver. The performance of two receiver collision avoidance protocols is computed and analyzed under various system parameters. The numerical results show that the receiver collision avoidance protocol has better performance for a small load than the protocol without receiver collision avoidance.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.239-246
• /
• 2003

Statisticians, or data miners, are often requested to assess the importances of input variables in the given supervised learning model. For the purpose, one may rely on separate ad hoc measures depending on modeling types, such as linear regressions, the neural networks or trees. Consequently, the conceptual consistency in input variable importance measures is lacking, so that the measures cannot be directly used in comparing different types of models, which is often done in data mining processes, In this short communication, we propose a unified approach to the importance measurement of input variables. Our method uses sensitivity analysis which begins by perturbing the values of input variables and monitors the output change. Research scope is limited to the models for continuous output, although it is not difficult to extend the method to supervised learning models for categorical outcomes.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.93-100
• /
• 2017

Current internet has evolved from the sharing and efficiency aspects of information, it is still vulnerable to the fact that the Internet is not secure in terms of security and is not safe to secure of security mechanism. Repeating patches on continuous hacking are continuously demanding additional resources for network or system equipment, and consequently the costs continue to increase. Businesses and individuals alike are speeding up the damage caused by crime like of ransomware, not jusy simple attacks, and businesses and individuals need to respond to cyber security. In addition, the ongoing introduce of security device, and separate of networks for secure transmission of contents in the existing TCP/IP system, but it is still lacking in security. To complement the security implications of this existing TCP/IP Internet Protocol, we intend to propose a Secure Contents Transport System (SCTS) on the network using the CCN concept.

• Journal of the Optical Society of Korea
• /
• v.12 no.2
• /
• pp.69-78
• /
• 2008

EPONs are a low cost, high speed solution to the bottleneck problem of broadband access networks. To support point-to-point and shared LAN emulation, EPONs use the multi-point control protocol (MPCP), which uses logical link identification (LLID) forframe tagging and filtering between the OLT and ONUs. In this paper, ONU-based multicast or multiple shared LAN emulation for IPTV services is proposed using logical group identification (LGID). Using ONUbased VLAN services, EPONs can support separate and secure connections between providers and subscribers in a simple manner. Also, differentiated IPTV channel packages can be delivered through EPONs by implementing ONU-based VLAN and IGMP snooping mechanisms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.114-123
• /
• 1996

In this paper, we propose an automatic recognition algorithm using the object centroid of a facial image. First, we separate the facial image from the background image using the chroma-key technique and we find the centroid of the separated facial image. Second, we search nose in the facial image based on knowledge of human faces and the coordinate of the object centroid and, we calculate 17 feature parameters automatically. Finally, we recognize the facial image by using feature parameters in the neural networks which are trained through error backpropagation algorithm. It is illustrated by experiments by experiments using the proposed recogniton system that facial images can be recognized in spite of the variation of the size and the position of images.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.8
• /
• pp.709-716
• /
• 2005

As a way to build more efficient and intelligent container cranes for todays hub ports, communication networks are used to interconnect numerous sensors, actuators, controllers, and operator switches and consoles that are spatially distributed over a crane. Various signals such as sensor values and operator's commands are digitized and broadcast on the network instead of using separate wiring cables. This not only makes the design and manufacturing of a crane more efficient, but also easier implementation of intelligent control algorithms. This paper presents the performance evaluation of CAN(Controller Area Network), TTP(Time Triggered Protocol) and Byteflight that can be used for cranes. Through discrete event simulation, several important quantitative performance factors such as the probability of a transmission failure, average system delay (data latency) and maximum system delay have been evaluated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.160-162
• /
• 2006

BP 알고리즘은 지역 최소점이나 고원 문제와 같은 수렴 실패문제와 학습 속도가 느리다고 알려져 있다. 이제까지 알려진 BP 알고리즘의 대체 방법들은 수렴 속도와 인자에 따른 수렴의 안정성에 대한 불균형을 해소하는데 치중했다. 기존의 전통적인 BP 알고리즘에서 발생하는 위와 같은 문제를 해결하기 위하여, 본 논문에서는 적은 용량의 저장 공간만을 요구하며 수렴이 빠르고 상대적으로 안정성이 보장되는 알고리즘을 제안한다. 이 방법은 상위연결(upper connections), 은닉층-출력층(hidden to output), 하위연결(lower connections), 입력층-은닉층(input to hidden)에 대해 개별적으로 훈련을 시키는 분리 학습방법을 적용한다.

• Journal of Sensor Science and Technology
• /
• v.29 no.3
• /
• pp.149-155
• /
• 2020

In this study, we employed Manchester code for illumination control and flicker prevention of the light-emitting diode (LED) used in a visible light communication (VLC) system. In the VLC transmitter, the duty factor of the Manchester code was utilized for illumination control; in the VLC receiver, the spike signal from an RC-high pass filter was utilized to recover the transmitted signal whilst suppressing the 120-Hz noise arising from adjacent lighting lamps. Instead of the clock being transmitted in a separate channel, a syncmark signal was transmitted in front of each data byte and used as the reference time for transforming the Manchester code to non-return-to-zero (NRZ) data in the receiver. In experiments, the LED illumination was controlled in the range of approximately 12-84% of the constant wave (CW) light via changing of the duty factor from 10% to 90%. This scheme is useful for constructing indoor wireless sensor networks using LED light that is flicker-free and presents capability for illumination control.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.1002-1003
• /
• 2019

Face recognition is an extensively researched area of computer vision. Visible, infrared, thermal, and 3D modalities have been used against various challenges of face recognition such as illumination, pose, expression, partial information, and disguise. In this paper we present a multi-modal approach to face recognition using convolutional neural networks. We use visible and thermal face images as two separate inputs to a multi-input deep learning network for face recognition. The experiments are performed on IRIS visible and thermal face database and high face verification rates are achieved.