• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4529-4548
• /
• 2016

DDoS attacks have had a devastating effect on the Internet, which can cause millions of dollars of damage within hours or even minutes. In this paper we propose a practical dynamic defense approach that overcomes the shortage of static defense mechanisms. Our approach employs a group of SDN-based proxy switches to relay data flow between users and servers. By substituting backup proxy switches for attacked ones and reassigning suspect users onto the new proxy switches, innocent users are isolated and saved from malicious attackers through a sequence of remapping process. In order to improve the speed of attacker segregation, we have designed and implemented an efficient greedy algorithm which has been demonstrated to have little influence on legitimate traffic. Simulations, which were then performed with the open source controller Ryu, show that our approach is effective in alleviating DDoS attacks and quarantining the attackers by numerable remapping process. The simulations also demonstrate that our dynamic defense imposes little effect on legitimate users, and the overhead introduced by remapping procedure is acceptable.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.131.1-134
• /
• 1999

The effect of dynamic recrystallization during hot forming process was implemented to a commercial FEM code by conditioned remeshing and remapping of sate variables. A datum strain for stress compensation was determined as a strain for maximum softening rate and was able to be formulated as a function of critical strain f($\varepsilon$). The validity of remapping criterion was examined by a series of mechanical tests and microstructural observation. The application of suggested datum resulted in better estimation of load-stroke during forging processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.6098-6122
• /
• 2018

Cache-based side-channel attacks have achieved more attention along with the development of cloud computing technologies. However, current host-based mitigation methods either provide bad compatibility with current cloud infrastructure, or turn out too application-specific. Besides, they are defending blindly without any knowledge of on-going attacks. In this work, we present CacheSCDefender, a framework that provides a (Virtual Machine Monitor) VMM-based comprehensive defense framework against all levels of cache attacks. In designing CacheSCDefender, we make three key contributions: (1) an attack-aware framework combining our novel dynamic remapping and traditional cache cleansing, which provides a comprehensive defense against all three cases of cache attacks that we identify in this paper; (2) a new defense method called dynamic remapping which is a developed version of random permutation and is able to deal with two cases of cache attacks; (3) formalization and quantification of security improvement and performance overhead of our defense, which can be applicable to other defense methods. We show that CacheSCDefender is practical for deployment in normal virtualized environment, while providing favorable security guarantee for virtual machines.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.418-422
• /
• 2005

In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

• Transactions of Materials Processing
• /
• v.10 no.2
• /
• pp.137-143
• /
• 2001

The change of flow stress due to dynamic recrystallization during hot forming process is investigated. A series of mechanical tests has been conducted at various temperatures, and constitutive relations and recrystallization kinetics were formulated from the test results. The effect of dynamic recrystallization to the flow stress was implemented to a commercial FEM code by conditioned remapping of state variables. The datum strain of stress compensation was optimized to minimize the overestimation of forming loads. Suggested datum was formulated as an exclusive function of critical strain for recrystallizalion and validated by mechanical tests and microstructural observations.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.203-206
• /
• 1999

The shift of flow behavior due to dynamic recrystallization during hot forming process is investigated, A series of load relaxation and compression tests has been conducted at various temperatures Constitutive relations and recrystallization behaviors were formulated from the mechanical test results, The consideration of dynamic recrystallization during a specific forming process was implemented to commercial FEM package by conditioned remeshing and remapping of state variables. Improvement of Load-Stroke prediction was validated by comparison with experimental results.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.2
• /
• pp.137-140
• /
• 2021

High dynamic range (HDR) technology has been drawing attention in the field of imaging and consumer entertainment. As tools for capturing and creating HDR contents, encoding, and transmission evolve to support HDR formats, various display capabilities are being developed and increased. Hence, there is need for remapping native HDR imagery for display on lower quality legacy standard dynamic range (SDR) displays. This operation is referred to as tone mapping. In this paper, we present a sectional tone mapping method by Lenzen, and expand upon a tone mapping approach to improve temporal stability while maintaining picture quality. Compared to the existing block-based sectional tone mapping, our method uses the edge awareness-based tone mapping. We estimate the performance of the objective metric on temporal flickering. The experimental result shows that the algorithm maintains a smoother relationship between the output luminance values, and this reveals success in reducing halos and improving temporal stability with adopted edge aware filtering.

• Transactions of Materials Processing
• /
• v.17 no.2
• /
• pp.117-123
• /
• 2008

In this study, optimum processing condition of rolled AZ31 Mg alloy was investigated by utilizing processing map and constitutive equation considering microstructure evolution(dynamic recrystallization) occurring during hot-working. A series of mechanical tests were conducted at various temperatures and strain rates to construct a processing map and to formulate the recrystallization kinetics in terms of grain size. Dynamic recrystallization(DRX) was observed to occur at a domain of $250^{\circ}C$ and 1/s(maximum dissipation-efficiency region). The effect of DRX kinetics on microstructure evolution was implemented in a commercial FEM code followed by remapping of the state variables. The volume fraction and grain size of deformed part were predicted using a modified FEM code and were compared with those of actual hot forged part. A good agreement was observed between the experimented results and predicted ones.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2007.10a
• /
• pp.31-34
• /
• 2007

In this study, optimum processing condition of AZ31 Mg alloy was investigated utilizing processing map and constitutive equation considering microstructure evolution (dynamic recrystallization) during hot-working. A series of mechanical tests were conducted at various temperatures and strain rates to construct a processing map and to formulate the recrystallization kinetics and grain size relation. Dynamic recrystallization (DRX) was observed to occur revealing maximum intensity at a domain of $250^{\circ}C$ and 1/s. The effect of DRX kinetics on microstructure evolution was implemented in a commercial FEM code followed by remapping of the state variables. The volume fraction and grain size of deformed part were predicted using a modified FEM code and compared with those of actual hot forged one. A good agreement was observed between the experimental results and predicted ones.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.