• Title/Summary/Keyword: Structure search

Search Result 1,462, Processing Time 0.03 seconds

Optimization of fuzzy controller for nonlinear buildings with improved charged system search

  • Azizi, Mahdi;Ghasemi, Seyyed Arash Mousavi;Ejlali, Reza Goli;Talatahari, Siamak
    • Structural Engineering and Mechanics
    • /
    • v.76 no.6
    • /
    • pp.781-797
    • /
    • 2020
  • In recent years, there is an increasing interest to optimize the fuzzy logic controller with different methods. This paper focuses on the optimization of a fuzzy logic controller applied to a seismically excited nonlinear building. In most cases, this problem is formulated based on the linear behavior of the structure, however in this paper, four sets of objective functions are considered with respect to the nonlinear responses of the structure as the peak interstory drift ratio, the peak level acceleration, the ductility factor and the maximum control force. The Improved Charged System Search is used to optimize the membership functions and the rule base of the fuzzy controller. The obtained results of the optimized and the non-optimized fuzzy controllers are compared to the uncontrolled responses of the structure. Also, the performance of the utilized method is compared with various classical and advanced optimization algorithms.

Solving the Constrained Job Sequencing Problem using Candidate Order based Tabu Search (후보순위 기반 타부 서치를 이용한 제약 조건을 갖는 작업 순서결정 문제 풀이)

  • Jeong, Sung-Wook;Kim, Jun-Woo
    • The Journal of Information Systems
    • /
    • v.25 no.1
    • /
    • pp.159-182
    • /
    • 2016
  • Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

Combining Faceted Classification and Concept Search: A Pilot Study

  • Yang, Kiduk
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.48 no.4
    • /
    • pp.5-23
    • /
    • 2014
  • This study reports the first step in the Classification-based Search and Knowledge Discovery (CSKD) project, which aims to combine information organization and retrieval approaches for building digital library applications. In this study, we explored the generation and application of a faceted vocabulary as a potential mechanism to enhance knowledge discovery. The faceted vocabulary construction process revealed some heuristics that can be refined in follow-up studies to further automate the creation of faceted classification structure, while our concept search application demonstrated the utility and potential of integrating classification-based approach with retrieval-based approach. Integration of text- and classification-based methods as outlined in this paper combines the strengths of two vastly different approaches to information discovery by constructing and utilizing a flexible information organization scheme from an existing classification structure.

Design of IG-based Fuzzy Models Using Improved Space Search Algorithm (개선된 공간 탐색 알고리즘을 이용한 정보입자 기반 퍼지모델 설계)

  • Oh, Sung-Kwun;Kim, Hyun-Ki
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.686-691
    • /
    • 2011
  • This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

Temporal Data Migration Strategies by Time Granularity and LST-GET (시간단위와 LST-GET에 의한 시간지원 데이터의 이동 기법)

  • 윤홍원;김경석
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.1
    • /
    • pp.9-21
    • /
    • 1999
  • This paper presents the time-segmented storage structure in order to increment search performance and the two data migration strategies: migration by Time Granularity and migration by LST-GET. In the migration strategy by Time Granularity, we describe how to assign entity version to the past, current segment, and future segments. We also describe searching and moving processes for data validity at a granularity level. In the migration strategy by LST-GET, we describe how to computer the value of dividing criterion. We simulate the search performance of the proposed segmented storage structure in comparison with the conventional storage structure in comparison with the conventional storage structure in relational database system. Finally, extensive simulation studies are performed in order to compare the search performance of the migration strategies with the time-segmented storage structure.

  • PDF

An Expert System for the Real-Time Computer Control of the Large-Scale System (대규모 시스템의 실시간 컴퓨터 제어를 위한 전문가 시스템)

  • Ko, Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.6
    • /
    • pp.781-788
    • /
    • 1999
  • In this paper, an expert system is proposed, which can be effectively applied to the large-scale systems with the diversity time constraints, the objectives and the unfixed system structure. The inference scheme of the expert system have the integrated structure composed of the intuitive inference module and logical inference module in order to support effectively the operating constraints of system. The intuitive inference module is designed using the pattern matching or pattern recognition method in order to search a same or similar pattern under the fixed system structure. On the other hand, the logical inference module is designed as the structure with the multiple inference mode based on the heuristic search method in order to determine the optimal or near optimal control strategies satisfing the time constraints for system events under the unfixed system structure, and in order to use as knowledge generator. Here, inference mode consists of the best-first, the local-minimum tree, the breadth-iterative, the limited search width/time method. Finally, the application results for large-scale distribution SCADA system proves that the inference scheme of the expert system is very effective for the large-scale system. The expert system is implemented in C language for the dynamic mamory allocation method, database interface, compatability.

  • PDF

