Relevant bibliographies by topics / Convex domain

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Convex domain'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Convex domain.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Convex domain"

1

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Bourchtein, Ludmila, and Andrei Bourchtein. "Logarithmically Convex Reinhardt Domains." Ciência e Natura 25, no. 25 (December 9, 2003): 07. http://dx.doi.org/10.5902/2179460x27233.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

Jimbo, Shuichi, and Jian Zhai. "Instability in a geometric parabolic equation on convex domain instability on convex domain." Journal of Differential Equations 188, no. 2 (March 2003): 447–60. http://dx.doi.org/10.1016/s0022-0396(02)00103-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tereshchenko, Vasyl, Sergiy Pilipenko, and Andriy Fisunenko. "Domain Triangulation between Convex Polytopes." Procedia Computer Science 18 (2013): 2500–2503. http://dx.doi.org/10.1016/j.procs.2013.05.428.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Groemer, H. "Stability Theorems for Convex Domains of Constant Width." Canadian Mathematical Bulletin 31, no. 3 (September 1, 1988): 328–37. http://dx.doi.org/10.4153/cmb-1988-048-3.

Full text
Abstract:
AbstractIt is known that among all plane convex domains of given constant width Reuleaux triangles have minimal and circular discs have maximal area. Some estimates are given concerning the following associated stability problem: If K is a convex domain of constant width w and if the area of K differs at most ∊ from the area of a Reuleaux triangle or a circular disc of width w, how close (in terms of the Hausdorff distance) is K to a Reuleaux triangle or a circular disc? Another result concerns the deviation of a convex domain M of diameter d from a convex domain of constant width if the perimeter of M is close to πd.
APA, Harvard, Vancouver, ISO, and other styles
9

YANG, YUNLONG, and DEYAN ZHANG. "DEFORMING A CONVEX DOMAIN INTO A DISK BY KLAIN’S CYCLIC REARRANGEMENT." Bulletin of the Australian Mathematical Society 97, no. 2 (February 20, 2018): 313–19. http://dx.doi.org/10.1017/s0004972717001113.

Full text
Abstract:
For a convex domain, we use Klain’s cyclic rearrangement to obtain a sequence of convex domains with increasing area and the same perimeter which converges to a disk. As a byproduct, we give a proof of the classical isoperimetric inequality in the plane.
APA, Harvard, Vancouver, ISO, and other styles
10

SINGH, I. V., B. K. MISHRA, and MOHIT PANT. "AN EFFICIENT PARTIAL DOMAIN ENRICHED ELEMENT-FREE GALERKIN METHOD CRITERION FOR CRACKS IN NONCONVEX DOMAINS." International Journal of Modeling, Simulation, and Scientific Computing 02, no. 03 (September 2011): 317–36. http://dx.doi.org/10.1142/s1793962311000475.

Full text
Abstract:
In the present work, an efficient partial domain, intrinsic, enriched element-free Galerkin criterion has been extended to simulate the cracks lying in nonconvex domains. According to this criterion, only a part of the domain near the crack tip has been enriched. A linear ramp function has been used to avoid the sudden truncation of the enrichment effect. Some cases of cracks lying in convex as well as in nonconvex domains have been solved by both full and partial domain enrichment criteria under plane stress conditions. For the cracks lying in convex domain, the results obtained by full domain enrichment criterion are found in good agreement with those obtained by partial domain enrichment criterion, whereas for cracks lying in nonconvex domain, the results obtained by full domain enrichment criterion are found to be misleading. The partial domain enrichment not only accurately simulates the cracks in nonconvex domains but also reduces the computational cost of the method.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Convex domain"

1

Chen, Jixin. "Some Domain Decomposition and Convex Optimization Algorithms with Applications to Inverse Problems." Doctoral thesis, Universite Libre de Bruxelles, 2018. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/271782.

