S1 . Parameter estimation for finetuning with structured SVM objective . . . . . . . . . . . . . . . . . . . . . 1 S2 . Details on hard negative data mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 S3 . Implementation details on model parameter estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 S4 . Efficiency of fine-grained search (FGS) ....

BACKGROUND To introduce a new technique of laser-assisted conjunctival cystectomy using pattern scan laser (PASCAL) photocoagulation. CASE PRESENTATION A 50-years-old Asian woman presented with a conjunctival cyst in the left eye. Slit-lamp examination revealed a 5 mm × 2 mm sized freely movable conjunctival cyst. After a 1 mm × 1 mm sized conjunctival opening was made using PASCAL photocoagu...

Consider a triangle whose three vertices are grid points. Let k denote the number of grid points in the triangle. We describe an indexing of the triangle: a bijective mapping from f0;. .. ; k ?1g to the grid points in the triangle. Computing such a mapping is a fundamental subroutine in ne-grained parallel computation arising in graphics applications such as ray-tracing. We describe a very fast...

Every polynomial of degree n has n roots; every continuous function on [0, 1] attains its maximum; every real symmetric matrix has a complete set of orthonormal eigenvectors. “General theorems” are a big part of the mathematics we know. We can hardly resist the urge to generalize further! Remove hypotheses, make the theorem tighter and more difficult, include more functions, move into Hilbert s...

In this paper, we carefully re-examine the chaotic RF model, first studied by Rabinovich & Fabrikant [1979], and found many new and rich complex dynamics of the model that were mostly not reported before. The chaotic RF model has proved to be a great challenge to classical numerical methods, in the sense that most classical numerical methods have not been very successful in studying the complex...

Recently the author proposed two extensions of Pascal and q-Pascal matrices defined here also in the spirit of the Ward ”Calculus of sequences” [1] promoted in the framework of the ψFinite Operator Calculus [2,3] . Specifications to q-calculus case and Fibonomial calculus case are made explicit as an example of abundance of new possibilities being opened. In broader context the ψ-Pascal Pψ[x] a...

We often need to refer to adjacent elements (e.g., vertices, edges and faces) in triangle meshes for rendering, mesh simplification and other processes. It is, however, sometimes impossible to prepare the enormous memory needed to represent element connectivity in gigantic triangle meshes. We proposed a memory efficient scheme for referring to adjacent faces around a vertex in non-manifold tria...

Isosceles trapezoids are dissected into three similar triangles and rearranged to form two additional isosceles trapezoids. Moreover, triangle centers, one from each similar triangle, form the vertices of a centric triangle which has special properties. For example, the centroidal triangles are congruent to each other and have an area one-ninth of the area of the trapezoids; whereas, the circum...

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the subnet mesh size goes to zero. The validity of this method is tested for bond percolation on filled checkerboard and "stack-of-triangle" lattices. Thresholds for the checkerboard lattices of different mesh sizes are estimated using the gradient percolation method,...

The area of the unitarity triangle is a measure of CP-violation. We introduce the leptonic unitarity triangles and study their properties. We consider the possibility of reconstructing the unitarity triangle in future oscillation and non-oscillation experiments. A set of measurements is suggested which will, in principle, allow us to measure all sides of the triangle, and consequently to establ...