• Journal of information and communication convergence engineering
• /
• 제13권4호
• /
• pp.228-234
• /
• 2015

The system performance improvement in dispersion managed (DM) links combined with optical phase conjugator (OPC) for compensating for optical signal distortion due to group velocity dispersion and nonlinear fiber effects has been reported. However, in DM link combined OPC, the equalities of the lengths of single-mode fibers (SMFs), the length of dispersion compensating fibers (DCFs), the dispersion coefficient of DCF, and the residual dispersion per span (RDPS) with respect to an OPC restrict a flexible link configuration. Thus, in this paper, we propose a flexible optical link configuration with inequalities of link parameters, the so-called "pseudo-symmetric configuration." Simulation results show that, in the restricted RDPS range of 450 ps/nm to 800 ps/nm, the improvement in the system performance of the proposed pseudo-symmetrically configured optical links is better than that of the asymmetrically configured optical links. Consequently, we confirmed that the proposed pseudo-symmetric configuration is effective and useful for implementing a reconfigurable long-haul wavelength-division multiplexing (WDM) network.

• Kyungpook Mathematical Journal
• /
• 제50권2호
• /
• pp.195-211
• /
• 2010

Let A be a locally finite total algebra of finite type such that $k^A(a_1,\cdots,a_n)\;{\neq}\;a_i$ ai for every operation $k^A$, elements $a_1,\cdots,a_n$ an and $1\;\leq\;i\;\leq\;n$. We show that the weak subalgebra lattice of A uniquely determines its (strong) subalgebra lattice. More precisely, for any algebra B of the same finite type, if the weak subalgebra lattices of A and B are isomorphic, then their subalgebra lattices are also isomorphic. Moreover, B is also total and locally finite.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권1호
• /
• pp.27-39
• /
• 2008

최근 몇몇 연구들에서 지렛대 원리를 이용한 문제해결 방법이 소개되었다. 본 연구에서는 이들 연구를 바탕으로 지렛대 원리를 이용하여 삼각형의 각의 이등분선, 수선, 외심의 성질을 탐구하였으며, 삼각형의 각의 이등분선, 수선, 외심에 관련된 새로운 증명들, 명제들을 제시하였다. 이를 통해, 중등학교 수준의 수학 영재교육에서 활용 가능한 새로운 탐구자료를 제공할 수 있을 것으로 기대된다.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권4호
• /
• pp.545-556
• /
• 2008

삼각형은 가장 단순한 기하학적 도형이지만, 기하학 탐구에서 삼각형은 훌륭한 연구 대상이며 후속적인 기하학 연구의 중요한 도구라고 할 수 있다. 본 연구에서는 지렛대 원리를 이용하여 삼각형의 Gergonne 점과 Gergonne 점의 딸림점들의 존재성, Gergonne 점에 관련된 등식을 증명하였고, Gergonne 점의 딸림점들에 대한 새로운 등식을 증명하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.98-101
• /
• 2004

Linear Programming(LP) is the term used for defining a wide range of optimization problems in which the objective function to be minimized or maximized is linear in the unknown variables and the constraints are a combination of linear equalities and inequalities. LP problems occur in many real-life economic situations where profits are to be maximized or costs minimized with constraint limits on resources. While the simplex method introduced in a later reference can be used for hand solution of LP problems, computer use becomes necessary even for a small number of variables. Problems involving diet decisions, transportation, production and manufacturing, product mix, engineering limit analysis in design, airline scheduling, and so on are solved using computers. This technique is called Sequential Linear Programming (SLP). This paper describes LP's problems and solves a LP's problems using the neural networks.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제24권1호
• /
• pp.145-158
• /
• 2010

본 연구는 사면체의 내접구의 중심을 무게중심을 이용하여 탐구하는 연구로, 사면체의 각 꼭짓점에 일정한 무게를 놓으면 이들 질량점의 무게중심이 사면체의 내접구의 중심이 된다는 것을 제시하였고, 이를 바탕으로 사면체의 내접구의 중심에 관련된 계량적 성질인 등식, 부등식을 증명하였다. 본 연구의 결과는 중등학교 수준의 수학영재교육, R&E, 과제탐구의 자료로 활용될 수 있을 것으로 기대된다.

• ETRI Journal
• /
• 제9권1호
• /
• pp.84-96
• /
• 1987

