A systematic review of proteomic biomarkers associated with risk stratification in pediatric acute lymphoblastic leukemia

     Risk-based therapy protocols have dramatically improved survival rates in more than 80% of childhood acute lymphoblastic leukemia (chALL). Prognostic biomarkers could be valuable for predicting the relapsed ALL patients and may therefore contribute to improving ALL outcome. Presently, there are little data on the role of prognostic biomarkers in the risk stratification of ALL. The aim of the present systematic review is to survey the identified prognostic biomarkers of chALL. In this study, protein-protein interaction of identified biomarkers was evaluated to reveal the biological pathways related to high risk chALL. To pursue this goal, firstly all relevant studies were collected through the PubMed and Google Scholar databases with no restrictions. Then, the biomarkers of high risk patients were recorded and finally protein-protein interaction of biomarkers was analyzed through using the STRING database. After screening 82 abstracts, three studies were included with 36 high risk and 33 low risk B-ALL participants. Totally, 142 biomarkers were investigated in this study. Protein interaction network analysis of biomarkers revealed two main pathways, namely ribosome and spliceosome. Dysregulation of two key pathways, ribosome and spliceosome can be associated with the high risk phenotype of childhood acute lymphoblastic leukemia

A Revised Version of Ant Colony Algorithm for One-Dimensional Cutting Stock Problem

The one-dimensional cutting stock problem has many applications in industries and during the past few years has been one of the centers of attention among the researchers in the field of applied operations research. In this paper, a revised version of Ant Colony Optimization (ACO) technique is presented to solve this problem. This paper is a sequel to the previous ACO algorithm presented by the authors. In this algorithm, according to some probabilistic rules, artificial ants will select cutting patterns and generate a feasible solution. Computational results show the high efficiency and accuracy of the proposed algorithm for solving one- dimensional cutting stock problem

The existence and construction of Ã-valuations of 2-regular graphs with three components

grantor: University of TorontoA function f is a graceful valuation of a graph G with n edges if f is an injection from the vertices of G to the set $\rm\{0,1,\...,n\}$ such that, when each edge $\rm\{u,\ v\}$ is assigned the label $\vert f$ (u) $-f$ (v)$\vert,$ the resulting edge labels are distinct. This labeling provides a sequential labeling of the edges from 1 to n. Any graph that can be gracefully labeled is a graceful graph. If, in addition, there is a number $\gamma$ so that for each edge $\{$u, v$\}$ either f (u) $\le\gamma<f$ (v) or f (v) $\le\gamma<f$ (u), then the valuation is called an $\alpha$-valuation. In the work done here, we study the problem of the existence and construction of $\alpha$-valuations of special class of graphs: 2-regular graphs with three components. We show that every 2-regular bipartite graph with three components and no odd cycle has an $\alpha$-valuation if and only if the number of edges is a multiple of four except for one special case. We also investigate the existence of $\alpha$-valuations of 2-regular graphs with more than three components. We introduce certain improvements on the known results regarding this wide class of graphs. For instance, it is shown that a 2-regular graph containing five cycles, each of length 4k, has an $\alpha$-valuation. Furthermore we investigate the existence of $\alpha$-valuations for graphs composed of the disjoint union of n-cycles. The results considerably enlarge the class of 2-regular graphs known to have $\alpha$-valuations.Ph.D

Extension of α-labelings of quadratic graphs

First, a new proof for the existence of an α-labeling of the quadratic graph Q(3,4k) is presented. Then the existence of α-labelings of special classes of quadratic graphs with some isomorphic components is shown

Application of Operations Research in Health System of Iran

In this paper first a brief literature survey on applications of operations research in health care systems is presented. Then two problems the optimal allocation of ambulances and the scheduling of nursing personnel are discussed in details. Finally these two models will be applied on two real cases in iranian health care system

Applications of mathematical programming in graceful labeling of graphs

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a branching method is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices but our model can easily solve the graceful labeling for trees with 40 vertices

An ACO Algorithm for the Graph Coloring Problem

Ant Colony Optimization (ACO) is a well-known metaheuristic in which a colony of artificial ants cooperates in exploring good solutions to a combinatorial optimization problem. In this paper, an ACO algorithm is presented for the graph coloring problem. This ACO algorithm conforms to Max-Min Ant System structure and exploits a local search heuristic to improve its performance. Experimental results on DIMACS test instances show improvements over existing ACO algorithms for the graph coloring problem

An efficient tabu algorithm for the single row facility layout problem

The general goal of the facility layout problem is to arrange a given number of facilities to minimize the total cost associated with the known or projected interactions between them. One of the special classes of the facility layout problem is the Single Row Facility Layout Problem (SRFLP), which consists of finding an optimal linear placement of rectangular facilities with varying dimensions on a straight line. This paper first presents and proves a theorem to find the optimal solution of a special case of SRFLP. The results obtained by this theorem prove to be very useful in reducing the computational efforts when a new algorithm based on tabu search for the SRFLP is proposed in this paper. Computational results of the proposed algorithm on benchmark problems show the greater efficiency of the algorithm compared to the other heuristics for solving the SRFLP.Facilities planning and design Linear ordering problem Tabu search Integer programming