In [4], Jin and Xin developed a class of firstand second-order relaxing schemes for nonlinear conservation laws. They also obtained the relaxed schemes for conservation laws by using a Hilbert expansion for the relaxing schemes. The relaxed schemes were proved to be total variational diminishing (TVD) in the zero relaxation limit for scalar equations. In this paper, by properly choosing the num...

We extend the concept of relaxed α-monotonicity to mixed relaxed α-β-monotonicity. The concept of mixed relaxed α-β-monotonicity is more general than many existing concepts of monotonicities. Finally, we apply this concept and well known KKM-theory to obtain the solution of generalized equilibrium problem.

Relaxed models are abstract problem descriptions generated by ignoring constraints that are present in base-level problems. They play an important role in planning and search algorithms, as it has been shown that the length of an optimal solution to a relaxed model yields a monotone heuristic for an A search of a base-level problem. Optimal solutions to a relaxed model may be computed algorithm...

Despite its success, the delete relaxation has significant pitfalls. In an attempt to overcome these pitfalls, recent work has devised so-called red-black relaxed plan heuristics, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. These heuristics were shown to significantly improve over standard delete relaxation heuris...

The current state-of-the-art approach in grapheme-to-phoneme (g2p) conversion is structured learning based on the Margin Infused Relaxed Algorithm (MIRA), which is an online discriminative training method for multiclass classification. However, it is known that the aggressive weight update method of MIRA is prone to overfitting, even if the current example is an outlier or noisy. Adaptive Regul...

Grapheme-to-phoneme (g2p) conversion, used to estimate the pronunciations of out-of-vocabulary (OOV) words, is a highly important part of recognition systems, as well as text-to-speech systems. The current state-of-the-art approach in g2p conversion is structured learning based on the Margin Infused Relaxed Algorithm (MIRA), which is an online discriminative training method for multiclass class...

Relaxation skyline queries have been proposed, in the relational context, as a solution to the so-called empty answer problem. Given a query composed of selection and join operations, a relaxation skyline query relies on the usage of a relaxation function (usually, a numeric function) to quantify the distance of each tuple (pair of tuples in case of join) from the specified conditions and uses ...

Information-flow security typing statically prevents confidential information to leak to public channels. The fundamental information flow property, known as noninterference, states that a public observer cannot learn anything from private data. As attractive as it is from a theoretical viewpoint, noninterference is impractical: real systems need to intentionally declassify some information, se...

Despite its success, the delete relaxation has significant pitfalls. Recent work has devised the red-black planning framework, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. Provided the red variables are chosen so that redblack plan generation is tractable, one can generate such a plan for every search state, and ta...

B-trees with relaxed balance have been deened to facilitate fast updating in a concurrent database environment. In that structure, updating and rebalancing are uncoupled such that extensive locking can be avoided in connection with updates. Constraints, weaker than the usual ones, are maintained such that the tree can still be balanced independent of the updating processes. We nd the idea of re...