• Archives of Pharmacal Research
• /
• v.21 no.5
• /
• pp.599-609
• /
• 1998

In search for new antitumor agents, twelve 6-aziridinylbenzimidazole derivatives were synthesized and their cytotoxicities were tested against three cancer cell lines (mouse lymphocytic leukemia P388 and B16, and human gastric carcinoma SNU-16). From 4-amino-3-nitrotoluene as the starting material, 2-(acetoxymethyl)benzimidazoles (5a-d) were obtained by Phillips reaction. These benzimidazoles were then reacted with Fremy's salt to give a mixture of three 2-(acetoxymethyl) (8a-c) and four 2-(hydroxymethyl)benzimidazole-4,7-diones (9a-d). Addition of these quinones with aziridine afforded 6-aziridinyl-2-(acetoxymethyl) (10a-c) and 6-aziridinyl-2-(hydroxymethyl)benzimidazole-4,7-diones (11a-d). Utilizing 2-(hydroxymethyl)benzimidazole-4,7-diones (9b,d), esters 10d and 13e-h were prepared by the sequential reactions of esterification and addition. The synthesized compounds show potent cytotoxicity against all of three cell lines tested. The cytotoxicities of 10a-d or 11a-d against SNU-16 were wuperior to those of 13e-h, and were equal to or slightly higher than that of mitomycin C. compounds 11a-d were slightly more cytotoxic than 10a-d in all cell lines tested.

• Journal of the Society of Naval Architects of Korea
• /
• v.34 no.1
• /
• pp.93-101
• /
• 1997

Generally the traditional optimization methods have possibilities not only to give a different optimum value according to their starting point, but also to get to local optima. On the other hand, Genetic Algorithm (GA) has an ability of robust global search. In this paper, a new optimization method - the combination of traditional optimization method and genetic algorithm - is presented so as to overcome the above disadvantage of traditional methods. In order to increase the efficiency of the hybrid optimization method, a knowledge-based reasoning is adopted in the part of mathematical modeling, algorithm selection, and process control. The validation of the developed knowledge-based hybrid optimization method was examined and verified applying the method to nonlinear mathematical models.

• Journal of Korean Society of societal Security
• /
• v.4 no.1
• /
• pp.49-55
• /
• 2011

The primary objective of this paper is to develop optimal algorithms of reinforced concrete frame structural systems by the limit state design(CP 1110) and to look into the possibility of detailed design of these structural systems. The structural formulation is derived on the finite element method. The objective of optimization of a reinforced structure for a specified geometry is mainly to determine the optimum cross-sectional dimensions of concrete and the area of the various sizes of the reinforcement required for each member. In addition to the detail s such as the amount of web reinforcement, cutoff points of longitudinal reinforcedments etc. are also considered as design variables. In this study, the method of "Generalized Reduced Gradient, Rounding and with Neighborhood search" and "the Sequential Linear Programming" are employed as an analytical method of nonlinear optimization.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3469-3476
• /
• 1999

In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.923-928
• /
• 1993

Genetic algorithms are powerful optimization methods based on the mechanism of natural genetics and natural selection. Genetic algorithms reduce chance of searching local optima unlike most conventional search algorithms and especially show good performances in complex nonlinear optimization problems because they do not require any information except objective function value. This paper presents a new model based on sexual reproduction in nature. In the proposed Sexual Reproduction model(SR model), individuals consist of the diploid of chromosomes, which are artificially coded as binary string in computer program. The meiosis is modeled to produce the sexual cell(gamete). In the artificial meiosis, crossover between homologous chromosomes plays an essential role for exchanging genetic informations. We apply proposed SR model to optimization of the design parameters of Single-sided Linear Induction Motor(SLIM). Sequential Unconstrained Minimization Technique(SUMT) is used to transform the nonlinear optimization problem with many constraints of SLIM to a simple unconstrained problem, We perform optimal design of SLIM available to FA conveyer systems and discuss its results.

• Journal of Korean Society for Quality Management
• /
• v.47 no.3
• /
• pp.523-535
• /
• 2019

Purpose: We research on the efficient response surface methodology(RSM) design to develop a design space in Quality by Design(QbD). We propose practical designs for the successful construction of the design space in QbD by allowing different number of replicates at the box points, star points, and the center point in the rotatable central composite design(CCD). Methods: The fraction of design space(FDS) plot is used to compare designs efficiency. The FDS plot shows the fraction of the design space over which the relative standard error of predicted mean response lies below a given value. We search for practical designs whose minimal half-width of the tolerance interval per a standard deviation is less than 4.5 at 0.8 fraction of the design space. Results: The practical designs for the number of factors between two and five are listed. One of the designs in the list could be chosen depending on the experimental budget restriction. Conclusion: The designs with box points replications are more efficient than those with the star points replication. The sequential method to establish a design space is illustrated with the simulated data based on the two examples in RSM.

• Psychiatry investigation
• /
• v.15 no.12
• /
• pp.1121-1129
• /
• 2018

