Relevant bibliographies by topics / Regularity

Contents

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

Academic literature on the topic 'Regularity'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 June 2024

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 'Regularity.'

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 "Regularity"

1

Arutyunov, Aram V., Evgeniy R. Avakov, and Alexey F. Izmailov. "Directional Regularity and Metric Regularity." SIAM Journal on Optimization 18, no. 3 (January 2007): 810–33. http://dx.doi.org/10.1137/060651616.

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

Cibulka, R., J. Preininger, and T. Roubal. "On uniform regularity and strong regularity." Optimization 68, no. 2-3 (November 19, 2018): 549–77. http://dx.doi.org/10.1080/02331934.2018.1547383.

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

Raina, Sehar Shakeel, and A. K. Das. "Some New Variants of Relative Regularity via Regularly Closed Sets." Journal of Mathematics 2021 (May 24, 2021): 1–6. http://dx.doi.org/10.1155/2021/7726577.

Full text
Abstract:
Every topological property can be associated with its relative version in such a way that when smaller space coincides with larger space, then this relative property coincides with the absolute one. This notion of relative topological properties was introduced by Arhangel’skii and Ganedi in 1989. Singal and Arya introduced the concepts of almost regular spaces in 1969 and almost completely regular spaces in 1970. In this paper, we have studied various relative versions of almost regularity, complete regularity, and almost complete regularity. We investigated some of their properties and established relationships of these spaces with each other and with the existing relative properties.
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Nam Kyun, and Yang Lee. "On Strong π-Regularity and π-Regularity." Communications in Algebra 39, no. 11 (November 2011): 4470–85. http://dx.doi.org/10.1080/00927872.2010.524184.

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

Tabuada, Gonçalo. "$E_n$-regularity implies $E_{n-1}$-regularity." Documenta Mathematica 19 (2014): 121–39. http://dx.doi.org/10.4171/dm/442.

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

Bosch, Carlos, and Jan Kučera. "On regularity of inductive limits." Czechoslovak Mathematical Journal 45, no. 1 (1995): 171–73. http://dx.doi.org/10.21136/cmj.1995.128504.

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

Šlapal, Josef. "On strong regularity of relations." Mathematica Bohemica 119, no. 2 (1994): 151–55. http://dx.doi.org/10.21136/mb.1994.126076.

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

Jean-Christophe YOCCOZ and Pierre BERGER. "Strong regularity." Astérisque 410 (2019): 1–180. http://dx.doi.org/10.24033/ast.1076.

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

Perlak, Danuta, Laurie Beth Feldman, and Gonia Jarema. "Defining regularity." Mental Lexicon 3, no. 2 (September 17, 2008): 239–58. http://dx.doi.org/10.1075/ml.3.2.04per.

Full text
Abstract:
In the present study we use a cross-modal (auditory-visual) priming paradigm to examine the influence on word recognition of phonological/orthographic variation between morphologically related nouns. We exploit particular characteristics of a highly inflected language, Polish, in which consonantal stem-boundary (portre/tɕ/e-portre/t/ ‘portrait’) and vocalic stem-internal (obr/ɔ/tem-obr/u/t ‘turn’) alternations occur. The impact of morphological relatedness was measured against an orthographic and an unrelated baseline condition. Invariant magnitudes of morphological facilitation arose across the two baseline conditions. More importantly, non-alternating as well as alternating morphological relatives showed robust facilitation. When comparing items featuring predictable stem-boundary change only and those featuring the stem-boundary and vocalic stem-internal changes, effects of morphological relatedness did not interact with degree of phonological/orthographic variation. We argue that morphological facilitation survives accross styles of alternation that vary from language to language.
APA, Harvard, Vancouver, ISO, and other styles
10

Tang, Weng Hong. "REGULARITY REFORMULATED." Episteme 9, no. 4 (December 2012): 329–43. http://dx.doi.org/10.1017/epi.2012.23.

