Gotowe bibliografie tematyczne / Convex domains

Gotowa bibliografia na temat „Convex domains”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 1 sierpnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Convex domains”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Convex domains"

1

Nikolov, Nikolai, Peter Pflug i W{\l}odzimierz Zwonek. "An example of a bounded $\mathsf C$-convex domain which is not biholomorphic to a convex domain". MATHEMATICA SCANDINAVICA 102, nr 1 (1.03.2008): 149. http://dx.doi.org/10.7146/math.scand.a-15056.

Pełny tekst źródła
Streszczenie:
We show that the symmetrized bidisc is a $\mathsf C$-convex domain. This provides an example of a bounded $\mathsf C$-convex domain which cannot be exhausted by domains biholomorphic to convex domains.
Style APA, Harvard, Vancouver, ISO itp.
2

Pflug, Peter, i Włodzimierz Zwonek. "Regularity of complex geodesics and (non-)Gromov hyperbolicity of convex tube domains". Forum Mathematicum 30, nr 1 (1.01.2018): 159–70. http://dx.doi.org/10.1515/forum-2016-0217.

Pełny tekst źródła
Streszczenie:
Abstract We deliver examples of non-Gromov hyperbolic tube domains with convex bases (equipped with the Kobayashi distance). This is shown by providing a criterion on non-Gromov hyperbolicity of (non-smooth) domains. The results show the similarity of geometry of the bases of non-Gromov hyperbolic tube domains with the geometry of non-Gromov hyperbolic convex domains. A connection between the Hilbert metric of a convex domain Ω in {\mathbb{R}^{n}} with the Kobayashi distance of the tube domain over the domain Ω is also shown. Moreover, continuity properties up to the boundary of complex geodesics in tube domains with a smooth convex bounded base are also studied in detail.
Style APA, Harvard, Vancouver, ISO itp.
3

Bourchtein, Ludmila, i Andrei Bourchtein. "Logarithmically Convex Reinhardt Domains". Ciência e Natura 25, nr 25 (9.12.2003): 07. http://dx.doi.org/10.5902/2179460x27233.

Pełny tekst źródła
Streszczenie:
The domains of certain types, such as Reinhardt ones, are important in different problems of theory of functions of several complex variables. For instance, any power series of several complex variables converges in the complete logarithmically convex Reinhardt domain. In this article we prove the logarithmic convexity of complete convex Reinhardt domain.
Style APA, Harvard, Vancouver, ISO itp.
4

Nikolov, Nikolai, i Pascal J. Thomas. "Convex characterization of linearly convex domains". MATHEMATICA SCANDINAVICA 111, nr 2 (1.12.2012): 179. http://dx.doi.org/10.7146/math.scand.a-15223.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Herbig, A. K., i J. D. McNeal. "Convex Defining Functions for Convex Domains". Journal of Geometric Analysis 22, nr 2 (16.11.2010): 433–54. http://dx.doi.org/10.1007/s12220-010-9202-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Peters, H. J. M., i P. P. Wakker. "Convex functions on non-convex domains". Economics Letters 22, nr 2-3 (styczeń 1986): 251–55. http://dx.doi.org/10.1016/0165-1765(86)90242-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Filipsson, Lars. "ℂ-convexity in infinite-dimensional Banach spaces and applications to Kergin interpolation". International Journal of Mathematics and Mathematical Sciences 2006 (2006): 1–9. http://dx.doi.org/10.1155/ijmms/2006/80846.

Pełny tekst źródła
Streszczenie:
We investigate the concepts of linear convexity andℂ-convexity in complex Banach spaces. The main result is that anyℂ-convex domain is necessarily linearly convex. This is a complex version of the Hahn-Banach theorem, since it means the following: given aℂ-convex domainΩin the Banach spaceXand a pointp∉Ω, there is a complex hyperplane throughpthat does not intersectΩ. We also prove that linearly convex domains are holomorphically convex, and that Kergin interpolation can be performed on holomorphic mappings defined inℂ-convex domains.
Style APA, Harvard, Vancouver, ISO itp.
8

