• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

• Animal cells and systems
• /
• v.5 no.3
• /
• pp.199-203
• /
• 2001

Sperminogen was purified from the acid extracts of boar spermatozoa and partial peptide sequence of the 34-36 kd sperminogen was determined. Acid extracts of boar spermatozoa was gel-filtered through Sephadex G-75, and the 34-36 kd sperminogen was purified by preparative SDS-PAGE. The sperminogen bands were sliced out, and 34-36 kd sperminogen were eluted from the gel fragments and was subjected to peptide sequencing. Since the amino termini were blocked for Edman degradation method, internal amino acid sequences of the eluted 34-36 kd sperminogen were obtained from CNBr-digested peptides of sperminogen. Among several bands resolved on tricine SDS-PAGE, 14, 22 and 26 kd peptides were subjected to peptide sequencing. The ana1yzed amino acid sequences of the 26 and 22 kd peptides showed high homologies with that of the zona pellucida binding protein, Sp38, and the analyzed amino acid sequence of the 14 kd peptide showed neither sequence homology nor similarity with any known proteins.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.7 s.196
• /
• pp.39-48
• /
• 2007

This paper presents a method of a line balanced assembly sequence generation based on the verification of a disassemblability and a work time. To derive the disassemblability for a part to be disassembled, first we inference collision free assembly directions by extracting separable directions fur the part. And we determine the disassemblability defined by the separability and stability cost. The separability cost represents a facility of the part disassembly operation, and the stability cost which represents a degree of the stability for the base assembly motion. Based upon the results, we propose a new approach of evaluating work time using neural networks. The proposed assembly sequence generation provides an effective means of solving the line balancing problem and gives a design guidance of planning assembly lay-out in flexible manufacturing application. Example study is given to illustrate the concepts and procedure of the proposed schemes.

• 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.

• Structural Engineering and Mechanics
• /
• v.77 no.2
• /
• pp.245-259
• /
• 2021

In this research, the influence of the laminate stacking sequence on thermal stress distribution in symmetric composite plates with a quasi-square cutout subjected to uniform heat flux is examined analytically using the complex variable technique. The analytical solution is obtained based on the thermo-elastic theory and the Lekhnitskii's method. Furthermore, by employing a suitable mapping function, the solution of symmetric laminates containing a circular cutout is extended to the quasi-square cutout. The effect of important parameters including the stacking sequence of laminates, the angular position, the bluntness, the aspect ratio of cutout, the flux angle and the composite material are examined on the thermal stress distribution. It is found out that the circular shape for cutout may not necessarily be the optimum geometry for all stacking sequences. The finite element analysis results are used to validate the analytical solution.

• Journal of Information Technology Applications and Management
• /
• v.27 no.1
• /
• pp.49-58
• /
• 2020

Lately, a large amount of textual data have been poured out of the Internet and the technology to refine them is needed. Most of these data are long text and often have no title. Therefore, in this paper, we propose a technique to combine the sequence-to-sequence model of RNN and the REINFORCE algorithm to generate the title of the long text automatically. In addition, the TextRank algorithm was applied to extract a summarized text to minimize information loss in order to protect the shortcomings of the sequence-to-sequence model in which an information is lost when long texts are used. Through the experiment, the techniques proposed in this study are shown to be superior to the existing ones.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.714-718
• /
• 2009

3D reconstruction of a human face from an image sequence remains an important problem in computer vision. We propose a method, based on a factorization algorithm, that reconstructs a 3D face model from short image sequences exhibiting rotational motion. Factorization algorithms can recover structure and motion simultaneously from one image sequence, but they usually require that all feature points be well tracked. Under rotational motion, however, feature tracking often fails due to occlusion and frame out of features. Additionally, the paucity of images may make feature tracking more difficult or decrease reconstruction accuracy. The proposed 3D reconstruction approach can handle short image sequences exhibiting rotational motion wherein feature points are likely to be missing. We implement the proposal as a reconstruction method; it employs image sequence division and a feature tracking method that uses Active Appearance Models to avoid the failure of feature tracking. Experiments conducted on an image sequence of a human face demonstrate the effectiveness of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.5
• /
• pp.6-11
• /
• 1975

반복형 그래이 부호 중 14진 및 16진 부호용 디지트 절차(digit sequence 또는 DS)의 여러가지 특성에 관하여 논하였으며 그것들을 통일적으로 기적할 수 있는 PDS는 각각 31종 및 11종이 있다는 것을 명백히 하였다. 그리고 이 PDS들에 회전변환과 순렬변환을 실시하여 얻을 수 있는 DS의 총수와 각종 특수 DS의 성질에 관하여도 논하였으며 대칭형 DS를 이용한 14진 및 16진 GC Counter를 설계하여 그것들의 동작을 실험에 의하여 확인하였다. Investigations on some characteristics of Tetra-Decimal and Hexa-Decimal recycling Gray co de (GC)-digit sequence(DS) are carried out, and, 31 and 11 kinds of prime digit sequence(PDS) are proposed respectively. From these PDS, by means of rotational conversion and permutational conversion, the numbers of all DS are obtained, and also the characteristics of some special DS are studied. Tetra Decimal and Hexa-decimal GC counters are designed using symmetrical DS, and, their operations are experimentally verified.

• School Mathematics
• /
• v.2 no.1
• /
• pp.111-144
• /
• 2000

The purpose of this study is to develop instruction sequence and teaching units for secondary school geometry using dynamic computer software like CabriII, GSP, Wingeom, Poly. For this purpose, literature was reviewed on various issues of geometry education and geometry curriculum using dynamic software. By the literature review, instructional sequence for teaching geometry in middle schools was designed. And, based on the newly developed instructional sequence, one sample teaching unit was developed. The basic principles for the development were to connect intuition geometry and formal geometry, and to emphasize students' investigative experience. Finally, experiment to check out teachers' response to the newly developed material was conducted by using questionnaire.