• Title/Summary/Keyword: CSP Technique

Search Result 30, Processing Time 0.026 seconds

Protein-ligand interaction investigated by HSQC titration study

  • Lee, Joon-Hwa
    • Journal of the Korean Magnetic Resonance Society
    • /
    • v.22 no.4
    • /
    • pp.125-131
    • /
    • 2018
  • Chemical shift perturbation (CSP) is a simple NMR technique for studying binding of a protein to various ligands. CSP is the only technique that can directly provide both a value for the dissociation constant and a binding site from the same set of measurements. To accurately analyze the CSP data, the exact binding mode such as multiple binding, should be carefully considered. In this review, we analyzed systematically the CSP data with multiple modes. This analysis might provide insight into the mechanism on how proteins selectively recognize their target ligands to achieve the biological function.

Locomotive Scheduling Using Constraint Satisfaction Problems Programming Technique

  • Hwang, Jong-Gyu;Lee, Jong-Woo;Park, Yong-Jin
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.4B no.1
    • /
    • pp.29-35
    • /
    • 2004
  • Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

Constraints satisfaction problem기법을 이용한 조종패널 설계방법

  • 박성준;조항준;정의승;장수영
    • Proceedings of the ESK Conference
    • /
    • 1994.04a
    • /
    • pp.75-84
    • /
    • 1994
  • A control panel layout method based on the constraint satisfaction problem(CSP) technique was developed to generate an ergonomically sound panel design. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constrains, and generate an optimal or, at least, a "satisfactory" solution through the efficient search algorithm. The problem of seeking an ergonomically sound panel design should be viewed as a multiple criteria problem, and most of the design objectives should be understood as constraints. Hence, a CSP technique was employed in this study for dealing with the multi-constraiants layout problem. The efficient search algorithm using "preprocess" and "look ahead" procedures was developed to handle the vast amount of computational effort. In order to apply the CSP technique to the panel layout procedure, the ergonomic principles such as spatial compatibility, frequency-of- use, importance, functional grouping, and sequence-of-use were formalized as CSP terms. The effectiveness of the developed panel layout method was evaluated by example problems, and the results clearly showed that the generated layouts took various ergonomic design principles into account.esign principles into account.

  • PDF

Interactive Control Panel Layout Using a Constraint Satisfaction Algorithm (제약만족 알고리즘을 이용한 상호대화적 조종패널 배치)

  • Park, Sung-Joon;Jeong, Eui-S.;Chang, Soo-Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.85-97
    • /
    • 1994
  • An interactive and iterative control panel layout method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound panel design. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constraints, and generate an optimal or, at least, a "satisfactory" solution through an efficient search algorithm. The problem of seeking an ergonomically sound panel design should be viewed as a multi-criteria design problem and most of the design objectives should be understood as constraints. Hence, a CSP technique was employed in this study for dealing with the multi-constraints layout problem. The efficient search algorithm using "preprocess" and "look_ahead" procedures was developed to handle vast amount of computation. In order to apply the CSP technique to the panel layout procedure, the ergonomic principles such as spatial compatibility, frequency-of-use, importance, functional grouping, and sequence-of-use were formalized as CSP terms. The effectiveness of the proposed panel layout method was evaluated by example problems and the results clearly showed that the generated layouts properly considered various ergonomic design principles.

  • PDF

Development of Fully Integrated Broadband MMIC Chip Set Employing CSP(Chip Size Package) for K/Ka Band Applications (CSP(Chip Size Package)를 이용한 완전집적화 K/Ka 밴드 광대역 MMIC Chip Set 개발)

  • Yun Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.1 s.92
    • /
    • pp.102-112
    • /
    • 2005
  • In this work, we developed fully integrated broadband MMIC chip set employing CSP(Chip Size Package) for K/Ka band applications. By utilizing an ACF for the RF-CSP, the fabrication process for the packaged amplifier MMIC could be simplified and made cost effective. $STO(SrTi_{3})$ capacitors were employed to integrate the DC biasing components on the MMIC, and LC parallel circuits were employed for DC feed and ESD protection. A pre-matching technique and RC parallel circuit were used to achieve a broadband matching and good stability fer the amplifier MMIC in K/Ka band. The amplifier CSP MMIC exhibited good RF performance over a wide frequency range in K/Ka band. This work is the first report of a fully integrated CSP amplifier MMIC successfully operating in the K/Ka band.

