• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.12 no.2
• /
• pp.81-86
• /
• 2000

For on-shore structures, dynamic analysis becomes increasingly important as the water depth increases and the structural configuration becoines slenderer. In this study, an estimation method for equivalent three dimensional (30) hydrodynamic coefficients is introduced as a part of beam permutation technique development. The beam pemlUtation technique is being developed for obtaining an equivalent beam to a frame structure in order to reduce the degrees of freedom and thus the analysis time significantly. Two 3D structures are used in order to verify the obtained equivalent 3D hydrodynamic coefficients. Two commercial softwares, ANSYS and SACS, are used for the verification. The results of the present analysis are found to be satisfactory in comparison with those by the two softwares.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.219-236
• /
• 2021

Let �� be a weighted projective line defined over the algebraic closure $k={\bar{\mathbb{F}}}_q$ of the finite field ��q and σ be a weight permutation of ��. By folding the category coh-�� of coherent sheaves on �� in terms of the Frobenius twist functor induced by σ, we obtain an ��q-category, denoted by coh-(��, σ; q). We then prove that coh-(��, σ; q) is derived equivalent to the valued canonical algebra associated with (��, σ).

• Journal of the Korean Statistical Society
• /
• v.33 no.1
• /
• pp.79-97
• /
• 2004

We propose a permutation approach to the classic Behrens-Fisher problem of comparing two means in the presence of unequal variances. It is motivated by the observation that a paired test is valid whether or not the variances are equal. Rather than using a single arbitrary pairing of the data, we average over all possible pairings. We do this in both a parametric and nonparametric setting. When the sample sizes are equal, the parametric version is equivalent to referral of the unpaired t-statistic to a t-table with half the usual degrees of freedom. The derivation provides an interesting representation of the unpaired t-statistic in terms of all possible pairwise t-statistics. The nonparametric version uses the same idea of considering all different pairings of data from the two groups, but applies it to a permutation test setting. Each pairing gives rise to a permutation distribution obtained by relabeling treatment and control within pairs. The totality of different mean differences across all possible pairings and relabelings forms the null distribution upon which the p-value is based. The conservatism of this procedure diminishes as the disparity in variances increases, disappearing completely when the ratio of the smaller to larger variance approaches 0. The nonparametric procedure behaves increasingly like a paired t-test as the sample sizes increase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.434-440
• /
• 2006

In this paper, the eigenvalues of various non-Sylvester Hadamard matrices constructed by monomial permutation matrices are derived, which shows the relation between the eigenvalues of the newly constructed matrix and Sylvester Hadamard matrix.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.117-123
• /
• 2003

For an n ${\times}$ n real matrix X, let ${\Phi}$(X) = X o (X$\^$-1/)$\^$T/, where o stands for the Hadamard (entrywise) product. Suppose A, B, G and D are n ${\times}$ n real nonsingular matrices, and among them there are at least one solutions to the equation (equation omitted). An equivalent condition which enable (equation omitted) become a real solution ot the equation (equation omitted), is given. As application, we get new real solutions to the matrix equation (equation omitted) by applying the results of Zhang. Yang and Cao [SIAM.J.Matrix Anal.Appl, 21(1999), pp: 642-645] and Chen [SIAM.J.Matrix Anal.Appl, 22(2001), pp:965-970]. At the same time, all solutions of the matrix equation (equation omitted) are also given.

• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.311-318
• /
• 1999

Let A be an n$\times$n (0,1) matrix. Let f(A) denote the smallest nonnegative integer k such that per A[$\alpha$｜$\beta$]>0 and A($\alpha$｜$\beta$) is permutation equivalent to a lower triangular matrix for some $\alpha$, $\beta$$\in$Q\ulcorner,\ulcorner. In this case f(A) is called the feedback number of A. In this paper, feedback numbers of some maximal convertible (0,1) matrices are studied.

• Kyungpook Mathematical Journal
• /
• v.46 no.1
• /
• pp.89-96
• /
• 2006

For a rank-1 matrix A, there is a factorization as $A=ab^t$, the product of two vectors a and b. We characterize the linear operators that preserve rank and some equivalent condition of rank-1 matrices over a chain semiring. We also obtain a linear operator T preserves the rank of rank-1 matrices if and only if it is a form (P, Q, B)-operator with appropriate permutation matrices P and Q, and a matrix B with all nonzero entries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4122-4144
• /
• 2021

In this fast-paced technological world, the Internet of Things is a ground breaking technology which finds an immense role in the present electronic world which includes different embedded sensors, devices and most other things which are connected to the Internet. The IoT devices are designed in a way that it helps to collect various forms of data from varied sources and transmit them in digitalized form. In modern era of IoT technology data security is a trending issue which greatly affects the confidentiality of important information. Keeping the issue in mind a novel light encryption strategy known as LCB is designed for IoT devices for optimal security. LCB exploits the benefits of Feistel structure and the architectural benefits of substitution permutation network both to give more security. Moreover, this newly designed technique is tested on (Virtex-7) XC7VX330T FPGA board and it takes much little area of 224 GE (Gate Equivalent) and is extremely fast with very less combinational path delay of 0.877 ns. An in-depth screening confirms the proposed work to promise more security to counter cryptographic attacks. Lastly the Avalanche Effect (AE) of LCB showed as 63.125% and 63.875% when key and plaintext (PT) are taken into consideration respectively.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1842-1850
• /
• 1997

This paper proposes a new rearrangeable algorithm in multistage reverse shuffle/exchange network. The best known lower bound of stages for rearrangeability in symmetric network is 2logN-1 stages. However, it has never been proved for nonsymmetric networks before. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric network is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with $N{\le}16$. This rearrangeability can be established by setting one more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results in this paper enable us to establish an upper bound, 2logN stages for rearrangeable reverse shuffle/exchange network with $N{\le}16$, and leads to the possibility of this bound when $N{\le}16$.