相关论文: Reducing complexity of tail-biting trellises
This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis…
This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint…
This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint…
The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller granule decomposition of the behavior and known controllability…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
We obtain necessary and sufficient conditions for abelian varieties to acquire semistable reduction over fields of low degree. Our criteria are expressed in terms of torsion points of small order defined over unramified extensions.
We will give a criterion for the amenability of arbitrary locally finite trees. The criterion is based on the trimming operator which is defined on the space of trees. As an application, we obtain a necessary and sufficient condition for…
Sufficient and necessary conditions are established for controllability of affine control systems where the control is constrained to a set whose convex hull contains the origin but is not necessarily, in contrast with previously known…
Sufficient conditions for the controllability of a conservative reduced system are given. Several examples illustrating the theory are also presented.
This paper presents a closed-form notion of controllability and observability for systems with communication delays, actuation delays, and locality constraints. The formulation reduces to classical notions of controllability and…
The paper puts forward sufficient conditions for local controllability of a control dynamical system. The results obtained are meaningful in the case when the linear approximation to this system is not completely controllable. As a…
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with…
In this paper we estimate the minimal controllability time for a class of non-linear control systems with a bounded convex state constraint. An explicit expression is given for the controllability time if the image of the control matrix is…
Algorithms for learning decision trees often include heuristic local-search operations such as (1) adjusting the threshold of a cut or (2) also exchanging the feature of that cut. We study minimizing the number of classification errors by…
A joint characterisation of the controllability and observability of a particular kind of discrete system has been developed. The key idea of the procedure can be reduced to a correct choice of the sampling sequence. This freedom, owing to…
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a $\delta$-sufficient reason for decision trees.
We analyze in detail the subtle yet critical differences between the structural controllability and observability of the triplet $(A,B,C)$ in the two cases that this is viewed as a linear dynamical network of interconnected nodes or as a a…
We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…
Consider a random sample in the max-domain of attraction of a multivariate extreme value distribution such that the dependence structure of the attractor belongs to a parametric model. A new estimator for the unknown parameter is defined as…
This paper studies controllability properties of recurrent neural networks. The new contributions are: (1) an extension of the result in the previous paper "Complete controllability of continuous-time recurrent neural networks" (Sontag and…