• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.115-125
• /
• 2011

By use of a mortality forecasting model and a life table, forecasting the average life expectancy is an effective way to evaluate the future mortality level. There are differences between the actual values of average life expectancy at present and the forecasted values of average life expectancy in population projection 2006 from Statistics Korea. The reason is that the average life expectancy forecasts did not reflect the increasing speed of the actual ones. The main causes of the problem may be errors from judgment for projection, from choice, or use of a mortality forecasting model. In this paper, we focus on the choice of the mortality forecasting model to inspect this problem. Statistics Korea should take a mortality forecasting model with considerable investigation to proceed population projection 2011 without the errors observed in population projection 2006. We compare the five mortality forecasting models that are the LC(Lee and Carter) model used widely and its variants, and the HP8(Heligman and Pollard 8 parameter) model for handling death probability. We make average life expectancy forecasts by sex using modeling results from 2010 to 2030 and compare with that of the population projection 2006 during the same period. The average life expectancy from all five models are forecasted higher than that of the population projection 2006. Therefore, we show that the new average life expectancy forecasts are relatively suitable to the future mortality level.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.147-154
• /
• 2007

Network topology in ad hoc networks keeps changing because of node mobility and no limitation in number of nodes. Therefore, the scalability of routing protocol is of great importance, However, table driven protocols such as DSDV have been known to be suitable for relatively small number of nodes and low node mobility, Various protocols like FSR, OLSR, and PCDV have been proposed to resolve scalability problem but vet remain to be proven for their comparative superiority for scalability, In this paper, we compare and amine them by employing various network deployment scenarios as follows: network dimension increase's while keeping node density constant node density increases while keeping network dimension fixed, and the number of sessions increase with the network dimension and the number of nodes fixed. the DSDV protocol showed a low scalability despite that it imposes a low overhead because its convergence speed against topology change is slow, The FSR's performance decreased according to the increase of overhead corresponding to increasing number of nodes, The OLSR with the shortest convergence time among them shows a good scalability, but turned out to be less scalable than the PCDV that uses a clustering because of its relatively high overhead.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.728-743
• /
• 2014

Finger printing and sequence alignment are well-known approaches for document similarity comparison. A fingerprinting method is simple and fast, but it can not find particular similar regions. A string alignment method is used for identifying regions of similarity by arranging the sequences of a string. It has an advantage of finding particular similar regions, but it also has a disadvantage of taking more computing time. The Multi-Level Alignment (MLA) is a new method designed for taking the advantages of both methods. The MLA divides input documents into uniform length blocks, and then extracts fingerprints from each block and calculates similarity of block pairs by comparing the fingerprints. A similarity table is created in this process. Finally, sequence alignment is used for specifying longest similar regions in the similarity table. The MLA allows users to change block's size to control proportion of the fingerprint algorithm and the sequence alignment. As a document is divided into several blocks, similar regions are also fragmented into two or more blocks. To solve this fragmentation problem, we proposed a united block method. Experimentally, we show that computing document's similarity with the united block is more accurate than the original MLA method, with minor time loss.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.84-89
• /
• 2003

In this paper, we real-time implemented to the TMS320C5416 the vocoder of variable bit rate applied the SOLA-B algorithm by Henja to the ITU-T G.729A vocoder of 8kbps transmission rate. This proposed method using the SOLA-B algorithm is that it is reduced the duration of the speech in encoding and is played at the speed of normal by extending the duration of the speech in decoding. At this time, we bandied that the interval of cross correlation function if skipped every 3 sample for decreasing the computational amount of SOLA-B algorithm. The real-time implemented vocoder of C.729A and SOLA-B algorithm is represented the complexity of maximum that is 10.2MIPS in encoder and 2.8MIPS in decoder of 8kbps transmission rate. Also, it is represented the complexity of maximum that is 18.5MIPS in encoder and 13.1MIPS in decoder of 6kbps, it is 18.5MIPS in encoder and 13.1MIPS in decoder of 4kbps. The used memory is about program ROM 9.7kwords, table ROM 4.5kwords, RAM 5.1 kwords. The waveform of output is showed by the result of C simulator and Bit Exact. Also, for evaluation of speech quality of the vocoder of real-time implemented variable bit rate, it is estimated the MOS score of 3.69 in 4kbps.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.5
• /
• pp.62-70
• /
• 2007

In this paper, the boost Power Factor Correction(PFC) technique for Direct Torque Control(DTC) of brushless DC motor drive in the constant torque region is implemented on a TMS320F2812DSP. Unlike conventional six-step PWM current control, by properly selecting the inverter voltage space vectors of the two-phase conduction mode from a simple look-up table at a predefined sampling time, the desired quasi-square wave current is obtained, therefore a much faster torque response is achieved compared to conventional current control. Furthermore, to eliminate the low-frequency torque oscillations caused by the non-ideal trapezoidal shape of the actual back-EMF waveform of the BLDC motor, a pre-stored back-EMF versus position look-up table is designed. The duty cycle of the boost converter is determined by a control algorithm based on the input voltage, output voltage which is the dc-link of the BLDC motor drive, and inductor current using average current control method with input voltage feed-forward compensation during each sampling period of the drive system. With the emergence of high-speed digital signal processors(DSPs), both PFC and simple DTC algorithms can be executed during a single sampling period of the BLDC motor drive. In the proposed method, since no PWM algorithm is required for DTC or BLDC motor drive, only one PWM output for the boost converter with 80 kHz switching frequency is used in a TMS320F2812 DSP. The validity and effectiveness of the proposed DTC of BLDC motor drive scheme with PFC are verified through the experimental results. The test results verify that the proposed PFC for DTC of BLDC motor drive improves power factor considerably from 0.77 to as close as 0.9997 with and without load conditions.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.12
• /
• pp.37-42
• /
• 1999

