• Magazine of the Korean Society of Agricultural Engineers
• /
• v.21 no.4
• /
• pp.108-117
• /
• 1979

In order to obtain the basic data for design of water structures which can be contributed to the planning of water use. Best fitted distribution function and the equations for the probable minimum flow were derived to the annual minimum flow of five subwatersheds along Geum River basin. The result were analyzed and summarized as follows. 1. Type III extremal distribution was considered as a best fit one among some other distributions such as exponential and two parameter lognormal distribution by $x^2$-goodness of fit test. 2. The minimum flow are analyzed by Type III extremal distribution which contains a shape parameter $\lambda$, a location parameter ${\beta}$ and a minimum drought $\gamma$. If a minimum drought $\gamma=0$, equations for the probable minimum flow, $D_T$, were derived as $D_T={\beta}e^{\lambda}1^{y'}$, with two parameters and as $D_T=\gamma+(\^{\beta}-\gamma)e^{{\lambda}y'}$ with three parameters in case of a minimum drought ${\gamma}>0$ respectively. 3. Probable minimum flow following the return periods for each stations were also obtained by above mentioned equations. Frequency curves for each station are drawn in the text. 4. Mathematical equation with three parameters is more suitable one than that of two parameters if much difference exist between the maximum and the minimum value among observed data.

• Journal of Fisheries and Marine Sciences Education
• /
• v.29 no.2
• /
• pp.354-364
• /
• 2017

This study tries to evaluate the effect of ITT introduction in Busan New Port. The study used the estimation model of the number of vehicles required in accordance with the backhaul rate. The model used big data, COPINO e-document for one year in 2015. COPINO recorded the event such as truck ID, container ID, ATA, damage etc when truck arrived at gate. The study finds important information to estimate the required number of trucks for handling current ITT containers in Busan New Port: Daily throughput in Busan New Port is 1650 vans, especially night throughput recorded peak level in 1800 hours to 2400 hours, the throughput between adjacent terminals recorded high, i.e PNIT to HPNT. The transportation capability for 6 hours between terminals is from 4 vans to 7 vans. The required trucks are estimated 89 currently without considering peak level. If we change the back haul rate from current 20% to 40%, 60% and 80%, how much would the cost drop? It was discovered that, if it is raised to 40%, 60% and 80%, the number of vehicle required will be reduced from 89 (current) to 76, 65 and 59. It was also discovered that the total savings will reduce down to 12%, 25% and 34%.

• Journal of information and communication convergence engineering
• /
• v.8 no.5
• /
• pp.519-523
• /
• 2010

In Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter of Q-algorithm, is not defined in the standard. In this case, if the number of tags within the reader's identification range is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation before the query round begins. Through computer simulations, it is demonstrated that the proposed scheme achieves more stable performance than Gen-2 Q-algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.975-976
• /
• 1993

This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

• Parasites, Hosts and Diseases
• /
• v.50 no.3
• /
• pp.243-247
• /
• 2012

Ascaris suum eggs are inactivated by composting conditions; however, it is difficult to find functional changes in heat-treated A. suum eggs. Here, unembryonated A. suum eggs were incubated at $20^{\circ}C$, $50^{\circ}C$, and $70^{\circ}C$ in vitro, and the gene expression levels related to viability, such as eukaryotic translation initiation factor 4E (IF4E), phosphofructokinase 1 (PFK1), and thioredoxin 1 (TRX1), and to apoptosis, such as apoptosis-inducing factor 1 (AIF1) and cell death protein 6 (CDP6), were evaluated by real-time quantitative RT-PCR. No prominent morphological alterations were noted in the eggs at $20^{\circ}C$ until day 10. In contrast, the eggs developed rapidly, and embryonated eggs and hatched larvae began to die, starting on day 2 at $50^{\circ}C$ and day 1 at $70^{\circ}C$. At $20^{\circ}C$, IF4E, PFK1, and TRX1 mRNA expression was significantly increased from days 2-4; however, AIF1 and CDP6 mRNA expression was not changed significantly. IF4E, PFK1, and TRX1 mRNA expression was markedly decreased from day 2 at $50^{\circ}C$ and $70^{\circ}C$, whereas AIF1 and CDP6 mRNA expression was significantly increased. The expressions of HSP70 and HSP90 were detected for 9-10 days at $20^{\circ}C$, for 3-5 days at $50^{\circ}C$, and for 2 days at $70^{\circ}C$. Taken together, incremental heat increases were associated with the rapid development of A. suum eggs, decreased expression of genes related to viability, and earlier expression of apoptosis-related genes, and finally these changes of viability- and apoptosis-related genes of A. suum eggs were associated with survival of the eggs under temperature stress.

• Communications of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.275-285
• /
• 1997

Let E be a uniformly convex Banach space with a uniformly G$\hat{a}teaux differentiable norm, C a nonempty closed convex subset of $E, T : C \to E$ a nonexpansive mapping, and Q a sunny nonexpansive retraction of E onto C. For $u \in C$ and $t \in (0,1)$, let $x_t$ be a unique fixed point of a contraction $R_t : C \to C$, defined by $R_tx = Q(tTx + (1-t)u), x \in C$. It is proved that if ${x_t}$ is bounded, then the strong $lim_{t\to1}x_t$ exists and belongs to the fixed point set of T. Furthermore, the strong convergence of ${x_t}$ in a reflexive and strictly convex Banach space with a uniformly G$\hat{a}$teaux differentiable norm is also given in case that the fixed point set of T is nonempty.

• Honam Mathematical Journal
• /
• v.29 no.1
• /
• pp.55-60
• /
• 2007

Given operators X and Y acting on a Hilbert space $\cal{H}$, an interpolating operator is a bounded operator A such that AX = Y. In this article, we showed the following : Let $\cal{L}$ be a subspace lattice acting on a Hilbert space $\cal{H}$ and let X and Y be operators in $\cal{B}(\cal{H})$. Let P be the projection onto $\bar{rangeX}$. If FE = EF for every $E\in\cal{L}$, then the following are equivalent: (1) $sup\{{{\parallel}E^{\perp}Yf\parallel\atop \parallel{E}^{\perp}Xf\parallel}\;:\;f{\in}\cal{H},\;E\in\cal{L}\}\$ < $\infty$, $\bar{range\;Y}\subset\bar{range\;X}$, and < Xf, Yg >=< Yf,Xg > for any f and g in $\cal{H}$. (2) There exists a self-adjoint operator A in Alg$\cal{L}$ such that AX = Y.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.377-387
• /
• 2014

Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.

• Journal of environmental and Sanitary engineering
• /
• v.15 no.3
• /
• pp.101-119
• /
• 2000

In order to establish water quality management planning in some watershed, water quality of the future of the watershed should be predicted first. The Yongsan river various pollutant sources ; sewage, industry, livestock, farming and so on. And pollutants from these sources are likely to increase even though a number of publicly owned treatment works(POTWs) are founded. Therefore, it is estimated that water quality if the river would be even worse than now in near future. In this study, water quality of the future(2001, 2006) on the Yongsan river was simulated with QUAL2E model. Concentration of three water quality parameters(BOD, T-N, T-P) was predicted according to dry season, low flow season, average flow season of the river with and without POTWs. The results of this study showed the significant contrast in concentration between with and without POTWs, specially in terms of T-N and T-P. Therefore, POTWs must be founded around the Yongsan river and more advanced treatment should be considered. And because these parameters are mostly affected by polluants from upper watershed, including Kwangiudcheon, water quality management planning on the Yongsan river might be focused on this area.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.294-306
• /
• 2005

Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.