Implantació de la telefonia IP en un entorn empresarial

L’objectiu d’aquest treball és dissenyar un model general d’un sistema de telefonia IP per a una petita o mitjana empresa. El model ha de tenir en compteles característiques actuals de la xarxa de l’empresa i proposar una solució adient. Un altre requeriment és la utilització de software de lliure distribució, des del sistema operatiu fins al relatiu a VoIP, i més concretament, el software de centraleta VoIP Asterisk sobre GNU/Linux.En primer lloc s’estudiaran els conceptes bàsics de la telefonia IP (protocols,codificadors, servidors, etc.). En segon lloc, s’analitzaran els diferents escenarispossibles i es proposaran solucions adequades per cadascun d’ells. Després s’estudiarà el funcionament de les centraletes Asterisk i la seva configuració encada escenari. Finalment s’aplicarà aquest estudi a una empresa concreta

Graded algebra automorphisms

We consider the Clifford algebra C(q) of a regular quadratic space (V, q) over a field K with its structure of Z/2Z-graded K-algebra. We give a characterization of the group of graded automorphisms of C(q). In the last section we introduce the Z/nZ-graded algebras and we study as well as the group of graded automorphisms for some of them.

Poincaré is a subgroup of Galilei in one space dimension more

Through an imaginary change of coordinates, the ordinary Poincar algebra is shown to be a subalgebra of the Galilei one in four space dimensions. Through a subsequent contraction the remaining Lie generators are eliminated in a natural way. An application of these results to connect Galilean and relativistic field equations is discussed.

General Interaction Picture from Action Principle for Mechanics

In this paper we consider a general action principle for mechanics written by means of the elements of a Lie algebra. We study the physical reasons why we have to choose precisely a Lie algebra to write the action principle. By means of such an action principle we work out the equations of motion and a technique to evaluate perturbations in a general mechanics that is equivalent to a general interaction picture. Classical or quantum mechanics come out as particular cases when we make realizations of the Lie algebra by derivations into the algebra of products of functions or operators, respectively. Later on we develop in particular the applications of the action principle to classical and quantum mechanics, seeing that in this last case it agrees with Schwinger's action principle. The main contribution of this paper is to introduce a perturbation theory and an interaction picture of classical mechanics on the same footing as in quantum mechanics.

Collineations of a symmetric 2-covariant tensor: Ricci collineations

The infinitesimal transformations that leave invariant a two-covariant symmetric tensor are studied. The interest of these symmetry transformations lays in the fact that this class of tensors includes the energy-momentum and Ricci tensors. We find that in most cases the class of infinitesimal generators of these transformations is a finite dimensional Lie algebra, but in some cases exhibiting a higher degree of degeneracy, this class is infinite dimensional and may fail to be a Lie algebra. As an application, we study the Ricci collineations of a type B warped spacetime.

Intrinsic subspace convergence in TDD MIMO communication

In numerical linear algebra, students encounter earlythe iterative power method, which finds eigenvectors of a matrixfrom an arbitrary starting point through repeated normalizationand multiplications by the matrix itself. In practice, more sophisticatedmethods are used nowadays, threatening to make the powermethod a historical and pedagogic footnote. However, in the contextof communication over a time-division duplex (TDD) multipleinputmultiple-output (MIMO) channel, the power method takes aspecial position. It can be viewed as an intrinsic part of the uplinkand downlink communication switching, enabling estimationof the eigenmodes of the channel without extra overhead. Generalizingthe method to vector subspaces, communication in thesubspaces with the best receive and transmit signal-to-noise ratio(SNR) is made possible. In exploring this intrinsic subspace convergence(ISC), we show that several published and new schemes canbe cast into a common framework where all members benefit fromthe ISC.

A mathematical study of fuzzy logic; an algebraic approach

Fuzzy set theory and Fuzzy logic is studied from a mathematical point of view. The main goal is to investigatecommon mathematical structures in various fuzzy logical inference systems and to establish a general mathematical basis for fuzzy logic when considered as multi-valued logic. The study is composed of six distinct publications. The first paper deals with Mattila'sLPC+Ch Calculus. THis fuzzy inference system is an attempt to introduce linguistic objects to mathematical logic without defining these objects mathematically.LPC+Ch Calculus is analyzed from algebraic point of view and it is demonstratedthat suitable factorization of the set of well formed formulae (in fact, Lindenbaum algebra) leads to a structure called ET-algebra and introduced in the beginning of the paper. On its basis, all the theorems presented by Mattila and many others can be proved in a simple way which is demonstrated in the Lemmas 1 and 2and Propositions 1-3. The conclusion critically discusses some other issues of LPC+Ch Calculus, specially that no formal semantics for it is given.In the second paper the characterization of solvability of the relational equation RoX=T, where R, X, T are fuzzy relations, X the unknown one, and o the minimum-induced composition by Sanchez, is extended to compositions induced by more general products in the general value lattice. Moreover, the procedure also applies to systemsof equations. In the third publication common features in various fuzzy logicalsystems are investigated. It turns out that adjoint couples and residuated lattices are very often present, though not always explicitly expressed. Some minor new results are also proved.The fourth study concerns Novak's paper, in which Novak introduced first-order fuzzy logic and proved, among other things, the semantico-syntactical completeness of this logic. He also demonstrated that the algebra of his logic is a generalized residuated lattice. In proving that the examination of Novak's logic can be reduced to the examination of locally finite MV-algebras.In the fifth paper a multi-valued sentential logic with values of truth in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper developes some ideas of Goguen and generalizes the results of Pavelka on the unit interval. Our proof for the completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if, and only if the algebra of the valuesof truth is a complete MV-algebra. The Compactness Theorem holds in our well-defined fuzzy sentential logic, while the Deduction Theorem and the Finiteness Theorem do not. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. The last paper is a continuation of the fifth study. The semantics and syntax of fuzzy predicate logic with values of truth in ana injective MV-algerba are introduced, and a list of universally valid sentences is established. The system is proved to be semanticallycomplete. This proof is based on an idea utilizing some elementary properties of injective MV-algebras and MV-homomorphisms, and is purely algebraic.

