A kinetic method for the determination of nanogram amounts of cadmium (II) by its catalytic effect on the complex formation of manganese(II) withα,β,γ,δ-tetra-(p-sulf onatophenyl) porphine

Summary Cadmium(II) accelerates the complex formation reaction of manganese (II) with, , , -tetra(p-sulfonatophenyl)porphine (H₂TPPS₄). Cadmium(II) concentration as low as 10^–7 mol dm^–3 can be determined from the decrease in absorbance at 413 nm (_max of H₂TPPS₄) at a fixed time after the start of the reaction of manganese(II) with H₂TPPS₄. After the separation of lead(II) by coprecipitation of manganese(IV) oxide, the method is highly selective and is free from interference of most substances usually encountered. Sandell's sensitivity calculated from the calibration curve at 30 min after the start of the reaction is 1.43×10^–1 ng cm^–2.

---

Eine kinetische Methode zur Bestimmung von Nanogrammengen von Cadmium(II) mit Hilfe seines katalytischen Effekts bei der Komplexbildung von Mangan(II) mit , , , -Tetra-(p-sulfonatophenyl)-porphin

Zusammenfassung Cadmium (II) beschleunigt die Komplexbildung von Mangan (II) mit, , , -Tetra-(p-sulfonatophenyl)-porphin (H₂TPPS₄). Konzentrationen bis zu 10^–7 Mol/l können durch Messung des Rückganges der Absorbanz bei 413 nm (_max von H₂TPPS₄) nach einer bestimmten Zeit gemessen werden. Nach Abtrennung von Blei(II) durch Mitfällung mit Mangan (IV)oxid ist die Methode sehr selektiv und frei von Störungen durch die meisten üblicherweise vorliegenden Substanzen. Die Empfindlichkeit nach Sandell, ermittelt aus der Eichkurve 30 min nach dem Start der Reaktion, beträgt 1,43×10^–1 ng/cm².

     

Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44,22,8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.     

Optimality of the double exponential formula – functional analysis approach –

Summary. In the light of the functional analysis theory we establish the optimality of the double exponential formula. The argument consists of the following three ingredients: (1) introduction of a number of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity; (2) proof of the (near-) optimality of the trapezoidal formula in each space introduced in (1) by showing the (near-) equality between an upper estimate for the error norm of the trapezoidal formula and a lower estimate for the minimum error norm of quadratures; (3) nonexistence theorem for the spaces, the characterizing decay rate of which is more rapid than the double exponential. Received September 15, 1995 / Accepted December 14, 1995     

DE-Sinc methods have almost the same convergence property as SE-Sinc methods even for a family of functions fitting the SE-Sinc methods

In this paper, the theoretical convergence rate of the trapezoidal rule combined with the double-exponential (DE) transformation is given for a class of functions for which the single-exponential (SE) transformation is suitable. It is well known that the DE transformation enables the rule to achieve a much higher rate of convergence than the SE transformation, and the convergence rate has been analyzed and justified theoretically under a proper assumption. Here, it should be emphasized that the assumption is more severe than the one for the SE transformation, and there actually exist some examples such that the trapezoidal rule with the SE transformation achieves its usual rate, whereas the rule with DE does not. Such cases have been observed numerically, but no theoretical analysis has been given thus far. This paper reveals the theoretical rate of convergence in such cases, and it turns out that the DE’s rate is almost the same as, but slightly lower than that of the SE. By using the analysis technique developed here, the theoretical convergence rate of the Sinc approximation with the DE transformation is also given for a class of functions for which the SE transformation is suitable. The result is quite similar to above; the convergence rate in the DE case is slightly lower than in the SE case. Numerical examples which support those two theoretical results are also given.     

A complete classification of ternary self-dual codes of length 24

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the classification of 24-dimensional odd unimodular lattices.     

The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic. In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes whose minimum distances agree with the designed ones.     

Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56

In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic self-orthogonal 3-(56,12,65) designs. AMS Classification: 94B05, 05B05     

On the classification of weighing matrices and self‐orthogonal codes

We provide a classification method of weighing matrices based on a classification of self‐orthogonal codes. Using this method, we classify weighing matrices of orders up to 15 and order 17, by revising some known classification. In addition, we give a revised classification of weighing matrices of weight 5. A revised classification of ternary maximal self‐orthogonal codes of lengths 18 and 19 is also presented. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:40–57, 2012     

Central limit theorems for realized volatility under hitting times of an irregular grid

We consider a continuous semi-martingale sampled at hitting times of an irregular grid. The goal of this work is to analyze the asymptotic behavior of the realized volatility under this rather natural observation scheme. This framework strongly differs from the well understood situations when the sampling times are deterministic or when the grid is regular. Indeed, neither Gaussian approximations nor symmetry properties can be used. In this setting, as the distance between two consecutive barriers tends to zero, we establish central limit theorems for the normalized error of the realized volatility. In particular, we show that there is no bias in the limiting process.