277,867 research outputs found
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics. We present a framework, reminiscent of structural risk minimization, for empirical risk minimization of probabilistic grammars using the log-loss. We derive sample complexity bounds in this framework that apply both to the supervised setting and the unsupervised setting. By making assumptions about the underlying distribution that are appropriate for natural language scenarios, we are able to derive distribution-dependent sample complexity bounds for probabilistic grammars. We also give simple algorithms for carrying out empirical risk minimization using this framework in both the supervised and unsupervised settings. In the unsupervised case, we show that the problem of minimizing empirical risk is NP-hard. We therefore suggest an approximate algorithm, similar to expectation-maximization, to minimize the empirical risk. Learning from data is central to contemporary computational linguistics. It is in common in such learning to estimate a model in a parametric family using the maximum likelihood principle. This principle applies in the supervised case (i.e., using annotate
Discrete Logarithms in Generalized Jacobians
D\'ech\`ene has proposed generalized Jacobians as a source of groups for
public-key cryptosystems based on the hardness of the Discrete Logarithm
Problem (DLP). Her specific proposal gives rise to a group isomorphic to the
semidirect product of an elliptic curve and a multiplicative group of a finite
field. We explain why her proposal has no advantages over simply taking the
direct product of groups. We then argue that generalized Jacobians offer poorer
security and efficiency than standard Jacobians
Empirical Risk Minimization with Approximations of Probabilistic Grammars
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. We present a framework, reminiscent of structural risk minimization, for empirical risk minimization of the parameters of a fixed probabilistic grammar using the log-loss. We derive sample complexity bounds in this framework that apply both to the supervised setting and the unsupervised setting.
Drawing Boundaries
In “On Drawing Lines on a Map” (1995), I suggested that the different ways we have of drawing lines on maps open up a new perspective on ontology, resting on a distinction between two sorts of boundaries: fiat and bona fide. “Fiat” means, roughly: human-demarcation-induced. “Bona fide” means, again roughly: a boundary constituted by some real physical discontinuity. I presented a general typology of boundaries based on this opposition and showed how it generates a corresponding typology of the different sorts of objects which boundaries determine or demarcate. In this paper, I describe how the theory of fiat boundaries has evolved since 1995, how it has been applied in areas such as property law and political geography, and how it is being used in contemporary work in formal and applied ontology, especially within the framework of Basic Formal Ontology
Analytical study of catalytic reactors for hydrazine decomposition. One and two dimensional steady-state programs, computer programs manual
Programs manual for one-dimensional and two- dimensional steady state models of catalyzed hydrazine decomposition reaction chamber
Effect of Reynolds Number and Mach Number on flow angularity probe sensitivity
Preliminary calibrations were performed on nine flow angularity probes in the Langley 7- by 10-Foot High-Speed Tunnel (7 x 10 HST) and the Langley 0.3-Meter Transonic Cryogenic Tunnel (0.3-m TCT). These probes will be used in surveying the test section flows of the National Transonic Facility (NTF). The probes used in this study have a pyramid head with five pressure orifices. The calibrations consisted of both isolated probe measurements and rake-mounted multiprobe measurements that covered a range of subsonic Mach numbers up to 0.90 and Reynolds numbers per foot up to 40 X 10 to the 6th power. The preliminary calibration in the 7 x 10 HST included testing the probes both individually and in a rake. The 0.3-m TCT calibration tested two probes singly at varying Reynolds numbers. The results from these tests include Mach number, Reynolds number, and rake-mounting effects. The results of these tests showed probe sensitivity to be slightly affected by Mach number. At Reynolds numbers per foot above 10 x 10 to the 6th power, the probe did not exhibit a Reynolds number sensitivity
Dynamic response and stability of a composite prop-fan model
Results are presented for blade response and stability during wind tunnel tests of a 62.2 cm diameter model of a prop-fan, advanced turboprop, with swept graphite/epoxy composite blades. Measurements of dynamic response were made with the rotor mounted on an isolated nacelle, with varying tilt for nonuniform inflow, at flow speeds from 0.36 to 0.9 Mach number. The blade displayed no instabilities over the operating range tested, up to 0.9 Mach number and 10,000 RPM. Measurements are compared with those for other prop-fan models of both solid metal and graphite composite construction. The swept composite blade had less response than an unswept composite blade. Composite blades had more response than metal blades. Measurements are compared with theoretically based predictions. The 1-P blade response was significantly overpredicted using unimproved methods and somewhat overpredicted using improved methods. Unexpectedly high 2-P strain levels were measured and suggest the presence of nonlinear effects on blade response
Mars Mariner 4 - Identification of some Martian surface features
Martian surface features identified from photographs by Mariner 4 space prob
VICAR image processing system guide to system use
The functional characteristics and operating requirements of the Video Image Communication and Retrieval System are detailed
- …
