A limitation of the hydrostatic reconstruction technique for Shallow Water equations

Because of their capability to preserve steady states, well-balanced schemes for Shallow Water equations are becoming popular. Among them, the hydrostatic reconstruction proposed in Audusse et al. (2004) [1], coupled with a positive numerical flux, allows to verify important mathematical and physical properties like the positivity of the water height and, thus, to avoid instabilities when dealing with dry zones. In this note, we prove that this method exhibits an abnormal behavior for some combinations of slope, mesh size and water height.     

A multiwave approximate Riemann solver for ideal MHD based on relaxation. I: theoretical framework

We present a relaxation system for ideal magnetohydrodynamics (MHD) that is an extension of the Suliciu relaxation system for the Euler equations of gas dynamics. From it one can derive approximate Riemann solvers with three or seven waves, that generalize the HLLC solver for gas dynamics. Under some subcharacteristic conditions, the solvers satisfy discrete entropy inequalities, and preserve positivity of density and internal energy. The subcharacteristic conditions are nonlinear constraints on the relaxation parameters relating them to the initial states and the intermediate states of the approximate Riemann solver itself. The 7-wave version of the solver is able to resolve exactly all material and Alfven isolated contact discontinuities. Practical considerations and numerical results will be provided in another paper.     

A method to abstract a stochastic Petri net

We propose a method to abstract a given stochastic Petri net (SPN). We shall show that the reachability tree of the given SPN is isomorphic to a Markov renewal process. Then, the given SPN is transformed to a state transition system (STS) and the STS is reduced. The reduction of states on STS corresponds to a fusion of series transitions on the SPN. The reduced STS is again transformed to an abstract SPN. We show that it is helpful to use the notion of the conditional firstpassage time from a certain state to the others on the STS to reduce nonessential states, thus places and transitions on the given SPN. Mass functions, that is, the distribution functions of conditional first-passage time between preserved states on the reduced MRP, preserve firing probabilities of fused transitions. Firing probability of the preserved transition also preserves the stochastic properties of the fused transitions.     

On Bellman’s principle with inequality constraints

We consider an example by Haviv (1996) [10] of a constrained Markov decision process that, in some sense, violates Bellman’s principle. We resolve this issue by showing how to preserve a form of Bellman’s principle that accounts for a change of constraint at states that are reachable from the initial state.     

Moving-Water Equilibria Preserving HLL-Type Schemes for the Shallow Water Equations

We construct new HLL-type moving-water equilibria preserving upwind schemes for the one-dimensional Saint-Venant system of shallow water equations with nonflat bottom topography. The designed first-and secondorder schemes are tested on a number of numerical examples, in which we verify the well-balanced property as well as the ability of the proposed schemes to accurately capture small perturbations of moving-water steady states.     

Maslov Complex Germ Method for Systems with First-Class Constraints

We develop the semiclassical mechanics of systems with first-class constraints. A convenient quantization method is the method based on modifying the inner product used in the theory. We consider semiclassical states of the wave-packet type (with small indeterminacies in both coordinates and momenta) that appear in the theory of the Maslov complex germ at a point. We show that these states have a nonzero norm only if the classical coordinates and momenta lie on the constraint surface. The set of semiclassical states of the wave-packet type forms a (semiclassical) bundle whose base is the set of admissible classical states and whose fibers are function spaces determining the form of the wave packet. In some cases, the difference between two semiclassical states has a zero norm; it is therefore possible to introduce the gauge equivalence relation. The semiclassical gauge transformations that are automorphisms of the semiclassical bundle form a Batalin quasigroup. We also study the action of semiclassical observables and of semiclassical evolution transformations. We show that they preserve the norm and the gauge equivalence relation and that the observables coinciding on the constraint surface act on semiclassical states similarly up to the gauge invariance.     

A kinetic scheme for the Savage–Hutter equations

