• Journal of Environmental Science International
• /
• v.26 no.5
• /
• pp.601-608
• /
• 2017

The effects of elevated atmospheric $CO_2$ on growth and photosynthesis of soybean (Glycine max Merr.) were investigated to predict its productivity under elevated $CO_2$ levels in the future. Soybean grown for 6 weeks showed significant increase in vegetative growth, based on plant height, leaf characteristics (area, length, and width), and the SPAD-502 chlorophyll meter value (SPAD value) under elevated $CO_2$ conditions ($800{\mu}mol/mol$) compared to ambient $CO_2$ conditions ($400{\mu}mol/mol$). Under elevated $CO_2$ conditions, the photosynthetic rate (A) increased although photosystem II (PS II) photochemical activity ($F_v/F_m$) decreased. The maximum photosynthetic rate ($A_{max}$) was higher under elevated $CO_2$ conditions than under ambient $CO_2$ conditions, whereas the maximum electron transport rate ($J_{max}$) was lower under elevated $CO_2$ conditions compared to ambient $CO_2$ conditions. The optimal temperature for photosynthesis shifted significantly by approximately $3^{\circ}C$ under the elevated $CO_2$ conditions. With the increase in temperature, the photosynthetic rate increased below the optimal temperature (approximately $30^{\circ}C$) and decreased above the optimal temperature, whereas the dark respiration rate ($R_d$) increased continuously regardless of the optimal temperature. The difference in photosynthetic rate between ambient and elevated $CO_2$ conditions was greatest near the optimal temperature. These results indicate that future increases in $CO_2$ will increase productivity by increasing the photosynthetic rate, although it may cause damage to the PS II reaction center as suggested by decreases in $F_v/F_m$, in soybean.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.366-377
• /
• 2005

We find a module may that takes optimal correction rate of Korean spelling corrector. If there are a lot of module numbers of spelling corrector, it is difficult to calculate optimal correction rate of spelling corrector because permutation of N-modules is N!. This Korean spelling corrector consists of 19 modules. It is impossible to arrange 19 modules actually and the correction rate is various according to input data. We found the range of correction rate using parallel processing between modules and the optimal correction rate using sequential processing of modules. Input data that are used in an experiment is 753,191 eojeol's sets that happen in newspaper publishing company during several years. About this error set, theoretical maximum correction rate of spelling corrector is $97.28\%$ (732,764/753,191). But we got the optimal correction rate $96.62\%$ (727,750/733,191). This optimal correction rate is almost near to $99.31\%$ (727,750/732,764) of the maximum correction rate.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.86-98
• /
• 2007

This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.14 no.2
• /
• pp.121-126
• /
• 2015

In this research, a tool was developed for the rapid performance of three-dimensional finite element analysis (3D FEA) of a machine tool spindle system made of a shaft and bearings. It runs the FEA with data, such as the bearing stiffness and the coordinates of the points, to define the section of the shaft, bearing positions, and cutting point. developed for the spindle system and then implemented with the tool using an object-oriented programing technique that allows the use of the objects of the CAD system used in this research. Graphic user interfaces were designed for a user to interact with the tool. It provides rapid evaluation of the design of a spindle system, and therefore, it would be helpful to identify a near optimal design of a spindle system based on, say, static stiffness with design changes and, consequently, FEA.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.280-289
• /
• 2002

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.102-110
• /
• 1996

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.

• The Journal of Information Technology and Database
• /
• v.6 no.2
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.