• The Journal of Society for e-Business Studies
• /
• v.8 no.1
• /
• pp.55-70
• /
• 2003

With the gradual growth of the electronic commerce various forms of shopping malls are constructed, and their searching methods and function are studied many ways. However, the recent outcome is still inadequate to search for goods for the tastes and demands of customers. To construct the shopping mall on the electronic commerce and help customers with purchasing goods, the efficient interface for the customers to contact the shopping malls should be founded and the customers should be able to search the goods they want. Therefore, in this paper, we designed the Intelligent Integration Agent System (IIAS) using the multi-agent formed by the integration agent which integrates the case based reasoning(CBR) and the rule based reasoning(RBR) and the user agent which manages users' profiles. IIAS performs the rule based reasoning on the subject issue first, then provides the unsatisfying search results from the rule-base reasoning to the customers through the user agent, which enables the search of the goods most similar to the ones that meet the tastes and demands of the customers. That is, the accuracy and the speed has been improved by reasoning with the similarity adjustable integration agent which can pick out the goods of customers wants by modifying the weights of properties according to those of the customers.

• Structural Engineering and Mechanics
• /
• v.45 no.1
• /
• pp.111-127
• /
• 2013

In this paper, a new version of gravitational search algorithm based on opposition-based learning (OBGSA) is introduced and applied for optimum design of reinforced concrete retaining walls. The new algorithm employs the opposition-based learning concept to generate initial population and updating agents' position during the optimization process. This algorithm is applied to minimize three objective functions include weight, cost and $CO_2$ emissions of retaining structure subjected to geotechnical and structural requirements. The optimization problem involves five geometric variables and three variables for reinforcement setups. The performance comparison of the new OBGSA and classical GSA algorithms on a suite of five well-known benchmark functions illustrate a faster convergence speed and better search ability of OBGSA for numerical optimization. In addition, the reliability and efficiency of the proposed algorithm for optimization of retaining structures are investigated by considering two design examples of retaining walls. The numerical experiments demonstrate that the new algorithm has high viability, accuracy and stability and significantly outperforms the original algorithm and some other methods in the literature.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.131-136
• /
• 1990

In this paper, new methods are proposed which speed up the logical redundancy identification for the gate-level logic optimization. Redundancy indentification, as well as deterministic test pattern generation, can be viewed as a finite space search problem, of which execution time depends on the size of the search space. For the purpose of efficient search, we propose dynamic head line and mandatory assignment. Dynamic head lines are changed dynamically in the process of the redundancy identification. Mandatory assignement can avoid unnecessary assignment. They can reduce the search size efficiently. Especially they can be used even though the circuit is modified in the optimization procedure, that is different from the test pattern generation methods. Some experimental results are presented indicating that the proposed methods are faster than existing methods.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.12 no.6
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

• Bioinformatics and Biosystems
• /
• v.2 no.2
• /
• pp.46-51
• /
• 2007

In the proteomics research using mass spectrometry, the protein database search gives the protein information from the peptide sequences that show the best match with the tandem mass spectra. The protein sequence database has been a powerful knowledgebase for this protein identification. However, as we accumulate the protein sequence information in the database, the database size gets to be huge. Now it becomes hard to consider all the protein sequences in the database search because it consumes much computing time. For the high-throughput analysis of the proteome, usually we have used the non-redundant refined database such as IPI human database of European Bioinformatics Institute. While the non-redundant database can supply the search result in high speed, it misses the variation of the protein sequences. In this study, we have concerned the proteomics data in the point of protein similarities and used the network analysis tool to build a new analysis method. This method will be able to save the computing time for the database search and keep the sequence variation to catch the modified peptides.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1732-1743
• /
• 2000

