Search results for " Simulation"
showing 10 items of 4034 documents
Stochastic dynamics of leukemic cells under an intermittent targeted therapy
2009
The evolutionary dynamics of cancerous cell populations in a model of Chronic Myeloid Leukemia (CML) is investigated in the presence of an intermittent targeted therapy. Cancer development and progression is modeled by simulating the stochastic evolution of initially healthy cells which can experience genetic mutations and modify their reproductive behavior, becoming leukemic clones. Front line therapy for the treatment of patients affected by CML is based on the administration of tyrosine kinase inhibitors, namely imatinib (Gleevec) or, more recently, dasatinib or nilotinib. Despite the fact that they represent the first example of a successful molecular targeted therapy, the development o…
Vector coherent states and intertwining operators
2009
In this paper we discuss a general strategy to construct vector coherent states of the Gazeau-Klauder type and we use them to built up examples of isospectral hamiltonians. For that we use a general strategy recently proposed by the author and which extends well known facts on intertwining operators. We also discuss the possibility of constructing non-isospectral hamiltonians with related eigenstates.
System size dependence of the autocorrelation time for the Swendsen-Wang Ising model
1990
Abstract We present Monte Carlo simulation results of the autocorrelation time for the Swendsen-Wang method for the simulation of the Ising model. We have calculated the exponential and the integrated autocorrelation time at the critical point T c of the two-dimensional Ising model. Our results indicate that both autocorrelation times depend logarithmically on the linear system size L instead of a power law. The simulations were carried out on the parallel computer of the condensed matter theory group at the University of Mainz.
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
The Serial Property and Restricted Balanced Contributions in discrete cost sharing problems
2006
We show that the Serial Poperty and Restricted Balanced Contributions characterize the subsidy-free serial cost sharing method (Moulin (1995)) in discrete cost allocation problems.
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
2018
Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…
Hores: A timetabling system for Spanish secondary schools
1995
Constructing a timetable is a difficult problem faced by every school every year. A feasible solution has to satisfy many different requirements and constraints. A good solution has to provide compact timetables for classes and teachers. In order to help the schools, we have developed HORES, a robust and flexible timetabling system suited to the needs of Spanish secondary schools. HORES runs on a PC and is fast and user-friendly. It may handle virtually every condition required by the schools and obtains good quality solutions in very short computing times. It also allows the user to modify interactively the solutions. HORES is now being used by schools with satisfactory results.
New approach to numerical computation of the eigenfunctions of the continuous spectrum of three-particle Schrödinger operator: I. One-dimensional par…
2009
Basing on analogy between the three-body scattering problem and the diffraction problem of the plane wave (for the case of the short range pair potentials) by the system of six half transparent screens, we presented a new approach to the few-body scattering problem. The numerical results have been obtained for the case of the short range nonnegative pair potentials. The presented method allows a natural generalization to the case of the long range pair potentials.
Stochastic Learning for SAT- Encoded Graph Coloring Problems
2010
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.
Searching for a strong double tracing in a graph
1998
Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.