Computational models, such as simulations, are central to a wide range of fields in science and industry. Those models take input parameters produce some output. To fully exploit their utility, relations between outputs must be understood. These include, for example, which parameter setting produces the best result (optimization) or ranges settings variety results (sensitivity). Such tasks ofte...

Connectionist network learning of context free languages has so far been applied only to very simple cases and has often made use of an external stack. Learning complex context free languages with a homogeneous neural mechanism looks like a much harder problem. The current paper takes a step toward solving this problem by analyzing context free grammar computation (without addressing learning) ...

We consider a countable quasilinear system of differential equations defined on an infinite-dimensional torus. The problem is to find sufficient conditions under which the investigated possesses invariant torus in space bounded numerical sequences whose generating function can be approximated with any given accuracy by for some linear finite-dimensional This enables us approximate (with degree ...

The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-life situations, due to various reasons such as limited data for learning the model, etc. In this paper, assuming that the parameters of POMDPs are imprecise but bounded, we formulate the framework of bounded-parameter...

Parameter estimation for a parabolic linear stochastic partial differential equation in one space dimension is studied observing the solution field on discrete grid fixed bounded domain. Considering an infill asymptotic regime both coordinates, we prove central limit theorems realized quadratic variations based temporal and spatial increments as well double time space. Resulting method of momen...

We show that every finite connected graph G with maximum degree three and with at least one vertex of degree smaller than three has a straight-line drawing in the plane satisfying the following conditions. No three vertices are collinear, and a pair of vertices form an edge in G if and only if the segment connecting them is parallel to one of the sides of a previously fixed regular pentagon. It...

For a vast class of discrete model families with cdf’s Fθ, and for estimating θ under squared error loss under a constraint of the type θ ∈ [0,m], we present a general and unified development concerning the minimaxity of a boundary supported prior Bayes estimator. While the sufficient conditions obtained are of the expected form m ≤ m(F ), the approach presented leads, in many instances, to bot...

This paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   The main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some familyF . For every family F of functions, this yields a notion of F -fixed parameter tractability. If F is the class of all polynomially bounded functions, then F -fixed parameter tractability coincides wit...

We consider the transitive linear maps on the operator algebra $B(X)$for a separable Banach space $X$. We show if a bounded linear map is norm transitive on $B(X)$,then it must be hypercyclic with strong operator topology. Also we provide a SOT-transitivelinear map without being hypercyclic in the strong operator topology.