• 한국해안해양공학회지
• /
• 제12권2호
• /
• pp.81-86
• /
• 2000

설치수힙이 점차 깊어짐에 따라 해양구조물들의 형상비가 세장해지므로 이에 대한 동적해석이 더욱 중요하다. 해양구조물중에는 프레임구조로 된 것이 많은데 이들의 자유도수가 많아 동적해석에 있어서 많은 계산시간과 컴퓨터 용량이 필요하다. 본 논문에서는 프레임 구조물의 자유도수를 현저히 감소시킬 수 있는 보치환법을 개발하는 이롼으로 동적해석을 수행할 때에 필요한 3차원 등가 유체력계수들을 산정하는 방법을 제시하였다 이 방법을 검증하기 위하여 2가지 모델 예를 사용하였으며 보치환기법에 의한 등가 보의 해석결과와 상용해석 프로그램인 ANSYS과 SACS에 의한 프레임 구조의 해석결과는 아주 만족스럽게 일치하였다.

• 대한수학회지
• /
• 제58권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
• /
• 제33권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.

• 한국통신학회논문지
• /
• 제31권4C호
• /
• pp.434-440
• /
• 2006

본 논문에서는 단항순열행렬에 의해 구성된 다양한 비실베스터 하다마드 행렬의 고유치가 유도 되었고 이는, 새로 구성한 행렬과 실베스트 하다마드 행렬의 고유치와의 연관성을 보여준다.

• Journal of applied mathematics & informatics
• /
• 제13권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.

• 대한수학회논문집
• /
• 제14권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
• /
• 제46권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)
• /
• 제15권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.

• 한국정보처리학회논문지
• /
• 제4권7호
• /
• pp.1842-1850
• /
• 1997

이 논문은 멀티스테이지 역 셔플익스체인지 네트워크에서 하나의 새로운 재정돈 알고리즘을 제안한다. 대칭성 멀티스테이지에 있어서 재정동성을 위한 가장 잘 알려진 스테이지의 최저 경계는 2logN-1이다. 그러나, 지금까지 비대칭성 멀티 스테이지에 있어서 재정돈성이 증명된 사실은 없다. 현재, 비대칭성 멀티스테이지에 있어서 재정돈성에 있어서 최상의 경계는 3logN-3이다. 따라서, 이 논문에서 모든 임의의 $N{\le}16$인 퍼뮤테이션에 대하여 멀티스테이지 역 셔플익스체인지 인터커넥션 네트워크의 재정돈성을 설정한다. 이러한 재정돈성은 일련의 재정돈 가능한 네트워크에 있어서 위상적 동일성을 유지하고 중간 스테이지에 하나의 스테이지를 첨가하여 그 스위치를 제안된 알고리즘을 적용하여 결정함으로서 전체적으로 감소된 크기의 네트워크를 허용하도록 설정한다. 결과적으로 이 논문은 역 셔플익스체인지 네트워크를 재정돈성에 있어서 $N{\le}16$의 경우 최상의 경계 2logN을 가능하게 하고, 입력의 수가 증가하는 N>16의 경우 가능성을 보여준다.