Use of Molecular Replacement to Determine the Phases of Crystal Structure of Taq DNA Polymerase

  • Kim, Young-Soo;Suh, Se-Won
    • BMB Reports
    • /
    • v.29 no.1
    • /
    • pp.38-44
    • /
    • 1996
  • Taq DNA polymerase from Thermus aquaticus has been shown to be very useful in the polymerase chain reaction method, which is being used for amplifying DNA. Not only does Taq DNA polymerase have high commercial value commercial value for the polymerase chain reaction application, but it is also important in studying DNA replication, because it is apparently an homologue to E. coli DNA polymerase I, which has long been used for DNA replication study (Lawyer et ai., 1993). The crystal structure determination of Taq DNA polymerase was initiated. An X-ray diffraction pattern breaks down a crystal structure into discrete sine waves in a Fourier series. The original shape of a crystal object in terms of electron density may be represented as the sum of those sine waves with varying amplitudes and phases in three dimensions. The molecular replacement method was initially employed to provide phase information for the structure of Taq DNA polymerase. The rotation search using the program MERLOT resulted in a solution peak with 5.4 r.m.s. PC-refinement of the X-PLOR program verified the result and also optimized the orientation angles. Next, the translation search using the X-PLOR program resulted in a unique solution peak with 7.35 r.m.s. In addition, the translation search indicated $P3_121$ to be the true space group out of two possible ones. The phase information from the molecular replacement was useful in the MIR phasing experiment.

  • PDF

Revealing Hidden Relations between Query-Words for an Efficient Inducing User's Intention of an Information Search (효율적 검색의도 파악을 위한 쿼리 단어 가시화에 관한 연구)

  • Kwon, Soon-Jin;Hong, Chul-Eui;Kim, Won-Il
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.2
    • /
    • pp.44-52
    • /
    • 2012
  • This paper proposes to increase an efficiency of somebody searching information by a visualization of an unseen query words with well-selected user's intent structures. If a search engine identifies user's intent to pursue information, it would be an effective search engine. To do so, it is needed that relationships between query-words are to be visible after recovering words lost during formulated, and that an intention structure/elements is to be established. This paper will review previous studies, after then, define a simple structure of the search intent, and show a process to expand and to generate the query words appropriate to the intent structure with a method for the visualization of the query words. In this process, some examples and tests are necessary that one of the multiple intent structured layers is to assign to a range of query-words. Increasing/Decreasing an efficiency are analyzed to find. Future research is needed how to automate a process to extend structural nodules of user's intent.

Method for improving search efficiency using relation of anatomical structure from Donguibogam(東醫寶鑑) ("동의보감"에 기재된 인체 용어 관계를 이용한 검색효율성 향상 방법)

  • Song, In-Woo;Lee, Byung-Wook
    • Journal of Korean Medical classics
    • /
    • v.25 no.4
    • /
    • pp.105-113
    • /
    • 2012
  • Objectives : Acquiring information from symptoms is one of the important method to gain clinically available information in korean medicine. Therefore, up to now, study of symptom terms was frequently implemented in promotion of various information project. In data extraction methods using symptom information from DB, information search using synonym and method using ontology is studied and utilized. However, considering concept of symptom has essential information of appeared body area and phenomenon we think that extending synonym and ontology relationship in symptom terms can be useful for search and set to this study. Methods : We collect terms relevant to human body area and structure described in Donguibogam. Synonymous relationship between collected terms is organized. Relationship between collected terms is build to human-body-knowledge table which has form of Concept+Relation+Concept. Type of relationship is limited on a range of expressing content about parts of human body. Result & Conclusion : Search condition is generated automatically using relationship of the upper area in knowledge table contents. Information of next and previous acupuncture point, upper and lower acupuncture point, left and right acupuncture point can be searched using information of acupuncture point location, order, relative position in area, direction in knowledge table contents.

A study on Cross-Platform Search Pattern (크로스 플랫폼에서의 탐색 패턴 연구)

  • Kim, Hwoi-Kwang;Park, Chan-Ik
    • Journal of Digital Convergence
    • /
    • v.16 no.4
    • /
    • pp.321-327
    • /
    • 2018
  • Applications have evolved with the evolution of smartphones, and the search structure is changing as well. In this study, we searched through various cases of cross platform and found out the search pattern and suggested correct usage method accordingly. As a result, the search structure for cross platform can be divided into persistent navigation, temporary navigation, and auxiliary navigation. Persistent navigation is available in a hierarchical structure using springboards, lists, galleries, and top menus. Temporary navigation can take advantage of drawers, toggle menus, and pie menus, while secondary navigation can provide the same experience across platforms using an accordion menu or scrolling.