Explore the vast range of titles available.

Integrated water resources management is important, especially in watersheds where substantial interactions exist between the ground and surface water sources. This management warrants the need for reliable estimates of both an overall basin water budget and hydrologic fluctuations between ground water and surface water sources. The objectives of this study were to estimate the total water budget and to simulate the effects of the management of water in the Big Lost River Basin in Idaho. The study used the FIPR Hydrological Model (FHM), a hydrological model developed by the University of South Florida for the Florida Institute of Phosphate Research (FIPR). The FHM is an integrated model that simulates the full water budget of the surface and ground water systems. It has two public domain components: Hydrological Simulation Program - FORTRAN (HSPF) and Modular Three-Dimensional Finite-Difference Ground Water Flow Model (MODFLOW). This study quantified the hydrologic fluxes between ground water and surface water and determined a comprehensive and accurate water budget for the Big Lost River. The study showed an annual amount of 10.44 m3/sec leaves the basin and never to return to the system. The study is useful in developing and calculating the annual water budget in the Big Lost River, and this process should be applicable to estimating water budgets in other basins.

This paper considers messages protected with the Message Authentication Code (MAC) for the sake of authenticity. The standard forward error correcting channel code is assumed, which reduces the error rate, but no repeat mechanism exists to correct the remaining errors. The uncorrected errors cause the rejection of messages with a wrong MAC, as a successful MAC verification (“hard” verification) demands errorless message and errorless MAC. This paper introduces the extension of “hard” verification of MACs, whose result is “true” or “false”, to “soft” verification, that outputs additionally a trust level as verification result. This allows the acceptance of corrected messages and their MACs, even if a few bits of the MAC are different from the expected value. The costs are a loss of trust, as trust is defined for the successful standard or “hard” verification, i.e. for errorless message and its MAC. Therefore “Trust Output” is accompanied with the output of the verification process. A definition of “Trust Level” will be given, together with an algorithm of “soft” verification, which provides such Trust Output. This algorithm is based on a Soft Output channel decoder, which provides a reliability value for each bit, which is used as soft input for the proposed algorithm, “Soft Input Trust Output”. Simulation results show an essential improvement of the acceptance rate of MACs - at the cost of a reduced trust level. The reduction can be calculated and the maximum permitted reduction of the trust level can be preset.

Abstract Previous studies have traced important parallels between biblical and Iranian and Indic traditions. As opposed to the meticulous philological work invested in the field of ancient near eastern parallels, however, the Indic and Iranian parallels to the Bible were often invoked in a very general manner and no attempt was made to locate these parallels textually through careful philological investigation. The article demonstrates that, later additions to the priestly strata of the Pentateuch can be significantly illuminated by exploring Indic and Zoroastrian parallels. Through a close examination of Numbers 31:19-24 and its parallels from the Indic and Iranian literatures, the study surmises that particularly the late additions in the biblical text bear resemblance and are connected to the Indic and Iranian traditions. Following an internal analysis of the biblical text, which presents exegetic difficulties that indicate the existence of later interpolations in the text, the study examines Zoroastrian and Hindu parallels relevant to the biblical passage. The light shed by these parallels greatly aids in solving the difficulties and discrepancies inherent in the biblical text.

An efficient lossless coding technique is very important for storage and transmission applications of error sensitive information such as medical, seismic and digital artistic data. In this study, the authors proposed an H.264-based advance video coding (H.264/AVC)-based hierarchical lossless coding method, where the input video will be firstly encoded by H.264/AVC coder with a quantisation parameter (QP) selector in the base layer and the coded error is encoded by a QP-adaptive Rice coder in the enhancement layer. To reduce encoding time, the QP selector can be simplified to select the nearly optimal QP. Simulation results show that the proposed hierarchical lossless coding architecture achieves better compression ratio than the traditional H.264/AVC-based lossless coding systems. Since the proposed system could provide both lossy and lossless coding services at the same time, the proposed lossless video coding system has advantages of efficiency and flexibility for practical applications. Experimental results show that the proposed coding system can provide less coding bits and reduce coding complexity compare with H.264-differential pulse code modulation.

This chapter introduces and analyses the concept of urgent interviews, and considers the subsequent use of such interviews in later court proceedings. It also considers the recent challenges to the admissibility of urgent interviews by the defence. In light of the case law, Code H recognizes that because urgent interviews are conducted only in exceptional circumstances, namely where public safety considerations apply and where those considerations are such as to justify denial of the normal right of access to a solicitor, the ramifications of such interviews must differ from the general regime applicable to non‐urgent interviews. Oppression in terrorist cases, as defined by section 76 of Police and Criminal Evidence Act 1984 and the authorities that interpret that section, carries no additional meaning merely because the interview in question is urgent and/or is conducted without the presence of a solicitor.

In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position P of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set R P . The codes in the class that we define have availability, meaning that for each position P there are several distinct recovery sets. Also, the entry at position P may be recovered even in the presence of erasures in some of the positions of the recovery sets, and the number of supported erasures may vary among the various recovery sets.

Hydrogen peroxide (H₂O₂) is produced, via superoxide and superoxide dismutase, by electron transport in chloroplasts and mitochondria, plasma membrane NADPH oxidases, peroxisomal oxidases, type III peroxidases and other apoplastic oxidases. Intracellular transport is facilitated by aquaporins and H₂O₂ is removed by catalase, peroxiredoxin, glutathione peroxidase-like enzymes and ascorbate peroxidase, all of which have cell compartment-specific isoforms. Apoplastic H₂O₂ influences cell expansion, development and defence by its involvement in type III peroxidase-mediated polymer cross-linking, lignification and, possibly, cell expansion via H₂O₂-derived hydroxyl radicals. Excess H₂O₂ triggers chloroplast and peroxisome autophagy and programmed cell death. The role of H₂O₂ in signalling, for example during acclimation to stress and pathogen defence, has received much attention, but the signal transduction mechanisms are poorly defined. H₂O₂ oxidizes specific cysteine residues of target proteins to the sulfenic acid form and, similar to other organisms, this modification could initiate thiol-based redox relays and modify target enzymes, receptor kinases and transcription factors. Quantification of the sources and sinks of H₂O₂ is being improved by the spatial and temporal resolution of genetically encoded H₂O₂ sensors, such as HyPer and roGFP2-Orp1. These H₂O₂ sensors, combined with the detection of specific proteins modified by H₂O₂, will allow a deeper understanding of its signalling roles.

This work aims to algebraically describe the relative generalized Hamming weights of evaluation codes. We give a lower bound for these weights in terms of a footprint bound, and prove that this bound can be sharp. We compute the next-to-minimal weight of toric codes over hypersimplices of degree 1.