Hydro-mechanical characterization of Barmer 1 bentonite from Rajasthan, India

The conceptual model for deep geological disposal of high level nuclear waste (HLW) is based on multiple barrier system consisting of natural and engineered barriers. Buffer/backfill material is regarded as the most important engineered barrier in HLW repositories. Due to large swelling ability, cation adsorption capacity, and low permeability bentonite is considered as suitable buffer material in HLW repositories. Japan has identified Kunigel VI bentonite, South Korea - Kyungju bentonite, China - GMZ bentonite, Belgium - FoCa clay, Sweden - MX-80 bentonite, Spain - FEBEX bentonite and Canada - Avonseal bentonite as candidate bentonite buffer for deep geological repository program. An earlier study on Indian bentonites by one of the authors suggested that bentonite from Barmer district of Rajasthan (termed Barmer 1 bentonite), India is suited for use as buffer material in deep geological repositories. However, the hydro-mechanical properties of the Barmer 1 bentonite are unavailable. This paper characterizes Barmer 1 bentonite for hydro-mechanical properties, such as, swell pressure, saturated permeability, soil water characteristic curve (SWCC) and unconfined compression strength at different dry densities. The properties of Barmer 1 bentonite were compared with bentonite buffers reported in literature and equations for designing swell pressure and saturated permeability coefficient of bentonite buffers were arrived at. (C) 2013 Elsevier B.V. All rights reserved.

Spectrum sensing using distributed sequential detection via noisy reporting MAC

This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. (C) 2014 Elsevier B.V. All rights reserved.

Secure Compute-and-Forward in a Bidirectional Relay

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple-access channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user's message be kept secure from the relay. We consider two types of security constraints: 1) perfect secrecy, in which the MAC channel output seen by the relay is independent of each user's message and 2) strong secrecy, which is a form of asymptotic independence. We propose a coding scheme based on nested lattices, the main feature of which is that given a pair of nested lattices that satisfy certain goodness properties, we can explicitly specify probability distributions for randomization at the encoders to achieve the desired security criteria. In particular, our coding scheme guarantees perfect or strong secrecy even in the absence of channel noise. The noise in the channel only affects reliability of computation at the relay, and for Gaussian noise, we derive achievable rates for reliable and secure computation. We also present an application of our methods to the multihop line network in which a source needs to transmit messages to a destination through a series of intermediate relays.

Distributed Nonparametric Sequential Spectrum Sensing under Electromagnetic Interference

We propose a distributed sequential algorithm for quick detection of spectral holes in a Cognitive Radio set up. Two or more local nodes make decisions and inform the fusion centre (FC) over a reporting Multiple Access Channel (MAC), which then makes the final decision. The local nodes use energy detection and the FC uses mean detection in the presence of fading, heavy-tailed electromagnetic interference (EMI) and outliers. The statistics of the primary signal, channel gain and the EMI is not known. Different nonparametric sequential algorithms are compared to choose appropriate algorithms to be used at the local nodes and the Fe. Modification of a recently developed random walk test is selected for the local nodes for energy detection as well as at the fusion centre for mean detection. We show via simulations and analysis that the nonparametric distributed algorithm developed performs well in the presence of fading, EMI and outliers. The algorithm is iterative in nature making the computation and storage requirements minimal.

Wireless Network-Coded Accumulate-Compute-and-Forward Two-Way Relaying

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.

Fishing capacity management

Excess fishing capacity has been identified as one of the most pernicious problems affecting long-term sustainability and biodiversity of fishery resources and economic viability of fishing operations. Significant economic gains could be achieved by eliminating excess capacity, in addition to attaining objectives of resource sustainability. In this paper, approaches to fishing capacity management are reviewed in the context of Indian fisheries. A rights based regulated access system under a co-management regime based on a strong inclusive cooperative movement of stakeholders with built-in transferable quota system and buy-back or rotational right of entry schemes seems to hold potential for capacity management in the shelf fisheries of Indian states, which need to be implemented in collaboration with the Union Government and the neighboring states with confluent ecosystems and shared fishing grounds. A key advantage of the use of rights based approaches for managing fishing capacity is that they provide a mechanism through which stakeholders can more easily and actively participate in the management process.

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Significant improvements in optical power budgets of real-time optical OFDM PON systems.

Based on a comprehensive theoretical optical orthogonal frequency division multiplexing (OOFDM) system model rigorously verified by comparing numerical results with end-to-end real-time experimental measurements at 11.25Gb/s, detailed explorations are undertaken, for the first time, of the impacts of various physical factors on the OOFDM system performance over directly modulated DFB laser (DML)-based, intensity modulation and direct detection (IMDD), single-mode fibre (SMF) systems without in-line optical amplification and chromatic dispersion compensation. It is shown that the low extinction ratio (ER) of the DML modulated OOFDM signal is the predominant factor limiting the maximum achievable optical power budget, and the subcarrier intermixing effect associated with square-law photon detection in the receiver reduces the optical power budget by at least 1dB. Results also indicate that, immediately after the DML in the transmitter, the insertion of a 0.02nm bandwidth optical Gaussian bandpass filter with a 0.01nm wavelength offset with respect to the optical carrier wavelength can enhance the OOFDM signal ER by approximately 1.24dB, thus resulting in a 7dB optical power budget improvement at a total channel BER of 1 × 10(-3).

