Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

Robust GNSS signal detection in the presence of navigation data bits

This paper considers the problem of weak signal detection in the presence of navigation data bits for Global Navigation Satellite System (GNSS) receivers. Typically, a set of partial coherent integration outputs are non-coherently accumulated to combat the effects of model uncertainties such as the presence of navigation data-bits and/or frequency uncertainty, resulting in a sub-optimal test statistic. In this work, the test-statistic for weak signal detection is derived in the presence of navigation data-bits from the likelihood ratio. It is highlighted that averaging the likelihood ratio based test-statistic over the prior distributions of the unknown data bits and the carrier phase uncertainty leads to the conventional Post Detection Integration (PDI) technique for detection. To improve the performance in the presence of model uncertainties, a novel cyclostationarity based sub-optimal PDI technique is proposed. The test statistic is analytically characterized, and shown to be robust to the presence of navigation data-bits, frequency, phase and noise uncertainties. Monte Carlo simulation results illustrate the validity of the theoretical results and the superior performance offered by the proposed detector in the presence of model uncertainties.

Full-rate full-diversity achieving MIMO precoding with partial CSIT

In this paper, we consider a slow-fading nt ×nr multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of interest in such channels. We propose a new precoding scheme which achieves both full diversity (nt ×nrth order diversity) as well as full rate (nt symbols per channel use) using partial channel state information at the transmitter (CSIT). The proposed scheme achieves full diversity and improved coding gain through an optimization over the choice of constellation sets. The optimization maximizes dmin2 for our precoding scheme subject to an energy constraint. The scheme requires feedback of nt - 1 angle parameter values, compared to 2ntnr real coefficients in case of full CSIT. Further, for the case of nt × 1 system, we prove that the capacity achieved by the proposed scheme is same as that achieved with full CSIT. Error rate performance results for nt = 3,4,8 show that the proposed scheme performs better than other precoding schemes in the literature; the better performance is due to the choice of the signal sets and the feedback angles in the proposed scheme.

Governing the local networks in Indian agrarian societies-an MAS perspective

In a networked society, governing advocacy groups and networks through decentralized systems of policy implementation has been the interest of governance network literature. This paper addresses the topic of governing networks in the context of Indian agrarian societies by taking the case example of a welfare scheme for the Indian rural poor. We explore context-specific regulatory dynamics through the situated agent based architectural framework. The effects of various regulatory strategies that can be adopted by governing node are tested under various action arenas through experimental design. Results show the impact of regulatory strategies on the resource dependencies and asymmetries in the network relationships. This indicates that the optimal feasible regulatory strategy in networked society is institutionally rational and is context dependent. Further, we show that situated MAS architecture is a natural fit for institutional understanding of the dynamics (Ostrom et al. in Rules, games, and common-pool resources, 1994).

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Reduced-complexity partial-interference-cancellation group decoder for STBCs

In this letter, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.

Costs and benefits of the presence of leopards to the sport-hunting industry and local communities in Niassa national reserve, mozambique

Sport hunting is often proposed as a tool to support the conservation of large carnivores. However, it is challenging to provide tangible economic benefits from this activity as an incentive for local people to conserve carnivores. We assessed economic gains from sport hunting and poaching of leopards (Panthera pardus), costs of leopard depredation of livestock, and attitudes of people toward leopards in Niassa National Reserve, Mozambique. We sent questionnaires to hunting concessionaires (n = 8) to investigate the economic value of and the relative importance of leopards relative to other key trophy-hunted species. We asked villagers (n = 158) the number of and prices for leopards poached in the reserve and the number of goats depredated by leopard. Leopards were the mainstay of the hunting industry; a single animal was worth approximately U.S.$24,000. Most safari revenues are retained at national and international levels, but poached leopard are illegally traded locally for small amounts ($83). Leopards depredated 11 goats over 2 years in 2 of 4 surveyed villages resulting in losses of $440 to 6 households. People in these households had negative attitudes toward leopards. Although leopard sport hunting generates larger gross revenues than poaching, illegal hunting provides higher economic benefits for households involved in the activity. Sport-hunting revenues did not compensate for the economic losses of livestock at the household level. On the basis of our results, we propose that poaching be reduced by increasing the costs of apprehension and that the economic benefits from leopard sport hunting be used to improve community livelihoods and provide incentives not to poach.

Fragment-based real-time object tracking: a sparse representation approach

Real-time object tracking is a critical task in many computer vision applications. Achieving rapid and robust tracking while handling changes in object pose and size, varying illumination and partial occlusion, is a challenging task given the limited amount of computational resources. In this paper we propose a real-time object tracker in l(1) framework addressing these issues. In the proposed approach, dictionaries containing templates of overlapping object fragments are created. The candidate fragments are sparsely represented in the dictionary fragment space by solving the l(1) regularized least squares problem. The non zero coefficients indicate the relative motion between the target and candidate fragments along with a fidelity measure. The final object motion is obtained by fusing the reliable motion information. The dictionary is updated based on the object likelihood map. The proposed tracking algorithm is tested on various challenging videos and found to outperform earlier approach.