Graf, S. Yu. "Harmonic mappings onto R-convex domains". Issues of Analysis 26, nr 2 (czerwiec 2019): 37–50. http://dx.doi.org/10.15393/j3.art.2019.6190.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Jacquet, David. "-convex domains with C2boundary". Complex Variables and Elliptic Equations 51, nr 4 (kwiecień 2006): 303–12. http://dx.doi.org/10.1080/17476930600585738.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Joiţa, Cezar. "Traces of convex domains". Proceedings of the American Mathematical Society 131, nr 9 (21.04.2003): 2721–25. http://dx.doi.org/10.1090/s0002-9939-03-07119-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Convex domains"

1

Aksnes, Vegard. "On Fourier Series in Convex Domains". Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9517.

Pełny tekst źródła
Streszczenie:

We consider systems of complex exponential functions in spaces of square integrable functions. Some classical one-dimensional theory is reviewed, in particular, we emphasize the duality between the Riesz bases of complex exponential functions in $L^2$-spaces and complete interpolating sequences in $PW^2$-spaces of entire functions of exponential type. Basis properties for $L^2$-spaces over planar convex domains are then studied in detail. The convex domain in question is shown to be crucial for what basis properties the corresponding $L^2$-space possesses. We explain some results related to Fuglede's conjecture about existence of orthonormal bases and then a result by Lyubarskii and Rashkovskii regarding Riesz bases for $L^2$-spaces over convex polygons, symmetric with respect to the origin. Finally, we make a modest attempt to apply the techniques by Lyubarskii and Rashkovskii combined with approximation of plurisubharmonic functions using logarithms of moduli of entire functions, to construct a complete system of exponential functions in the space of square integrable functions over a disk. This work is not completed yet.

Style APA, Harvard, Vancouver, ISO itp.
2

Abuelela, Waleed Mostafa Kamal Abdelfatah. "Hardy type inequalities for non-convex domains". Thesis, University of Birmingham, 2010. http://etheses.bham.ac.uk//id/eprint/1268/.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Amiran, Edoh Yosef. "Caustics and evolutes for convex planar domains". Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/80448.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Ford, Robert Kuperberg Krystyna. "Path curvature on a convex roof". Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Fall%20Dissertations/Ford_Robert_45.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Doto, James William. "Conditional uniform convexity in Orlicz spaces and minimization problems". Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/27352.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Coatney, Ryan D. "Mean Square Estimate for Primitive Lattice Points in Convex Planar Domains". BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/2501.

Pełny tekst źródła
Streszczenie:
The Gauss circle problem in classical number theory concerns the estimation of N(x) = { (m1;m2) in ZxZ : m1^2 + m2^2 <= x }, the number of integer lattice points inside a circle of radius sqrt(x). Gauss showed that P(x) = N(x)- pi * x satisfi es P(x) = O(sqrt(x)). Later Hardy and Landau independently proved that P(x) = Omega_(x1=4(log x)1=4). It is conjectured that inf{e in R : P(x) = O(x^e )}= 1/4. I. K atai showed that the integral from 0 to X of |P(x)|^2 dx = X^(3/2) + O(X(logX)^2). Similar results to those of the circle have been obtained for regions D in R^2 which contain the origin and whose boundary dD satis fies suff cient smoothness conditions. Denote by P_D(x) the similar error term to P(x) only for the domain D. W. G. Nowak showed that, under appropriate conditions on dD, P_D(x) = Omega_(x1=4(log x)1=4) and that the integral from 0 to X of |P_D(x)|^2 dx = O(X^(3/2)). A result similar to Nowak's mean square estimate is given in the case where only "primitive" lattice points, {(m1;m2) in Z^2 : gcd(m1;m2) = 1 }, are counted in a region D, on assumption of the Riemann Hypothesis.
Style APA, Harvard, Vancouver, ISO itp.
7

Deng, Si Wen. "Precondition technique for conservative space-fractional diffusion equations in convex domains". Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950597.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Thaher, Mohammed. "Efficient Algorithms for the Maximum Convex Sum Problem". Thesis, University of Canterbury. Computer Science and Software Engineering, 2009. http://hdl.handle.net/10092/2102.

