Coincidence point theorems in quasi-metric spaces without assuming the mixed monotone property and consequences in G-metric spaces

In this paper, we present some coincidence point theorems in the setting of quasi-metric spaces that can be applied to operators which not necessarily have the mixed monotone property. As a consequence, we particularize our results to the field of metric spaces, partially ordered metric spaces and G-metric spaces, obtaining some very recent results. Finally, we show how to use our main theorems to obtain coupled, tripled, quadrupled and multidimensional coincidence point results.

Absence of Klein's paradox for massive spinless bosons coupled by a nonminimal vector interaction

A few properties of the nonminimal vector interaction in the Duffin-Kemmer-Petiau theory in the scalar sector are revised. In particular, it is shown that the nonminimal vector interaction has been erroneously applied to the description of elastic meson-nucleus scatterings and that the space component of the nonminimal vector interaction plays a peremptory role for the confinement of bosons whereas its time component contributes to the leakage. Scattering in a square step potential is used to show that Klein's paradox does not manifest in the case of a nonminimal vector coupling. Copyright © owned by the author(s) under the terms of the Creative Commons Attribution- NonCommercial-ShareAlike Licence.

3-D Space Vector PWM implementation for Four-Leg Voltage Source Inverter

The Space Vector PWM implementation and operation for a Four-leg Voltage Source Inverter (VSI) is detailed and discussed in this paper. Although less common, four-leg VSIs are a viable solution for situations where neutral connection is necessary, including Active Power Filter applications. This topology presents advantages regarding the VSI DC link and capacitance, which make it useful for high power devices. Theory, implementation and simulations are also discussed in this paper. © 2011 IEEE.

Tri-state Space Vector Modulation for Three-phase integrated inverters

The aim of this work is to present a modified Space Vector Modulation (SVM) suitable for Tri-state Three-phase inverters. A standard SVM algorithm and the Tri-state PWM (Pulse Width Modulation) are presented and their concept are mixed into the novel SVM. The proposed SVM is applied to a three-phase tri-state integrated Boost inverter, intended to Photovoltaic Energy Applications. The main features for this novel SVM are validated through simulations and also by experimental tests. The obtained results prove the feasibility of the proposal. © 2011 IEEE.

Three-phase tri-state integrated boost inverter with special space vector and dq0 control

This paper presents a three-phase integrated inverter suitable for stand-alone and grid-connected applications. Furthermore, the utilization of the special features of the tri-state coupled with the new space vector modulation allows the converter to present an attractive degree of freedom for the designing of the controllers. Additionally, the control is derived through dq0 transformation, all the system is described and interesting simulation results are available to confirm the proposal. © 2012 IEEE.

Stability for parametric implicit vector equilibrium problems

In this paper, we consider a class of parametric implicit vector equilibrium problems in Hausdorff topological vector spaces where a mapping f and a set K are perturbed by parameters is an element of and lambda respectively. We establish sufficient conditions for the upper semicontinuity and lower semicontinuity of the solution set mapping S : Lambda(1) x A(2) -> 2(X) for such parametric implicit vector equilibrium problems. (c) 2005 Elsevier Ltd. All rights reserved.

Generalized Variational Inequalities for Upper Hemicontinuous and Demi Operators with Applications to Fixed Point Theorems in Hilbert Spaces

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

Orbital and strongly orbital spaces

We say that a (countably dimensional) topological vector space X is orbital if there is T∈L(X) and a vector x∈X such that X is the linear span of the orbit {Tnx:n=0,1,…}. We say that X is strongly orbital if, additionally, x can be chosen to be a hypercyclic vector for T. Of course, X can be orbital only if the algebraic dimension of X is finite or infinite countable. We characterize orbital and strongly orbital metrizable locally convex spaces. We also show that every countably dimensional metrizable locally convex space X does not have the invariant subset property. That is, there is T∈L(X) such that every non-zero x∈X is a hypercyclic vector for T. Finally, assuming the Continuum Hypothesis, we construct a complete strongly orbital locally convex space.

As a byproduct of our constructions, we determine the number of isomorphism classes in the set of dense countably dimensional subspaces of any given separable infinite dimensional Fréchet space X. For instance, in X=ℓ2×ω, there are exactly 3 pairwise non-isomorphic (as topological vector spaces) dense countably dimensional subspaces.

Formal description, compression and transformation of digital pictures II. Picture algebra and geometry

In an earlier paper (Part I) we described the construction of Hermite code for multiple grey-level pictures using the concepts of vector spaces over Galois Fields. In this paper a new algebra is worked out for Hermite codes to devise algorithms for various transformations such as translation, reflection, rotation, expansion and replication of the original picture. Also other operations such as concatenation, complementation, superposition, Jordan-sum and selective segmentation are considered. It is shown that the Hermite code of a picture is very powerful and serves as a mathematical signature of the picture. The Hermite code will have extensive applications in picture processing, pattern recognition and artificial intelligence.

Formal description, compression and transformation of digital pictures

This paper describes the application of vector spaces over Galois fields, for obtaining a formal description of a picture in the form of a very compact, non-redundant, unique syntactic code. Two different methods of encoding are described. Both these methods consist in identifying the given picture as a matrix (called picture matrix) over a finite field. In the first method, the eigenvalues and eigenvectors of this matrix are obtained. The eigenvector expansion theorem is then used to reconstruct the original matrix. If several of the eigenvalues happen to be zero this scheme results in a considerable compression. In the second method, the picture matrix is reduced to a primitive diagonal form (Hermite canonical form) by elementary row and column transformations. These sequences of elementary transformations constitute a unique and unambiguous syntactic code-called Hermite code—for reconstructing the picture from the primitive diagonal matrix. A good compression of the picture results, if the rank of the matrix is considerably lower than its order. An important aspect of this code is that it preserves the neighbourhood relations in the picture and the primitive remains invariant under translation, rotation, reflection, enlargement and replication. It is also possible to derive the codes for these transformed pictures from the Hermite code of the original picture by simple algebraic manipulation. This code will find extensive applications in picture compression, storage, retrieval, transmission and in designing pattern recognition and artificial intelligence systems.

Unitary invariants for Hilbert modules of finite rank

We associate a sheaf model to a class of Hilbert modules satisfying a natural finiteness condition. It is obtained as the dual to a linear system of Hermitian vector spaces (in the sense of Grothendieck). A refined notion of curvature is derived from this construction leading to a new unitary invariant for the Hilbert module. A division problem with bounds, originating in Douady's privilege, is related to this framework. A series of concrete computations illustrate the abstract concepts of the paper.

Pata contractions and coupled type fixed points

A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.

a requirement traceability refinement method based on relevance feedback

Knowledge Systems Institute Graduate School

An Efficient Correspondence Based Algorithm for 2D and 3D Model Based Recognition

A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from a single 2D image, is presented. Efficient verification algorithms, based on a linear representation of location constraints, are given for the case of affine transformations among vector spaces and for the case of rigid 2D and 3D transformations with scale. Some preliminary experiments suggest that PCS is a practical algorithm. Its similarity to existing correspondence based algorithms means that a number of existing techniques for speedup can be incorporated into PCS to improve its performance.

Twierdzenia o punktach stałych pewnych klas operatorów nieliniowych wraz z ich zastosowaniami

Wydział Matematyki i Informatyki