Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Optimality of orthogonal sequences with multi-dimensional signaling

The sum capacity on a symbol-synchronous CDMA system having processing gain N and supporting K power constrained users is achieved by employing any set of N orthogonal sequences if a few users are allowed to signal along multiple dimensions. Analogously, the minimum received power (energy-per-chip) on the symbolsynchronous CDMA system supporting K users that demand specified data rates is attained by employing any set of N orthogonal sequences. At most (N - 1) users need to be split and if there are no oversized users, these split users need to signal only in two dimensions each. These results show that sum capacity or minimum sum power can be achieved with minimal downlink signaling.

Relay Precoder Optimization in MIMO-Relay Networks With Imperfect CSI

In this paper, we consider robust joint designs of relay precoder and destination receive filters in a nonregenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a MIMO-relay node. The channel state information (CSI) available at the relay node is assumed to be imperfect. We consider robust designs for two models of CSI error. The first model is a stochastic error (SE) model, where the probability distribution of the CSI error is Gaussian. This model is applicable when the imperfect CSI is mainly due to errors in channel estimation. For this model, we propose robust minimum sum mean square error (SMSE), MSE-balancing, and relay transmit power minimizing precoder designs. The next model for the CSI error is a norm-bounded error (NBE) model, where the CSI error can be specified by an uncertainty set. This model is applicable when the CSI error is dominated by quantization errors. In this case, we adopt a worst-case design approach. For this model, we propose a robust precoder design that minimizes total relay transmit power under constraints on MSEs at the destination nodes. We show that the proposed robust design problems can be reformulated as convex optimization problems that can be solved efficiently using interior-point methods. We demonstrate the robust performance of the proposed design through simulations.

Rozproszone algorytmy aproksymacyjne dla grafów dyskowych

Wydział Matematyki i Informatyki: Zakład Matematyki Dyskretnej

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Extraterrestrial 3He estimation across the Paleocene-Eocene thermal maximum at ODP Site 208-1266

In the deep-sea, the Paleocene-Eocene Thermal Maximum (PETM) is often marked by clay-rich condensed intervals caused by dissolution of carbonate sediments, capped by a carbonate-rich interval. Constraining the duration of both the dissolution and subsequent cap-carbonate intervals is essential to computing marine carbon fluxes and thus testing hypotheses for the origin of this event. To this end, we provide new high-resolution helium isotope records spanning the Paleocene-Eocene boundary at ODP Site 1266 in the South Atlantic. The extraterrestrial 3He, 3HeET, concentrations replicate trends observed at ODP Site 690 by Farley and Eltgroth (2003, doi:10.1016/S0012-821X(03)00017-7). By assuming a constant flux of 3HeET we constrain relative changes in accumulation rates of sediment across the PETM and construct a new age model for the event. In this new chronology the zero carbonate layer represents 35 kyr, some of which reflects clay produced by dissolution of Paleocene (pre-PETM) sediments. Above this layer, carbonate concentrations increase for ~165 kyr and remain higher than in the latest Paleocene until 234 +48/-34 kyr above the base of the clay. The new chronology indicates that minimum d13C values persisted for a maximum of 134 +27/-19 kyr and the inflection point previously chosen to designate the end of the CIE recovery occurs at 217 +44/-31 kyr. This allocation of time differs from that of the cycle-based age model of Röhl et al. (2007, doi:10.1029/2007GC001784) in that it assigns more time to the clay layer followed by a more gradual recovery of carbonate-rich sedimentation. The new model also suggests a longer sustained d13C excursion followed by a more rapid recovery to pre-PETM d13C values. These differences have important implications for constraining the source(s) of carbon and mechanisms for its subsequent sequestration, favoring models that include a sustained release

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Outer Bounds on the Sum Rate of the K-User MIMO Gaussian Interference Channel

This paper derives outer bounds on the sum rate of the K-user MIMO Gaussian interference channel (GIC). Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). The relative performance of the bounds yields insight into the performance limits of multiuser MIMO GICs and the relative merits of different schemes for interference management. These insights are confirmed by establishing the optimality of the bounds in specific cases using an inner bound on the GDOF derived by the authors in a previous work. It is also shown that many of the existing results on the GDOF of the GIC can be obtained as special cases of the bounds, e. g., by setting K = 2 or the number of antennas at each user to 1.

Optimal Minimum Wage in a Competitive Economy: an Alternative Modelling Approach

