• Journal of Industrial Technology
• /
• v.20 no.B
• /
• pp.139-146
• /
• 2000

To support Quality of Service (QoS) in the existing Internet, Differentiated Service (Diff-Serv) has been proposed. But, the unfairness between TCP connections remains as a serious problem not only in the conventional best-effort service Internet but also in new Diff-Serv network. In this paper, we propose the Balancing Marker Algorithm (BMA) improving the fairness between individual connections of aggregated sources in a Diff-Serv network. This algorithm is based on the 3-level priority marking method. We compared the 2-level packet priority marker with the Balancing Marker proposed in this paper. And we showed that the BMA improved the fairness and the throughputs between the individual connections with different delays in an aggregated source.

• Journal of information and communication convergence engineering
• /
• v.13 no.1
• /
• pp.62-68
• /
• 2015

In this paper, we propose a watermarking method for protecting the ownership of three-dimensional (3D) content generated from depth and texture images. After selecting the target areas to preserve the watermark by depth-image-based rendering, the reference viewpoint image is moved right and left in the depth map until the maximum viewpoint change is obtained and the overlapped region is generated for marking space. The region is divided into four subparts and scanned. After applying discrete cosine transform, the watermarks are inserted. To extract the watermark, the viewpoint can be changed by referring to the viewpoint image and the corresponding depth image initially, before returning to the original viewpoint. The watermark embedding and extracting algorithm are based on quantization. The watermarked image is attacked by the methods of JPEG compression, blurring, sharpening, and salt-pepper noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.473-494
• /
• 2020

To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.4
• /
• pp.97-115
• /
• 2023

In South Korea, chronic kidney disease(CKD) impacts around 4.6 million adults, leading to a high reliance on hemodialysis. For effective dialysis, vascular access is crucial, with decisions about vascular surgeries often made during dialysis sessions. Anticipating these needs could improve dialysis quality and patient comfort. This study investigates the use of Artificial Intelligence(AI) to predict the timing of surgeries for dialysis vessels, an area not extensively researched. We've developed an AI algorithm using predictive maintenance methods, transitioning from machine learning to a more advanced deep learning approach with Long Short-Term Memory(LSTM) models. The algorithm processes variables such as venous pressure, blood flow, and patient age, demonstrating high effectiveness with metrics exceeding 0.91. By shortening the data collection intervals, a more refined model can be obtained. Implementing this AI in clinical practice could notably enhance patient experience and the quality of medical services in dialysis, marking a significant advancement in the treatment of CKD.

• The Journal of the Korea Contents Association
• /
• v.16 no.9
• /
• pp.694-701
• /
• 2016

The smart phone application to provide auto identification and answer explanation of multiple choice answer for each OMR answer item in the test paper different from ordinary OMR test by using smart phone is very useful in terms of a self learning and a smart learning. In this paper, smart phone application of OMR mark identification for each question item in test paper is proposed. QR code for each OMR answer is provided for the encrypted correct answer and the reference location of multiple choice answer rectangle location. The OMR answer region is extracted and the marked answer is identified in each question of test paper, in order to compare between the marking answer and the correct answer. Experimental result of smart phone application of the proposed algorithm for the OMR answer images with various size and direction shows excellent recognition performance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2384-2392
• /
• 1999

Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variables of current inputs and to use technique of its implementations. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the making table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1183-1186
• /
• 2004

In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the realtime billet characters recognition system in the steel production line. Normally, the billets are mixed at yard so that their identifications are very difficult and very important processing. The character recognition algorithm used in this paper is base on the subspace method by K-L transformation. With this method, we need no special feature extraction steps, which are usually error prone. So the gray character images are directly used as input vectors of the classifier. To train the classifier, we have extracted eigen vectors of each character used in the billet numbers, which consists of 10 arabia numbers and 26 alphabet aharacters, which are gathered from billet images of the production line. We have developed billet characters recognition system using this algorithm and tested this system in the steel production line during the 8-days. The recognition rate of our system in the field test has turned out to be 94.1% (98.6% if the corrupted characters are excluded). In the results, we confirmed that our recognition system has a good performance in the poor environments and ill-conditioned marking system like as steel production plant.

• Journal of the Korean Society for Precision Engineering
• /
• v.31 no.8
• /
• pp.721-728
• /
• 2014

In this paper, it is proposed a method of optimizing path parameters for large-area laser processing. On-the-fly system is necessary for large-area laser processing of uniform quality. It is developed a MOTF(Marking On-The-Fly) board for synchronizing the stage and scanner. And it is introduced the change of the error due to the change of parameters and algorithm for large-area laser processing. This algorithm automatically generates stage path and a velocity profile using acceleration and deceleration parameters. Since this method doesn't use a G-code, even if without expert knowledge, it has an advantage that can be accessed easily. Angle of one of the square of $350{\times}350mm$ was changed from $50^{\circ}$ to $80^{\circ}$ and analyzed the error corresponding to the value of Ta. It is calculated the value of Ta of the best with a precision of 20um through measurement of accuracy according to the Ta of each angle near the edge.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.99-115
• /
• 2005

For an analysis of the performance of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the Initial marking in a timed net. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing 'Timed Net with Probabilities of Choices' where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a 'Timed Net with Probabilities of Choices'. As an example of application, we are performing an analysis of the location based service system using 'Timed Net with Probabilities of Choices'.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.647-660
• /
• 2003

The present of state is situation that is realized by necessity of maintenance of public security about great many information is real condition been increasing continually in knowledge info-age been situating in wide field of national defense, public peace, banking, politics, education etc. Also, loss or forgetfulness, and peculation by ID for individual information and number increase of password in Internet called that is sea of information is resulting various social problem. By alternative about these problem, including Biometrics, several authentication systems through sign(Signature), Smart Card, Watermarking technology are developed. Therefore, This paper shows that extract factor that efficiency can get into peculiar feature in physical features for good fingerprint recognition algorithm implementation with old study finding that take advantage of special quality of these fingerprint.