Spatial Wavelet Approach to Local Matrix Crack Detection in Composite Beams with Ply Level Material Uncertainty

Wavelet coefficients based on spatial wavelets are used as damage indicators to identify the damage location as well as the size of the damage in a laminated composite beam with localized matrix cracks. A finite element model of the composite beam is used in conjunction with a matrix crack based damage model to simulate the damaged composite beam structure. The modes of vibration of the beam are analyzed using the wavelet transform in order to identify the location and the extent of the damage by sensing the local perturbations at the damage locations. The location of the damage is identified by a sudden change in spatial distribution of wavelet coefficients. Monte Carlo Simulations (MCS) are used to investigate the effect of ply level uncertainty in composite material properties such as ply longitudinal stiffness, transverse stiffness, shear modulus and Poisson's ratio on damage detection parameter, wavelet coefficient. In this study, numerical simulations are done for single and multiple damage cases. It is observed that spatial wavelets can be used as a reliable damage detection tool for composite beams with localized matrix cracks which can result from low velocity impact damage.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Partial delamination modeling in composite beams using a finite element method

A new method of modeling partial delamination in composite beams is proposed and implemented using the finite element method. Homogenized cross-sectional stiffness of the delaminated beam is obtained by the proposed analytical technique, including extension-bending, extension-twist and torsion-bending coupling terms, and hence can be used with an existing finite element method. A two noded C1 type Timoshenko beam element with 4 degrees of freedom per node for dynamic analysis of beams is implemented. The results for different delamination scenarios and beams subjected to different boundary conditions are validated with available experimental results in the literature and/or with the 3D finite element simulation using COMSOL. Results of the first torsional mode frequency for the partially delaminated beam are validated with the COMSOL results. The key point of the proposed model is that partial delamination in beams can be analyzed using a beam model, rather than using 3D or plate models. (c) 2013 Elsevier B.V. All rights reserved.

Seismic hazard analysis of Lucknow considering local and active seismic gaps

The Himalayas are one of very active seismic regions in the world where devastating earthquakes of 1803 Bihar-Nepal, 1897 Shillong, 1905 Kangra, 1934 Bihar-Nepal, 1950 Assam and 2011 Sikkim were reported. Several researchers highlighted central seismic gap based on the stress accumulation in central part of Himalaya and the non-occurrence of earthquake between 1905 Kangra and 1934 Bihar-Nepal. The region has potential of producing great seismic event in the near future. As a result of this seismic gap, all regions which fall adjacent to the active Himalayan region are under high possible seismic hazard due to future earthquakes in the Himalayan region. In this study, the study area of the Lucknow urban centre which lies within 350 km from the central seismic gap has been considered for detailed assessment of seismic hazard. The city of Lucknow also lies close to Lucknow-Faizabad fault having a seismic gap of 350 years. Considering the possible seismic gap in the Himalayan region and also the seismic gap in Lucknow-Faizabad fault, the seismic hazard of Lucknow has been studied based on deterministic and the probabilistic seismic hazard analysis. Results obtained show that the northern and western parts of Lucknow are found to have a peak ground acceleration of 0.11-0.13 g, which is 1.6- to 2.0-fold higher than the seismic hazard compared to the other parts of Lucknow.

Maximum likelihood algorithms for joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing system

Maximum likelihood (ML) algorithms, for the joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) system, are investigated in this work. A system model that takes into account the effects of carrier frequency offset, sampling frequency offset, symbol timing error and channel impulse response is formulated. Cramer-Rao lower bounds for the estimation of continuous parameters are derived, which show the coupling effect among different impairments and the significance of the joint estimation. The authors propose an ML algorithm for the estimation of synchronisation impairments and channel together, using the grid search method. To reduce the complexity of the joint grid search in the ML algorithm, a modified ML (MML) algorithm with multiple one-dimensional searches is also proposed. Further, a stage-wise ML (SML) algorithm using existing algorithms, which estimate less number of parameters, is also proposed. Performance of the estimation algorithms is studied through numerical simulations and it is found that the proposed ML and MML algorithms exhibit better performance than SML algorithm.

On the unramified principal series of GL(3) over non-archimedean local fields

Let F be a non-archimedean local field and let O be its ring of integers. We give a complete description of the irreducible constituents of the restriction of the unramified principal series representations of GL(3)(F) to GL(3)(O). (C) 2013 Elsevier Inc. All rights reserved.

Scheduling for Fading Channels Under Partial Channel Information

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughput-optimal policy for the network under QoS constraints when real-time and rate-guaranteed data traffic may be present.