• ETRI Journal
• /
• 제20권4호
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• 한국정보처리학회논문지
• /
• 제5권11호
• /
• pp.2823-2834
• /
• 1998

본 논문에서는 병렬 프로그램을 구성하는 $2^n$개의 타스크 모듈들을 n-차원 하이퍼큐브 다중 컴퓨터에 전체 통신 비용이 최소가 되도록 일대일 매핑하는 문제를 다룬다. 하이퍼큐브에서 최적 매핑을 구한 것은 NP-complete문제이다. 본 논문에서는 먼저 하이퍼큐브 다중 컴퓨터에서의 매핑 문제를 그래프 상에서의 최대 컷세트 집합을 구하는 문제로 변환시키는 그래프 변형 기법을 제안한다. 이러한 그래프 변형 기법을 사용하여 기존의 그래프 이분할 방법을 변형된 그래프 상에 반복 적용함으로써 하이퍼큐브에 타스크 모듈들을 효율적으로 일대일 매핑하는 반복 매핑 알고리즘을 제안한다. 여러가지 타스크그래프 상에서의 실험을 통해, 제안된 반복 매핑 알고리즘이 기존의 greedy나 recursive 매핑 알고리즘들 보다 성능이 우수함을 보인다. 특히 제안된 알고리즘은 하이퍼큐브-isomorphic, 메쉬등과 같은 정형 그래프 상에서 성능이 우수하며 거의 모든 정형 그래프에서 최적 매핑을 찾음을 보인다.

• Journal of information and communication convergence engineering
• /
• 제15권2호
• /
• pp.97-103
• /
• 2017

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

• 대한수학회보
• /
• 제22권2호
• /
• pp.121-126
• /
• 1985

D.K. Harrison [5] has shown that if R and S are fields of characteristic different from 2, then two Witt rings W(R) and W(S) are isomorphic if and only if W(R)/I(R)$^{3}$ and W(S)/I(S)$^{3}$ are isomorphic where I(R) and I(S) denote the fundamental ideals of W(R) and W(S) respectively. In [1], J.K. Arason and A. Pfister proved a corresponding result when the characteristics of R and S are 2, and, in [9], K.I. Mandelberg proved the result when R and S are commutative semi-local rings having 2 a unit. In this paper, we prove the result when R and S are 2-fold full rings. Throughout this paper, unless otherwise specified, we assume that R is a commutative ring having 2 a unit. A quadratic space (V, B, .phi.) over R is a finitely generated projective R-module V with a symmetric bilinear mapping B: V*V.rarw.R which is nondegenerate (i.e., the natural mapping V.rarw.Ho $m_{R}$ (V, R) induced by B is an isomorphism), and with a quadratic mapping .phi.:V.rarw.R such that B(x,y)=(.phi.(x+y)-.phi.(x)-.phi.(y))/2 and .phi.(rx)= $r^{2}$.phi.(x) for all x, y in V and r in R. We denote the group of multiplicative units of R by U(R). If (V, B, .phi.) is a free rank n quadratic space over R with an orthogonal basis { $x_{1}$, .., $x_{n}$}, we will write < $a_{1}$,.., $a_{n}$> for (V, B, .phi.) where the $a_{i}$=.phi.( $x_{i}$) are in U(R), and denote the space by the table [ $a_{ij}$ ] where $a_{ij}$ =B( $x_{i}$, $x_{j}$). In the case n=2 and B( $x_{1}$, $x_{2}$)=1/2, we reserve the notation [ $a_{11}$, $a_{22}$] for the space.the space.e.e.e.

• 충청수학회지
• /
• 제26권1호
• /
• pp.91-103
• /
• 2013

