Universally reversible JC*-triples and operator spaces

Abstract. We prove that the vast majority of JC∗-triples satisfy the condition of universal reversibility. Our characterisation is that a JC∗-triple is universally reversible if and only if it has no triple homomorphisms onto Hilbert spaces of dimension greater than two nor onto spin factors of dimension greater than four. We establish corresponding characterisations in the cases of JW∗-triples and of TROs (regarded as JC∗-triples). We show that the distinct natural operator space structures on a universally reversible JC∗-triple E are in bijective correspondence with a distinguished class of ideals in its universal TRO, identify the Shilov boundaries of these operator spaces and prove that E has a unique natural operator space structure precisely when E contains no ideal isometric to a nonabelian TRO. We deduce some decomposition and completely contractive properties of triple homomorphisms on TROs.

Application of complex extreme learning machine to multiclass classification problems with high dimensionality: a THz spectra classification problem

We extend extreme learning machine (ELM) classifiers to complex Reproducing Kernel Hilbert Spaces (RKHS) where the input/output variables as well as the optimization variables are complex-valued. A new family of classifiers, called complex-valued ELM (CELM) suitable for complex-valued multiple-input–multiple-output processing is introduced. In the proposed method, the associated Lagrangian is computed using induced RKHS kernels, adopting a Wirtinger calculus approach formulated as a constrained optimization problem similarly to the conventional ELM classifier formulation. When training the CELM, the Karush–Khun–Tuker (KKT) theorem is used to solve the dual optimization problem that consists of satisfying simultaneously smallest training error as well as smallest norm of output weights criteria. The proposed formulation also addresses aspects of quaternary classification within a Clifford algebra context. For 2D complex-valued inputs, user-defined complex-coupled hyper-planes divide the classifier input space into four partitions. For 3D complex-valued inputs, the formulation generates three pairs of complex-coupled hyper-planes through orthogonal projections. The six hyper-planes then divide the 3D space into eight partitions. It is shown that the CELM problem formulation is equivalent to solving six real-valued ELM tasks, which are induced by projecting the chosen complex kernel across the different user-defined coordinate planes. A classification example of powdered samples on the basis of their terahertz spectral signatures is used to demonstrate the advantages of the CELM classifiers compared to their SVM counterparts. The proposed classifiers retain the advantages of their ELM counterparts, in that they can perform multiclass classification with lower computational complexity than SVM classifiers. Furthermore, because of their ability to perform classification tasks fast, the proposed formulations are of interest to real-time applications.

Data Assimilation and Inverse Methods in Terms of a Probabilistic Formulation

The weak-constraint inverse for nonlinear dynamical models is discussed and derived in terms of a probabilistic formulation. The well-known result that for Gaussian error statistics the minimum of the weak-constraint inverse is equal to the maximum-likelihood estimate is rederived. Then several methods based on ensemble statistics that can be used to find the smoother (as opposed to the filter) solution are introduced and compared to traditional methods. A strong point of the new methods is that they avoid the integration of adjoint equations, which is a complex task for real oceanographic or atmospheric applications. they also avoid iterative searches in a Hilbert space, and error estimates can be obtained without much additional computational effort. the feasibility of the new methods is illustrated in a two-layer quasigeostrophic model.

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields - namely, in the simultaneous presence of symmetries and reversing symmetries - by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincare series and their associated Molien formulae are introduced,and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants. (C) 2008 Elsevier B.V, All rights reserved.

Strongly damped wave problems: Bootstrapping and regularity of solutions

The aim of the article is to present a unified approach to the existence, uniqueness and regularity of solutions to problems belonging to a class of second order in time semilinear partial differential equations in Banach spaces. Our results are applied next to a number of examples appearing in literature, which fall into the class of strongly damped semilinear wave equations. The present work essentially extends the results on the existence and regularity of solutions to such problems. Previously, these problems have been considered mostly within the Hilbert space setting and with the main part operators being selfadjoint. In this article we present a more general approach, involving sectorial operators in reflexive Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Coherent state quantization of paragrassmann algebras

