The application of almond shell as a low cost natural adsorbent to remove Hg(2+) from aqueous solution was investigated. Batch experiments were carried out to evaluate the adsorption capacity of the material. The chemical and physical parameters such as pH, sorbent amount, initial ion concentration, and contact time were optimized for the maximum uptake of mercury onto the solid surface. Adsorption isotherms were expressed by Langmuir and Freundlich adsorption models, and the experimental data were found to fit the Langmuir model rather than the Freundlich. The maximum adsorption capacity obtained from the Langmuir isotherm was 135.13 mg/g. A kinetic study was carried out with pseudo-first-order and pseudo-second-order reaction equations and it was found that the Hg(2+) uptake process followed the pseudo-second-order rate expression. The thermodynamic values, ΔG(0), ΔH(0) and ΔS(0), indicated that adsorption was an endothermic and spontaneous process. The potential of this material for mercury elimination was demonstrated by efficient Hg(2+) removal from a synthetic effluent.
In this paper, an extended large wireless network under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI.Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named stochastic virtual beamforming, is proposed. Applying this scheme, an unbounded secure rate with any desired outage level is achieved, provided that the density of the legitimate users tends to infinity. In addition, by tending the legitimate users density to the infinity, the tolerable density of eavesdroppers will become unbounded too.
The main security service in the connected world of cyber physical systems necessitates to authenticate a large number of nodes privately. In this paper, the private authentication problem is considered, that consists of a certificate authority, a verifier, many legitimate users (prover) and any arbitrary number of illegitimate users. Each legitimate user wants to be authenticated (using his personal key) by the verifier, while simultaneously wants to stay completely anonymous (even to the verifier and the CA). On the other hand, an illegitimate user must fail to authenticate himself. We analyze this problem from an information theoretical perspective. First, we propose a general interactive information-theoretic model for the problem. As a metric to measure the reliability, we consider the authentication key rate whose rate maximization has a trade-off with establishing privacy. Then, we analyze the problem in two different regimes: finite size regime (i.e., the variables are elements of a finite field) and asymptotic regime (i.e., the variables are considered to have large enough length). For both regimes, we propose schemes that satisfy the completeness, soundness and privacy properties. In finite size regime, the idea is to generate the authentication keys according to a secret sharing scheme. In asymptotic regime, we use a random binning based scheme which relies on the joint typicality to generate the authentication keys. Moreover, providing the converse proof, we show that our scheme achieves capacity in the asymptotic regime. For finite size regime our scheme achieves capacity for large field size.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.