The body of work on multi-body factorization separates between objects whose motions are independent. In this work we show that in many cases objects moving with different 3D motions will be captured as a single objec...
详细信息
The body of work on multi-body factorization separates between objects whose motions are independent. In this work we show that in many cases objects moving with different 3D motions will be captured as a single object using these approaches. We analyze what causes these degeneracies between objects and suggest an approach for overcoming some of them. We further show that in the case of multiple sequences linear dependencies can supply information for temporal synchronization of sequences and for spatial matching of points across sequences.
A new approach for bridging over the semantic gap is presented. This approach is based solely on the extraction of low-level illumination features, and by using well defined film rules regarding scene lighting, it gen...
详细信息
A new approach for bridging over the semantic gap is presented. This approach is based solely on the extraction of low-level illumination features, and by using well defined film rules regarding scene lighting, it generates high level semantic descriptors for scenes. These illumination descriptors could be further combined with other descriptors like motion and shot tempo, to generate a more complete automatic semantic analysis of video media.
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-Ε) = Ω(n0.546), for any Ε > 0. Moreover, there...
详细信息
ISBN:
(纸本)9781581136746
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-Ε) = Ω(n0.546), for any Ε > 0. Moreover, there always exists a point p ∈ P from which there are at least these many distinct distances to the remaining elements of P. The same result holds for points on the three-dimensional sphere. As a consequence, we obtain analogous results in higher dimensions.
In order to be able to compare adaptive codes and codes for a known source more precisely, it is important to know the exact expression of an O(1/n) term. Obtaining the exact expression for this and subsequent terms d...
详细信息
In order to be able to compare adaptive codes and codes for a known source more precisely, it is important to know the exact expression of an O(1/n) term. Obtaining the exact expression for this and subsequent terms describing the average behavior of adaptive block codes is shown.
In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of...
详细信息
In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on various quantities in the protocol and on the message to be signed. The Fiat-Shamir methodology for producing digital signature schemes quickly gained popularity as it yields efficient and easy to implement digital signature schemes. The most important question however remained open: are the digital signatures produced by the Fiat-Shamir methodology secure? We answer this question negatively. We show that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields insecure digital signature schemes for any hash function used by the transformation. This is in contrast to the work of Pointcheval and Stern which proved that the Fiat-Shamir methodology always produces digital signatures secure against chosen message attack in the "Random Oracle Model" - when the hash function is modeled by a random oracle. Among other things, we make new usage of Barak's technique for taking advantage of nonblack-box access to a program, this time in the context of digital signatures.
Industrial diagnostics is an important application area for many AI formalisms. Temporal diagnostics, based on analyzing temporal relations between values of crucial variables, is one possible approach to industrial d...
详细信息
ISBN:
(纸本)0889863415
Industrial diagnostics is an important application area for many AI formalisms. Temporal diagnostics, based on analyzing temporal relations between values of crucial variables, is one possible approach to industrial diagnostics. Often, the information obtained from an industrial object can be uncertain, making the task of diagnostics more complex. In this paper, we propose an approach to temporal industrial diagnostics, which uses algebra of uncertain temporal relations. We estimate temporal relations between the set of symptoms (crucial values of important variables) obtained from an industrial object to build the temporal relational network for this particular situation. After that, we compare the obtained network with known temporal scenarios (patterns) of failures, using the numerical measure of the distance between a network and a scenario. Using this approach we derive the probabilities of possible diagnoses for the particular situation. We also show how the learning for the database of scenarios can be performed, which will make diagnostics for future cases more precise.
Let P be a set of n points in 3, not all of which are in a plane and no three on a line. We partially answer a question of Scott (1970) by showing that the connecting lines of P assume at least 2n -3 different directi...
详细信息
Let P be a set of n points in 3, not all of which are in a plane and no three on a line. We partially answer a question of Scott (1970) by showing that the connecting lines of P assume at least 2n -3 different directions if n is even and at least 2n - 2 if n is odd. These bounds are sharp. The proof is based on a far-reaching generalization of Ungar's theorem concerning the analogous problem in the plane.
We provide an overview of some current developments on code-related properties of DNA languages. A DNA language is a set of words, each of which is made up of the letters A, C, G, T. Such a word is meant to represent ...
详细信息
We provide an overview of some current developments on code-related properties of DNA languages. A DNA language is a set of words, each of which is made up of the letters A, C, G, T. Such a word is meant to represent a physical DNA strand. A collection of DNA strands can be stored in-vitro and, either serve the purpose of a database, or undergo a sequence of controlled bio-operations that would constitute a meaningful computation. In both cases, the strands should be chosen in such a way that they would not form unwanted hybridizations with each other and any errors in the nucleotides comprising the strands can be detected. These requirements can be translated in the framework of formal language theory by considering DNA languages whose words satisfy certain combinatorial properties. We consider two types of desirable properties: static and dynamic. The former ensure that no unwanted hybridizations can occur. The latter ensure that, after a permitted bio-operation is applied to the strands, the resulting strands also satisfy the desirable properties.
Multi-agent systems comprise entities whose individual decision making behavior may depend on one another's. Game-theory provides apposite concepts to reason in a math.matically precise fashion about such interact...
详细信息
Multi-agent systems comprise entities whose individual decision making behavior may depend on one another's. Game-theory provides apposite concepts to reason in a math.matically precise fashion about such interactive and interdependent situations. This paper concerns a logical analysis of the game-theoretical notions of Nash equilibrium and its subgame perfect variety as they apply to a particular class of extensive games of perfect information. Extensive games are defined as a special type of labelled graph and we argue that modal languages can be employed in their description. We propose a logic for a multi-modal language and prove its completeness with respect to a class of frames that correspond with a particular class of extensive games. In this multimodal language (subgame perfect) Nash equilibria can be characterized. Finally, we show how this approach can formally be refined by using Prepositional Dynamic Logic (PDL), though we leave completeness as an open question.
We present metric-E3, a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows the construction of accurate local mode...
详细信息
ISBN:
(纸本)1577351894
We present metric-E3, a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows the construction of accurate local models. The algorithm is a generalization of the E3 algorithm of Kearns and Singh, and assumes a black box for approximate planning. Unlike the original E3, metric-E3 finds a near optimal policy in an amount of time that does not directly depend on the size of the state space, but instead depends on the covering number of the state space. Informally, the covering number is the number of neighborhoods required for accurate local modeling.
暂无评论