SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Extended search

Träfflista för sökning "LAR1:gu ;lar1:(cth);pers:(Lundh Torbjörn 1965)"

Search: LAR1:gu > Chalmers University of Technology > Lundh Torbjörn 1965

  • Result 1-10 of 58
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Aikawa, Hiroaki, 1956, et al. (author)
  • MARTIN BOUNDARY FOR UNION OF CONVEX SETS
  • 2002
  • In: 京都大学数理解析研究所, Potential Theory and Related Topics. ; 1293, s. 1-14
  • Journal article (peer-reviewed)abstract
    • We study Martin boundary points of aproper subdomain in $\mathbb{R}^{n}$ , where $n$ $\geq 2$ , that can be represented as the union of open convex sets. Especially, we give acertain sufficient condition for aboundary point to have exactly one (minimal) Martin boundary point.
  •  
2.
  • Aikawa, Hiroaki, 1956, et al. (author)
  • Martin boundary of a fractal domain
  • 2003
  • In: Potential Analysis. - : Springer Science and Business Media LLC. - 0926-2601 .- 1572-929X. ; 18:4, s. 311-357
  • Journal article (peer-reviewed)abstract
    • A uniformly John domain is a domain intermediate between a John domain and a uniform domain. We determine the Martin boundary of a uniformly John domain D as an application of a boundary Harnack principle. We show that a certain self-similar fractal has its complement as a uniformly John domain. In particular, the complement of the 3-dimensional Sierpinacuteski gasket is a uniform domain and its Martin boundary is homeomorphic to the Sierpinacuteski gasket itself.
  •  
3.
  • Aikawa, Hiroaki, 1956, et al. (author)
  • Martin boundary points of a John domain and unions of convex sets
  • 2006
  • In: J. Math. Soc. Japan. - 0025-5645 .- 1881-1167. ; 58:1, s. 247-274
  • Journal article (peer-reviewed)abstract
    • We show that a John domain has finitely many minimal Martin boundary points at each Euclidean boundary point. The number of minimal Martin boundary points is estimated in terms of the John constant. In particular, if the John constant is bigger than $\sqrt3/2$ , then there are at most two minimal Martin boundary points at each Euclidean boundary point. For a class of John domains represented as the union of convex sets we give a sufficient condition for the Martin boundary and the Euclidean boundary to coincide.
  •  
4.
  • Aikawa, Hiroaki, 1956, et al. (author)
  • The 3G inequality for a uniformly John domain
  • 2005
  • In: Kodai Mathematical Journal. ; 28:2, s. 209-219
  • Journal article (peer-reviewed)abstract
    • Let G be the Green function for a domain D $\subset$ Rd with d ≥ 3. The Martin boundary of D and the 3G inequality: $\frac{G(x,y)G(y,z)}{G(x,z)} \le A(|x-y|^{2-d}+|y-z|^{2-d})$ for x,y,z $\in$ D are studied. We give the 3G inequality for a bounded uniformly John domain D, although the Martin boundary of D need not coincide with the Euclidean boundary. On the other hand, we construct a bounded domain such that the Martin boundary coincides with the Euclidean boundary and yet the 3G inequality does not hold.
  •  
5.
  •  
6.
  • Bengmark, Samuel, 1965, et al. (author)
  • Chalmersutbildning kan ge högre lärarstatus
  • 2009
  • In: Göteborgs Posten, Debatt, nätupplagan.
  • Journal article (other academic/artistic)abstract
    • Läraryrket behöver en uppvärdering och stora pensionsavgångar samt svårigheter att konkurrera om studenter till lärarutbildningen kräver åtgärder och nytänkande. Chalmers vill därför starta ämneslärarutbildning i data, fysik, kemi, matematik och teknik så att studenten kan få både en lärarexamen och en ingenjörsexamen, skriver bland andra Samuel Bengmark, programansvarig för Chalmers lärarutbildning.
  •  
7.
  •  
8.
  • Bondesson, Johan, 1991, et al. (author)
  • Automated Quantification of Diseased Thoracic Aortic Longitudinal Centerline and Surface Curvatures
  • 2020
  • In: Journal of Biomechanical Engineering-Transactions of the Asme. - : ASME International. - 0148-0731 .- 1528-8951. ; 142:4
  • Journal article (peer-reviewed)abstract
    • Precise description of vascular morphometry is crucial to support medical device manufacturers and clinicians for improving device development and interventional outcomes. A compact and intuitive method is presented to automatically characterize the surface geometry of tubular anatomic structures and quantify surface curvatures starting from generic stereolithographic (STL) surfaces. The method was validated with software phantoms and used to quantify the longitudinal surface curvatures of 37 human thoracic aortas with aneurysm or dissection. The quantification of surface curvatures showed good agreement with analytic solutions from the software phantoms, and demonstrated better agreement as compared to estimation methods using only centerline geometry and cross-sectional radii. For the human thoracic aortas, longitudinal inner surface curvature was significantly higher than centerline curvature (0.33 +/- 0.06 versus 0.16 +/- 0.02cm(-1) for mean; 1.38 +/- 0.48 versus 0.45 +/- 0.11cm(-1) for peak; both p<0.001). These findings show the importance of quantifying surface curvatures in order to better describe the geometry and biomechanical behavior of the thoracic aorta, which can assist in treatment planning and supplying device manufactures with more precise boundary conditions for mechanical evaluation.
  •  
