• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2786-2800
• /
• 1997

In this paper, we investigate how well the channel memory (statistical dependence in the occurrence of transmission errors) can be used in the evaluation of widely used error control schemes. For this we assume a special case named as the simplest Markovian block-error pattern with two states, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we propose a new measure of the response time specified as mean plus two standard deviations 50 as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone.

• Healthcare Informatics Research
• /
• v.24 no.4
• /
• pp.381-386
• /
• 2018

Objectives: This study aimed to describe the process of utilizing a mobile application for ecological momentary assessment (EMA) to collect data on stress and mood in daily life setting. Methods: A mobile application for the Android operating system was developed and installed with a set of questions regarding momentary mood and stress into a smartphone of a participant. The application sets alarms at semi-random intervals in 60-minute blocks, four times a day for 7 days. After obtaining all momentary affect and stress, the questions to assess the usability of the mobile EMA application were also administered. Results: The data were collected from 97 police officers working in Gyeonggi Province of South Korea. The mean completion rate was 60.0% ranging from 3.5% to 100%. The means of positive and negative affect were 18.34 of 28 and 19.09 of 63. The mean stress was 17.92 of 40. Participants responded that the mobile application correctly measured their affect ($4.34{\pm}0.83$) and stress ($4.48{\pm}0.62$) of 5-point Likert scale. Conclusions: Our study investigated the process of utilizing a mobile application to assess momentary affect and stress at repeated times. We found challenges regarding adherence to the research protocol, such as completion and delay of answering after alarm notification. Despite this inherent issue of adherence to the research protocol, the EMA still has advantages of reducing recall bias and assessing the actual moment of interest at multiple time points that improves ecological validity.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.163-181
• /
• 2004

Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of exchanged messages, both of which are recognized as the dominant factors that slow down group key agreement over a networking environment with high communication latency. In this paper we present a communication-efficient group key agreement protocol and prove its security in the random oracle model under the factoring assumption. The proposed protocol provides perfect forward secrecy and requires only a constant number of communication rounds for my of group rekeying operations, while achieving optimal message complexity.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.123-134
• /
• 2004

In this paper a high speed architecture of the RC4 stream cipher is proposed and its FPGA implementation is presented. Compared to the conventional RC4 designs which have long initialization operation or use double or triple S-arrays to reduce latency delay due to S-array initialization phase, the proposed architecture for RC4 stream cipher eliminates the S-array initialization operation using 256-bit valid entry scheme and supports 40/128-bit key lengths with efficient modular arithmetic hardware. The proposed RC4 stream cipher is implemented using Xilinx XCV1000E-6H240C FPGA device. The designed RC4 stream cipher has about a throughput of 106 Mbits/sec at 40 MHz clock and thus can be applicable to WEP processor and RC4 key search processor.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.145-156
• /
• 2010

Now a days, the development of TV and internet like communicational technique makes IPTV service which combines internet with multimedia contents increase. But when a user gets service in specific place, the certification process and user's ID check in IPTV service is complicate so that there occurs communicational difficulty like increasing illegal users and service delay etc. This paper proposes communication security mechanism to prevent Clone attack which happens in wireless section by efficiently extracting illegal user. The proposed mechanism performs key distribution procedure, inter certification procedure, and key initiation procedure by putting security agent in RFID-USB for RFID tags users use to perform plug-and-plug function. Also, the proposed mechanism updates the hased token value by its ID and the random number which RFID-USB creates whenever a user accesses in the area of RFID-USB so that it protects reply attack and man-in-the-middle attack which happen often in the area of wireless section.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.145-147
• /
• 2020

As deep learning technology advances, there have been many attempts to improve video codecs such as High-Efficiency-Video-Coding (HEVC) using deep learning technology. One of the most researched approaches is improving filters inside codecs through image restoration researches. In this paper, we propose a method 01 replacing the sample adaptive offset (SAO) filtering with a deep neural network. The proposed method uses the deep neural network to find the optimal offset value. The proposed network consists of two subnetworks to find the offset value and its type of the signal, which can restore nonlinear and complex type of error. Experimental results show that the performance is better than the conventional HEVC in low delay P and random access mode.

• Proceedings of the KOR-KST Conference
• /
• 1996.02a
• /
• pp.59-86
• /
• 1996