Objective Categorical syndrome such as schizophrenia could be the complex of many continuous mental structure phenotypes including several personality development/degeneration dimensions. This is the study to search heritability and familiality of MMPI personality dimensions in the Korean schizophrenic LD (Linkage Disequilibrium) families. Methods We have recruited 204 probands (with schizophrenia) with their parents and siblings whenever possible. We have used MMPI questionnaires for measuring personality and symptomatic dimensions. Heritabilities of personality dimensions in total 543 family members were estimated using Sequential Oligogenic Linkage Analysis Routines (SOLAR). Personality dimensions in total family members were compared with those in 307 healthy unrelated controls for measuring the familialities using ANOVA analysis. Results Seven of the 10 MMPI variables were significantly heritable and were included in the subsequent analyses. The three groups (control, unaffected 1st degree relative, case) were found to be significantly different with the expected order of average group scores for all heritable dimensions. Conclusion Our results show that the aberrations in several personality dimensions could form the complexity of schizophrenic syndrome as a result of genetic-environment coactions or interactions in spite of some limitations (recruited family, phenotyping).

• Journal of the HCI Society of Korea
• /
• v.11 no.3
• /
• pp.5-12
• /
• 2016

The number of visually-impaired people using a smartphone is currently increasing with the help Text-to-Speech(TTS). TTS converts text data in a mobile application into sound data, and it only allows sequential search. For this reason, the location of buttons and contents inside an application should be determined carefully. However, little attention has been made on TTS service environment during the development of mobile newspaper application. This makes visually-impaired people difficult to use these applications. Furthermore, a mobile application interface which also reflects the desire of the low vision is necessary. Therefore, this paper presents a mobile newspaper interface which considers the accessibility and the desire of various visually impaired people. To this end, the proposed interface locates buttons with the consideration of TTS service environment and provides search functionality. The proposed interface also enables visually impaired people to use the application smoothly by filtering out the words that are pronounced improperly and providing the proper explanation for every button. Finally, several functionalities such as increasing font size and color reversal are implemented for the low vision. Simulation results show that the proposed interface achieves better performance than other applications in terms of search speed and usability.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1166-1176
• /
• 1999

연속 매체, 특히 비디오 데이타에 대한 일반 사용자 연산에는 재생뿐만 아니라 임의 속도 탐색 연산, 정지 연산, 그리고 그 외 다양한 연산이 있다. 이 연산 중에서 원하는 화면을 빨리 찾는 데에 유용한 고속 전진(FF: fast-forward)과 고속 후진(FB: fast-backward)은 재생 연산과는 달리 비순차적인 디스크 접근을 요구한다. 이러한 경우에 디스크 부하가 균등하지 않으면 일부 디스크에 접근이 편중되어 서비스 품질이 떨어진다. 본 논문에서는 디스크 배열을 이용한 저장 시스템에서 디스크 접근을 고르게 분산시키기 위하여 '소수 라운드 로빈(PRR: Prime Round Robin)' 방식으로 연속 매체를 디스크에 배치하는 기법에서 문제가 됐던 낭비된 디스크 저장 공간을 신뢰도 향상을 위해서 사용하는 '그룹화된 패리티를 갖는 소수 라운드 로빈(PRRgp: PRR with Grouped Parities)' 방식을 제안한다. 이 기법은 PRR 기법처럼 임의 속도 검색 연산에 있어서 디스크 배열을 구성하는 모든 디스크의 부하를 균등하게 할뿐만 아니라 낭비됐던 디스크 저장 공간에 신뢰도를 높이기 위한 패리티 정보를 저장함으로서 신뢰도를 향상시킬 수 있다. 신뢰도 모델링 방법으로 조합 모델과 마르코프 모델을 이용해서 결함발생율과 결함복구율을 고려한 신뢰도를 산출하고 비교.분석한다. PRR 기법으로 연속 매체를 저장하고 낭비되는 공간에 패리티 정보를 저장할 경우에 동시에 두 개 이상의 결함 발생 시에 그 결함으로부터 복구가 불가능하지만 PRRgp 기법에서는 약 30% 이상의경우에 대해서 동시에 두 개의 결함 발생 시에 저장한 패리티 정보를 이용한 복구가 가능할 뿐만 아니라 패리티 그룹의 수가 두 개 이상인 경우에는 두 개 이상의 결함에 대해서도 복구가 가능하다.Abstract End-user operations on continuous media (say video data) consist of arbitrary-rate search, pause, and others as well as normal-rate play. FF(fast-forward) / FB(fast-backward) among those operations are desirable to find out the scene of interest but they require non-sequential access of disks. When accesses are clustered to several disks without considering load balance, high quality services in playback may not be available. In this paper, we propose a new disk placement scheme, called PRRgp(Prime Round Robin with Grouped Parities), with enhanced reliability by using the wasted disk storage space in an old one(PRR: Prime Round Robin), in which continuous media are placed on a disk array based storage systems to distribute disk accesses uniformly. The PRRgp can not only achieve load balance of disks consisting of a disk array under arbitrary-rate search like PRR, but also improve reliability by storing parity information on the wasted disk space appropriately. We use combinatorial and Markov models to evaluate the reliability for a disk array and to analyze the results. When continuous media like PRR are placed and parity information on the wasted disk space is stored, we cannot tolerate more than two simultaneous faults. But they can be recovered by using stored parity information for about 30 percent as a whole in case of PRRgp presented in this paper. In addition, more than two faults can be tolerated in case there are more than two parity groups.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.