Full text
Abstract:
Domain decomposition and convex optimization play fundamental roles in current computation and analysis in many areas of science and engineering. These methods have been well developed and studied in the past thirty years, but they still require further study and improving not only in mathematics but in actual engineering computation with exponential increase of computational complexity and scale. The main goal of this thesis is to develop some efficient and powerful algorithms based on domain decomposition method and convex optimization. The topicsstudied in this thesis mainly include two classes of convex optimization problems: optimal control problems governed by time-dependent partial differential equations and general structured convex optimization problems. These problems have acquired a wide range of applications in engineering and also demand a very high computational complexity. The main contributions are as follows: In Chapter 2, the relevance of an adequate inner loop starting point (as opposed to a sufficient inner loop stopping rule) is discussed in the context of a numerical optimization algorithm consisting of nested primal-dual proximal-gradient iterations. To study the optimal control problem, we obtain second order domain decomposition methods by combining Crank-Nicolson scheme with implicit Galerkin method in the sub-domains and explicit flux approximation along inner boundaries in Chapter 3. Parallelism can be easily achieved for these explicit/implicit methods. Time step constraints are proved to be less severe than that of fully explicit Galerkin finite element method. Based on the domain decomposition method in Chapter 3, we propose an iterative algorithm to solve an optimal control problem associated with the corresponding partial differential equation with pointwise constraint for the control variable in Chapter 4. In Chapter 5, overlapping domain decomposition methods are designed for the wave equation on account of prediction-correction" strategy. A family of unit decomposition functions allow reasonable residual distribution or corrections. No iteration is needed in each time step. This dissertation also covers convergence analysis from the point of view of mathematics for each algorithm we present. The main discretization strategy we adopt is finite element method. Moreover, numerical results are provided respectivelyto verify the theory in each chapter.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

Backlund, Ulf. "Envelopes of holomorphy for bounded holomorphic functions." Doctoral thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 1992. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-141155.

Full text
Abstract:
Some problems concerning holomorphic continuation of the class of bounded holo­morphic functions from bounded domains in Cn that are domains of holomorphy are solved. A bounded domain of holomorphy Ω in C2 with nonschlicht H°°-envelope of holomorphy is constructed and it is shown that there is a point in D for which Glea­son’s Problem for H°°(Ω) cannot be solved. Furthermore a proof of the existence of a bounded domain of holomorphy in C2 for which the volume of the H°°-envelope of holomorphy is infinite is given. The idea of the proof is to put a family of so-called ”Sibony domains” into the unit bidisk by a packing procedure and patch them together by thin neighbourhoods of suitably chosen curves. If H°°(Ω) is the Banach algebra of bounded holomorphic functions on a bounded domain Ω in Cn and if p is a point in Ω, then the following problem is known as Gleason’s Problem for Hoo(Ω) : Is the maximal ideal in H°°(Ω) consisting of functions vanishing at p generated by (z1 -p1) , ... ,   (zn - pn) ? A sufficient condition for solving Gleason’s Problem for 77°° (Ω) for all points in Ω is given. In particular, this condition is fulfilled by a convex domain Ω with Lip1+e boundary (0 < e < 1) and thus generalizes a theorem of S.L.Leibenson. It is also proved that Gleason’s Problem can be solved for all points in certain unions of two polydisks in C2. One of the ideas in the methods of proof is integration along specific polygonal lines. Certain properties of some open sets defined by global plurisubharmonic func­tions in Cn are studied. More precisely, the sets Du = {z e Cn : u(z) < 0} and Eh = {{z,w) e Cn X C : h(z,w) < 1} are considered where ti is a plurisubharmonic function of minimal growth and h≠0 is a non-negative homogeneous plurisubharmonic function. (That is, the functions u and h belong to the classes L(Cn) and H+(Cn x C) respectively.) It is examined how the fact that Eh and the connected components of Du are H°°-domains of holomorphy is related to the structure of the set of disconti­nuity points of the global defining functions and to polynomial convexity. Moreover it is studied whether these notions are preserved under a certain bijective mapping from L(Cn) to H+(Cn x C). Two counterexamples are given which show that polynomial convexity is not preserved under this bijection. It is also proved, for example, that if Du is bounded and if the set of discontinuity points of u is pluripolar then Du is of type H°°. A survey paper on general properties of envelopes of holomorphy is included. In particular, the paper treats aspects of the theory for the bounded holomorphic functions. The results for the bounded holomorphic functions are compared with the corresponding ones for the holomorphic functions.
digitalisering@umu.se
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fällström, Anders. "Algebras of bounded holomorphic functions." Doctoral thesis, Umeå universitet, Institutionen för matematik, teknik och naturvetenskap, 1994. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-114744.

