A systematic approach is presented for developing entropy stable (SS) formulations of any order for the Navier-Stokes equations. These SS formulations discretely conserve mass, momentum, energy and satisfy a mathematical entropy inequality. They are valid for smooth as well as discontinuous flows provided sufficient dissipation is added at shocks and discontinuities. Entropy stable formulations...

The paper describes a search for increasingly large extrema (ILE) of ∣∣ζ( 1 2 + it) ∣∣ in the range 0 ≤ t ≤ 1013. For t ≤ 106, the complete set of ILE (57 of them) was determined. In total, 162 ILE were found, and they suggest that ζ( 1 2 + it) = Ω(t2/ √ log t log log t). There are several regular patterns in the location of ILE, and arguments for these regularities are presented. The paper con...

This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first order logic As opposed to earlier treatments, we introduce a new, fully probabilistic method to assign computational semantics to the syntax. The idea is to make use of the usual mathematical treatment of stochastic processes, henc...

Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher-order notions. The traditional approach to representing and reasoning about meaning in a computational setting has been to use knowledge representation systems that are either based on first-order logic or that use mechanisms whose formal justifications are to be provided...

People generate counterfactual alternatives to reality when they think about how things might have happened differently, 'if only...'. There are considerable regularities in the sorts of past events that people mentally undo, for example, they tend to mentally undo the most recent event in an independent sequence. Consider a game in which two contestants will win £1000 if they both pick cards f...

This work surveys mathematical foundations of Model Order Reduction (MOR for short) techniques in accelerating computational forward and inverse UQ. Operator equations (comprising elliptic and parabolic Partial Differential Equations (PDEs for short) and Boundary Integral Equations (BIEs for short)) with distributed uncertain input, being an element of an infinitedimensional, separable Banach s...

Nowadays, the model order reduction techniques have become an intensive research field because of the increasing interest in the computational modeling of complex phenomena in multiphysic problems, and its consequent increment in high-computing demanding processes; it is well known that the availability of high-performance computing capacity is, in most of cases limited, therefore, the model or...

This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on λ-abstractions, using the instance CFLP(C) of the generic Constraint Functional Logic Programming (CFLP ) scheme [7] over a so-called higher-order coordination domain C. We provide this framework as a powerful co...

Patterning is a familiar approach for imparting novel functionalities to free surfaces. We extend the patterning paradigm to interfaces between crystalline solids. Many interfaces have non-uniform internal structures comprised of misfit dislocations, which in turn govern interface properties. We develop and validate a computational strategy for designing interfaces with controlled misfit disloc...