• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.155-175
• /
• 2003

In context of e-commerce, negotiation is a procedure to help negotiate between buyer and seller by adjusting their negotiation issues such as price and in terms of payment. We used intelligent agent and mobile device to promote new framework of e-commerce. Moreover, this framework can help buyers and sellers to carry their commercial transactions effectively. In regard to that issue, we need to carry out the research of negotiation agent that can be used in e-commerce fields. In this paper, we modeled the negotiation using CSP for the performance of agent in m-commerce environment. Furthermore we implemented interface for mobile device to extract buyer's requirement and preference easily Besides that we used utility function to make a decision for various evaluation functions and suggestions that are used for evaluation of negotiation issues. A difficulty of generating offer is dependent on the number of negotiation issues and the range of the values. Therefore, if any offer has a number of negotiation issues and the range of values are wide, the search space will be exponentially expanded. There have been many studies fur solving this problem, we applied those techniques to improve the agent's ability of negotiation. For example, a contract can be accomplished by exchanging seller and buyer's offer that is generated by agent to adjust the requisite profit for each party. Finally, we show the improvement of satisfaction as the negotiation is processed.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.191-196
• /
• 2007

In the field of computer graphics, Navier-Stokes equations would be used for realistic simulations of smokes and currents. However, implementations derived from these equations are hard to achieve for real-time simulations, mainly due to its massive and complex calculations. Thus, there have been various attempts to approximate these equations for real-time simulation of smokes and others. When the advection terms of the equations are approximated by the Semi-Lagrange methods, the fluid density can be rapidly reduced and small-scale vorticity phenomena are easy to be missed, mainly due to the numerical losses over time. In this paper, we propose an improved numerical method to approximately calculate the advection terms, and thus eliminate these problems. To calculate the advection terms, our method starts to set critical regions around the target grid points. Then, among the grid points in a specific critical region, we search for a grid point which will be advected to the target grid point, and use the velocity of this grid point as its advection vector. This method would reduce the numerical losses in the calculation of densities and vorticity phenomena, and finally can implement more realistic smoke simulations. We also improve the overall efficiency of vector calculations and related operations through GPU-based implementation techniques, and thus finally achieve the real-time simulation.

• Journal of the Korean association of regional geographers
• /
• v.6 no.2
• /
• pp.41-55
• /
• 2000

This study attempts to explore the relationships of Korean Immigrants with New Zealand agricultural environment, their choice of agricultural occupations and adjustments. New Zealand, based on agricultural products in its economy, was one of the richest countries during the 1950s and 1960s because of its dependency in market to United Kingdom Since 1971 when U.K joined the European Community, its economy was no more strong enough to support the living conditions in the 1950's and 1960's. Therefore, New Zealand Government initiated some programme to assist its farmers. Such supports resulted in severe financial problems of the country. Thus, reforms removing almost all support programmes has been proceeded after 1984. Though horticulture is still lower in New Zealand's exports of agricultural products, its growth has been remarkable. This was results due to the contribution of smallholdings, along with migration from city to urban fringe occurred during the 1970's and 1980's. In the 1900's it has been known that horticulture in the smallholding takes a hard works for old ages, who required further partitions their lands. Meanwhile, the rapid growth of Korean immigrants to New Zealand in the 1900's has been occurred, and this study shows one or two years periods in the search of job in case of Korean farmers. The most attractiveness in agriculture for them was that it provides simultaneously both jobs and housing. Korean farmers' land use succeeds previous owner's land use, and concentrates on green house agriculture cultivating mainly tomato and cucumber. The size of land is quite small and not comparable to New Zealand's average size, but a satisfactory levels are rather high and successful in evaluating themselves concerning current occupations, even though they have rarely experienced about agriculture before. Korean farmers attributes a high satisfaction to agricultural techniques learned from previous owners and a related support authority. The results of this study showed that Korean farmers has been absorbed into New Zealand economy rather than Korean economy. Finally, it has been pointed that the growth of Korean farmers and agriculture in New Zealand is the results of complex factors such as occupations, children's educational opportunity, and the access to the city.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.2043-2050
• /
• 2014

As most the scanning systems developed until now provide radiation scan plane images of the inspected objects, there has been a limitation in judging exactly the shape of the objects inside a logistics container exactly with only 2-D radiation image information. As a radiation image is just the density information of the scanned object, the direct application of general stereo image processing techniques is inefficient. So we propose that a new volume-based 3-D reconstruction algorithm. Experimental results show the proposed new volume based reconstruction technique can provide more efficient visualization for X-ray inspection. For validation of the proposed shape reconstruction algorithm using volume, 15 samples were scanned and reconstructed to restore the shape using an X-ray stereo inspection system. Reconstruction results of the objects show a high degree of accuracy compared to the width (2.56%), height (6.15%) and depth (7.12%) of the measured value for a real object respectively. In addition, using a K-Mean clustering algorithm a detection efficiency of 97% is achieved. The results of the reconstructed shape information using the volume based shape reconstruction algorithm provide the depth information of the inspected object with stereo X-ray inspection. Depth information used as an identifier for an automated search is possible and additional studies will proceed to retrieve an X-ray inspection system that can greatly improve the efficiency of an inspection.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.80-90
• /
• 2002

Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.101-112
• /
• 2009

