• Journal of Korea Water Resources Association
• /
• v.54 no.6
• /
• pp.443-452
• /
• 2021

The authors obtained the discrete hedging rule for a reservoir's water supply operation by applying mixed-integer programming to save more water by earlier rationing of water supply for a drought period. The 'water supply adjustment guide' is the current operational method applied to the multipurpose reservoirs, and it was derived by a simulation method. Applying the two rules to the Hapcheon multipurpose dam's reservoir simulations with the inflow record from 2003 to 2018, the water supply deficit occurred for the long drought from 2015 to 2018. Especially, the no water supply or intermittent water supply persisted for the second half of 2017. The water supply adjustment guide had the 'normal water supply recovery threshold on storage,' which resulted in the water supply being unavailable in July 2017; then, the water supply suspension occurred until January 2018, when the reservoir storage was greater than the normal water supply recovery threshold. Despite the storage increasing due to the inflow of water into the reservoir, the suspension occurrence needs to be improved in practice. The current water supply adjustment guide and the discrete hedging rule for a reservoir's water supply operation are useful and realistic as the reservoir operation guide, which shows the concept of reducing water supply during the drought phase as scientific figures. However, to improve the reservoir simulation results, which do not provide any or intermittent water for several months, it is necessary to increase the current water supply reduction for drought phases.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.233-242
• /
• 2015

This paper analyzes a multi-product inbound lot-sizing and outbound dispatching problem with multi-vehicle types in a third-party logistics distribution center. The product must be delivered to the customers within the delivery time window and backlogging is not allowed. Replenishing orders are shipped by several types of vehicles with two types of the freight costs, i.e., uniform and decreasing, are considered. The objective of this study is to determine the lot-size and dispatching schedules to minimize the total cost with the sum of inbound and outbound transportation and inventory costs over the entire time horizon. In this study, we mathematically derive a mixed-integer programming model and propose a genetic algorithm (GA1) based on a local search heuristic algorithm to solve large-scale problems. In addition, we suggest a new genetic algorithm (GA2) with an adjusting algorithm to improve the performance of GA1. The basic mechanism of the GA2 is to provide an unidirectional partial move of products to available containers in the previous period. Finally, we analyze the results of GA1 and GA2 by evaluate the relative performance using the gap between the objective values of CPLEX and the each algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.385-399
• /
• 2010

Let $\sigma$ be an endomorphism and I a $\sigma$-ideal of a ring R. Pearson and Stephenson called I a $\sigma$-semiprime ideal if whenever A is an ideal of R and m is an integer such that $A{\sigma}^t(A)\;{\subseteq}\;I$ for all $t\;{\geq}\;m$, then $A\;{\subseteq}\;I$, where $\sigma$ is an automorphism, and Hong et al. called I a $\sigma$-rigid ideal if $a{\sigma}(a)\;{\in}\;I$ implies a $a\;{\in}\;I$ for $a\;{\in}\;R$. Notice that R is called a $\sigma$-semiprime ring (resp., a $\sigma$-rigid ring) if the zero ideal of R is a $\sigma$-semiprime ideal (resp., a $\sigma$-rigid ideal). Every $\sigma$-rigid ideal is a $\sigma$-semiprime ideal for an automorphism $\sigma$, but the converse does not hold, in general. We, in this paper, introduce the quasi $\sigma$-rigidness of ideals and rings for an automorphism $\sigma$ which is in between the $\sigma$-rigidness and the $\sigma$-semiprimeness, and study their related properties. A number of connections between the quasi $\sigma$-rigidness of a ring R and one of the Ore extension $R[x;\;{\sigma},\;{\delta}]$ of R are also investigated. In particular, R is a (principally) quasi-Baer ring if and only if $R[x;\;{\sigma},\;{\delta}]$ is a (principally) quasi-Baer ring, when R is a quasi $\sigma$-rigid ring.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

• Journal of the Korean Society for Railway
• /
• v.17 no.4
• /
• pp.313-319
• /
• 2014

Additional train scheduling is often required to increase the capacity of transporting passengers or freight. In most previous studies on scheduling additional trains, operation time of the added train is designated first; and then the train operation feasibility is examined. However, it is often difficult to apply this approach to domestic trains because the density of the railroad network in Korea is high and various types of trains are in use. Moreover, for freight trains, it is even more challenging because the delay is accumulated due to lower priority whenever a freight train and a passenger train contend for a common segment of rail. In this paper, we address the additional train scheduling problem which entails finding a feasible schedule for an additional train having a fixed departure time or departure time windows. The problem is modeled as a mixed integer programming and a column generation technique is used to solve it.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.392-400
• /
• 2005

