A Generalized Multistep Dynamic (GMD) TOPMODEL

There is a lack of Ordinary Differential Equation (ODE) formulations in numerical hydrology, contributing to the lack of application of canned adaptive timestep solvers; hence the continued dominance of fixed (e.g., Euler) timestep techniques despite their fundamental problems. In this paper, we reformulate Dynamic-TOPMODEL into a constraint-handling ODE form and use MATLAB's advanced adaptive ODE-solvers to solve the resulting system of equations. For wider applicability, but based on existing research and/or first principles, we developed Generalized Multistep Dynamic TOPMODEL which includes: iso-basin spatial discretization, diffusion wave routing, depth-dependent overland flow velocity, relaxing the assumption of water-table parallelism to the ground surface, a power-law hydraulic conductivity profile, new unsaturated zone flux, and a reference frame adjustment. To demonstrate the model we calibrate it to a peat catchment case study, for which we also test sensitivity to spatial discretization. Our results suggest that (a) a five-fold improvement in model runtime can result from adaptive timestepping; (b) the additional iso-basin discretization layer, as a way to further constrain spatial information where needed, also improves performance; and (c) the common-practice arbitrary Topographic Index (TI) discretization substantially alters calibrated parameters. More objective and physically constrained (e.g., top-down) approaches to TI classification may be needed

2D Qubit Placement of Quantum Circuits using LONGPATH

In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but implementation involves realization of quantum circuits through physical synthesis of quantum gates. This requires decomposition of complex quantum gates into a cascade of simple one qubit and two qubit gates. The methodological framework for physical synthesis imposes a constraint regarding placement of operands (qubits) and operators. If physical qubits can be placed on a grid, where each node of the grid represents a qubit then quantum gates can only be operated on adjacent qubits, otherwise SWAP gates must be inserted to convert non-Linear Nearest Neighbor architecture to Linear Nearest Neighbor architecture. Insertion of SWAP gates should be made optimal to reduce cumulative cost of physical implementation. A schedule layout generation is required for placement and routing apriori to actual implementation. In this paper, two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit. The first algorithm is intended to start with generation of an interaction graph followed by finding the longest path starting from the node with maximum degree. The second algorithm optimizes the number of SWAP gates between any pair of non-neighbouring qubits. Our proposed approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.Comment: Advanced Computing and Systems for Security, SpringerLink, Volume 1

Mupirocin resistance in Staphylococcus aureus: A systematic review and meta-analysis

Objectives: Staphylococcus aureus is one of the most common pathogens causing nosocomial and community-acquired infections associated with high morbidity and mortality. Mupirocin has been increasingly used for treatment of methicillin-susceptible S. aureus (MSSA) and methicillin-resistant S. aureus (MRSA) infections. The aim of this study was to determine the prevalence of mupirocin-resistant S. aureus (MuRSA), mupirocin-resistant MRSA (MuRMRSA), high-level MuRSA (HLMuRSA) and high-level MuRMRSA (HLMuRMRSA) worldwide. Methods: Online databases including Medline, Embase and Web of Science were searched (2000�2018) to identify studies addressing the prevalence of MuRSA, MuRMRSA, HLMuRSA and HLMuRMRSA. STATA v. software was used to interpret the data. Results: Of the 2243 records identified from the databases, 30 and 63 studies fulfilled the eligibility criteria for MuRSA and MuRMRSA, respectively. Finally, 27 and 60 studies were included separately for HLMuRSA and HLMuRMRSA, respectively. The analyses revealed pooled and averaged prevalences of MuRSA, MuRMRSA, HLMuRSA and HLMuRMRSA of 7.6 95% confidence interval (CI) 6.2�9.0%, 13.8% (95% CI 12.0�15.6%), 8.5% (95% CI 6.3�10.7%) and 8.1% (95% CI 6.8�9.4%), respectively. Conclusion: Overall, these results show a global increase in the prevalence of HLMuRSA and HLMuRMRSA among clinical S. aureus isolates over time. However, there was only a significant increase in the prevalence of MuRMRSA compared with the other categories, especially MuRSA. Since mupirocin remains the most effective antibiotic for MSSA and MRSA decolonisation both in patients and healthcare personnel, a reduction of its effectiveness presents a risk for invasive infection. Monitoring of mupirocin resistance development remains critical. © 2019 International Society for Antimicrobial Chemotherap

