• The Journal of the Convergence on Culture Technology
• /
• v.10 no.1
• /
• pp.435-441
• /
• 2024

In order for the large amount of collected data sets to be used as deep learning training data, sensitive personal information such as resident registration number and disease information must be changed or encrypted to prevent it from being exposed to hackers, and the data must be reconstructed to match the structure of the built deep learning model. Currently, these tasks are performed manually by experts, which takes a lot of time and money. To solve these problems, this paper proposes a technique that can automatically perform data processing tasks to protect personal information during the deep learning process. In the proposed technique, privacy protection tasks are performed based on data generalization and data reconstruction tasks are performed using circular queues. To verify the validity of the proposed technique, it was directly implemented using C language. As a result of the verification, it was confirmed that data generalization was performed normally and data reconstruction suitable for the deep learning model was performed properly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.102-115
• /
• 2016

In this study, a scheme of ramp metering that uses Off-ramp Exit Percentage instead of the O/D table required for systems of integrated control of ramps at the target freeway segment is presented. The segment from Gyeyang IC to Jangsu IC on the Seoul Outer Ring Expressway was selected for the study because the segment frequently shows large volume of traffic on the short distance between the two ICs requiring an integrated on-ramp control by taking the traffic situation on an entire expressway into account despite an unavailability of O/D data. Thus the information of Off-ramp Exit Percentage at each IC were collected instead of securing the O/D table through actual survey, and the congestion on the segment was analyzed to identify the validity of the use of off-ramp traffic instead of O/D data. In addition, the scheme of ramp metering that exploits the off-ramp traffic information was prepared through simulations conducted in a way supporting the traffic control for respective access roads thereof by taking traffic situations and queues on each ramp into account. The results obtained from the simulation analyses revealed an improved level of travel speed and traffic volume on the main line and validated the use of off-ramp traffic instead of the O/D table for the ramp metering.

• Journal of Digital Convergence
• /
• v.15 no.11
• /
• pp.261-269
• /
• 2017

The purpose of this paper is to provide a search system using a method of accessing the web in real time without using a database server in order to guarantee the up-to-date information in a single network, rather than using a plurality of bots connected by a wide area network Design. The method of the research is to design and analyze the system which can search the person and keyword quickly and accurately in crepe system. In the crepe server, when the user registers information, the body tag matching conversion process stores all the information as it is, since various styles are applied to each user, such as a font, a font size, and a color. The crepe server does not cause a problem of body tag matching. However, when executing the crepe retrieval system, the style and characteristics of users can not be formalized. This problem can be solved by using the html_img_parser function and the Go language html parser package. By applying queues and multiple threads to a general-purpose web crawler, rather than a web crawler design that targets a specific site, it is possible to utilize a multiplier that quickly and efficiently searches and collects various web sites in various applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.702-709
• /
• 2003

In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.113-127
• /
• 2018

This study develops a fusion priority signal control algorithm to pass without delay in emergency events. Fusion priority signal control is method combined center control with local control. The center control method applies signal times for each signalized intersection on the emergency vehicle's route when an emergency call is received. As signals are controlled before the emergency vehicle leaves for its destination, it is possible to clear the queues at each intersection more effectively. However, since the traffic information (speed, position) of the real-time emergency vehicle is not used, the intersection arrival time predicted by center control and actual arrival time of the emergency vehicle may be different from each other. In the case, it is possible to experience a delay caused by the signal. Local control method operate priority signal use the real-time information of EV, but there is a limitation that queue elimination time can not be reflected. In this study, fusion(center+local) control algorithm is proposed to compensate the disadvantages of center and local control also maximizing its advantages. Proposed algorithm is expected to decrease delay time of EV in emergency situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.167-175
• /
• 2019

Recently, health examination centers have been changing from auxiliary medical facilities to key and independent medical facilities. However, it is not easy to improve medical facilities, including health examination centers, due to the variable characteristics of the relationship between humans and space. Therefore, this study was done to develop a pedestrian-based discrete event simulation analysis program to examine the problems and develop methods for improvement. The program was developed to analyze five evaluation indices and the density of examinees. The problems were derived by analyzing the required time, capacity, and queue size for each examination through simulations. We reduced the examination time and moving distance, increased the capacity, and distributed the queues by adjusting the medical services and relocating the examination rooms. The results were then quantitatively verified by simulations.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.79-87
• /
• 2007

The interchanges of urban freeways have many problems with traffic operation due to high off-ramp flows and frequent congestion at adjacent intersections. The flow exiting from off-ramps is affected by the operational status and traffic volume conditions of the nearest signalized intersection. As a result, off-ramp flow cannot exit and the queue backs up the freeway mainline when queues from the signalized intersection form up to the junction of the off-ramp and street. The spacing between an off-ramp and an adjacent intersection is likely to determine the traffic conditions at the adjacent intersection. However, the current design guidelines do not consider such a factor. This study is to develop a model calculating the spacing between off-ramps and adjacent intersections considering the signal, traffic, and road conditions. The variables affecting the model in this study are effective green time (g/C), volume-capacity ratio (v/c), the number of lanes, and off-ramp volume. Various scenarios are designed to represent the effects of the variables and the road networks are constructed using VISSIM, which is a common traffic micro-simulation software package. The queue length is derived from VISSIM and this length is considered as the recommended spacing between the off-ramp and the adjacent intersection. Through the simulation analysis, regression models are developed to calculate the queue length reflecting the various conditions such as signals, traffic, and road configurations. The developed model can be used to create road design guidelines to determine the location of off-ramps in the planning stage.

• Journal of Korean Society of Transportation
• /
• v.32 no.6
• /
• pp.567-578
• /
• 2014

The study suggested a method to improve analysis accuracy such that the interactive effects of transportation changes between outside and inside of sub-areas were sequentially considered in the analysis by linking a macroscopic network analysis and a microscopic traffic simulation. A dynamic O/D estimation method was developed for practical implement of sub-area microscopic simulation analysis by using the results of macroscopic network analysis, the results of selected link analysis at the cordon line of the sub-area, departure time data of household travel survey, timely observed traffic volume data at the cordon. This estimated dynamic O/D for the sub-area made it possible to analyze traffic phenomena in details. Various detailed phenomena such as traffic queues, delay at intersection, and conflicts between vehicles, which is impossible to be grasped through a macroscopic analysis, can be analyzed with the dynamic microscopic traffic analysis. Through implementing an empirical study and validation, the study provided a reference result about accuracy of a microscopic traffic simulation of a sub-area to help its application for real transportation policy analysis.