A Savitzky–Golay filtering for smoothing and peak search written in Python is presented in this paper alongside its applications in the list-mode digital data acquisition dual gamma–gamma coincidence bismuth germanate (BGO) detector. The study has demonstrated that the software provides a reliable and effective way to quantify trace amounts of 22Na and 7Be in aerosol samples collected at Resolute Bay, Canada with a critical limit of 3 mBq and 5 Bq respectively for a 20 h counting interval, which are believed to be the inherent limitations of the dual-BGO system.
Tetrahydrotetrazoles are five‐membered‐ring heterocycles containing four contiguous saturated nitrogen atoms. Very few examples of such compounds have been reported in the literature. Our previous attempt at the synthesis of a member of this class of compound suggested that the N—N bonds may be more labile than expected. This finding raised the question as to whether the structures of any of the previously reported tetrahydrotetrazoles had been properly assigned. We have reproduced the synthesis of a reported tetrahydrotetrazole, namely 1,2‐di‐tert‐butyl 3‐phenyl‐1H,2H,3H,10bH‐[1,2,3,4]tetrazolo[5,1‐a]isoquinoline‐1,2‐dicarboxylate, C25H30N4O4, and have now confidently confirmed its structure via X‐ray crystallography. However, while sufficiently stable in the crystal phase, we discovered that it remains very labile in solution (having a half‐life of only 15 min at 20 °C in CDCl3). A tentative reaction pathway for its dissociation based on 1H NMR spectral evidence is provided. 相似文献
An A-loop is a loop in which every inner mapping is an automorphism. A problem which had been open since 1956 is settled by showing that every diassociative A-loop is Moufang.
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
Modal solutions of planar photonic crystal waveguides with rectangular air-holes are presented by using a rigorous full-vectorial finite element-based approach. The effective indices, mode field profiles, spot-sizes, power confinements, modal hybridness, beat lengths and group velocity dispersions are shown for the fundamental and higher order modes of the quasi-TE and TM polarizations. 相似文献
If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time. 相似文献