Full text
Abstract:
AbstractThis paper focuses on the view that rationality requires that our credences be regular. I go through different formulations of the requirement, and show that they face several problems. I then formulate a version of the requirement that solves most of, if not all, these problems. I conclude by showing that an argument thought to support the requirement as traditionally formulated actually does not; if anything, the argument, slightly modified, supports my version of the requirement.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Regularity"

1

Imre, Voros. "Functional calculi and maximal regularity." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510255.

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

Shawe-Taylor, John Stewart. "Regularity and transitivity in graphs." Thesis, Royal Holloway, University of London, 1985. http://repository.royalholloway.ac.uk/items/52cb738e-0daa-426a-afe1-b108678cccc4/1/.

Full text
Abstract:
Graphs with high regularity and transitivity conditions are studied. The first graphs considered are graphs where each vertex has an intersection array (possibly differing from that of other vertices). These graphs are called distance-regularised and are shown to be distance-regular or bipartite with each bipartition having the same intersection array. The latter graphs are called distance-biregular. This leads to the study of distance-biregular graphs. The derived graphs of a distance-biregular graph are shown to be distance-regular and the notion of feasibility for a distance-regular graph is extended to the biregular case. The study of the intersection arrays of distance-biregular graphs is concluded with a bound on the diameter in terms of the girth and valencies. Special classes of distance-biregular graphs are also studied. Distance-biregular graphs with 2-valent vertices are shown to be the subdivision graphs of cages. Distance-biregular graphs with one derived graph complete and the other strongly-regular are characterised according to the minimum eigenvalue of the strongly-regular graph. Distance-biregular graphs with prescribed derived graph are classified in cases where the derived graph is from some classes of classical distance-regular graphs. A graph theoretic proof of part of the Praeger, Saxl and Yokoyama theorem is given. Finally imprimitivity in distance-biregular graphs is studied and the Praeger, Saxl and Yokoyama theorem is used to show that primitive non-regular distance-bitransitive graphs have almost simple automorphism groups. Many examples of distance-biregular and distance-bitransitive graphs are given.
APA, Harvard, Vancouver, ISO, and other styles
3

Fang, Yangqin. "Minimal sets, existence and regularity." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112191/document.

Full text
Abstract:
Cette thèse s’intéresse principalement à l’existence et à la régularité desensembles minimaux. On commence par montrer, dans le chapitre 3, que le problème de Plateau étudié par Reifenberg admet au moins une solution. C’est-à-dire que, si l’onse donne un ensemble compact B⊂R^n et un sous-groupe L du groupe d’homologie de Čech H_(d-1) (B;G) de dimension (d-1) sur un groupe abelien G, on montre qu’il existe un ensemble compact E⊃B tel que L est contenu dans le noyau de l’homomorphisme H_(d-1) (B;G)→H_(d-1) (E;G) induit par l’application d’inclusion B→E, et pour lequel la mesure de Hausdorff H^d (E∖B) est minimale (sous ces contraintes). Ensuite, on montre au chapitre 4, que pour tout ensemble presque minimal glissant E de dimension 2, dans un domaine régulier Σ ressemblant localement à un demi espace, associé à la frontière glissante ∂Σ, et tel que E⊃∂Σ, il se trouve qu’à la frontière E est localement équivalent, par un homéomorphisme biHöldérien qui préserve la frontière, à un cône minimal glissant contenu dans un demi plan Ω, avec frontière glissante ∂Ω. De plus les seuls cônes minimaux possibles dans ce cas sont ∂Ω seul, ou son union avec un cône de type P_+ ou Y_+
This thesis focuses on the existence and regularity of minimal sets. First we show, in Chapter 3, that there exists (at least) a minimizerfor Reifenberg Plateau problems. That is, Given a compact set B⊂R^n, and a subgroup L of the Čech homology group H_(d-1) (B;G) of dimension (d-1)over an abelian group G, we will show that there exists a compact set E⊃B such that L is contained in the kernel of the homomorphism H_(d-1) (B;G)→H_(d-1) (E;G) induced by the natural inclusion map B→E, and such that the Hausdorff measure H^d (E∖B) is minimal under these constraints. Next we will show, in Chapter 4, that if E is a sliding almost minimal set of dimension 2, in a smooth domain Σ that looks locally like a half space, and with sliding boundary , and if in addition E⊃∂Σ, then, near every point of the boundary ∂Σ, E is locally biHölder equivalent to a sliding minimal cone (in a half space Ω, and with sliding boundary ∂Ω). In addition the only possible sliding minimal cones in this case are ∂Ω or the union of ∂Ω with a cone of type P_+ or Y_+
APA, Harvard, Vancouver, ISO, and other styles
4