Pełny tekst źródła
Streszczenie:
The work of this thesis covers the Maximum Subarray Problem (MSP) from a new perspective. Research done previously and current methods of finding MSP include using the rectangular shape for finding the maximum sum or gain. The rectangular shape region used previously is not flexible enough to cover various data distributions. This research suggested using the convex shape, which is expected to have optimised and efficient results. The steps to build towards using the proposed convex shape in the context of MSP are as follows: studying the available research in-depth to extract the potential guidelines for this thesis research; implementing an appropriate convex shape algorithm; generalising the main algorithm (based on dynamic programming) to find the second maximum sum, the third maximum sum and up to Kth maximum sum; and finally conducting experiments to evaluate the outcomes of the algorithms in terms of the maximum gain, time complexity, and the running time. In this research, the following findings were achieved: one of the achievements is presenting an efficient algorithm, which determines the boundaries of the convex shape while having the same time complexity as other existing algorithms (the prefix sum was used to speed up the convex shape algorithm in finding the maximum sum). Besides the first achievement, the algorithm was generalized to find up to the Kth maximum sum. Finding the Kth maximum convex sum was shown to be useful in many applications, one of these (based on a study with the cooperation of Christchurch Hospital in New Zealand) is accurately and efficiently locating brain tumours. Beside this application, the research findings present new approaches to applying MSP algorithms in real life applications, such as data mining, computer vision, astronomy, economics, chemistry, and medicine.
Style APA, Harvard, Vancouver, ISO itp.
9

Cox, Bruce. "Applications of accuracy certificates for problems with convex structure". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39489.

Pełny tekst źródła
Streszczenie:
Applications of accuracy certificates for problems with convex structure   This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the constraints are represented by  “black boxes” which, given on input a value x of the argument, somehow (perhaps in a fashion unknown to the user) provide on output the values and the derivatives of the objective and the constraints at x. The main body of the dissertation can be split into three parts.  In the first part, we provide our background --- state of the art of the theory of accuracy certificates for black-box-represented convex optimization. In the second part, we extend the toolbox of black-box-oriented convex optimization algorithms with accuracy certificates by equipping with these certificates a state-of-the-art algorithm for large-scale nonsmooth black-box-represented problems with convex structure, specifically, the Non-Euclidean Restricted Memory Level (NERML) method. In the third part, we present several novel academic applications of accuracy certificates. The dissertation is organized as follows: In Chapter 1, we motivate our research goals and present a detailed summary of our results. In Chapter 2, we outline the relevant background, specifically, describe four generic black-box-represented generic problems with convex structure (Convex Minimization, Convex-Concave Saddle Point, Convex Nash Equilibrium, and Variational Inequality with Monotone Operator), and outline the existing theory of accuracy certificates for these problems. In Chapter 3, we develop techniques for equipping with on-line accuracy certificates the state-of-the-art NERML algorithm for large-scale nonsmooth problems with convex structure, both in the cases when the domain of the problem is a simple solid and in the case when the domain is given by Separation oracle. In Chapter 4, we develop  several novel academic applications of accuracy certificates, primarily to (a) efficient certifying emptiness of the intersection of finitely many solids given by Separation oracles, and (b) building efficient algorithms for convex minimization over solids given by Linear Optimization oracles (both precise and approximate). In Chapter 5, we apply accuracy certificates to efficient decomposition of “well structured” convex-concave saddle point problems, with applications to computationally attractive decomposition of a large-scale LP program with the constraint matrix which becomes block-diagonal after eliminating a relatively small number of possibly dense columns (corresponding to “linking variables”) and possibly dense rows (corresponding to “linking constraints”).
Style APA, Harvard, Vancouver, ISO itp.
10

Winkler, Gunter. "Control constrained optimal control problems in non-convex three dimensional polyhedral domains". Doctoral thesis, Universitätsbibliothek Chemnitz, 2008. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200800626.

Pełny tekst źródła
Streszczenie:
The work selects a specific issue from the numerical analysis of optimal control problems. We investigate a linear-quadratic optimal control problem based on a partial differential equation on 3-dimensional non-convex domains. Based on efficient solution methods for the partial differential equation an algorithm known from control theory is applied. Now the main objectives are to prove that there is no degradation in efficiency and to verify the result by numerical experiments. We describe a solution method which has second order convergence, although the intermediate control approximations are piecewise constant functions. This superconvergence property is gained from a special projection operator which generates a piecewise constant approximation that has a supercloseness property, from a sufficiently graded mesh which compensates the singularities introduced by the non-convex domain, and from a discretization condition which eliminates some pathological cases. Both isotropic and anisotropic discretizations are investigated and similar superconvergence properties are proven. A model problem is presented and important results from the regularity theory of solutions to partial differential equation in non-convex domains have been collected in the first chapters. Then a collection of statements from the finite element analysis and corresponding numerical solution strategies is given. Here we show newly developed tools regarding error estimates and projections into finite element spaces. These tools are necessary to achieve the main results. Known fundamental statements from control theory are applied to the given model problems and certain conditions on the discretization are defined. Then we describe the implementation used to solve the model problems and present all computed results.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Convex domains"

