Strong convergence theorems by hybrid method for asymptotically -strict pseudo-contractive mapping in Hilbert space

In this paper, we introduce the hybrid method of modified Mann’s iteration for an asymptotically k-strict pseudo-contractive mapping. Then we prove that such a sequence converges strongly to P_F(T)x₀. This main theorem improves the result of Issara Inchan [I. Inchan, Strong convergence theorems of modified Mann iteration methods for asymptotically nonexpansive mappings in Hilbert spaces, Int. J. Math. Anal. 2 (23) (2008) 1135–1145] and concerns the result of Takahashi et al. [W. Takahashi, Y. Takeuchi, R. Kubota, Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 341 (2008) 276–286], and many others.     

Quality management systems from the perspective of organization of complex systems

The aim of this model is to analyse quality management systems from the standpoint of the organization of complex systems introduced by Robert Rosen. The concept that an organized system, under certain conditions, can be modelled as a living system introduces unsuspected tools to analyse its behaviour. The model is oriented towards the understanding of the implications of modifications introduced in laboratories working with a quality organization following the ISO/IEC 17025 standard.This standard establishes management and technical requirements concerning the documental organization, control of the management and technical records, personnel, equipments, test or calibration methods, etc. The objective of the quality system implementation is to assure the quality of the product, the special consideration being the customer’s satisfaction with all aspects of the service the laboratory offers.The improper use of the quality system tools has an impact on the laboratory activity. The perception of this fact can be negligible at the moment it happens. The model allows us to realize that this alteration always has a negative impact on the customer and it specially affects the continuous improvement that the laboratory must implement.     

A hybrid approximation method for equilibrium and fixed point problems for a family of infinitely nonexpansive mappings and a monotone mapping

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a family of infinitely nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in the framework of a Hilbert space. Under suitable conditions, some strong convergence theorems for approximating a common element of the above three sets are obtained. Additionally, we utilize our results to study the optimization problem and find a zero of a maximal monotone operator and a strictly pseudocontractive mapping in a real Hilbert space. Our results improve and extend the results announced by many others.     

-extension of Lie triple systems

In this paper, we introduce the notion of T^*-extension of a Lie triple system. Then we show that T^*-extension is compatible with nilpotency, solvability, and it preserves in certain sense the decomposition properties. In addition, we investigate the equivalence of T^*-extensions using cohomology. Finally, we show that every finite-dimensional nilpotent metrised Lie triple system over an algebraically closed field is the T^*-extension of an appropriate quotient system.     

The topological structure of fuzzy sets with endograph metric

For a non-degenerate convex subset Y of the n-dimensional Euclidean space Rⁿ, let be the family of all fuzzy sets ofRⁿ, which are upper-semicontinuous, fuzzy convex and normal with compact supports contained in Y. We show that the space with the topology of endograph metric is homeomorphic to the Hilbert cube Q=[-1,1]^ω iff Y is compact; and the space is homeomorphic to {(x_n)Q:sup|x_n|<1} iff Y is non-compact and locally compact.     

Robust pole placement controller design in LMI region for uncertain and disturbed switched systems

This paper concerns the state feedback control for continuous-time, disturbed and uncertain linear switched systems with arbitrary switching rules. The main result of this work consists in getting a LMI (Linear Matrix Inequalities) condition guaranteeing a robust pole placement according to some desired specifications. Then, external disturbance attenuation with a fixed rate according to the H_∞ criterion is ensured. This is obtained thanks to the existence of a common quadratic Lyapunov function for all sub-systems. Finally, an academic example illustrates the efficiency of the developed approach.     

Delay-dependent robust control for uncertain discrete-time singular systems with time-delays

The robust memoryless state feedback H_∞ control problem for uncertain time-delay discrete-time singular systems is discussed. Under a series of equivalent transformation, the equivalence of this problem and the robust state feedback H_∞ control problem for standard state-space uncertain time-delay discrete-time systems is presented. In terms of matrix inequality, the delay-dependent sufficient condition for the solution of this problem is given, the design method of the memoryless state feedback controller and the controller are also given.     

Observer synthesis method for Lipschitz nonlinear discrete-time systems with time-delay: An LMI approach

