1,925 research outputs found
Expression of the beta subunit of the IL2 receptor in leukemia and lymphomas: correlation with alpha subunit expression and functional characterization of signal transduction
No full textOn unitary convex decompositions of vectors in a -algebra
No full textsummary:By exploiting his recent results, the author further investigates the extent to which variation in the coefficients of a unitary convex decomposition of a vector in a unital -algebra permits the vector decomposable as convex combination of fewer unitaries; certain -algebra results due to M. Rørdam have been extended to the general setting of -algebras
Espressione della subunità del recettore per l'interleuchina 2 in 18 casi di leucemia acuta
No full text
THE BETA SUBUNIT OF THE INTERLEUKIN-2 RECEPTOR MEDIATES INTERLEUKIN-2 INDUCTION OF ANTI-CD3 REDIRECTED CYTO-TOXIC CAPABILITY IN LARGE GRANULAR LYMPHOCYTES
No full text
Erratum: Half-supersymmetric solutions in five-dimensional supergravity (Journal of High Energy Physics (2007) 12 (025))
No full text[No abstract available]Gutowski JB, 2007, J HIGH ENERGY PHYS11
Surjective isometries between unitary sets of unital JB∗-algebras
No full textWe would like to thank Prof. Lajos Molnár for encouraging us to explore this problem.
We are also indebted to the anonymous reviewer for several useful comments.
First and fifth authors partially supported by the Spanish Ministry of Science, Innovation and Universities (MICINN) and European Regional Development Fund project
no. PGC2018-093332-B-I00, Programa Operativo FEDER 2014-2020 and Consejería de
Economía y Conocimiento de la Junta de Andalucía grant numbers A-FQM-242-UGR18
and FQM375. First author partially supported by EPSRC (UK) project “Jordan Algebras, Finsler Geometry and Dynamics” ref. no. EP/R044228/1. Second author partially
supported by JSPS KAKENHI Grant Number JP 21J21512. Fourth author partially
supported by JSPS KAKENHI (Japan) Grant Number JP 20K03650.
* Funding for open access charge: Universidad de Granada / CBUAThis paper is, in a first stage, devoted to establishing a topological–algebraic characterization of the principal component, U0(M), of the set of unitary elements, U(M), in a unital JB⁎-algebra M. We arrive to the conclusion that, as in the case of unital C⁎-algebras, U0(M)=M1−1∩U(M)={Ue⋯Ue(1):n∈N,hj∈Msa∀1≤j≤n}={u∈U(M): there exists w∈U0(M) with ‖u−w‖<2} is analytically arcwise connected. Actually, U0(M) is the smallest quadratic subset of U(M) containing the set eiM. Our second goal is to provide a complete description of the surjective isometries between the principal components of two unital JB⁎-algebras M and N. Contrary to the case of unital C⁎-algebras, we shall deduce the existence of connected components in U(M) which are not isometric as metric spaces. We shall also establish necessary and sufficient conditions to guarantee that a surjective isometry Δ:U(M)→U(N) admits an extension to a surjective linear isometry between M and N, a conclusion which is not always true. Among the consequences it is proved that M and N are Jordan ⁎-isomorphic if, and only if, their principal components are isometric as metric spaces if, and only if, there exists a surjective isometry Δ:U(M)→U(N) mapping the unit of M to an element in U0(N). These results provide an extension to the setting of unital JB⁎-algebras of the results obtained by O. Hatori for unital C⁎-algebras.CBUAConsejería de Economía y Conocimiento de la Junta de Andalucía
A-FQM-242-UGR18, FQM375Ministerio de Ciencia, Innovación y UniversidadesEngineering and Physical Sciences Research Council
EP/R044228/1Universidad de GranadaMinisterio de Ciencia e InnovaciónJapan Society for the Promotion of Science JP 20K03650, JP 21J21512European Regional Development Fund
PGC2018-093332-B-I0
Flexible time–space network formulation and hybrid metaheuristic for conflict-free and energy-efficient path planning of automated guided vehicles
No full textOperations of Automated Guided Vehicles (AGVs) are desired to be more energy-efficient while maintaining high transport productivity, motivated by the green production requirements. This paper investigates a new energy-efficient planning problem for determining conflict-free paths of the AGVs in its transport roadmap. In this problem, the vehicle path and transport time in the roadmap are jointly optimized, based on a flexible time–space network (FTSN). We provide the mathematical problem formulation of the energy-efficient path planning problem. The resulting optimization problem is proved to be a non-convex mixed-integer nonlinear programming which is computationally intractable. We further propose a hybrid metaheuristic that integrates the genetic algorithm and estimation of the distribution algorithm to improve its computational efficiency. Numerical results show the effectiveness of the developed algorithm based on the FTSN framework, compared to the existing metaheuristics, the conventional path planning method, and a commercial solver. The proposed method has a wide application in improving energy use of material handling, providing a guiding significance on promoting cleaner production of flexible manufacturing systems.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Transport Engineering and Logistic
- …
