Existence for evolutionary problems with linear growth by stability methods

We establish that solutions to the Cauchy–Dirichlet problem

${?}_{t}u?\mathrm{div}(D_{\xi }f(x,Du))=0$

for functionals $f:\mathrm{\Omega }\times {\mathbb{R}}^{N\times n}\to [0,\infty )$ of linear growth can be obtained as limits of solutions to flows with p-growth in the limit $p\downarrow 1$. The result can be interpreted on the one hand as a stability result. On the other hand it provides an existence result for general flows with linear growth.     

Oriented total variation l1/2 regularization

Total Variation (TV) is a widely used image restoration/decomposition model. It is observed that the classical TV l1 and TV l2 regularization, on the one hand, do not favor higher-gradient structures over lower-gradient details as expected for structure preserving image processing, and on the other hand, tend to reduce the horizontal and vertical gradients, and thus inevitably blur the oblique edges in images. In this paper, we address these two problems by defining Oriented Total Variation l1/2 (OTV l1/2). It is theoretically and experimentally demonstrated that applying l1/2 regularization to the directional derivatives of images leads to superior structure preservation. OTV l1/2 regularization can be applied to image denoising and video compression, and the experimental results verify that OTV l1/2 outperforms other similar models.     

Investigation of molar concentration effect on structural,optical, electrical,and photovoltaic properties of spray‐coated Cu2O thin films

High quality copper oxide thin films were prepared by nebulizer spray pyrolysis technique using different concentrations of copper precursor solution. Concentration‐dependent structural, morphological, optical, and electrical properties of the prepared films are discussed. X‐ray diffraction studies done for the samples confirmed that the deposited films are in Cu₂O phase with polycrystalline cubic structure. Atomic force microscopy analysis revealed that all the films are composed of nano sheet shaped grains covering the substrate surface. Optical studies done on the samples showed band gap values 2.42, 2.31, and 2.02 eV for the solution concentration 0.01, 0.05, and 0.1 M, respectively. Photoluminescence spectral analysis showed the emission band at 620 nm confirming the formation of cuprous oxide. Electrical analysis of the films showed p‐type conductivity with a low resistivity 2.19 × 10² Ω.cm and high carrier concentration 16.76 × 10 ¹⁵ cm⁻³ for the molar concentration 0.1 M. In this work, Cu₂O/ZnO heterojunctions were also prepared, and solar cell properties were studied; they were found to show increased open circuit voltage and short circuit current for higher copper concentration.     

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.     

Asymptotic expansion for vector-valued sequences of random variables with focus on Wiener chaos

We develop the asymptotic expansion theory for vector-valued sequences ${\left(F_N\right)}_{N\ge 1}$ of random variables in terms of the convergence of the Stein–Malliavin matrix associated with the sequence $F_N$. Our approach combines the classical Fourier approach and the recent Stein–Malliavin theory. We find the second order term of the asymptotic expansion of the density of $F_N$ and we illustrate our results by several examples.     

A semidefinite programming approach to the hypergraph minimum bisection problem

The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB.     

针对连续变化法测定络合物稳定常数实验中可能出现的设计缺陷的讨论

连续变化法测定络合物组成和稳定常数是大学化学中的经典学生实验。但针对1：2和1：3的络合反应，实验教科书的设计中可能出现数据点过少也就是溶液配制过少的问题。如果按照要求配制溶液，由于没有完全反应的混合溶液，而其他混合溶液给出的数据又都呈良好的线性，就缺少了用来估算曲线的数据点，结果是，将没有足够的数据对稳定常数进行估算。对这种可能出现的数据点过少的实验设计的原因、结果和解决方法进行了探讨。     

Two improved formulations for the minimum latency problem

In network problems, latency is associated with the metric used to evaluate the length of the path from a root vertex to each vertex in the network. In this work we are dealing with two applications or variations of the minimum latency problem known as the repairman problem and the deliveryman problem. We have developed two integer formulations for the minimum latency problem and compared them with other two formulations from the literature for the time-dependent traveling salesman problem. The present work highlights the similarities and differences between the different formulations. In addition, we discuss the convenience of including a set of constraints in order to reduce the computation time needed to reach the optimal solution. We have carried out extensive computational experimentation on asymmetrical instances, since they provide the characteristics of the deliveryman and repairman problems in a better way.     

Necessary and sufficient optimality conditions for fractional multi-objective problems

Using a special scalarization, we give necessary optimality conditions for fractional multiobjective optimization problems. Under a generalized invexity, sufficient optimality conditions are also given. All over the article, the data are assumed to be continuous but not necessarily Lipschitz.