• Journal of the Korean Society of Food Science and Nutrition
• /
• v.46 no.11
• /
• pp.1373-1385
• /
• 2017

The purpose of this study was to optimize the formulation for fish-meat noodles added with farmed olive flounder (Paralichthys olivaceus) using response surface methodology. Fish-meat (surimi) from P. olivaceus was prepared by a traditional washing process. Independent variables were Alaska pollack, fish-meat from P. olivaceus, and starch, whereas dependent variables were whiteness and texture. The results for whiteness and texture produced very significant values for whiteness (P<0.001), strength (P<0.001), hardness (P<0.05), breaking force (P<0.001), chewiness (P<0.001), brittleness (P<0.001), extensibility force (P<0.001), and extensibility distance (P<0.05). The optimal formula for fish-meat noodle was addition of 72.00 g Alaska pollack, 11.59 g P. olivaceus, and 15.86 g starch. Experimental values of whiteness, strength, hardness, breaking force, chewiness, brittleness, extensibility force, and extensibility distance under optimal conditions were $59.01{\pm}0.53$, $708.22{\pm}54.12g/cm^2$, $1,390.07{\pm}67.70g/cm^2$, $3,622.77{\pm}92.52g$, $2,686.94{\pm}103.22g$, $278,578.31{\pm}10,150.22g$, $52.22{\pm}2.97g$, $24.14{\pm}3.55mm$, respectively.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• Journal of Intelligence and Information Systems
• /
• v.26 no.3
• /
• pp.37-50
• /
• 2020

Information security has become an important issue in the world. Various information and communication technologies, such as the Internet of Things, big data, cloud, and artificial intelligence, are developing, and the need for information security is increasing. Although the necessity of information security is expanding according to the development of information and communication technology, interest in information security investment is insufficient. In general, measuring the effect of information security investment is difficult, so appropriate investment is not being practice, and organizations are decreasing their information security investment. In addition, since the types and specification of information security measures are diverse, it is difficult to compare and evaluate the information security countermeasures objectively, and there is a lack of decision-making methods about information security investment. To develop the organization, policies and decisions related to information security are essential, and measuring the effect of information security investment is necessary. Therefore, this study proposes a method of constructing an investment portfolio for information security measures using game theory and derives an optimal defence probability. Using the two-person game model, the information security manager and the attacker are assumed to be the game players, and the information security countermeasures and information security threats are assumed as the strategy of the players, respectively. A zero-sum game that the sum of the players' payoffs is zero is assumed, and we derive a solution of a mixed strategy game in which a strategy is selected according to probability distribution among strategies. In the real world, there are various types of information security threats exist, so multiple information security measures should be considered to maintain the appropriate information security level of information systems. We assume that the defence ratio of the information security countermeasures is known, and we derive the optimal solution of the mixed strategy game using linear programming. The contributions of this study are as follows. First, we conduct analysis using real performance data of information security measures. Information security managers of organizations can use the methodology suggested in this study to make practical decisions when establishing investment portfolio for information security countermeasures. Second, the investment weight of information security countermeasures is derived. Since we derive the weight of each information security measure, not just whether or not information security measures have been invested, it is easy to construct an information security investment portfolio in a situation where investment decisions need to be made in consideration of a number of information security countermeasures. Finally, it is possible to find the optimal defence probability after constructing an investment portfolio of information security countermeasures. The information security managers of organizations can measure the specific investment effect by drawing out information security countermeasures that fit the organization's information security investment budget. Also, numerical examples are presented and computational results are analyzed. Based on the performance of various information security countermeasures: Firewall, IPS, and Antivirus, data related to information security measures are collected to construct a portfolio of information security countermeasures. The defence ratio of the information security countermeasures is created using a uniform distribution, and a coverage of performance is derived based on the report of each information security countermeasure. According to numerical examples that considered Firewall, IPS, and Antivirus as information security countermeasures, the investment weights of Firewall, IPS, and Antivirus are optimized to 60.74%, 39.26%, and 0%, respectively. The result shows that the defence probability of the organization is maximized to 83.87%. When the methodology and examples of this study are used in practice, information security managers can consider various types of information security measures, and the appropriate investment level of each measure can be reflected in the organization's budget.