1

M. L. J. van de Vel. Theory of convex structures. Amsterdam: North-Holland, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Rockafellar, Ralph Tyrell. Convex Analysis. Princeton, NJ, USA: Princeton University Press, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dobkin, David P. Searching for empty convex polygons. Urbana, IL (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1988.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Mercer, Peter R. Holomorphic maps between convex domains in C r. Toronto: [s.n.], 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

1974-, Robert Frédéric, i Wei Juncheng 1968-, red. The Lin-Ni's problem for mean convex domains. Providence, R.I: American Mathematical Society, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Brooks, J. N. Blaschke's rolling theorem in Rn. Providence, R.I: American Mathematical Society, 1989.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Kosmák, Ladislav. Konvexita. Praha: Academia, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Edelsbrunner, Herbert. Probing convex polygons with x-rays. Urbana, IL: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Miyamoto, Yasuhito. The "hot spots" conjecture for nearly spherical plannar convex domains. Kyoto, Japan: Kyōto Daigaku Sūri Kaiseki Kenkyūjo, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Panik, Michael J. Fundamentals of convex analysis: Duality, separation, representation, and resolution. Dordrecht: Kluwer Academic Publishers, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Convex domains"

1

Graham, Ian. "Holomorphic Mappings into Convex Domains". W Complex Analysis, 127–33. Wiesbaden: Vieweg+Teubner Verlag, 1991. http://dx.doi.org/10.1007/978-3-322-86856-5_21.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ghorbal, Khalil, Franjo Ivančić, Gogul Balakrishnan, Naoto Maeda i Aarti Gupta. "Donut Domains: Efficient Non-convex Domains for Abstract Interpretation". W Lecture Notes in Computer Science, 235–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27940-9_16.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Boltyanski, V., H. Martini i V. Soltan. "Minimum Convex Partitions of Polygonal Domains". W Geometric Methods and Optimization Problems, 357–429. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5319-9_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Zimmer, Andrew. "Gromov Hyperbolicity of Bounded Convex Domains". W Lecture Notes in Mathematics, 67–114. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65837-7_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Alarcón, Antonio, Franc Forstnerič i Francisco J. López. "Minimal Surfaces in Minimally Convex Domains". W Springer Monographs in Mathematics, 337–78. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69056-4_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Diederich, Klas, i Jeffery D. McNeal. "Pointwise nonisotropic support functions on convex domains". W Complex Analysis and Geometry, 183–92. Basel: Birkhäuser Basel, 2000. http://dx.doi.org/10.1007/978-3-0348-8436-5_13.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Polking, John C. "The Cauchy-Riemann Equations in Convex Domains". W Complex Analysis, 247–53. Wiesbaden: Vieweg+Teubner Verlag, 1991. http://dx.doi.org/10.1007/978-3-322-86856-5_36.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Barrett, David, i Michael Bolt. "The Cauchy-Leray Operator for Convex Domains". W Handbook of Complex Analysis, 19–40. Boca Raton: Chapman and Hall/CRC, 2022. http://dx.doi.org/10.1201/9781315160658-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kolev, Kalin, i Daniel Cremers. "Integration of Multiview Stereo and Silhouettes Via Convex Functionals on Convex Domains". W Lecture Notes in Computer Science, 752–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88682-2_57.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Jerison, David. "Sharp Estimates for Harmonic Measure in Convex Domains". W Partial Differential Equations with Minimal Smoothness and Applications, 149–62. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-2898-1_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Convex domains"

1

SUFFRIDGE, TED J. "HOLOMORPHIC MAPPINGS OF DOMAINS IN ℂN ONTO CONVEX DOMAINS". W Proceedings of a Satellite Conference to the International Congress of Mathematicians in Beijing 2002. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812702500_0021.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Szeptycki, Paweł. "Locally convex domains of integral operators". W Topological Algebras, their Applications, and Related Topics. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2005. http://dx.doi.org/10.4064/bc67-0-28.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

FANG, JIUNN, i STEPHEN KENNON. "Unstructured grid generation for non-convex domains". W 9th Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1989. http://dx.doi.org/10.2514/6.1989-1983.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Petrov, Vladimir E., Anastasiya N. Volkova, Alexey V. Strepetov i Galina N. Dyakova. "On solving the magnetostatics equations for convex domains". W 2015 Days on Diffraction (DD). IEEE, 2015. http://dx.doi.org/10.1109/dd.2015.7354871.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Saks, Michael, i Lan Yu. "Weak monotonicity suffices for truthfulness on convex domains". W the 6th ACM conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1064009.1064040.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Floater, Michael S., i Jiří Kosinka. "Barycentric interpolation and mappings on smooth convex domains". W the 14th ACM Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1839778.1839794.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Valmorbida, Giorgio, Mohamadreza Ahmadi i Antonis Papachristodoulou. "Convex solutions to integral inequalities in two-dimensional domains". W 2015 54th IEEE Conference on Decision and Control (CDC). IEEE, 2015. http://dx.doi.org/10.1109/cdc.2015.7403366.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Alexander, S., R. Bihsop i R. Ghrist. "Pursuit and evasion in non-convex domains of arbitrary dimensions". W Robotics: Science and Systems 2006. Robotics: Science and Systems Foundation, 2006. http://dx.doi.org/10.15607/rss.2006.ii.015.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Lu, Lin, Yi-King Choi i Wenping Wang. "Visibility-Based Coverage of Mobile Sensors in Non-convex Domains". W 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering (ISVD). IEEE, 2011. http://dx.doi.org/10.1109/isvd.2011.22.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Ilboudo, Wendyam Eric Lionel, Taisuke Kobayashi i Takamitsu Matsubara. "Domains as Objectives: Multi-Domain Reinforcement Learning with Convex-Coverage Set Learning for Domain Uncertainty Awareness". W 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2023. http://dx.doi.org/10.1109/iros55552.2023.10342236.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Convex domains"

1

Faisal, Muhammad Imran. Geometric Properties of Simply Connected Convex Domain. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, wrzesień 2019. http://dx.doi.org/10.7546/crabs.2019.09.01.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Fluhr, Robert, i Maor Bar-Peled. Novel Lectin Controls Wound-responses in Arabidopsis. United States Department of Agriculture, styczeń 2012. http://dx.doi.org/10.32747/2012.7697123.bard.

Pełny tekst źródła
Streszczenie:
Innate immune responses in animals and plants involve receptors that recognize microbe-associated molecules. In plants, one set of this defense system is characterized by large families of TIR–nucleotide binding site–leucine-rich repeat (TIR-NBS-LRR) resistance genes. The direct interaction between plant proteins harboring the TIR domain with proteins that transmit and facilitate a signaling pathway has yet to be shown. The Arabidopsis genome encodes TIR-domain containing genes that lack NBS and LRR whose functions are unknown. Here we investigated the functional role of such protein, TLW1 (TIR LECTIN WOUNDRESPONSIVE1). The TLW1 gene encodes a protein with two domains: a TIR domain linked to a lectin-containing domain. Our specific aim in this proposal was to examine the ramifications of the TL1-glycan interaction by; A) The functional characterization of TL1 activity in the context of plant wound response and B) Examine the hypothesis that wounding induced specific polysaccharides and examine them as candidates for TL-1 interactive glycan compounds. The Weizmann group showed TLW1 transcripts are rapidly induced by wounding in a JA-independent pathway and T-DNA-tagged tlw1 mutants that lack TLW1 transcripts, fail to initiate the full systemic wound response. Transcriptome methodology analysis was set up and transcriptome analyses indicates a two-fold reduced level of JA-responsive but not JA-independent transcripts. The TIR domain of TLW1 was found to interact directly with the KAT2/PED1 gene product responsible for the final b-oxidation steps in peroxisomal-basedJA biosynthesis. To identify potential binding target(s) of TL1 in plant wound response, the CCRC group first expressed recombinant TL1 in bacterial cells and optimized conditions for the protein expression. TL1 was most highly expressed in ArcticExpress cell line. Different types of extraction buffers and extraction methods were used to prepare plant extracts for TL1 binding assay. Optimized condition for glycan labeling was determined, and 2-aminobenzamide was used to label plant extracts. Sensitivity of MALDI and LC-MS using standard glycans. THAP (2,4,6- Trihydroxyacetophenone) showed minimal background peaks at positive mode of MALDI, however, it was insensitive with a minimum detection level of 100 ng. Using LC-MS, sensitivity was highly increased enough to detect 30 pmol concentration. However, patterns of total glycans displayed no significant difference between different extraction conditions when samples were separated with Dionex ICS-2000 ion chromatography system. Transgenic plants over-expressing lectin domains were generated to obtain active lectin domain in plant cells. Insertion of the overexpression construct into the plant genome was confirmed by antibiotic selection and genomic DNA PCR. However, RT-PCR analysis was not able to detect increased level of the transcripts. Binding ability of azelaic acid to recombinant TL1. Azelaic acid was detected in GST-TL1 elution fraction, however, DHB matrix has the same mass in background signals, which needs to be further tested on other matrices. The major findings showed the importance of TLW1 in regulating wound response. The findings demonstrate completely novel and unexpected TIR domain interactions and reveal a control nexus and mechanism that contributes to the propagation of wound responses in Arabidopsis. The implications are to our understanding of the function of TIR domains and to the notion that early molecular events occur systemically within minutes of a plant sustaining a wound. A WEB site (http://genome.weizmann.ac.il/hormonometer/) was set up that enables scientists to interact with a collated plant hormone database.
Style APA, Harvard, Vancouver, ISO itp.
3

Durik, Amanda, Steven McGee, Linda Huber i Jennifer Duck. The Cat is Alive and Well: Curiosity Motivates Exploration for High Interest Learners. The Learning Partnership, kwiecień 2015. http://dx.doi.org/10.51420/conf.2015.1.

Pełny tekst źródła
Streszczenie:
Two studies were conducted to examine how individual interest predicts interactions with domain content and subsequent free-choice exploration. Particular focus was on learners’ acquisition of knowledge and identification of content that triggered curiosity. College student participants reported their individual interest, learned about a topic in ecology (Study 1, N = 85) and astronomy (Study 2, N = 184), responded to prompts for memory of the learning content and curiosity questions, and then had the opportunity to explore additional content related to the topic. In both studies individual interest interacted with whether students’ curiosity was triggered by particular content. In academic domains, individual interest in conjunction with curiosity may be the best predictor of continued behavioral exploration. The results are discussed in the context of the four-phase model of interest development.
Style APA, Harvard, Vancouver, ISO itp.
4

Lutz, Carsten, i Maja Miličić. Description Logics with Concrete Domains and Functional Dependencies. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.143.

Pełny tekst źródła
Streszczenie:
Description Logics (DLs) with concrete domains are a useful tool in many applications. To further enhance the expressive power of such DLs, it has been proposed to add database-style key constraints. Up to now, however, only uniqueness constraints have been considered in this context, thus neglecting the second fundamental family of key constraints: functional dependencies. In this paper, we consider the basic DL with concrete domains ALC(D), extend it with functional dependencies, and analyze the impact of this extension on the decidability and complexity of reasoning. Though intuitively the expressivity of functional dependencies seems weaker than that of uniqueness constraints, we are able to show that the former have a similarly severe impact on the computational properties: reasoning is undecidable in the general case, and NExpTime-complete in some slightly restricted variants of our logic.
Style APA, Harvard, Vancouver, ISO itp.
5

Peterson, A. S., i Sholom G. Cohen. A Context Analysis of the Movement Control Domain for the Army Tactical Command and Control System (ATCCS). Fort Belvoir, VA: Defense Technical Information Center, kwiecień 1991. http://dx.doi.org/10.21236/ada248117.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Dunne, Máiréad, Sara Humphreys i Carolina Szyp. Education and Work: Children’s Lives in Rural Sub‑Saharan Africa. Action on Children’s Harmful Work in African Agriculture, kwiecień 2021. http://dx.doi.org/10.19088/acha.2021.004.

Pełny tekst źródła
Streszczenie:
This paper proposes a dynamic conceptual framework – the edu-workscape – for understanding how rural children in sub-Saharan Africa navigate three key gendered social arenas: the household, school and workplaces. Focusing on school, in particular, the paper highlights the violence, harm and labour that occur there, and argues that learning, work and harm co-exist across all three institutional domains, and in context, and should therefore be considered holistically.
Style APA, Harvard, Vancouver, ISO itp.
7

Nagpal, Divyam, Nabina Lamichhane, Samikshya Kafle i Mewang Gyeltshen. The Hindu Kush Himalaya energy profile: A baseline study across eight countries. International Centre for Integrated Mountain Development (ICIMOD), kwiecień 2022. http://dx.doi.org/10.53055/icimod.1007.

Pełny tekst źródła
Streszczenie:
This energy profile provides a snapshot for each of the eight countries of the Hindu Kush Himalaya – Afghanistan, Bangladesh, Bhutan, China, India, Myanmar, Nepal, and Pakistan. It presents the prevailing energy situation in each of these countries, based on secondary information available in the public domain. It identifies priority areas of action and measures for governments to consider in advancing renewable energy and energy efficiency in the mountain context.
Style APA, Harvard, Vancouver, ISO itp.
8

Washington, Sally. Building policy capability: Insights from a 'curated conversation' between Education departments from three jurisdictions. Australia and New Zealand School of Government, marzec 2022. http://dx.doi.org/10.54810/whfv4095.

Pełny tekst źródła
Streszczenie:
ANZSOG convened a curated conversation to bring together senior officials from: the South Australian Department for Education, The Ministry of Education in Aotearoa New Zealand and the Australian Government Department of Education, Skills and Employment. The conversation explored questions around the context and drivers for policy capability improvement initiatives. This ‘conversation tracker’ captures its key themes, which go beyond the education domain to provide insights into how agencies can address the challenge of building an effective policy infrastructure.
Style APA, Harvard, Vancouver, ISO itp.
9

Kibler, Amanda, René Pyatt, Jason Greenberg Motamedi i Ozen Guven. Key Competencies in Linguistically and Culturally Sustaining Mentoring and Instruction for Clinically-based Grow-Your-Own Teacher Education Programs. Oregon State University, maj 2021. http://dx.doi.org/10.5399/osu/1147.

Pełny tekst źródła
Streszczenie:
Grow-Your-Own (GYO) Teacher Education programs that aim to diversify and strengthen the teacher workforce must provide high-quality learning experiences that support the success and retention of Black, Indigenous, and people of color (BIPOC) teacher candidates and bilingual teacher candidates. Such work requires a holistic and systematic approach to conceptualizing instruction and mentoring that is both linguistically and culturally sustaining. To guide this work in the Master of Arts in Teaching in Clinically Based Elementary program at Oregon State University’s College of Education, we conducted a review of relevant literature and frameworks related to linguistically responsive and/or sustaining teaching or mentoring practices. We developed a set of ten mentoring competencies for school-based cooperating/clinical teachers and university supervisors. They are grouped into the domains of: Facilitating Linguistically and Culturally Sustaining Instruction, Engaging with Mentees, Recognizing and Interrupting Inequitable Practices and Policies, and Advocating for Equity. We also developed a set of twelve instructional competencies for teacher candidates as well as the university instructors who teach them. The instructional competencies are grouped into the domains of: Engaging in Self-reflection and Taking Action, Learning About Students and Re-visioning Instruction, Creating Community, and Facilitating Language and Literacy Development in Context. We are currently operationalizing these competencies to develop and conduct surveys and focus groups with various GYO stakeholders for the purposes of ongoing program evaluation and improvement, as well as further refinement of these competencies.
Style APA, Harvard, Vancouver, ISO itp.
10

Matthews, Stephen N., Louis Iverson, Matthew Peters i Anantha Prasad. Assessing potential climate change pressures across the conterminous United States. United States Department of Agriculture Forest Service, marzec 2018. http://dx.doi.org/10.32747/2018.6941248.ch.

Pełny tekst źródła
Streszczenie:
The maps and tables presented here represent potential variability of projected climate change across the conterminous United States during three 30-year periods in this century and emphasizes the importance of evaluating multiple signals of change across large spatial domains. Maps of growing degree days, plant hardiness zones, heat zones, and cumulative drought severity depict the potential for markedly shifting conditions and highlight regions where changes may be multifaceted across these metrics. In addition to the maps, the potential change in these climate variables are summarized in tables according to the seven regions of the fourth National Climate Assessment to provide additional regional context. Viewing these data collectively further emphasizes the potential for novel climatic space under future projections of climate change and signals the wide disparity in these conditions based on relatively near-term human decisions of curtailing (or not) greenhouse gas emissions.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Convex domains” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii