• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.2
• /
• pp.262-267
• /
• 2003

Error of the geometric series expansion method for the structural sensitivity analysis is estimated. Although the semi-analytic method has several advantages, accuracy of the method prevents it from practical application. One of the promising remedies is the use of geometric series formula for the matrix inversion. Its result of the sensitivity analysis converges that of the global difference method which is known as reliable one. To reduce computational efforts and to obtain reliable results, it is important to know how many terms need to expand. In this paper, the error formula is presented and Its usefulness is illustrated through numerical experiments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.1
• /
• pp.100-108
• /
• 2004

In this paper, the new casing oscillator, which is a construction machine and which structure is similar to that of a parallel manipulator with redundancy, is proposed. The singularity analysis of this machine is performed by two different methods. First, the singularities are found by the numerical method at configurations where the rank of the Jacobian matrix becomes deficient. The singularities are outside the workspace. To investigate the physical information on these configurations, the singularities are examined by the geometric method at configurations where the casing oscillator cannot resist the external forces and moments applied to the upper platform due to losing static equilibrium. The results of the geometric method are the same as those of the numerical method. It proves that the new casing oscillator is free from the singularity, which causes serious problems to a parallel manipulator.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.539-550
• /
• 2004

We consider communication or computer systems that have the average memory occupancy and congestion. A certain system may be reduced further if new processes are admitted only when the number of processes queued at the processor is below a certain threshold, run queue cutoff(RQ). We show that response time of a process is invariant with respect to RQ when processes do not communicate each other. The invariance property is considered with the evolution of the queue lengths as point processes and demonstrate it numerically using matrix-geometric methods. We illustrate the RQ invariance property.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1041-1046
• /
• 2009

In this paper, we proposed a robust watermark scheme for image based on SVD(Singular Value Transform) and Triplet. First, the original image is decomposed by using 3-level DWT, and then used the singular values changed for embedding and extracting of the watermark sequence in LL3 band. Since the matrix of singular values is not easily altered with various signal processing noises, the embedded watermark sequence has the ability to withstand various signal processing noise attacks. Nevertheless, this method does not guarantee geometric transformation(such as rotation, cropping, etc.) because the geometric transformation changes the matrix size. In this case, the watermark sequence cannot be extracted. To compensate for the above weaknesses, a method which uses the triplet for embedding a barcode image watermark in the middle of frequency band is proposed. In order to generate the barcode image watermark, the pattern of the watermark sequence embedded in a LL3 band is used. According to this method, the watermark information can be extracted from attacked images.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.2
• /
• pp.93-99
• /
• 2001

A new type geometric and mathematical network reduction model is introduced. Large-scale network is analyzed with analytic approach. The graph has many nodes, branches and loops. Circuit equation are obtained from these elements and connection rule. In this paper, the analytic relation between voltage source has a mutual different graphic property. Node-reduction procedure is achieved with this circuit property. Consequently voltage source value is included into the adjacent node-analyzing equation. A resultant model equations are reduced as much as voltage source number. Matrix rank is (n-1-k), where n, k is node and voltage source number. The reduction procedure is described and verified with geometric principle and circuit theory. Matrix type circuit equation can be composed with this technique. The last results shall be calculated by using computer.

• Communications of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.917-925
• /
• 2020

It has been shown that the geometric mean A#B of positive definite Hermitian matrices A and B is the maximal element X of Hermitian matrices such that $$\(\array{A&X\\X&B}\)$$ is positive semi-definite. As an extension of this result for the 2 × 2 block matrix, we consider in this article the block matrix [[A#w_ijB]] whose (i, j) block is given by the Riemannian geodesics of positive definite Hermitian matrices A and B, where w_ij ∈ ℝ for all 1 ≤ i, j ≤ m. Under certain assumption of the Loewner order for A and B, we establish the equivalent condition for the parameter matrix ω = [w_ij] such that the block matrix [[A#w_ijB]] is positive semi-definite.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.593-594
• /
• 2012

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.440-446
• /
• 2007

This paper addresses a new representation of DFT matrix via the Jacket transform based on the element inverse processing. We simply represent the inverse of the DFT matrix following on the factorization way of the Jacket transform, and the results show that the inverse of DFT matrix is only simply related to its sparse matrix and the permutations. The decomposed DFT matrix via Jacket matrix has a strong geometric structure that exhibits a block modulating property. This means that the DFT matrix decomposed via the Jacket matrix can be interpreted as a block modulating process.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2001.05a
• /
• pp.38-41
• /
• 2001

A new 2-D braided textile metal matrix composite was developed and characterized. The constituent materials consist of PAN type carbon fiber as reinforcements and pure aluminum as matrices. The braided preforms of different braider yarn angles were fabricated. For a fixed bundle size of 12K, three braider yarn angles was selected: $30^{\circ}$, $45^{\circ}$, and $60^{\circ}$. The braided preforms were infiltrated with pure Al by vacuum assisted squeeze casting. Through the investigation of melt pressing methods and the effects of process parameters such as applied pressure, and pouring temperature, the optimal process conditions were identified as follows: applied pressure of 60MPa, pouring temperature of $800^{\circ}C$. Using the measured geometric parameters, 3-D engineering constants of metal matrix composites have been determined from the elastic model, which utilizes the coordinate transformation and the averaging of stiffened and compliance constants based upon the volume of each reinforcement and matrix material.