• Korean Journal of Food Science and Technology
• /
• v.29 no.6
• /
• pp.1125-1130
• /
• 1997

The effects of enzyme combination, pH, acid washing and enzyme treatment sequence were investigated in the hydrolysis of soy protein. Comparing Alcalase vs. Neutrase/Alcalase, it appeared that Neutrase/Alcalase was more efficient than Alcalase alone, as the highest degree of hydrolysis (DH) was seen in Neutrase/Alcalase. A surprisingly high DH (more than 60%) was observed with Flavourzyme in the second hydrolysis. The separation of insolubles from the first hydrolysis had little effect on the second hydrolysis. When the washing water from the first hydrolysis was reused in the next hydrolysis, the DH and protein recovery were increased. The addition of calcium ion showed not so much positive effects by the stabilization of Neutrase on the Protein hydrolysis. The use of carbohydrase and repeated acid washing gave positive effects on DH. The simultaneous treatment using endoprotease and exoprotease with pH adjustment improved DH significantly.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.624-635
• /
• 2006

This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.490-498
• /
• 1993

A variety of methods for measuring the velocity from an image sequence use the relationship between the spatial and temporal gradients of image brightness function. In most situations, an additional constraint is required because the velocity is not determined uniquely by a above relationship. Horn and Schunch proposed a constraint that the velocity field should vary smoothly over the image. This requirement, however, forces the velocity field to vary smoothly even across motion boundaries. To complement this probe, Nagel introduced and 'oriented smoothness' constraint which restricts variations of velocity field only in directions with small or no variation of image brightness function. On the other hand, Paquin and Dubois proposed a different type of constraint that the velocity is constant in a small area of image. But, this constraint also creates difficulties at motion boundaries which large variations in velocity field often occur. We propose the method to overcome these difficulties by utilizing the information of discontinuities in image brightness function, and present the experimental results.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.459-470
• /
• 2007

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Query processing for such a data stream should also be continuous and rapid, which requires strict time and space constraints. In most DSMS(Data Stream Management System), the selection predicates of continuous queries are grouped or indexed to guarantee these constraints. This paper proposes a new scheme tailed an ASC(Attribute Selection Construct) that collectively evaluates selection predicates containing the same attribute in multiple continuous queries. An ASC contains valuable information, such as attribute usage status, partially pre calculated matching results and selectivity statistics for its multiple selection predicates. The processing order of those ASC's that are corresponding to the attributes of a base data stream can significantly influence the overall performance of multiple query evaluation. Consequently, a method of establishing an efficient evaluation order of multiple ASC's is also proposed. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.99-106
• /
• 2008

Recently developed compilers perform some optimizations in order to speed up the execution time of source program. These optimizations require the reordering of the sequence of program statements. This reordering does not give any problems in a single-threaded program. However, the reordering gives some significant errors in a multi-threaded program. State-of-the-art model checkers such as JavaPathfinder do not consider the reordering resulted in the optimization step in a compiler since they just consider a single memory model. In this paper, we develop a new verification tool to verify Java source program based on Java Memory Model. And our tool is capable of handling the reordering in verifying Java programs. As a result, our tool finds an error in the test program which is not revealed with the traditional model checker JavaPathFinder.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1765-1794
• /
• 2019

Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2277-2298
• /
• 2019

Adaptive learning in e-learning has garnered researchers' interest. In it, learning resources could be recommended automatically to achieve a personalized learning experience. There are various ways to realize it. One of the realistic ways is adaptive learning path recommendation, in which learning resources are provided according to learners' requirements. This paper summarizes existing works and proposes an innovative approach. Firstly, a learner-centred concept map is created using graph theory based on the features of the learners and concepts. Then, the approach generates a linear concept sequence from the concept map using the proposed traversal algorithm. Finally, Learning Objects (LOs), which are the smallest concrete units that make up a learning path, are organized based on the concept sequences. In order to realize this step, we model it as a multi-objective combinatorial optimization problem, and an improved immune algorithm (IIA) is proposed to solve it. In the experimental stage, a series of simulated experiments are conducted on nine datasets with different levels of complexity. The results show that the proposed algorithm increases the computational efficiency and effectiveness. Moreover, an empirical study is carried out to validate the proposed approach from a pedagogical view. Compared with a self-selection based approach and the other evolutionary algorithm based approaches, the proposed approach produces better outcomes in terms of learners' homework, final exam grades and satisfaction.

• Journal of Korean Society on Water Environment
• /
• v.34 no.6
• /
• pp.642-649
• /
• 2018

The effect of gas sparging on sonochemical oxidation was investigated in a 300 kHz sonoreactor under various liquid height/volume conditions ($5{\sim}30{\lambda}$, 3.4 ~ 9.0 L), determined by the wavelength of the applied frequency. The electrical input power was maintained constant for all cases . Sonochemical activity drastically decreased from $15{\lambda}$ and the liquid height of $10{\lambda}$ was suggested as the optimal height for 300 kHz without gas sparging. In our previous research, the sonochemical activity observed was five-times higher when air sparging was applied for 36 kHz. On the other hand, no enhancement was obtained at 10, 15, 25 and $30{\lambda}$ using air sparging (1, 3, and 6 L/min) for 300 kHz in this study $20{\lambda}$ and optimization of gas sparging was conducted at $20{\lambda}$ using various gases including air, Ar, $O_2$, $N_2$, and mixtures of Ar and $O_2$. It was found that gas sparging using pure Ar or pure $O_2$ resulted in lower sonochemical activity compared to that of air sparging due to the imbalance between the intensity of cavitation phenomena and the generation of oxidizing radical species. Consequently, the gas mixture of $Ar:O_2$ = 80 % : 20 % (DO saturation ${\approx}100%$) was suggested as an optimal gas sparging condition.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.23 no.3
• /
• pp.151-165
• /
• 2021

Grouting, which is applied for the increase of ground strength and the decrease of permeability, is complex process because of several reasons, so the process needs to be elaborated. Injection process in consideration of ground condition and optimization of grouting sequence is essential. In this study, GIN (Grouting Intensity Number), multiple of injected grout volume and pressure, is revised to consider injection pressure reduction and joint opening during grouting process. A revised GIN process is evaluated through a field test. A revised GIN, considering ground condition, injection pressure, follows GIN envelope and produces rational grouting process. The result of a revised GIN reduces permeability of the ground in the order of 10^-1~10^-2 cm/sec.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.277-284
• /
• 2022

In this paper, we proposes a method of optimizing the processing order of skids to minimize the span time in a conveyor environment of the shipbuilding subassembly process. The subassembly process consists of a series of fixed tasks where the required work time is varied according to the skid type. The loading order of skids on a conveyor which determines the span time should be properly optimized and the problem size exponentially increases with the number of skids. In this regard, we propose a novel method called UniDev by defining a measure of the mean-absolute-deviation about the time difference among simultaneously processed tasks and iteratively improving it. Through simulations with various numbers of skids and processes, it was observed that our proposed method can efficiently reduce the overall work time compared with the multi-start and the 2-OPT methods.