• 대한수학회지
• /
• 제58권1호
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

• Kyungpook Mathematical Journal
• /
• 제56권4호
• /
• pp.1259-1265
• /
• 2016

In this paper, we introduce the notions of mean open and closed sets in topological spaces, and obtain some properties of such sets. We observe that proper paraopen and paraclosed sets are identical to mean open and closed sets respectively.

• 대한수학회논문집
• /
• 제19권2호
• /
• pp.329-336
• /
• 2004

In this paper, we study relationships between zero characteristic properties and minimality of orbit closures or limit sets of points. Also, we characterize the set of points of zero characteristic properties. We show that the set of points of positive zero characteristic property in a compact spaces X is the intersection of negatively invariant open subsets of X.

• 충청수학회지
• /
• 제12권1호
• /
• pp.103-111
• /
• 1999

In this paper, we introduce a generalized regular homomorphism as the extending notion of the regular homomorphism.

• 한국정보과학회논문지:정보통신
• /
• 제34권3호
• /
• pp.226-238
• /
• 2007

본 논문은 연결 지배 집합에 속하는 노드들로 애드혹 망의 위상을 구성하는 완전 분산형 위상 제어 프로토콜을 제시한다. 제안한 프로토콜은 가능한 최소의 노드 수로 위상을 구성할 수 있게 하여 패킷 전송 시 발생하는 간섭을 줄일 수 있다. 제안한 프로토콜의 알고리즘 복잡도는 O(1)이다. 각 노드는 분산된 병렬 볼츠만 기계의 한 노드로서 동작한다. 이 볼츠만 기계의 목적 함수를 연결의 차수와 연결 지배 정도를 표현하는 두 개의 볼츠만 인수로 구성한다. 이 볼츠만 인수들을 정의하기 위해 두 개의 퍼지 집합을 정의한다. 하나는 연결 지배 노드로 이루어진 퍼지 집합이며, 다른 하나는 다중-링 위상 구성이 가능한 노드로 이루어진 퍼지 집합이다. 제안한 프로토콜은 이 두 퍼지 집합의 강한 원소 노드들을 애드혹 망의 클러스터 헤드로 선택한다. 모의 실험을 통해 패킷 손실율과 에너지 소비율 측면에서 제안 프로토콜이 기존 방법에 비해 우수함을 확인하였다.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제25권1호
• /
• pp.1-5
• /
• 2018

It is proved that 'maximum' is actually attained in the following risk measure representation $${\rho}_m(X)={max \atop Q{\in}Q_m}E_Q[-X]$$.

• 한국안전학회지
• /
• 제36권4호
• /
• pp.12-19
• /
• 2021

This paper presents a safety assessment method for FTA-based induction heating systems; the failures and causes of electrical fire are first analyzed for each part and module qualitatively, and methods to manage high probabilities of failure and electrical fire are considered, thereby improving the reliability of the induction heating system. The cumulative importance value (ACC) of the minimal cut set is drawn by setting failure as the top event, and STACK and SMPS are observed to account for about 70% of the induction heating system failures. Thus, intensively managing the basic events contained in the minimal cut set of failures for STACK and SMPS is expected to provide effective and stable operation of the induction heating system. When electrical fire is set as the top event, the STACK percentage is 90%. Accordingly, the current IGBT is changed to a FET to increase the applied voltage and prevent induction heating system failure, and a heat sink plane is installed to prevent FET heating caused by switching, thereby preventing an electrical fire. By classifying the parts and modules of the induction heating system in detail and by applying FTA based on actual failure rates and relevant data, more practical and reasonable results may be expected. Hence, continuous research must be conducted to ensure safety when using induction heating systems.

• 한국통신학회논문지
• /
• 제13권5호
• /
• pp.379-389
• /
• 1988

본 논문에서는 통신방의 2-상태 스취칭 실패함수를 구하기 위한 알고리즘과 단섭간 신뢰도 계성방법을 제시하였다. 통신망을 그래프로 모형화하고, 이 그래프에 대한 일련의 행열변환을 함으로서 모든 통신통로를 차단하는 최초컷-\ulcornerV 행열을 구하였으며 최소 컷-\ulcornerV행열로부터 2-상태 스위칭 실패함수를 구하였다. 또한 2-상태 스위칭 실패함수에 확률변수를 대응시켜 통신망의 단점간 신뢰도를 계정하였다. 제안된 알고리즘을 설명하기 위하여 몇가지 예를 보였으며 복잡하고 규모가 큰 망에 대한 단점간 신뢰도를 계정하기 위해서 전산기 프로그램을 제시하였다.

• 대한수학회지
• /
• 제45권3호
• /
• pp.883-902
• /
• 2008

The main results concern with the self maps on the Klein bottle. We obtain the Reidemeister numbers and the Nielsen numbers for all self maps on the Klein bottle. In terms of the Nielsen numbers of their iterates, we totally determine the minimal sets of periods for all homotopy classes of self maps on the Klein bottle.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.264-267
• /
• 1991

In this paper, a new application method of the Kalman filter to desigin a gyro is proposed. The role of a gyro is the estimation of an input rate with minimal error covariance. The size of the error covariance depends on gyro's parameters, which makes it possible to use the parameters of gyro to minimze the estimation error covariance. Numerical analysis shows that the error covariance becomes smaller as the spin axis momentum becomes larger and the damping coefficient smaller, but production cost must be considered. Through numerical analysis the parameter set for an acceptable - performance gyro with small cost can be selected.