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

Computer-Generated Hologram (CGH) is generally made by Fourier Transform. CGH is made by an optical reconstruction. Computer-Generated Pseudo Hologram (CGPH) is made up Complex Hadamard Transform instead of CGH which is made by the Fourier Transform. CGPH differs from CGH in point of view the possibility of optical reconstruction. There is an advantage that it cannot be optical reconstruction, in other word, physical leakage of the confidential information is impossible. In this paper, a binary image was converted in Complex Hadamard Transform, and CGPH was made. Improvement of the reconstructed image from CGPH is done by error diffusion method and iterative method. The result that the reconstructed image is improved is shown.

• Kyungpook Mathematical Journal
• /
• v.57 no.4
• /
• pp.641-649
• /
• 2017

For partitioned matrices, the Khatri-Rao product is viewed as a generalized Hadamard product. In this paper we present Oppenheim's and Schur's determinantal inequalities for the Khatri-Rao product of two positive semidefinite matrices.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.575-584
• /
• 1996

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.673-683
• /
• 2009

We point out: to make Hermtian matrices A and B satisfy Styan matrix inequality, the condition "positive definite property" demanded in the present literatures is not necessary. Furthermore, on the premise of abandoning positive definite property, we derive Styan matrix inequality of Hadamard product for inverse Hermitian matrices and the sufficient and necessary conditions that the equation holds in our paper.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1625-1647
• /
• 2014

By making use of the familiar concept of neighborhoods of analytic functions, we prove several inclusion relationships associated with the (n, ${\delta}$)-neighborhoods of certain subclasses of p-valent analytic functions of complex order with missing coefficients, which are introduced here by means of the Saitoh operator. Special cases of some of the results obtained here are shown to yield known results.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.103-114
• /
• 1997

The asymptotic Dirichlet problem for harmonic functions on a noncompact complete Riemannian manifold has a long history. It is to find the harmonic function satisfying the given Dirichlet boundary condition at infinity. By now, it is well understood [A, AS, Ch, S], when M is a Cartan-Hadamard manifold with sectional curvature $-b^2 \leq K_M \leq -a^2 < 0$. (By a Cartan-Hadamard manifold, we mean a complete simply connected manifold of non-positive sectional curvature.)

• Polymer(Korea)
• /
• v.25 no.4
• /
• pp.536-544
• /
• 2001

We investigate, in the viewpoint of mathematical stability, the validity of the time-strain separability hypothesis employed in polymer viscoelasticity on the basis of experimental results. There have been suggested two distinct stability criteria such as Hadamard related to quick response and dissipative stability conditions, and in the limit of high deformation rate we have proved that separable constitutive equations are either Hadamard or dissipative unstable. The fact that the separability is not valid in the short time region in stress relaxation experiments exactly coincides with the results of our analysis. Therefore, since the application of the separability hypothesis incurs thermodynamic inconsistency as well as mathematical instability, such application should be avoided in the formulation of constitutive equations. In addition, careful attention should be paid to the limit of its validity even in experiments. It is also proved that there is neither theoretical nor physical validity of using the damping function.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.535-543
• /
• 1997

The application of Hadamard matrix to the paral-lel routings on the hypercube network was presented by Rabin. In this matrix every two rows differ from each other by exactly n/2 positions. A set of n disjoint paths on n-dimensional hypercube net-work was designed using this peculiar property of Hadamard ma-trix. Then the data is dispersed into n packets and these n packet are transmitted along these n disjoint paths. In this paper Rabin's routing algorithm is analyzed in terms of covering problem and as-signment problem. Finally we conclude that n packets dispersed are placed in well-distributed positions during transmisson and the ran-domly selected paths are almost a set of n edge-disjoint paths with high probability.

• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.61-71
• /
• 2020

Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

• The Journal of Information Technology
• /
• v.7 no.2
• /
• pp.43-54
• /
• 2004

Since Dr. John J. Hopfield has proposed the HOpfield network, it has been widely applied to the pattern recognition and the routing optimization. The method of Jian-Hua Li improved efficiency of Hopfield network which input pattern's weights are regenerated by SVD(singluar value decomposition). This paper deals with Li's Hopfield Network by linear pre-processing. Linear pre-processing is used for increasing orthogonality of input pattern set. Two methods of pre-processing are used, Hadamard method and random method. In manner of success rate, radom method improves maximum 30 percent than the original and hadamard method improves maximum 15 percent. In manner of success time, random method decreases maximum 5 iterations and hadamard method decreases maximum 2.5 iterations.