Döller, Christian. "The neural bases of regularity learning /." Saarbrücken, 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=974108200.

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

Pons, Solé Marc. "Layout regularity for design and manufacturability." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/96983.

Full text
Abstract:
In nowadays nanometer technology nodes, the semiconductor industry has to deal with the new challenges associated to technology scaling. On one hand, process developers face increasing manufacturing cost and variability, but also decreasing manufacturing yield. On the other hand, circuit designers and electronic design automation (EDA) developers have to reduce design turnaround time and provide the tools to cope with increasing design complexity and reduce the time-to-market. In this scenario, closer collaboration between all the actors involved is required. New approaches considering both design and manufacturing need to be explored. These are the so called design for manufacturability (DFM) techniques. A DFM trend that is becoming dominant is to make circuit layouts more regular and repetitive. The regular layout fabrics are based on the configuration of a simplied mask set, therefore reducing the manufacturing cost. Moreover, a reduced number of layout patterns is used, allowing better process variability control and optimization. Hence, regularity reduces layout complexity and therefore design complexity, allowing faster time-to-market. In this thesis, we explore forcing maximum layout regularity focusing on future technology nodes, with increasing design and manufacturability issues, where we expect layout regularity to be mandatory. With this objective, we have developed a new regular layout fabric called Via-Configurable Transistor Array (VCTA). The physical design is fully explained involving layout and geometrical considerations for transistors and interconnects. Initially, VCTA layouts developed manually have been evaluated in terms of manufacturability, but also in terms of area, energy and delay. For digital design, 32-bit binary adders designed with VCTA have been compared to standard cell layouts. For analog design, a delay-locked loop design using VCTA has been compared to its full custom version. We have also developed a physical synthesis tool that allows us to obtain VCTA circuit layouts in an automated way. Developing our own automation tool lets us controlling all the decisions made during the physical design flow to ensure that maximum layout regularity is respected. In this case the work is based on several algorithms, for instance for routing, that we have oriented to the area optimization of the layouts. Finally, in order to demonstrate the benefits of layout regularity, we have proposed a new layout regularity metric called Fixed Origin Corner Square Inspection (FOCSI). It is based on the geometrical inspection of the patterns in the layouts and it allows designers to compare regularity of designs but also how their regularity will impact their manufacturability. The FOCSI layout analysis tool can be used to optimize manufacturability.
APA, Harvard, Vancouver, ISO, and other styles
6

Ouhnana, Marouane. "Visual after-effect of perceived regularity." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=110475.

