Search results for " COMPUTATION"
showing 10 items of 1478 documents
Group Identities on Units of Group Algebras
2000
Abstract Let U be the group of units of the group algebra FG of a group G over a field F . Suppose that either F is infinite or G has an element of infinite order. We characterize groups G so that U satisfies a group identity. Under the assumption that G modulo the torsion elements is nilpotent this gives a complete classification of such groups. For torsion groups this problem has already been settled in recent years.
The action of a compact Lie group on nilpotent Lie algebras of type {{n,2}}
2015
Abstract We classify finite-dimensional real nilpotent Lie algebras with 2-dimensional central commutator ideals admitting a Lie group of automorphisms isomorphic to SO 2 ( ℝ ) ${{\mathrm{SO}}_{2}(\mathbb{R})}$ . This is the first step to extend the class of nilpotent Lie algebras 𝔥 ${{\mathfrak{h}}}$ of type { n , 2 } ${\{n,2\}}$ to solvable Lie algebras in which 𝔥 ${{\mathfrak{h}}}$ has codimension one.
Collision Avoidance with Potential Fields Based on Parallel Processing of 3D-Point Cloud Data on the GPU
2014
In this paper we present an experimental study on real-time collision avoidance with potential fields that are based on 3D point cloud data and processed on the Graphics Processing Unit (GPU). The virtual forces from the potential fields serve two purposes. First, they are used for changing the reference trajectory. Second they are projected to and applied on torque control level for generating according nullspace behavior together with a Cartesian impedance main control loop. The GPU algorithm creates a map representation that is quickly accessible. In addition, outliers and the robot structure are efficiently removed from the data, and the resolution of the representation can be easily ad…
Computational Fluid Dynamics (CFD) and Finite Element Analysis (FEM) of a Customized Stent-Graft for Endovascular (EVAR) Treatment of Abdominal Aorti…
2023
Background: The treatment of abdominal aortic aneurysm (AAA) is today commonly treated by inserting a stent-graft by the endovascular route, without resorting to open surgery. However, some clinical cases do not allow this less invasive approach, meaning that the stent-graft cannot be inserted and open surgery is used. Methods: In the study, we propose a fluid–structure interaction (FSI) analysis of an aneurysmatic aorta that could not be treated with Endovascular Aneurysm Repair (EVAR). The vessel is reconstructed through segmentation from CT scans and subsequently modeled on CAD software to create the surface and thickness of the vessel itself. Subsequently, we proceeded to carry out Comp…
A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
2011
International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…
Computational studies on systems derived from barium zirconate perovskite structure
2010
In solid oxide protonic conductors, proton diffusion is mainly driven by phonon-assisted dynamics, for this, becoming important local distorsion studies on the lattice, in order to detail the protonic conduction mechanism hence to improve performances of the related materials. Here, the protonic conductor Y:BaZrO3 was studied by means of DFT calculations, using new tetravalent substitution models.
Estimates of the modeling error generated by homogenization of an elliptic boundary value problem
2016
Erworben im Rahmen der Schweizer Nationallizenzen (http://www.nationallizenzen.ch)
The Abelian Kernel of an Inverse Semigroup
2020
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel. Steinberg extended the result for any variety of abelian groups with decidable membership. In this paper, we used a completely different approach to complete these results by giving an exact description of the abelian kernel of an inverse semigroup. An abelian group that gives this abelian kernel was also constructed.
Scheduling under the network of temporo-spatial proximity relationships
2017
We discuss and introduce to the schedulingeld a novel, qualitative optimization model - scheduling under the network of temporo-spatial proximity relationships.We introduce a half perimeter proximity measure as an objective of scheduling.We present and evaluate an incremental Sequence Pair neighborhood evaluation algorithm, applicable to both scheduling and rectangle packing problems in VLSI industry. In this paper, we discuss and introduce to the scheduling field a novel optimization objective - half perimeter proximity measure in scheduling under the network of temporo-spatial proximity relationships. The presented approach enables to qualitatively express various reasons of scheduling ce…
Quantum Information by Adiabatic Passage : Quantum Gates and Decoherence
2007
The first part of this thesis is about adiabatic quantum processes designed for the implementation of quantum logic gates, the elementary components of quantumcomputers, by the interaction of pulsed laser fields with atoms. The adiabaticmethods allow robust processes, i.e. which are not sensitive to the fluctuationsof experimental parameters. The processes described in this thesis only requireaccurate control of the polarisations and the relative static phases of thelaser fields. These processes allow the implementation of a universal set ofquantum gates, which make possible the implementation of all the other quantumgates by combinations.The second part of this thesis concerns the effects …