Modeling and character analyzing of multiple fractional-order memcapacitors in parallel connection

Recently,the memory elements-based circuits have been addressed frequently in the nonlinear circuit theory due to their unique behaviors.Thus,the modeling and characterizing of the mem-elements become essential.In this paper,the analysis of the multiple fractional-order voltage-controlled memcapacitors model in parallel connection is studied.Firstly,two fractional-order memcapacitors are connected in parallel,the equivalent model is derived,and the characteristic of the equivalent memcapacitor is analyzed in positive or negative connection.Then a new understanding manner according to different rate factor K and fractional orderαis derived to explain the equivalent modeling structure conveniently.Additionally,the negative order appears,which is a consequence of the combination of memcapacitors in different directions.Meanwhile,the equivalent parallel memcapacitance has been drawn to determine that multiple fractional-order memcapacitors could be calculated as one composite memcapacitor.Thus,an arbitrary fractional-order equivalent memcapacitor could be constructed by multiple fractional-order memcapacitors.     

Comparison of Multivariate Matching Methods: Structures,Distances, and Algorithms

Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.     

Minimum-norm fixed point of nonexpansive mappings with applications

The purpose of this paper is to present two new iterative algorithms to find the minimum norm fixed point of nonexpansive nonself-mappings in the framework of Hilbert spaces. The results presented in this paper improve and extend the corresponding ones announced by Yao and Xu [Yao Y, Xu HK. Iterative methods for finding minimum norm fixed point of mappings with applications. Optimization. 2011;60:645–658] and many others. Some applications to convex minimization and split feast problems(SFP) are also included.     

Characterization of the Cone and Applications in Banach Spaces

Abstract

In this article, we first discuss the subduality and orthogonality of the cones and the dual cones when the norm is monotone in Banach spaces. Then, under different assumptions, the necessary and sufficient conditions for the ordering increasing property of the metric projection onto cones and order intervals are studied. Moreover, representations of the metric projection onto cones and order intervals are obtained. As applications, the solvability and approximation results of solutions to nonlinear discontinuous variational inequality and complementarity problems are proved by partial ordering methods.     

The contact Yamabe flow on K-contact manifolds

We use the contact Yamabe flow to find solutions of the contact Yamabe problem on K-contact manifolds.     

Distribution function estimates by Wasserstein metric and Bernstein approximation for C-1 functions

The aim of the paper is to estimate the density functions or distribution functions measured by Wasserstein metric, a typical kind of statistical distances, which is usually required in the statistical learningBased on the classical Bernstein approximation, a scheme is presented.To get the error estimates of the scheme, the problem turns to estimating the L1 norm of the Bernstein approximation for monotone C-1functions, which was rarely discussed in the classical approximation theoryFinally, we get a probability estimate by the statistical distance.     

Korn inequality on irregular domains

In this paper, we study the weighted Korn inequality on some irregular domains, e.g., s-John domains and domains satisfying quasihyperbolic boundary conditions. Examples regarding sharpness of the Korn inequality on these domains are presented. Moreover, we show that Korn inequalities imply certain Poincaré inequality.     

Metric inequalities for routings on direct connections with application to line planning

We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching. We derive a feasibility condition for path capacities supporting such direct connection flows similar to the well-known feasibility condition for arc capacities in ordinary multi-commodity flows. The condition can be expressed in terms of a class of metric inequalities for routings on direct connections. We illustrate the concept on the example of the line planning problem in public transport and present an application to large-scale real-world problems.