Full text
Abstract:
Aim: Regular repeating patterns are prominent features in a visual scene. Here I consider whether regularity is an adaptable feature that produces a subsequent after-effect and whether a first- or second-order process mediates that after-effect. Method: Stimuli consisted of a 7 by 7 arrangement of elements on a baseline grid. The position of each element was randomly jittered from its baseline position by an amount that determined its degree of pattern irregularity. The elements of the pattern consisted of dark Gaussian blobs (GB), difference of Gaussians (DOG) or random binary patterns (RBP). Observers adapted for 60 seconds to a pair of patterns above and below fixation with a different degree of regularity, then adjusted the relative degree of regularity of two subsequently presented test patterns. The size of the after-effect at the point of subjective equality (PSE) was given by the baseline removed difference in regularity at the PSE or log ratio of the physical element jitter of the two test patterns at the PSE. Results: PSEs revealed that regularity is an adaptable feature that produces a unidirectional after-effect; specifically that adaptation only causes test patterns to appear less regular. The after-effect displayed transfer from GB adaptors to both DOG and RB test patterns and from DOG and (RBP) adaptors to GB patterns. Conclusion: Pattern regularity is an adaptable feature in vision, which produces a novel unidirectional after-effect I have termed Regularity After-Effect, or RAE. I propose second-order spatial-frequency channels as candidate mechanisms of regularity processing.
Objectif: Les motifs réguliers répétitifs sont des caractéristiques de premier plan dans la scène visuelle. Cette communication a comme objectif de découvrir si la régularité est une caractéristique adaptable du système visuel produisant un effet consécutif et si cet effet-consécutif est lié à un processus de premier- ou de second-ordre. Méthode: Les stimuli étaient constitués en un arrangement 7 par 7 éléments sur une grille. La position de chaque élément a été giguer au hasard à partir de sa position d'origine avec une valeur qui détermine son degré d'irrégularité. Les éléments qui constituent chaque grille pouvaient être des blobs de Gaussiennes (GB), des différence de Gaussiennes (DOG) ou de motif binaire aléatoire (RBP). Les participants ont été adaptés pour 60 secondes à une paire de motifs placée de part et d'autre d'un point de fixation ou chaque motif avait un degré différent de régularité. Les participants devaient ajuster le degré relatif de régularité de deux motifs présentés après. La taille de l'effet-consécutif est obtenue par la différence de régularité au point subjectif d'égalité soustrait à la régularité mesurée entre les deux motifs test ou par le logarithme du ratio de la différence de régularité entre les deux motifs test au point subjectif d'égalité. Résultats: Les point-subjectif d'égalité mesurée ont montrées que la régularité est une caractéristique adaptable qui produit un effet-consécutif unidirectionnel, plus précisément que les motifs sont perçus comme plus irréguliers après adaptation. On a observe un transfert à partir des stimuli d'élément GB a des motifs de test RBP et DOG et un transfert a partir des stimuli DOG et RBP vers des test de GB. Conclusion: La régularité est un élément du système visuel adaptable, produisant effet-consécutif unidirectionnel nouveau que appelé l'effet consécutif de la régularité. Je propose les canaux de fréquence-spatial de second-ordre comme mécanisme candidat au traitement de la régularité.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhao, Yufei. "Sparse regularity and relative Szemerédi theorems." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99060.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 171-179).
We extend various fundamental combinatorial theorems and techniques from the dense setting to the sparse setting. First, we consider Szemerédi regularity lemma, a fundamental tool in extremal combinatorics. The regularity method, in its original form, is effective only for dense graphs. It has been a long standing problem to extend the regularity method to sparse graphs. We solve this problem by proving a so-called "counting lemma," thereby allowing us to apply the regularity method to relatively dense subgraphs of sparse pseudorandom graphs. Next, by extending these ideas to hypergraphs, we obtain a simplification and extension of the key technical ingredient in the proof of the celebrated Green-Tao theorem, which states that there are arbitrarily long arithmetic progressions in the primes. The key step, known as a relative Szemerédi theorem, says that any positive proportion subset of a pseudorandom set of integers contains long arithmetic progressions. We give a simple proof of a strengthening of the relative Szemerédi theorem, showing that a much weaker pseudorandomness condition is sufficient. Finally, we give a short simple proof of a multidimensional Szemerédi theorem in the primes, which states that any positive proportion subset of Pd (where P denotes the primes) contains constellations of any given shape. This has been conjectured by Tao and recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler.
by Yufei Zhao.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Onwunta, Akwum A. "On the regularity of refinable functions." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2881.

