共查询到20条相似文献,搜索用时 15 毫秒
1.
M. Yu. Vagina 《Automation and Remote Control》2003,64(4):666-671
For the equation x(t) = x(t) (1-(1/)
t--
t-
x(u)du), > 0, > 0, > 0, conditions for the stability of a nonzero stationary solution under small perturbations are determined. 相似文献
2.
Tracking Drifting Concepts By Minimizing Disagreements 总被引:3,自引:0,他引:3
In this paper we consider the problem of tracking a subset of a domain (called thetarget) which changes gradually over time. A single (unknown) probability distribution over the domain is used to generate random examples for the learning algorithm and measure the speed at which the target changes. Clearly, the more rapidly the target moves, the harder it is for the algorithm to maintain a good approximation of the target. Therefore we evaluate algorithms based on how much movement of the target can be tolerated between examples while predicting with accuracy . Furthermore, the complexity of the classH of possible targets, as measured byd, its VC-dimension, also effects the difficulty of tracking the target concept. We show that if the problem of minimizing the number of disagreements with a sample from among concepts in a classH can be approximated to within a factork, then there is a simple tracking algorithm forH which can achieve a probability of making a mistake if the target movement rate is at most a constant times 2/(k(d +k) ln 1/), whered is the Vapnik-Chervonenkis dimension ofH. Also, we show that ifH is properly PAC-learnable, then there is an efficient (randomized) algorithm that with high probability approximately minimizes disagreements to within a factor of 7d + 1, yielding an efficient tracking algorithm forH which tolerates drift rates up to a constant times 2/(d
2 ln 1/). In addition, we prove complementary results for the classes of halfspaces and axisaligned hyperrectangles showing that the maximum rate of drift that any algorithm (even with unlimited computational power) can tolerate is a constant times 2/d. 相似文献
3.
A loss queueing system GI/G/m/0 is considered. Let a(x) be a p.d.f. of interarrival intervals. Assume that this function behaves like cx-1 for small x. Further let B(x) be a d.f. of service time; (1/) be the mean service time. Conditions are derived for the light-traffic insensitivity of the loss probability to the form of B(x) as (/ ) 0. In particular, the condition = 1 is necessary. Estimates for the loss probability are obtained. 相似文献
4.
We define an identity to be hypersatisfied by a variety V if, whenever the operation symbols of V, are replaced by arbitrary terms (of appropriate arity) in the operations of V, the resulting identity is satisfied by V in the usual sense. Whenever the identity is hypersatisfied by a variety V, we shall say that is a V hyperidentity. For example, the identity x + x y = x (x + y) is hypersatisfied by the variety L of all lattices. A proof of this consists of a case-by-case examination of { + , } {x, y, x y, x y}, the set of all binary lattice terms. In an earlier work, we exhibited a hyperbase
L
for the set of all binary lattice (or, equivalently, quasilattice) hyperidentities of type 2, 2. In this paper we provide a greatly refined hyperbase
L
. The proof that
L
is a hyperbase was obtained by using the automated reasoning program Otter 3.0.4. 相似文献
5.
A text is a triple=(,
1,
2) such that is a labeling function, and
1 and
2 are linear orders on the domain of ; hence may be seen as a word (,
1) together with an additional linear order
2 on the domain of . The order
2 is used to give to the word (,
1) itsindividual hierarchical representation (syntactic structure) which may be a tree but it may be also more general than a tree. In this paper we introducecontext-free grammars for texts and investigate their basic properties. Since each text has its own individual structure, the role of such a grammar should be that of a definition of a pattern common to all individual texts. This leads to the notion of ashapely context-free text grammar also investigated in this paper. 相似文献
6.
We present a new definition of optimality intervals for the parametric right-hand side linear programming (parametric RHS LP) Problem () = min{c
t
x¦Ax =b + ¯b,x 0}. We then show that an optimality interval consists either of a breakpoint or the open interval between two consecutive breakpoints of the continuous piecewise linear convex function (). As a consequence, the optimality intervals form a partition of the closed interval {; ¦()¦ < }. Based on these optimality intervals, we also introduce an algorithm for solving the parametric RHS LP problem which requires an LP solver as a subroutine. If a polynomial-time LP solver is used to implement this subroutine, we obtain a substantial improvement on the complexity of those parametric RHS LP instances which exhibit degeneracy. When the number of breakpoints of () is polynomial in terms of the size of the parametric problem, we show that the latter can be solved in polynomial time.This research was partially funded by the United States Navy-Office of Naval Research under Contract N00014-87-K-0202. Its financial support is gratefully acknowledged. 相似文献
7.
We develop a theory of communication within branching programs that provides exponential lower bounds on the size of branching programs that are bounded alternating. Our theory is based on the algebraic concept of -branching programs, : , a semiring homomorphism, that generalizes ordinary branching programs, -branching programs [M2] andMOD
p-branching programs [DKMW].Due to certain exponential lower and polynomial upper bounds on the size of bounded alternating -branching programs we are able to separate the corresponding complexity classesN
ba
,co-N
ba
ba
, andMOD
p
-
ba
,p prime, from each other, and from that classes corresponding to oblivious linear length-bounded branching programs investigated in the past. 相似文献
8.
Conditions are presented under which the maximum of the Kolmogorov complexity (algorithmic entropy) K(1...
N
) is attained, given the cost
f(
i
) of a message 1...
N
. Various extremal relations between the message cost and the Kolmogorov complexity are also considered; in particular, the minimization problem for the function
f(
i
) – K(1...
N
) is studied. Here, is a parameter, called the temperature by analogy with thermodynamics. We also study domains of small variation of this function. 相似文献
9.
Herbert S. Shank 《Theory of Computing Systems》1971,5(1):50-55
Suppose a Turing machine is equipped with an extra tape. At each step of a computation being performed, it prints symbol read move symbol symbol printed on a square of the extra tape. It then moves the extra tape one square to the left. This procedure yields arecord of the computation.If is a finite alphabet, let
be the set of triples (a, b, c) wherea ,c , andb {–1, 0, 1}. We will characterize those sequences of symbols of
that are records of computations of Turing machines.This research was supported in part by AFOSR Grant GP-68-1402. 相似文献
10.
The “explicit-implicit” distinction 总被引:3,自引:3,他引:0
Robert F. Hadley 《Minds and Machines》1995,5(2):219-242
Much of traditional AI exemplifies the explicit representation paradigm, and during the late 1980's a heated debate arose between the classical and connectionist camps as to whether beliefs and rules receive an explicit or implicit representation in human cognition. In a recent paper, Kirsh (1990) questions the coherence of the fundamental distinction underlying this debate. He argues that our basic intuitions concerning explicit and implicit representations are not only confused but inconsistent. Ultimately, Kirsh proposes a new formulation of the distinction, based upon the criterion ofconstant time processing.The present paper examines Kirsh's claims. It is argued that Kirsh fails to demonstrate that our usage of explicit and implicit is seriously confused or inconsistent. Furthermore, it is argued that Kirsh's new formulation of the explicit-implicit distinction is excessively stringent, in that it banishes virtually all sentences of natural language from the realm of explicit representation. By contrast, the present paper proposes definitions for explicit and implicit which preserve most of our strong intuitions concerning straightforward uses of these terms. It is also argued that the distinction delineated here sustains the meaningfulness of the abovementioned debate between classicists and connectionists. 相似文献
11.
In this paper, we investigate the numerical solution of a model equation u
xx
=
exp(–
) (and several slightly more general problems) when 1 using the standard central difference scheme on nonuniform grids. In particular, we are interested in the error behaviour in two limiting cases: (i) the total mesh point number N is fixed when the regularization parameter 0, and (ii) is fixed when N. Using a formal analysis, we show that a generalized version of a special piecewise uniform mesh 12 and an adaptive grid based on the equidistribution principle share some common features. And the optimal meshes give rates of convergence bounded by |log()| as 0 and N is given, which are shown to be sharp by numerical tests. 相似文献
12.
Paul B. Slater 《Quantum Information Processing》2002,1(5):397-408
In a previous study (P. B. Slater, Eur. Phys. J. B. 17, 471 (2000)), several remarkably simple exact results were found, in certain specialized m-dimensional scenarios (m 4), for the a priori probability that a pair of qubits is unentangled/separable. The measure used was the volume element of the Bures metric (identically one-fourth the statistical distinguishability [SD] metric). Here, making use of a newly-developed (Euler angle) parameterization of the 4 × 4 density matrices of Tilma, Byrd and Sudarshan, we extend the analysis to the complete 15-dimensional convex set (C) of arbitrarily paired qubits—the total SD volume of which is known to be 8 / 1680 = 8/24 3 5 7 5.64794. Using advanced quasi-Monte Carlo procedures (scrambled Halton sequences) for numerical integration in this high-dimensional space, we approximately (5.64851) reproduce that value, while obtaining an estimate of 0.416302 for the SD volume of separable states. We conjecture that this is but an approximation to 6/2310 = 6 / (2 3 5 7 11) 0.416186. The ratio of the two volumes, 8/1122 .0736881, would then constitute the exact Bures/SD probability of separability. The SD area of the 14-dimensional boundary of C is 1427/12285 = 2 717/33 5 7 13 34.911, while we obtain a numerical estimate of 1.75414 for the SD area of the boundary of separable states.
PACS: 03.67.-; 03.65.Ud; 02.60.Jh; 02.40.Ky 相似文献
13.
LetL
p
be the plane with the distanced
p
(A
1
,A
2
) = (¦x
1 –x
2¦
p
+ ¦y1 –y
2¦p)/1p
wherex
i
andy
i
are the cartesian coordinates of the pointA
i
. LetP be a finite set of points inL
p
. We consider Steiner minimal trees onP. It is proved that, for 1 <p < , each Steiner point is of degree exactly three. Define the Steiner ratio
p
to be inf{L
s
(P)/L
m
(P)¦PL
p
} whereL
s
(P) andL
m
(P) are lengths of the Steiner minimal tree and the minimal spanning tree onP, respectively. Hwang showed 1 = 2/3. Chung and Graham proved 2 > 0.842. We prove in this paper that {} = 2/3 and (2/2)12 p 3/2 for anyp.This work was supported in part by the National Science Foundation of China and the President Foundation of Academia Sinica. 相似文献
14.
Summary A framework is proposed for the structured specification and verification of database dynamics. In this framework, the conceptual model of a database is a many sorted first order linear tense theory whose proper axioms specify the update and the triggering behaviour of the database. The use of conceptual modelling approaches for structuring such a theory is analysed. Semantic primitives based on the notions of event and process are adopted for modelling the dynamic aspects. Events are used to model both atomic database operations and communication actions (input/output). Nonatomic operations to be performed on the database (transactions) are modelled by processes in terms of trigger/reaction patterns of behaviour. The correctness of the specification is verified by proving that the desired requirements on the evolution of the database are theorems of the conceptual model. Besides the traditional data integrity constraints, requirements of the form Under condition W, it is guaranteed that the database operation Z will be successfully performed are also considered. Such liveness requirements have been ignored in the database literature, although they are essential to a complete definition of the database dynamics.
Notation
Classical Logic Symbols (Appendix 1) for all (universal quantifier) - exists at least once (existential quantifier) - ¬ no (negation) - implies (implication) - is equivalent to (equivalence) - and (conjunction) - or (disjunction) Tense Logic Symbols (Appendix 1) G always in the future - G 0 always in the future and now - F sometime in the future - F 0 sometime in the future or now - H always in the past - H 0 always in the past and now - P sometime in the past - P 0 sometime in the past or now - X in the next moment - Y in the previous moment - L always - M sometime Event Specification Symbols (Sects. 3 and 4.1) (x) means immediately after the occurrence of x - (x) means immediately before the occurrence of x - (x) means x is enabled, i.e., x may occur next - { } ({w 1} x{w 2}) states that if w 1 holds before the occurrence of x, then w 2 will hold after the occurrence of x (change rule) - [ ] ([oa1, ..., oan]x) states that only the object attributes oa1, ..., oa n are modifiable by x (scope rule) - {{ }} ({{w}}x) states that if x may occur next, then w holds (enabling rule) Process Specification Symbols (Sects. 5.3 and 5.4) :: for causal rules - for behavioural rules Transition-Pattern Composition Symbols (Sects. 5.2 and 5.3) ; sequential composition - ¦ choice composition - parallel composition - :| guarded alternative composition Location Predicates (Sect. 5.2) (z) means immediately after the occurrence of the last event of z (after) - (z) means immediately before the occurrence of the first event of z (before) - (z) means after the beginning of z and before the end of z (during) - ( z) means before the occurrence of an event of z (at) 相似文献15.
We investigate strategies for the numerical solution of the initial value problem
with initial conditions
where 0<1<2<<. Here y
(
j
) denotes the derivative of order
j
>0 (not necessarily
j
) in the sense of Caputo. The methods are based on numerical integration techniques applied to an equivalent nonlinear and weakly singular Volterra integral equation. The classical approach leads to an algorithm with very high arithmetic complexity. Therefore we derive an alternative that leads to lower complexity without sacrificing too much precision.
Mathematics Subject Classification: Primary 65L05; Secondary 65L06, 65L20 相似文献
16.
Henri Prade 《Journal of Intelligent and Robotic Systems》1990,3(2):93-101
In this note, we are interested in the evaluation of conditions of the form The value of attribute a for Q items of X is in F or more shortly Q items of X are F, where X is a set of items, Q denotes a possibly vague proportion (which may be linguistically expressed, e.g. most), F is a (possibly fuzzy) subset of the attribute domain of a. and where the available knowledge about the value a(x) of the attribute a for any item x may be imprecise or even vague. The evaluation is based on a fuzzy pattern matching procedure repeated two times. Such conditions may be encountered in queries addressed to an incomplete information data base or in the if-part of expert rules. 相似文献
17.
James B. Robertson 《Theory of Computing Systems》1973,7(1):39-43
Summary Let {Y
n
,– < n < } be either a function of a stationary Markov chain with countable state space, or a finitary process in the sense of Heller [3]. The purpose of this note is to prove that if {Y
n
,– < n < } is mixing, then it is aK-shift. (Definitions will be given below.)IfT is a measure-preserving transformation on a probability space, then the following implications relevant to the present paper are known: (1)T is aK-shift T is (r + 1)-mixing T isr-mixing T is totally ergodic T is ergodic, and (2)T is ergodic T is totally ergodic T isr-mixing T is aK-shift.It is not known if the classes ofr-mixing and (r + 1)-mixing transformations are distinct. (1-mixing is also called mixing.) The results of this note then imply that for the classes of transformation that we are consideringr-mixing and (r + 1)-mixing are equivalent.This research was partially supported by NSF Grant GP-19660. 相似文献
18.
The plane with parallel coordinates 总被引:15,自引:0,他引:15
Alfred Inselberg 《The Visual computer》1985,1(4):69-91
By means ofParallel Coordinates planar graphs of multivariate relations are obtained. Certain properties of the relationship correspond tothe geometrical properties of its graph. On the plane a point line duality with several interesting properties is induced. A new duality betweenbounded and unbounded convex sets and hstars (a generalization of hyperbolas) and between Convex Unions and Intersections is found. This motivates some efficient Convexity algorithms and other results inComputational Geometry. There is also a suprising cusp inflection point duality. The narrative ends with a preview of the corresponding results inR
N
. 相似文献
19.
We consider the half-space range-reporting problem: Given a setS ofn points in d, preprocess it into a data structure, so that, given a query half-space , allk points ofS can be reported efficiently. We extend previously known static solutions to dynamic ones, supporting insertions and deletions of points ofS. For a given parameterm,n m n
d/2 and an arbitrarily small positive constant , we achieveO(m
1+) space and preprocessing time, O((n/m
d/2 logn+k) query time, and O(m1+n) amortized update time (d 3). We present, among others, the following applications: an O(n1+)-time algorithm for computing convex layers in 3, and an output sensitive algorithm for computing a level in an arrangements of planes in 3, whose time complexity is O((b+n) n, whereb is the size of the level.Work by the first author has been supported by National Science Foundation Grant CCR-91-06514. A preliminary version of this paper appeared in Agarwalet al. [2], which also contains the results of [20] on dynamic bichromatic closest pair and minimum spanning trees. 相似文献
20.
Summary We consider a specific kind of binary trees with weighted edges. Each right edge has weight while each left edge has weight . Furthermore, no path in the tree is allowed to contain L or more consecutive -edges, where L 1 is fixed. Given, , , L and the number of nodes n, an optimal tree is one which minimizes the total weighted path length. Algorithms for constructing an optimal tree as well as all optimal trees for given , , L and n are proposed and analyzed. Timing and storage requirements are also discussed. 相似文献