In this paper, we address the problem of observer design for a class of Lipschitz nonlinear discrete-time systems with time-delay. The main contribution lies in the use of a new structure of the proposed observer with a novel Lyapunov-Krasovskii functional. Thanks to these designs, new nonrestrictive synthesis conditions, expressed in terms of linear matrix inequalities (LMIs), are obtained. Indeed, the obtained LMIs contain more degree of freedom than those established by the approaches available in the literature which consider a simple Luenberger observer with a simple Lyapunov function for the stability analysis. An extension of the presented result to H_∞ performance analysis is given in order to take into account the noise (if it exists) affecting the considered system.     

A cone complementarity linearization approach to robust controller design for continuous-time piecewise linear systems with linear fractional uncertainties

This paper investigates the robust H_∞ control problem for uncertain continuous-time piecewise systems by using the piecewise continuous Lyapunov function. The uncertainties of the systems under consideration are expressed in a linear fractional form. A strict linear matrix inequality approach is developed to obtain stability condition and H_∞ performance. The H_∞ controller design problem is solved by exploiting the cone complementarity linearization (CCL) method, which can be cast into an iterative minimization problem subject to LMI constraints. Finally two examples are given to illustrate the application of the proposed approach.     

Existence and subharmonicity of solutions for nonlinear non-smooth periodic systems with a -Laplacian

In the present paper, we consider the nonlinear periodic systems driven by a vectorial p-Laplacian with a locally Lipschitz nonlinearity. Some existence, multiplicity and subharmonic results are obtained by using non-smooth critical point theory.     

Succinct data structures for flexible text retrieval systems

We propose succinct data structures for text retrieval systems supporting document listing queries and ranking queries based on the tf*idf (term frequency times inverse document frequency) scores of documents. Traditional data structures for these problems support queries only for some predetermined keywords. Recently Muthukrishnan proposed a data structure for document listing queries for arbitrary patterns at the cost of data structure size. For computing the tf*idf scores there has been no efficient data structures for arbitrary patterns.Our new data structures support these queries using small space. The space is only 2/ times the size of compressed documents plus 10n bits for a document collection of length n, for any 0<1. This is much smaller than the previous O(nlogn) bit data structures. Query time is O(m+qlogn) for listing and computing tf*idf scores for all q documents containing a given pattern of length m. Our data structures are flexible in a sense that they support queries for arbitrary patterns.     

Newsvendor equations for optimal reorder levels of serial inventory systems with fixed batch sizes

We consider a stochastic serial inventory system with a given fixed batch size per stage and linear inventory holding and penalty costs. For this system, echelon stock (R,nQ) policies are known to be optimal. On the basis of new average costs formulas, we obtain newsvendor equations for the optimal reorder levels.     

Cone-valued Lyapunov functions and stability for impulsive functional differential equations

The stability criteria in terms of two measures for impulsive functional differential equations are established via cone-valued Lyapunov functions and Razumikhin technique. The stability can be deduced from the (Q₀,Q)-stability of comparison impulsive differential equations. An example is given to illustrate the advantages of the results obtained.     

On uniqueness of Gibbs measure for -adic countable state Potts model on the Cayley tree

In the present paper we consider countable state of p-adic Potts model on the tree. Under some condition on weights we establish uniqueness of Gibbs measures for the model. Note that this condition does not depend on values of the prime p. An analogous fact is not true when the number of spins is finite.     

An iterative algorithm based on -proximal mappings for a system of generalized implicit variational inclusions in Banach spaces

In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369–383], for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. Further, we consider a system of generalized implicit variational inclusions in Banach spaces and show its equivalence with a system of implicit Wiener–Hopf equations using the concept of M-proximal mappings. Using this equivalence, we propose a new iterative algorithm for the system of generalized implicit variational inclusions. Furthermore, we prove the existence of solution of the system of generalized implicit variational inclusions and discuss the convergence and stability analysis of the iterative algorithm.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).     

Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules

We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for ℓ₁-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai–Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.     

A completeness result for the simply typed -calculus

In this paper, we define a realizability semantics for the simply typed λμ-calculus. We show that, if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.     

Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).