Entity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, while in WSD there is a perfect match between the word form (better, its lemma) and a suitable word sense...

In this paper, a novel approach for control of the DC-DC buck converter in high-power and low-voltage applications is proposed. Designed method is developed according to state feedback linearization based controller , which is able to stabilize output voltage in a wide range of operation. It is clear that in high-power applications, parasitic elements of the converter may become comparable with...

For input delayed systems, the sequential subpredictor (SSP) control scheme has advantage that arbitrarily large delays can be tolerated in loop by introducing more and subpredictors. However, an exact delay compensation is not possible presence of time-varying mismatches, larger cannot therefore obtained increasing number To alleviate this limitation enhance robustness against uncertainties, a...

In this paper, the equivalent linearization method with a weighted averaging proposed by Anh (2015) is applied to analyze the transverse vibration of quintic nonlinear Euler-Bernoulli beams subjected to axial loads. The proposed method does not require small parameter in the equation which is difficult to be found for nonlinear problems. The approximate solutions are harmonic oscillations, whic...

A sequence of integers generated by the number of conjugated pairs of homaloidal nets of plane algebraic curves of even order is found to provide an exact integer-valued match for El Naschie’s primordial set of fractal dimensions characterizing transfinite heterotic string space-time.

We propose a block-iterative parallel decomposition method to solve quadratic signal recovery problems under convex constraints. The idea of the method is to disintegrate the original multi-constraint problem into a sequence of simple quadratic minimizations over the intersection of two half-spaces constructed by linearizing blocks of constraints. The implementation of the algorithm is quite ex...

This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a broad class of quadratic integer programming problems, wherein M pairwise related entities are assigned to N destinations constrained by the destinations’ ability to accommodate them. This new algorithm is based on a Reformulation Linearization Technique (RLT) dual ascent procedur...

In this paper, we study time discretizations of fully nonlinear parabolic differential equations. Our analysis uses the fact that the linearization along the exact solution is a uniformly sectorial operator. We derive smooth and nonsmooth-data error estimates for the backward Euler method, and we prove convergence for strongly A(θ)stable Runge–Kutta methods. For the latter, the order of converg...