Single mode operation of a Fabry-Perot laser locked by a tunable laser

In this article, the single mode operation of a Fabry-Perot laser (FP-LD) subject to the optical injection from a tunable laser is investigated. The maximum side mode suppression ratio (SMSR) is 53 dB, and the locked wavelength range is about 46 nm, which can cover 58 International Telecommunication Union (ITU) wavelengths with 100 GHz spacing or 115 ITU wavelengths with 50 GHz spacing for wavelength division multiplexing (WDM) system. In the wavelength range front 1535 to 1569 nm, the SMSR is over 46 dB, and the frequency response of the injection-locked FP-LD can be improved with the proper wavelength detuning. (c) 2008 Wiley Periodicals, Inc.

Tolerance analysis for incident angle of volume phase holographic grating used in optical channel performance monitor

Transmission Volume Phase Holographic Grating (VPHG) is adopted as spectral element in the real-time Optical Channel Performance Monitor (OCPM), which is in dire need in the Dense Wavelength -division-multiplexing(DATDM) system. And the tolerance of incident angle, which can be fully determined by two angles: 6 and (p, is finally inferred in this paper. Commonly, the default setting is that the incident plane is perpendicular to the fringes when the incident angle is mentioned. Now the situation out of the vertical is discussed. By combining the theoretic analysis of VPHG with its use in OCPM and changing 6 and (0 precisely in the computation and experiment, the two physical quantities which can fully specify the performance of VPHG the diffraction efficiency and the resolution, are analyzed. The results show that the diffraction efficiency varies greatly with the change of 6 or (p. But from the view of the whole C-band, only the peak diffraction efficiency drifts to another wavelength. As for the resolution, it deteriorates more rapidly than diffraction efficiency with the change of (p, while more slowly with the change of theta. Only if \phi\less than or equal to+/-1degrees and alpha(B) -0.5 less than or equal to theta less than or equal to alpha(B) + 0.5, the performance of the VPHG would be good enough to be used in OCPM system.

Strained MQW electro-absorption modulators with high extinction ratio and low capacitance

We fabricate an electro-absorption modulator for optical network system using a new strategy, the improved modulation properties of the strained InGaAs/InAlAs MQW show it's polarization independent, high extinction ratio (> 40dB) and low capacitance (C <0.6pF) which can achieve an ultra-high frequency(> 10GHz). The device is be used in 10Gbps optical time division multiplex (OTDM) system as a signal generator.

容错控制系统的一类新型阵列码技术

随着现代化生产的不断发展,控制系统变得日渐复杂,出现各类故障的可能性也随之增大.为了解决控制系统复杂化引起系统安全性减低的问题,人们将编码技术作为一种软件冗余技术应用于控制系统,由于控制系统具有强实时性的要求,因此阵列码技术成为主流技术.阵列码技术虽然具有纠错时间短的优点,但是纠错能力有限,一般只能纠正一到两个磁盘错误.针对上述不足提出一种能够在三个磁盘同时发生错误的条件下有效恢复数据的新型阵列码-扩展X码,给出编译码算法,并将其应用于火箭控制系统的容错.

基于Agent的分布式多机器人系统建模及分析

进行一个多装配机器人系统 DAMAS的模型研究 ,介绍离散事件动态系统的重要建模工具 Petri网 ,提出解决模型复杂性的有效方法 ,建立了系统中各个 Agent及整个系统的 Petri网模型 ,对这些模型及相互间的交互模型进行了重要的活性和有界性分析 ,对多机器人系统的协作机制进行了验证分析。

多水下机器人系统水动力计算的多线程实现

介绍多水下机器人(UUV)数字仿真平台的硬件结构以及单体UUV和多UUV系统的水动力计算流程,在此基础上利用Windows多线程技术实现多UUV的水动力计算,该方法已经用于多UUV数字仿真平台虚拟环境节点的设计中。系统仿真实验表明该方法设计的应用程序具有良好的执行效率和实时响应能力,为以后多UUV半物理仿真平台的水动力计算和实体多UUV系统水动力系数的验证奠定了基础。

基于时延Petri网的多UUV系统的任务分配策略

针对多水下机器人(unmanned underwater vehicle,UUV)系统动态任务分配问题展开研究,在对系统的体系结构和任务分配机制进行分析的基础上,利用时延 Petri 网理论对系统的任务分配进行建模,提出了一种新的任务分配策略:群体协调层采用集中式任务分配策略,由主 UUV 将任务实时下达给各从 UUV;监控规划层采用基于适应度的分布式任务分配方式,充分发挥各异构 UUV 自身的智能。仿真结果验证了模型的合理性和任务分配策略的有效性。