نتایج جستجو برای: minimal realization
تعداد نتایج: 188262 فیلتر نتایج به سال:
We describe a graph-based generation system that participated in the TUNA attribute selection and realisation task of the REG 2008 Challenge. Using a stochastic cost function (with certain properties for free), and trying attributes from cheapest to more expensive, the system achieves overall .76 DICE and .54 MASI scores for attribute selection on the development set. For realisation, it turns ...
The authors have recently proposed a model for a neural mechanism of internal timer. Here we report on predictions, which the model provides for psychological experiment of interval timing by the method of reproduction. We consider the ratio " /m with m and being the mean and the kth central moment of the lengths of intervals reproduced by a subject. The model predicts that for arbitrary k, is ...
One approach to deliberation about the choice of what to do in a particular situation is to use an argument scheme based on the practical syllogism to supply a presumptive reason for the action, which is then subjected to a process of critical questioning to see if the presumption can be maintained. In this paper we describe an implemented realisation of this approach. We describe a representat...
We discuss the origin of the difference between the harmonic value of the width of the multiphonon giant resonances and the smaller observed value. Analytical expressions are derived for both the effective width and the average cross-section. The contribution of the Brink-Axel mechanism in resolving the discrepancy is pointed out. . ∗Supported in part by CNPq and FAPESP.
The graph realization problem is to find for given nonnegative integers a1, . . . , an a simple graph (no loops or multiple edges) such that each vertex vi has degree ai. Given pairs of nonnegative integers (a1, b1), . . . , (an, bn), (i) the bipartite realization problem ask whether there is a bipartite graph (no loops or multiple edges) such that vectors (a1, ..., an) and (b1, ..., bn) corres...
This paper studies various types of input/output representations for nonlinear continuous time systems. The algebraic and analytic i/o equations studied in previous papers by the authors are generalized to integral and integro-differential equations, and an abstract notion is also considered. New results are given on generic observability, and these results are then applied to give conditions u...
This paper presents one of the first acoustic investigations into the realization of tone in Sesotho, a Southern African language, employing a set of recorded minimal pairs, whose F0 contours are analyzed using the Fujisaki model. Analysis of model parameters shows that high tones are associated with tone commands whereas low tones either follow the phrase contour or are marked by creaky voice....
The minimal-work principle asserts that work done on a thermally isolated equilibrium system is minimal for the slowest (adiabatic) realization of a given process. This principle, one of the formulations of the second law, is operationally well defined for any finite (few particle) Hamiltonian system. Within classical Hamiltonian mechanics, we show that the principle is valid for a system of wh...
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degreesequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A degreesequence-forcing set is minimal if no proper subset is degree-sequenceforcing. We characterize the non-minimal degree-sequ...
In this chapter we address the question of how to construct a DBMS architecture supporting TSQL2. Our goal is to enumerate the changes that a conventional DBMS would need to support TSQL2. We are concerned with modifying a conventional DBMS in a minimal fashion to support TSQL2. While a more elaborate architecture is possible (likely with significant performance gains), our purpose is to descri...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید