3,297 research outputs found
Magnetospheric particle acceleration and X-ray emission of pulsars
The available data on isolated X-ray pulsars, their wind nebulae, and the
supernova remnants which are connected to some of these sources are analyzed.
It is shown that electric fields of neutron stars tear off charged particles
from the surface of neutron star and trigger the acceleration of particles. The
charged particles are accelerated mainly in the field of magneto-dipole
radiation wave. Power and energy spectra of the charged particles depend on the
strength of the magneto-dipole radiation. Therefore, the X-ray radiation is
strongly dependent on the rate of rotational energy loss and weakly dependent
on the electric field intensity. Coulomb interaction between the charged
particles is the main factor for the energy loss and the X-ray spectra of the
charged particles.Comment: minor correction on table format, 20 pages (4 figures, 1 table),
submitted to International Journal of Modern Physics
Products, coproducts and singular value decomposition
Products and coproducts may be recognized as morphisms in a monoidal tensor
category of vector spaces. To gain invariant data of these morphisms, we can
use singular value decomposition which attaches singular values, ie generalized
eigenvalues, to these maps. We show, for the case of Grassmann and Clifford
products, that twist maps significantly alter these data reducing degeneracies.
Since non group like coproducts give rise to non classical behavior of the
algebra of functions, ie make them noncommutative, we hope to be able to learn
more about such geometries. Remarkably the coproduct for positive singular
values of eigenvectors in yields directly corresponding eigenvectors in
A\otimes A.Comment: 17 pages, three eps-figure
THE WAIT-AND-SEE OPTION IN ASCENDING PRICE AUCTIONS
Cake-cutting protocols aim at dividing a ``cake'' (i.e., a divisible
resource) and assigning the resulting portions to several players in a way that
each of the players feels to have received a ``fair'' amount of the cake. An
important notion of fairness is envy-freeness: No player wishes to switch the
portion of the cake received with another player's portion. Despite intense
efforts in the past, it is still an open question whether there is a
\emph{finite bounded} envy-free cake-cutting protocol for an arbitrary number
of players, and even for four players. We introduce the notion of degree of
guaranteed envy-freeness (DGEF) as a measure of how good a cake-cutting
protocol can approximate the ideal of envy-freeness while keeping the protocol
finite bounded (trading being disregarded). We propose a new finite bounded
proportional protocol for any number n \geq 3 of players, and show that this
protocol has a DGEF of 1 + \lceil (n^2)/2 \rceil. This is the currently best
DGEF among known finite bounded cake-cutting protocols for an arbitrary number
of players. We will make the case that improving the DGEF even further is a
tough challenge, and determine, for comparison, the DGEF of selected known
finite bounded cake-cutting protocols.Comment: 37 pages, 4 figure
Evolution Equation of Phenotype Distribution: General Formulation and Application to Error Catastrophe
An equation describing the evolution of phenotypic distribution is derived
using methods developed in statistical physics. The equation is solved by using
the singular perturbation method, and assuming that the number of bases in the
genetic sequence is large. Applying the equation to the mutation-selection
model by Eigen provides the critical mutation rate for the error catastrophe.
Phenotypic fluctuation of clones (individuals sharing the same gene) is
introduced into this evolution equation. With this formalism, it is found that
the critical mutation rate is sometimes increased by the phenotypic
fluctuations, i.e., noise can enhance robustness of a fitted state to mutation.
Our formalism is systematic and general, while approximations to derive more
tractable evolution equations are also discussed.Comment: 22 pages, 2 figure
Effective Capacity in Broadcast Channels with Arbitrary Inputs
We consider a broadcast scenario where one transmitter communicates with two
receivers under quality-of-service constraints. The transmitter initially
employs superposition coding strategies with arbitrarily distributed signals
and sends data to both receivers. Regarding the channel state conditions, the
receivers perform successive interference cancellation to decode their own
data. We express the effective capacity region that provides the maximum
allowable sustainable data arrival rate region at the transmitter buffer or
buffers. Given an average transmission power limit, we provide a two-step
approach to obtain the optimal power allocation policies that maximize the
effective capacity region. Then, we characterize the optimal decoding regions
at the receivers in the space spanned by the channel fading power values. We
finally substantiate our results with numerical presentations.Comment: This paper will appear in 14th International Conference on
Wired&Wireless Internet Communications (WWIC
- …