• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of information and communication convergence engineering
• /
• v.13 no.4
• /
• pp.241-247
• /
• 2015

Cognitive radio has been attracting increased attention as an effective approach to improving spectrum efficiency. One component of cognitive radio, spectrum sensing, has an important relationship with the performance of cognitive radio. In this paper, after a summary and analysis of the existing spectrum-sensing algorithms, we report that the existing eigenvalue-based semi-blind detection algorithm and blind detection algorithm have not made full use of the eigenvalues of the received signals. Applying multi-antenna systems to cognitive users, we design a variety of spectrum-sensing algorithms based on the joint distribution of the eigenvalues of the received signal. Simulation results validate that the proposed algorithms in this paper are able to detect whether the signal of the primary user exists or not with high probability of detection in an environment with a low signal-to-noise ratio. Compared with traditional algorithms, the new algorithms have the advantages of high detection performance and strong robustness

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.77-92
• /
• 2005

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.2
• /
• pp.109-117
• /
• 2004

Optimization has been successfully applied to systems with a single discipline. As many disciplines are involved in coupled fashion, MDO (multidisciplinary design optimization) technology has been developed. MDO algorithms are trying to solve the coupled aspects generated from interdisciplinary relationship. In a general MDO algorithms, a large design problem is decomposed into small ones which can be easily solved. Although various methods have been proposed for MDO, the research is still in the early stage. This research proposes a new MDO method which is named as MDOIS (Multidisciplinary Design Optimization Based on Independent Subspaces). Many real engineering problems consist of physically separate components and they can be independently designed. The inter-relationship occurs through coupled physics. MDOIS is developed for such problems. In MDOIS, a large system is decomposed into small subsystems. The coupled aspects are solved via system analysis which solves the coupled physics. The algorithm is mathematically validated by showing that the solution satisfies the Karush-Kuhn-Tucker condition.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.30 no.2
• /
• pp.67-81
• /
• 1988

The purpose of the present study is to set up an efficient optimum design method for the large-scale reinforced concrete cylindrical shell structures like intake tower of reservoir and to establish a solid foundation for the automatic optimum structural design combined with finite element analysis. The major design variables are the dimensions and steel areas of each member of the structures. The construction cost which is composed of the concrete, steel, and form work costs, respectively, is taken as the objective function. The constraint equations for the design of intake-tower are derived on the basis of the working stress design method. The corresponding design guides including the standard specification for concrete structures have been also employed in deraving the constraint conditions. The present nonlinear optimization problem is solved by SUMT method. The reinforced concrete intake-tower is decomposed into three major substructures. The optimization is then conducted for both the whole structure and the substructures. The following conclusions can be drawn from the present study. 1. The basis of automatic optimum design of reinforced concrete cylindrical shell structures which is combined with finite element analysis was established. 2. The efficient optimization algorithms which can execute the automatic optimum desigh of reinforced concrete intake-tower based on the working stress design method were developed. 3. Since the objective function and design variables were converged to their optimum values within the first or second iteration, the optImization algorithms developed in this study seem to be efficient and stable. 4. The difference in construction cost between the optimum designs with the substructures and with the entire structure was found to be small and thus the optimum design with the substructures,rnay conveniently be used in practical design. 5. The major active constraints of each structural member were found to be the tensile stress insteel for salb, the minimum lonitudinal steel ratio constraints for tower body and the shearing stress in concrete, tensile stress in steel and maximum eccentricityconstraints for footing, respectively. 6. The computer program develope in the present study can be effectively used even by an unexperienced designer for the optimum design of reinforced concrete intake-tower.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2002.10a
• /
• pp.233-236
• /
• 2002

An efficient method was developed in this study to obtain optimal stacking sequences, thicknesses, and minimum weights of stiffened laminated composite shells under combined loading conditions and stiffener layouts using genetic algorithms (GAs) and finite element analyses. Among many parameters in designing composite laminates determining a optimal stacking sequence that may be formulated as an integer programming problem is a primary concern. Of many optimization algorithms, GAs are powerful methodology for the problem with discrete variables. In this paper the optimal stacking sequence was determined, which gives the maximum critical buckling load factor and the minimum weight as well. To solve this problem, both the finite element analysis by ABAQUS and the GA-based optimization procedure have been implemented together with an interface code. Throughout many parametric studies using this analysis tool, the influences of stiffener sizes and three different types of stiffener layouts on the stacking sequence changes were throughly investigated subjected to various combined loading conditions.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.9-15
• /
• 2011

In this paper, we design and implement of gate management system by face recognition using smart phone. We investigate various algorithms for face recognition on smart phones. First step in any face recognition system is face detection. We investigated algorithms like color segmentation, template matching etc. for face detection, and Eigen & Fisher face for face recognition. The algorithms have been first profiled in MATLAB and then implemented on the Android phone. While implementing the algorithms, we made a tradeoff between accuracy and computational complexity of the algorithm mainly because we are implementing the face recognition system on a smart phone with limited hardware capabilities.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.7 no.8
• /
• pp.208-215
• /
• 1999

Using the orthogonal arrays and the occupant analysis software based on the multi-body dynamics , two interactive design algorithms are proposed to improve the initial design of the occupant protection systems. Algorithm 1 sequentially moves the narrow design space within the upper and the lower design limit. Algorithm 2 sequentially reduces the relatively wide design space. Each design algorithm is composed of two levels . The first level is to improve the characteristics of the crash performance considering the noise factors. In order to obtain the robust design, the second level reduces the variations the noise factors. In order to obtain the robust design, the second level reduces the variations due to the tolerance of the design variable. To utilize the algorithm 1, HIC(Head Injury Criterion) , 3 msec criterion value of the chest acceleration and the femur load decreased by 27.4%, 10.4% and 55.8%, respectively. To utilizer the algorithm 2 , the results decreased by 38.0%, 10.5% and 3.0% , respectively.

• Nuclear Engineering and Technology
• /
• v.48 no.2
• /
• pp.404-418
• /
• 2016

This paper presents a documentation and development method to facilitate the certification of scientific computing software used in the safety analysis of nuclear facilities. To study the problems faced during quality assurance and certification activities, a case study was performed on legacy software used for thermal analysis of a fuelpin in a nuclear reactor. Although no errors were uncovered in the code, 27 issues of incompleteness and inconsistency were found with the documentation. This work proposes that software documentation follow a rational process, which includes a software requirements specification following a template that is reusable, maintainable, and understandable. To develop the design and implementation, this paper suggests literate programming as an alternative to traditional structured programming. Literate programming allows for documenting of numerical algorithms and code together in what is termed the literate programmer's manual. This manual is developed with explicit traceability to the software requirements specification. The traceability between the theory, numerical algorithms, and implementation facilitates achieving completeness and consistency, as well as simplifies the process of verification and the associated certification.