نتایج جستجو برای: identification scheme
تعداد نتایج: 625502 فیلتر نتایج به سال:
The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the...
We present two zero-knowledge protocols for the code-based McEliece public key encryption scheme in the standard model. Consider a prover who encrypted a plaintext m into a ciphertext c under the public key pk. The first protocol is a proof of plaintext knowledge (PPK), where the prover convinces a polynomially bounded verifier on a joint input (c, pk) that he knows m without actually revealing...
Gait identification is a valuable approach to identify humans at a distance. In this paper, gait characteristics are analyzed based on an iPhone's accelerometer and gyrometer,and a new approach is proposed for gait identification. Specifically, gait datasets are collected by the triaxial accelerometer and gyrometer embedded in an iPhone. Then, the datasets are processed to extract gait characte...
The Internet of Things allows things in the world to be connected to each other and enables them to automate daily tasks without human intervention, eventually building smart spaces. This article demonstrates a prototype service based on the Internet of Things, TTEO (Things Talk to Each Other). We present the full details on the system architecture and the software platforms for IoT servers and...
In this paper we propose a strategy for fault detection and isolation without any fixed model of the system to be supervised. The proposed approach is based on the identification of the parameters characterizing the system without any a priori knowledge. Our contribution consists in developing a specific identification scheme that is insensitive to a certain type of faults. The identified param...
To extract subcircuits from a large circuit netlist is an important task that contributes a lot in many fields of computer aided design. In this paper, a novel subcircuit extraction algorithm DECIDE, based on a recursive graph identification scheme as well as a fast graph construction approach is presented. Cooperating with a proper weighting function that assigns a weighting value to each node...
This paper proposes an identification scheme for a complex liquid effluent incinerator process. This scheme is developed to obtain a MIMO (Multiple Input Single Output) TS (Takagi-Sugeno) fuzzy model where the modified Gath Geva clustering algorithm is used to determine the antecedent part as the consequent parameters are estimated by RLS (Recursive Least Square) algorithm.
This paper proposes a new closed-loop identification scheme for a singleinput-single-output control loop. It is based upon a quantizer inserted into the feedback path. The quantizer can be used to generate an equivalent persistently exciting signal with which the well known two-stage and/or two-step method can be used directly. Simulation examples and an experimental demonstration are used to i...
This paper focuses on parameter identification of Fluid Viscous Dampers, comparing different existing literature models, with the aim to recognize ability of these models to match experimental loops under different test specimens. Identification scheme is developed evaluating the experimental and the analytical values of the forces experienced by the device under investigation. The experimental...
This paper presents a global model linking individual country vector error-correcting models in which the domestic variables are related to the country-specific variables as an approximate solution to a global common factor model. This global VAR is estimated for 25 countries, the euro area being treated as a single economy. This paper proposes two important extensions of previous research (see...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید