• 한국ITS학회:학술대회논문집
• /
• 2005.11a
• /
• pp.62-66
• /
• 2005

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.259-266
• /
• 2011

We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

• Geomechanics and Engineering
• /
• v.28 no.5
• /
• pp.437-454
• /
• 2022

The hydro-mechanical (HM) two-way sequential coupling in the TOUGH2-FLAC3D linking algorithm is validated completely and successfully in both M to H and H to M directions, which are initiated by mechanical surface loading for geomechanical validation and hydrological groundwater pumping for hydrogeological validation, respectively. For such complete and successful validation, a TOUGH2-FLAC3D linked numerical model is developed first by adopting the TOUGH2-FLAC3D linking algorithm, which uses the two-way (fixed-stress split) sequential coupling scheme and the implicit backward time stepping method. Two geomechanical and two hydrogeological validation problems are then simulated using the linked numerical model together with basic validation strategies and prerequisites. The second geomechanical and second hydrogeological validation problems are also associated with the Mandel effect and the Noordbergum and Rhade effects, respectively, which are three phenomenally well-known but numerically challenging HM effects. Finally, sequentially coupled numerical solutions are compared with either analytical solutions (verification) or fully coupled numerical solutions (benchmarking). In all the four validation problems, they show almost perfect to extremely or very good agreement. In addition, the second geomechanical validation problem clearly displays the Mandel effect and suggests a proper or minimum geometrical ratio of the height to the width for the rectangular domain to maximize agreement between the numerical and analytical solutions. In the meantime, the second hydrogeological validation problem clearly displays the Noordbergum and Rhade effects and implies that the HM two-way sequential coupling scheme used in the linked numerical model is as rigorous as the HM two-way full coupling scheme used in a fully coupled numerical model.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.807-816
• /
• 2005

Sequential pattern mining finds all of the frequent sequences satisfying a minimum support threshold in a large database. However, when mining long frequent sequences, or when using very low support thresholds, the performance of currently reported algorithms often degrades dramatically. In this paper, we propose a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm generates the candidate sequences by depth-first search strategy in order to effectively prune. using bitmap representation of underlying databases, we can effectively calculate supports in terms of bit operations and prune sequences in much less time. Performance study shows that our algorithm outperforms the previous algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.8
• /
• pp.1-6
• /
• 2002

In this paper, we considered the CDMA/TDD system suitable for high-speed packet data transmission such as Internet and multimedia services, and a sequential decoding scheme which enables fast decoding and retransmission requirement. In addition, we Proposed an improved FANO algorithm, which adopts the competition path in order to reduce the number of revisit nodes. The conventional FANO algorithm suffered from the drawback of much more revisit nodes. Furthermore, we analyzed the performance of the CDMA/TDD system with the sequential decoding scheme we proposed over multipath channel.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.323-328
• /
• 2019

In this paper, a method of constructing an advanced sequential circuit over finite fields is proposed. The method proposed an algorithm for assigning all elements of finite fields to digital code from the properties of finite fields, discussed the operating characteristics of T-gate used to construct sequential digital system of finite fields, and based on this, formed sequential circuit without trajectory. For this purpose, the state transition diagram was allocated to the state dependency code and a whole table was drawn showing the relationship between the status function and the current state and the previous state. The following status functions were derived from the status function and the preceding table, and the T-gate and the device were used to construct the sequential circuit. It was confirmed that the proposed method was able to organize sequential digital systems effectively and systematically.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.853-874
• /
• 2016

Based on a particular overlapping domain decomposition technique, a parallel finite element discretization algorithm for the generalized Stokes equations is proposed and investigated. In this algorithm, each processor computes a local approximate solution in its own subdomain by solving a global problem on a mesh that is fine around its own subdomain and coarse elsewhere, and hence avoids communication with other processors in the process of computations. This algorithm has low communication complexity. It only requires the application of an existing sequential solver on the global meshes associated with each subdomain, and hence can reuse existing sequential software. Numerical results are given to demonstrate the effectiveness of the parallel algorithm.

• Journal of Korean Society for Quality Management
• /
• v.25 no.3
• /
• pp.22-38
• /
• 1997

In a traditional sequential acceptance sampling plan, it is assumed that the sampled items are independent each other. In this paper, stochastically dependent sequential acceptance sampling plans are dealt when there exists dependency between sampled items. Monte-Calro algorithm is used to find the acceptance and rejection probabilities of a lot. The number of defectives for the test to be accepted and rejected in probability ratio sequential test can be found by using these probabilities. The formula for measures of performance of these sampling plans is developed. Type I and II error probabilities are estimated by simulation. This research can be a, pp.ied to sequential sampling procedures in place of control charts where there is a recognized and necessary dependency during the production processes. Also, dependent multiple acceptance sampling plans can be derived by extending this sequential sampling procedure. As a numerical example, a Markov dependent process model is given, and the characteristics of the sampling plans are examined according to the change of the dependency factor.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.4
• /
• pp.351-359
• /
• 2002

In this paper, stochastically dependent single and sequential acceptance sampling plans are dealt when the process follows a Polya process model. A Monte-Cairo algorithm is used to find the acceptance and rejection probabilities of a lot. The number of defectives for the test to be accepted and rejected in a probability ratio sequential test can be found by using these probabilities. The formula to measure performance of these sampling plans is developed. Type I and II error probabilities are estimated by simulation. Dependent multiple acceptance sampling plans can be derived by extending the sequential sampling procedure. In numerical examples, single and sequential sampling plans of a Polya dependent process are examined and the characteristics are compared according to the change of the dependency factor.

• Proceedings of the KIPE Conference
• /
• 2013.07a
• /
• pp.244-245
• /
• 2013

This paper proposes a control algorithm for permanent magnet synchronous generator with a back-to-back three-level neutral-point clamped voltage source converter in a medium-voltage offshore wind power system under unbalanced grid conditions. The proposed control algorithm particularly compensates for the unbalanced grid voltage at the point of common coupling in a collector bus of offshore wind power system. This control algorithm has been formulated based on the symmetrical components in positive and negative rotating synchronous reference frames under generalized unbalanced operating conditions. Instantaneous active and reactive power are described in terms of symmetrical components of measured grid input voltages and currents. Negative sequential component of ac input current is injected to the point of common coupling in the proposed control strategy. The amplitude of negative sequential component is calculated to minimize the negative sequential component of grid voltage under the limitation of current capability in a voltage source converter. The proposed control algorithm makes it possible to provide a balanced voltage at the point of common coupling resulting in the generated power of high quality from offshore wind power system under unbalanced network conditions.