Full text
Abstract:
Some problems concerning the algebra of bounded holomorphic functions from bounded domains in Cn are solved. A bounded domain of holomorphy Q in C2 with nonschlicht i7°°- envelope of holomorphy is constructed and it is shown that there is a point in Q for which Gleason’s Problem for H°°(Q) cannot be solved. If A(f2) is the Banach algebra of functions holomorphic in the bounded domain Q in Cn and continuous on the boundary and if p is a point in Q, then the following problem is known as Gleason’s Problem for A(Q) : Is the maximal ideal in A(Q) consisting of functions vanishing at p generated by (Zl ~Pl) , ■■■ , (Zn - Pn) ? A sufficient condition for solving Gleason’s Problem for A(Q) for all points in Q is given. In particular, this condition is fulfilled by a convex domain Q with Lipi+£-boundary (0 < e < 1) and thus generalizes a theorem of S.L.Leibenzon. One of the ideas in the methods of proof is integration along specific polygonal lines. If Gleason’s Problem can be solved in a point it can be solved also in a neighbourhood of the point. It is shown, that the coefficients in this case depends holomorphically on the points. Defining a projection from the spectrum of a uniform algebra of holomorphic functions to Cn, one defines the fiber in the spectrum over a point as the elements in the spectrum that projects on that point. Defining a kind of maximum modulus property for domains in Cn, some problems concerning the fibers and the number of elements in the fibers in certain algebras of bounded holomorphic functions are solved. It is, for example, shown that the set of points, over which the fibers contain more than one element is closed. A consequence is also that a starshaped domain with the maximum modulus property has schlicht /y°°-envelope of holomorphy. These kind of problems are also connected with Gleason’s problem. A survey paper on general properties of algebras of bounded holomorphic functions of several variables is included. The paper, in particular, treats aspects connecting iy°°-envelopes of holomorphy and some areas in the theory of uniform algebras.

Diss. (sammanfattning) Umeå : Umeå universitet, 1994, härtill 6 uppsatser


digitalisering@umu
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Convex domain"

1

Conley, John P. Bargaining on a non-convex domain. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Convex analysis. Boca Raton, FL: CRC Press, Taylor & Francis Group, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Convex analysis. Princeton, N.J: Princeton University Press, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Undergraduate convexity: From Fourier and Motzkin to Kuhn and Tucker. Singapore: World Scientific, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Convex domain"

1

Ahadi, Arash, Amirhossein Mozafari, and Alireza Zarei. "Touring Convex Polygons in Polygonal Domain Fences." In Combinatorial Optimization and Applications, 61–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71147-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Górniak, P., and W. Bandurski. "Time Domain Transition Zone Diffraction on Convex Obstacles." In Ultra-Wideband, Short Pulse Electromagnetics 9, 37–45. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-77845-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tamura, Akihisa. "A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization." In Integer Programming and Combinatorial Optimization, 21–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47867-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yim, Changhoon. "An Efficient Post-processing Using DCT Domain Projections Onto Convex Sets." In Lecture Notes in Computer Science, 63–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11867586_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bland, John, Dan Burns, and Kin-Kwan Leung. "A Twistor Transform for the Kobayashi Metric on a Convex Domain." In Springer Proceedings in Mathematics & Statistics, 55–72. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1672-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Antes, H., and O. von Estorff. "The Effect of Non-Convex Boundaries on Time Domain Boundary Element Solutions." In Mathematical and Computational Aspects, 305–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-662-21908-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fornasari, N., G. Gazzaniga, S. Rovida, and G. Sacchi. "Domain decomposition techniques: Analysis of a parallel implementation on hp-convex exemplar systems." In High-Performance Computing and Networking, 1000–1001. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0031682.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Seladji, Yassamine, and Olivier Bouissou. "Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools." In Lecture Notes in Computer Science, 149–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35873-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Convex domain"

1

