Shared feature extraction for nearest neighbor face recognition

In this paper, we propose a new supervised linearfeature extraction technique for multiclass classification problemsthat is specially suited to the nearest neighbor classifier (NN).The problem of finding the optimal linear projection matrix isdefined as a classification problem and the Adaboost algorithmis used to compute it in an iterative way. This strategy allowsthe introduction of a multitask learning (MTL) criterion in themethod and results in a solution that makes no assumptions aboutthe data distribution and that is specially appropriated to solvethe small sample size problem. The performance of the methodis illustrated by an application to the face recognition problem.The experiments show that the representation obtained followingthe multitask approach improves the classic feature extractionalgorithms when using the NN classifier, especially when we havea few examples from each class

The Salmon Algorithm - A New Population Based Search Metaheuristic

This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming upstream to spawn. There are a number of tunable parameters in the algorithm, so experiments were conducted to find the optimum parameter settings for different search spaces. The algorithm was tested on one instance of the Traveling Salesman Problem and found to have superior performance to an Ant Colony Algorithm and a Genetic Algorithm. It was then tested on three coding theory problems - optimal edit codes, optimal Hamming distance codes, and optimal covering codes. The algorithm produced improvements on the best known values for five of six of the test cases using edit codes. It matched the best known results on four out of seven of the Hamming codes as well as three out of three of the covering codes. The results suggest the Salmon Algorithm is competitive with established guided random search techniques, and may be superior in some search spaces.

A Cryptosystem Using the Concepts of Algebraic Geometric Code

Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key size. Error detection and correction can be done efficiently by simple decoding methods using the cryptosystem developed. Approach: Algebraic geometric codes are codes, generated using curves. The cryptosystem use basic concepts of elliptic curves cryptography and generator matrix. Decrypted information takes the form of a repetition code. Due to this complexity of decoding procedure is reduced. Error detection and correction can be carried out efficiently by solving a simple system of linear equations, there by imposing the concepts of security along with error detection and correction. Results: Implementation of the algorithm is done on MATLAB and comparative analysis is also done on various parameters of the system. Attacks are common to all cryptosystems. But by securely choosing curve, field and representation of elements in field, we can overcome the attacks and a stable system can be generated. Conclusion: The algorithm defined here protects the information from an intruder and also from the error in communication channel by efficient error correction methods.

Analysis of the calving pattern of herds in small-scale dairy systems in central Mexico

This study sets out to find the best calving pattern for small-scale dairy systems in Michoacan State, central Mexico. Two models were built. First, a linear programming model was constructed to optimize calving pattern and herd structure according to metabolizable energy availability. Second, a Markov chain model was built to investigate three reproductive scenarios (good, average and poor) in order to suggest factors that maintain the calving pattern given by the linear programming model. Though it was not possible to maintain the optimal linear programming pattern, the Markov chain model suggested adopting different reproduction strategies according to period of the year that the cow is expected to calve. Comparing different scenarios, the Markov model indicated the effect of calving interval on calving pattern and herd structure.

Sampling, WLS, and Mixed Models

Mixed models may be defined with or without reference to sampling, and can be used to predict realized random effects, as when estimating the latent values of study subjects measured with response error. When the model is specified without reference to sampling, a simple mixed model includes two random variables, one stemming from an exchangeable distribution of latent values of study subjects and the other, from the study subjects` response error distributions. Positive probabilities are assigned to both potentially realizable responses and artificial responses that are not potentially realizable, resulting in artificial latent values. In contrast, finite population mixed models represent the two-stage process of sampling subjects and measuring their responses, where positive probabilities are only assigned to potentially realizable responses. A comparison of the estimators over the same potentially realizable responses indicates that the optimal linear mixed model estimator (the usual best linear unbiased predictor, BLUP) is often (but not always) more accurate than the comparable finite population mixed model estimator (the FPMM BLUP). We examine a simple example and provide the basis for a broader discussion of the role of conditioning, sampling, and model assumptions in developing inference.

Some classes of semisimple group (and loop) algebras over finite fields

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components We apply our work to obtain similar information about the loop algebras of mdecomposable RA loops and to produce negative answers to the isomorphism problem over various fields (C) 2010 Elsevier Inc All rights reserved

Statements on chaos control designs, including a fractional order dynamical system, applied to a MEMS comb-drive actuator

In this work, we deal with a micro electromechanical system (MEMS), represented by a micro-accelerometer. Through numerical simulations, it was found that for certain parameters, the system has a chaotic behavior. The chaotic behaviors in a fractional order are also studied numerically, by historical time and phase portraits, and the results are validated by the existence of positive maximal Lyapunov exponent. Three control strategies are used for controlling the trajectory of the system: State Dependent Riccati Equation (SDRE) Control, Optimal Linear Feedback Control, and Fuzzy Sliding Mode Control. The controls proved effective in controlling the trajectory of the system studied and robust in the presence of parametric errors.

Synchronization of the unified chaotic system and application in secure communication

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On an Active Control for a Structurally Nonlinear Mechanical System, Taking Into Account an Energy Pumping

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Suppression of vibrations in strongly nonhomogeneous 2DOF systems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On energy transfer phenomena, in a nonlinear ideal and nonideal essential vibrating systems, coupled to a (MR) magneto-rheological damper

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Chaos suppression in NEMs resonators by using nonlinear control design

In this work the chaotic behavior of a micro-mechanical resonator with electrostatic forces on both sides is suppressed. The aim is to control the system in an orbit of the analytical solution obtained by the Method of Multiple Scales. Two control strategies are used for controlling the trajectory of the system, namely: State Dependent Riccati Equation (SDRE) Control and Optimal Linear Feedback Control (OLFC). The controls proved effectiveness in controlling the trajectory of the system. Additionally, the robustness of each strategy is tested considering the presence of parametric errors and measurement noise in control. © 2012 American Institute of Physics.

Nonlinear control system applied to atomic force microscope including parametric errors

The performance of the optimal linear feedback control and of the state-dependent Riccati equation control techniques applied to control and to suppress the chaotic motion in the atomic force microscope are analyzed. In addition, the sensitivity of each control technique regarding to parametric uncertainties are considered. Simulation results show the advantages and disadvantages of each technique. © 2013 Brazilian Society for Automatics - SBA.

Microcantilever chaotic motion suppression in tapping mode atomic force microscope

The tapping mode is one of the mostly employed techniques in atomic force microscopy due to its accurate imaging quality for a wide variety of surfaces. However, chaotic microcantilever motion impairs the obtention of accurate images from the sample surfaces. In order to investigate the problem the tapping mode atomic force microscope is modeled and chaotic motion is identified for a wide range of the parameter's values. Additionally, attempting to prevent the chaotic motion, two control techniques are implemented: the optimal linear feedback control and the time-delayed feedback control. The simulation results show the feasibility of the techniques for chaos control in the atomic force microscopy. © 2012 IMechE.

Tm-afm nonlinear motion control with robustness analysis to parametric errors in the control signal determination

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)