This paper investigates the effect of injection percentage on the performance of a case-injected genetic algorithm for combinational logic design. A case-injected genetic algorithm is a genetic algorithm augmented wit...
详细信息
This paper investigates the effect of injection percentage on the performance of a case-injected genetic algorithm for combinational logic design. A case-injected genetic algorithm is a genetic algorithm augmented with a case-based memory of past problem solving attempts which learns to improve performance on sets of similar design problems. In this approach, rather than starting anew on each design, we periodically inject a genetic algorithm's population with appropriate intermediate design solutions to similar, previously solved problems. Experimental results on a configuration design problem;the design of a parity checker, demonstrate the performance gains from our approach and show that our system learns to take less time to provide quality solutions to a new design problem as it gains experience from solving other similar design problems.
We show that stopwatch automata are equivalent to timed shuffle expressions, an extension of timed regular expressions with the shuffle operation. This implies that the emptiness problem for timed shuffle expressions ...
详细信息
ISBN:
(纸本)3540283099
We show that stopwatch automata are equivalent to timed shuffle expressions, an extension of timed regular expressions with the shuffle operation. This implies that the emptiness problem for timed shuffle expressions is undecidable. The result holds for both timed state sequence semantics and timed event sequence semantics of automata and expressions. Similarly to timed regular expressions, our timed shuffle expressions employ renaming. But we show that even when renaming is not used, shuffle regular expressions still have an undecidable emptiness problem. This solves in the negative a conjecture of Asarin on the possibility to use shuffle to define timed regular languages. We also define a subclass of timed shuffle expressions which can be used to model preemptive scheduling problems. Expressions in this class are in the form (E1W ... WEn) boolean AND E, where E-i and E do not use shuffle. We show that emptiness checking within this class is undecidable too.
This paper presents an algebraic construction of families of unitary matrices that achieve full diversity. They are obtained as subsets of cyclic division algebras.
ISBN:
(纸本)0780391500
This paper presents an algebraic construction of families of unitary matrices that achieve full diversity. They are obtained as subsets of cyclic division algebras.
A new kind of discrete tomography problem is introduced: the reconstruction of discrete sets from their absorbed projections. A special case of this problem is discussed, namely, the uniqueness of the binary matrices ...
详细信息
A new kind of discrete tomography problem is introduced: the reconstruction of discrete sets from their absorbed projections. A special case of this problem is discussed, namely, the uniqueness of the binary matrices with respect to their absorbed row and column sums when the absorption coefficient is mu = log((1 + root 5)/2). It is proved that if a binary matrix contains a special structure of 0s and 1s, called alternatively corner-connected component, then this binary matrix is non-unique with respect to its absorbed row and column sums. Since it has been proved in another paper [A. Kuba, M. Nivat, Reconstruction of discrete sets with absorption, Linear Algebra Appl. 339 (2001) 171-194] that this condition is also necessary, the existence of alternatively corner-connected component in a binary matrix gives a characterization of the non-uniqueness in this case of absorbed projections. (c) 2005 Elsevier B.V. All rights reserved.
This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. This f...
详细信息
This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. This failure detector, which we call the trusting failure detector, and which we denote by F, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector P. The paper shows that a majority of correct processes is necessary to solve the problem with F. Moreover, F is also the weakest failure detector to solve the fault-tolerant group mutual exclusion problem, given a majority of correct processes. (c) 2005 Elsevier Inc. All rights reserved.
In this paper we investigate transmit diversity techniques, which can be easily applied to OFDM-based broadcast and multicast systems. The focus is to provide diversity schemes, which can be implemented in existing OF...
详细信息
作者：
Lehr, CMatignon, MUniv Padua
Dipartimento Matemat Pura & Applicata I-35131 Padua Italy Univ Bordeaux 1
UMR 5465 CNRS Lab Theorie Nombres & Algorithm Arithmet F-33405 Talence France
Let k be an algebraically closed field of positive characteristic p > 0 and C -> P-k(1) a p-cyclic cover of the projective line ramified in exactly one point. We are interested in the p-Sylow subgroups of the fu...
详细信息
Let k be an algebraically closed field of positive characteristic p > 0 and C -> P-k(1) a p-cyclic cover of the projective line ramified in exactly one point. We are interested in the p-Sylow subgroups of the full automorphism group Aut(k)C. We prove that for curves C with genus 2 or higher, these groups are exactly the extensions of a p-cyclic group by an elementary abelian p-group. The main tool is an efficient algorithm to compute the p-Sylow subgroups of Aut(k)C starting from an Artin-Schreier equation for the cover C -> P-k(1). We also characterize curves C with genus gC >= 2 and a p-group action G subset of Aut(k)C such that 2p/(p-1) < vertical bar G vertical bar/gc and 4/(p-1)(2) <, vertical bar G vertical bar/g(C)(2). Our methods rely on previous work by Stichtenoth whose approach we have adopted.
The optimization of correlation weights scheme was used to model the water solubility (ln S) of diverse functional aliphatic compounds ( n= 193). The optimized descriptor formulated based on the data of a training set...
详细信息
The optimization of correlation weights scheme was used to model the water solubility (ln S) of diverse functional aliphatic compounds ( n= 193). The optimized descriptor formulated based on the data of a training set ( n= 96) generated statistically acceptable relations for the training set (r(2)= 0.987), test set ( n= 97;r(2)= 0.986) and combined set (r(2)= 0.987). When the relation of ln S values with the optimized molecular descriptor formulated based on the data of the training set was used for the calculation of ln S values of the training set, r(pred)(2) value was found to be satisfactory (0.988), which is indicative of the predictive potential of the scheme. The results indicate the promising potential of the optimization of correlation weights scheme in modeling studies.
In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial linage Analysis, IWCIA 2,001, Philadelphia, PA, USA, ENTCS, vo...
详细信息
In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial linage Analysis, IWCIA 2,001, Philadelphia, PA, USA, ENTCS, vol. 46. 2001, pp. 39-58 Anew 3D 6-subiteration thinning algorithm based on P-simple points, in: International Conference on Discrete Geometry for Computer Imagery, DGCI'2002, Bordeaux, France, ENTCS. vol. 2301, Springer, Berlin, 2(X)2, pp, 102-113., A 3D 12-subiteration thinning algorithm based on P-simple points. Discrete Appl. Math. 139(1-3) (2004) 171-195.], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points (in particular, we have already proposed a 12-subiteration thinning algorithm C. Lohou, G. Bertrand [International Workshop on Combinatorial linage Analysis. IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001. pp. 39-58 A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.]). In this paper, by applying this methodology. we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palagyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.]. (c) 2005 Elsevier B.V. All rights reserved.
Video compression techniques usually Involve lossy compression algorithms, with much of the original Image data being discarded because It Is not essential for human perception. However, lossy compression not only red...
详细信息
暂无评论