Search results for "ta111"

Solvability of the divergence equation implies John via Poincaré inequality

2014

Abstract Let Ω ⊂ R 2 be a bounded simply connected domain. We show that, for a fixed (every) p ∈ ( 1 , ∞ ) , the divergence equation div v = f is solvable in W 0 1 , p ( Ω ) 2 for every f ∈ L 0 p ( Ω ) , if and only if Ω is a John domain, if and only if the weighted Poincare inequality ∫ Ω | u ( x ) − u Ω | q d x ≤ C ∫ Ω | ∇ u ( x ) | q  dist  ( x , ∂ Ω ) q d x holds for some (every) q ∈ [ 1 , ∞ ) . This gives a positive answer to a question raised by Russ (2013) in the case of bounded simply connected domains. In higher dimensions similar results are proved under some additional assumptions on the domain in question.

On (αn)-regular sets

2014

Simultaneous optimization of harvest schedule and measurement strategy

2013

In many recent studies, the value of forest inventory information in the harvest scheduling has been examined. Usually only the profitability of measuring simultaneously all the stands in the area is examined. Yet, it may be more profitable to concentrate the measurement efforts to some subset of them. In this paper, the authors demonstrate that stochastic optimization can be used for defining the optimal measurement strategy simultaneously with the harvest decisions. The results show that without end-inventory constraints, it was most profitable to measure the stands that were just below the medium age. Measuring the oldest stands was not profitable at all. It turned out to be profitable t…

Numerical Recovery of Source Singularities via the Radiative Transfer Equation with Partial Data

2013

The inverse source problem for the radiative transfer equation is considered, with partial data. Here we demonstrate numerical computation of the normal operator $X_{V}^{*}X_{V}$ where $X_{V}$ is the partial data solution operator to the radiative transfer equation. The numerical scheme is based in part on a forward solver designed by F. Monard and G. Bal. We will see that one can detect quite well the visible singularities of an internal optical source $f$ for generic anisotropic $k$ and $\sigma$, with or without noise added to the accessible data $X_{V}f$. In particular, we use a truncated Neumann series to estimate $X_{V}$ and $X_{V}^{*}$, which provides a good approximation of $X_{V}^{*…

Exact extension of the DIRECT algorithm to multiple objectives

2019

The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has been used as a component for many multiobjective optimization algorithms. We propose an exact and as genuine as possible extension of the direct method for multiple objectives, providing a proof of global convergence (i.e., a guarantee that in an infinite time the algorithm becomes everywhere dense). We test the efficiency of the algorithm on a nonlinear and nonconvex vector function. peerReviewed

On shape differentiation of discretized electric field integral equation

2013

Abstract This work presents shape derivatives of the system matrix representing electric field integral equation discretized with Raviart–Thomas basis functions. The arising integrals are easy to compute with similar methods as the entries of the original system matrix. The results are compared to derivatives computed with automatic differentiation technique and finite differences, and are found to be in an excellent agreement. Furthermore, the derived formulas are employed to analyze shape sensitivity of the input impedance of a planar inverted F-antenna, and the results are compared to those obtained using a finite difference approximation.

A posteriori error estimates for time-dependent reaction-diffusion problems based on the Payne-Weinberger inequality

2015

We consider evolutionary reaction-diffusion problem with mixed Dirichlet--Robin boundary conditions. For this class of problems, we derive two-sided estimates of the distance between any function in the admissible energy space and exact solution of the problem. The estimates (majorants and minorants) are explicitly computable and do not contain unknown functions or constants. Moreover, it is proved that the estimates are equivalent to the energy norm of the deviation from the exact solution.

Comparing the cost-efficiency of CoAP and HTTP in Web of Things applications

2014

Abstract Constrained Application Protocol (CoAP) has been introduced as a simpler alternative to the Hypertext Transfer Protocol (HTTP) for connecting constrained smart objects to the Web. The adoption of the protocol depends on its relative advantage, and the cost–benefit associated with the use of the protocol is a significant factor affecting a protocol adoption decision. This paper aims at deepening the understanding of the cost–benefits of CoAP and identifies the application scenarios where its use is likely to be economically justifiable. The paper analyzes the costs of using CoAP and HTTP in the Web of Things (WoT) applications, by identifying the components of the total cost of owne…

Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy

2012

Abstract We present an approach to interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy. The approach relies on formulae for lower and upper bounds on coordinates of the outcome of an arbitrary efficient variant corresponding to preference information expressed by the Decision Maker. In contrast to earlier works on that subject, here lower and upper bounds can be calculated and their accuracy controlled entirely within evolutionary computation framework. This is made possible by exploration of not only the region of feasible variants – a standard within evolutionary optimization, but also the region of i…

Genetic programming through bi-objective genetic algorithms with a study of a simulated moving bed process involving multiple objectives

2013

A new bi-objective genetic programming (BioGP) technique has been developed for meta-modeling and applied in a chromatographic separation process using a simulated moving bed (SMB) process. The BioGP technique initially minimizes training error through a single objective optimization procedure and then a trade-off between complexity and accuracy is worked out through a genetic algorithm based bi-objective optimization strategy. A benefit of the BioGP approach is that an expert user or a decision maker (DM) can flexibly select the mathematical operations involved to construct a meta-model of desired complexity or accuracy. It is also designed to combat bloat - a perennial problem in genetic …