Existence and structure results on almost periodic solutions of difference equations

We study the almost periodic solutions of Euler equations and of some more general Difference Equations. We consider two different notions of almost periodic sequences, and we establish some relations between them. We build suitable sequences spaces and we prove some properties of these spaces. We also prove properties of Nemytskii operators on these spaces. We build a variational approach to establish existence of almost periodic solutions as critical points, We obtain existence theorems fornonautonomous linear equations and for an Euler equation with a concave and coercive Lagrangian. We also use a Fixed Point approach to obtain existence results for quasi-linear Difference Equations.     

Generalizing the modeling of fuzzy logic controllers by parameterized aggregation operators

We describe the type of reasoning used in the typical fuzzy logic controller, the Mamdani reasoning method. We point out the basic assumptions in this model. We discuss the S-OWA operators which provide families of parameterized “andlike” and “orlike” operators. We generalize the Mamdani model by introducing these operators. We introduce a method, which we call Direct Fuzzy Reasoning (DFR), which results from one choice of the parameters. We develop some learning algorithms for the new method. We show how the Takagi-Sugeno-Kang (TSK) method of reasoning is an example of this DFR method.     

Complexification of Multilinear Mappings and Polynomials

We study various methods of complexifying real normed spaces. We see how the notions of duality and complexification are interchangeable. We obtain estimates for the norms of complexified multilinear mappings and polynomials. We see how polynomials can be complexified without reference to the associated multilinear mappings.     

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar inequalities.     

The personalization of security selection: An application of fuzzy set theory

We apply the theory of fuzzy subsets to the multiple objective decision problem of stock selection. We allow our objectives to have varying degrees of importance. We discuss various criteria used in selecting stocks. We indicate some procedures for subjectively evaluating the membership functions associated with these criteria.     

Bounds and Characterizations of Authentication/Secrecy Schemes

We consider authentication/secrecy schemes from the information theoretic approach. We extend results on unconditionally secure authentication schemes and then consider unconditionally secure authentication schemes that offer perfect L-fold secrecy. We consider both ordered and unordered secrecy. We establish entropy bounds on the encoding rules for authentication schemes with these types of secrecy. We provide some combinatorial characterizations and constructions for authentication schemes having perfect L-fold secrecy that meet these bounds.     

Belief structures,weight generating functions and decision-making

We describe the Dempster–Shafer belief structure and provide some of its basic properties. We introduce the plausibility and belief measures associated with a belief structure. We note that these are not the only measures that can be associated with a belief structure. We describe a general approach for generating a class of measures that can be associated with a belief structure using a monotonic function on the unit interval, called a weight generating function. We study a number of these functions and the measures that result. We show how to use weight-generating functions to obtain dual measures from a belief structure. We show the role of belief structures in representing imprecise probability distributions. We describe the use of dual measures, other then plausibility and belief, to provide alternative bounding intervals for the imprecise probabilities associated with a belief structure. We investigate the problem of decision making under belief structure type uncertain. We discuss two approaches to this decision problem. One of which is based on an expected value of the OWA aggregation of the payoffs associated with the focal elements. The second approach is based on using the Choquet integral of a measure generated from the belief structure. We show the equivalence of these approaches.     

Evolution of 3-D crystals from supersaturated vapor with modified Stefan condition: Galerkin method approach

We examine the evolution of crystals in three dimensions. We assume that the Wulff shape is a prism with a hexagonal base. We include the Gibbs-Thomson law on the crystal surface and the so-called Stefan condition. We show local in time existence of solutions assuming that the initial crystal has admissible shape.     

The inviscid limit for the complex Ginzburg-Landau equation

We study the inviscid limit of the complex Ginzburg-Landau equation. We observe that the solutions for the complex Ginzburg-Landau equation converge to the corresponding solutions for the nonlinear Schrödinger equation. We give its convergence rate. We estimate the integral forms of solutions for two equations.     

