• The Pure and Applied Mathematics
• /
• v.16 no.4
• /
• pp.383-404
• /
• 2009

The notions of P-I-open (closed) mappings, P-I-continuous mappings, P-I-neighborhoods, P-I-irresolute mappings and I-irresolute mappings are introduced. Relations between P-I-open (closed) mappings and I-open (closed) mappings are given. Characterizations of P-I-open (closed) mappings are provided. Relations between a P-I-continuous mapping and an I-continuous mapping are discussed, and characterizations of a P-I-continuous mapping are considered. Conditions for a mapping to be an I-irresolute mapping (resp. P-I-irresolute mapping) are provided.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.243-250
• /
• 2014

In this paper, I devise a balance-swap optimization (BSO) algorithm to solve economic load dispatch with a quadratic fuel cost function. This algorithm firstly sets initial values to $P_i{\leftarrow}P_i^{max}$, (${\Sigma}P_i^{max}$ > $P_d$) and subsequently entails two major processes: a balance process whereby a generator's power i of $_{max}\{F(P_i)-F(P_i-{\alpha})\}$, ${\alpha}=_{min}(P_i-P_i^{min})$ is balanced by $P_i{\leftarrow}P_i-{\alpha}$ until ${\Sigma}P_i=P_d$; and a swap process whereby $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_i+{{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}$ = 1.0, 0.1, 0.1, 0.01, 0.001 is set at $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$. When applied to 15, 20, and 38-generators benchmark data, this simple algorithm has proven to consistently yield the best possible results. Moreover, this algorithm has dramatically reduced the costs for a centralized operation of 73-generators - a sum of the three benchmark cases - which could otherwise have been impossible for independent operations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.253-262
• /
• 2016

This paper proposes a balance-swap method for the dynamic economic load dispatch problem. Based on the premise that all generators shall be operated at valve-points, the proposed algorithm initially sets the maximum generation power at $P_i{\leftarrow}P_i^{max}$. As for generator i with $_{max}c_i$, which is the maximum operating cost $c_i=\frac{F(P_i)-F(P_{iv_k})}{(P_i-P_{iv_k})}$ produced when the generation power of each generator is reduced to the valve-point $v_k$, the algorithm reduces i's generation power down to $P_{iv_k}$, the valve-point operating cost. When ${\Sigma}P_i-P_d$ > 0, it reduces the generation power of a generator with $_{max}c_i$ of $c_i=F(P_i)-F(P_i-1)$ to $P_i{\leftarrow}P_i-1$ so as to restore the equilibrium ${\Sigma}P_i=P_d$. The algorithm subsequently optimizes by employing an adult-step method in which power in the range of $_{min}\{_{max}(P_i-P_i^{min}),\;_{max}(P_i^{max}-P_i)\}$>${\alpha}{\geq}10$ is reduced by 10; a baby step method in which power in the range of 10>${\alpha}{\geq}1$ is reduced by 1; and a swap method for $_{max}[F(P_i)-F(P_i-{\alpha})]$>$_{min}[F(P_j+{\alpha})-F(P_j)]$, $i{\neq}j$ of $P_i=P_i{\pm}{\alpha}$, in which power is swapped to $P_i=P_i-{\alpha}$, $P_j=P_j+{\alpha}$. It finally executes minute swap process for ${\alpha}=\text{0.1, 0.01, 0.001, 0.0001}$. When applied to various experimental cases of the dynamic economic load dispatch problems, the proposed algorithm has proved to maximize economic benefits by significantly reducing the optimal operating cost of the extant Heuristic algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.189-196
• /
• 2012

