39 resultados para Unlipped channel sections
Resumo:
Quantum states can be used to encode the information contained in a direction, i.e., in a unit vector. We present the best encoding procedure when the quantum state is made up of N spins (qubits). We find that the quality of this optimal procedure, which we quantify in terms of the fidelity, depends solely on the dimension of the encoding space. We also investigate the use of spatial rotations on a quantum state, which provide a natural and less demanding encoding. In this case we prove that the fidelity is directly related to the largest zeros of the Legendre and Jacobi polynomials. We also discuss our results in terms of the information gain.
Resumo:
The relativistic distorted-wave Born approximation is used to calculate differential and total cross sections for inner shell ionization of neutral atoms by electron and positron impact. The target atom is described within the independent-electron approximation using the self-consistent Dirac-Fock-Slater potential. The distorting potential for the projectile is also set equal to the Dirac-Fock-Slater potential. For electrons, this guarantees orthogonality of all the orbitals involved and simplifies the calculation of exchange T-matrix elements. The interaction between the projectile and the target electrons is assumed to reduce to the instantaneous Coulomb interaction. The adopted numerical algorithm allows the calculation of differential and total cross sections for projectiles with kinetic energies ranging from the ionization threshold up to about ten times this value. Algorithm accuracy and stability are demonstrated by comparing differential cross sections calculated by our code with the distorting potential set to zero with equivalent results generated by a more robust code that uses the conventional plane-wave Born approximation. Sample calculation results are presented for ionization of K- and L-shells of various elements and compared with the available experimental data.
Resumo:
We consider the distribution of cross sections of clusters and the density-density correlation functions for the A+B¿0 reaction. We solve the reaction-diffusion equations numerically for random initial distributions of reactants. When both reactant species have the same diffusion coefficients the distribution of cross sections and the correlation functions scale with the diffusion length and obey superuniversal laws (independent of dimension). For different diffusion coefficients the correlation functions still scale, but the scaling functions depend on the dimension and on the diffusion coefficients. Furthermore, we display explicitly the peculiarities of the cluster-size distribution in one dimension.
Resumo:
We study charmed baryon resonances that are generated dynamically within a unitary meson-baryon coupled-channel model that treats the heavy pseudoscalar and vector mesons on equal footing as required by heavy-quark symmetry. It is an extension of recent SU(4) models with t-channel vector-meson exchanges to an SU(8) spin-flavor scheme, but differs considerably from the SU(4) approach in how the strong breaking of the flavor symmetry is implemented. Some of our dynamically generated states can be readily assigned to recently observed baryon resonances, while others do not have a straightforward identification and require the compilation of more data as well as an extension of the model to d-wave meson-baryon interactions and p-wave coupling in the neglected s- and u-channel diagrams. Of several novelties, we find that the Delta c(2595), which emerged as a ND quasibound state within the SU(4) approaches, becomes predominantly a ND* quasibound state in the present SU(8) scheme.
Resumo:
We study the eta'N interaction within a chiral unitary approach which includes piN , etaN and related pseudoscalar meson-baryon coupled channels. Since the SU(3) singlet does not contribute to the standard interaction and the eta' is mostly a singlet, the resulting scattering amplitude is very small and inconsistent with experimental estimations of the eta' N scattering length. The additional consideration of vector meson-baryon states into the coupled channel scheme, via normal and anomalous couplings of pseudoscalar to vector mesons, enhances substantially the eta' N amplitude. We also exploit the freedom of adding to the Lagrangian a new term, allowed by the symmetries of QCD, which couples baryons to the singlet meson of SU(3). Adjusting the unknown strength to the eta' N scattering length, we obtain predictions for the elastic eta'N -> etaN and inelastic eta' N -> etaN , piN , KLambda, KEpsilon cross sections at low eta' energies, and discuss their significance.
Resumo:
We propose a definition of classical differential cross sections for particles with essentially nonplanar orbits, such as spinning ones. We give also a method for its computation. The calculations are carried out explicitly for electromagnetic, gravitational, and short-range scalar interactions up to the linear terms in the slow-motion approximation. The contribution of the spin-spin terms is found to be at best 10-6 times the post-Newtonian ones for the gravitational interaction.
Resumo:
We consider the distribution of cross sections of clusters and the density-density correlation functions for the A+B¿0 reaction. We solve the reaction-diffusion equations numerically for random initial distributions of reactants. When both reactant species have the same diffusion coefficients the distribution of cross sections and the correlation functions scale with the diffusion length and obey superuniversal laws (independent of dimension). For different diffusion coefficients the correlation functions still scale, but the scaling functions depend on the dimension and on the diffusion coefficients. Furthermore, we display explicitly the peculiarities of the cluster-size distribution in one dimension.
Resumo:
In this paper we present a method for blind deconvolution of linear channels based on source separation techniques, for real word signals. This technique applied to blind deconvolution problems is based in exploiting not the spatial independence between signals but the temporal independence between samples of the signal. Our objective is to minimize the mutual information between samples of the output in order to retrieve the original signal. In order to make use of use this idea the input signal must be a non-Gaussian i.i.d. signal. Because most real world signals do not have this i.i.d. nature, we will need to preprocess the original signal before the transmission into the channel. Likewise we should assure that the transmitted signal has non-Gaussian statistics in order to achieve the correct function of the algorithm. The strategy used for this preprocessing will be presented in this paper. If the receiver has the inverse of the preprocess, the original signal can be reconstructed without the convolutive distortion.
Resumo:
A dual model with a nonlinear proton Regge trajectory in the missing mass (M_X^2) channel is constructed. A background based on a direct-channel exotic trajectory, developed and applied earlier for the inclusive electron-proton cross section description in the nucleon resonance region, is used. The parameters of the model are determined from the extrapolations to earlier experiments. Predictions for the low-mass (2 < M_X^2 < 8GeV^2) diffraction dissociation cross sections at the LHC energies are given.
Resumo:
Trp(Nps)-Lys-NH2 derivatives, bearing alkyl or guanidine groups either at the N-terminus or on the Lys side-chain or at both positions were conveniently prepared on solid-phase and evaluated as TRPV1 channel antagonists.
Resumo:
Broadcast transmission mode in ad hoc networks is critical to manage multihop routing or providing medium accesscontrol (MAC)-layer fairness. In this paper, it is shown that ahigher capacity to exchange information among neighbors may beobtained through a physical-MAC cross-layer design of the broadcastprotocol exploiting signal separation principles. Coherentdetection and separation of contending nodes is possible throughtraining sequences which are selected at random from a reducedset. Guidelines for the design of this set are derived for a lowimpact on the network performance and the receiver complexity.
Resumo:
This paper analyzes the asymptotic performance of maximum likelihood (ML) channel estimation algorithms in wideband code division multiple access (WCDMA) scenarios. We concentrate on systems with periodic spreading sequences (period larger than or equal to the symbol span) where the transmitted signal contains a code division multiplexed pilot for channel estimation purposes. First, the asymptotic covariances of the training-only, semi-blind conditional maximum likelihood (CML) and semi-blind Gaussian maximum likelihood (GML) channelestimators are derived. Then, these formulas are further simplified assuming randomized spreading and training sequences under the approximation of high spreading factors and high number of codes. The results provide a useful tool to describe the performance of the channel estimators as a function of basicsystem parameters such as number of codes, spreading factors, or traffic to training power ratio.
Resumo:
In this paper, the theory of hidden Markov models (HMM) isapplied to the problem of blind (without training sequences) channel estimationand data detection. Within a HMM framework, the Baum–Welch(BW) identification algorithm is frequently used to find out maximum-likelihood (ML) estimates of the corresponding model. However, such a procedureassumes the model (i.e., the channel response) to be static throughoutthe observation sequence. By means of introducing a parametric model fortime-varying channel responses, a version of the algorithm, which is moreappropriate for mobile channels [time-dependent Baum-Welch (TDBW)] isderived. Aiming to compare algorithm behavior, a set of computer simulationsfor a GSM scenario is provided. Results indicate that, in comparisonto other Baum–Welch (BW) versions of the algorithm, the TDBW approachattains a remarkable enhancement in performance. For that purpose, onlya moderate increase in computational complexity is needed.