Morcos, Amir, Aaron West, and Brian Maguire. "Multi-agent reinforcement learning for convex optimization." In Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications III, edited by Tien Pham, Latasha Solomon, and Myron E. Hohil. SPIE, 2021. http://dx.doi.org/10.1117/12.2585624.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Hang, Afshin Abdi, and Faramarz Fekri. "Compressive Sensing with a Multiple Convex Sets Domain." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ishaq, Rizwan, Muhammad Shahid, Benny Lovstrom, Begona Garcia Zapirain, and Ingvar Claesson. "Modulation frequency domain adaptive gain equalizer using convex optimization." In 2012 6th International Conference on Signal Processing and Communication Systems (ICSPCS 2012). IEEE, 2012. http://dx.doi.org/10.1109/icspcs.2012.6508019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shende, A., M. J. Bays, and D. J. Stilwell. "Stochastic target interception in non-convex domain using MILP." In 2012 American Control Conference - ACC 2012. IEEE, 2012. http://dx.doi.org/10.1109/acc.2012.6314859.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Zhipeng, Zhenyu Zhao, Tingjin Luo, Wenjing Yang, Yongjun Zhang, and Yuhua Tang. "Non-Convex Transfer Subspace Learning for Unsupervised Domain Adaptation." In 2019 IEEE International Conference on Multimedia and Expo (ICME). IEEE, 2019. http://dx.doi.org/10.1109/icme.2019.00254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Iqbal, Naveed, Murwan Bashir, and Azzedine Zerguine. "Convex Combination of Transform Domain LMS and Sparse LMS." In 2018 52nd Asilomar Conference on Signals, Systems, and Computers. IEEE, 2018. http://dx.doi.org/10.1109/acssc.2018.8645476.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aleksei, Gerasimov, and Miroslav Vořechovský. "Estimation of Sampled Domain Probability using Convex Hull Approximation." In Proceedings of the 31st European Safety and Reliability Conference. Singapore: Research Publishing Services, 2021. http://dx.doi.org/10.3850/978-981-18-2016-8_683-cd.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Saikaly, P., and N. Omont. "Convex modeling of the steady state domain of power generators." In 2017 IEEE Power & Energy Society General Meeting (PESGM). IEEE, 2017. http://dx.doi.org/10.1109/pesgm.2017.8273868.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Feng, Han, and Javad Lavaei. "A Convex Approximation of Optimal Distributed Controller in Frequency Domain." In 2018 IEEE Conference on Decision and Control (CDC). IEEE, 2018. http://dx.doi.org/10.1109/cdc.2018.8618977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Andreev, A. B., M. R. Racheva, Michail D. Todorov, and Christo I. Christov. "Lower Bounds for Eigenvalues by Nonconforming FEM on Convex Domain." In APPLICATION OF MATHEMATICS IN TECHNICAL AND NATURAL SCIENCES: Proceedings of the 2nd International Conference. AIP, 2010. http://dx.doi.org/10.1063/1.3526633.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Convex domain"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

Peterson, A. S., and 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, April 1991. http://dx.doi.org/10.21236/ada248117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Saint-Andre, P., and J. Hodges. Representation and Verification of Domain-Based Application Service Identity within Internet Public Key Infrastructure Using X.509 (PKIX) Certificates in the Context of Transport Layer Security (TLS). RFC Editor, March 2011. http://dx.doi.org/10.17487/rfc6125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
7

Jones, Robert M., Alison K. Thurston, Robyn A. Barbato, and Eftihia V. Barnes. Evaluating the Conductive Properties of Melanin-Producing Fungus, Curvularia lunata, after Copper Doping. Engineer Research and Development Center (U.S.), November 2020. http://dx.doi.org/10.21079/11681/38641.

Full text
Abstract:
Melanins are pigmented biomacromolecules found throughout all domains of life. Of melanins’ many unique properties, their malleable electrically conductive properties and their ability to chelate could allow them to serve as material for bioelectronics. Studies have shown that sheets or pellets of melanin conduct low levels of electricity; however, electrical conductance of melanin within a cellular context has not been thoroughly investigated. In addition, given the chelating properties of melanin, it is possible that introducing traditionally con-ductive metal ions could improve the conductivity. Therefore, this study investigated the conductive properties of melanized cells and how metal ions change these. We measured the con-ductivity of pulverized Curvularia lunata, a melanized filamentous fungi, with and without the addition of copper ions. We then com-pared the conductivity measurements of the fungus to chemically synthesized, commercially bought melanin. Our data showed that the conductivity of the melanized fungal biomass was an order of magnitude higher when grown in the presence of copper. However, it was two orders of magnitude less than that of synthetic melanin. Interestingly, conductance was measurable despite additional constituents in the pellet that may inhibit conductivity. Therefore, these data show promising results for using melanized cells to carry electrical signals.
APA, Harvard, Vancouver, ISO, and other styles
8

