The Casimir effect for parallel plates at finite temperature in the presence of one fractal extra compactified dimension

We discuss the Casimir effect for massless scalar fields subject to the Dirichlet boundary conditions on the parallel plates at finite temperature in the presence of one fractal extra compactified dimension. We obtain the Casimir energy density with the help of the regularization of multiple zeta function with one arbitrary exponent and further the renormalized Casimir energy density involving the thermal corrections. It is found that when the temperature is sufficiently high, the sign of the Casimir energy remains negative no matter how great the scale dimension $\delta$ is within its allowed region. We derive and calculate the Casimir force between the parallel plates affected by the fractal additional compactified dimension and surrounding temperature. The stronger thermal influence leads the force to be stronger. The nature of the Casimir force keeps attractive.Comment: 14 pages, 2 figure

Light Front Approach for Strong and Weak Decays of Pentaquarks

Strong and weak decays of pentaquarks are studied in the framework of the light-front approach.Comment: 3 pages, talk given at the 2004 DPF Meeting, Riverside, CA. Aug 26-31, 200

Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search

Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks

Copyright @ 2008 IEEEThis paper proposes a genetic algorithm (GA) based optimization approach to search a minimum-interference multicast tree which satis¯es the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented en- coding method is used and each chromosome is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. Crossover and mutation are well designed to adapt to the tree structure. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed GA based multicast algorithm achieves better performance in terms of both the total channel conflict and the tree cost than that of a well known algorithm

Constraints in binary semantical networks

Information Systems;Management Information Systems;Networks;management information systems

Some results on 2n−m2^{n-m} designs of resolution IV with (weak) minimum aberration

It is known that all resolution IV regular $2^{n-m}$ designs of run size $N=2^{n-m}$ where $5N/16<n<N/2$ must be projections of the maximal even design with $N/2$ factors and, therefore, are even designs. This paper derives a general and explicit relationship between the wordlength pattern of any even $2^{n-m}$ design and that of its complement in the maximal even design. Using these identities, we identify some (weak) minimum aberration $2^{n-m}$ designs of resolution IV and the structures of their complementary designs. Based on these results, several families of minimum aberration $2^{n-m}$ designs of resolution IV are constructed.Comment: Published in at http://dx.doi.org/10.1214/08-AOS670 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org