Monoidal functors, acyclic models and chain operads

We prove that for a topological operad $P$ the operad of oriented cubical singular chains, $C^{\ord}_\ast(P)$, and the operad of simplicial singular chains, $S_\ast(P)$, are weakly equivalent. As a consequence, $C^{\ord}_\ast(P\nsemi\mathbb{Q})$ is formal if and only if $S_\ast(P\nsemi\mathbb{Q})$ is formal, thus linking together some formality results which are spread out in the literature. The proof is based on an acyclic models theorem for monoidal functors. We give different variants of the acyclic models theorem and apply the contravariant case to study the cohomology theories for simplicial sets defined by $R$-simplicial differential graded algebras.

Fuzzy subgroups, algebraic and topological points of view and complex analysis

Fuzzy subsets and fuzzy subgroups are basic concepts in fuzzy mathematics. We shall concentrate on fuzzy subgroups dealing with some of their algebraic, topological and complex analytical properties. Explorations are theoretical belonging to pure mathematics. One of our ideas is to show how widely fuzzy subgroups can be used in mathematics, which brings out the wealth of this concept. In complex analysis we focus on Möbius transformations, combining them with fuzzy subgroups in the algebraic and topological sense. We also survey MV spaces with or without a link to fuzzy subgroups. Spectral space is known in MV algebra. We are interested in its topological properties in MV-semilinear space. Later on, we shall study MV algebras in connection with Riemann surfaces. In fact, the Riemann surface as a concept belongs to complex analysis. On the other hand, Möbius transformations form a part of the theory of Riemann surfaces. In general, this work gives a good understanding how it is possible to fit together different fields of mathematics.

Assessing negative priming by attended distractors in a paper-and-pencil task

The paper-and-pencil digit-comparison task for assessing negative priming (NP) was introduced, using a referent-size-selection procedure that was demonstrated to enhance the effect. NP is indicated by slower responses to recently ignored items, and proposed within the clinical-experimental framework as a major cognitive index of active suppression of distracting information, critical to executive functioning. The digit-comparison task requires circling digits of a list with digit-asterisk pairs (a baseline measure for digit-selection), and the larger of two digits in each pair of the unrelated (with different digits in successive digit-pairs) and related lists (in which the smaller digit subsequently became a target). A total of 56 students (18-38 years) participated in two experiments that explored practice effects across lists and demonstrated reliable NP, i.e., slowing to complete the related list relative to the unrelated list, (F(2, 44) = 52.42, P < 0.0001). A 3rd experiment examined age-related effects. In the paper-and-pencil digit-comparison task, NP was reliable for the younger (N = 8, 18-24 years) and middle-aged adults (N = 8, 31-54 years), but absent for the older group (N = 8, 68-77 years). NP was also reduced with aging in a computer-implemented digit-comparison task, and preserved in a task typically used to test location-specific NP, accounting for the dissociation between identity- and spatial-based suppression of distractors (Rao R(3, 12) = 16.02, P < 0.0002). Since the paper-and-pencil digit-comparison task can be administered easily, it can be useful for neuropsychologists seeking practical measures of NP that do not require cumbersome technical equipment.

ReAlM - a system to manipulate relations

Given a heterogeneous relation algebra R, it is well known that the algebra of matrices with coefficient from R is relation algebra with relational sums that is not necessarily finite. When a relational product exists or the point axiom is given, we can represent the relation algebra by concrete binary relations between sets, which means the algebra may be seen as an algebra of Boolean matrices. However, it is not possible to represent every relation algebra. It is well known that the smallest relation algebra that is not representable has only 16 elements. Such an algebra can not be put in a Boolean matrix form.[15] In [15, 16] it was shown that every relation algebra R with relational sums and sub-objects is equivalent to an algebra of matrices over a suitable basis. This basis is given by the integral objects of R, and is, compared to R, much smaller. Aim of my thesis is to develop a system called ReAlM - Relation Algebra Manipulator - that is capable of visualizing computations in arbitrary relation algebras using the matrix approach.