Yan, Yujie, and Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, May 2021. http://dx.doi.org/10.17760/d20410114.

Full text
Abstract:
Recent advances in visual sensing technology have gained much attention in the field of bridge inspection and management. Coupled with advanced robotic systems, state-of-the-art visual sensors can be used to obtain accurate documentation of bridges without the need for any special equipment or traffic closure. The captured visual sensor data can be post-processed to gather meaningful information for the bridge structures and hence to support bridge inspection and management. However, state-of-the-practice data postprocessing approaches require substantial manual operations, which can be time-consuming and expensive. The main objective of this study is to develop methods and algorithms to automate the post-processing of the visual sensor data towards the extraction of three main categories of information: 1) object information such as object identity, shapes, and spatial relationships - a novel heuristic-based method is proposed to automate the detection and recognition of main structural elements of steel girder bridges in both terrestrial and unmanned aerial vehicle (UAV)-based laser scanning data. Domain knowledge on the geometric and topological constraints of the structural elements is modeled and utilized as heuristics to guide the search as well as to reject erroneous detection results. 2) structural damage information, such as damage locations and quantities - to support the assessment of damage associated with small deformations, an advanced crack assessment method is proposed to enable automated detection and quantification of concrete cracks in critical structural elements based on UAV-based visual sensor data. In terms of damage associated with large deformations, based on the surface normal-based method proposed in Guldur et al. (2014), a new algorithm is developed to enhance the robustness of damage assessment for structural elements with curved surfaces. 3) three-dimensional volumetric models - the object information extracted from the laser scanning data is exploited to create a complete geometric representation for each structural element. In addition, mesh generation algorithms are developed to automatically convert the geometric representations into conformal all-hexahedron finite element meshes, which can be finally assembled to create a finite element model of the entire bridge. To validate the effectiveness of the developed methods and algorithms, several field data collections have been conducted to collect both the visual sensor data and the physical measurements from experimental specimens and in-service bridges. The data were collected using both terrestrial laser scanners combined with images, and laser scanners and cameras mounted to unmanned aerial vehicles.
APA, Harvard, Vancouver, ISO, and other styles
9

Roberts, Tony, and Kevin Hernandez. Open Data for Agriculture and Nutrition: A Literature Review and Proposed Conceptual Framework. Institute of Development Studies (IDS), January 2021. http://dx.doi.org/10.19088/ids.2021.018.

Full text
Abstract:
This paper begins by locating the Global Open Data for Agriculture and Nutrition project (GODAN) in the context of wider debates in the open data movement by first reviewing the literature on open data and open data for agriculture and nutrition (ODAN). The review identifies a number of important gaps and limitations in the existing literature. There has been no independent evaluation of who most benefits or who is being left behind regarding ODAN. There has been no independent evaluation of gender or diversity in ODAN or of the development outcomes or impacts of ODAN. The existing research on ODAN is over-reliant on key open data organisations and open data insiders who produce most of the research. This creates bias in the data and analysis. The authors recommend that these gaps are addressed in future research. The paper contributes a novel conceptual ‘SCOTA’ framework for analysing the barriers to and drivers of open data adoption, which could be readily applied in other domains. Using this framework to review the existing literature highlights the fact that ODAN research and practice has been predominantly supply-side focused on the production of open data. The authors argue that if open data is to ‘leave no one behind’, greater attention now needs to be paid to understanding the demand-side of the equation and the role of intermediaries. The paper argues that there is a compelling need to improve the participation of women, people living with disabilities, and other marginalised groups in all aspects of open data for agriculture and nutrition. The authors see a need for further research and action to enhance the capabilities of marginalised people to make effective use of open data. The paper concludes with the recommendation that an independent strategic review of open data in agriculture and nutrition is overdue. Such a review should encompass the structural factors shaping the process of ODAN; include a focus on the intermediary and demand-side processes; and identify who benefits and who is being left behind.
APA, Harvard, Vancouver, ISO, and other styles
10

A context analysis of the network management domain:. Gaithersburg, MD: National Institute of Standards and Technology, 1993. http://dx.doi.org/10.6028/nist.ir.5309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Convex domain' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography