• Title/Summary/Keyword: Model sequencing

Search Result 286, Processing Time 0.026 seconds

Heuristic for the Simultaneous Target Allocation and Fire Sequencing Problem (표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법)

  • Kim, Dong-Hyun;Lee, Young-Hoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.35 no.1
    • /
    • pp.47-65
    • /
    • 2010
  • In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

A Bicriterion Scheduling Problems with Time/Cost Trade-offs (시간/비용의 트레이드-오프를 고려한 2목적 스케쥴링 문제)

  • 정용식;강동진
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.4 no.2
    • /
    • pp.81-87
    • /
    • 1999
  • This paper discusses a bicriterion approach to sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach, which produces an efficient flintier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the m allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

  • PDF

Adaptive Control of Denitrification by the Extended Kalman Filter in a Sequencing Batch Reactor (확장형칼만필터에 의한 연속회분식반응조의 탈질 적응제어)

  • Kim, Dong Han
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.20 no.6
    • /
    • pp.829-836
    • /
    • 2006
  • The reaction rate of denitrification is primarily affected by the utilization of organics that are usually limited in the anoxic period in a sequencing batch reactor. It is necessary to add an extemal carbon source for sufficient denitrification. An adaptive model of state-space based on the extended Kalman filter is applied to manipulate the dosage rate of extemal carbon automatically. Control strategies for denitrification have been studied to improve control performance through simulations. The normal control strategy of the constant set-point results in the overdosage of external carbon and deterioration of water quality. To prevent the overdosage of external carbon, improved control strategies such as the constrained control action, variable set-point, and variable set-point after dissolved oxygen depletion are required. More stable control is obtained through the application of the variable set-point after dissolved oxygen depletion. The converging value of the estimated denitrification coefficient reflects conditions in the reactor.

Validity of patient-derived xenograft mouse models for lung cancer based on exome sequencing data

  • Kim, Jaewon;Rhee, Hwanseok;Kim, Jhingook;Lee, Sanghyuk
    • Genomics & Informatics
    • /
    • v.18 no.1
    • /
    • pp.3.1-3.8
    • /
    • 2020
  • Patient-derived xenograft (PDX) mouse models are frequently used to test the drug efficacy in diverse types of cancer. They are known to recapitulate the patient characteristics faithfully, but a systematic survey with a large number of cases is yet missing in lung cancer. Here we report the comparison of genomic characters between mouse and patient tumor tissues in lung cancer based on exome sequencing data. We established PDX mouse models for 132 lung cancer patients and performed whole exome sequencing for trio samples of tumor-normal-xenograft tissues. Then we computed the somatic mutations and copy number variations, which were used to compare the PDX and patient tumor tissues. Genomic and histological conclusions for validity of PDX models agreed in most cases, but we observed eight (~7%) discordant cases. We further examined the changes in mutations and copy number alterations in PDX model production and passage processes, which highlighted the clonal evolution in PDX mouse models. Our study shows that the genomic characterization plays complementary roles to the histological examination in cancer studies utilizing PDX mouse models.

Genome-Wide SNP Calling Using Next Generation Sequencing Data in Tomato

  • Kim, Ji-Eun;Oh, Sang-Keun;Lee, Jeong-Hee;Lee, Bo-Mi;Jo, Sung-Hwan
    • Molecules and Cells
    • /
    • v.37 no.1
    • /
    • pp.36-42
    • /
    • 2014
  • The tomato (Solanum lycopersicum L.) is a model plant for genome research in Solanaceae, as well as for studying crop breeding. Genome-wide single nucleotide polymorphisms (SNPs) are a valuable resource in genetic research and breeding. However, to do discovery of genome-wide SNPs, most methods require expensive high-depth sequencing. Here, we describe a method for SNP calling using a modified version of SAMtools that improved its sensitivity. We analyzed 90 Gb of raw sequence data from next-generation sequencing of two resequencing and seven transcriptome data sets from several tomato accessions. Our study identified 4,812,432 non-redundant SNPs. Moreover, the workflow of SNP calling was improved by aligning the reference genome with its own raw data. Using this approach, 131,785 SNPs were discovered from transcriptome data of seven accessions. In addition, 4,680,647 SNPs were identified from the genome of S. pimpinellifolium, which are 60 times more than 71,637 of the PI212816 transcriptome. SNP distribution was compared between the whole genome and transcriptome of S. pimpinellifolium. Moreover, we surveyed the location of SNPs within genic and intergenic regions. Our results indicated that the sufficient genome-wide SNP markers and very sensitive SNP calling method allow for application of marker assisted breeding and genome-wide association studies.

