• Journal of the Optical Society of Korea
• /
• v.18 no.2
• /
• pp.134-145
• /
• 2014

The number of lens groups in modern zoom camera systems is increased above that of conventional systems in order to improve the speed of the auto focus with the high quality image. As a result, it is difficult to calculate zoom loci using the conventional analytic method, and even the recent one-step advanced numerical calculation method is not optimal because of the time-consuming problem generated by the iteration method. In this paper, in order to solve this problem, we suggest a new unified analytic method for zoom lens loci with finite object distance including infinite object distance. This method is induced by systematically analyzing various distances between the object and other groups including the first lens group, for various situations corresponding to zooming equations of the finite lens systems after using a spline interpolation for each lens group. And we confirm the justification of the new method by using various zoom lens examples. By using this method, we can easily and quickly obtain the zoom lens loci not only without any calculation process of iteration but also without any limit on the group number and the object distance in every zoom lens system.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2008.11a
• /
• pp.638-641
• /
• 2008

Design is an iterative, generative, and multidisciplinary process by its nature. Iteration is frequent in most of the engineering design and development projects including construction. Design iterations cause rework, and extra efforts are required to get the optimal sequence and to manage the projects. Contrary to simple design, isolation of the generative iterations in complex design systems is very difficult, but reduction in overall iterations is possible. Design depends upon the information flow within domain and also among various design disciplines and organizations. Therefore, it is suggested that managers should be aware about the crucial iterations causing rework and optimal sequence as well. In this way, managers can handle design parameters related to such iterations proactively. Numbers of techniques are available to reduce iterations for various kinds of engineering designs. In this paper, parameter based Design Structure Matrix (DSM) is chosen. To create this DSM, a survey was performed and then partitioned using a model. This paper provides an easy approach to those companies involved in or intend to be involved in "design and build projects."

• Smart Media Journal
• /
• v.3 no.2
• /
• pp.9-13
• /
• 2014

The Levenberg-Marquardt (LM) algorithm is the most widely used fitting algorithm. It outperforms simple gradient descent and other conjugate gradient methods in a wide variety of problems. Based on the work of paper[1], we propose a modified Levenberg-Marquardt algorithm for better performance of mobile system. The LM parameter at the $k_{th}$ iteration is chosen ${\mu}=A{\bullet}{\parallel}f(x){\parallel}{\bullet}I$ where f is the residual function, and J is the Jacobi of f. In this paper, we show this method is more efficient than traditional method under the situation that the system iteration is limited.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• Proceedings of the KIEE Conference
• /
• 2000.07b
• /
• pp.623-625
• /
• 2000

For the finite element analysis of highly saturated rotating machines involving rotation of a rotor such as dynamic analysis. cogging torque analysis and etc, so much time is needed because a new system matrix equation should be solved for each iteration and time step. It is proved in this paper that. in linear systems. the computational time can be greatly reduced by using the domain decomposition method (DDM). In nonlinear systems. however. this advantage vanishes because the stiffness matrix changes at each iteration especially when using the Newton-Raphson (NR) method. The transmission line modeling (TLM) method resolves this problem because in TLM method the stiffness matrix does not change throughout the entire analysis. In this paper, a new technique for FEA of rotating machines including rotation of rotor and non-linearity is proposed. This method is applied to a test problem. and compared with the conventional method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.2 s.257
• /
• pp.221-230
• /
• 2007

An iterated improved reduced system (IIRS) procedure combined with sub-structuring scheme for nonclassically damped structural systems is presented. For dynamic analysis of such systems, complex eigenproperties are required to incorporate properly the nonclassical damping effect. In complex structural systems, the equations of motion are written in the state space from. Thus, the number of degrees of freedom of the new equations of motion and the size of the associated eigenvalue problem required to obtain the complex eigenvalues and eigenvectors are doubled. Iterated IRS method is an efficient reduction technique because the eigenproperties obtained in each iteration step improve the condensation matrix in the next iteration step. However, although this reduction technique reduces the size of problem drastically, it is not efficient to apply this technique to a single domain finite element model with degrees of freedom over several thousands. Therefore, for a practical application of the reduction method, accompanying sub-structuring scheme is necessary. In the present study, iterated IRS method combined with sub-structuring scheme for nonclssically damped structures is developed. Numerical examples demonstrate the convergence and the efficiency of a newly developed scheme.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.44-50
• /
• 1999

This paper presents a set of techniques to automatically find rate optimal or near rate optimal implementation of shift-invariant flow graphs on pipelined processor, in which pipeline processor has multiple accumulators and internal datapaths. In such case, the problem to be addressed is the scheduling of multiple instruction streams which control all of the pipeline stages. The goal of an automatic scheduler in this context is to rearrange the order of instructions such that they are executed with minimum iteration period between successive iteration of defining flow graphs. The scheduling algorithm described in this paper also focuses on the problem of removing the hazards due to inter-instruction dependencies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.907-914
• /
• 1997

The conventional decoding procedure for the images encoded using fractal contractive transformation algorithms is performed by applying the transformations iteratively for an arbirary initial image. In this paper, we showed that the atractor image can be obtained analytically when the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fixed. Using the analytical formula, we can obtain the attractor image without iteration procedure. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formula compared to the previous iteration methods. Also we confirmed that the real time decoding by software on PD is possible for the moving picture with QCIF formats.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.333-339
• /
• 2016

A multi-stage turbo equalization scheme based on the bit-level combining (BLC) is proposed for multiple-input multiple-output (MIMO) systems with hybrid automatic repeat request (HARQ). In the proposed multi-stage turbo equalization scheme, the minimum mean-square-error equalizer at each iteration calculates the extrinsic log-likelihood ratios for the transmitted bits in a subpacket and the subpackets are sequentially replaced at each iteration according to the HARQ rounds of received subpackets. Therefore, a number of iterations are executed for different subpackets received at several HARQ rounds, and the transmitted bits received at the previous HARQ rounds as well as the current HARQ round can be estimated from the combined information up to the current HARQ round. In addition, the proposed multi-stage turbo equalization scheme has the same computational complexity as the conventional bit-level combining based turbo equalization scheme. Simulation results show that the proposed multi-stage turbo equalization scheme outperforms the conventional BLC based turbo equalization scheme for MIMO systems with HARQ.

• Journal of Navigation and Port Research
• /
• v.30 no.5 s.111
• /
• pp.369-374
• /
• 2006

The flow analysis was made by applying the turbulent models in the complicated fuel chamber of engine. The $k-\varepsilon,\;k-\omega$, Spalart-Allmaras and reynolds stress models are used in which the hybrid grid is applied for the simulation. The velocity vector, the pressure contour, the change of residual along the iteration number, and the dynamic head are simulated for the comparison of four example cases. Computational results are compared with others. For the code's validation, 2-D bodies were simulated in advance by predicting the drag coefficients.