• Korean Journal of Food Science and Technology
• /
• v.25 no.5
• /
• pp.481-486
• /
• 1993

A computeized least-cost formulation program was applied to process emulsion-type sausages. The input data in formulation were utilized with the database which had been established in the previous study. The formulation results may provide Korean meat processors with actual examples. Meat-grade system made these examples more useful. The results of manufacturing test were as follows. The actual cohesiveness from manufactured sausages didn't correspond to the predicted values, but increased as the predicted values increased. These gabs caused by the different processing conditions between the model system and the actual processing. Hardness as well as cohesiveness could be used as the desirable index of a sausage texture. Comparing the cohesiveness and hardness of commercial frankfurters with those of test sausages, bind value constraint of $0.16{\sim}0.17$ in this test formula can be utilized for an actual formulation.

• Journal of the Korea Safety Management & Science
• /
• v.18 no.3
• /
• pp.127-135
• /
• 2016

Korean automobile industrial is in a difficult situation because of more competitive global market and lower demand. Therefore, domestic as well as global automobile manufacturers are making greater efforts in cost reduction to strengthen the competitiveness. According to statistical data, logistics cost in domestic manufacturers is higher than advanced countries. In this study, we developed program to effectively manage standard time of procurement logistics, and confirm based on A-automobile factory data. For the purpose, we develop the system which is possible to manage standard time as well as calculate man-hour. Program is not just for calculating and managing standard man-hour, scenarios analysis function will be added to calculate benefit while introduce logistics automated equipment. In this study we propose scenario using AGV instead of electric motor while move component. In the scenario analysis, job constitution is changed, and then we use system to compare the result. We can confirm standard man-hour is reduced from 22.3M/H to 14.3M/H. In future research, it is necessary scenario analysis function, and develop algorithm with realistic constraint condition.

• The Journal of the Korea Contents Association
• /
• v.12 no.11
• /
• pp.39-48
• /
• 2012

It is well known that software testing amounts for a significant portion of software development cost. In order to reduce the cost of software testing. a lot of researches on automated test data generation have been performed. Sophisticated tools for performing symbolic execution or solving a system of path constraints are required to support automated test data generation. Developing or purchasing those tools leads to another factor of increasing the cost involving software testing. In this paper, we propose a dynamic test data generation approach that does not depend on symbolic execution or constraint solving at all. The proposed approach extends Korel's path-oriented method to satisfy the branch coverage criterion effectively. We conducted an experiment to evaluate the effectiveness of the proposed technique with a triangle classification program to show that branch coverage can be easily achieved.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.3
• /
• pp.39-55
• /
• 1992

In this research, a Three Level Decomposition technique has been developed for configuration design optimization of truss structures. In the first level, as design variables, behavior variables are used and the strain energy has been treated as the cost function to be maximized so that the truss structure can absorb maximum energy. For design constraint of the optimal design problem, allowable stress, buckling stress, and displacement under multi-loading conditions are considered. In the second level, design problem is formulated using the cross-sectional area as the design variable and the weight of the truss structure as the cost function. As for the design constraint, the equilibrium equation with the optimal displacement obtained in the first level is used. In the third level, the nodal point coordinates of the truss structure are used as coordinating variable and the weight has been taken as the cost function. An advantage of the Three Level Decomposition technique is that the first and second level design problems are simple because they are linear programming problems. Moreover, the method is efficient because it is not necessary to carry out time consuming structural analysis and techniques for sensitivity analysis during the design optimization process. By treating the nodal point coordinates as design variables, the third level becomes unconstrained optimal design problems which is easier to solve. Moreover, by using different convergence criteria at each level of design problem, improved convergence can be obtained. The proposed technique has been tested using four different truss structures to yield almost identical optimum designs in the literature with efficient convergence rate regardless of constraint types and configuration of truss structures.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.65-72
• /
• 2009

Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.

• The Journal of the Korea Contents Association
• /
• v.19 no.9
• /
• pp.57-66
• /
• 2019

This study investigates the factors influencing to users' intention to retain monthly movie subscription VOD service in the Pay-TV. A dual model of a dedication-based mechanism and constraint-based mechanism used as the analytical framework for the service subscription retention. This study surveyed the total of 366 respondents who aged 15 years or older among the subscribers who use monthly movie subscription VOD service in Pay-TV from May 8 to May 14, 2018 through online surveys. And the study used SPSS 25 and AMOS 21 for data analysis. The results of the analysis are as follows. First, the price, the contents diversity and the ease of use were found to affect the user satisfaction. From three components, the price is the most effective and the ease of use is the next. Second, user satisfaction were found to affect the intention to retain a subscription in the dedication-based mechanism. Third, procedural switching cost were found to affect the intention to retain a subscription in the constraint-base mechanism.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.64-79
• /
• 2003

In client-server computing environments, update transactions of spatial data have the following characteristics. First, a transaction to update maps needs interactive work, and therefore it nay take a long time to finish. Second, a long transaction should be allowed to read the dirty data to enhance parallelism of executing concurrent transactions. when %he transaction is rolled back, it should guarantee the cascading rollback of all of the dependent transactions. Finally, two spatial objects may have a weak dependency constraint, called the spatial relationship, based on geometric topology. The existing recovery approaches cannot be directly applied to this environment, due to the high rollback cost and the overhead of cascading rollbacks. Furthermore, the previous approaches cannot guarantee the data integrity because the spatial relationship, which is a new consistency constraint of spatial data, is not considered. This paper presents new recovery schemes for update transactions of spatial data. To guarantee the data integrity, this paper defines recovery dependency as a rendition of cascading rollbacks. The partial-rollback is alto suggested to solve the problem of high rollback cost. The recovery schemes proposed in this paper can remove the unnecessary cascading rollbacks by using undo-delta, partial -redo and partial-undo. Finally, the schemes are performed to ensure the correctness.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.159-168
• /
• 2014

The Web is a way to share documents and communicate. However, voice and video data can be transmission in real time and currently being developed by the objects and the objects that interact to further develop the Internet. Existing video and audio programs to transmission data to the interface of different types of systems a lot of constraint condition on the cost of the interface, extensibility. In this paper, voice and audio transmission system a different operating system, improve the constraints of the ERP system compatibility and extensibility is a open source based system developed by the research. The program is different types of systems and interface, extensibility with program design and development methodologies, and open source-based system composed This system is good for cost saving and extensibility. Therefore, systems research and development, Extensibility and excellent on the interface, system design and development methodologies, such as real-time video conferencing, HMI, and take advantage of your video available from SNS.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.4
• /
• pp.137-146
• /
• 2016

In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.