A fundamental characteristic of human speech is that it uses a limited set of basic building blocks (phonemes, syllables), that are put to use in many different combinations to mark differences in meaning. This articl...
详细信息
A fundamental characteristic of human speech is that it uses a limited set of basic building blocks (phonemes, syllables), that are put to use in many different combinations to mark differences in meaning. This article investigates the evolution of such combinatorial phonology with a simulated population of agents. We first argue that it is a challenge to explain the transition from holistic to combinatorial phonology, as the first agent that has a mutation for using combinatorial speech does not benefit from this in a population of agents that use a holistic signaling system. We then present a solution for this evolutionary deadlock. We present experiments that show that when a repertoire of holistic signals is optimized for distinctiveness in a population of agents, it converges to a situation in which the signals can be analyzed as combinatorial, even though the agents are not aware of this structure. We argue that in this situation adaptations for productive combinatorial phonology can spread.
Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without get...
详细信息
Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of these combinatorial objects, and constraint programming, where the requisite symmetry breaking has at best been done statically so far. We design the first search procedure and identify the first symmetry-breaking constraints for the general case of unlabelled necklaces. Further, we compare dynamic and static symmetry breaking on real-life scheduling problems featuring (unlabelled) necklaces. (C) 2008 Elsevier Inc. All rights reserved.
The commonly used technique for cheating detection in verifiable secret sharing (VSS) requite public key systems Based on linear integer secret sharing (LISS) scheme, this paper presents a private verifiable protocol ...
详细信息
ISBN:
(纸本)9783642111440
The commonly used technique for cheating detection in verifiable secret sharing (VSS) requite public key systems Based on linear integer secret sharing (LISS) scheme, this paper presents a private verifiable protocol over arbitrary access structure without public key systems, which can avoid cheating both from participants and dealers For further consideration of share refreshing and renewal, this impel shows the proactive property of our scheme with new method. Furthermore, this paper applies combinatorial structure into the proactive scheme to reduce the time of the computation
Human cognition is unique in the way in which it relies on combinatorial (or compositional) structures. Language provides ample evidence for the existence of combinatorial structures, but they can also be found in vis...
详细信息
Human cognition is unique in the way in which it relies on combinatorial (or compositional) structures. Language provides ample evidence for the existence of combinatorial structures, but they can also be found in visual cognition. To understand the neural basis of human cognition, it is therefore essential to understand how combinatorial structures can be instantiated in neural terms. In his recent book on the foundations of language, Jackendoff described four fundamental problems for a neural instantiation of combinatorial structures: the massiveness of the binding problem, the problem of 2, the problem of variables, and the transformation of combinatorial structures from working memory to long-term memory. This paper aims to show that these problems can be solved by means of neural "blackboard" architectures. For this purpose, a neural blackboard architecture for sentence structure is presented. In this architecture, neural structures that encode for words are temporarily bound in a manner that preserves the structure of the sentence. It is shown that the architecture solves the four problems presented by Jackendoff. The ability of the architecture to instantiate sentence structures is illustrated with examples of sentence complexity observed in human language performance. Similarities exist between the architecture for sentence structure and blackboard architectures for combinatorial structures in visual cognition, derived from the structure of the visual cortex. These architectures are briefly discussed, together with an example of a combinatorial structure in which the blackboard architectures for language and vision are combined. In this way, the architecture for language is grounded in perception. Perspectives and potential developments of the architectures are discussed.
For S a subordinator and Pi(n) an independent Poisson process of intensity ne(-x), x > 0, we are interested in the number K-n of gaps in the range of S that are hit by at least one point of Pi(n). Extending previou...
详细信息
For S a subordinator and Pi(n) an independent Poisson process of intensity ne(-x), x > 0, we are interested in the number K-n of gaps in the range of S that are hit by at least one point of Pi(n). Extending previous studies in [A.V. Gnedin, The Bernoulli sieve, Bernoulli 10 (2004) 79-96;A.V. Gnedin, J. Pitman, M. Yor, Asymptotic laws for compositions derived from transformed subordinators, Ann. Probab. 2006 (in press). http://***/abs/***/0403438, 2004;AN. Gnedin, J. Pitman, M. Yor, Asymptotic laws for regenerative compositions: gamma subordinators and the like, Probab. Theory Related Fields (2006)] we focus on the case when the tail of the Levy measure of S is slowly varying. We view K, as the terminal value of a random process K-n, and provide an asymptotic analysis of the fluctuations of K-n, as n --> infinity, for a wide spectrum of situations. (C) 2005 Elsevier B.V. All fights reserved.
A new class of Lie algebras of finite dimension, those which are associated with a certain combinatorial configuration made up by triangles of weighted and non-directed edges, is introduced and a characterization theo...
详细信息
A new class of Lie algebras of finite dimension, those which are associated with a certain combinatorial configuration made up by triangles of weighted and non-directed edges, is introduced and a characterization theorem for them is proved. Moreover, some subclasses of such Lie algebras are classified. (c) 2005 Elsevier Inc. All rights reserved.
Given a Lie algebra of finite dimension, with a selected basis of it, we show in this paper that it is possible to associate it with a combinatorial structure, of dimension 2, in general. In some particular cases, thi...
详细信息
Given a Lie algebra of finite dimension, with a selected basis of it, we show in this paper that it is possible to associate it with a combinatorial structure, of dimension 2, in general. In some particular cases, this structure is reduced to a weighted graph. We characterize such graphs, according to they have 3-cycles or not. (C) 2004 Elsevier Inc. All rights reserved.
We introduce some versions of the notion of the combinatorial p-parameter property for polyhedra whose general meaning reduces to search for the number of parameters ensuring unique determination of a polyhedron local...
详细信息
We introduce some versions of the notion of the combinatorial p-parameter property for polyhedra whose general meaning reduces to search for the number of parameters ensuring unique determination of a polyhedron locally on assuming given edge lengths and combinatorial structure.
This paper presents a solution to the so called equivalence problem which was introduced in [2]. The equivalence problem consists of a semismooth system of equations which has the following form: (Formula Presented) T...
详细信息
This paper presents a solution to the so called equivalence problem which was introduced in [2]. The equivalence problem consists of a semismooth system of equations which has the following form: (Formula Presented) This system can be formulated in a more simplified representation by ũ = M̃(x, y, z, w)(x, y, z, w) T = M̃(x̃)x̃ T The vector ũ can be interpreted as possible control parameters of a time-discrete system, whereas the vector x̃ can be seen as bargaining solution of a cooperative game. In [2] the bargaining solution is identical to the τ-value, which was introduced in [3]. For the special case of three actors the τ-value lies always in the core, if we assume 1-convexity. Under these assumptions, all properties are expressed by the general formulation of (2) where the functions f, g and h are of the form ξ(u) = min{u 1, . . . , u n} = - max{-u 1, . . . , -u n}. By exploiting the combinatorial structure of max-type functions we can show that a solution of (2) exists and may be found via Newton type methods which are treated in [1].
The presented TEM-model describes the economical interaction between several actors (players) which intend to minimize their emissions (E-i) caused by technologies (T-i) by means of expenditures of money (M-i) or fin ...
详细信息
The presented TEM-model describes the economical interaction between several actors (players) which intend to minimize their emissions (E-i) caused by technologies (T-i) by means of expenditures of money (M-i) or fin ancial means, respectively. The index stands for the i-th player, i = 1,...,n. The players are linked by technical cooperations and the market, which expresses itself in the nonlinear time-discrete dynamics of the Technology-Emissions-Means-model, in short: TEM-model. In the sense of environmental protection, the aim is to reach a state which is mentioned in Kyoto Protocol by choosing the control parameters such that the emissions of each player become minimized. The focal point is the realization of the necessary optimal control parameters via a played cost game, which is determined by the way of cooperation of the actors. In application to the work of Leitmann, but not regarding solution sets as feasible sets, the tau -value of Tijs [13] is taken as a control parameter. This leads to a new class of problems in the area of 1-convex games. We want to solve the problem for a special case. With this solution a reasonable model for a Joint-Implementation process is developed, where its necessary fund is represented by the non-empty core of the analyzed game. Steering with parameters of this feasible set, the TEM-model can be regarded as a useful tool to implement and verify a technical Joint-Implementation Program. For the necessary data is given to the Clearing House, we are able to compare the numerical results with real world phenomena.
暂无评论