Numerical Model for SBR Aerobic Digestion Combined with Ultrasonication and Parameter Calibration (초음파 결합형 SBR 호기성 소화의 모델과 매개변수의 보정)

  • Kim, Sunghong;Lee, Inho;Yun, Jeongwon;Lee, Dongwoo
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.27 no.4
    • /
    • pp.457-468
    • /
    • 2013
  • Based on the activated sludge model(ASM), a mathematical model which represents the aerobic sludge digestion by sequencing batch reactor(SBR) combined with ultrasonic treatment was composed and performed in this study. Aerobic digestion using sequencing batch reactor(SBR) equipped with ultrasound treatment was also experimented for the purpose of parameter calibration. Most of the presented kinetic parameters in ASM or ASM2 could be used for the aerobic digestion of sludge but the parameters related in hydrolysis and decay rate needed modification. Hydrolysis rate constant of organic matter in aerobic condition was estimated at $0.3day^{-1}$ and the maximum growth rate for autotrophs in aerobic condition was $0.618day^{-1}$. Solubilization reactions of particulate organics and nitrogen by ultrasonication was added in this kinetic model. The solubilization rate is considered to be proportional to the specific energy which is defined by specific ultrasound power and sonication time. The solubilization rate constant by ultrasonication was estimated at $0.202(W/L)^{-1}day^{-1}$ in this study. Autotrophs as well as heterotrophs also decomposed by ultrasonic treatment and the nitrification reaction was limited by the lack of autotrophs accumulation in the digester.

Sequencing in Mixed Model Assembly Lines with Setup Time : A Tabu Search Approach (준비시간이 있는 혼합모델 조립라인의 제품투입순서 결정 : Tabu Search 기법 적용)

  • 김여근;현철주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.1
    • /
    • pp.13-13
    • /
    • 1988
  • This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

A Dynamic Programming Model for the Project-Sequencing Problem

  • Yoo, Byeong-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.5 no.1
    • /
    • pp.67-82
    • /
    • 1979
  • For many capacity expansion problems, distinct capacity types must be specified to identify capacity at different locations or capacities with different costs and operating characteristics. In this study, a project-sequencing model is developed that allows operating costs to influence the timing decisions for project establishment. Under certain conditions, the power expansion formulation is derived that may be solved through the dynamic programming approach, and its first application to planning in electric power systems is selected to investigate an optimal policy and to show the impact of requiring system to service more than one type of demand. Several sample testing results indicate that in some systems the efficiency of the large nuclear plants is higher than that of smell ones that it may overcome the effects of the drop in reliability.

  • PDF

Sequencing for Mixed-model Assembly Lines Considering Part Supplier in Just-in-time Production Systems (JIT생산시스템에서 부품공급업자를 고려한 혼합조립순서결정에 관한 연구)

  • 남궁석;이상용
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.43
    • /
    • pp.1-16
    • /
    • 1997
  • This paper improves the autonomy for supplier's schedule and the flexibility of the final assembly line. The final assembly line is a single work station and each product taking different assembly time is considered. In the assembly schedule, the heuristic method based on the goal chasing method is used. Consequently, suppliers can independently determine their output rates and thus, change their workload pattern according to their needs and priorities. Moreover, this flexibility can help to avoid expensive final-assembly-line stoppages in case of sudden part supply disruptions. The sequencing method can be easily implemented into an existing just-in-time system. In addition, the mathematical model was formulated and the algorithm was explained through the flow chart. The numerical example was given and the efficiency of this method is shown through the analysis of computational results of that example.

  • PDF

Efficiently Solving Dispatching Process Problems in Nurseries by Heuristic Techniques

  • Erhan, Kozan
    • Industrial Engineering and Management Systems
    • /
    • v.1 no.1
    • /
    • pp.10-18
    • /
    • 2002
  • A more comprehensive analytical framework for examining the relative merits of alternative dispatching process policies for nurseries is developed in this paper. The efficiency of the dispatch process of plants in a nursery is analysed using a vehicle routing model. The problem then involves determining in what order each vehicle should visit its locations. The problem is NP-hard. Several heuristic techniques are used to solve a real life nursery sequencing problem. The results obtained by these heuristic techniques are compared with each other and the current sequencing of orders. The model with some minor alterations can be also used to minimise the dispatching and collecting process in different agricultural plants.