Full text
Abstract:
Thesis (MSc (Mathematical Sciences. Physical and Mathematical Analysis))--University of Stellenbosch, 2006.
This work studies the regularity (or smoothness) of continuous finitely supported refinable functions which are mainly encountered in multiresolution analysis, iterative interpolation processes, signal analysis, etc. Here, we present various kinds of sufficient conditions on a given mask to guarantee the regularity class of the corresponding refinable function. First, we introduce and analyze the cardinal B-splines Nm, m ∈ N. In particular, we show that these functions are refinable and belong to the smoothness class Cm−2(R). As a generalization of the cardinal B-splines, we proceed to discuss refinable functions with positive mask coefficients. A standard result on the existence of a refinable function in the case of positive masks is quoted. Following [13], we extend the regularity result in [25], and we provide an example which illustrates the fact that the associated symbol to a given positive mask need not be a Hurwitz polynomial for its corresponding refinable function to be in a specified smoothness class. Furthermore, we apply our regularity result to an integral equation. An important tool for our work is Fourier analysis, from which we state some standard results and give the proof of a non-standard result. Next, we study the H¨older regularity of refinable functions, whose associated mask coefficients are not necessarily positive, by estimating the rate of decay of their Fourier transforms. After showing the embedding of certain Sobolev spaces into a H¨older regularity space, we proceed to discuss sufficient conditions for a given refinable function to be in such a H¨older space. We specifically express the minimum H¨older regularity of refinable functions as a function of the spectral radius of an associated transfer operator acting on a finite dimensional space of trigonometric polynomials. We apply our Fourier-based regularity results to the Daubechies and Dubuc-Deslauriers refinable functions, as well as to a one-parameter family of refinable functions, and then compare our regularity estimates with those obtained by means of a subdivision-based result from [28]. Moreover, we provide graphical examples to illustrate the theory developed.
APA, Harvard, Vancouver, ISO, and other styles
9

Barber, Ben. "Partition regularity and other combinatorial problems." Thesis, University of Cambridge, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648544.

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

Aleksanyan, Gohar. "Regularity results in free boundary problems." Doctoral thesis, KTH, Matematik (Avd.), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-195178.

Full text
Abstract:
This thesis consists of three scientific papers, devoted to the regu-larity theory of free boundary problems. We use iteration arguments to derive the optimal regularity in the optimal switching problem, and to analyse the regularity of the free boundary in the biharmonic obstacle problem and in the double obstacle problem.In Paper A, we study the interior regularity of the solution to the optimal switching problem. We derive the optimal C1,1-regularity of the minimal solution under the assumption that the zero loop set is the closure of its interior.In Paper B, assuming that the solution to the biharmonic obstacle problem with a zero obstacle is suÿciently close-to the one-dimensional solution (xn)3+, we derive the C1,-regularity of the free boundary, under an additional assumption that the noncoincidence set is an NTA-domain.In Paper C we study the two-dimensional double obstacle problem with polynomial obstacles p1 p2, and observe that there is a new type of blow-ups that we call double-cone solutions. We investigate the existence of double-cone solutions depending on the coeÿcients of p1, p2, and show that if the solution to the double obstacle problem with obstacles p1 = −|x|2 and p2 = |x|2 is close to a double-cone solution, then the free boundary is a union of four C1,-graphs, pairwise crossing at the origin.

QC 20161103

APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Regularity"

1

Berger, Pierre. Strong regularity. Paris: Société Mathématique de France, 2019.

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

Beck, Lisa. Elliptic Regularity Theory. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27485-0.

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

Dierkes, Ulrich, Stefan Hildebrandt, and Anthony J. Tromba. Regularity of Minimal Surfaces. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11700-8.

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

Traugott, Elizabeth Closs. Regularity in semantic change. Cambridge: Cambridge University Press, 2002.

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

Traugott, Elizabeth Closs. Regularity in semantic change. Cambridge: Cambridge University Press, 2002.

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

Padula, Mariarosaria, and Luisa Zanghirati, eds. Hyperbolic Problems and Regularity Questions. Basel: Birkhäuser Basel, 2007. http://dx.doi.org/10.1007/978-3-7643-7451-8.

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