This paper analyzes whether a minimum wage can be an optimal redistribution policy when distorting taxes and lump-sum transfers are also available in a competitive economy. We build a static general equilibrium model with a Ramsey planner making decisions on taxes, transfers, and minimum wage levels. Workers are assumed to differ only in their productivity. We find that optimal redistribution may imply the use of a minimum wage. The key factor driving our results is the reaction of the demand for low skilled labor to the minimum wage law. Hence, an optimal minimum wage appears to be most likely when low skilled households are scarce, the complementarity between the two types of workers is large or the difference in productivity is small. The main contribution of the paper is a modelling approach that allows us to adopt analysis and solution techniques widely used in recent public finance research. Moreover, this modelling strategy is flexible enough to allow for potential extensions to include dynamics into the model.

Copépodes pélagiques du plateau ivoirien. 2 - Utilisation de l'arbre de longueur minimum dans le classement des récoltes

The minimum spanning tree algorithm is used to classify two sets of planktonic copepod samples. This algorithm links the samples the distance of which is minimum, without doing a loop, so that the sum of the segment lengths is minimum. The authors estimated the distance between samples by 2 different ways: by a coefficient of association the Jaccard's index - and by the x2 distance. Jaccard's index is not retained but the use of the x2 distance allows comparison with the 'analyse factorielle des correspondances'. The results are discussed from an ecological point of view.

Novel Generic Bounds on the Sum Rate of MIMO ZF Receivers

This paper introduces some novel upper and lower bounds on the achievable sum rate of multiple-input multiple-output (MIMO) systems with zero-forcing (ZF) receivers. The presented bounds are not only tractable but also generic since they apply for different fading models of interest, such as uncorrelated/ correlated Rayleigh fading and Ricean fading. We further formulate a new relationship between the sum rate and the first negative moment of the unordered eigenvalue of the instantaneous correlation matrix. The derived expressions are explicitly compared with some existing results on MIMO systems operating with optimal and minimum mean-squared error (MMSE) receivers. Based on our analytical results, we gain valuable insights into the implications of the model parameters, such as the number of antennas, spatial correlation and Ricean-K factor, on the sum rate of MIMO ZF receivers. © 2011 IEEE.

Basal temperature and thermal sum in phenological phases of nectarine and peach cultivars

O objetivo deste trabalho foi avaliar a temperatura basal, a soma térmica acumulada em diferentes fases fenológicas, a duração das fenofases, a produtividade e a sazonalidade do ciclo de uma cultivar de nectarina e de 14 cultivares de pêssego, entre 2006 e 2009. As fases fenológicas consideradas foram: poda-brotação; brotação-florescimento, da gema inchada até a flor aberta; florescimento-frutificação, da queda das pétalas até o fruto médio; e maturação. As temperaturas basais mínimas obtidas foram: poda-brotação, 8°C, independentemente das cultivares avaliadas; brotação-florescimento, 10°C, com exceção de 'Cascata 968', que necessitou de Tb de 8°C; florescimento-frutificação, 12°C, exceto 'Oro Azteca', que necessitou de Tb de 14°C; maturação, 14°C, com exceção de 'Sunblaze', 'Diamante Mejorado' e 'Precocinho', com Tb de 12°C. Para a maioria das cultivares, as temperaturas basais máximas foram de 30, 34, 34 e 28ºC, nas fases poda-brotação, brotação-florescimento, florescimento-frutificação e maturação, respectivamente. 'Turmalina', 'Marli' e 'Tropic Beauty' apresentaram produtividade média de 3.945,0, 3.969,3 e 3.954,0 kg ha-1, em 2009, respectivamente, enquanto a nectarineira 'Sunblaze' produziu em torno de 3.900 kg ha-1 em 2008 e 2009. As cultivares diferiram quanto ao ciclo total e quanto às somas térmicas acumuladas que variaram, respectivamente, de 245 dias e 1.881,4 graus-dia em 'Oro Azteca', a 144 dias e 1.455,7 graus-dia em 'Precocinho'.

Minimum count sums for charcoalconcentration estimates in pollen slides: accuracy and potential errors

Charcoal particles in pollen slides are often abundant, and thus analysts are faced with the problem of setting the minimum counting sum as small as possible in order to save time. We analysed the reliability of charcoal-concentration estimates based on different counting sums, using simulated low-to high-count samples. Bootstrap simulations indicate that the variability of inferred charcoal concentrations increases progressively with decreasing sums. Below 200 items (i.e., the sum of charcoal particles and exotic marker grains), reconstructed fire incidence is either too high or too low. Statistical comparisons show that the means of bootstrap simulations stabilize after 200 counts. Moreover, a count of 200-300 items is sufficient to produce a charcoal-concentration estimate with less than+5% error if compared with high-count samples of 1000 items for charcoal/marker grain ratios 0.1-0.91. If, however, this ratio is extremely high or low (> 0.91 or < 0.1) and if such samples are frequent, we suggest that marker grains are reduced or added prior to new sample processing.