Existing techniques for defragmentation of the file system need intensive disk operation for some periods at specific time such as disk defragmentation program. In this paper, for solving this problem, we design and implement the automatic and continuous defragmentation free system by distributing the disk operation. We propose the Automatic Layout Scoring(ALS) mechanism for measuring defragmentation degree and suggest the Lazy Copy mechanism that copies the defragmented data at idle time for scattering the disk operation. We search the defragmented file by Automatic Layout Scoring mechanism and then find for empty spaces for that searched file. After lazy copy of searched fils to empty space for preventing that file from being lost, the algorithm solves the defragmentation problem by updating the I-node of that file. We implement these algorithms in Linux and evaluate them for small and defragmented file to get the layout scoring. We outperform the Linux EXT2 file system by $2.4%{\sim}10.4%$ in layout scoring evaluation. And the performance of read and write for various file size is better than the EXT2 by $1%{\sim}8.5%$ for write performance and by $1.2%{\sim}7.5%$ for read performance. We suggest this system for solving the problem of defragmentation automatically without disturbing the I/O task and manual management.

• Journal of KIISE:Software and Applications
• /
• v.29 no.7
• /
• pp.476-486
• /
• 2002

CBD(Component Based Development) has become the best strategical method for the business application. Because CBD is a new development paradigm which makes it possible to assemble the software components for application, it copes with the rapid challenge of business process and meets the increasing requirements for productivity. Since the business process is rapidly changing, CBD technology is the promising way to solve the productivity. Especially, the repository is the most important part for the development, distribution and reuse of components. In component repository, we can store and manage the related work-products produced at each step of component development as well as component itself. In this paper, we suggested a practical approach for repository construction to support and realize the CBD process and developed the CRMS(Component Repository Management System) as implementation product of the proposed techniques. CRMS can manage a variety of component products based on component architecture, and help software developers to search a candidate component for their project and to understand a variety of information for the component. In the paper, a practical approach for component repository was suggested, and a supporting environment was constructed to make CBD to be working efficiently. We expect this work wall be valuable research for component repository and the entire supporting Component Based Development Process.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.117-124
• /
• 2006

In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.7
• /
• pp.870-874
• /
• 2018

In the worst maritime accidents, people should abandon ship, but ship structures are narrow and complex and operation takes place on rough seas, so escape is not easy. In particular, passengers on cruise ships are untrained and varied, making evacuation prospects worse. In such a case, the evacuation management of the crew plays a very important role. If a rescuer enters a ship at distress and conducts rescue activities, which zones represent the most effective entry should be examined. Generally, crew and rescuers take the shortest route, but if an accident occurs along the shortest route, it is necessary to select the second-best alternative. To solve this situation, this study aims to calculate evacuation routes using Q-Learning of Reinforcement Learning, which is a machine learning technique. Reinforcement learning is one of the most important functions of artificial intelligence and is currently used in many fields. Most evacuation analysis programs developed so far use the shortest path search method. For this reason, this study explored optimal paths using reinforcement learning. In the future, machine learning techniques will be applicable to various marine-related industries for such purposes as the selection of optimal routes for autonomous vessels and risk avoidance.

• Journal of Life Science
• /
• v.29 no.5
• /
• pp.621-630
• /
• 2019

Fertilization is the beginning of a new life that occurs in the female uterine. The female reproductive tract is composed ovary, oviduct, uterine, vagina and cervix, their physiological features are regulated by estrous cycle. Of these, uterine is a main point to establish embryo development and implantation, and intercommunication between embryo and uterine environment is necessary for suitable pregnancy. Endometrium is part of the uterine, its morphology is repetitively changed by hormones, and characteristic of uterine fluid from endometrium is also changed. Recently, massive proteins of endometrium and uterine fluid can be detected according to develop proteomics and bioinformatics and have been accelerated the understanding of the reproductive biology fields. Moreover, the massive protein information is actively studying with deeply studied theory such as sex hormone signal pathway and angiogenesis in mammals. In this paper, we review understanding of endometrium remodeling, uterine gland and fluid during estrous cycle, additionally studies on endometrium and uterine fluid based on proteomics techniques. Lastly, we introduced methods of the protein-protein correlation using bioinformatics tool that interaction with hormone receptors, representative angiogenetic factors and detected proteins using proteomics in endometrium and uterine fluid. This review will be useful to understanding the study on search of new cell mechanism in endometrium and uterine fluid.