By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite matrices realizes a deformed Weyl-Heisenberg algebra. The study of mean values in coherent states of some of these operators leads to interesting conclusions.

Genericity of Nondegenerate Critical Points and Morse Geodesic Functionals

We consider a family of variational problems on a Hilbert manifold parameterized by an open subset of a Banach manifold, and we discuss the genericity of the nondegeneracy condition for the critical points. Using classical techniques, we prove an abstract genericity result that employs the infinite dimensional Sard-Smale theorem, along the lines of an analogous result of B. White [29]. Applications are given by proving the genericity of metrics without degenerate geodesics between fixed endpoints in general (non compact) semi-Riemannian manifolds, in orthogonally split semi-Riemannian manifolds and in globally hyperbolic Lorentzian manifolds. We discuss the genericity property also in stationary Lorentzian manifolds.

On a formula for the spectral flow and its applications

We consider a continuous path of bounded symmetric Fredholm bilinear forms with arbitrary endpoints on a real Hilbert space, and we prove a formula that gives the spectral flow of the path in terms of the spectral flow of the restriction to a finite codimensional closed subspace. We also discuss the case of restrictions to a continuous path of finite codimensional closed subspaces. As an application of the formula, we introduce the notion of spectral flow for a periodic semi-Riemannian geodesic, and we compute its value in terms of the Maslov index. (C) 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Identification of cause of impairment in spiral drawings, using non-stationary feature extraction approach

Parkinson’s disease is a clinical syndrome manifesting with slowness and instability. As it is a progressive disease with varying symptoms, repeated assessments are necessary to determine the outcome of treatment changes in the patient. In the recent past, a computer-based method was developed to rate impairment in spiral drawings. The downside of this method is that it cannot separate the bradykinetic and dyskinetic spiral drawings. This work intends to construct the computer method which can overcome this weakness by using the Hilbert-Huang Transform (HHT) of tangential velocity. The work is done under supervised learning, so a target class is used which is acquired from a neurologist using a web interface. After reducing the dimension of HHT features by using PCA, classification is performed. C4.5 classifier is used to perform the classification. Results of the classification are close to random guessing which shows that the computer method is unsuccessful in assessing the cause of drawing impairment in spirals when evaluated against human ratings. One promising reason is that there is no difference between the two classes of spiral drawings. Displaying patients self ratings along with the spirals in the web application is another possible reason for this, as the neurologist may have relied too much on this in his own ratings.

Towards First-Order Temporal Resolution

In this paper we show how to extend clausal temporal resolution to the ground eventuality fragment of monodic first-order temporal logic, which has recently been introduced by Hodkinson, Wolter and Zakharyaschev. While a finite Hilbert-like axiomatization of complete monodic first order temporal logic was developed by Wolter and Zakharyaschev, we propose a temporal resolution-based proof system which reduces the satisfiability problem for ground eventuality monodic first-order temporal formulae to the satisfiability problem for formulae of classical first-order logic.

Definição inicial de um sistema de provas rotulado para lógicas do conhecimento

Lógicas modais têm sido amplamente utilizadas em Ciência da Computação e inteligência artificial. Além disso, aplicações de lógicas modais na representação do conhecimento em sistemas distribuídos e, mais recentemente, em sistemas multiagentes, têm apresentado resultados promissores. No entanto, outros sistemas de prova para estas lógicas que não os sistemas axiomáticos à la Hilbert são raros na literatura. Este trabalho tem como objetivo principal preencher esta lacuna existente na literatura, ao propor um sistema de prova por dedução natural rotulada para lógicas do conhecimento.

Uma nova assinatura para glueballs