The equality relation is very important in mechanical theorem proving procedures. A proposed inference rule called RHU-resolution is intended to extend the hyperparamodulation[23, 9] by introducing a bidirectional proof search that simultaneously employs a forward reasoning and a backward reasoning, and generalize it by incorporating beneflts of extended hyper steps with a preprocessing process, that includes a subsumption check in an equality graph and a high level planning. The forward reasoning in RHU-resolution may replace the role of the function substitution link.[9] That is, RHU-deduction without the function substitution link gets a proof. In order to control explosive generation of positive equalities by the forward reasoning, we haue put some restrictions on input clauses and k-pd links, and also have included a control strategy for a positive-positive linkage, like the set-of-support concept, A linking path between two end terms can be found by simple checking of linked unifiability using the concept of a linked unification. We tried to prevent redundant resolvents from generating by preprocessing using a subsumption check in the subsumption based eauality graph(SPD-Graph)so that the search space for possible RHU-resolution may be reduced.

• 대한수학회논문집
• /
• 제9권4호
• /
• pp.881-889
• /
• 1994

Let ($X, \Beta, \mu$) be a measure space with the $\sigma$-algebra $\Beta$ and the probability measure $\mu$. Throughouth this article set equalities and inclusions are understood as being so modulo measure zero sets. A transformation T defined on a probability space X is said to be measure preserving if $\mu(T^{-1}E) = \mu(E)$ for $E \in B$. It is said to be ergodic if $\mu(E) = 0$ or i whenever $T^{-1}E = E$ for $E \in B$. Consider the sequence ${x, Tx, T^2x,...}$ for $x \in X$. One may ask the following questions: What is the relative frequency of the points $T^nx$ which visit the set E\ulcorner Birkhoff Ergodic Theorem states that for an ergodic transformation T the time average $lim_{n \to \infty}(1/N)\sum^{N-1}_{n=0}{f(T^nx)}$ equals for almost every x the space average $(1/\mu(X)) \int_X f(x)d\mu(x)$. In the special case when f is the characteristic function $\chi E$ of a set E and T is ergodic we have the following formula for the frequency of visits of T-iterates to E : $$ lim_{N \to \infty} \frac{$\mid${n : T^n x \in E, 0 \leq n $\mid$}{N} = \mu(E) $$ for almost all $x \in X$ where $$\mid$\cdot$\mid$$ denotes cardinality of a set. For the details, see [8], [10].

• 한국정밀공학회지
• /
• 제23권4호
• /
• pp.75-82
• /
• 2006

In this paper, we propose an optimal trajectory for biped robots to move up-and-down stairs using a genetic algorithm and a computed-torque control for biped robots to be dynamically stable. First, a Real-Coded Genetic Algorithm (RCGA) which of operators are composed of reproduction, crossover and mutation is used to minimize the total energy. Constraints are divided into equalities and inequalities: Equality constraints consist of a position condition at the start and end of a step period and repeatability conditions related to each joint angle and angular velocity. Inequality constraints include collision avoidance conditions of a swing leg at the face and edge of a stair, knee joint conditions with respect to the avoidance of the kinematic singularity, and the zero moment point condition with respect to the stability into the going direction. In order to approximate a gait, each joint angle trajectory is defined as a 4-th order polynomial of which coefficients are chromosomes. The effectiveness of the proposed optimal trajectory is shown in computer simulations with a 6-dof biped robot that consists of seven links in the sagittal plane. The trajectory is more efficient than that generated by the modified GCIPM. And various trajectories generated by the proposed GA method are analyzed in a viewpoint of the consumption energy: walking on even ground, ascending stairs, and descending stairs.

• Journal of Mechanical Science and Technology
• /
• 제20권5호
• /
• pp.612-620
• /
• 2006

This paper proposes an optimal trajectory generation method for biped robots for walking up-and-down stairs using a Real-Coded Genetic Algorithm (RCGA). The RCGA is most effective in minimizing the total consumption energy of a multi-dof biped robot. Each joint angle trajectory is defined as a 4-th order polynomial of which the coefficients are chromosomes or design variables to approximate the walking gait. Constraints are divided into equalities and inequalities. First, equality constraints consist of initial conditions and repeatability conditions with respect to each joint angle and angular velocity at the start and end of a stride period. Next, inequality constraints include collision prevention conditions of a swing leg, singular prevention conditions, and stability conditions. The effectiveness of the proposed optimal trajectory is shown in computer simulations with a 6-dof biped robot model that consists of seven links in the sagittal plane. The optimal trajectory is more efficient than that generated by the Modified Gravity-Compensated Inverted Pendulum Mode (MGCIPM). And various trajectories generated by the proposed GA method are analyzed from the viewpoint of the consumption energy: walking on even ground, ascending stairs, and descending stairs.