A Fully-integrated Ku/K Broadband Amplifier MMIC Employing a Novel Chip Size Package (새로운 형태의 CSP를 이용한 완전 집적화 Ku/K밴드 광대역 증폭기 MMIC)

  • Yun, Young
    • Journal of Navigation and Port Research
    • /
    • v.27 no.2
    • /
    • pp.217-221
    • /
    • 2003
  • In this work, we used a novel RF-CSP to develop a broadband amplifier MMIC, including all the matching and biasing components, for Ku and K band applications. By utilizing an ACF for the RF-CSP, the fabrication process for the packaged amplifier MMIC could be simplified and made cost effective. STO (SrTiO$_3$) capacitors were employed to integrate the DC biasing components on the MMIC. A pre-matching technique was used for the gate input and drain output of the FETs to achieve a broadband design for the amplifier MMIC. The amplifier CSP MMIC exhibited good RF performance (Gain of 12.5$\pm$1.5 dB, return loss less than -6 dB, PldB of 18.5$\pm$1.5 dBm) over a wide frequency range. This work is the first report of a fully integrated CSP amplifier MMIC successfully operating in the Ku/K band.

Network Enlarging Search Technique (NEST) for the Crew Scheduling Problem

  • Paek, Gwan-Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.2
    • /
    • pp.177-198
    • /
    • 1994
  • We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

  • PDF

Optimal Brokerage Model using CSP Technique in Agent-Based Electronic Commerce (에이전트 기반 전자상거래에서 제약만족 기법을 이용한 최적의 중개 모델)

  • Jeong, Jong-Jin;Kim, Ji-Yeon;Jo, Geun-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5S
    • /
    • pp.1687-1695
    • /
    • 2000
  • Recently, many researchers have tried to establish EC framework EC framework for automated contract and brokerage using agent technologies in electronic commerce. Traditional researches, however, often enforced the user's participations during the automated brokerage process of agents an did not supported the procedures and methodologies for satisfying various user's requirements. In this paper, we propose a brokerge framework based on multi-agent to overcome the defects of the previous researches. For the optimal brokerage, the proposed framework is divided into tow layers, which are called competition layer and constraint satisfaction layer. The Agents process behaviors of brokerage through two layers accroding to th proposed message driven communication protocol. W also apply CSP (Constraint Satisfaction Problems) techniques to brokerage process to satisfy various preferential requirements from the user. That is, e model the relationship between buyer agents and seller agents using CSP and propose efficient CSP models for the optimal brokerage as the types of brokerage. Finally, e implemented prototype systems applying the proposed framework and showed the efficiency of he proposed framwork with the experimental results.

  • PDF

APPLICATION OF THE CONSTRAINT SATISFACTION APPROACH TO GENERAL LAYOUT PROBLEMS (일반 배치문제 해결을 위한 제약만족기법의 적용)

  • Park, Sung-Joon;Jung, Eui-S.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.4
    • /
    • pp.539-550
    • /
    • 1998
  • A computerized layout system based on a constraint satisfaction problem (CSP) technique was developed to treat both facility layout and instrument panel layout problems. This layout system attempts to allocate various facilities under multiple layout criteria including qualitative design objectives. Since most of the design objectives can be understood as constraints which the layout solution must satisfy to improve the goodness of the solution, a CSP technique was employed to solve the multi-constraints layout problem. The effectiveness of the system was evaluated by the comparison with the well-known facility layout program, CORELAP. Furthermore, the proposed system can also be applied to the instrument panel layout problem successfully. Several user-centered guidelines were well reflected on the solution obtained. CONSLAY, the prototype layout system being developed in the research, greatly enhanced the interactions with the designer so as to deal with the problem-dependent nature of the layout problem and to properly reflect the domain-specific knowledge of the designer.

  • PDF

Filter Selection Method Using CSP and LDA for Filter-bank based BCI Systems (필터 뱅크 기반 BCI 시스템을 위한 CSP와 LDA를 이용한 필터 선택 방법)

  • Park, Geun-Ho;Lee, Yu-Ri;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.197-206
    • /
    • 2014
  • Motor imagery based Brain-computer Interface(BCI), which has recently attracted attention, is the technique for decoding the user's voluntary motor intention using Electroencephalography(EEG). For classifying the motor imagery, event-related desynchronization(ERD), which is the phenomenon of EEG voltage drop at sensorimotor area in ${\mu}$-band(8-13Hz), has been generally used but this method are not free from the performance degradation of the BCI system because EEG has low spatial resolution and shows different ERD-appearing band according to users. Common spatial pattern(CSP) was proposed to solve the low spatial resolution problem but it has a disadvantage of being very sensitive to frequency-band selection. Discriminative filter bank common spatial pattern(DFBCSP) tried to solve the frequency-band selection problem by using the Fisher ratio of the averaged EEG signal power and establishing discriminative filter bank(DFB) which only includes the feature frequency-band. However, we found that DFB might not include the proper filters showing the spatial pattern of ERD. To solve this problem, we apply a band-selection process using CSP feature vectors and linear discriminant analysis to DFBCSP instead of the averaged EEG signal power. The filter selection results and the classification accuracies of the existing and the proposed methods show that the CSP feature is more effective than signal power feature.