• Journal of Korean Society of Environmental Engineers
• /
• v.33 no.1
• /
• pp.25-31
• /
• 2011

In this study, model-based $NH_4-N$ predictive control algorithm by using influent pattern was developed and evaluated for effective control application in $A^2/O$ process. A pilot-scale $A^2/O$process at S wastewater treatment plant in B city was selected. The behaviors of organic, nitrogen and phosphorous in the biological reactors were described by using the modified ASM3+Bio-P model. A one-dimensional double exponential function model was selected for modeling of the secondary settlers. The effluent $NH_4-N$ concentration on the next day was predicted according to model-based simulation by using influent pattern. After the objective effluent quality and simulation result were compared, the optimal operational condition which able to meet the objective effluent quality was deduced through repetitive simulation. Next the effluent $NH_4-N$ control schedule was generated by using the optimal operational condition and this control schedule on the next day was applied in pilot-scale $A^2/O$ process. DO concentration in aerobic reactor in predictive control algorithm was selected as the manipulated variable. Without control case and with control case were compared to confirm the control applicability and the study of the applied $NH_4-N$control schedule in summer and winter was performed to confirm the seasonal effect. In this result, the effluent $NH_4-N$concentration without control case was exceeded the objective effluent quality. However the effluent $NH_4-N$ concentration with control case was not exceeded the objective effluent quality both summer and winter season. As compared in case of without predictive control algorithm, in case of application of predictive control algorithm, the RPM of air blower was increased about 9.1%, however the effluent $NH_4-N$ concentration was decreased about 45.2%. Therefore it was concluded that the developed predictive control algorithm to the effluent $NH_4-N$ in this study was properly applied in a full-scale wastewater treatment process and was more efficient in aspect to stable effluent.

• Economic and Environmental Geology
• /
• v.50 no.3
• /
• pp.215-224
• /
• 2017

Arsenic (As) is known to be the most toxic element and frequently detected in groundwater environment. Inorganic As exists as arsenite [As(III)] and arsenate [As(V)] in reduced and oxidized environments, respectively. It has been reported that the toxicity of arsenite is much higher than that of arsenate and furthermore arsenite shows relatively higher mobility in aqueous environments. For this reason, there have been numerous researches on the process for oxidation of arsenite to arsenate to reduce the toxicity of arsenic. In particular, photooxidation has been considered to be simple, economical, and efficient to attain such goal. This study was conducted to evaluate the applicability of naturally-occurring goethite as a photocatalyst to substitute for $TiO_2$ which has been mostly used in the photooxidation processes so far. In addition, the effects of several factors on the overall performance of arsenite photocatalytic oxidation process were evaluated. The results show that the efficiency of the process was affected by total concentration of dissolved cations rather than by the kind of those cations and also the relatively higher pH conditions seemed to be more favorable to the process. In the case of coexistence of arsenite and arsenate, the removal tendency by adsorption onto goethite appeared to be different between arsenite and arsenate due to their different affinities with goethite, but any effect on the photocatalytic oxidation of arsenite was not observed. In terms of effect of humic acid on the process, it is likely that the higher concentration of humic acid reduced the overall performance of the arsenite photocatalytic oxidation as a result of competing interaction of activated oxygen species, such as hydroxyl and superoxide radicals, with arsenite and humic acid. In addition, it is revealed that the injection of oxygen gas improved the process because oxygen contributes to arsenite oxidation as an electron acceptor. Based on the results of the study, consequently, the photocatalytic oxidation of aqueous arsenite using goethite seems to be greatly feasible with the optimization of process.

• Applied Biological Chemistry
• /
• v.43 no.3
• /
• pp.218-224
• /
• 2000