In this paper, some of main processes for the next generation integrated circuits, such as Cu damascene process using CMP, electron beam lithography, $SiO_2$ CVD and RIE, Ti/Cu-CVD were carried cut and then, two level Cu interconnects were accomplished. In the results of CMP unit processes, a 4,635 ${\AA}$/min of removal rate, a selectivity of Cu : $SiO_2$ of 150:1, a uniformity of 4.0% are obtained under process conditions of a head pressure of 4 PSI, table and head speed of 25rpm, a oscillation distance of 40 mm, and a slurry flow rate of 40 ml/min. Also 0.18 ${\mu}m\;SiO_2$ via-line patterns are fabricated using 1000 ${\mu}C/cm^2$ dose, 6 minute and 30 second development time and 1 minute and 30 second etching time. And finally sub-0.2 ${\mu}$ twolevel metal interconnects using the developed processes were fabricated and the problems of multilevel interconnects are discussed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.33-46
• /
• 2003

A Home Location Register(HLR) database system manages each subscriber's location information, which continuously changes in a cellular network. For this purpose, the HLR database system provides table management, index management, and backup management facilities. In this thesis, we propose using a two-level index method for the mobile directory number(MDN) as a suitable method and a chained bucket hashing method for the electronic serial number(ESN). Both the MDN and the ESN are used as keys in the HLR database system. We also propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the R-tree index method. The insertion and deletion overhead of the chained bucket hashing method is less than that of the modified linear hashing method. In the proposed backup method, we use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. For a million subscribers, proposed techniques support reduction of memory size(more than 62%), directory operations (2500,000 times), and backup operations(more than 80%) compared with current techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1022-1036
• /
• 2004

In mobile cellular network the ever-changing location of a mobile host necessitates the continuous tracking of its current position and efficient management of location information. A database called Home Location Register(HLR) plays a major role in location management in this distributed environment, providing table management, index management, and backup management facilities. The objectives of this paper are to identify the p개blems of the current HLR system through rigorous analysis, to suggest solutions to them, and to propose a new architecture for the HLR system. In the HLR system, a main memory database system is used to provide real-time accesses and updates of subscriber's information. Thus it is suggested that the improvement bemade to support better real-time facilities, to manage subscriber's information more reliably, and to accommodate more subscribers. In this paper, I propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the T-tree index method. Insertion md deletion overhead of the chained bucket hashing method is less than that of modified linear hashing method. In the proposed backup method, I use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. Performance analysis has been performed to evaluate the proposed techniques based on a system with subscribers. The results show that, in comparison with the current techniques, the memory requirement is reduced by more than 62%,directory operations, and backup operation by more than 80%.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.1-12
• /
• 2015

NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in $B^+$-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.

• Restorative Dentistry and Endodontics
• /
• v.12 no.2
• /
• pp.45-53
• /
• 1987

The purpose of this study was to evaluate the tensile bond strength between composite resin and the human enamel. Three composite resin systems, two chemical (Clearfil Posterior, and Clearfil Posterior-3) and one light cure (Photo Clearfil-A), used with and without an intermediate resin (clearfil bonding agent), were evaluated under different amounts of load (10g, 200g and 200g for a moment) for in vitro tensile bond strength to acid-eched human enamel. Clinically intact buccal or lingual surfaces of 144 freshly extracted human permanent molars, embedded in acrylic were flattened with No #600 carborundum discs. Samples were randomly assigned to the different materials and treatments using a table of random numbers. Eight samples were thus prepared for each group(Table 2) these surfaces were etched with an acid etchant (Kurarey Co. Japan) in a mode of etching for 30 seconds, washing for 15 seconds, and drying for 30-seconds. During the polymerization of composite resin on the acid-etched enamel surfaces with and without bonding agent 10-gram, 200 gram and temporary 200 gram of load were applied. The specimens were stored in 50% relation humidity at $37^{\circ}C$ for 24 hours before testing. An universal Testing machine (Intesco model No. 2010, Tokyo, Japan) was used to apply tensile loads in the vertical directed (fig 5), and the force required for separation was recorded with a cross head speed of 0.25 mm/min and 20 kg in full scale. The results were as follow: 1. The tensile bond strength was much greater in applying a bonding agent than in not doing that. 2. The tensile bond strength of chemical cure composite resin was higher than that of light cure composite resin with applying on bonding agent on the acid-etched enamel. 3. In case of not applying a bonding agents on the acid-etching enamel, the highest tensile bond strength under 200 gram of load was measured in light cure composite resin. 4. The tensile bond strength under 200-gram of load has no relation with applying the bonding agent. 5. Under the load of 10-gram, There was significant difference in tensile bond strength as applying the bonding agent.