Robust named entity detection from optical character recognition output

In this paper, we focus on information extraction from optical character recognition (OCR) output. Since the content from OCR inherently has many errors, we present robust algorithms for information extraction from OCR lattices instead of merely looking them up in the top-choice (1-best) OCR output. Specifically, we address the challenge of named entity detection in noisy OCR output and show that searching for named entities in the recognition lattice significantly improves detection accuracy over 1-best search. While lattice-based named entity (NE) detection improves NE recall from OCR output, there are two problems with this approach: (1) the number of false alarms can be prohibitive for certain applications and (2) lattice-based search is computationally more expensive than 1-best NE lookup. To mitigate the above challenges, we present techniques for reducing false alarms using confidence measures and for reducing the amount of computation involved in performing the NE search. Furthermore, to demonstrate that our techniques are applicable across multiple domains and languages, we experiment with optical character recognition systems for videotext in English and scanned handwritten text in Arabic.     

Multi-objective parameter estimation of induction motor using particle swarm optimization

In order to simplify the offline parameter estimation of induction motor, a method based on optimization using a particle swarm optimization (PSO) technique is presented. Three different induction motor models such as approximate, exact and deep bar circuit models are considered. The parameter estimation methodology describes a method for estimating the steady-state equivalent circuit parameters from the motor performance characteristics, which is normally available from the manufacturer data or from tests. The optimization problem is formulated as multi-objective function to minimize the error between the estimated and the manufacturer data. The sensitivity analysis is also performed to identify parameters, which have the most impact on motor performance. The feasibility of the proposed method is demonstrated for two different motors and it is compared with the genetic algorithm and the classical parameter estimation method. Simulation results show that the proposed PSO method was indeed capable of estimating the parameters over a wide operating range of the motor.     

Scalable satisfiability checking and test data generation from modeling diagrams

We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice. The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT solvers does not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority.     

Watch to Edit: Video Retargeting using Gaze

We present a novel approach to optimally retarget videos for varied displays with differing aspect ratios by preserving salient scene content discovered via eye tracking. Our algorithm performs editing with cut, pan and zoom operations by optimizing the path of a cropping window within the original video while seeking to (i) preserve salient regions, and (ii) adhere to the principles of cinematography. Our approach is (a) content agnostic as the same methodology is employed to re‐edit a wide‐angle video recording or a close‐up movie sequence captured with a static or moving camera, and (b) independent of video length and can in principle re‐edit an entire movie in one shot. Our algorithm consists of two steps. The first step employs gaze transition cues to detect time stamps where new cuts are to be introduced in the original video via dynamic programming. A subsequent step optimizes the cropping window path (to create pan and zoom effects), while accounting for the original and new cuts. The cropping window path is designed to include maximum gaze information, and is composed of piecewise constant, linear and parabolic segments. It is obtained via L(1) regularized convex optimization which ensures a smooth viewing experience. We test our approach on a wide variety of videos and demonstrate significant improvement over the state‐of‐the‐art, both in terms of computational complexity and qualitative aspects. A study performed with 16 users confirms that our approach results in a superior viewing experience as compared to gaze driven re‐editing [ JSSH15 ] and letterboxing methods, especially for wide‐angle static camera recordings.     

A note on universal matrices for triangular finite elements for the quasi-harmonic equation

An algorithm to generate universal matrices for plane triangular finite elements for the general ‘quasi-harmonic’ equation is presented. For every member of the triangle family three numerical universal matrices are obtained which are independent of the size, shape and ‘material’ properties of the element. Of these, two are basic and the third can be generated from one of these two. The element ‘stiffness’ matrix is conveniently generated by manipulating these two basic matrices taking into account the size, shape and material properties of the element in a simple manner.     

A NEW VIEW OF INFORMATION MODELING

The information model was conceived to address the complexities of managing large volumes of data, processes, designs, and tools that are shared by many business users with differing requirements. Because an information model derives much of its features from data models, the distinction between information modeling and data modeling is sometimes unclear. One perspective is that information modeling is context dependent: when a model is viewed as a representation scheme for users to comprehend, it is an information model. When used as a representation scheme to be processed by a computer, it is a data model.     

Dielectric properties of the system Pb2 −x Nd x Li0·5Nb1·5 O6+δ

The dielectric properties of the ceramic defect pyrochlore-structured system Pb_2−x Nd _x Li_0·5Nb_1·5 O_6+δ has been studied as a function of concentrationx, frequency and temperature. The results have been analyzed for relaxation process and conduction mechanism. Now deceased.     

Effect of water deficit on yield and protein content in pearl millet grains

Seventy-two pearl millet genotypes were water stressed at panicle development and grain filling stages. Neither grain yields, yield components, protein percent nor total protein per unit area were affected by water deficit during panicle development but protein content per grain was increased. When plants were water stressed during grain filling, grain yield, grains per unit area and 1000 grain weight were reduced, but grain protein percentage increased. Total protein per unit area was reduced primarily due to lower grain yield. The protein content per grain was unaffected by stress, suggesting that the apparent increase in protein percentage is due to reduced carbohydrate accumulation under stress.     

Ionic conductivity of Ag+ exchanged α-zirconium phosphate

The conductivity of silver ion in silver exchanged α-zirconium phosphate, Zr(AgPO₄)₂, was measured in the temperature range 80 to 330°C. The data were found to conform to an Arrehnius type behavior in this temperature range with an activation energy of 0.53eV and ⁰300°C = 1.94 × 10^?4 ohm^?1 cm^?1. The conductivity values for Ag⁺ are higher than the corresponding values obtained for Na⁺ and K⁺ conduction in their respective exchanged forms. This enhancement is attributed to the greater polarizibility of the silver ion.