Search results for: discrete phase
2074 A New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Authors: Nedal Tahat
Abstract:
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on factoring (FAC) problem and elliptic curve discrete logarithms (ECDL) problem. As the proposed scheme is focused on factoring and ECDLP hard problems, it has a solid structure and will totally leave the intruder bemused because it is very unlikely to solve the two hard problems simultaneously. In order to assess the security level of the proposed scheme a performance analysis has been conducted. Results have proved that the proposed scheme effectively deals with the partial blindness, randomization, unlinkability and unforgeability properties. Apart from this we have also investigated the computation cost of the proposed scheme. The new proposed scheme is robust and it is difficult for the malevolent attacks to break our scheme.
Keywords: Cryptography, Partially Blind Signature, Factoring, Elliptic Curve Discrete Logarithms.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17702073 Stability Analysis of a Class of Nonlinear Systems Using Discrete Variable Structures and Sliding Mode Control
Authors: Vivekanandan C., Prabhakar .R., Prema D.
Abstract:
This paper presents the application of discrete-time variable structure control with sliding mode based on the 'reaching law' method for robust control of a 'simple inverted pendulum on moving cart' - a standard nonlinear benchmark system. The controllers designed using the above techniques are completely insensitive to parametric uncertainty and external disturbance. The controller design is carried out using pole placement technique to find state feedback gain matrix , which decides the dynamic behavior of the system during sliding mode. This is followed by feedback gain realization using the control law which is synthesized from 'Gao-s reaching law'. The model of a single inverted pendulum and the discrete variable structure control controller are developed, simulated in MATLAB-SIMULINK and results are presented. The response of this simulation is compared with that of the discrete linear quadratic regulator (DLQR) and the advantages of sliding mode controller over DLQR are also presentedKeywords: Inverted pendulum, Variable Structure, Sliding mode control, Discrete-time systems, Nonlinear systems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20042072 2.5D Face Recognition Using Gabor Discrete Cosine Transform
Authors: Ali Cheraghian, Farshid Hajati, Soheila Gheisari, Yongsheng Gao
Abstract:
In this paper, we present a novel 2.5D face recognition method based on Gabor Discrete Cosine Transform (GDCT). In the proposed method, the Gabor filter is applied to extract feature vectors from the texture and the depth information. Then, Discrete Cosine Transform (DCT) is used for dimensionality and redundancy reduction to improve computational efficiency. The system is combined texture and depth information in the decision level, which presents higher performance compared to methods, which use texture and depth information, separately. The proposed algorithm is examined on publically available Bosphorus database including models with pose variation. The experimental results show that the proposed method has a higher performance compared to the benchmark.Keywords: Gabor filter, discrete cosine transform, 2.5D face recognition, pose.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17542071 Reformulations of Big Bang-Big Crunch Algorithm for Discrete Structural Design Optimization
Authors: O. Hasançebi, S. Kazemzadeh Azad
Abstract:
In the present study the efficiency of Big Bang-Big Crunch (BB-BC) algorithm is investigated in discrete structural design optimization. It is shown that a standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete structural design optimization. Two reformulations of the algorithm, which are referred to as modified BB-BC (MBB-BC) and exponential BB-BC (EBB-BC), are introduced to enhance the capability of the standard algorithm in locating good solutions for steel truss and frame type structures, respectively. The performances of the proposed algorithms are experimented and compared to its standard version as well as some other algorithms over several practical design examples. In these examples, steel structures are sized for minimum weight subject to stress, stability and displacement limitations according to the provisions of AISC-ASD.Keywords: Structural optimization, discrete optimization, metaheuristics, big bang-big crunch (BB-BC) algorithm, design optimization of steel trusses and frames.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23902070 Positive Solutions for a Class of Semipositone Discrete Boundary Value Problems with Two Parameters
Authors: Benshi Zhu
Abstract:
In this paper, the existence, multiplicity and noexistence of positive solutions for a class of semipositone discrete boundary value problems with two parameters is studied by applying nonsmooth critical point theory and sub-super solutions method.Keywords: Discrete boundary value problems, nonsmoothcritical point theory, positive solutions, semipositone, sub-super solutions method
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13432069 Discrete Tracking Control of Nonholonomic Mobile Robots: Backstepping Design Approach
Authors: Alexander S. Andreev, Olga A. Peregudova
Abstract:
In this paper we propose a discrete tracking control of nonholonomic mobile robots with two degrees of freedom. The electromechanical model of a mobile robot moving on a horizontal surface without slipping, with two rear wheels controlled by two independent DC electric, and one front roal wheel is considered. We present backstepping design based on the Euler approximate discretetime model of a continuous-time plant. Theoretical considerations are verified by numerical simulation.
Keywords: Actuator Dynamics, Backstepping, Discrete-Time Controller, Lyapunov Function, Wheeled Mobile Robot.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20592068 Positive Periodic Solutions in a Discrete Competitive System with the Effect of Toxic Substances
Authors: Changjin Xu, Qianhong Zhang
Abstract:
In this paper, a delayed competitive system with the effect of toxic substances is investigated. With the aid of differential equations with piecewise constant arguments, a discrete analogue of continuous non-autonomous delayed competitive system with the effect of toxic substances is proposed. By using Gaines and Mawhin,s continuation theorem of coincidence degree theory, a easily verifiable sufficient condition for the existence of positive solutions of difference equations is obtained.
Keywords: Competitive system, periodic solution, discrete time delay, topological degree.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14562067 Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0
Authors: Chillali Abdelhakim
Abstract:
Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.
Keywords: Elliptic Curve Over Ring, Discrete Logarithm Problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 35832066 Model of Controled Six Phase Induction Motor
Authors: R. Rinkeviciene, B. Kundrotas, S. Lisauskas
Abstract:
In this paper, the authors take a look at advantages of multiphase induction motors comparing them with three phase ones and present the applications where six-phase induction motors are used. They elaborate the mathematical model of six-phase induction motor with two similar stator three phase winding, shifted by 30 degrees in space and three phase winding in rotor, in synchronous reference frame for soft starting and scalar control. The authors simulate and discuss results of speed and torque starting transients.Keywords: Model, scalar control, six-phase induction motor.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 31172065 MRI Reconstruction Using Discrete Fourier Transform: A tutorial
Authors: Abiodun M. Aibinu, Momoh J. E. Salami, Amir A. Shafie, Athaur Rahman Najeeb
Abstract:
The use of Inverse Discrete Fourier Transform (IDFT) implemented in the form of Inverse Fourier Transform (IFFT) is one of the standard method of reconstructing Magnetic Resonance Imaging (MRI) from uniformly sampled K-space data. In this tutorial, three of the major problems associated with the use of IFFT in MRI reconstruction are highlighted. The tutorial also gives brief introduction to MRI physics; MRI system from instrumentation point of view; K-space signal and the process of IDFT and IFFT for One and two dimensional (1D and 2D) data.
Keywords: Discrete Fourier Transform (DFT), K-space Data, Magnetic Resonance (MR), Spin, Windows.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 51112064 Positive Solutions for Semipositone Discrete Eigenvalue Problems via Three Critical Points Theorem
Authors: Benshi Zhu
Abstract:
In this paper, multiple positive solutions for semipositone discrete eigenvalue problems are obtained by using a three critical points theorem for nondifferentiable functional.Keywords: Discrete eigenvalue problems, positive solutions, semipositone, three critical points theorem
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12532063 Improved Robust Stability Criteria for Discrete-time Neural Networks
Authors: Zixin Liu, Shu Lü, Shouming Zhong, Mao Ye
Abstract:
In this paper, the robust exponential stability problem of uncertain discrete-time recurrent neural networks with timevarying delay is investigated. By constructing a new augmented Lyapunov-Krasovskii function, some new improved stability criteria are obtained in forms of linear matrix inequality (LMI). Compared with some recent results in literature, the conservatism of the new criteria is reduced notably. Two numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed results.
Keywords: Robust exponential stability, delay-dependent stability, discrete-time neutral networks, time-varying delays.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14772062 Model Order Reduction of Discrete-Time Systems Using Fuzzy C-Means Clustering
Authors: Anirudha Narain, Dinesh Chandra, Ravindra K. S.
Abstract:
A computationally simple approach of model order reduction for single input single output (SISO) and linear timeinvariant discrete systems modeled in frequency domain is proposed in this paper. Denominator of the reduced order model is determined using fuzzy C-means clustering while the numerator parameters are found by matching time moments and Markov parameters of high order system.
Keywords: Model Order reduction, Discrete-time system, Fuzzy C-Means Clustering, Padé approximation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28142061 Optimal Design of Flat – Gain Wide-Band Discrete Raman Amplifiers
Authors: Banaz Omer Rasheed, Parexan M. Aljaff
Abstract:
In this paper, a wide band gain–flattened discrete Raman amplifiers utilizing four optimum pump wavelengths is demonstrated.Keywords: Fiber Raman Amplifiers, Optimization, WaveLength Division Multiplexing.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14632060 Sampling of Variables in Discrete-Event Simulation using the Example of Inventory Evolutions in Job-Shop-Systems Based on Deterministic and Non-Deterministic Data
Authors: Bernd Scholz-Reiter, Christian Toonen, Jan Topi Tervo, Dennis Lappe
Abstract:
Time series analysis often requires data that represents the evolution of an observed variable in equidistant time steps. In order to collect this data sampling is applied. While continuous signals may be sampled, analyzed and reconstructed applying Shannon-s sampling theorem, time-discrete signals have to be dealt with differently. In this article we consider the discrete-event simulation (DES) of job-shop-systems and study the effects of different sampling rates on data quality regarding completeness and accuracy of reconstructed inventory evolutions. At this we discuss deterministic as well as non-deterministic behavior of system variables. Error curves are deployed to illustrate and discuss the sampling rate-s impact and to derive recommendations for its wellfounded choice.Keywords: discrete-event simulation, job-shop-system, sampling rate.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18282059 Improved Robust Stability and Stabilization Conditions of Discrete-time Delayed System
Authors: Zixin Liu
Abstract:
The problem of robust stability and robust stabilization for a class of discrete-time uncertain systems with time delay is investigated. Based on Tchebychev inequality, by constructing a new augmented Lyapunov function, some improved sufficient conditions ensuring exponential stability and stabilization are established. These conditions are expressed in the forms of linear matrix inequalities (LMIs), whose feasibility can be easily checked by using Matlab LMI Toolbox. Compared with some previous results derived in the literature, the new obtained criteria have less conservatism. Two numerical examples are provided to demonstrate the improvement and effectiveness of the proposed method.
Keywords: Robust stabilization, robust stability, discrete-time system, time delay.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15312058 Existence and Stability Analysis of Discrete-time Fuzzy BAM Neural Networks with Delays and Impulses
Authors: Chao Wang, Yongkun Li
Abstract:
In this paper, the discrete-time fuzzy BAM neural network with delays and impulses is studied. Sufficient conditions are obtained for the existence and global stability of a unique equilibrium of this class of fuzzy BAM neural networks with Lipschitzian activation functions without assuming their boundedness, monotonicity or differentiability and subjected to impulsive state displacements at fixed instants of time. Some numerical examples are given to demonstrate the effectiveness of the obtained results.
Keywords: Discrete-time fuzzy BAM neural networks, ımpulses, global exponential stability, global asymptotical stability, equilibrium point.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15092057 Simulating Discrete Time Model Reference Adaptive Control System with Great Initial Error
Authors: Bubaker M. F. Bushofa, Abdel Hafez A. Azab
Abstract:
This article is based on the technique which is called Discrete Parameter Tracking (DPT). First introduced by A. A. Azab [8] which is applicable for less order reference model. The order of the reference model is (n-l) and n is the number of the adjustable parameters in the physical plant. The technique utilizes a modified gradient method [9] where the knowledge of the exact order of the nonadaptive system is not required, so, as to eliminate the identification problem. The applicability of the mentioned technique (DPT) was examined through the solution of several problems. This article introduces the solution of a third order system with three adjustable parameters, controlled according to second order reference model. The adjustable parameters have great initial error which represent condition. Computer simulations for the solution and analysis are provided to demonstrate the simplicity and feasibility of the technique.Keywords: Adaptive Control System, Discrete Parameter Tracking, Discrete Time Model.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10662056 LMI Approach to Regularization and Stabilization of Linear Singular Systems: The Discrete-time Case
Authors: Salim Ibrir
Abstract:
Sufficient linear matrix inequalities (LMI) conditions for regularization of discrete-time singular systems are given. Then a new class of regularizing stabilizing controllers is discussed. The proposed controllers are the sum of predictive and memoryless state feedbacks. The predictive controller aims to regularizing the singular system while the memoryless state feedback is designed to stabilize the resulting regularized system. A systematic procedure is given to calculate the controller gains through linear matrix inequalities.
Keywords: Singular systems, Discrete-time systems, Regularization, LMIs
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15952055 Transmission Lines Loading Enhancement Using ADPSO Approach
Authors: M. Mahdavi, H. Monsef, A. Bagheri
Abstract:
Discrete particle swarm optimization (DPSO) is a powerful stochastic evolutionary algorithm that is used to solve the large-scale, discrete and nonlinear optimization problems. However, it has been observed that standard DPSO algorithm has premature convergence when solving a complex optimization problem like transmission expansion planning (TEP). To resolve this problem an advanced discrete particle swarm optimization (ADPSO) is proposed in this paper. The simulation result shows that optimization of lines loading in transmission expansion planning with ADPSO is better than DPSO from precision view point.Keywords: ADPSO, TEP problem, Lines loading optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16192054 Discrete Polynomial Moments and Savitzky-Golay Smoothing
Authors: Paul O'Leary, Matthew Harker
Abstract:
This paper presents unified theory for local (Savitzky- Golay) and global polynomial smoothing. The algebraic framework can represent any polynomial approximation and is seamless from low degree local, to high degree global approximations. The representation of the smoothing operator as a projection onto orthonormal basis functions enables the computation of: the covariance matrix for noise propagation through the filter; the noise gain and; the frequency response of the polynomial filters. A virtually perfect Gram polynomial basis is synthesized, whereby polynomials of degree d = 1000 can be synthesized without significant errors. The perfect basis ensures that the filters are strictly polynomial preserving. Given n points and a support length ls = 2m + 1 then the smoothing operator is strictly linear phase for the points xi, i = m+1. . . n-m. The method is demonstrated on geometric surfaces data lying on an invariant 2D lattice.Keywords: Gram polynomials, Savitzky-Golay Smoothing, Discrete Polynomial Moments
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27912053 Fault Zone Detection on Advanced Series Compensated Transmission Line using Discrete Wavelet Transform and SVM
Authors: Renju Gangadharan, G. N. Pillai, Indra Gupta
Abstract:
In this paper a novel method for finding the fault zone on a Thyristor Controlled Series Capacitor (TCSC) incorporated transmission line is presented. The method makes use of the Support Vector Machine (SVM), used in the classification mode to distinguish between the zones, before or after the TCSC. The use of Discrete Wavelet Transform is made to prepare the features which would be given as the input to the SVM. This method was tested on a 400 kV, 50 Hz, 300 Km transmission line and the results were highly accurate.Keywords: Flexible ac transmission system (FACTS), thyristorcontrolled series-capacitor (TCSC), discrete wavelet transforms(DWT), support vector machine (SVM).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17322052 Simultaneous Reaction-Separation in a Microchannel Reactor with the Aid of a Guideline Structure
Authors: Salah Aljbour, Hiroshi Yamada, Tomohiko Tagawa
Abstract:
A microchannel with two inlets and two outlets was tested as a potential reactor to carry out two-phase catalytic phase transfer reaction with phase separation at the exit of the microchannel. The catalytic phase transfer reaction between benzyl chloride and sodium sulfide was chosen as a model reaction. The effect of operational time on the conversion was studied. By utilizing a multiphase parallel flow inside the microchannel reactor with the aid of a guideline structure, the catalytic phase reaction followed by phase separation could be ensured. The organic phase could be separated completely from one exit and part of the aqueous phase was separated purely and could be reused with slightly affecting the catalytic phase transfer reaction.
Keywords: Green engineering, microchannel reactor, multiphase reaction, process intensification.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16012051 Pure and Mixed Nash Equilibria Domain of a Discrete Game Model with Dichotomous Strategy Space
Authors: A. S. Mousa, F. Shoman
Abstract:
We present a discrete game theoretical model with homogeneous individuals who make simultaneous decisions. In this model the strategy space of all individuals is a discrete and dichotomous set which consists of two strategies. We fully characterize the coherent, split and mixed strategies that form Nash equilibria and we determine the corresponding Nash domains for all individuals. We find all strategic thresholds in which individuals can change their mind if small perturbations in the parameters of the model occurs.Keywords: Coherent strategy, split strategy, pure strategy, mixed strategy, Nash Equilibrium, game theory.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7152050 Controller Design of Discrete Systems by Order Reduction Technique Employing Differential Evolution Optimization Algorithm
Authors: J. S. Yadav, N. P. Patidar, J. Singhai
Abstract:
One of the main objectives of order reduction is to design a controller of lower order which can effectively control the original high order system so that the overall system is of lower order and easy to understand. In this paper, a simple method is presented for controller design of a higher order discrete system. First the original higher order discrete system in reduced to a lower order model. Then a Proportional Integral Derivative (PID) controller is designed for lower order model. An error minimization technique is employed for both order reduction and controller design. For the error minimization purpose, Differential Evolution (DE) optimization algorithm has been employed. DE method is based on the minimization of the Integral Squared Error (ISE) between the desired response and actual response pertaining to a unit step input. Finally the designed PID controller is connected to the original higher order discrete system to get the desired specification. The validity of the proposed method is illustrated through a numerical example.Keywords: Discrete System, Model Order Reduction, PIDController, Integral Squared Error, Differential Evolution.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19042049 Discrete Element Modeling on Bearing Capacity Problems
Authors: N. Li, Y. M. Cheng
Abstract:
In this paper, the classical bearing capacity problem is re-considered from discrete element analysis. In the discrete element approach, the bearing capacity problem is considered from the elastic stage to plastic stage to rupture stage (large displacement). The bearing capacity failure mechanism of a strip footing on soil is investigated, and the influence of micro-parameters on the bearing capacity of soil is also observed. It is found that the distinct element method (DEM) gives very good visualized results, and basically coincides well with that derived by the classical methods.
Keywords: Bearing capacity, distinct element method, failure mechanism, large displacement.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14902048 Stochastic Model Predictive Control for Linear Discrete-Time Systems with Random Dither Quantization
Authors: Tomoaki Hashimoto
Abstract:
Recently, feedback control systems using random dither quantizers have been proposed for linear discrete-time systems. However, the constraints imposed on state and control variables have not yet been taken into account for the design of feedback control systems with random dither quantization. Model predictive control is a kind of optimal feedback control in which control performance over a finite future is optimized with a performance index that has a moving initial and terminal time. An important advantage of model predictive control is its ability to handle constraints imposed on state and control variables. Based on the model predictive control approach, the objective of this paper is to present a control method that satisfies probabilistic state constraints for linear discrete-time feedback control systems with random dither quantization. In other words, this paper provides a method for solving the optimal control problems subject to probabilistic state constraints for linear discrete-time feedback control systems with random dither quantization.Keywords: Optimal control, stochastic systems, discrete-time systems, probabilistic constraints, random dither quantization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 11562047 A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field
Authors: Tun Myat Aung, Ni Ni Hla
Abstract:
This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.cKeywords: Discrete logarithm problem, general attacks, elliptic curves, strong curves, prime field, binary field, attack experiments.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 11792046 Personal Authentication Using FDOST in Finger Knuckle-Print Biometrics
Authors: N. B. Mahesh Kumar, K. Premalatha
Abstract:
The inherent skin patterns created at the joints in the finger exterior are referred as finger knuckle-print. It is exploited to identify a person in a unique manner because the finger knuckle print is greatly affluent in textures. In biometric system, the region of interest is utilized for the feature extraction algorithm. In this paper, local and global features are extracted separately. Fast Discrete Orthonormal Stockwell Transform is exploited to extract the local features. Global feature is attained by escalating the size of Fast Discrete Orthonormal Stockwell Transform to infinity. Two features are fused to increase the recognition accuracy. A matching distance is calculated for both the features individually. Then two distances are merged mutually to acquire the final matching distance. The proposed scheme gives the better performance in terms of equal error rate and correct recognition rate.
Keywords: Hamming distance, Instantaneous phase, Region of Interest, Recognition accuracy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27592045 On a Discrete-Time GIX/Geo/1/N Queue with Single Working Vacation and Partial Batch Rejection
Authors: Shan Gao
Abstract:
This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival, arbitrary and outside observer-s observation epochs. We also present probability generation function (p.g.f.) of actual waiting-time distribution in the system and some performance measures.
Keywords: Discrete-time, finite buffer, single working vacation, batch arrival, partial rejection.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1596