• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.7
• /
• pp.628-639
• /
• 1991

A new efficient method for GaAs MESFET model parameter extraction is proposed, which is based on the bias dependance of each parameter characteristics derved from the analytic model. The requiremnts of the method are only small-signal S-parameter measurements under the three bias variations. Fixation of the linear model parameter values in the optimization process is made using the sensitivity information of the model parameter obtained by the weighted Broyden update method, it is to improve the uniqueness and reliablility of the solution. The validity of the extracted values of the FET model parameters is confirmed by comparing the simulation results with the experimental data.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.822-825
• /
• 1999

This paper compares two methods of GPS/INS integration ; tightly-coupled integration ana loosely-coupled integration. In the tightly -coupled method an integrated Kalman filter is designed to process raw GPS measurement data for state update and INS data for propagation. The loosely-coupled integration method uses the solution outputs from a stand-alone GPS receiver for update. The loosely-coupled method is simpler and can readily be applied to off-the-self receivers and sensors while the tightly-coupled integration requires access to raw measurement mechanism of the receiver. Simulation result show that the tightly-coupled integration system exhibits better performance and robustness than loosely-coupled integration method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.23-28
• /
• 1996

Model-based coding is one of several approaches to very low bit rate image coding and it can be used in many applications such as image creation and virtual reality. However, its analysis and synthesis processes remain difficult, especially in the sense that the resulting synthesized image reveals some degradation in detailed facial components such as furrows around eyes and mouth. To solve the problem, a large number of methods have been proposed and the texture update method is one of them. In this paper, we investigate texture synthesis for model-based coding. In the update process of the proposed texture synthesis algorithm, texture information is stored in a memory and the decoder reuses it. With this method, the transmission bit rate for texture data can be reduced compared with the conventional method updating texture periodically.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.63-66
• /
• 1998

In the implementation of the simplex method program, the representation and the maintenance of basis matrix is very important, In the experimental study, we investigates Suhl's idea in the LU factorization and LU update of basis matrix. First, the triangularization of basis matrix is implemented and its efficiency is shown. Second, various technique in the dynamic Markowitz's ordering and threshold pivoting are presented. Third, modified Forrest-Tomlin LU update method exploiting sparsity is presented. Fourth, as a storage scheme of LU factors, Gustavson data structure is explained. Fifth, efficient timing of reinversion is developed. Finally, we show that modified Forrest-Tomlin method with Gustavson data structure is superior more than 30% to the Reid method with linked list data structure.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.4
• /
• pp.227-238
• /
• 2008

In this paper we extend primal-dual interior point algorithm for linear optimization (LO) problems to $P_*({\kappa})$ linear complementarity problems(LCPs) ([1]). We define proximity functions and search directions based on kernel functions, ${\psi}(t)=\frac{t^{p+1}-1}{p+1}-{\log}\;t$, $p{\in}$[0, 1], which is a generalized form of the one in [16]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$ LCPs. We show that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have $O((1+2{\kappa})nlog{\frac{n}{\varepsilon}})$ complexity which is similar to the one in [16]. For small-update methods, we have $O((1+2{\kappa})\sqrt{n}{\log}{\frac{n}{\varepsilon}})$ which is the best known complexity so far.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.4
• /
• pp.245-251
• /
• 2014

Wireless Sensor Networks(WSNs) are applied to many monitoring applications. Present sensor nodes can perform many functions at the same time and contain complex software. During the lifetime of sensor nodes, they are required to reprogram their software because of their new functions, software, software bug fixes. The nodes are inaccessible physically or it is very difficult to upgrade their software by one by one. To upgrade the software of sensor nodes in WSNs remotely, this paper presents an energy efficient method by selecting an optimal relay node. The CHR(Cluster Head Relay) method is compared with SPIN and RANDOM method. Three methods are simulated in NS-2 with the same environmental parameters. Simulation results show that CHR shows faster update time and less power consumption compared with other two methods.

• Structural Engineering and Mechanics
• /
• v.30 no.2
• /
• pp.165-176
• /
• 2008

In this paper, a new iterative method for solving vehicle-bridge interaction problems is proposed. Iterative methods have advantages over the non-iterative methods in that it is not necessary to update the system matrix for a given wheel location, and the method can be applied for a new type of car or bridge with few or no modifications. In the proposed method, the necessity of system matrices update is eliminated using the equivalent interaction force acting on the bridge, which is obtained iteratively. Ballast stiffness is included in the interaction forces and the geometric compatibility at the contact points are used as convergence criteria. The bridge is considered as an elastic Bernoulli-Euler beam with surface irregularity and ballast stiffness. The moving vehicle is modeled as a multi-axle mass-spring-damper system having many degrees of freedom depending on the number of axles. The pitching effect, which is the interaction effect between the rear and front wheels when a vehicle begins to enter or leave the bridge, is also considered in the formulation including extended ground boundaries having surface irregularity and ballast stiffness. The applicability of the proposed method is illustrated in the numerical studies.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.4E
• /
• pp.154-158
• /
• 2006

In this paper, we suggest a noise estimation method for speech enhancement in nonstationary noisy environments. The proposed method consists of the following two main processes. First, in order to receive fewer affect of variable signals, a best fitting regression line is used, which is obtained by applying a least squares method to coefficient magnitudes in a node with a uniform wavelet packet transform. Next, in order to update the noise estimation efficiently, a differential forgetting factor and a correlation coefficient per subband are used, where subband is employed for applying the weighted value according to the change of signals. In particular, this method has the ability to update the noise estimation by using the estimated noise at the previous frame only, without utilizing the statistical information of long past frames and explicit nonspeech frames by voice activity detector. In objective assessments, it was observed that the performance of the proposed method was better than that of the compared (minima controlled recursive averaging, weighted average) methods. Furthermore, the method showed a reliable result even at low SNR.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.83-91
• /
• 2011

The roadmap DB update for unknown roads is a very important factor for car navigation systems. In this paper, we propose a cloud computing based roadmap generation method for use between heterogeneous navigation system for unknown roads. While the drivers drive on unknown roads, the proposed method extracts the road attribute information, and then generates the metadata in an XML format that is available for the heterogeneous navigation systems in a cloud environment. The metadata is proposed to be used as a replacement for conventional proprietary roadmap formats which used by roadmap providers, which is efficient for heterogeneous navigation system providers in a cloud computing environment. Then, this metadata is provided to the roadmap DB providers through the cloud computing interfaces. With the proposed method, the roadmap DB providers update the own roadmap DB for navigation systems in real time. Therefore, the proposed method can reduce the costs of an actual traveling test and the maintenance for the roadmap DB provides. Thus, the cloud-oriented road map generation method can more efficiently update the unknown road information.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.1-11
• /
• 2000

This study suggests the partition algorithm for updating the discovered association rules in large database, because a database may allow frequent or occasional updates, and such update may not only invalidate some existing strong association rules, but also turn some weak rules into strong ones. the Partition algorithm updates strong association rules efficiently in the whole update database reuseing the information of the old large itemsets. Partition algorithms that is suggested in this study scans an incremental database in view of the fact that it is difficult to find the new set of large itemset in the whole updated database after an incremental database is added to the original database. This method of generating large itemsets is different from that of FUP(Fast Update) and KDP(Kim Dong Pil)