Solid-state laser system for laser cooling of Sodium

We demonstrate a frequency-stabilized, all-solid laser source at 589 nm with up to 800 mW output power. The laser relies on sum-frequency generation from two laser sources at 1064 nm and 1319 nm through a PPKTP crystal in a doubly-resonant cavity. We obtain conversion efficiency as high as 2 W/W^2 after optimization of the cavity parameters. The output wavelength is tunable over 60 GHz, which is sufficient to lock on the Sodium D2 line. The robustness, beam quality, spectral narrowness and tunability of our source make it an alternative to dye lasers for atomic physics experiments with Sodium atoms

Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations

The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on iterations of shift-invariant quadratic permutations and linear diffusions. Owing to the selected quadratic permutations, all of our Sboxes enable uniform 3-share threshold implementations, which provide first order SCA protections without any fresh randomness. More importantly, because of the shift-invariant property, there are ample implementation trade-offs available, in software as well as hardware. We provide implementation results (software and hardware) for a four-bit and an eight-bit Sbox, which confirm that our constructions are competitive and can be easily adapted to various platforms as claimed. We have successfully verified their resistance to first order attacks based on real acquisitions. Because there are very few studies focusing on software-based threshold implementations, our software implementations might be of independent interest in this regard

Global genotype distribution of human clinical isolates of New Delhi metallo-β-lactamase-producing Klebsiella pneumoniae; A systematic review

Background and Aim: The global rise of antimicrobial resistance among bacterial strains is a rapidly growing challenge and is becoming a major public health concern. This study documents the worldwide spread and genotype distribution of human clinical isolates of New Delhi metallo-β-lactamase-producing Klebsiella pneumoniae (NPKP). Methods: Several international databases, including Web of Science, Embase and Medline were searched (2010 - 2019) to identify studies addressing the frequency of NPKP regionally or worldwide. Results: Of 4779 articles identified, 202 studies fulfilled the eligibility criteria and were included in our analysis. The frequency of NPKP in Asia, Europe, America, Africa and Oceania was 64.6, 20.1, 9.0, 5.6 and 0.4, respectively. The most prevalent sequence types (STs) among NPKP were ST11, ST290, ST147, ST340, ST15, ST278 and ST14 based on published studies. Conclusion: The dissemination of blaNDM variants in different STs among NPKP in the various region of world is a serious concern to public health. The prevalence of NPKP should be controlled by comprehensive infection control measures and optimization of antibiotic therapy. © 202

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our approach is fully automatic and exploits cut enumeration algorithms to explore optimization potentials in local subcircuits. The experimental results show that our approach can reduce the number of AND gates by 34% on average compared to generic size optimization algorithms. Further, we are able to reduce the number of AND gates up to 76% in best-known benchmarks from the cryptography community

Revisiting a Masked Lookup-Table Compression Scheme

Lookup-table based side-channel countermeasure is the prime choice for masked S-box software implementations at very low orders. To mask an $n$-bit to $m$-bit S-box at first- and second- orders, one requires a temporary table in RAM of size $m 2^n$ bits. Recently, Vadnala (CT-RSA 2017) suggested masked table compression schemes at first- and second-orders to reduce the table size by (approximately) a factor of $2^l$, where $l$ is a parameter. Though greater compression results in a greater execution time, these proposals would still be attractive for highly resource constrained devices. In this work, we contradict the second-order security claim of the second-order table compression scheme by Vadnala. We do this by exhibiting several pairs of intermediate variables that jointly depend on the bits of the secret. Motivated by the fact that randomness is also a costly resource for highly resource constrained devices, we then propose a variant of the first-order table compression scheme of Vadnala that has the new randomness complexity of about $l$ instead of $2^l$ for the original proposal. We achieve this without inducing any noticeable difference in the overall execution time or memory requirement of the original scheme. Finally, we show that the randomness complexity of $l$ is optimal in an algebraic sense