scholarly journals <i>L</i>-Fuzzy Vector Subspaces and Its Fuzzy Dimension

2016 ◽  
Vol 06 (04) ◽  
pp. 158-168
Author(s):  
Chun’e Huang ◽  
Yan Song ◽  
Xiruo Wang
Keyword(s):  
Fuzzy Vector ◽  
Vector Subspaces

On t-fuzzy subfield and t-fuzzy vector subspaces

1989 ◽  
Vol 33 (1) ◽  
pp. 111-117 ◽  
Author(s):  
M.T. Abu Osman
Keyword(s):  
Fuzzy Vector ◽  
Vector Subspaces

scholarly journals An Improved Fuzzy Vector Signature with Reusability

2020 ◽  
Vol 10 (20) ◽  
pp. 7141
Author(s):  
Ilhwan Lim ◽  
Minhye Seo ◽  
Dong Hoon Lee ◽  
Jong Hwan Park
Keyword(s):  
Sampling Method ◽  
Performance Comparison ◽  
Error Rates ◽  
Efficiency Improvement ◽  
Fuzzy Extractor ◽  
Authentication Protocols ◽  
Biometric Data ◽  
Single User ◽  
Helper Data ◽  
Fuzzy Vector

Fuzzy vector signature (FVS) is a new primitive where a fuzzy (biometric) data w is used to generate a verification key (VKw), and, later, a distinct fuzzy (biometric) data w′ (as well as a message) is used to generate a signature (σw′). The primary feature of FVS is that the signature (σw′) can be verified under the verification key (VKw) only if w is close to w′ in a certain predefined distance. Recently, Seo et al. proposed an FVS scheme that was constructed (loosely) using a subset-based sampling method to reduce the size of helper data. However, their construction fails to provide the reusability property that requires that no adversary gains the information on fuzzy (biometric) data even if multiple verification keys and relevant signatures of a single user, which are all generated with correlated fuzzy (biometric) data, are exposed to the adversary. In this paper, we propose an improved FVS scheme which is proven to be reusable with respect to arbitrary correlated fuzzy (biometric) inputs. Our efficiency improvement is achieved by strictly applying the subset-based sampling method used before to build a fuzzy extractor by Canetti et al. and by slightly modifying the structure of the verification key. Our FVS scheme can still tolerate sub-linear error rates of input sources and also reduce the signing cost of a user by about half of the original FVS scheme. Finally, we present authentication protocols based on fuzzy extractor and FVS scheme and give performance comparison between them in terms of computation and transmission costs.

scholarly journals A Massively Parallel Algorithm for Fuzzy Vector Quantization

2009 ◽  
Vol 16A (6) ◽  
pp. 411-418 ◽  
Author(s):  
Luong Van Huynh ◽  
Cheol-Hong Kim ◽  
Jong-Myon Kim
Keyword(s):  
Parallel Algorithm ◽  
Vector Quantization ◽  
Massively Parallel ◽  
Fuzzy Vector Quantization ◽  
Fuzzy Vector

A Kind of Text Classification Method Based on Fuzzy Vector Space Model and Neural Networks

2013 ◽  
Vol 347-350 ◽  
pp. 2856-2859
Author(s):  
Jun Hui Pan ◽  
Hui Li
Keyword(s):  
Neural Networks ◽  
Vector Space ◽  
Text Classification ◽  
Vector Space Model ◽  
Classification Method ◽  
Space Model ◽  
Output Layer ◽  
Input Layer ◽  
Hidden Layer ◽  
Fuzzy Vector

A kind of text classification method based on fuzzy vector space model and neural networks is proposed in the paper according to the problems that a text can be belongs to many types during the text classification. Fuzzy theory is adopted in the method to look the occurring position of feature items in text on as the important degree (membership) reflecting text subject, and fully considered the position information while the features are extracted, thus the fuzzy feature vectors are constructed, as a result, the text classification is close to the manual classification method. The established networks are constituted of input layer, hidden layer and output layer, the input layer completes the inputs of classification samples, hidden layer extracts the implicit pattern features of input samples, the output layer is used to output the classification results. Finally the effectiveness of this method is proved by some documents of Wan Fang data in experimental section. (Abstract)

Existence of Extremal Solutions for Impulsive Delay Fuzzy Differential Equations in n-Dimensional Fuzzy Vector Space

2012 ◽  
Vol 542-543 ◽  
pp. 188-193
Author(s):  
Young Chel Kwun ◽  
Hae Eun Youm ◽  
Ja Hong Koo ◽  
Jin Han Park ◽  
Jong Jin Seo
Keyword(s):  
Differential Equations ◽  
Vector Space ◽  
Delay Condition ◽  
Extremal Solutions ◽  
Impulsive Delay ◽  
Equations With Delay ◽  
Fuzzy Vector

In this paper, we study the existence of extremal solutions for impulsive delay fuzzy differential equations in n-dimensional fuzzy vector space. This is an extension of the result of Kwun et al. [2] to impulsive fuzzy differential equations with delay condition.

Computer Implementation of an Improved Kutzbach-Gru¨bler Mobility Criterion

2002 ◽  
Author(s):  
Daniel Aguilera ◽  
Jose´ Mari´a Rico ◽  
Jaime Gallardo
Keyword(s):  
Group Theory ◽  
Computer Program ◽  
Lie Algebra ◽  
Computer Implementation ◽  
Euclidean Group ◽  
Important Advance ◽  
Simple Computer ◽  
Number Synthesis ◽  
Simple Computer Program ◽  
Vector Subspaces

Recent results have shown that the application of group theory to the Euclidean group, E(3), and its subgroups yields a new and improved mobility criterion. Unlike the well known Kutzbach-Gru¨bler criterion, this improved mobility criterion yields correct results for both trivial and exceptional linkages. Unfortunately, this improved mobility criterion requires a little bit more than counting links and kinematic pairs. An important advance was made when it was proved that the improved mobility criterion, originally stated in a language of group theory and subsets and subgroups of the Euclidean group, E(3), can be translated into a language of the Lie algebra, e(3), of the Euclidean group, E(3), and its vector subspaces and its subalgebras. The language of the Lie algebra, e(3), is far simpler than the nonlinear language of the Euclidean group, E(3). Still, the computations required for the improved mobility criterion are more involved than those required for the Kutzbach-Gru¨bler criterion, and it might preclude the employment of the improved mobility criterion in prospective tasks such as the number synthesis of parallel and modular manipulators. This contribution dispels these doubts by showing that the improved criterion can be easily implemented by a simple computer program. Several examples are included.

Sign in / Sign up

Export Citation Format

Share Document