This paper proposes Swap algorithm for solving Dynamic Economic Dispatch (DED) problem. The proposed algorithm initially balances total load demand $P_d$ with total generation ${\Sigma}P_i$ by deactivating a generator with the highest unit generation cost $C_i^{max}/P_i^{max}$. It then swaps generation level $P_i=P_i{\pm}{\Delta}$, (${\Delta}$=1.0, 0.1, 0.01, 0.001) for $P_i=P_i-{\Delta}$, $P_j=P_j+{\Delta}$ provided that $_{max}[F(P_i)-F(P_i-{\Delta})]$ > $_{min}[F(P_j+{\Delta})-F(P_j)]$, $i{\neq}j$. This new algorithm is applied and tested to the experimental data of Dynamic Economic Dispatch problem, demonstrating a considerable reduction in the prevalent heuristic algorithm's optimal generation cost and in the maximization of economic profit.

• Journal of the Korean Statistical Society
• /
• v.7 no.1
• /
• pp.3-10
• /
• 1978

Let $X_i,...,X_n$ be a random sample from a distribution with cumulants $K_1, K_2,...$. The statistic $t = \frac{\sqrt{x}(\bar{X}-K_1)}{S}$ has the well-known 'student' distribution with $\nu = n-1$ degrees of freedom if the $X_i$ are normally distributed (i.e., $K_i = 0$ for $i \geq 3$). An Edgeworth series expansion for the distribution of t when the $X_i$ are not normally distributed is obtained. The form of this expansion is Prob $(t

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.155-162
• /
• 2015

This paper proposes a deterministic optimization algorithm to solve economic load dispatch problem with quadratic convex fuel cost function. The proposed algorithm primarily partitions a generator with prohibited zones into multiple generators so as to place them afield the prohibited zone. It then sets initial values to $P_i{\leftarrow}P_i^{max}$ and reduces power generation costs of those incurring the maximum unit power cost. It finally employs a swap optimization process of $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$ where $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_j+{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}=1.0,0.1,0.01,0.001$. When applied to 3 different 15-generator cases, the proposed algorithm has consistently yielded optimized results compared to those of heuristic algorithms.

• Speech Sciences
• /
• v.9 no.4
• /
• pp.59-75
• /
• 2002

Aerodynamic analysis study was performed on 14 normal subjects (2 males, 12 females) with nonsense syllables composed of Korean bilabial stops (/p, p', $p^{h}$) and their preceding and/or following vowels, /i, a, u/. That is, [pi, p'i, $p^{h}i$, pa, p'a, $p^{h}a$, pu, p'u, $p^{h}u$, ipi, apa, upu, $ip^{h}i$, $ap^{h}a$, $up^{h}u$, ip'i, ap'a, up'u]. All measures were taken and analysed using Aerophone II voice function analyzer and included peak air pressure, mean air pressure, maximum flow rate, volume, mean SPL and phonatory SPL. A t-test and one-way ANOVA were employed for analysis. A post-hoc analysis was performed with Scheffe and Bonferroni. The results were as follows: First, MSPL. and MAP of /p, p', $p^{h}$/ were significantly different in different positions (initial and medial position). In addition, different vowel environment also produced significantly different aerodynamic characteristics those consonants. Especially the lax consonant /p/ was significantly different /i, a, u/ vowel environments. The tense consonant /p'/ was significantly different only /i/ vowel environment.

• East Asian mathematical journal
• /
• v.18 no.2
• /
• pp.271-282
• /
• 2002

Let R be a ring with an endomorphism $\sigma$ and a derivation $\delta$. An ideal I of R is ($\sigma,\;\delta$)-ideal of R if $\sigma(I){\subseteq}I$ and $\delta(I){\subseteq}I$. An ideal P of R is a ($\sigma,\;\delta$)-prime ideal of R if P(${\neq}R$) is a ($\sigma,\;\delta$)-ideal and for ($\sigma,\;\delta$)-ideals I and J of R, $IJ{\subseteq}P$ implies that $I{\subseteq}P$ or $J{\subseteq}P$. An ideal Q of R is ($\sigma,\;\delta$)-semiprime ideal of R if Q is a ($\sigma,\;\delta$)-ideal and for ($\sigma,\;\delta$)-ideal I of R, $I^2{\subseteq}Q$ implies that $I{\subseteq}Q$. The ($\sigma,\;\delta$)-prime radical (resp. prime radical) is defined by the intersection of all ($\sigma,\;\delta$)-prime ideals (resp. prime ideals) of R and is denoted by $P_{(\sigma,\delta)}(R)$(resp. P(R)). In this paper, the following results are obtained: (1) $P_{(\sigma,\delta)}(R)$ is the smallest ($\sigma,\;\delta$)-semiprime ideal of R; (2) For every extended endomorphism $\bar{\sigma}$ of $\sigma$, the $\bar{\sigma}$-prime radical of an Ore extension $P(R[x;\sigma,\delta])$ is equal to $P_{\sigma,\delta}(R)[x;\sigma,\delta]$.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.1007-1025
• /
• 2015

Let $\mathbb{N}_0$ be the set of non-negative integers, and let P(n, l) denote the set of all weak compositions of n with l parts, i.e., $P(n,l)=\{(x_1,x_2,{\cdots},x_l){\in}\mathbb{N}^l_0\;:\;x_1+x_2+{\cdots}+x_l=n\}$. For any element $u=(u_1,u_2,{\cdots},u_l){\in}P(n,l)$, denote its ith-coordinate by u(i), i.e., $u(i)=u_i$. A family $A{\subseteq}P(n,l)$ is said to be t-intersecting if ${\mid}\{i:u(i)=v(i)\}{\mid}{\geq}t$ for all $u,v{\epsilon}A$. A family $A{\subseteq}P(n,l)$ is said to be trivially t-intersecting if there is a t-set T of $[l]=\{1,2,{\cdots},l\}$ and elements $y_s{\in}\mathbb{N}_0(s{\in}T)$ such that $A=\{u{\in}P(n,l):u(j)=yj\;for\;all\;j{\in}T\}$. We prove that given any positive integers l, t with $l{\geq}2t+3$, there exists a constant $n_0(l,t)$ depending only on l and t, such that for all $n{\geq}n_0(l,t)$, if $A{\subseteq}P(n,l)$ is non-trivially t-intersecting, then $${\mid}A{\mid}{\leq}(^{n+l-t-l}_{l-t-1})-(^{n-1}_{l-t-1})+t$$. Moreover, equality holds if and only if there is a t-set T of [l] such that $$A=\bigcup_{s{\in}[l]{\backslash}T}\;A_s{\cup}\{q_i:i{\in}T\}$$, where $$A_s=\{u{\in}P(n,l):u(j)=0\;for\;all\;j{\in}T\;and\;u(s)=0\}$$ and $$q_i{\in}P(n,l)\;with\;q_i(j)=0\;fo\;all\;j{\in}[l]{\backslash}\{i\}\;and\;q_i(i)=n$$.

• Korean Journal of Mathematics
• /
• v.17 no.1
• /
• pp.15-23
• /
• 2009

Let D be an integral domain, P be a nonzero prime ideal of D, $\{P_{\alpha}{\mid}{\alpha}{\in}{\mathcal{A}}\}$ be a nonempty set of prime ideals of D, and $\{I_{\beta}{\mid}{\beta}{\in}{\mathcal{B}}\}$ be a nonempty family of ideals of D with ${\cap}_{{\beta}{\in}{\mathcal{B}}}I_{\beta}{\neq}(0)$. Consider the following conditions: (i) If $P{\subseteq}{\cup}_{{\alpha}{\in}{\mathcal{A}}}P_{\alpha}$, then $P=P_{\alpha}$ for some ${\alpha}{\in}{\mathcal{A}}$; (ii) If ${\cap}_{{\beta}{\in}{\mathcal{B}}}I_{\beta}{\subseteq}P$, then $I_{\beta}{\subseteq}P$ for some ${\beta}{\in}{\mathcal{B}}$. In this paper, we prove that D satisfies $(i){\Leftrightarrow}D$ is a generalized weakly factorial domain of ${\dim}(D)=1{\Rightarrow}D$ satisfies $(ii){\Leftrightarrow}D$ is a weakly Krull domain of dim(D) = 1. We also study the t-operation analogs of (i) and (ii).