Current methods for evaluating unsignalized intersections, and estimating level-of-service (LOS) is determined from efficiency-based criteria such as little or no delay to very long delays. At present, similar procedures to evaluate intersections using safety-based criteria do not exist. The improvement of sight distances at intersections is the most effective way of improving intersection safety. However, a set of procedures is necessary to account for the limitations in current methodology. Such an approach would build upon such methods, but also account for: deficiencies in the current deterministic solution for the determination of intersection sight distances; opportunity for an accident and severity of an accident; and cost-effectiveness of attaining various levels of sight distances. In this research, a model that estimates the degree of safety at two-way stop-controlled intersections is described. Only crossing maneuvers are considered in this study because accidents caused by the crossing maneuvers are the dominate type among intersection accidents. Monte Carlo methods are used to estimate the hazard at an intersection as a function of roadway features and traffic conditions. Driver`s minimum gap acceptance in the crossing vehicles and headway distribution on the major road are used in the crossing vehicles and headway distribution on the major road are used in the model to simulate the real intersectional maneuvers. Other random variables addressed in the model are: traffic speeds; preception-reaction times of both drivers in the crossing vehicles and drivers in oncoming vehicles on the major road; and vehicles on the major roads. The developed model produces the total number of conflicts per year per vehicle and total potential kinetic energy per year per vehicle dissipated during conflicts as measurements of safety at intersections. Based on the results from the developed simulation model, desirable sight distances for various speeds were determined as 350 feet, 450 feet and 550 feet for 40 mph, 50 mph and 60 mph prevailing speed on the major road, respectively. These values are seven to eight percent less than those values recommended by AASHTO. A safety based level-of-service (LOS) is also developed using the results of the simulation model. When the total number of conflicts per vehicle is less than 0.05 at an intersection, the LOS of the intersection is `A' and when the total number of conflicts per vehicle is larger than 0.25 at an intersection, the LOS is `F'. Similarly, when the total hazard per vehicle is less than 350, 000 1b-ft2/sec2, the LOS is `F'. Once evaluation of the current safety at the intersection is complete, a sensitivity analysis can be done by changing one or more input parameters. This will estimate the benefit in terms of time and budget of hazard reduction based upon improving geometric and traffic characteristics at the intersection. This method will also enable traffic engineers in local governments to generate a priority list of intersection improvement projects.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.60-67
• /
• 2001

Multicast Protocol for multimedia service on the Internet can be classified into two types, e.g., source based tree and shared tree according to difference of tree construction method. Shared tree based multicast is known to show outstanding results in the aspect of scalability than source based tree. Generally, There have been lots of researches on the method to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically in the service time, RP of the shared tree should b be reselected for guranteeing Qos to new member, But, RP reselection method has not been considered generally as the solution to satisfy QoS C constraints. In this paper, new initial RP selection and RP reselection method are proposed, which utilize RTCP (Real Time Control Protocol) report packet fields. Proposed initial RP selection and RP reselection method use RTCP protocol which underlying multimedia application service So, the proposed method does not need any special process for collecting network information to calculate RP. New initial RP selection method s shows better performance than random and topology based one by 40-50% in simulation. Also, RP reselection method improves delay p performance by 50% after initial RP selection according to the member’s dynamicity.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.947-960
• /
• 1996

The primary goal for developing high performance ATM switching systems is to minimized the probability of cell loss, cell delay and deterioration of throughput. ATM switching element that is the most suitable for this purpose is the shared buffer memory switch executed by common random access memory and control logic. Since it is difficult to manufacture VLIS(Very Large Scale Integrated circuit) as the number of input ports increased, the used of switching module method the realizes 32$\times$32, 150 Mb/s switch utilizing 8$\times$8, 600Mb/s os 16$\times$16, 150Mb/s unit switch is latest ATM switching technology for small and large scale. In this paper, buffer capacity satisfying total-memory-reduction effect by buffer sharing in a shared buffer memory switch are analytically evalu ated and simulated by computer with cell loss level at traffic conditions, and also features of switching network utilizing the switching module methods in small and large-capacity ATM switching system is analized. Based on this results, the structure in outline of 32$\times$32(4.9Gb/s throughput), 150Mb/s switches under research in many countries is proposed, and eventually, switching-network structure for ATM switching system of small and large and capacity satisfying with above primary goals is suggested.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.68-78
• /
• 2013

In this paper, we propose an early spectrum sensing(ESS) as an advance preparation for radio-access trial, which enables multi-mode terminals to access the most appropriate radio-access system in a cloud-conceptual base station system where multiple radio access technologies(RATs) coexist. Prior to a random access to one of RATs, a multi-mode terminal conducts a spectrum sensing over entire frequency bands of whole RATs, then select the RAT with the lowest sensing power, that is likely to have the most available spectrum. Thus, an access failure caused by that the selected RAT has no available radio spectrum could be avoidable in advance. In computer simulation, we consider as various RATs as possible. First, circuit and packet systems are taken into consideration. In addition, the packet systems are classified according to the feasibility of carrier aggregation(CA). In case of terminal, three modes are considered with circuit-only, packet-only, and multi-mode. Subsequently, packet traffic is classified into real-time and non-real-time traffic with three different tolerable delay levels. The simulation includes a call process starting with a call generation and ending up with a resource allocation reflecting individual user's QoS requirements and evaluates the proposed scheme in terms of the successful access probability, system access time, system balancing factor and packet loss probability.