Mingione, Giuseppe, ed. Topics in Modern Regularity Theory. Pisa: Edizioni della Normale, 2012. http://dx.doi.org/10.1007/978-88-7642-427-4.

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

Bounkhel, Messaoud. Regularity Concepts in Nonsmooth Analysis. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-1019-5.

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

Mingione, Giuseppe. Topics in Modern Regularity Theory. Pisa: Edizioni della Normale, 2012.

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

Allen, John A. Knowledge and regularity in planning. Moffett Field, Calif: NASA, Ames Research Center, Artificial Intelligence Research Branch, 1992.

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

Book chapters on the topic "Regularity"

1

Simonnet, Michel. "Regularity." In Measures and Probabilities, 166–71. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-4012-9_8.

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

Hackbusch, Wolfgang. "Regularity." In Elliptic Differential Equations, 263–310. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54961-2_9.

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

Hackbusch, Wolfgang. "Regularity." In Elliptic Differential Equations, 208–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-11490-8_9.

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

Shapira, Yair. "Mesh Regularity." In Linear Algebra and Group Theory for Physicists and Engineers, 347–58. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17856-7_11.

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

Cegrell, Urban. "Outer Regularity." In Capacities in Complex Analysis, 11–21. Wiesbaden: Vieweg+Teubner Verlag, 1988. http://dx.doi.org/10.1007/978-3-663-14203-4_3.

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

de Luca, Aldo, and Stefano Varricchio. "Regularity Conditions." In Finiteness and Regularity in Semigroups and Formal Languages, 179–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-59849-4_5.

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

Kechris, Alexander S. "Regularity Properties." In Graduate Texts in Mathematics, 226–33. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4190-4_29.

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

Amann, Herbert. "Maximal Regularity." In Linear and Quasilinear Parabolic Problems, 87–191. Basel: Birkhäuser Basel, 1995. http://dx.doi.org/10.1007/978-3-0348-9221-6_4.

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

Pears, David. "Linguistic Regularity." In Interactive Wittgenstein, 171–81. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-1-4020-9909-0_6.

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

Lindqvist, Peter. "Regularity Theory." In SpringerBriefs in Mathematics, 17–28. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14501-9_3.

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

Conference papers on the topic "Regularity"

1

Wang, Yingzi, Nicholas Jing Yuan, Defu Lian, Linli Xu, Xing Xie, Enhong Chen, and Yong Rui. "Regularity and Conformity." In KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2783258.2783350.

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

Geiser, Eveline, and Stefanie Shattuck-Hufnagel. "Temporal regularity in speech perception - is regularity beneficial or deleterious?" In 162nd Meeting Acoustical Society of America. Acoustical Society of America, 2012. http://dx.doi.org/10.1121/1.4707937.

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

Chen, Wenjuan, Hongchuan Yu, Minyong Shi, and Qingjie Sun. "Regularity-Based Caricature Synthesis." In 2009 International Conference on Management and Service Science (MASS). IEEE, 2009. http://dx.doi.org/10.1109/icmss.2009.5305380.

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

Hietarinta, Jarmo. "Regularity of Difference Equations." In Proceedings of the 9th International Conference. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812701572_0017.

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

Vardi, Moshe Y. "A call to regularity." In the Paris C. Kanellakis memorial workshop. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/778348.778352.

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

OLVER, PETER J., and JUHA POHJANPELTO. "REGULARITY OF PSEUDOGROUP ORBITS." In Proceedings of the International Conference on SPT 2004. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812702142_0030.

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

Damkat, Chris, and Paul M. Hofman. "Efficient local texture regularity estimation." In ACM SIGGRAPH 2008 posters. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1400885.1400956.

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

Kim, A. A., V. M. Alexeenko, S. S. Kondratiev, and V. A. Sinebrukhov. "Statistical Regularity in LTD Technology." In 2018 20th International Symposium on High-Current Electronics (ISHCE). IEEE, 2018. http://dx.doi.org/10.1109/ishce.2018.8521228.

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

