• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.1-13
• /
• 2010

It is not easy to set RED(Random Early Detection) parameter according to environment in managing Network Device. Especially, it is more difficult to set parameter in the case of maintaining the constant service rate according to the change of environment. In this paper, we hypothesize the router that has Multi-core CPU in output queue and propose AI RED(Artificial Intelligence RED), which directly induces Genetic Algorithm of Artificial Intelligence in the output queue that is appropriate to the optimization of parameter according to RED environment, which is automatically adaptive to workload. As a result, AI RED Is simpler and finer than FuRED(Fuzzy-Logic-based RED), and RED parameter that AI RED searches through simulations is more adaptive to environment than standard RED parameter, providing the effective service. Consequently, the automation of management of RED parameter can provide a manager with the enhancement of efficiency in Network management.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.57-67
• /
• 2005

Fast scalar multiplication of points on elliptic curve is important for elliptic curve cryptography applications. In order to vary field sizes depending on security situations, the cryptography coprocessors should support variable length finite field arithmetic units. To determine the effective variable length finite field arithmetic architecture, two well-known curve scalar multiplication algorithms were implemented on FPGA. The affine coordinates algorithm must use a hardware division unit, but the projective coordinates algorithm only uses a fast multiplication unit. The former algorithm needs the division hardware. The latter only requires a multiplication hardware, but it need more space to store intermediate results. To make the division unit versatile, we need to add a feedback signal line at every bit position. We proposed a method to mitigate this problem. For multiplication in projective coordinates implementation, we use a widely used digit serial multiplication hardware, which is simpler to be made versatile. We experimented with our implemented ECC coprocessors using variable length finite field arithmetic unit which has the maximum field size 256. On the clock speed 40 MHz, the scalar multiplication time is 6.0 msec for affine implementation while it is 1.15 msec for projective implementation. As a result of the study, we found that the projective coordinates algorithm which does not use the division hardware was faster than the affine coordinate algorithm. In addition, the memory implementation effectiveness relative to logic implementation will have a large influence on the implementation space requirements of the two algorithms.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.483-488
• /
• 2004

For real-time applications, the underlying operating system (0S) should support timeliness guarantees of real-time tasks. However, most of current operating systems do not provide timely management facilities in an efficient way. There could be two approaches to support timely management facilities for real-time applications: (1) by modifying 0S kernel and (2) by Providing a middleware without modifying 0S. In our approach, we adopted the middleware approach based on the TMO (Time-triggerred Message-triggered Object) model which is a well-known real-tine object model. The middleware, named TMSOM (TMO Support Middleware) has been implemented on various OSes such as Linux and Windows XP/NT/98. In this paper, we mainly consider TMOSM implemented on Linux(TMOS/Linux). Although the real-time schedul-ing aIgorithm used in current TMOSM/Linux can produce an efficient real-time schedule, it can be improved for periodic real-time tasks by considering several factors. In this paper, we discuss those factors and propose an improved real-time scheduling algorithm for periodic real-time tasks, In order to simulate the performance of our algorithm, we measure timeliness guarantee rate for periodic real-time tasks. The result shows that the performance of our algorithm is superior to that of existing algorithm. Additionally, the proposed algorithm can improve system performance by making the structure of real-time middleware simpler.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.79-89
• /
• 2010

Recently, distributed video coding (DVC) has been actively studied for low complexity video encoder. The complexity of the encoder in DVC is much simpler than that of traditional video coding schemes such as H.264/AVC, but the complexity of the decoder in DVC increases. In this paper, we propose the Region-Of-Interest (ROI) based DVC with low decoding complexity. The proposed scheme uses the ROI, the region the motion of objects is quickly moving as the input of the Wyner-Ziv (WZ) encoder instead of the whole WZ frame. In this case, the complexity of encoder and decoder is reduced, and the bite rate decreases. Experimental results show that the proposed scheme obtain 0.95 dB as the maximum PSNR gain in Hall Monitor sequence and 1.87 dB in Salesman sequence. Moreover, the complexity of encoder and decoder in the proposed scheme is significantly reduced by 73.7% and 63.3% over the traditional DVC scheme, respectively. In addition, we employ the layered belief propagation (LBP) algorithm whose decoding convergence speed is 1.73 times faster than belief propagation algorithm as the Low-Density Parity-Check (LDPC) decoder for low decoding complexity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.3 no.2
• /
• pp.18-35
• /
• 1993

