Godel Universe from String Theory

G\"odel universe is a direct product of a line and a three-dimensional spacetime we call G$_\alpha$. In this paper, we show that the G\"odel metrics can arise as exact solutions in Einstein-Maxwell-Axion, Einstein-Proca-Axion, or Freedman-Schwarz gauged supergravity theories. The last allows us to embed G\"odel universe in string theory. The ten-dimensional spacetime is a direct product of a line and the nine-dimensional one of an $S^3\times S^3$ bundle over G$_\alpha$, and it can be interpreted as some decoupling limit of the rotating D1/D5/D5 intersection. For some appropriate parameter choice, the nine-dimensional metric becomes an AdS$_3\times S^3$ bundle over squashed 3-sphere. We also study the properties of the G\"odel black holes that are constructed from the double Wick rotations of the G\"odel metrics.Comment: latex, 20 pages, discussion on null-energy condition included, typos corrected and references adde

BIOMECHANICAL ANALYSIS AND EVALUATION OF THE POWER SERVE OF FEMALE TENNIS PLAYERS

The purpose of this study was to obtain and analyze the kinetic characteristics of the power serve in tennis and to jUdge whether or not the subjects' skills were reasonable. This in turn would provide a theoretical reference of the theory and training of the tennis power serve. Three-dimensional (3-D) videography was used to record the tennis service action of eight female tennis players. The analysis suggested that the theory of "whiplash movement" can be applied in the analysis of this performance. Quality and effectiveness of racket-swing action are decided directly by increased velocity and timing in successive segments from lower to upper. Some indexes were provided to evaluate the actions of the tennis power serve. Some suggestions were made to players for improvement in their performance

An improved MOEA/D algorithm for multi-objective multicast routing with network coding

Network coding enables higher network throughput, more balanced traffic, and securer data transmission. However, complicated mathematical operations incur when packets are combined at intermediate nodes, which, if not operated properly, lead to very high network resource consumption and unacceptable delay. Therefore, it is of vital importance to minimize various network resources and end-to-end delays while exploiting promising benefits of network coding. Multicast has been used in increasingly more applications, such as video conferencing and remote education. In this paper the multicast routing problem with network coding is formulated as a multi-objective optimization problem (MOP), where the total coding cost, the total link cost and the end-to-end delay are minimized simultaneously. We adapt the multi-objective evolutionary algorithm based on decomposition (MOEA/D) for this MOP by hybridizing it with a population-based incremental learning technique which makes use of the global and historical information collected to provide additional guidance to the evolutionary search. Three new schemes are devised to facilitate the performance improvement, including a probability-based initialization scheme, a problem-specific population updating rule, and a hybridized reproduction operator. Experimental results clearly demonstrate that the proposed algorithm outperforms a number of state-of-the-art MOEAs regarding the solution quality and computational time