Search results for "Computer Science Applications"

Thermodynamically consistent residual-based gradient plasticity theory and comparison

2006

A gradient plasticity theory for small deformations is presented within the framework of nonlocal continuum thermodynamics. The second principle (Clausius–Duhem inequality), enriched by an additional term named energy residual, is employed in conjunction with the concepts of insulation condition and locality recovery condition, in order to derive all the pertinent restrictions upon the constitutive equations. These include the expressions of the energy residual and of the plastic dissipation density, as well as the PDEs governing the gradient kinematic and isotropic hardening of the material, together with the related higher-order boundary conditions for both the fixed and the moving bounda…

2020

One crucial parameter to evaluate the state of the heart after myocardial infarction (MI) is the viability of the myocardial segment, i.e., if the segment recovers its functionality upon revascularization. MRI performed several minutes after the injection of a contrast agent (delayed enhancement-MRI or DE-MRI) is a method of choice to evaluate the extent of MI, and by extension, to assess viable tissues after an injury. The Emidec dataset is composed of a series of exams with DE-MR images in short axis orientation covering the left ventricle from normal cases or patients with myocardial infarction, with the contouring of the myocardium and diseased areas (if present) from experts in the dom…

Discrete Learning Control with Application to Hydraulic Actuators

2015

In this paper the robustness of a class of learning control algorithms to state disturbances, output noise, and errors in initial conditions is studied. We present a simple learning algorithm and exhibit, via a concise proof, bounds on the asymptotic trajectory errors for the learned input and the corresponding state and output trajectories. Furthermore, these bounds are continuous functions of the bounds on the initial condition errors, state disturbance, and output noise, and the bounds are zero in the absence of these disturbances.

A Parametric Dirichlet Problem for Systems of Quasilinear Elliptic Equations With Gradient Dependence

2016

The aim of this article is to study the Dirichlet boundary value problem for systems of equations involving the (pi, qi) -Laplacian operators and parameters μi≥0 (i = 1,2) in the principal part. Another main point is that the nonlinearities in the reaction terms are allowed to depend on both the solution and its gradient. We prove results ensuring existence, uniqueness, and asymptotic behavior with respect to the parameters.

On the Extension of the DIRECT Algorithm to Multiple Objectives

2020

AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…

LR-NIMBUS : an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions

2022

In this paper, we develop an interactive algorithm to support a decision maker to find a most preferred lightly robust efficient solution when solving uncertain multiobjective optimization problems. It extends the interactive NIMBUS method. The main idea underlying the designed algorithm, called LR-NIMBUS, is to ask the decision maker for a most acceptable (typical) scenario, find an efficient solution for this scenario satisfying the decision maker, and then apply the derived efficient solution to generate a lightly robust efficient solution. The preferences of the decision maker are incorporated through classifying the objective functions. A lightly robust efficient solution is generated …

Heuristic algorithms for a storage location assignment problem in a chaotic warehouse

2014

The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorit…

Reliable Planar Object Pose Estimation in Light Fields From Best Subaperture Camera Pairs

2018

International audience; A light-field camera can obtain richer information about a scene than a usual camera. This property offers a lot of potential for robot vision. In this paper, we present a method for pose estimation of a planar object with a light-field camera. The light-field camera can be regarded as a set of sub-aperture cameras. Although any combination of them can theoretically be used for the pose estimation, the accuracy depends on the combination. We show that the estimated pose error can be reduced by selecting the best pair of sub-aperture cameras. We have evaluated the accuracy of our approach with real experiments using a light-field camera in front of planar targets held…

Approximations of Parabolic Equations at the Vicinity of Hyperbolic Equilibrium Point

2014

This article is devoted to the numerical analysis of the abstract semilinear parabolic problem u′(t) = Au(t) + f(u(t)), u(0) = u 0, in a Banach space E. We are developing a general approach to establish a discrete dichotomy in a very general setting and prove shadowing theorems that compare solutions of the continuous problem with those of discrete approximations in space and time. In [3] the discretization in space was constructed under the assumption of compactness of the resolvent. It is a well-known fact (see [10, 11]) that the phase space in the neighborhood of the hyperbolic equilibrium can be split in a such way that the original initial value problem is reduced to initial value prob…

On the numerical solution of some finite-dimensional bifurcation problems

1981

We consider numerical methods for solving finite-dimensional bifurcation problems. This paper includes the case of branching from the trivial solution at simple and multiple eigenvalues and perturbed bifurcation at simple eigenvalues. As a numerical example we treat a special rod buckling problem, where the boundary value problem is discretized by the shooting method.