• 지역연구
• /
• 제35권2호
• /
• pp.73-86
• /
• 2019

본 연구의 목적은 산업 및 직종의 상호연관적 다양성과 비연관적 다양성이 지역의 경제성장에 미치는 영향을 실증적으로 분석하는 데에 있다. 지역경제성장의 메커니즘을 다룬 최근의 연구들은 산업을 넘어 직종의 상호연관적 다양성과 비연관적 다양성이 지식외부효과를 유발함으로써 지역경제성장의 동력으로 작용한다고 주장한다. 이에 본 연구에서는 산업다양성과 함께 직종다양성의 영향을 포괄적으로 분석하였다. 실증분석을 위해서는 전국사업체조사와 인구주택총조사 자료를 사용하였으며 지역노동시장권을 분석의 공간적 단위로 설정하였다. 종속변수는 2010년부터 2015년 사이의 지역별 지역내총생산 및 고용 성장으로 설정하였으며 핵심 설명변수인 산업 및 직종의 상호연관적 다양성과 비연관적 다양성은 엔트로피 접근법에 기초하여 측정하였다. 분석결과에 따르면, 산업의 상호연관적 다양성은 지역의 1인당 지역내총생산 성장에, 직종의 상호연관적 다양성은 지역의 고용 성장에 긍정적인 영향을 미치는 것으로 나타났다. 반면 산업의 비연관적 다양성은 지역의 고용 성장에 부정적인 영향을 미치는 것으로 나타났다. 본 연구는 산업 및 직종 부문의 다양성을 상호연관적 다양성과 비연관적 다양성으로 세분하여 지역경제성장에 미치는 영향을 분석함으로써 지역의 경제적 활력 강화를 목적으로 하는 지역 단위의 정책의제에 대한 시사점을 이끌어내고자 하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• pp.187-190
• /
• 2001

In this paper, we present a novel digital watermarking technique based on the concept of multiresolution decomposition and Human Visual System(HVS). Proposed watermarking is to embed watermark by quantization, that is to construct ‘perceptually lossless’quantization matrix, by using a quantization factor for each level and orientation and variance within a band. We compare our approach with another wavelet domain watermarking methods. Simulation results show the superior performance of robustness for variety image distortions.

• 대한수학회지
• /
• 제35권2호
• /
• pp.371-386
• /
• 1998

Let G be a compact Lie group and M a semialgebraic G space in some orthogonal representation space of G. We prove that if G is finite then M has an equivariant semialgebraic triangulation. Moreover this triangulation is unique. When G is not finite we show that M has a semialgebraic G CW complex structure, and this structure is unique. As a consequence compact semialgebraic G space has an equivariant simple homotopy type.

• 대한수학회지
• /
• 제35권2호
• /
• pp.399-422
• /
• 1998

A useful method of proving the finite decidability of an equationally definable class V of algebras (i.e., variety) is to prove the decidability of the class of finite directly indecomposable members of V. The validity of this method relies on the well-known result of Feferman-Vaught: if a class K of first-order structures is decidable, then so is the class {$\prod$$_{i}$＜n/ $A_{i}$│ $A_{i}$ $\in$ X (i < n), n $\in$ $\omega$}. In this paper we show that the converse of this does not necessarily hold.d.d.

• 물과 미래
• /
• 제13권2호
• /
• pp.49-54
• /
• 1980

Meandering has been attributed to the earth's rotation, to the excessive slope and energy of a river, to changes in stage, etc. The purpose of this study is a geometrical approach of meander shape and to derive the relationship among meander characteristics. In the analysis of sime field examples, in spite of variety of meander shapes, the sine-generated curve was fit actual quite well and better than alternatives against the channel distance. An attempt is made to find considerable relation among meander characteristics. But width and meanderbelt did not show any defined trend considerable scatter of points was observed.

• 오토저널
• /
• 제7권3호
• /
• pp.83-93
• /
• 1985

The prediction of emission concentrations in a 4cycle spark ignition engine was made by considering nonuniform model with thermodynamics, chemical equilibrium and kinetic mechanism of nitric oxide. Calculation of this model shows that a temperature difference of the order of 500K can be established across he cylinder. Results of the kinetic calculation of nitric oxide show that the temperature gradient across the cylinder has a profound effect on the nitric oxide formation. The predicted values for nitric oxide, carbon dioxide and carbon monoxide agree with measured ones for a variety of equivalence ratio.

• 품질경영학회지
• /
• 제21권2호
• /
• pp.131-139
• /
• 1993

The newly proposed model of the future reliability results in earlier fault-fixes having a greater effect than the fault which make the greatest contribution to the overall failure rate tend to show themselves earlier, and so are fixed earlier. The suggested model allows a variety of reliability measures to be calculated. Predictions of total execution time(debugging time) is to achieve a target reliability. This model could also apply to computer-hardware reliability growth resulting from the elimination of design error and fault.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1993년도 추계학술대회 논문집
• /
• pp.450-455
• /
• 1993

Improvement of productivity becomes more and more important issue in today's industries due to the domestic and exterior requirements, but most of small to medium size companies can not positively be cope with such situation. Main reasons are considered to be the difficulties of assembly planning arising from the variety and sophistication of products and the lack of planning experiences. In this study it was intended to show how to establish assembly plans with individual planning functions required in a manufacturing company.

• 미생물과산업
• /
• 제16권3호
• /
• pp.6-14
• /
• 1990

PRDI DNA polymerase is the smallest member of the family B DNA polymerase (Jung et al., 1987). This DNA polyerase is specified by bacteriophage PRDI which infects a wide variety of gram-negative bacteria(Mindich and Bamford, 1988). Because PRDI is highly amenable to genetic and biochemical manipulation, it is a convenient model system with which to study structure-function relationships of DNA polymerase molecules. To determine the functional roles of the highly conserved regions of the family B DNA polymerases, we have initiated site-directed mutagenesis with PRD1 DNA polymerase, and our results show that mutations at the conserved regions within PRD1 DNA polymerase inactivate polymerase complementing activity and catalytic activity.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.