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.     

Supersymmetry, Witten Complex and Asymptotics for Directional Lyapunov Exponents in Zd

. We study the long distance asymptotic for random walks in random potentials. We use the analytical formulation. We relate the problem to Witten Laplacians via using supersymmetry. We obtain the asymptotic for the directional Lyapunov exponents.     

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.     

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.     

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.     

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.     

Measure based representation of uncertain information

We discuss the use of monotonic set measures for the representation of uncertain information. We look at some important examples of measure-based uncertainty, specifically probability and possibility and necessity. Others types of uncertainty such as cardinality based and quasi-additive measures are discussed. We consider the problem of determining the representative value of a variable whose uncertain value is formalized using a monotonic set measure. We note the central role that averaging and particularly weighted averaging operations play in obtaining these representative values. We investigate the use of various integrals such as the Choquet and Sugeno for obtaining these required averages. We suggest ways of extending a measure defined on a set to the case of fuzzy sets and the power sets of the original set. We briefly consider the problem of question answering under uncertain knowledge.     

Insensitive,maximum stable allocations converge to proportional fairness

We describe a queuing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queuing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a proportionally fair optimization problem.     

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.     

On Equilibria when Agents Have Multiple Priors

We discuss the existence and the qualitative properties of equilibria when agents have multiple priors and there is only one good in each state of the world. We first prove a general existence result in infinite dimension economies. We then fully describe the equilibria in two special cases. We first consider the case of CEU maximizers that have same capacities. We next consider the case of no aggregate uncertainty. We prove that if agents have non-random initial endowments and are uncertainty averse and maximize the minimal expected utility according to a set of possible priors, then the existence of a common prior is equivalent to the existence of a unique equilibrium, the no-trade equilibrium. We lastly give a mild assumption for indeterminacy of equilibria and compute the dimension of indeterminacy.     

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.     

Asymptotic linearity of the mapping class group and a homological version of the Nielsen–Thurston classification

We study the action of the mapping class group on the integral homology of finite covers of a topological surface. We use the homological representation of the mapping class to construct a faithful infinite-dimensional representation of the mapping class group. We show that this representation detects the Nielsen–Thurston classification of each mapping class. We then discuss some examples that occur in the theory of braid groups and develop an analogous theory for automorphisms of free groups. We close with some open problems.     

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.     

Scheduling and lot sizing models for the single-vendor multi-buyer problem under consignment stock partnership

We consider a centralized supply chain composed of a single vendor serving multiple buyers and operating under consignment stock arrangement. Solving the general problem is hard as it requires finding optimal delivery schedule to the buyers and optimal production lot sizes. We first provide a nonlinear mixed integer programming formulation for the general scheduling and lot sizing problem. We show that the problem is NP-hard in general. We reformulate the problem under the assumption of ‘zero-switch rule’. We also provide a simple sequence independent lower bound to the solution of the general model. We then propose a heuristic procedure to generate a near-optimal delivery schedule. We assess the cost performance of that heuristic by conducting sensitivity analysis on the key model parameters. The results show that the proposed heuristic promises substantial supply-chain cost savings that increase as the number of buyers increases.     

Special metrics on compact complex manifolds

We study the existence of special metrics on compact complex manifolds. We show that every considered metric can be caracterized using conditions on the space of positive currents. We investigate what happens under holomorphic submersions or modifications. We show which metrics exist on some classical examples.     

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.     

Nonequilibrium Statistical Operator Method and Generalized Kinetic Equations

We consider some principal problems of nonequilibrium statistical thermodynamics in the framework of the Zubarev nonequilibrium statistical operator approach. We present a brief comparative analysis of some approaches to describing irreversible processes based on the concept of nonequilibrium Gibbs ensembles and their applicability to describing nonequilibrium processes. We discuss the derivation of generalized kinetic equations for a system in a heat bath. We obtain and analyze a damped Schrödinger-type equation for a dynamical system in a heat bath. We study the dynamical behavior of a particle in a medium taking the dissipation effects into account. We consider the scattering problem for neutrons in a nonequilibrium medium and derive a generalized Van Hove formula. We show that the nonequilibrium statistical operator method is an effective, convenient tool for describing irreversible processes in condensed matter.     

A free boundary problem for the Laplacian with a constant Bernoulli-type boundary condition

We study a free boundary problem for the Laplace operator, where we impose a Bernoulli-type boundary condition. We show that there exists a solution to this problem. We use A. Beurling’s technique, by defining two classes of sub- and super-solutions and a Perron argument. We try to generalize here a previous work of A. Henrot and H. Shahgholian. We extend these results in different directions.     

Relaxing support vectors for classification

We introduce a novel modification to standard support vector machine (SVM) formulations based on a limited amount of penalty-free slack to reduce the influence of misclassified samples or outliers. We show that free slack relaxes support vectors and pushes them towards their respective classes, hence we use the name relaxed support vector machines (RSVM) for our method. We present theoretical properties of the RSVM formulation and develop its dual formulation for nonlinear classification via kernels. We show the connection between the dual RSVM and the dual of the standard SVM formulations. We provide error bounds for RSVM and show it to be stable, universally consistent and tighter than error bounds for standard SVM. We also introduce a linear programming version of RSVM, which we call RSVMLP. We apply RSVM and RSVMLP to synthetic data and benchmark binary classification problems, and compare our results with standard SVM classification results. We show that relaxed influential support vectors may lead to better classification results. We develop a two-phase method called RSVM² for multiple instance classification (MIC) problems, where RSVM formulations are used as classifiers. We extend the two-phase method to the linear programming case and develop RSVMLP². We demonstrate the classification characteristics of RSVM² and RSVMLP², and report our classification results compared to results obtained by other SVM-based MIC methods on public benchmark datasets. We show that both RSVM² and RSVMLP² are faster and produce more accurate classification results.     

项链李代数的性质

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