• Title/Summary/Keyword: Test Sequence

Search Result 1,291, Processing Time 0.024 seconds

Replication and packaging of Turnip yellow mosaic virus RNA containing Flock house virus RNA1 sequence

  • Kim, Hui-Bae;Kim, Do-Yeong;Cho, Tae-Ju
    • BMB Reports
    • /
    • v.47 no.6
    • /
    • pp.330-335
    • /
    • 2014
  • Turnip yellow mosaic virus (TYMV) is a spherical plant virus that has a single 6.3 kb positive strand RNA as a genome. In this study, RNA1 sequence of Flock house virus (FHV) was inserted into the TYMV genome to test whether TYMV can accommodate and express another viral entity. In the resulting construct, designated TY-FHV, the FHV RNA1 sequence was expressed as a TYMV subgenomic RNA. Northern analysis of the Nicotiana benthamiana leaves agroinfiltrated with the TY-FHV showed that both genomic and subgenomic FHV RNAs were abundantly produced. This indicates that the FHV RNA1 sequence was correctly expressed and translated to produce a functional FHV replicase. Although these FHV RNAs were not encapsidated, the FHV RNA having a TYMV CP sequence at the 3'-end was efficiently encapsidated. When an eGFP gene was inserted into the B2 ORF of the FHV sequence, a fusion protein of B2-eGFP was produced as expected.

A Physical Sequence Estimation Scheme for Passive RFID Tags using Round Trip Scan (왕복 스캔을 통한 수동형 RFID태그의 물리적 순차 추정기법)

  • Lee, Joo-Ho;Kwon, Oh-Heum;Song, Ha-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.11
    • /
    • pp.1358-1368
    • /
    • 2012
  • A tag sequence estimation scheme is to estimate the physical sequence of passive RFID tags that are linearly spread using the movement of a RFID reader. Since RFID readers communicate with the passive tags by very weak radio waves, scanning passive tags are unstable. In this paper, we applied round-trip scanning of a reader to enhance the tag sequence estimation. Proposed scheme first determines the turning point of the reader movement, and then estimates the sequence of the tags using the tag sets scanned in each read cycles. Test experiments show that the proposed scheme can improve the estimation accuracy.

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu;Yu, Jae-Min;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.19 no.1
    • /
    • pp.29-36
    • /
    • 2013
  • This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.

A study on algorithms to minimize makespan of sequence-dependent jobs (작업준비시간을 고려한 총작업완료시간 최소화 해법에 관한 연구)

  • 안상형
    • Korean Management Science Review
    • /
    • v.12 no.2
    • /
    • pp.77-87
    • /
    • 1995
  • In this paper we develop an efficient heuristic algorithm for the problem of scheduling n sequence-dependent jobs on a basic processor to minimize makespan. Efficient solution methods are already known for the sequence- independent case. But for the sequence-dependent case, this problem belongs to a set of strong NP-complete problems. We present a heuristic which is similar to shortest setup time heuristic but opportunity cost of setup time rather than shortest setup time is used for choosing next job. This heuristic algorithm has same computational complexity and worst case ratio as the shortest setup time heuristic. We used Wilcoxon signed rank test to show that our heuristic is superior to nearest setup time heuristic in term of average behavior.

  • PDF

Twin anemia polycythemia sequence in a dichorionic diamniotic pregnancy: a case report

  • Lee, Soo-Young;Bae, Jin Young;Hong, Seong Yeon
    • Journal of Yeungnam Medical Science
    • /
    • v.39 no.2
    • /
    • pp.150-152
    • /
    • 2022
  • Complications related to the vascular anastomosis of the placental vessels in monochorionic twins are fatal. The clinical syndromes of feto-fetal transfusion include twin anemia polycythemia sequence (TAPS), twin-twin transfusion syndrome, and twin reversed arterial perfusion sequence. We present an extremely rare case of TAPS in a dichorionic diamniotic pregnancy. A 36-year-old woman, gravida 0, para 0, was referred to our hospital with suspected preterm premature membrane rupture. Although her pelvic examination did not reveal specific findings, the non-stress test result showed minimal variability in the first fetus and late deceleration in the second one. An emergency cesarean section was performed. The placenta was fused, and one portion of the placenta was pale, while the other portion was dark red. The hemoglobin level of the first fetus was 7.8 g/dL and that of the second one was 22.2 g/dL.

Test Input Sequence Generation Strategy for Timing Diagram using Linear Programming (선형 계획법을 이용한 Timing Diagram의 테스트 입력 시퀀스 자동 생성 전략)

  • Lee, Hong-Seok;Chung, Ki-Hyun;Choi, Kyung-Hee
    • The KIPS Transactions:PartD
    • /
    • v.17D no.5
    • /
    • pp.337-346
    • /
    • 2010
  • Timing diagram is popularly utilized for the reason of its advantages; it is convenient for timing diagram to describe behavior of system and it is simple for described behaviors to recognize it. Various techniques are needed to test systems described in timing diagram. One of them is a technique to derive the system into a certain condition under which a test case is effective. This paper proposes a technique to automatically generate the test input sequence to reach the condition for systems described in timing diagram. It requires a proper input set which satisfy transition condition restricted by input waveform and timing constraints to generate a test input sequence automatically. To solve the problem, this paper chooses an approach utilizing the linear programming, and solving procedure is as follows: 1) Get a Timing diagram model as an input, and transforms the timing diagram model into a linear programming problem. 2) Solve the linear programming problem using a linear programming tool. 3) Generate test input sequences of a timing diagram model from the solution of linear programming problem. This paper addresses the formal method to drive the linear programming model from a given timing diagram, shows the feasibility of our approach by prove it, and demonstrates the usability of our paper by showing that our implemented tool solves an example of a timing diagram model.