The efforts were made to optimite ethanol extraction from persimmon leaf with the time of extraction$(1.5{\sim}2.5\;hrs)$, the temperature of extraction$(70{\sim}90^{\circ}C)$, and the concentration of ethanol$(0{\sim}40%)$ as three primary variables together with several functional characteristics of persimmon leaf as reaction variables. The conditions of extraction was best fitted by using response surface methodology through the center synthesis plan, and the optimal conditions of extraction were established. The contents of soluble solid and soluble tannin went up as the concentration of ethanol went up and the temperature of extraction went down, and the turbidity went down as the concentration of ethanol went down. Electron donation ability was hardly affected by the extraction temperature and had the tendency to go up as the concentration of ethanol went up. The inhibitory activity of xanthine oxidase(XOase) had the tendency to go up as both the concentration of ethanol and the temperature of extraction went up. The inhibitory activity of angiotensin converting enzyme(ACE), the significance of which still was not recognized, showed the maximum when the concentration of ethanol was 27%. In result, the optimal conditions of extraction was the extraction time of two hours, the extraction temperature of $75{\sim}81^{\circ}C$, and the ethanol concentration of $33{\sim}35%$.

• Journal of Intelligence and Information Systems
• /
• v.25 no.4
• /
• pp.53-65
• /
• 2019

Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.2
• /
• pp.1200-1206
• /
• 2015

The major target for drug discovery, G-protein coupled receptor (GPCR) is involved in many physiological activities and related to various diseases and disorders. Among experimental techniques relating to the GPCR drug discovery process, various cell-based screening methods are influenced by cell conditions used in the overall process. Recently, the utilization of frozen cells is suggested in terms of reducing data variation and cost-effectiveness. The aim of this study is to evaluate various conditions in cell freezing such as temperature conditions and storage terms. The stable cell lines for calcium sensing receptor and urotensin receptor were established followed by storing cultured cells at $-80^{\circ}C$ up to 4 weeks. To compare with cell stored at liquid nitrogen, agonist and antagonist responses were recorded based on the luminescence detection by the calcium induced photoprotein activation. Cell signals were reduced as the storage period was increased without the changes in $EC_{50}$ and $IC_{50}$ values $EC_{50}:3.46{\pm}1.36mM$, $IC_{50}:0.49{\pm}0.15{\mu}M$). In case of cells stored in liquid nitrogen, cell responses were decreased comparing to those in live cells, however changes by storage periods and significant variations of $EC_{50}/IC_{50}$ values were not detected. The decrease of cell signals in various frozen cells may be due to the increase of cell damages. From these results, the best way for a long-term cryopreservation is the use of liquid nitrogen condition, and for the purpose of short-term storage within a month, $-80^{\circ}C$ storage condition can be possible to adopt. As a conclusion, the active implementation of frozen cells may contribute to decrease variations of experimental data during the initial cell-based screening process.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

• Land and Housing Review
• /
• v.2 no.4
• /
• pp.453-461
• /
• 2011

This study is to derive a project model based on potential demand for Korean-style houses, focusing on new town detached housing sites that LH supplies and to test validity of the derived model and to present the direction and supply methods of the projects. The existing high-class new town Korean-style housing developments that have been considered were found to have little business value due to problems in choice of location and discordance of demand, so 6 types of projects were established through the methods of changes in planned scale, combined use, and subdivision of plot of land based on the results of survey. The type that has the highest business value among the project models was block-type multifamily houses, and this can be interpreted as the increase in total construction area leading to increase inrevenues of allotment sales due to economies of scale. The feasibility of mass housing model in which small-scale Korean-style houses are combined with amenities was found to be high, and if the same project conditions as those of the block-type multifamily houses are applied, the business value of the Korean-style tenement houses was found to be high. Besides, the high-class housing models within block-type detached housing areas are typical projects that the private sector generally promotes, and the construction cost was found to be most expensive with 910 million won per house. In order to enhance the business value of the Korean-style housing development, collectivization such as choice of location, diversification of demand classes, optimization of house sizes, and combination of uses is needed. And in order to adopt Korean-style houses in the detached housing sites, the adjustments and division of the existing planned plots are needed, and the strategies to cope with new demand through supplying Korean-style housing types of sites can be suggested. Also breaking away from the existing uniform residential development methods, the development method through supplying original land that is natural land not yet developed besides basic infrastructures (main roads and water and sewage) can be considered, and as the construction of more than 1~2 stories building is impossible due to the structure of Korean-style house roof and furniture. So it can be suggested that original land in the form of hilly land is considered to be most suitable to large-scale development projects.