A representação de Fock-Tani é um formalismo de teoria de campos para tratar problemas envolvendo simultaneamente partículas compostas e seus constituintes. O formalismo foi originalmente desenvolvido para tratar problemas de física atômica e mais tarde estendido para problemas da física hadrônica. Nesta dissertação, inicialmente apresentamos uma revisão da Cromo dinâmica Quântica e dos modelos de quarks e de glúons constituintes. Revisamos também a representação de Fock-Tani para mésons e buscamos estendê-Ia para estados exóticos, mais precisamente para glueballs. Neste formalismo uma mudança de representação é implementada através de um operador unitário, tal que estados de glueballs no espaço de Fock, compostos por um par glúon-glúon, sejam descritos em termos de operadores de campo de glueballs elementares em um espaço de Hilbert estendido. A aplicação do operador unitário a um Hamiltoniano microscópico de gluons leva a um Hamiltoniano efetivo que descreve todos os possíveis processos envolvendo glúons e glueballs. Esse Hamiltoniano efetivo é utilizado para estudar as interações entre glueballs à baixa energia em um modelo de glúons constituintes, que interagem através da troca de um glúon virtual e são confinados por um potencial fenomenológico O méson J?C = 0++ pode ser descrito de duas formas completamente diferentes. Na primeira forma ele é descrito da maneira usual como sendo composto por um par qq. Na segunda abordagem este mesmo méson é descrito como sendo constituido por dois glúons (glueball). Também estudamos nesta dissertação o méson 2++ no mesmo contexto. Os resultados obtidos nesta dissertação indicam que o méson qq precisaria ter um raio quase igual ao dobro do respectivo raio do glueball para que suas seções de choque de espalhamento elástico fossem equivalentes. As diferenças acentuadas encontradas nas seções de choque de espalhamento elástico méson-méson e glueball-glueball, podem ser interpretadas como uma nova assinatura de glueballs.

Aspectos matemáticos do problema de aprendizagem em inteligência artificial

O objetivo deste trabalho é apresentar a base teórica para o problema de aprendizagem através de exemplos conforme as ref. [14], [15] e [16]. Aprender através de exemplos pode ser examinado como o problema de regressão da aproximação de uma função multivaluada sobre um conjunto de dados esparsos. Tal problema não é bem posto e a maneira clássica de resolvê-lo é através da teoria de regularização. A teoria de regularização clássica, como será considerada aqui, formula este problema de regressão como o problema variacional de achar a função f que minimiza o funcional Q[f] = 1 n n Xi=1 (yi ¡ f(xi))2 + ¸kfk2 K; onde kfk2 K é a norma em um espa»co de Hilbert especial que chamaremos de Núcleo Reprodutivo (Reproducing Kernel Hilbert Spaces), ou somente RKHS, IH definido pela função positiva K, o número de pontos do exemplo n e o parâmetro de regularização ¸. Sob condições gerais a solução da equação é dada por f(x) = n Xi=1 ciK(x; xi): A teoria apresentada neste trabalho é na verdade a fundamentação para uma teoria mais geral que justfica os funcionais regularizados para a aprendizagem através de um conjunto infinito de dados e pode ser usada para estender consideravelmente a estrutura clássica a regularização, combinando efetivamente uma perspectiva de análise funcional com modernos avanços em Teoria de Probabilidade e Estatística.

A comparison of statistical methods for genomic selection in a mice population

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

Uma arquitetura para detecção online de transientes em sinais de eletrocardiograma sobre o protocolo IEEE 802.3 com PM-AH

The occurrence of transients in electrocardiogram (ECG) signals indicates an electrical phenomenon outside the heart. Thus, the identification of transients has been the most-used methodology in medical analysis since the invention of the electrocardiograph (device responsible for benchmarking of electrocardiogram signals). There are few papers related to this subject, which compels the creation of an architecture to do the pre-processing of this signal in order to identify transients. This paper proposes a method based on the signal energy of the Hilbert transform of electrocardiogram, being an alternative to methods based on morphology of the signal. This information will determine the creation of frames of the MP-HA protocol responsible for transmitting the ECG signals through an IEEE 802.3 network to a computing device. That, in turn, may perform a process to automatically sort the signal, or to present it to a doctor so that he can do the sorting manually