Venkataraman, Vinay, Ioannis Vlachos, and Pavan Turaga. "Dynamical Regularity for Action Analysis." In British Machine Vision Conference 2015. British Machine Vision Association, 2015. http://dx.doi.org/10.5244/c.29.67.

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

Schweikardt, Nicole, and Luc Segoufin. "Addition-Invariant FO and Regularity." In 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.16.

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

Reports on the topic "Regularity"

1

Zarnowitz, Victor. The Regularity of Business Cycles. Cambridge, MA: National Bureau of Economic Research, September 1987. http://dx.doi.org/10.3386/w2381.

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

Barbara Lee Keyfitz. Multidimensional Conservation Laws and Low Regularity Solutions. Office of Scientific and Technical Information (OSTI), June 2007. http://dx.doi.org/10.2172/928353.

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

Guo, Benqi, and Ivo Babuska. Regularity of the Solutions for Elliptic Problems on Nonsmooth Domains in R3. Part 2: Regularity in Neighborhoods of Edges. Fort Belvoir, VA: Defense Technical Information Center, March 1995. http://dx.doi.org/10.21236/ada301745.

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

Guo, B. Q., and I. Babuska. On the Regularity of Elasticity Problems with Piecewise Analytic Data. Fort Belvoir, VA: Defense Technical Information Center, July 1992. http://dx.doi.org/10.21236/ada260346.

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

Symes, Wiliam W. Trace Regularity for a Second Order Hyperbolic Equation With Nonsmooth Coefficients. Fort Belvoir, VA: Defense Technical Information Center, January 1991. http://dx.doi.org/10.21236/ada452695.

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

Manzini, Gianmarco. The Mimetic Finite Element Method and the Virtual Element Method for elliptic problems with arbitrary regularity. Office of Scientific and Technical Information (OSTI), July 2012. http://dx.doi.org/10.2172/1046508.

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

Constantin, Petre. Note on Loss of Regularity for Solutions of the 3-D Incompressible Euler and Related Equations. Fort Belvoir, VA: Defense Technical Information Center, November 1985. http://dx.doi.org/10.21236/ada163632.

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

Guo, Benqi, and I. Babuska. Regularity of the Solutions for Elliptic Problems on Nonsmooth Domains in R3. Part 1. Countably Normed Spaces on Polyhedral Domains. Fort Belvoir, VA: Defense Technical Information Center, March 1995. http://dx.doi.org/10.21236/ada301094.

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

De Tolentino, Marianne, and Sara Hermann. Inside and Out: Recent Trends in the Arts of the Dominican Republic. Inter-American Development Bank, November 2008. http://dx.doi.org/10.18235/0006413.

Full text
Abstract:
For many years the artistic movement in the Dominican Republic was a -best-kept secret. Their growing international contributions to contemporary visual arts have been changing that picture, but may also be characterized by even greater drive, selectivity, and regularity. We could say that of all the islands of the Caribbean, the Dominican Republic is, along with Cuba, Puerto Rico, and Haiti, the country most prolific in regard to modern and contemporary artists.
APA, Harvard, Vancouver, ISO, and other styles
10

Frydman, Roman, and Halina Frydman. Why Diagnostic Expectations Cannot Replace REH. Institute for New Economic Thinking Working Paper Series, January 2022. http://dx.doi.org/10.36687/inetwp175.

Full text
Abstract:
Gennaioli and Shleifer (GS) have proposed diagnostic expectations (DE) as an empirically-based approach to specifying participants’ expectations, which, like REH, can be applied in every model. Beyond its supposedly general applicability, GS’s formalization of DE implies that participants systematically and predictably overreact to news. Here, we present a formal argument that Kahneman and Tversky’s compelling empirical findings, and those of other behavioral economists, do not provide a basis for a general approach to specifying participants’ “predictable errors.” We also show that the overreaction of participants’ expectations is not a regularity, but rather an artifact of GS’s particular specification of DE.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Regularity' 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