In this paper a fixed-delay trellis search with decision feedback (FDTrS/DF) for high-density DVD systems (4.7-15GB) is proposed and implemented with FPGA. The proposed FDTrS/DF is derived by transforming the binary tree search structure into trellis search structure implying that FDTrS/DF performs better than the singnal detection techniques based on tree search structure such as FDTS/DF and SSD/DF. Advantages of FDTrS/DF are significant reductions in hardware complexity due to the unique structure of FDTrS composed of only one trellis stage requiring no traceback procedure usually implemented in the Viterbi detector. Also in this paper the PDFS/DF and SSD/DF orginally proposed for high-density magnetic recording systems are modified for the DVD system and compared with the proposed FDTrS/DF. In order to increase speed in the FPGA implementation the pipelining technique and absolute branch metric (instead of square branch metric) are applied. The proposed FDTrS/DF is shown to provide the best performance among various signal detection techniques such as PRML, DFE, FDTS/DF and SSD/DF even with a small hardware complexity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.442-446
• /
• 2010

In this paper we propose an indexing method supporting the browsing scheme for effective image search on large photo database. The proposed method is based on M-tree, a representative indexing scheme on matrix space. While M-tree focuses on the searching efficiency by pruning, it did not consider browsing efficiency directly. This paper proposes node selection method, node splitting method and node splitting conditions for browsing efficiency. According to test results, node cohesion and clustering precision improved 1.5 and twice the original respectively and searching speed also increased twice the original speed.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.241-245
• /
• 1989

A knowledge based expert system is a computer program that emulates the reasoning process of a human expert in a specific problem domain. This paper presents an expert system to diagnose the various faults in power system. The developed expert system is represented considering two points; the possibility of solution and the fast processing speed. As uncertainties exist in the facts and rules which comprise the knowledge base of the expert system, Certainty Factor, which is based on the confirmation theory is used for the inexact reasoning. Also, as the diagnosis problem requires the inductive reasoning process in nature, the solution is imperfect and not unique in general. So the expert system is designed to generate all the possible hypothesis in order of the possibility and also it can explain the propagation procedure of the faults for each solution using the built in backtracking mechanism. In realization of the expert system, the processing speed is greatly dependent upon the problem representation, reasoning scheme and search strategy. So, in this paper the fault diagnosis problem itself is analysed from the view point of Artificial Intelligence and as a result, the expert system has the following basic features. 1) The certainty factor is adopted in the inference engine for inexact reasoning. 2) Problem apace is represented using the problem reduction technique. 3) Bidirectional reasoning scheme is used. 4) Best first search strategy is adopted for rapid processing. The expert system was developed us ing PROLOG language.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.2
• /
• pp.53-59
• /
• 2015

Since the amount of digital image continues to grow in usage, users feel increased difficulty in finding specific images from the image collection. This paper proposes a novel image searching scheme that extracts the image feature using combination of Advanced SURF (Speed-Up Robust Feature) and DCD (Dominant Color Descriptor). The key point of this research is to provide a new feature extraction algorithm to improve the existing SURF method with removal of unnecessary feature in image retrieval, which can be adaptable to mobile system and efficiently run on the mobile environments. To evaluate the proposed scheme, we assessed the performance of simulation in term of average precision and F-score on two databases, commonly used in the field of image retrieval. The experimental results revealed that the proposed algorithm exhibited a significant improvement of over 14.4% in retrieval effectiveness, compared to OpenSURF. The main contribution of this paper is that the proposed approach achieves high accuracy and stability by using ASURF and DCD in searching for natural image on mobile platform.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.186-186
• /
• 2000

In the GPS/DR integrated system, the GPS position(or velocity) is used to compensate the DR output and to calibrate errors in the DR sensor. This synergistic relationship ensures that the calibrated DR accuracy can be maintained even when the GPS signal is blocked. Because of the observability problem, however, the DR sensors are not sufficiently calibrated when the vehicle speed is low. This problem can be solved if we use a multi-antenna GPS receiver for attitude determination instead of conventional one. This paper designs a two-antenna GPS receiver integrated with DR sensors. The proposed integration system has three remarkable features. First, the DR sensor can be calibrated regardless of the vehicle speed with the aid of two-antenna GPS receiver. Secondly, the search space of integer ambiguities in GPS carrier-phase measurements is reduced to a part of the surface of the sphere using DR heading. Thirdly, the detection resolution of cycle-slips in GPS carrier-phase measurements is improved with the aid of DR heading. From the experimental result, it is shown that the search grace is drastically reduced to about 3120 of the non-aided case and the cycle-slips of 1 or half cycle can be detected.