Papers by Keyword: Sequencing

Abstract: Cancer is a large group of diseases that occur in almost any organ or tissue of the body when abnormal cells get out of normal and invade adjacent cells. In women especially, breast cancer is among the most common types of cancer. These cancer cells will form a tumor that can be seen on an x-ray. Some traditional breast cancer treatments have been carried out, including using local herbal plants such as rodent tubers (Typhonium flagelliforme). Rodent tuber contains stigmasterol which has a high anticancer effect and was found in several mutant clones. The purpose of this study was to analyze DNA differences between mutant and wild-type rodent tuber plants based on specific RAPD markers and sequence differences in each sample. The RAPD OPB18 primer was successfully amplifies polymorphic DNA bands with sizes ranging from 700 to 1000 bp. As a result of the sequencing analysis, separate segments in wild-type and mutant plants had different sequences. In comparing the test sequence to the NCBI database, it was found that wild-type rodent tuber samples matched Gossypium raimondii (81.82%) and BLAC (bulk highest anticancer compound) rodent tuber mutant plants has similarity with Slanum pinnasectum about 87.36%. Based on this results, the similarity of rodent tuber sequences is possible to be developed in the specific sequences that encode a gene, especially genes encoding anticancer compounds.

Abstract: Red sea bream iridoviral disease (RSIVD) infection is known as a contagious disease in the marine aquaculture commodities mainly on grouper (Epinephelussp.)which causes a high mortality rate. Symptoms of disease were weak, darker skin and swollen spleen of fish. The aim of this study was to create and apply a rapid diagnostic test supported by molecular analysis. Field trials on a mass mortality outbreaks were identified in the city of Tanjungpinang, Indonesia. Serum anti RSIV was obtained by immunizing of the vaccine RSIV intraperitoneally on rabbits with graded doses per week was 0.5, 1, 2 and3mL, to boost antibody titers. In the fifth week, serum was harvested via the auricular vein; serum was purified to obtain immunoglobulin G(IgG)then was coupling with protein A ofStaphylococcus aureus at the same volume(kit co-agglutination RSIVD). Field samples of spleen were taken from the normal fish and suspected fish then crushed and suspended with PBS pH 7.2, and centrifuged at 8.000 rpm for 15 min. Fifty microliters of RSIVDco-agglutination kit and 50 µL of spleen supernatant were reacted on the sterile glass object. The results showed sandy agglutination after 10 min for positively infected spleen, and no agglutination in the samples of healthy fish (negative) as well as in control with PBS (negative). Confirmation testing by polymerase chain reaction (PCR) using primer forward 1-F (5’-CTC-AAA-CAC-TCT-GGC-TCA-TC-3’) and reverse 1-R (5’-GCA-CCA-ACA-CAT-CTC-CTA-TC-3’) had a band of 570 bp. Sequencing results showed the similarity of 99% identity with RSIV. Testing with RSIVD co-agglutination kit showed the advantages such as cheap, fast and an accurate in diagnosing the red bream iridoviral disease (RSIVD).

Abstract: In this paper, problem of sequencing of production orders in mixed-model assembly systems is being analysed. The sequencing in such system is mostly addressed as a CSP problem (Car Sequencing Problem) and due to the fact that no optimal method of solution has yet been found it belongs to the NP-hard problems [1,2]. The NP-hardness of the problem has been proven in [3]. The problem connected with proper sequencing arises from the fact that nowadays it’s the clients who have the biggest influence on the sellers offer. The possibility to customize almost each and every product complicates the production management, as instead of having 10 different products, the number of them may grow up to few hundreds [4]. The problem may be especially observed in automotive industry, however recently it may be also met in household appliances industry, as mass customization can be also observed on that market. Each product may differ in labor-effectiveness, and due to the fact of carrying the assembly in linear assembly systems, each unevenness, each transgression of takt time on a single work-station may lead to the line stoppage.

Abstract: The manufacturers nowadays are forced to respond very quickly to changes in the market conditions. To adopt flexible mixed model assembly lines (MMAL) is a preferred way for manufacturers to improve competitiveness. Managing a mixed model assembly line involves two problems: assigning assembly tasks to stations (balancing problem) and determining the sequence of products at each station (sequencing problem). In order to solve both balancing and sequencing problem in MMAL simultaneously, an integrated mathematical model based on mixed integer programming (MIP) is developed to describe the problem. In the model, general type precedence relations and task duplications are considered. Due to the NP-hardness of the balancing and sequencing problem of MMAL, GA is designed to search the optimal solution. The efficiency of the GA is demonstrated by a case study.