The Savage–Hutter (SH) equations describe the motion of granular material under the influence of friction. Based on the kinetic formulation of the SH equations, we present a kinetic scheme in one dimension, which describes the deformation of the mass profile and allows it to start and to stop. Moreover the method is able to preserve the steady states of granular masses at rest. The method is tested on several numerical examples. Copyright © 2008 John Wiley & Sons, Ltd.     

A Survey of High Order Schemes for the Shallow Water Equations

In this paper, we survey our recent work on designing high order positivity-preserving well-balanced finite difference and finite volume WENO (weighted essentially non-oscillatory) schemes, and discontinuous Galerkin finite element schemes for solving the shallow water equations with a non-flat bottom topography. These schemes are genuinely high order accurate in smooth regions for general solutions, are essentially non-oscillatory for general solutions with discontinuities, and at the same time they preserve exactly the water at rest or the more general moving water steady state solutions. A simple positivity-preserving limiter, valid under suitable CFL condition, has been introduced in one dimension and reformulated to two dimensions with triangular meshes, and we prove that the resulting schemes guarantee the positivity of the water depth.     

Classification theorems for operators preserving zeros in a strip

We characterize all linear operators which preserve certain spaces of entire functions whose zeros lie in a closed strip. Necessary and sufficient conditions are obtained for the related problem with real entire functions, and some classical theorems of de Bruijn and Pólya are extended. Specifically, we reveal new differential operators which map real entire functions whose zeros lie in a strip to real entire functions whose zeros lie in a narrower strip; this is one of the properties that characterize a “strong universal factor” as defined by de Bruijn. Using elementary methods, we prove a theorem of de Bruijn and extend a theorem of de Bruijn and Ilieff which states a sufficient condition for a function to have a Fourier transform with only real zeros.     

Robustness Revised: Frankfurt Cases and the Right Kind of Power to Do Otherwise

Frankfurt’s famous counterexample strategy challenges the traditional association between moral responsibility and alternative possibilities. While this strategy remains controversial, it is now widely agreed that an adequate response to it must preserve an agent’s ability to do otherwise, and not the mere possibility, for only then is her alternative possibility sufficiently robust to ground her responsibility. Here, I defend a more stringent requirement for robustness. To have a robust alternative, I argue, the agent must have the right kind of ability, where the right kind is such that it is up to her whether she does otherwise. I argue that this kind of power attribution is epistemically conditioned. While a few writers have defended an epistemic condition for robustness, seeing this condition as a consequence of the relevant power attributions will provide much-needed support and clarification, while also illuminating the kind of ability in which free will consists.     

Genetic algorithms and traveling salesman problems

A genetic algorithm (GA) with an asexual reproduction plan through a generalized mutation for an evolutionary operator is developed that can be directly applied to a permutation of n numbers for an approximate global optimal solution of a traveling salesman problem (TSP). Schema analysis of the algorithm shows that a sexual reproduction with the generalized mutation operator preserves the global convergence property of a genetic algorithm thus establishing the fundamental theorem of the GA for the algorithm. Avoiding an intermediate step of encoding through random keys to preserve crossover or permuting n and using “fixing” states for legal crossover are the chief benefits of the innovations reported in this paper. The algorithm has been applied to a number of natural and artificial problems and the results are encouraging.     

基于辛格式的深度哈密尔顿神经网络

HNN是一类基于物理先验学习哈密尔顿系统的神经网络.本文通过误差分析解释使用不同积分器作为超参数对HNN的影响.如果我们把网络目标定义为在任意训练集上损失为零的映射,那么传统的积分器无法保证HNN存在网络目标.我们引进反修正方程,并严格证明基于辛格式的HNN具有网络目标,且它与原哈密尔顿量之差依赖于数值格式的精度.数值实验表明,由辛HNN得到的哈密尔顿系统的相流不能精确保持原哈密尔顿量,但保持网络目标;网络目标在训练集、测试集上的损失远小于原哈密尔顿量的损失;在预测问题上辛HNN较非辛HNN具备更强大的泛化能力和更高的精度.因此,辛格式对于HNN是至关重要的.     

