• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.129-131
• /
• 2004

Elliptic Curve Cryptography (ECC) coprocessors support massive scalar multiplications of a point. We research the design for multi-segment multipliers in fixed-size ECC coprocessors using the multi-segment Karatsuba algorithm on GF($2^m$). ECC coprocessors of the proposed multiplier is verified on the SoC-design verification kit which embeds ALTERA EXCALIBUR FPGAs. As a result of our experiment, the multi-segment Karatsuba multiplier, which has more efficient performance about twice times than the traditional multi-segment multiplier, can be implemented as adding few H/W resources. Therefore the multi-segment Karatsuba multiplier which satisfies performance for the cryptographic algorithm, is adequate for a low cost embedded system, and is implemented in the minimum area.

• Journal of Korean Neurosurgical Society
• /
• v.42 no.3
• /
• pp.184-190
• /
• 2007

Objective : The authors retrospectively analyzed clinical and radiographic features of patients who developed symptomatic adjacent segment degeneration (ASD) that required re-operation. Methods : From 1995 to 2004, among 412 patients who underwent posterior lumbar fusion surgery, the authors experienced twenty-six patients who presented symptomatic ASD. Records of these patients were reviewed to collect clinical data at the first and second operations. Results : The patients were 9 males and 17 females whose mean age was $63.5{\pm}8.7$ years. Among 319 one segment and 102 multi-segment fusions, 16 and 10 patients presented ASD, respectively. Seventeen ASDs were noticed at the cephalad to fusion (65%), eight at the caudad (31%), and one at the cephalad and caudad, simultaneously (4%). All patients underwent decompression surgery. Nine patients underwent additional fusion surgeries to adjacent degenerated segments. In 17 patients who underwent only decompression surgery without fusion, the success rate was 82.4%. In fusion cases. the success rate was observed as 55.5%. There were no statistically significant factors to be related to development of ASD. However, in cases of multi-level fusion surgery, there was a tendency toward increasing ASD. Conclusion : Multi-segment fusion surgery could be associated with a development of ASD. In surgical treatment of symptomatic ASD, selective decompression without fusion may need to be considered as a primary procedure, which could reduce the potential risk of later occurrence of the other adjacent segment disease.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.200-202
• /
• 1999

This paper describes the optimization problem of real power rescheduling and present an algorithm based linear programming for studying the load-shedding and generation reallocation problem when a portion of the transmission system is disabled and at power flow solution cannot be obtained for the overload of some lines. And in case initial is infeasible, solution could not be converge. So this paper gives an algorithm being lie infeasible quantities within limit. The paper describes a LP-based algorithm to obtain the solution in power dispatch related to overload situations in power system and it is easily extened under various objective. The optimization procedures is based in linear programming with bounded variables and use the multi-segment curve method for a objective function and the validity of the algorithm is verified with two examples : 10-bus system and 57-bus system.

• Archives of Reconstructive Microsurgery
• /
• v.25 no.2
• /
• pp.60-64
• /
• 2016

Segmental amputation of the digits and hand has been described as a contraindication for replantation because of poor results. We report the results of replantation for a patient who experienced multi-segment amputation of the hand. A 39-year-old man presented six hours after an accident, while using a straw cutter, that caused a multi-segment amputation of the entire palm and digits. The replantation surgery took 18 hours. We observed the patient gain satisfactory function of the hand. For replantation of a multi-segment amputation, connecting as many blood vessels as possible without tension is most important.

• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2007.04a
• /
• pp.99-100
• /
• 2007

유도결합 플라즈마(ICP)를 이용한 CVD 장치에서 플라즈마를 발생시키기 위한 안테나의 구조는 매우 중요하다. 전자 온도와 전자 밀도에 직접적인 영향을 주게 되며, 뿐만 아니라 증착 물질의 두께 균일도에 결정적인 역할을 하게 된다. 본 연구에서는 플라즈마 특성 균일도 최적화를 위하여 2turn 직렬, 병렬, 혼합의 ICP 안테나의 구조에 대하여 플라즈마 특성 및 $SiO_2$ CVD 증착 특성을 계산하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.8 s.338
• /
• pp.15-26
• /
• 2005

In this paper, we propose an efficient $GF(2^m)$ multi-segment multiplier architecture and study its application to elliptic curve cryptography processors. The multi-segment based ECC datapath has a very small combinational multiplier to compute partial products, most of its internal data buses are word-sized, and it has only a single m bit multiplexer and a single m bit register. Hence, the resource requirements of the proposed ECC datapath can be minimized as the segment number increases and word-size is decreased. Hence, as compared to the ECC processor based on digit-serial multiplication, the proposed ECC datapath is more efficient in resource usage. The resource requirement of ECC Processor implementation depends not only on the number of basic hardware components but also on the complexity of interconnection among them. To show the realistic area efficiency of proposed ECC processors, we implemented both the ECC processors based on the proposed multi-segment multiplication and digit serial multiplication and compared their FPGA resource usages. The experimental results show that the Proposed multi-segment multiplication method allows to implement ECC coprocessors, requiring about half of FPGA resources as compared to digit serial multiplication.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.645-652
• /
• 2004

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology in-formation within PG referring bandwidth and delay parameter. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multi pie-links aggregation. And we apply it to current star topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.33-40
• /
• 2004

The divide-and-conquer method is efficiently used in parallel multiplier over finite field $GF(2^n)$. Leone Proposed optimal stop condition for iteration of Karatsuba-Ofman algerian(KOA). Ernst et al. suggested Multi-Segment Karatsuba(MSK) method. In this paper, we analyze the complexity of a parallel MSK multiplier based on the method. We propose a new parallel MSK multiplier whose space complexity is same to each other. Additionally, we propose optimal stop condition for iteration of the new MSK method. In some finite fields, our proposed multiplier is more efficient than the KOA.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.135-142
• /
• 2010

QoS in the proxy system are under heavy influence from interferences such as congestion, latency, and retransmission. Also, multi-level streaming services affects from temporal synchronization, which lead to degrade the service quality. This paper proposes a new segment-based buffer management mechanism which reduces performance degradation of streaming services and enhances throughput of streaming due to drawbacks of the proxy system. The proposed paper optimizes streaming services by: 1) Use of segment-based buffer management mechanism, 2) Minimization of overhead due to congestion and interference, and 3) Minimization of retransmission due to disconnection and delay. This paper utilizes fuzzy value $\mu$ and cost weight $\omega$ to process the result. The simulation result shows that the proposed mechanism has better performance in buffer cache control rate, average packet loss rate, and delay saving rate with stream relevance metric than the other existing methods of fixed segmentation method, pyramid segmentation method, and skyscraper segmentation method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.120-128
• /
• 2015

Quality function deployment (QFD) is a useful method in product design and development to maximize customer satisfaction. In the QFD, the technical attributes (TAs) affecting the product performance are identified, and product performance is improved to optimize customer requirements (CRs). For product development, determining the optimal levels of TAs is crucial during QFD optimization. Many optimization methods have been proposed to obtain the optimal levels of TAs in QFD. In these studies, the levels of TAs are assumed to be continuous while they are often taken as discrete in real world application. Another assumption in QFD optimization is that the requirements of the heterogeneous customers can be generalized and hence only one house of quality (HoQ) is used to connect with CRs. However, customers often have various requirements and preferences on a product. Therefore, a product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. To overcome these problems, this paper proposes an optimization approach to find the optimal set of TAs under multi-segment market. Dynamic Programming (DP) methodology is developed to maximize the overall customer satisfaction for the market considering the weights of importance of different segments. Finally, a case study is provided for illustrating the proposed optimization approach.