This paper uses a dynamic factor model recently studied by Forni, Hallin, Lippi and Reichlin (2000) to analyze the response of 21 U.S. interest rates to news. Using daily data, we find that the news that affects interest rates daily can be summarized by two common factors. This finding is robust to both the sample period and time aggregation. Each rate has an important idiosyncratic component; ...

With the ability of recognizing tag content wirelessly within a limited distance and a short period of query time, RFID technology has been adopted and deployed on various applications. In consequence, how to effectively avoid responses collision from multiple tags and to further reduce the average query time per tag becomes an important performance issue for RFID systems. To get better perform...

In 2000, Lee and Chang proposed a user identification scheme with key distribution preserving anonymity for distributed computer networks. Recently, Wu and Hsu pointed out that there are two weaknesses in the LeeChang scheme. They further not only proposed a new scheme to remedy the security leaks of the Lee-Chang scheme, but also reduced computation complexities and communication cost as compa...

In this paper, two new identification schemes based on VSS theory and sliding mode are developed to address the time-varying parameter identification problems. The proposed direct identification scheme can successfully estimate fast time-varying parameters when the process is linear in the parametric space. The proposed indirect identification scheme further exploits the possibility of estimati...

The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity another verifier) without revealing the secret key verifier. can apply Fiat–Shamir transformation convert an scheme into signature which be used for achieving security purposes and cryptographic purposes, especially authentication. In this paper, we recall protocol, namely RankID sc...

A high-dimensional regression space usually causes problems in nonlinear system identification. However, if the regression data are contained in (or spread tightly around) some manifold, the dimensionality can be reduced. This paper presents a use of dimension reduction techniques to compose a two-step identification scheme suitable for high-dimensional identification problems with manifold-val...

In this paper we introduce a new location identification scheme based on the idea of Gray codes. The new scheme is particularly useful for applications which do have to cope with some level of inaccuracy or uncertainty. The applicability of the scheme is shown with some examples from the security domain, however is not restricted to this domain.

In this article, we propose an identification scheme which is based on the two combinatorial problems Multivariate Quadratic equations (MQ) and Isomorphism of Polynomials (IP). We show that this scheme is statistical zero-knowledge. Using a trapdoor for the MQ-problem, it is possible to make it also identity-based, i.e., there is no need for distributing public keys or for certificates within t...

By an indirect control approach, an adaptive pole-placement control problem is considered for a scalar discrete-time linear plant assuming the knowledge of an upper bound of the plant order. A class of models that can be regarded IO be input-output equivalent to the plant is first constructed based on the parrrneter estimate generated by a least-squares-type identification scheme. A minimizatio...

In this work, we study simultaneously resettable arguments of knowledge. As our main result, we show a construction of a constantround simultaneously resettable witness-indistinguishable argument of knowledge (simresWIAoK, for short) for any NP language. We also show two applications of simresWIAoK: the first constant-round simultaneously resettable zero-knowledge argument of knowledge in the B...