A Tight Upper Bound on Bit Error Rate of Joint OFDM and Multi-Carrier Index Keying

This letter investigates performance enhancement by the concept of multi-carrier index keying in orthogonal frequency division multiplexing (OFDM) systems. For the performance evaluation, a tight closed-form approximation of the bit error rate (BER) is derived introducing the expression for the number of bit errors occurring in both the index domain and the complex domain, in the presence of both imperfect and perfect detection of active multi-carrier indices. The accuracy of the derived BER results for various cases are validated using simulations, which can provide accuracy within 1 dB at favorable channels.

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph

A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Combined Tevatron upper limit on gg -> H -> W+W- and constraints on the Higgs boson mass in fourth-generation fermion models

We combine results from searches by the CDF and D0 collaborations for a standard model Higgs boson (H) in the process gg -> H -> W+W- in p (p) over bar collisions at the Fermilab Tevatron Collider at root s = 1.96 TeV. With 4.8 fb(-1) of integrated luminosity analyzed at CDF and 5.4 fb(-1) at D0, the 95% confidence level upper limit on sigma(gg -> H) x B(H -> W+W-) is 1.75 pb at m(H) = 120 GeV, 0.38 pb at m(H) = 165 GeV, and 0.83 pb at m(H) = 200 GeV. Assuming the presence of a fourth sequential generation of fermions with large masses, we exclude at the 95% confidence level a standard-model-like Higgs boson with a mass between 131 and 204 GeV.

Upper bound on neutrino mass based on T2K neutrino timing measurements

The Tokai to Kamioka (T2K) long-baseline neutrino experiment consists of a muon neutrino beam, produced at the J-PARC accelerator, a near detector complex and a large 295 km distant far detector. The present work utilizes the T2K event timing measurements at the near and far detectors to study neutrino time of flight as function of derived neutrino energy. Under the assumption of a relativistic relation between energy and time of flight, constraints on the neutrino rest mass can be derived. The sub-GeV neutrino beam in conjunction with timing precision of order tens of ns provide sensitivity to neutrino mass in the few MeV/c^2 range. We study the distribution of relative arrival times of muon and electron neutrino candidate events at the T2K far detector as a function of neutrino energy. The 90% C.L. upper limit on the mixture of neutrino mass eigenstates represented in the data sample is found to be m^2 < 5.6 MeV^2/c^4.

A geometric characterization of the upper bound for the span of the jones polynomial

Let D be a link diagram with n crossings, sA and sB be its extreme states and |sAD| (respectively, |sBD|) be the number of simple closed curves that appear when smoothing D according to sA (respectively, sB). We give a general formula for the sum |sAD| + |sBD| for a k-almost alternating diagram D, for any k, characterizing this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |sAD| + |sBD| = n + 2 - 2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu [On Kauffman brackets, J. Knot Theory Ramifications6(1) (1997) 125–148.]. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al. [Almost alternating links, Topology Appl.46(2) (1992) 151–165.], is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram

Beyond the H2/CO2 upper bound: one-step crystallization and separation of nano-sized ZIF-11 by centrifugation and its application in mixed matrix membranes

The synthesis of nano-sized ZIF-11 with an average size of 36 ± 6 nm is reported. This material has been named nano-zeolitic imidazolate framework-11 (nZIF-11). It has the same chemical composition and thermal stability and analogous H2 and CO2 adsorption properties to the conventional microcrystalline ZIF-11 (i.e. 1.9 ± 0.9 μm). nZIF-11 has been obtained following the centrifugation route, typically used for solid separation, as a fast new technique (pioneering for MOFs) for obtaining nanomaterials where the temperature, time and rotation speed can easily be controlled. Compared to the traditional synthesis consisting of stirring + separation, the reaction time was lowered from several hours to a few minutes when using this centrifugation synthesis technique. Employing the same reaction time (2, 5 or 10 min), micro-sized ZIF-11 was obtained using the traditional synthesis while nano-scale ZIF-11 was achieved only by using centrifugation synthesis. The small particle size obtained for nZIF-11 allowed the use of the wet MOF sample as a colloidal suspension stable in chloroform. This helped to prepare mixed matrix membranes (MMMs) by direct addition of the membrane polymer (polyimide Matrimid®) to the colloidal suspension, avoiding particle agglomeration resulting from drying. The MMMs were tested for H2/CO2 separation, improving the pure polymer membrane performance, with permeation values of 95.9 Barrer of H2 and a H2/CO2 separation selectivity of 4.4 at 35 °C. When measured at 200 °C, these values increased to 535 Barrer and 9.1.

An upper bound for the number of certain error correcting codes /

"August 9, 1954"

An upper bound on the Bayesian error bars for generalized linear regression

In the Bayesian framework, predictions for a regression problem are expressed in terms of a distribution of output values. The mode of this distribution corresponds to the most probable output, while the uncertainty associated with the predictions can conveniently be expressed in terms of error bars. In this paper we consider the evaluation of error bars in the context of the class of generalized linear regression models. We provide insights into the dependence of the error bars on the location of the data points and we derive an upper bound on the true error bars in terms of the contributions from individual data points which are themselves easily evaluated.

New Upper Bound for the Edge Folkman Number Fe(3,5;13)

2000 Mathematics Subject Classification: 05C55.