A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation supports all operations as efficiently as the original: find -min, insert , and decrease (also called decrease-key) in O(1) worst-case time, and delete in O(lg n) worst-case time, n denoting the number of elements stored prior to the operation. These time bounds are valid on...

Several papers have recently presented results of measurements of physical aging by studying the behavior of glassy materials quenched from temperatures above their glass transition temperature g T . The evolution of the aging process is usually followed by plotting the relaxed enthalpy versus the accompanying decrease in volume. Here, we focus on the slope of such plots, which are found to be ...

0

in this paper, we use the concept of graph convergence of h(.,.)-co-accretive mapping introduced by [r. ahmad, m. akram, m. dilshad, graph convergence for the h(.,.)-co-accretive mapping with an application, bull. malays. math. sci. soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...

Recently, several methods have been proposed for optimal delete-free planning. We present an incremental compilation approach that enables these methods to be applied to problems with conditional effects, which none of them support natively. With an h solver for problems with conditional effects in hand, we also consider adapting the h anytime lower bound function to use the more spaceefficient...

We review a number of perturbative calculations describing the interactions of D-branes with massless elementary string states. The form factors for the scattering of closed strings off D-branes are closely related to the Veneziano amplitude. They show that, in interactions with strings, D-branes acquire many of their physical features: the effective size of D-branes is of order the string scal...

Abstract: Dependency parsing is an important subtask of natural language processing. In this paper, we propose an embedding feature transforming method for graph-based parsing, transform-based parsing, which directly utilizes the inner similarity of the features to extract information from all feature strings including the un-indexed strings and alleviate the feature sparse problem. The model t...

We use the Margin Infused Relaxed Algorithm of Crammer et al. to add a large number of new features to two machine translation systems: the Hiero hierarchical phrasebased translation system and our syntax-based translation system. On a large-scale ChineseEnglish translation task, we obtain statistically significant improvements of +1.5 B and +1.1 B, respectively. We analyze the impact of ...