This paper focuses on the S-parameter method that is a basic method for measuring the input impedance of balanced-fed antennas. The basic concept of the method is summarized using the two-port network, and it is shown that the method can be enhanced to the unbalanced antennas using a formulation based on incident and reflected waves. The compensation method that eliminates the influence of a me...

A class of random hazard rates, that is defined as a mixture of an indicator kernel convoluted with a completely random measure, is of interest. We provide an explicit characterization of the posterior distribution of this mixture hazard rate model via a finite mixture of S-paths. A closed and tractable Bayes estimator for the hazard rate is derived to be a finite sum over S-paths. The path cha...

We introduce some applications of Stein's method in the high temperature analysis of spin glasses. Stein's method allows the direct analysis of the Gibbs measure without having to create a cavity. Another advantage is that it gives limit theorems with total variation error bounds, although the bounds can be suboptimal. A surprising byproduct of our analysis is a relatively transparent explanati...

Motohashi [8] showed that the intuitionistic predicate logics can be faithfully embedded in the classical predicate logic by a proof-theoretic method. In the present paper, we show that Motohashi’s method can be applied to a wide range of modal logics. We prove correspondence theorems based on the standard translation between classical predicate logic and the quantified versions of S4 and S5 an...

Solving the elliptic curve discrete logarithm problem (ECDLP) by using Gröbner basis has recently appeared as a new threat to the security of elliptic curve cryptography and pairing-based cryptosystems. At Eurocrypt 2012, Faugère, Perret, Petit and Renault proposed a new method using a multivariable polynomial system to solve ECDLP over finite fields of characteristic 2. At Asiacrypt 2012, Peti...

The implementation on vector computers of the QR algorithm and of iterative schemes based on obtaining the determinant and its derivatives by Hyman's method are presented. It is shown that iterative schemes based on Hyman's method will probably be more efficient than the QR algorithm on vector computers for large matrices. A theoretical comparison of the Laguerre iterative scheme with the QR al...

A method for high-level synthesis with testability is presented with the objective to generate self-testable RTL datapath structures. We base our approach on a new improved testabilitymodel that generates various testable design styles while reducing the circuit sequential depth from controllable to observable registers. We follow the allocation method with an automatic test point selection alg...

Here for some natural number n, each gi ∈ C{x 1 n } with gi(0) = 0, and u(x, y) ∈ C{x 1 n , y 1 n } with u(0, 0) 6= 0. Hence the zeroes of f(x, y) are parameterized by analytic functions of one variable. (With a little more effort one can show u(x, y) ∈ C{x, y}). In the case where f is real-valued, an argument for proving a version of (1) goes back to Isaac Newton himself, as described in a 167...

s