Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Commun...Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.展开更多
In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from...In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from the existing works, the proposed algorithm is energy-efficient which is more applicable to the future green network. It considers both the sum-MSE problem and the power consumption problem for the users under the relay power constraint. Based on the optimal condition decomposition(OCD) method, the energy-efficient precoders at the users can be designed separately with limited information exchanged. The proposed relay beamforming algorithm is based on the alternative direction method of multipliers(ADMM) which has simpler iterative solution and enjoys good convergence. Simulation results demonstrate the performance of the proposed algorithms in terms of power consumption and MSE performance.展开更多
1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input （with an inkdot） once. This paper investigates the ...1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input （with an inkdot） once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential （universal） states, and shows, for example, that for any function L（n） such that L（n） ≥ log logn and L（n） = o（log n）, the class of sets accepted by weakly （strongly） L（n） space-bounded 1-inkdot two-way alternating pushdown automata with only existential （universal） states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.展开更多
并发加权μ-演算(concurrent weightedμ-calculus,CWC)是对Kim. G. Larsen所提出的并发加权逻辑的强有力的扩充,通过加入不动点算子,增强表达能力,实现对复杂模块化系统的有效建模。对CWC进行了研究,给出了CWC的语法并阐述了CWC的标记...并发加权μ-演算(concurrent weightedμ-calculus,CWC)是对Kim. G. Larsen所提出的并发加权逻辑的强有力的扩充,通过加入不动点算子,增强表达能力,实现对复杂模块化系统的有效建模。对CWC进行了研究,给出了CWC的语法并阐述了CWC的标记加权转移语义。μ-演算与自动机理论密不可分,引入了轮替树自动机用于处理CWC,阐述了轮替树自动机与CWC之间的联系,构建了一种特定的用于CWC的轮替树自动机模型。一致性内插定理是Craig内插定理的加强和扩展,为了探究CWC上的一致性内插定理,根据Andrew M. Pitts提出的方法,利用互模拟量词寻找一致性插值。给出了互模拟量词在标记加权转移系统上的语义,并研究了互模拟量词和CWC上一致性内插定理之间的关系。在此过程中利用ω展开(unravelling),由ω展开树的一系列特性,结合轮替树自动机,证明了一致性内插定理在CWC上成立。展开更多
文摘Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.
基金supported by China National S&T Major Project 2013ZX03003002-003National Natural Science Foundation of China under Grant No. 61176027, No.61421001111 Project of China under Grant B14010
文摘In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from the existing works, the proposed algorithm is energy-efficient which is more applicable to the future green network. It considers both the sum-MSE problem and the power consumption problem for the users under the relay power constraint. Based on the optimal condition decomposition(OCD) method, the energy-efficient precoders at the users can be designed separately with limited information exchanged. The proposed relay beamforming algorithm is based on the alternative direction method of multipliers(ADMM) which has simpler iterative solution and enjoys good convergence. Simulation results demonstrate the performance of the proposed algorithms in terms of power consumption and MSE performance.
基金This work is supported by the National Natural Science Foundation of China under Grant No. 60403012,
文摘1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input （with an inkdot） once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential （universal） states, and shows, for example, that for any function L（n） such that L（n） ≥ log logn and L（n） = o（log n）, the class of sets accepted by weakly （strongly） L（n） space-bounded 1-inkdot two-way alternating pushdown automata with only existential （universal） states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.
文摘并发加权μ-演算(concurrent weightedμ-calculus,CWC)是对Kim. G. Larsen所提出的并发加权逻辑的强有力的扩充,通过加入不动点算子,增强表达能力,实现对复杂模块化系统的有效建模。对CWC进行了研究,给出了CWC的语法并阐述了CWC的标记加权转移语义。μ-演算与自动机理论密不可分,引入了轮替树自动机用于处理CWC,阐述了轮替树自动机与CWC之间的联系,构建了一种特定的用于CWC的轮替树自动机模型。一致性内插定理是Craig内插定理的加强和扩展,为了探究CWC上的一致性内插定理,根据Andrew M. Pitts提出的方法,利用互模拟量词寻找一致性插值。给出了互模拟量词在标记加权转移系统上的语义,并研究了互模拟量词和CWC上一致性内插定理之间的关系。在此过程中利用ω展开(unravelling),由ω展开树的一系列特性,结合轮替树自动机,证明了一致性内插定理在CWC上成立。
