Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
69
MODEL REDUCTION FOR FRACTURE: ALGEBRAIC REDUCTION AND HOMOGENIZATION
"... In this work, we discuss two classes of methods to reduce the complexity of (multi scale) fracture simulations. In a first part, we discuss algebraic model reduction. We show that algebraic model reduction such as the proper orthogonal decomposition cannot be used directly because of the lack of cor ..."
Abstract
- Add to MetaCart
, the modelling error increases due to the fact that by refining the coarse elements, the scale separation assumption which is a key issue for homogenisation may no longer be fulfilled[4]. Whereas
unknown title
"... considered in performance predictions. Most existing approaches use established prediction models [3, 18] to estimate the performance of already existing complex software systems. Their main focus lies on the questions: i) ”How can we automatically derive or extract the models we need? ” and ii) ”Ho ..."
Abstract
- Add to MetaCart
and monitoring of the system to extract model parameters. In order to apply these approaches, software architects have to instrument large parts of the system and conduct precise measurements. Furthermore, they are bound to the assumptions of the prediction model used. For example, if a network connection
4. TITLE AND SUBTITLE A Practical Theory of Micro-Solar Power Sensor Networks
, 2009
"... Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract
- Add to MetaCart
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information,
Routing and Broadcasting in Ad-Hoc Networks
"... I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present ..."
Abstract
- Add to MetaCart
I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Volume I: Computer Science and Software Engineering
, 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sc ..."
Abstract
- Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sciences and
unknown title
"... local deduction theorem and interpolation for substructural logics over FL. Dedicated to the memory of Willem Johannes Blok Abstract. Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural l ..."
Abstract
- Add to MetaCart
local deduction theorem and interpolation for substructural logics over FL. Dedicated to the memory of Willem Johannes Blok Abstract. Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract
- Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-
Active Mask Framework for Segmentation of Fluorescence Microscope Images
"... m]]l]]s¶D]]¿÷mB]iv]b]oD]m¶¨]iv]§]iv]r]j]t¿rv]]irj]]t]]m] / | ap]]r¿]ÎNy]s¶D]]mb¶r]ix} Û]Ix]]rd]mb]} p—N]t]o%ism] in]ty]m] / || Û]Is]¡uÎc]rN]]riv]nd]p]*N]m]st¶ I always bow to Śri ̄ Śāradāmbā, the limitless ocean of the nectar of compassion, who bears a rosary, a vessel of nectar, the symbol of ..."
Abstract
- Add to MetaCart
facilitated the task of understanding complex sys-tems at cellular and molecular levels in recent years. Segmentation, an important yet dif-ficult problem, is often the first processing step following acquisition. Our team previously demonstrated that a stochastic active contour based algorithm together
Results 11 - 20
of
69
