Literature remains sparse regarding decompressive craniectomy (DC) in traumatic brain injury (TBI... more Literature remains sparse regarding decompressive craniectomy (DC) in traumatic brain injury (TBI) in very young children. This study analysed the indications, complications and outcome of young children undergoing DC for TBI at our institute. Retrospective. The total number of patients was 71. Mean age was 1.6 years. Mean duration from injury to surgery was 11.9 hours (range = 3-80 hours). Around 50% had severe head injury. Intracranial pressure (ICP) monitoring was done in 33 patients. Mean ICP was 22.2 mm Hg (range = 9-50 mm Hg). The threshold ICP for surgery was 15 mm Hg. Perioperative mortality was 50% each for severe TBI (18/36) and diffuse cerebral edema (7/14), and 58% for infants (4/7). Ninety per cent of expired patients had ICP > 20 mm Hg. Mean follow-up duration was 19.6 months (range = 2-42 months). Except one, all survivors had good-to-excellent outcomes (Glasgow outcome scale extended; GOS-E = 7-8). Decompressive craniectomy offers a survival advantage in almost 50...
Journal of Information and Optimization Sciences, 2015
ABSTRACT Sequence-dependent setup time is the most complicated case of setup time of jobs on mach... more ABSTRACT Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.
This paper is an attempt to introduce the concept of specially structured n-jobs, three machine f... more This paper is an attempt to introduce the concept of specially structured n-jobs, three machine flow shop scheduling in which the processing time of jobs are uncertain that is not known exactly and are in fuzzy environment. Fuzzy logic poses the ability to mimic the human mind to effectively employ modes of reasoning that are approximate rather than exact. The fuzzy processing times are described by triangular fuzzy membership function. Further the average high ranking (AHR) of fuzzy processing times are not random but bear a well defined relationship to one another. The objective of the present paper is to develop a heuristic algorithm to minimize the rental cost of machines under the specified rental policy. A numerical example is provided to demonstrate the computational efficiency of proposed algorithm.
This paper is an attempt to establish a linkage between a flowshop scheduling model having job bl... more This paper is an attempt to establish a linkage between a flowshop scheduling model having job block criteria with a parallel biserial queue network linked with a common channel in series. The arrival and service pattern both follows Poisson law in queue network. The generating function technique, law of calculus and statistical tools have been used to find out the various characteristics of queue. Further the completion time of jobs in a queue system form the set up time for the first machine in the scheduling model. A heuristic approach to find an optimal sequence of jobs with a job block criteria with minimum total flow time when the jobs are processed in a combined system with a queue network is discussed. The proposed method is easy to understand and also provide an important tool for the decision makers when the production is done in batches. A computer programme followed by a numerical illustration is given to justify the algorithm.
This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as min... more This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as minimization of the total rental cost of the machines subject to obtain the minimum makespan for n-jobs, 2-machine flow shop scheduling problem in which the processing times and independent set up times are associated with probabilities including job block criteria. Further jobs are attached with weights to indicate their relative importance. The proposed method is very simple and easy to understand and also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is given to justify the algorithm.
This paper presents an algorithm with the help of branch and bound approach for a flow shop sched... more This paper presents an algorithm with the help of branch and bound approach for a flow shop scheduling problem consisting of n jobs to be processed on 2 machines in which idle/waiting time operator is used for equivalent job for a job block and the transportation times from one machine to another machine are also being considered. Our objective is to find the sequence of jobs in order to minimize the total elapsed time with branch and bound technique. Algorithm is made clear with the help of numerical illustration.
Received on: 27-04-12; Accepted on: 14-05-12) ___________________________________________________... more Received on: 27-04-12; Accepted on: 14-05-12) ________________________________________________________________________________________________ ABSTRACT The present paper is an attempt through heuristic method to obtain the optimal sequence for n jobs two stage open shop problem in which the processing times are associated with probabilities. The concepts of equivalent job for a job block and transportation time from one machine to another are also taken into consideration. The algorithm developed in this paper is very simple and easy to understand. A computer program followed by numerical illustration is given to clarify the algorithm.
This paper studies two stage flow shop scheduling problem in which equivalent job for group job, ... more This paper studies two stage flow shop scheduling problem in which equivalent job for group job, processing times on each machine are given. The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved with branch and bound method.The method is illustrated by numerical example.
This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem... more This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem in which the effect of breakdown interval and the transportation time are considered. A Branch and Bound technique is given to optimize the objective of minimize the total elapsed time. The algorithm is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. A numerical illustration is given to clarify the algorithm.
This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop schedulin... more This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with their corresponding probabilities involving transportation time, break down interval and job block criteria. Further jobs are attached with weights to indicate their relative importance. A heuristic approach method to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and also provide an important tool for decision makers. A numerical illustration is also given to clarify the algorithm.
This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop sche... more This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with probabilities involving transportation time and break down interval. Further jobs are attached with weights to indicate their relative importance. A simple heuristic approach to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and, also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is also given to clarify the algorithm.
The objective of this paper is to develop a heuristic algorithm to minimize the utilization time ... more The objective of this paper is to develop a heuristic algorithm to minimize the utilization time and hence the rental cost of machines in n–jobs, 2–machines specially structured flow shop scheduling under specified rental policy in which the processing times of the machines are associated with their respective probabilities including the significant transportation time of the jobs. The processing time of the jobs are not completely random, but bear a well defined relationship to one another. A computer programme followed by a numerical illustration is given to justify the algorithm.
We present an heuristic algorithm to obtain the minimum elapsed time for a multi stage flowshop s... more We present an heuristic algorithm to obtain the minimum elapsed time for a multi stage flowshop scheduling problem in which processing times are associated with their respective probabilities involving transportation time, break down interval and the concept of equivalent job for a job block. Further the jobs are given weight to indicate their relative importance. The proposed method is very easy to understand and also provide an important tool for decision makers. The algorithm is demonstrated with the help of a numerical example.
This study was done with the aim to compare the clinical outcome and patients&amp... more This study was done with the aim to compare the clinical outcome and patients' quality of life between early versus delayed surgically treated patients of acute subaxial cervical spinal cord injury. The current study was based on the hypothesis that early surgical decompression and fixations in acute subaxial cervical spinal cord trauma is safe and is associated with improved outcome as compared to delayed surgical decompression. A total of 69 patients were recruited and divided into early decompression surgery Group A (operated within 48 h of trauma; n = 23) and late/delayed decompression surgery Group B (operated between 48 h and 7 days of trauma; n = 46). The patients in both groups were followed up, and comparative differences noted in the neurological outcome, quality of life, and bony fusion. The early surgery group spent lesser days in the intensive care unit and hospital (Group A 28.6 vs. Group B 35 days) had lesser postoperative complications (Group A 43% vs. Group B 61%) and a reduced mortality (Group A 30% vs. Group B 45%). In Group A, 38% patients had 1 American Spinal Injury Association (ASIA) grade improvement while 31% experienced >2 ASIA grade improvement. In Group B, the neurological improvement was 27% and 32%, respectively (P = 0.7). There was a significant improvement in the postoperative quality of life scores in both groups. Early surgery in patients with acute subaxial cervical spine injury should be considered strongly in view of the lesser complications, early discharge, and reduced mortality.
Brain pathology (Zurich, Switzerland), May 29, 2015
Medulloblastoma (MB) is composed of 4 molecular subgroups viz. WNT, SHH, groups 3 and 4, identifi... more Medulloblastoma (MB) is composed of 4 molecular subgroups viz. WNT, SHH, groups 3 and 4, identified using various high-throughput methods. Translation of this molecular data into pathologist-friendly techniques that would be applicable in laboratories all over the world is a major challenge. Ninety-two MBs were analyzed using a panel of 10 IHC markers, real-time PCR for mRNA and miRNA expression, and FISH for MYC amplification. β-catenin, GAB1 and YAP1 were the only IHC markers of utility in classification of MBs into 3 subgroups viz. WNT (9.8%), SHH (45.6%) and non-WNT/SHH (44.6%). mRNA expression could further classify some non-WNT/SHH tumors into groups 3 and 4. This, however, was dependent on integrity of RNA extracted from FFPE tissue. MYC amplification was seen in 20% of non-WNT/SHH cases and was associated with worst prognosis. For routine diagnostic practice, we recommend classification of MBs into 3subgroups: WNT, SHH and non-WNT/SHH, with supplementation by prognostic mark...
Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Marco Pistoia, Du... more Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Foreward by Li Gong Distinguished Engineer and Chief Java Security Architect Sun Microsystems, Inc.
Advances in Intelligent Systems and Computing, 2014
ABSTRACT The present chapter pertains to a bi-objective scheduling on parallel machines involving... more ABSTRACT The present chapter pertains to a bi-objective scheduling on parallel machines involving total tardiness and number of tardy jobs (NT). The processing time of jobs are uncertain in nature and are represented by triangular fuzzy membership function. The objective of the chapter is to find the optimal sequence of jobs processing on parallel identical machines so as to minimize the secondary criteria of NT with the condition that the primary criteria of total tardiness remains optimized. The bi-objective problem with total tardiness and NT as primary and secondary criteria, respectively, for any number of parallel machines is NP-hard. Following the theoretical treatment, a numerical illustration has also been given to demonstrate the potential efficiency of the proposed algorithm as a valuable analytical tool for the researchers.
Pediatric high-grade gliomas (HGGs) are highly malignant tumors that remain incurable and relativ... more Pediatric high-grade gliomas (HGGs) are highly malignant tumors that remain incurable and relatively understudied. The crucial role of noncoding RNAs (ncRNAs) has been reported in various cancers. However, the study on miRNAs in pediatric HGGs is scant and there is no report till date on the status of other small ncRNAs. Genome-wide microarray analysis was performed to investigate small ncRNA expression in pediatric HGG (n = 14) and compared to adult glioblastoma (GBM) signature. The validation of miRNAs and small nucleolar RNAs (snoRNAs) was done by real-time polymerase chain reaction. TP53 and H3F3A mutation-specific miRNA and snoRNA profiles were generated and analyzed. Pediatric HGGs showed upregulation of miR-17/92 and its paralog clusters (miR106b/25 and miR-106a/363), whereas majority of downregulated miRNAs belonged to miR379/656 cluster (14q32). Unsupervised hierarchical clustering identified two distinct groups. Interestingly, Group 2 with downregulated 14q32 cluster showed better overall survival. The miRNAs unique to pediatric HGG as compared to adult GBM were predicted to affect PDGFR and SMAD2/3 pathways. Similarities were seen between pediatric HGG and TP53 mutant miRNA profiles as compared to wild types. Several of H3F3A mutation-regulated genes were found to be the targets of H3F3A mutant-specific miRNAs. Remarkably, a significant downregulation of HBII-52 snoRNA cluster was found in pediatric HGGs, and was specific to H3F3A nonmutants. This is the first genome-wide profiling study on miRNAs and snoRNAs in pediatric HGGs with respect to H3F3A and TP53 mutations. The comparison of miRNA profiles of pediatric HGGs and adult GBM reiterates the overlaps and differences as also seen with their gene expression and methylation signatures.
ABSTRACT This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment ... more ABSTRACT This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The bi-criteria problem with weighted flow time and maximum tardiness as primary and secondary criteria, respectively, for any number of parallel machines is NP-hard. So, a heuristic algorithm is proposed to find the optimal sequence of jobs processing on parallel machines so as to minimize the secondary criterion of maximum tardiness without violating the primary criterion of weighted flow time. A numerical illustration is also given in support of the algorithm proposed.
Literature remains sparse regarding decompressive craniectomy (DC) in traumatic brain injury (TBI... more Literature remains sparse regarding decompressive craniectomy (DC) in traumatic brain injury (TBI) in very young children. This study analysed the indications, complications and outcome of young children undergoing DC for TBI at our institute. Retrospective. The total number of patients was 71. Mean age was 1.6 years. Mean duration from injury to surgery was 11.9 hours (range = 3-80 hours). Around 50% had severe head injury. Intracranial pressure (ICP) monitoring was done in 33 patients. Mean ICP was 22.2 mm Hg (range = 9-50 mm Hg). The threshold ICP for surgery was 15 mm Hg. Perioperative mortality was 50% each for severe TBI (18/36) and diffuse cerebral edema (7/14), and 58% for infants (4/7). Ninety per cent of expired patients had ICP > 20 mm Hg. Mean follow-up duration was 19.6 months (range = 2-42 months). Except one, all survivors had good-to-excellent outcomes (Glasgow outcome scale extended; GOS-E = 7-8). Decompressive craniectomy offers a survival advantage in almost 50...
Journal of Information and Optimization Sciences, 2015
ABSTRACT Sequence-dependent setup time is the most complicated case of setup time of jobs on mach... more ABSTRACT Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.
This paper is an attempt to introduce the concept of specially structured n-jobs, three machine f... more This paper is an attempt to introduce the concept of specially structured n-jobs, three machine flow shop scheduling in which the processing time of jobs are uncertain that is not known exactly and are in fuzzy environment. Fuzzy logic poses the ability to mimic the human mind to effectively employ modes of reasoning that are approximate rather than exact. The fuzzy processing times are described by triangular fuzzy membership function. Further the average high ranking (AHR) of fuzzy processing times are not random but bear a well defined relationship to one another. The objective of the present paper is to develop a heuristic algorithm to minimize the rental cost of machines under the specified rental policy. A numerical example is provided to demonstrate the computational efficiency of proposed algorithm.
This paper is an attempt to establish a linkage between a flowshop scheduling model having job bl... more This paper is an attempt to establish a linkage between a flowshop scheduling model having job block criteria with a parallel biserial queue network linked with a common channel in series. The arrival and service pattern both follows Poisson law in queue network. The generating function technique, law of calculus and statistical tools have been used to find out the various characteristics of queue. Further the completion time of jobs in a queue system form the set up time for the first machine in the scheduling model. A heuristic approach to find an optimal sequence of jobs with a job block criteria with minimum total flow time when the jobs are processed in a combined system with a queue network is discussed. The proposed method is easy to understand and also provide an important tool for the decision makers when the production is done in batches. A computer programme followed by a numerical illustration is given to justify the algorithm.
This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as min... more This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as minimization of the total rental cost of the machines subject to obtain the minimum makespan for n-jobs, 2-machine flow shop scheduling problem in which the processing times and independent set up times are associated with probabilities including job block criteria. Further jobs are attached with weights to indicate their relative importance. The proposed method is very simple and easy to understand and also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is given to justify the algorithm.
This paper presents an algorithm with the help of branch and bound approach for a flow shop sched... more This paper presents an algorithm with the help of branch and bound approach for a flow shop scheduling problem consisting of n jobs to be processed on 2 machines in which idle/waiting time operator is used for equivalent job for a job block and the transportation times from one machine to another machine are also being considered. Our objective is to find the sequence of jobs in order to minimize the total elapsed time with branch and bound technique. Algorithm is made clear with the help of numerical illustration.
Received on: 27-04-12; Accepted on: 14-05-12) ___________________________________________________... more Received on: 27-04-12; Accepted on: 14-05-12) ________________________________________________________________________________________________ ABSTRACT The present paper is an attempt through heuristic method to obtain the optimal sequence for n jobs two stage open shop problem in which the processing times are associated with probabilities. The concepts of equivalent job for a job block and transportation time from one machine to another are also taken into consideration. The algorithm developed in this paper is very simple and easy to understand. A computer program followed by numerical illustration is given to clarify the algorithm.
This paper studies two stage flow shop scheduling problem in which equivalent job for group job, ... more This paper studies two stage flow shop scheduling problem in which equivalent job for group job, processing times on each machine are given. The objective of the study is to get optimal sequence of jobs in order to minimize the total elapsed time. The given problem is solved with branch and bound method.The method is illustrated by numerical example.
This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem... more This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem in which the effect of breakdown interval and the transportation time are considered. A Branch and Bound technique is given to optimize the objective of minimize the total elapsed time. The algorithm is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. A numerical illustration is given to clarify the algorithm.
This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop schedulin... more This paper deals with a new simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with their corresponding probabilities involving transportation time, break down interval and job block criteria. Further jobs are attached with weights to indicate their relative importance. A heuristic approach method to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and also provide an important tool for decision makers. A numerical illustration is also given to clarify the algorithm.
This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop sche... more This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with probabilities involving transportation time and break down interval. Further jobs are attached with weights to indicate their relative importance. A simple heuristic approach to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and, also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is also given to clarify the algorithm.
The objective of this paper is to develop a heuristic algorithm to minimize the utilization time ... more The objective of this paper is to develop a heuristic algorithm to minimize the utilization time and hence the rental cost of machines in n–jobs, 2–machines specially structured flow shop scheduling under specified rental policy in which the processing times of the machines are associated with their respective probabilities including the significant transportation time of the jobs. The processing time of the jobs are not completely random, but bear a well defined relationship to one another. A computer programme followed by a numerical illustration is given to justify the algorithm.
We present an heuristic algorithm to obtain the minimum elapsed time for a multi stage flowshop s... more We present an heuristic algorithm to obtain the minimum elapsed time for a multi stage flowshop scheduling problem in which processing times are associated with their respective probabilities involving transportation time, break down interval and the concept of equivalent job for a job block. Further the jobs are given weight to indicate their relative importance. The proposed method is very easy to understand and also provide an important tool for decision makers. The algorithm is demonstrated with the help of a numerical example.
This study was done with the aim to compare the clinical outcome and patients&amp... more This study was done with the aim to compare the clinical outcome and patients' quality of life between early versus delayed surgically treated patients of acute subaxial cervical spinal cord injury. The current study was based on the hypothesis that early surgical decompression and fixations in acute subaxial cervical spinal cord trauma is safe and is associated with improved outcome as compared to delayed surgical decompression. A total of 69 patients were recruited and divided into early decompression surgery Group A (operated within 48 h of trauma; n = 23) and late/delayed decompression surgery Group B (operated between 48 h and 7 days of trauma; n = 46). The patients in both groups were followed up, and comparative differences noted in the neurological outcome, quality of life, and bony fusion. The early surgery group spent lesser days in the intensive care unit and hospital (Group A 28.6 vs. Group B 35 days) had lesser postoperative complications (Group A 43% vs. Group B 61%) and a reduced mortality (Group A 30% vs. Group B 45%). In Group A, 38% patients had 1 American Spinal Injury Association (ASIA) grade improvement while 31% experienced >2 ASIA grade improvement. In Group B, the neurological improvement was 27% and 32%, respectively (P = 0.7). There was a significant improvement in the postoperative quality of life scores in both groups. Early surgery in patients with acute subaxial cervical spine injury should be considered strongly in view of the lesser complications, early discharge, and reduced mortality.
Brain pathology (Zurich, Switzerland), May 29, 2015
Medulloblastoma (MB) is composed of 4 molecular subgroups viz. WNT, SHH, groups 3 and 4, identifi... more Medulloblastoma (MB) is composed of 4 molecular subgroups viz. WNT, SHH, groups 3 and 4, identified using various high-throughput methods. Translation of this molecular data into pathologist-friendly techniques that would be applicable in laboratories all over the world is a major challenge. Ninety-two MBs were analyzed using a panel of 10 IHC markers, real-time PCR for mRNA and miRNA expression, and FISH for MYC amplification. β-catenin, GAB1 and YAP1 were the only IHC markers of utility in classification of MBs into 3 subgroups viz. WNT (9.8%), SHH (45.6%) and non-WNT/SHH (44.6%). mRNA expression could further classify some non-WNT/SHH tumors into groups 3 and 4. This, however, was dependent on integrity of RNA extracted from FFPE tissue. MYC amplification was seen in 20% of non-WNT/SHH cases and was associated with worst prognosis. For routine diagnostic practice, we recommend classification of MBs into 3subgroups: WNT, SHH and non-WNT/SHH, with supplementation by prognostic mark...
Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Marco Pistoia, Du... more Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Marco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. Ramani ... Foreward by Li Gong Distinguished Engineer and Chief Java Security Architect Sun Microsystems, Inc.
Advances in Intelligent Systems and Computing, 2014
ABSTRACT The present chapter pertains to a bi-objective scheduling on parallel machines involving... more ABSTRACT The present chapter pertains to a bi-objective scheduling on parallel machines involving total tardiness and number of tardy jobs (NT). The processing time of jobs are uncertain in nature and are represented by triangular fuzzy membership function. The objective of the chapter is to find the optimal sequence of jobs processing on parallel identical machines so as to minimize the secondary criteria of NT with the condition that the primary criteria of total tardiness remains optimized. The bi-objective problem with total tardiness and NT as primary and secondary criteria, respectively, for any number of parallel machines is NP-hard. Following the theoretical treatment, a numerical illustration has also been given to demonstrate the potential efficiency of the proposed algorithm as a valuable analytical tool for the researchers.
Pediatric high-grade gliomas (HGGs) are highly malignant tumors that remain incurable and relativ... more Pediatric high-grade gliomas (HGGs) are highly malignant tumors that remain incurable and relatively understudied. The crucial role of noncoding RNAs (ncRNAs) has been reported in various cancers. However, the study on miRNAs in pediatric HGGs is scant and there is no report till date on the status of other small ncRNAs. Genome-wide microarray analysis was performed to investigate small ncRNA expression in pediatric HGG (n = 14) and compared to adult glioblastoma (GBM) signature. The validation of miRNAs and small nucleolar RNAs (snoRNAs) was done by real-time polymerase chain reaction. TP53 and H3F3A mutation-specific miRNA and snoRNA profiles were generated and analyzed. Pediatric HGGs showed upregulation of miR-17/92 and its paralog clusters (miR106b/25 and miR-106a/363), whereas majority of downregulated miRNAs belonged to miR379/656 cluster (14q32). Unsupervised hierarchical clustering identified two distinct groups. Interestingly, Group 2 with downregulated 14q32 cluster showed better overall survival. The miRNAs unique to pediatric HGG as compared to adult GBM were predicted to affect PDGFR and SMAD2/3 pathways. Similarities were seen between pediatric HGG and TP53 mutant miRNA profiles as compared to wild types. Several of H3F3A mutation-regulated genes were found to be the targets of H3F3A mutant-specific miRNAs. Remarkably, a significant downregulation of HBII-52 snoRNA cluster was found in pediatric HGGs, and was specific to H3F3A nonmutants. This is the first genome-wide profiling study on miRNAs and snoRNAs in pediatric HGGs with respect to H3F3A and TP53 mutations. The comparison of miRNA profiles of pediatric HGGs and adult GBM reiterates the overlaps and differences as also seen with their gene expression and methylation signatures.
ABSTRACT This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment ... more ABSTRACT This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The bi-criteria problem with weighted flow time and maximum tardiness as primary and secondary criteria, respectively, for any number of parallel machines is NP-hard. So, a heuristic algorithm is proposed to find the optimal sequence of jobs processing on parallel machines so as to minimize the secondary criterion of maximum tardiness without violating the primary criterion of weighted flow time. A numerical illustration is also given in support of the algorithm proposed.
Uploads
Papers by Deepak Gupta