Development of Process Model for Turbine Control Valve Test in a Power Plant (발전소 터빈제어 밸브시험 계통 모델 개발)

  • Woo, Joo-Hee;Choi, In-Kyu;Park, Doo-Yong;Kim, Jong-An
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.4
    • /
    • pp.830-837
    • /
    • 2011
  • A turbine control system which has been operated for years in a nuclear power plant was retrofitted with a newly developed digital control system. After completion of the retrofit, turbine valve tests were performed to ensure the integrity of each valve's control function. The sequence of each valve test is composed of a closing process and a reopening process. To minimize megawatt variation which normally occurs during the test sequence, we employed a kind of compensator algorithm in the new digital control system which also have been used in the old system. There were difficulties finding optimal parameter settings for our new compensator algorithm because the power plant didn't allow us to perform necessary tuning procedures while the turbine is on load operation. Therefore an alternative measure for the compensator tuning which is independent of the turbine actual operation had to be implemented. So, a process model for the test was required to overcome this situation. We analyzed the operation data of the test and implemented the process model by use of input and output variable relations. Also we verified the process model by use of another condition's operating data. The result shows that the output of model is similar to the actual operation data.

The Estimation of Fatigue Life for Al/CFRP Hybrid Laminated Composites using the Strain-Life Method (변형률-수명 평가기법을 이용한 Al/CFRP 하이브리드 적층 복합재의 피로수명 측정)

  • Yang, Seong Jin;Kwon, Oh Heon;Jeon, Sang Koo
    • Journal of the Korean Society of Safety
    • /
    • v.36 no.3
    • /
    • pp.7-14
    • /
    • 2021
  • Hybrid laminated Al/carbon-fiber-reinforced plastic (CFRP) composites are attracting considerable attention from industries such as aerospace and automobiles owing to their excellent specific strength and specific rigidity. However, when this material is used to fabricate high-pressure fuel storage containers subjected to repeated fatigue loads, fatigue life evaluation for the working load is regulated as an important criterion for operational safety and ease of maintenance. Among the existing evaluation methods for these vessels, the burst test and the hydraulic repeat test require expensive facilities. Thus, the present study aims to develop an improved fatigue life test for Al/CFRP laminated hybrid composites. The test specimen was manufactured using a curved mold considering the shape of a type III high-pressure storage container. The strain-life method was used for fatigue life evaluation, and the life was predicted based on the transition life. The results indicate that the more complex the CFRP stacking sequence, the longer is the transition life. This test method is expected to be useful for ensuring the fatigue safety and economy of hybrid laminate composites.

Test of Hypotheses based on LAD Estimators in Nonlinear Regression Models

  • Seung Hoe Choi
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.288-295
    • /
    • 1995
  • In this paper a hypotheses test procedure based on the least absolute deviation estimators for the unknown parameters in nonlinear regression models is investigated. The asymptotic distribution of the proposed likelihood ratio test statistic are established voth under the null hypotheses and a sequence of local alternative hypotheses. The asymptotic relative efficiency of the proposed test with classical test based on the least squares estimator is also discussed.

  • PDF

A Study on the Method of Optimizing the Test Order of Explosive Detection System Using Analytic Hierarchy Process and Objective Rating (계층분석방법 및 객관적평가법을 활용한 폭발물탐지장비 시험순서 최적화 방법에 관한 연구)

  • Sun-Ju, Won;Hyun Su, Sim;Yong Soo, Kim
    • Journal of Korean Society for Quality Management
    • /
    • v.50 no.4
    • /
    • pp.793-810
    • /
    • 2022
  • Purpose: As improving the search performance of aviation security equipment is considered essential, this study proposes the need for research on how to find an optimized test sequence that can reduce test time and operator power during the search function test of explosive detection systems. We derive the weights and work difficulty adjustment factor required to find the optimized test order. Methods: First, after setting the test factors, the time of each test and the difficulty scale determined by the worker who performed the test directly were used to derive weights. Second, the work difficulty adjustment coefficient was determined by combining the basic weight adjustment factor and corresponding to the body part used by the test using objective rating. Then the final standard time was derived by calculating the additional weights for the changeability of the test factors. Results: The order in which the final standard time is minimized when 50 tests are performed was defined as the optimized order. 50 tests should be conducted without duplication and the optimal order of tests was obtained when compared to previously numbered tests. As a result of minimizing the total standard time by using Excel's solver parameters, it was reduced by 379.14 seconds, about 6.32 minutes. Conclusion: We tried to express it in mathematical formulas to propose a method for setting an optimized test sequence even when testing is performed on other aviation security equipment. As a result, the optimal test order was derived from the operator's point of view, and it was demonstrated by minimizing the total standard time.