Highly integrated MPEG-4@SP video compression engine, VideoCore, is proposed for mobile application. The primary components of video compression require the high memory bandwidth since they access the external memory frequently. They include motion estimation, motion compensation, quantization, discrete cosine transform, variable length coding, and so on. The motion estimation processor adopted in VideoCore utilizes the small-size local memories such that the video compression system accesses external memory as less frequently as possible. The entire video compression system is divided into two distinct sub-systems: the integer-unit motion estimation part and the others, and both operate concurrently in a pipelined architecture. Thus the VideoCore enables the real-time high-quality video compression with a relatively low operation frequency.

• Bulletin of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.45-49
• /
• 1983

If R is ring and M is a right (or left) R-module, then M is called a faithful R-module if, for some a in R, x.a=0 for all x.mem.M then a=0. In [4], R.E. Johnson defines that M is a prime module if every non-zero submodule of M is faithful. Let us define that M is of prime type provided that M is faithful if and only if every non-zero submodule is faithful. We call a right (left) ideal I of R is of prime type if R/I is of prime type as a R-module. This is equivalent to the condition that if xRy.subeq.I then either x.mem.I ro y.mem.I (see [5:3:1]). It is easy to see that in case R is a commutative ring then a right or left ideal of a prime type is just a prime ideal. We have defined in [5], that a chain of right ideals of prime type in a ring R is a finite strictly increasing sequence I$_{0}$.contnd.I$_{1}$.contnd....contnd.I$_{n}$; the length of the chain is n. By the right dimension of a ring R, which is denoted by dim, R, we mean the supremum of the length of all chains of right ideals of prime type in R. It is an integer .geq.0 or .inf.. The left dimension of R, which is denoted by dim$_{l}$ R is similarly defined. It was shown in [5], that dim$_{r}$R=0 if and only if dim$_{l}$ R=0 if and only if R modulo the prime radical is a strongly regular ring. By "a strongly regular ring", we mean that for every a in R there is x in R such that axa=a=a$^{2}$x. It was also shown that R is a simple ring if and only if every right ideal is of prime type if and only if every left ideal is of prime type. In case, R is a (right or left) primitive ring then dim$_{r}$R=n if and only if dim$_{l}$ R=n if and only if R.iden.D$_{n+1}$ , n+1 by n+1 matrix ring on a division ring D. in this paper, we establish the following results: (1) If R is prime ring and dim$_{r}$R=n then either R is a righe Ore domain such that every non-zero right ideal of a prime type contains a non-zero minimal prime ideal or the classical ring of ritght quotients is isomorphic to m*m matrix ring over a division ring where m.leq.n+1. (b) If R is prime ring and dim$_{r}$R=n then dim$_{l}$ R=n if dim$_{l}$ R=n if dim$_{l}$ R<.inf. (c) Let R be a principal right and left ideal domain. If dim$_{r}$R=1 then R is an unique factorization domain.TEX>R=1 then R is an unique factorization domain.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.221-228
• /
• 2013

It is impossible directly to find a prime number p,q of a large semiprime n = pq using Trial Division method. So the most of the factorization algorithms use the indirection method which finds a prime number of p = GCD(a-b, n), q=GCD(a+b, n); get with a congruence of squares of $a^2{\equiv}b^2$ (mod n). It is just known the fact which the area that selects p and q about n=pq is between $10{\cdots}00$ < p < $\sqrt{n}$ and $\sqrt{n}$ < q < $99{\cdots}9$ based on $\sqrt{n}$ in the range, [$10{\cdots}01$, $99{\cdots}9$] of $l(p)=l(q)=l(\sqrt{n})=0.5l(n)$. This paper proposes the method that reduces the range of p using information obtained from n. The proposed method uses the method that sets to $p_{min}=n_{LR}$, $q_{min}=n_{RL}$; divide into $n=n_{LR}+n_{RL}$, $l(n_{LR})=l(n_{RL})=l(\sqrt{n})$. The proposed method is more effective from minimum 17.79% to maxmimum 90.17% than the method that reduces using $\sqrt{n}$ information.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.387-397
• /
• 2015

In this paper, the determinants of the number of job changes in the SMEs (small and medium enterprises) youth-intern project is analysed, utilizing SMEs youth-intern DB and employment insurance DB. Since the number of job changes are count data which take integer values other than negative values, general linear regression analysis becomes inappropriate. Therefore, four models such as Poisson regression model, zero inflated Poisson regression model, negative binomial regression model and zero inflated negative binomial regression model are tried to fit count data. A zero inflated negative binomial regression model is selected to be the best model. Major results are the followings. First, the number of job changes is shown to be significantly smaller in the treatment group than in the control group. Second, the number of job changes turns out to be significantly smaller in the young-age group than in the old-age group. Third, it is also shown that the number of job changes of man is significantly greater than that of woman. Lastly, the number of job changes in the bigger firm is shown to be significantly less than that of the smaller firm.