Document Logical Structure Analysis Based on Perceptive Cycles

The original publication is available at "http://www.springerlink.com/"International audienceThis paper describes a Neural Network (NN) approach for logical document structure extraction. In this NN architecture, called Transparent Neural Network (TNN), the document structure is stretched along the layers, allowing an interpretation decomposition from physical (NN input) to logical (NN output) level. The intermediate layers represent successive interpretation steps. Each neuron is apparent and associated to a logical element. The recognition proceeds by repetitive perceptive cycles propagating the information through the layers. In case of low recognition rate, an enhancement is achieved by error backpropagation leading to correct or pick up a more adapted input feature subset. Several feature subsets are created using a modified filter method. The first experiments performed on scientific documents are encouraging

Structure Extraction in Printed Documents Using Neural Approaches

This paper addresses the problem of layout and logical structure extraction from image documents. Two classes of approaches are first studied and discussed in general terms: data-driven and model-driven. In the latter, some specific approaches like rule-based or formal grammar are usually studied on very stereotyped documents providing honest results, while in the former artificial neural networks are often considered for small patterns with good results. Our understanding of these techniques let us to believe that a hybrid model is a more appropriate solution for structure extraction. Based on this standpoint, we proposed a Perceptive Neural Network based approach using a static topology that possesses the characteristics of a dynamic neural network. Thanks to its transparency, it allows a better representation of the model elements and the relationships between the logical and the physical components. Furthermore, it possesses perceptive cycles providing some capacities in data refinement and correction. Tested on several kinds of documents, the results are better than those of a static Multilayer Perceptron

A structural representation for understanding line-drawing images

International audienceIn this paper, we are concerned with the problem of finding a good and homogeneous representation to encode line-drawing documents (which may be handwritten). We propose a method in which the problems induced by a first-step skeletonization have been avoided. First, we vectorize the image, to get a fine description of the drawing, using only vectors and quadrilateral primitives. A structural graph is built with the primitives extracted from the initial line-drawing image. The objective is to manage attributes relative to elementary objects so as to provide a description of the spatial relationships (inclusion, junction, intersection, etc.) that exist between the graphics in the images. This is done with a representation that provides a global vision of the drawings. The capacity of the representation to evolve and to carry highly semantic information is also highlighted. Finally, we show how an architecture using this structural representation and a mechanism of perceptive cycles can lead to a high-quality interpretation of line drawings

Keynes's German Contenders 1932-1944: On the Sociology of Multiple Discoveries in Economics

In a pathbreaking study on some alleged anticipations of Keynes''s General Theory of Employment, Interest and Money, Don Patinkin in apparently applying Merton''s sociological approach to the problem of anticipations and multiples in economics, rejects Kalecki and the Stockholm School as anticipators. Patinkin''s contribution has a dual significance in improving our understanding of Keynesian economics, on the one hand, and in suggesting a novel approach to the sociology of economics on the other. This paper is concerned with Patinkin''s sociology. His approach by emphasizing the "central message" of a particular work, neglects the received sociological theory of knowledge in a way that compromises his entire investigation. This contention is illustrated by looking at Keynes''s German contenders. They had anticipated Keynesian theories and applied them in the years before the General Theory was published. Nevertheless, they rejected aspects of Keynesian economics after the appearanced the General Theory. True to his narrowly focussed approach, Patinkin could not analyze this body of work, which both anticipated and extended the General Theory. Keynes''s central message significantly differed from that of his contenders.public economics ;

The Epistemology of Simulation, Computation and Dynamics in Economics Ennobling Synergies, Enfeebling 'Perfection'

Lehtinen and Kuorikoski ([73]) question, provocatively, whether, in the context of Computing the Perfect Model, economists avoid - even positively abhor - reliance on simulation. We disagree with the mildly qualified affirmative answer given by them, whilst agreeing with some of the issues they raise. However there are many economic theoretic, mathematical (primarily recursion theoretic and constructive) - and even some philosophical and epistemological - infelicities in their descriptions, definitions and analysis. These are pointed out, and corrected; for, if not, the issues they raise may be submerged and subverted by emphasis just on the unfortunate, but essential, errors and misrepresentationsSimulation, Computation, Computable, Analysis, Dynamics, Proof, Algorithm

An exact approach for single machine scheduling with quadratic earliness and tardiness penalties

In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose two different lower bounds, as well as a lower bounding procedure that combines these two bounds. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The lower bounding procedure and the branch-and-bound algorithms are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonable computation times, instances with up to 20 jobs.scheduling, single machine, quadratic earliness and tardiness, lower bounds, branch-and-bound

Aerospace Medicine and Biology: A continuing bibliography with indexes (supplement 156)

This bibliography lists 170 reports, articles, and other documents introduced into the NASA scientific and technical information system in June 1976