Let (D,B) be an admissible pair. Then recall that $B\;{\times}^L_HD^{{\rightarrow}{\pi}_D}_{{\leftarrow}i_D}\;D$ are bialgebra maps satisfying ${\pi}_D{\circ}i_D=I$. We have solved a converse in case D is a Hopf algebra. Let D be a Hopf algebra with antipode $S_D$ and be a left H-comodule algebra and a left H-module coalgebra over a field $k$. Let A be a bialgebra over $k$. Suppose $A^{{\rightarrow}{\pi}}_{{\leftarrow}i}D$ are bialgebra maps satisfying ${\pi}{\circ}i=I_D$. Set ${\Pi}=I_D*(i{\circ}s_D{\circ}{\pi}),B=\Pi(A)$ and $j:B{\rightarrow}A$ be the inclusion. Suppose that ${\Pi}$ is an algebra map. We show that (D,B) is an admissible pair and $B^{\leftarrow{\Pi}}_{\rightarrow{j}}A^{\rightarrow{\pi}}_{\leftarrow{i}}D$ is an admissible mapping system and that the generalized biproduct bialgebra $B{\times}^L_HD$ is isomorphic to A as bialgebras.

• 충청수학회지
• /
• 제32권1호
• /
• pp.15-21
• /
• 2019

Let X be a reduced closed subscheme in ${\mathbb{P}}^n$ and $${\pi}_q:X{\rightarrow}Y={\pi}_q(X){\subset}{\mathbb{P}}^{n-1}$$ be an isomorphic projection from the center $q{\in}{\mathbb{P}}^n{\backslash}X$. Suppose that the minimal free presentation of $I_X$ is of the following form $$R(-3)^{{\beta}2,1}{\oplus}R(-4){\rightarrow}R(-2)^{{\beta}1,1}{\rightarrow}I_X{\rightarrow}0$$. In this paper, we prove that $H^1(I_X(k))=H^1(I_Y(k))$ for all $k{\geq}3$. This implies that Y is k-normal if and only if X is k-normal for $k{\geq}3$. Moreover, we also prove that reg(Y) ${\leq}$ max{reg(X), 4} and that $I_Y$ is generated by homogeneous polynomials of degree ${\leq}4$.

• Kyungpook Mathematical Journal
• /
• 제63권1호
• /
• pp.131-139
• /
• 2023

Let V_k,n (ℂ) denote the complex Steifel and Gr_k,n (ℂ) the Grassmann manifolds for 1 ≤ k < n. In this paper, we compute, in terms of the Sullivan minimal models, the evaluation subgroups and, more generally, the relative evaluation subgroups of the fibration p : V_k,k+n (ℂ) → Gr_k,k+n (ℂ). In particular, we prove that G_* (Gr_k,k+n (ℂ), V_k,k+n (ℂ) ; p) is isomorphic to G^rel_* (Gr_k,k+n (ℂ), V_k,k+n (ℂ) ; p) ⊕ G_* (V_k,k+n (ℂ)).

• 지능정보연구
• /
• 제7권1호
• /
• pp.135-147
• /
• 2001

본 연구에서는 퍼지신경망을 이용한 기업부실예측모형을 제안한다. 신경망은 탁월한 학습능력을 가진 것으로 알려져 있으나, 잡음이 심한 재무자료에 대해서는 종종 일관되지 못하고 기대에 미치지 못하는 예측성과를 보인다. 이는 연속형의 형태를 지닌 독립변수와 과다한 양의 원자료로부터 예측에 필요한 일정한 패턴을 찾기가 어렵기 때문이다. 이러한 문제점은 예측모형에서의 독립변수와 종속변수간의 인과관계를 신경망이 용이하게 찾아낼 수 있도록 독립변수의 형태를 변환함으로써 해결한 수 있다. 이러한 해결방법의 하나는 기존 신경망에 퍼지집합의 개념을 적용하여 신경망 학습에 사용될 자료를 퍼지화하고 이를 신경망에 학습시키는 것이다 입력자료를 퍼지화 함으로써 정보의 손실 없이도 신경망이 자료 내의 복잡한 관계를 용이하게 학습하는 것이 가능하다. 본 연구에서 제안된 퍼지신경망을 기업부도예측에 적용한 결과, 퍼지신경망이 기존의 신경망보다 우월한 예측성과를 나타내었다.