9.
  • Bondesson, Johan, 1991, et al. (author)
  • Definition of Tubular Anatomic Structures from Arbitrary Stereo Lithographic Surface
  • 2017
  • In: Initiative Seminar Engineering Health, 8-9 November 2017, Chalmers.
  • Conference paper (other academic/artistic)abstract
    • An accurate description of anatomies and dynamics of vessels is crucial to understand their characteristics and improve surgical techniques, thus it is the basis, in addition to surgeon experience, on which stent design and operation procedures rely. The process of producing this description is user intensive, and recent improvement in image processing of medical3D imaging allows for a more automated workflow. However, there is a need to bridge the gap from a processed geometry to a robust mathematical computational grid. By sequentially segmenting a tubular anatomic structure, here defined by a stereo lithographic (STL) surface, an initial centerline is formed by connecting centroids of orthogonal cross-sectional contours along the length of the structure. Relying on the initial centerline, a set of non-overlapping 2D cross sectional contours are defined along the centerline, a centerline which is updated after the 2D contours are produced. After a second iteration of producing 2D contours and updating the centerline, a full description of the structure is created. Our method for describing vessel geometry shows good coherence to existing method. The main advantages of our method include the possibility of having arbitrary triangulated STL surface input, automated centerline definition, safety against intersecting cross-sectional contours and automatic clean-up of local kinks and wrinkles.
  •  
10.
  • Cardilin, Tim, 1989, et al. (author)
  • Optimization of additive chemotherapy combinations for an in vitro cell cycle model with constant drug exposures
  • 2021
  • In: Mathematical Biosciences. - : Elsevier BV. - 0025-5564 .- 1879-3134. ; 338
  • Journal article (peer-reviewed)abstract
    • Proliferation of an in vitro population of cancer cells is described by a linear cell cycle model with n states, subject to provocation with m chemotherapeutic compounds. Minimization of a linear combination of constant drug exposures is considered, with stability of the system used as a constraint to ensure a stable or shrinking cell population. The main result concerns the identification of redundant compounds, and an explicit solution formula for the case where all exposures are nonzero. The orthogonal case, where each drug acts on a single and different stage of the cell cycle, leads to a version of the classic inequality between the arithmetic and geometric means. Moreover, it is shown how the general case can be solved by converting it to the orthogonal case using a linear invertible transformation. The results are illustrated with two examples corresponding to combination treatment with two and three compounds, respectively.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 58
Type of publication
journal article (40)
conference paper (10)
other publication (4)
patent (2)
doctoral thesis (1)
book chapter (1)
show more...
show less...
Type of content
peer-reviewed (41)
other academic/artistic (17)
Author/Editor
Gerlee, Philip, 1980 (11)
Aikawa, Hiroaki, 195 ... (5)
Bengmark, Samuel, 19 ... (5)
Timpka, Toomas (2)
Wennberg, Bernt, 196 ... (2)
show more...
Jöud, Anna (2)
Hirata, Kentaro (2)
Jirstrand, Mats, 196 ... (2)
Spreco, Armin (2)
Celander, Malin C., ... (2)
Liu, Y. (1)
Zhang, B. (1)
Ortiz Catalan, Max J ... (1)
Nilsson, Andreas (1)
Larsson, J. (1)
Blomberg, Anders, 19 ... (1)
Lind, Ulrika (1)
Inoue, T. (1)
Soltesz, Kristian (1)
Svanström, Magdalena ... (1)
Eriksson, Olle (1)
Dahlström, Örjan (1)
Mizutani, Tomohiko (1)
Jonsson, Per R., 195 ... (1)
Larsson, Lars, 1945 (1)
Leander, Jacob, 1987 (1)
Havenhand, Jonathan ... (1)
Fraenkel, Carl-Johan (1)
Kimura, T (1)
André, Carl, 1958 (1)
Eriksson, Henrik, 19 ... (1)
Finnsgård, Christian ... (1)
Brown, Matz, 1953 (1)
Lindgren, Kristian, ... (1)
Källström, Reidar (1)
Ekberg, Joakim (1)
Henriksson, J (1)
Pendrill, Ann-Marie, ... (1)
Cardilin, Tim, 1989 (1)
Partsch, Hugo (1)
Engström, Sven, 1951 (1)
Cronhjort, Mikael, 1 ... (1)
Gustafsson, Marcus, ... (1)
Jonson, Carl-Oscar (1)
Eriksson, Anders, 19 ... (1)
Butlin, Roger (1)
Galt, Sheila, 1956 (1)
Tapani, Sofia, 1982 (1)
Komori, M (1)
show less...
University
University of Gothenburg (58)
Uppsala University (2)
Linköping University (2)
Lund University (2)
RISE (1)
show more...
Karolinska Institutet (1)
show less...
Language
English (53)
Swedish (5)
Research subject (UKÄ/SCB)
Natural sciences (44)
Medical and Health Sciences (20)
Engineering and Technology (10)
Social Sciences (7)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view