Abstract: The paper presents the production orders sequencing issue, which main aim is to establish a proper sequence of tasks, that would maximize the utilization of companys production capacity. According to the literature research, the sequencing problem considered in the paper, may be denoted as CSP (Car Sequencing Problem) and belongs to the NP-hard class, as has been proven by simple reduction from Hamiltonians Path problem [1]. Optimal method of solution has not yet been found, therefore only approximate solutions have been offered [2]. Approximate solutions are based mainly on the evolutionary algorithms. However certain problems, as lack of possibility to check the effectiveness of the solution or the possibility to reach twice the same solution are observed. Regardless of the structure of specific assembly system, while considering reception of new tasks into the execution, current review of the state of the system is obligatory in order to decide whether, when and which new order can be accepted for assembly. In this paper, the problem of task scheduling is limited to the specific existing mixed-model production system. The main goal is to determine the effective method of creation of task sequence.

Abstract: The paper presents the task scheduling issue, which main aim is to establish a proper sequence of tasks, that would maximize the utilization of companys production capacity. According to the literature sources, the presented sequencing problem, denoted as CSP (Car Sequencing Problem) belongs to the NP-hard class, as has been proven by simple reduction from Hamiltonians Path problem. Optimal method of solution has not yet been found, only approximate solutions have been offered, especially from the range of evolutionary algorithms. Regardless of specific production system, while considering reception of new tasks into the system, current review of the state of the system is required in order to decide whether and when a new order can be accepted for execution. In this paper, the problem of task scheduling is limited to the specific existing mixed-model production system. The main goal is to determine the effective method of creation of task sequence. Through the use of computational algorithms, and automatic analysis of the resulting sequence, rates of production are able to be checked in a real time, and so improvements can be proposed and implemented.

Abstract: Sequencing rules are often used in production control to improve key performance indicators, such as cycle time, mean tardiness and on-time delivery. However, for Maintenance, Repair and Overhaul (MRO) processes, there is a development need for sequencing rules, which effectively improve these indicators since specific requirements have to be considered and recent studies have mainly been using standard rules and do not allow a clear conclusion. This paper describes the modeling and validation of a real-case scenario, the MRO of train couplings by means of an event-driven simulation. The simulation model is used in order to derive and test a new sequencing rule, the Fix-and-continue algorithm (FACA), as well as to compare its results with standard sequencing rules concerning average cycle time, mean tardiness and on-time delivery. Thereby, the potential of the algorithm is revealed.

Abstract: Algorithms based on Simulated Annealing and Tabu search has been proposed and implemented on scheduling a problem of parallel machines. The identical parallel machine scheduling problem has been considered to minimize the total flow-time subject to optimal makespan. The proposed algorithms have two phases. In the first phase, an initial solution has been obtained using Longest Processing Time (LPT) dispatching rule and in the second phase, simulated annealing and tabu search have been applied to reach a near optimal solution. The performance of the both proposed algorithms have been evaluated by comparing their results for different number of jobs and processing times. The computational results indicate that the proposed Tabu Search algorithm is capable of obtaining better solutions for the given scheduling problem as compared to the Simulated Annealing algorithm. Although both of these algorithms provide the best solutions as compared to the other heuristic algorithms but in comparison of these two; Tabu Search provides the better solutions for the given problem.

Abstract: This paper aims to sequence the production plan of a condenser unit of an air-conditioned assembly line, which is a manual assembly line. In this case there are six different models with different required production rate that must be assembled simultaneously. The assembly line consists of twenty four workstations with thirty four workers. Due to the fact that the cycle time of each condenser model is varied. Thus, it is difficult to design a launching pattern so that the production requirement of each model is exactly met at each production hour. In turn, the production demand of some models can be satisfied while other models cannot be met. In order to solve this problem, the fixed rate launching algorithm is applied and the result is considered satisfactory.

Abstract: To identify the intestinal microflora diversity of transgenic sheep and non-transgenic one with overexpression of foreign antiviral gene (VP1 & SB-SW), DNA of total bacteria were extracted from 16 sheep fecal samples (4 non-transgenic sheep, 6 VP1 transgenic sheep and 6 SB-SW transgenic sheep). And then PCR amplification with bacterial universal primers of V3 variable region of 16S rRNA were taken to get the fingerprint profile by denaturing gradient gel electrophoresis (DGGE) technology. The results showed that the DGGE profiles of the 16 fecal samples were highly polymorphic. The number of DGGE bands, considered indicative of the total species richness, did not vary predictably among the three different samples. The DNA sequences were analyzed and the dominant bacteria in sheep fecal were found to be Bacteroides, Clostridium, and Ruminococcus. Specially, non-transgenic sheep had more Alistipes finegoldii and Clostridium lentocellum, transgenic sheep with VP1 had more Clostridium drakei and Clostridium populeti and transgenic sheep with SB-SW had more Barnesiella intestinihominis and Clostridium ljungdahlii. So the PCR-DGGE technique can be applied to evaluate genetically modified (GM) animal potential risks to the environment.