Deep Boltzmann machines are in theory capable of learning efficient representations of seemingly complex data. Designing an algorithm that effectively learns the data representation can be subject to multiple difficulties. In this chapter, we present the “centering trick” that consists of rewriting the energy of the system as a function of centered states. The centering trick improves the condi...

Simulation based yield optimisation is becoming an important solution for increasing robustness of analog IP blocks. This paper describes the yield optimisation of a power-on reset cell as part of an analog IP library. Yield analysis of the initial design is performed and sensitivities with respect to process parameters are determined by Monte Carlo simulation. The input parameters used for the...

This paper presents a corpus-based investigation of the use of zero pronouns in Hindi. After establishing that the antecedents of these null arguments cannot be recovered syntactically (Rizzi, 1982; Jaeggli & Safir, 1989), I propose an account in terms of "Centering Theory" (Grosz et al., 1995). Given the Hindi-specific centering constraints proposed in Prasad & Strube (2000), I argue that the ...

Existing software systems for automated essay scoring can provide NLP researchers with opportunities to test certain theoretical hypotheses, including some derived from Centering Theory. In this study we employ ETS's e-rater essay scoring system to examine whether local discourse coherence, as de ned by a measure of Rough-Shift transitions, might be a signi cant contributor to the evaluation of...

Hubness has been recently identified as a problematic phenomenon occurring in high-dimensional space. In this paper, we address a different type of hubness that occurs when the number of samples is large. We investigate the difference between the hubness in highdimensional data and the one in large-sample data. One finding is that centering, which is known to reduce the former, does not work fo...

A simple and uniied analysis is provided on the rate of local convergence for a class of high-order-infeasible-path-following algorithms for the P-linear complementarity problem (P-LCP). It is shown that the rate of local convergence of a-order algorithm with a centering step is + 1 if there is a strictly complementary solution and (+ 1)=2 otherwise. For the-order algorithm without the centerin...

The centering frmnework explains local coherence by relating local focus mid the lbrm of referring expressions. It has proven useful in monolog, but its utility lot multiparty discourse has not been shown, and a variety of issues must be tackled to adapt the model lot dialog. This paper reports our application of three naive models of centering theory lot dialog. These results will be used as b...

We argue that it is a mistake to define a total preference ordering on the well-known centering transitions CONTINUE, RETAIN, SHIFT and that they are in fact epiphenomenal; a partial ordering emerges from the interaction between cohesion (maintaining the same center) and salience (realising the center as Subject). We propose a new formulation of Rule 2 of centering theory incorporating these pr...

This paper does two things. First, it relates the notions of power system security to the concepts of design centering. A benefit is a family of metrics for measuring security. Such metrics are badly needed security is too ephemeral to lend itself readily to measurement. Second, the paper develops a method for solving centering problems and thereby, extremis ing the aforementioned security metr...