28,348 research outputs found
Anisotropic thermal expansion of AEFe2As2 (AE = Ba, Sr, Ca) single crystals
We report anisotropic thermal expansion of the parent, AEFe2As2 (AE = Ba, Sr,
and Ca), compounds. Above the structural/antiferromagnetic phase transition
anisotropy of the thermal expansion coefficients is observed, with the
coefficient along the a-axis being significantly smaller than the coefficient
for the c-axis. The high temperature (200 K < T < 300 K) coefficients
themselves have similar values for the compounds studied. The sharp anomalies
associated with the structural/antiferromagnetic phase transitions are clearly
seen in the thermal expansion measurements. For all three pure compounds the
"average" a-value increases and the c-lattice parameter decreases on warming
through the transition with the smallest change in the lattice parameters
observed for SrFe2As2. The data are in general agreement with the literature
data from X-ray and neutron diffraction experiments
Specific heat jump at the superconducting transition temperature in Ba(Fe(1-x)Cox)2As2 and Ba(Fe(1-x)Nix)2As2 single crystals
We present detailed heat capacity measurements for Ba(Fe(1-x)Cox)2As2 and
Ba(Fe(1-x)Nix)2As2 single crystals in the vicinity of the superconducting
transitions. The specific heat jump at the superconducting transition
temperature (Tc), Delta Cp/Tc, changes by a factor ~ 10 across these series.
The Delta Cp/T$ vs. Tc data of this work (together with the literature data for
Ba(Fe0.939Co0.061)2As2, (Ba0.55K0.45)Fe2As2, and (Ba0.6K0.4)Fe2As2) scale well
to a single log-log plot over two orders of magnitude in Delta Cp/Tc and over
about an order of magnitude in Tc, giving Delta Cp/Tc ~ Tc^2
Genetic Algorithm Aided Timeslot Scheduling for UTRA TDD CDMA Networks
It is demonstrated that genetic algorithms may be utilised for finding a suboptimum but highly beneficial uplink (UL) or downlink (DL) timeslot (TS) allocation for improving the achievable performance of the third generation UTRA systemâs time division duplex (TDD) mode. It is demonstrated that this novel GA-assisted UL=DL timeslot scheduling scheme is capable of avoiding the severe BS to BS intercell interference potentially inflicted by the UTRA TDD CDMA air interface owing to allowing all TSs to be used both in the UL and DL, hence potentially quadrupling the carried teletraffic and halving the uplink power
Genetically Enhanced Performance of a UTRA-like Time-Division Duplex CDMA Network
In this contribution a Dynamic Channel Allocation (DCA) algorithm is developed, which minimizes the amount of Multi-User Interference (MUI) experienced at the Base Stations (BSs) by employing Genetic Algorithms (GAs). A GA is utilized for finding a suboptimum, but highly beneficial Uplink (UL) or Downlink (DL) Timeslot (TS) allocation for improving the achievable performance of the third generation UTRA systemâs Time Division Duplex (TDD) mode. It is demonstrated that a GA-assisted UL/DL timeslot scheduling scheme may avoid the severe BS to BS inter-cell interference potentially inflicted by the UTRA TDD CDMA air interface owing to allowing all TSs to be used both in the UL and D
An optimal gap theorem
By solving the Cauchy problem for the Hodge-Laplace heat equation for
-closed, positive -forms, we prove an optimal gap theorem for
K\"ahler manifolds with nonnegative bisectional curvature which asserts that
the manifold is flat if the average of the scalar curvature over balls of
radius centered at any fixed point is a function of .
Furthermore via a relative monotonicity estimate we obtain a stronger
statement, namely a `positive mass' type result, asserting that if is
not flat, then for any
Adaptive EDCF: Enhanced service differentiation for IEEE 802.11 wireless ad-hoc networks
This paper describes an adaptive service differentiation scheme for QoS enhancement in IEEE 802.11 wireless ad-hoc networks. Our approach, called adaptive enhanced distributed coordination function (AEDCF), is derived from the new EDCF introduced in the upcoming IEEE 802.11e standard. Our scheme aims to share the transmission channel efficiently. Relative priorities are provisioned by adjusting the size of the contention window (CW) of each traffic class taking into account both applications requirements and network conditions. We evaluate through simulations the performance of AEDCF and compare it with the EDCF scheme proposed in the 802.11e. Results show that AEDCF outperforms the basic EDCF, especially at high traffic load conditions. Indeed, our scheme increases the medium utilization ratio and reduces for more than 50% the collision rate. While achieving delay differentiation, the overall goodput obtained is up to 25% higher than EDCF. Moreover, the complexity of AEDCF remains similar to the EDCF scheme, enabling the design of cheap implementations
Loosely Synchronised Spreading Code Aided Network Performance of Quasi-Synchronous UTRA-like TDD and FDD CDMA Systems
It is demonstrated that loosely synchronised (LS) spreading codes exhibit a so-called interference-free window, where both the autocorrelation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both inter-symbolinterference and multiple-access-interference in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. The work reported has studied the achievable network performance and compared it to that of a UTRA-like time division duplex (TDD) and frequency division duplex (FDD) CDMA system using orthogonal variable rate spreading factor codes
Adaptive Beamforming and Adaptive Modulation-Assisted Network Performance of Multiuser Detection-Aided FDD and TDD CDMA Systems
The network performance of a frequency division duplex and time division duplex (TDD) code division multiple access (CDMA)-based system is investigated using system parameters similar to those of the Universal Mobile Telecommunication System. The new call blocking and call dropping probabilities, the probability of low-quality access, and the required average transmit power are quantified both with and without adaptive antenna arrays (AAAs), as well as when subjected to shadow fading. In some of the scenarios investigated, the systemâs user capacity is doubled with the advent of adaptive antennas. The employment of adaptive modulation techniques in conjunction with AAAs resulted in further significant network capacity gains. This is particularly so in the context of TDD CDMA, where the systemâs capacity becomes poor without adaptive antennas and adaptive modulation owing to the high base station (BS) to BS interference inflicted as a consequence of potentially using all time slots in both the uplink and downlink of the emerging wireless Internet. Index TermsâAdaptive beamforming, adaptive modulation, code division multiple access (CDMA) systems, Universal Mobile Telecommunication System Terrestrial Radio Access (UTRA), wireless network performance
Loosely synchronized spreading code aided network performance of quasi-synchronous UTRA-like TDD/CDMA systems
In this paper we investigate the achievable capacity of a UTRA-like Time Division Duplex (TDD) Code Division Multiple Access (CDMA) system employing Loosely Synchronized (LS) spreading codes. The family of operational CDMA systems is interference limited, suffering from Inter-Symbol-Interference (ISI), since the orthogonality of the spreading sequences is destroyed by the frequency selective channel. They also suffer from Multiple-Access-Interference (MAI) owing to the non-zero cross-correlations of the spreading codes. By contrast, the family of LS codes exhibits a so-called Interference Free Window (IFW), where both the auto-correlation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both ISI and MAI in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. This contribution studies the achievable network performance in comparison to that of a UTRA-like TDD/CDMA system using Orthogonal Vari- MSO able Rate Spreading Factor (OVSF) codes
- âŠ