Examples of Artificial Perceptions in Optical Character Recognition and Iris Recognition

This paper assumes the hypothesis that human learning is perception based, and consequently, the learning process and perceptions should not be represented and investigated independently or modeled in different simulation spaces. In order to keep the analogy between the artificial and human learning, the former is assumed here as being based on the artificial perception. Hence, instead of choosing to apply or develop a Computational Theory of (human) Perceptions, we choose to mirror the human perceptions in a numeric (computational) space as artificial perceptions and to analyze the interdependence between artificial learning and artificial perception in the same numeric space, using one of the simplest tools of Artificial Intelligence and Soft Computing, namely the perceptrons. As practical applications, we choose to work around two examples: Optical Character Recognition and Iris Recognition. In both cases a simple Turing test shows that artificial perceptions of the difference between two characters and between two irides are fuzzy, whereas the corresponding human perceptions are, in fact, crisp.Comment: 5th Int. Conf. on Soft Computing and Applications (Szeged, HU), 22-24 Aug 201

Physical Electronics

Contains reports on three research projects

Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions. We are particularly interested in problems arising in combinatorial optimization.Comment: 28 pages, survey pape

Physical Electronics

Contains reports on three research projects

Physical Electronics

Contains reports on three research projects

Statistical mechanics of the vertex-cover problem

We review recent progress in the study of the vertex-cover problem (VC). VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science. On ensembles of random graphs, VC exhibits an coverable-uncoverable phase transition. Very close to this transition, depending on the solution algorithm, easy-hard transitions in the typical running time of the algorithms occur. We explain a statistical mechanics approach, which works by mapping VC to a hard-core lattice gas, and then applying techniques like the replica trick or the cavity approach. Using these methods, the phase diagram of VC could be obtained exactly for connectivities $c<e$, where VC is replica symmetric. Recently, this result could be confirmed using traditional mathematical techniques. For $c>e$, the solution of VC exhibits full replica symmetry breaking. The statistical mechanics approach can also be used to study analytically the typical running time of simple complete and incomplete algorithms for VC. Finally, we describe recent results for VC when studied on other ensembles of finite- and infinite-dimensional graphs.Comment: review article, 26 pages, 9 figures, to appear in J. Phys. A: Math. Ge

Sequence Specific Motor Performance Gains after Memory Consolidation in Children and Adolescents

Memory consolidation for a trained sequence of finger opposition movements, in 9- and 12-year-old children, was recently found to be significantly less susceptible to interference by a subsequent training experience, compared to that of 17-year-olds. It was suggested that, in children, the experience of training on any sequence of finger movements may affect the performance of the sequence elements, component movements, rather than the sequence as a unit; the latter has been implicated in the learning of the task by adults. This hypothesis implied a possible childhood advantage in the ability to transfer the gains from a trained to the reversed, untrained, sequence of movements. Here we report the results of transfer tests undertaken to test this proposal in 9-, 12-, and 17-year-olds after training in the finger-to-thumb opposition sequence (FOS) learning task. Our results show that the performance gains in the trained sequence partially transferred from the left, trained hand, to the untrained hand at 48-hours after a single training session in the three age-groups tested. However, there was very little transfer of the gains from the trained to the untrained, reversed, sequence performed by either hand. The results indicate sequence specific post-training gains in FOS performance, as opposed to a general improvement in performance of the individual, component, movements that comprised both the trained and untrained sequences. These results do not support the proposal that the reduced susceptibility to interference, in children before adolescence, reflects a difference in movement syntax representation after training

Silica Materials for Medical Applications

The two main applications of silica-based materials in medicine and biotechnology, i.e. for bone-repairing devices and for drug delivery systems, are presented and discussed. The influence of the structure and chemical composition in the final characteristics and properties of every silica-based material is also shown as a function of the both applications presented. The adequate combination of the synthesis techniques, template systems and additives leads to the development of materials that merge the bioactive behavior with the drug carrier ability. These systems could be excellent candidates as materials for the development of devices for tissue engineering

Vanishing Theorems and String Backgrounds

We show various vanishing theorems for the cohomology groups of compact hermitian manifolds for which the Bismut connection has (restricted) holonomy contained in SU(n) and classify all such manifolds of dimension four. In this way we provide necessary conditions for the existence of such structures on hermitian manifolds. Then we apply our results to solutions of the string equations and show that such solutions admit various cohomological restrictions like for example that under certain natural assumptions the plurigenera vanish. We also find that under some assumptions the string equations are equivalent to the condition that a certain vector is parallel with respect to the Bismut connection.Comment: 25 pages, Late