The water level control system of the steam generator in a pressurized water reactor and its control problems are analysed. In this work the stable control strategy during the low power operation and transient states is studied. To solve the problem, a fuzzy logic control method is applied as a basic algorithm of the controller. The control algorithm is based on the operator's knowledges and the experiences of manual operation for water level control at the compact nuclear simulator set up in Korea Atomic Energy Research Institute. From a viewpoint of the system realization, the control variables and rules are established considering simpler tuning and the input-output relation. The control strategy includes the dynamic tuning method and employs a substitutional information using the bypass valve opening instead of incorrectly measured signal at the low flow rate as the fuzzy variable of the flow rate during the pressure control mode of the steam generator. It also involves the switching algorithm between the control valves to suppress the perturbation of water level. The simulation results show that both of the fine control action at the small level error and the quick response at the large level error can be obtained and that the performance of the controller is improved.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.104-113
• /
• 1997

In this paper, we investigate on the techniques for still image compression based on the wavelet transform, which will be adopted as a part of the MPEG-4 compression standards. Also we propose an effective still image compression technique, which is simpler than the MPEG-4 compression method and is improved by using a visually weighted quantizer based to HVS(Human Visual System), Simulations are carried out and compared with the algorithm proposed in MPEG-4. The simulation results show that the proposed method in this paper gives much better image quality than that of the method in MPEG-4. Also, except the case where the compression ratio is high, it shows that the proposed method has lower in complexity and provides a better subjective and objective image quality than EZW in most cases. Since wavelet transform well reflects HVS, the compressed image rarely causes blocking artifact compared with JPEG, and in most cases, it shows considerable quality improvement over JPEG.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.1-7
• /
• 2009

An approach for the classification of music genres using a Fuzzy c-Means(FcM) with divergence-based kernel is proposed and presented in this paper. The proposed model utilizes the mean and covariance information of feature vectors extracted from music data and modelled by Gaussian Probability Density Function (GPDF). Furthermore, since the classifier utilizes a kernel method that can convert a complicated nonlinear classification boundary to a simpler linear one, he classifier can improve its classification accuracy over conventional algorithms. Experiments and results on collected music data sets demonstrate hat the proposed classification scheme outperforms conventional algorithms including FcM and SOM 17.73%-21.84% on average in terms of classification accuracy.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.9
• /
• pp.4587-4592
• /
• 2012

Purpose: This study used receiver operating characteristic curve to analyze Surveillance, Epidemiology and End Results (SEER) neuroblastoma (NB) and other peripheral nerve cell tumors (PNCT) outcome data. This study found under usage of radiotherapy in these patients. Materials and methods: This study analyzed socio-economic, staging and treatment factors available in the SEER database for NB and other PNCT. For the risk modeling, each factor was fitted by a generalized linear model to predict the outcome (soft tissue specific death, yes/no). The area under the receiver operating characteristic curve (ROC) was computed. Similar strata were combined to construct the most parsimonious models. A random sampling algorithm was used to estimate the modeling errors. Risk of neuroendocrine (other endocrine including thymus as coded in SEER) death was computed for the predictors. Results: There were 5261 patients diagnosed from 1973 to 2009 were included in this study. The mean follow up time (S.D.) was 83.8 (97.6) months. The mean (SD) age was 18 (25) years. About 30.45% of patients were un-staged. The SEER staging has high ROC (SD) area of 0.58 (0.01) among the factors tested. We simplified the 4-layered risk levels (local, regional, distant, un-staged/others) to a simpler 3-tiered model with comparable ROC area of 0.59 (0.01). Less than 50% of PNCT patients received radiotherapy (RT) including the ones with localized disease. This avoidance of RT use occurred in adults and children. Conclusion: The high under-staging rate may have precented patients from selecting definitive radiotherapy (RT) after surgery. Using RT for, especially, adult PNCT patients is a potential way to improve outcome.

• Proceedings of the KSME Conference
• /
• 2001.06e
• /
• pp.386-391
• /
• 2001

A finite element code based on P2P1 tetra element has been developed for the large eddy simulation (LES) of turbulent flows around a complex geometry. Fractional 4-step algorithm is employed to obtain time accurate solution since it is less expensive than the integrated formulation, in which the velocity and pressure fields are solved at the same time. Crank-Nicolson method is used for second order temporal discretization and Galerkin method is adopted for spatial discretization. For very high Reynolds number flows, which would require a formidable number of nodes to resolve the flow field, SUPG (Streamline Upwind Petrov-Galerkin) method is applied to the quadratic interpolation function for velocity variables, Noting that the calculation of intrinsic time scale is very complicated when using SUPG for quadratic tetra element of velocity variables, the present study uses a unique intrinsic time scale proposed by Codina et al. since it makes the present three-dimensional unstructured code much simpler in terms of implementing SUPG. In order to see the effect of numerical diffusion caused by using an upwind scheme (SUPG), those obtained from P2P1 Galerkin method and P2P1 Petrov-Galerkin approach are compared for the flow around a sphere at some Reynolds number. Smagorinsky model is adopted as subgrid scale models in the context of P2P1 finite element method. As a benchmark problem for code validation, turbulent flows around a sphere and a MIRA model have been studied at various Reynolds numbers.