Inverse problems for multi-valued quasi variational inequalities and noncoercive variational inequalities with noisy data

ABSTRACT

We study the inverse problem of identifying a variable parameter in variational and quasi-variational inequalities. We consider a quasi-variational inequality involving a multi-valued monotone map and give a new existence result. We then formulate the inverse problem as an optimization problem and prove its solvability. We also conduct a thorough study of the inverse problem of parameter identification in noncoercive variational inequalities which appear commonly in applied models. We study the inverse problem by posing optimization problems using the output least-squares and the modified output least-squares. Using regularization, penalization, and smoothing, we obtain a single-valued parameter-to-selection map and study its differentiability. We consider optimization problems using the output least-squares and the modified output least-squares for the regularized, penalized and smoothened variational inequality. We give existence results, convergence analysis, and optimality conditions. We provide applications and numerical examples to justify the proposed framework.     

Some aspects of intuitionistic fuzzy sets

We first discuss the significant role that duality plays in many aggregation operations involving intuitionistic fuzzy subsets. We then consider the extension to intuitionistic fuzzy subsets of a number of ideas from standard fuzzy subsets. In particular we look at the measure of specificity. We also look at the problem of alternative selection when decision criteria satisfaction is expressed using intuitionistic fuzzy subsets. We introduce a decision paradigm called the method of least commitment. We briefly look at the problem of defuzzification of intuitionistic fuzzy subsets.     

Comatrix Coring Generalized and Equivalences of Categories of Comodules

We extend the comatrix coring to the case of a quasi-finite bicomodule. We also generalize some of its interesting properties. We study equivalences between categories of comodules over rather general corings. We particularize to the case of the adjoint pair of functors associated to a morphism of corings over different base rings. We apply our results to corings coming from entwining structures and graded structures, and we obtain new results in the setting of entwining structures and in the graded ring theory.     

Elementary operators and the Aluthge transform

We characterize essential normality for certain elementary operators acting on the Hilbert-Schmidt class. We find the Aluthge transform of an elementary operator of length one. We show that the Aluthge transform of an elementary 2-isometry need not be a 2-isometry. We also characterize hermitian elementary operators of length 2.     

项链李代数的性质

研究项链李代数的性质,给出了其中心元的表示形式,证明了项链李代数非半单、非可解,通过构造项链李代数的可解非幂零子代数,证明了当箭图中有长度大于1的循环时,项链李代数非幂零.还给出了没有圈的箭图上项链李代数的分解.     

Periodic non-autonomous second-order dynamical systems

We study the existence of periodic solutions for a second-order non-autonomous dynamical system. We give three sets of hypotheses which guarantee the existence of non-constant solutions. We were able to weaken the hypotheses considerably from those used previously for such systems. We employ a saddle point theorem using linking methods.     

On the specificity of a possibility distribution

The specificity of a possibility distribution measures the degree to which the distribution allows one and only one element as its manifestation. As such it is a measure of amount of uncertainty or information. We investigate a number of issues related to specificity measures. We discuss the connection between the specificity of a possibility distribution and the entropy of a probability distribution. We describe unifying view for constructing specificity measures. We look at the relationship of the specificity of a distribution and its negation. We consider the case where the base set is continuous.     

基于EM算法隐Markov模型参数估计

描述最大似然参数估计问题,介绍如何用EM算法求解最大似然参数估计.首先给出EM算法的抽象形式,然后介绍EM算法的一个应用:求隐Markov模型中的参数估计.用EM算法推导出隐Markov模型中参数的迭代公式.     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.     

To the question about the maximum principle for manifolds over local algebras

We consider manifolds over a local algebra A. We study basis functions of the canonical foliation which represent the real parts of A-differentiable functions. We prove that these are constant functions. We find the form of A-differentiable functions on some manifolds over local algebras, in particular, on compact manifolds. We obtain an estimate for the dimension of some spaces of 1-forms and analogs of the above results for the projective mappings of foliations.