• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.891-897
• /
• 2002

A symmetric minimal complement at infinity for a given symmetric Silvester data set in the complex plane is contructed.

• 한국미생물·생명공학회지
• /
• 제24권6호
• /
• pp.749-755
• /
• 1996

From the soil collected from provincial area of South Korea, a microorganisms which have been shown good growth in the minimal poultry feces extract medium was isolated. Supplement of glucose to the poultry feces extract medium helped the complete uptake of soluble protein by microorganism. Uric acid in the poultry feces extract medium could be completely degraded during the microbial growth. Maximum cell growth (3.8 $\times$ 10$^{9}$ CFU/ml) obtained at 36 hours of incubation after inoculation. Uric acid was degraded faster in minimal medium than in the glucose complement medium. VFA (volatile fatty acid), which are known as major compounds of poultry feces odor, were almost removed from the minimal poultry feces extract medium. Glucose supplement to the minimal medium enhanced the growth of microbial cells. Addition of 4% of glucose and 4% of neopeptone to the minimal poultry feces extract medium helped the maximal growth of cells.

• 대한수학회지
• /
• 제33권4호
• /
• pp.709-716
• /
• 1996

Nielsen coincidence theory is concerned with the determinatin of a lower bound of the minimal number MC[f,g] of coincidence points for all maps in the homotopy class of a given map (f,g) : X $\to$ Y. The Nielsen Nielsen number $N_R(f,g)$ (similar to [9]) is introduced in [3], which is a lower bound for the number of coincidence points in the relative homotopy class of (f,g) and $N_R(f,g) \geq N(f,g)$.

• 한국환경복원기술학회지
• /
• 제13권2호
• /
• pp.114-123
• /
• 2010

The Environmental Conservation Value Assessment Map (ECVAM) is a five grade assessment map created with nationally integrated environmental information and environmental values. The map is made through the evaluation of 67 items, including greenbelt area and bio-diversity. The ECVAM assesses the stability of the community using forest maps. However, the existing assessment method is problematic because the assessment grades are evaluated using higher than practical values; in part because it uses even-valued overlay and minimal indicator methods. This study was performed in order to suggest an integrated assessment method that could complement the stability evaluation based on existing methods. Accordingly, this study added forest type information, including whether the forest was natural or artificial, to the overlay method using forest diameter maps and forest density maps. As a result, the proposed ECVAM indicated a drastic grade change. After applying the method in South Korea, Grade I areas decreased 12.1%, from 52.6% to 40.6%, Grade II areas increased 11.9%, from 17.4% to 29.2%, and Grade III areas increased 0.2%, from 17.1% to 17.4%, respectively. From the results of the field survey, we found differences between natural forest and planted forest with regard to the number of mortality, species of shrubs, and vine cover. This means that natural forests are more stable than planted forests. This study suggests an improved assessment methodology to complement the existing EVCAM method. The results are expected to be used in environmental evaluations and forest conservation value assessments in ecology and environmental fields.

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

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권4호
• /
• pp.297-301
• /
• 2005

In this paper, we propose a method to estimate camera motion parameter based on invariant point features. Typically, feature information of image has drawbacks, it is variable to camera viewpoint, and therefore information quantity increases after time. The LM(Levenberg-Marquardt) method using nonlinear minimum square evaluation for camera extrinsic parameter estimation also has a weak point, which has different iteration number for approaching the minimal point according to the initial values and convergence time increases if the process run into a local minimum. In order to complement these shortfalls, we, first propose constructing feature models using invariant vector of geometry. Secondly, we propose a two-stage calculation method to improve accuracy and convergence by using homography and LM method. In the experiment, we compare and analyze the proposed method with existing method to demonstrate the superiority of the proposed algorithms.

• 대한수학회보
• /
• 제37권1호
• /
• pp.181-189
• /
• 2000

Let (X, J) be a closed, connected almost complex four-manifold. Let $X_1$ be the complement of an open disc in X and let ${\varepsilon}_1$be the contact structure on the boundary ${\varepsilon}X_1$ which is compatible with a symplectic structure on $X_1$, Then we show that (X, J) is symplectic if and only if the contact structure ${\varepsilon}_1$ on ${\varepsilon}X_1$ is isomorphic to the standard contact structure on the 3-sphere $S^3$ and ${\varepsilon}X_1$is J-concave. Also we show that there is a contact structure ${\varepsilon}_0\ on\ S^2\times\ S^1$which is not strongly symplectically fillable but symplectically fillable, and that $(S^2{\times}S^1,\;{\varepsilon})$ has infinitely many non-diffeomorphic minimal fillings whose restrictions on$\S^2\times\ S^1$are ${\sigma}$ where ${\sigma}$ is the restriction of the standard symplectic structure on $S^2{\times}D^2$.

• 한국전자통신학회논문지
• /
• 제11권3호
• /
• pp.293-302
• /
• 2016

본 논문에서는 전이규칙이 모두 102인 Uniform CA(Uniform Cellular Automata, UCA) $\mathbb{C}_u$와 특성다항식이 $(x+1)^m$인 m-셀 90/150 hybrid CA $\mathbb{C}_h$를 합성한 CA의 특성을 분석한다. 먼저 $\mathbb{C}_u$로부터 유도된 여원 그룹 CA의 사이클 구조를 분석하고 이를 통해 모든 사이클의 길이가 같아지는 여원 CA의 조건을 제시한다. 그리고 $\mathbb{C}_u$와 $\mathbb{C}_h$를 합성한 CA $\mathbb{C}$의 최소다항식이 $(x+1)^q$일 때 $(T+I)^{q-1}F{\neq}0$을 만족하는 F를 여원벡터로 택하여 구성한 여원 그룹 CA $\mathbb{C}^{\prime}$의 사이클 구조를 분석한다.

• 한국정보전자통신기술학회논문지
• /
• 제2권1호
• /
• pp.37-42
• /
• 2009

디지털 신호 처리 분야에서 디지털 필터는 필수불가결한 요소이다. 디지털 필터는 이진수의 곱셈 및 덧셈을 기본으로 하는 것으로 많은 연산량을 필요로 한다. 디지털 필터 내의 곱셈기는 VLSI 기술을 이용한 디지털 필터의 설계에 있어 반도체 칩 내부의 넓은 영역을 차지하고 전력의 대부분을 소비하며, 필터의 critical path를 결정하여 필터의 성능을 결정하는 중요한 요소로서 작용 한다. 본 연구에서는 특히 디지털 필터의 복잡성(complexity)를 해소하고 critical path를 줄여 필터의 연산속도를 증가시키기 위한 방법으로 2의 보수로서 표현되는 이진수를 CSD(canonical signed digit)와 MSD(minimal signed digit)로 동시에 변환하여 표현하는 방법을 제안하였다. 제안된 방법은 VHDL로 구현하고 임의의 필터에 적용하여 필터의 critical path가 감소하는 것을 보였다.