• Journal of information and communication convergence engineering
• /
• v.13 no.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
• /
• v.50 no.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.

• Communications of Mathematical Education
• /
• v.22 no.1
• /
• pp.27-39
• /
• 2008

In this paper we study triangle's properties related with angle bisectors, perpendiculars, circumcenter using the principle of the lever. We analyze proof method using the principle of the lever, and describe how to investigate intersection of segments, how to prove equalities and inequalities using the principle of the lever in triangle.

• Communications of Mathematical Education
• /
• v.22 no.4
• /
• pp.545-556
• /
• 2008

In this paper we study Gergonne's point and its adjoint points of triangle using the principle of the lever. We prove existence of Gergonne's point and its adjoint points, suggest new proof method of a equality related with Gergonne's point. We find new equalities related with adjoint points of Gergonne's points, and prove these using the principle of the lever.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• 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.

• Communications of Mathematical Education
• /
• v.24 no.1
• /
• pp.145-158
• /
• 2010

In this paper we study tetrahedron's properties related with center of inscribed sphere using the center of mass. We show that the center of mass of four mass points (A,a), (B,b), (C,c), (D,d) coincide with center of tetrahedron's inscribed sphere, suggest equalities and inequalities related with center of inscribed sphere, and prove theses using the center of mass. Our results can be used in research and education programs, various types of gifted student education.

• ETRI Journal
• /
• v.9 no.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.

• Communications of the Korean Mathematical Society
• /
• v.9 no.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].

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.4 s.181
• /
• 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
• /
• v.20 no.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.