중국 농촌 토지재산권 제도변천에 관한 평가 및 시사점

"이혁구", "혜우군" 培材大學校 社會科學硏究所 2015 사회과학연구 Vol.37 No.1

본 연구에서는 중국 농촌 토지제도의 변천 과정을 살펴보고 각 시기별 토지재산권 제도 개혁이 중국의 농민, 농촌, 농업에 어떠한 영향을 미쳤는지 분석하였다. 중국 농촌 토지재산권의 제도변천의 요인은 경제주체가 잠재적 이윤의 최대화를 기대하는데 있다는 점이다. 중국의 농촌 토지 재산권 제도변천 과정은 농민이 경제적 이윤을 기대할 수 있는 방향으로 발전해왔고 끊임없이 외부효과를 내부화하는 과정에서 중국 농촌 토지재산권은 진화되었다. 현재 중국 농촌의 토지제도 개혁은 역사적으로 중요한 시기를 맞이하고 있다. 서로 다른 이익 주체 간 새로운 균형을 이루는 것이 개혁 성패의 관건이라고 할 수 있다. This study examines the transition process of the Chinese rural land system, and analyzed what rural land property rights system impact on farmers, rural economy, and agriculture production. Transitional factors of Chinese rural land property rights system is that the expectations of the economic agents to maximize their potential profit. Transition of rural land property rights system have developed in a way that China's farmers could been expected economic profit of land property rights, and constantly improving institutional development in the process of internalization of externality. Rural land reform is facing a historically important period in China. It could be said that is the success key to fit a balance between the different interests of players in the institutional transition.

The Autonomous Platoon Driving System of the On Line Electric Vehicle

Youjun Choi,Daejun Kang,Sunjong Lee,Youngmin Kim 제어로봇시스템학회 2009 제어로봇시스템학회 국제학술대회 논문집 Vol.2009 No.8

Since the reare traffic and environment problem in the downtown center, we suggestan autonomous platoon driving system based on infra structure to solve these problem. This paper considers three parts:1) Sensing electric magnetic field on the power supply line that is installed under the road to supply power to the electric vehicle wirelessly and controling steering motor and driving motor soft he electric vehicle for the auto nomous driving. 2) Laying RFID tag sunder the power supply line and estimating the position of the electric vehicle based on it. 3) Calculating a distance between electric vehicles based on each vehicle’s position information which is acquired from the vehicle to vehicle communiation and controlling the velocity of the electric vehicle to maintain the distance between the electric vehicles. Developed the autonomous platoon driving system is set on electric vehicles and is confirmed through analytical and experimental performance evalution.

EXPLICIT CALCULATION OF SOLUTION AND RECONSTRUCTION OF HEAT SOURCE ON LINEAR PARABOLIC EQUATION

Youjun Deng 한국산업응용수학회 2011 한국산업응용수학회 학술대회 논문집 Vol.6 No.2

Different divergence events for three pairs of PEBPs in Gossypium as implied by evolutionary analysis

Youjun Lu,Wei Chen,Lanjie Zhao,Jinbo Yao,Yan Li,Weijun Yang,Ziyang Liu,Yongshan Zhang,Jie Sun 한국유전학회 2019 Genes & Genomics Vol.41 No.4

Introduction The phosphatidylethanolamine-binding protein (PEBP) gene family plays a crucial role in seed germination, reproductive transformation, and other important developmental processes in plants, but its distribution in Gossypium genomes or species, evolutionary properties, and the fates of multiple duplicated genes remain unclear. Objectives The primary objectives of this study were to elucidate the distribution and characteristics of PEBP genes in Gossypium, as well as the evolutionary pattern of duplication and deletion, and functional differentiation of PEBPs in plants. Methods Using the PEBP protein sequences in Arabidopsis thaliana as queries, blast alignment was carried out for the identification of PEBP genes in four sequenced cotton species. Using the primers designed according to the PEBP genome sequences, PEBP genes were cloned from 15 representative genomes of Gossypium genus, and the gene structure, CDS sequence, protein sequence and properties were predicted and phylogenetic analysis was performed. Taking PEBP proteins of grape as reference, grouping of orthologous gene, analysis of phylogeny and divergence of PEBPs in nine species were conducted to reconstruct the evolutionary pattern of PEBP genes in plants. Results We identified and cloned 160 PEBPs from 15 cotton species, and the phylogenetic analysis showed that the genes could be classified into the following three subfamilies: MFT-like, FT-like and TFL1-like. There were eight single orthologous group (OG) members in each diploid and 16 double OG members in each tetraploid. An analysis of the expression and selective pressure indicated that expression divergence and strong purification selection within the same OG presented in the PEBP gene family. Conclusion An evolutionary pattern of duplication and deletion of the PEBP family in the evolutionary history of Gossypium was suggested, and three pairs of genes resulted from different whole-genome duplication events.

MULTIPLE SOLUTIONS FOR QUASILINEAR ELLIPTIC EQUATIONS WITH CRITICAL GROWTH

Youjun Wang 대한수학회 2011 대한수학회지 Vol.48 No.6

For a class of quasilinear elliptic equations we establish the existence of multiple solutions by variational methods.

An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

Youjun Xu 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.5

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve theefficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (ImprovedExtension Rule) is based on extension rule. The number of atoms and the number of clauses affect theefficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithmCIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLLrules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause setis got from these small clause sets’. A strategy MOAMD (maximum occurrences and maximum difference)for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. Thisarrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, thealgorithm CIER will be more efficient.

NUMERICAL METHODS FOR RECONSTRUCTION OF THE SOURCE TERM OF HEAT EQUATIONS FROM THE FINAL OVERDETERMINATION

Youjun Deng,Xiaoping Fang,Jing Li 대한수학회 2015 대한수학회보 Vol.52 No.5

This paper deals with the numerical methods for the reconstruction of the source term in a linear parabolic equation from final overdetermination. We assume that the source term has the form f(x)h(t) and h(t) is given, which guarantees the uniqueness of the inverse problem of determining the source term f(x) from final overdetermination. We present the regularization methods for reconstruction of the source term in the whole real line and with Neumann boundary conditions. Moreover, we show the connection of the solutions between the problem with Neumann boundary conditions and the problem with no boundary conditions (on the whole real line) by using the extension method. Numerical experiments are done for the inverse problem with the boundary conditions.

An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

Xu, Youjun Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.5

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

MULTIPLE SOLUTIONS FOR QUASILINEAR ELLIPTIC EQUATIONS WITH CRITICAL GROWTH

Wang, Youjun Korean Mathematical Society 2011 대한수학회지 Vol.48 No.6

For a class of quasilinear elliptic equations we establish the existence of multiple solutions by variational methods.

NUMERICAL METHODS FOR RECONSTRUCTION OF THE SOURCE TERM OF HEAT EQUATIONS FROM THE FINAL OVERDETERMINATION

DENG, YOUJUN,FANG, XIAOPING,LI, JING Korean Mathematical Society 2015 대한수학회보 Vol.52 No.5

This paper deals with the numerical methods for the reconstruction of the source term in a linear parabolic equation from final overdetermination. We assume that the source term has the form f(x)h(t) and h(t) is given, which guarantees the uniqueness of the inverse problem of determining the source term f(x) from final overdetermination. We present the regularization methods for reconstruction of the source term in the whole real line and with Neumann boundary conditions. Moreover, we show the connection of the solutions between the problem with Neumann boundary conditions and the problem with no boundary conditions (on the whole real line) by using the extension method. Numerical experiments are done for the inverse problem with the boundary conditions.