A test problem for molecular dynamics integrators

We derive a test problem for evaluating the ability of time-steppingmethods to preserve the statistical properties of systems inmolecular dynamics. We consider a family of deterministic systemsconsisting of a finite number of particles interacting on acompact interval. The particles are given random initial conditionsand interact through instantaneous energy- and momentum-conservingcollisions. As the number of particles, the particle density,and the mean particle speed go to infinity, the trajectory ofa tracer particle is shown to converge to a stationary Gaussianstochastic process. We approximate this system by one describedby a system of ordinary differential equations and provide numericalevidence that it converges to the same stochastic process. Wesimulate the latter system with a variety of numerical integrators,including the symplectic Euler method, a fourth-order Runge-Kuttamethod, and an energyconserving step-and-project method. Weassess the methods' ability to recapture the system's limitingstatistics and observe that symplectic Euler performs significantlybetter than the others for comparable computational expense.     

Generic Initial Ideals and Distractions

ABSTRACT

The generic initial ideals of a given ideal are rather recent invariants. Not much is known about these objects,and it turns out to be very difficult to compute them. The main purpose of this paper is to study the behaviour of generic initial ideals with respect to the operation of taking distractions. Theorem 4.3 is our main result. It states that the DegRevLex-generic initial ideal of the distraction of a strongly stable ideal is the ideal itself. In proving this fact, we develop some new results related to distractions, stable and strongly stable ideals. We draw some geometric conclusions for ideals of points.     

RESTRICTED COALITIONS IN THE MANAGEMENT OF REGIONAL FISHERIES ORGANIZATIONS

ABSTRACT. In this paper, we examine a game theoretic setting in which four countries have established a regional organization for the conservation and management of straddling and highly migratory fish stocks as recommended by the United Nations Agreement. These countries consist of two coastal states and two distant water fishing nations (DWFNs). A characteristic function game approach is applied to describe the sharing of the surplus benefits from cooperation. We are specifically interested in the effect of possible coalition restrictions on these shares. According to our results the distant water fishing nations, by individually refusing to join with the coastal states, can considerably improve their negotiation position if their harvesting costs are relatively high and similar. The results show that the DWFNs may have economic reasons for negotiating as a group against coastal states. However, if the coastal states are clearly more efficient than the DWFNs then coalition restrictions may be prevented by coastal states.     

Conservative finite difference schemes for the Degasperis–Procesi equation

We consider the numerical integration of the Degasperis–Procesi equation, which was recently introduced as a completely integrable shallow water equation. For the equation, we propose nonlinear and linear finite difference schemes that preserve two invariants associated with the bi-Hamiltonian form of the equation at the same time. We also prove the unique solvability of the schemes, and show some numerical examples.     

Can Monte-Carlo Tree Search learn to sacrifice?

One of the most basic activities performed by an intelligent agent is deciding what to do next. The decision is usually about selecting the move with the highest expectation, or exploring new scenarios. Monte-Carlo Tree Search (MCTS), which was developed as a game playing agent, deals with this exploration–exploitation ‘dilemma’ using a multi-armed bandits strategy. The success of MCTS in a wide range of problems, such as combinatorial optimisation, reinforcement learning, and games, is due to its ability to rapidly evaluate problem states without requiring domain-specific knowledge. However, it has been acknowledged that the trade-off between exploration and exploitation is crucial for the performance of the algorithm, and affects the efficiency of the agent in learning deceptive states. One type of deception is states that give immediate rewards, but lead to a suboptimal solution in the long run. These states are known as trap states, and have been thoroughly investigated in previous research. In this work, we study the opposite of trap states, known as sacrifice states, which are deceptive moves that result in a local loss but are globally optimal, and investigate the efficiency of MCTS enhancements in identifying this type of moves.