Search results for "Modeling and simulation"
showing 10 items of 1561 documents
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.
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.
On the use of asymptotic expansion in computing the null distribution of page's L-statistic
1989
Suppose that each out of n randomized complete blocks is obtained by observing a jointly continuous random variable taking values in Rk. Page's L-statistic is given then as a sum of i.i.d. lattice variables with finite moments of any order. Applying a well-known theorem on asymptotic expansions for the distribution function of such a sum yields higher order approximations to the significance probability of any observed value of L. The formula obtained by discarding terms smaller than o(n –1) is still very simple to use. Yet, due to it's strong analytical basis, it can be expected to provide substantial improvement on the traditional normal approximation. The results of extensive numerical i…
Local Spatial Log-Gaussian Cox Processes for seismic data
2022
AbstractIn this paper, we propose the use of advanced and flexible statistical models to describe the spatial displacement of earthquake data. The paper aims to account for the external geological information in the description of complex seismic point processes, through the estimation of models with space varying parameters. A local version of the Log-Gaussian Cox processes (LGCP) is introduced and applied for the first time, exploiting the inferential tools in Baddeley (Spat Stat 22:261–295, 2017), estimating the model by the local Palm likelihood. We provide methods and approaches accounting for the interaction among points, typically described by LGCP models through the estimation of th…