Cut scores are test scores used in mastery testing and in certification tests to identify those test takers who appear to have achieved at a predetermined level of proficiency. Cut scores are often used to differentiate test takers on a passfail basis. This paper takes up points raised by Berk (2000), discussing the use of reliability and error indices which are particularly appropriate for tes...

This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...

This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...

In this paper, a study of the fabrication of optical microstructures by fast tool servo (FTS) machining technology is presented. The study started from locating the sources of error exclusively involved in ultra-precision machining with FTS, which are stroke error, spatial error, trajectory generation error and errors of cutting parameters such as spindle speed, depth of cut, feed rate, etc. He...

We consider a hierarchical relaxation, called Handelman hierarchy, for a class of polynomial optimization problems. We prove that the rank of Handelman hierarchy, if applied to a standard quadratic formulation of Max-Cut, is exactly the same as the number of nodes of the underlying graph. Also we give an error bound for Handelman hierarchy, in terms of its level, applied to the Max-Cut formulat...

This report presents a mesh adaptation method for higher-order (p > 1) discontinuous Galerkin (DG) discretizations of the two-dimensional, compressible Navier-Stokes equations. The method uses a mesh of triangular elements that are not required to conform to the boundary. This triangular, cut-cell approach permits anisotropic adaptation without the difficulty of constructing meshes that conform...

This paper presents a mesh adaptation method for higher-order (p > 1) discontinuous Galerkin (DG) discretizations of the two-dimensional, compressible Navier–Stokes equations. A key feature of this method is a cut-cell meshing technique, in which the triangles are not required to conform to the boundary. This approach permits anisotropic adaptation without the difficulty of constructing meshes ...

Closed door machining is a strategy for producing a part within tolerance using on-machine measurement and automatic process adjustment as opposed to manual gauging interventions. The paper presents an integrated methodology for compensating errors detected using on-machine probing.In a multi-cut process, intermittent probing which is achieved through replacing the cutting tool with a touch pro...