Search results for "A domain"

showing 10 items of 37 documents

Generalized quasidisks and conformality II

2015

We introduce a weaker variant of the concept of three point property, which is equivalent to a non-linear local connectivity condition introduced in [12], sufficient to guarantee the extendability of a conformal map f from the unit disk onto a domain to the entire plane as a homeomorphism of locally exponentially integrable distortion. Sufficient conditions for extendability to a homeomorphism of locally p-integrable distortion are also given.

Discrete mathematicsIntegrable systemPlane (geometry)Applied MathematicsGeneral Mathematics010102 general mathematicsA domainConformal map01 natural sciencesUnit diskHomeomorphism010101 applied mathematicsDistortion (mathematics)Point (geometry)0101 mathematicsMathematicsProceedings of the American Mathematical Society
researchProduct

Quasihyperbolic boundary conditions and Poincaré domains

2002

We prove that a domain in ${\Bbb R}^n$ whose quasihyperbolic metric satisfies a logarithmic growth condition with coefficient $\beta\le 1$ is a (q,p)-\Poincare domain for all p and q satisfying $p\in[1,\infty)\cap(n-n\beta,n)$ and $q\in[p,\beta p^*)$ , where $p^*=np/(n-p)$ denotes the Sobolev conjugate exponent. An elementary example shows that the given ranges for p and q are sharp. The proof makes use of estimates for a variational capacity. When p=2 we give an application to the solvability of the Neumann problem on domains with irregular boundaries. We also discuss the relationship between this growth condition on the quasihyperbolic metric and the s-John condition.

Discrete mathematicsPure mathematicsGeneral MathematicsLogarithmic growthA domainSobolev spacesymbols.namesakePoincaré conjectureExponentNeumann boundary conditionsymbolsBeta (velocity)Boundary value problemMathematicsMathematische Annalen
researchProduct

General decidability theorems for infinite-state systems

2002

Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems), which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a well-ordered and well-founded preorder such that the transition relation is "monotonic" (is a simulation) with respect to the preorder. We show that the following properties are decidable for …

Discrete mathematicsRelation (database)ReachabilityData domainPreorderMathematical structurePetri netComputer Science::Formal Languages and Automata TheoryAutomatonDecidabilityMathematics
researchProduct

The Self-expression Motivational System

2016

The main aim of this chapter is to introduce and promote the concept of self-expression as a basic motivation. Considering that the amount of literature on self-expression, matched with the concepts of control and affiliation, is practically non-existent, the chapter starts by attempting to provide a viable definition of self-expression motivation. Furthermore, the concept of art as a domain in which the underlying tendency for self-expression is clearly manifested is also considered. The chapter also includes a literature review to show whether or not self-expression motivation is able to fulfil the criteria suggested by Baumeister and Leary (Psychological Bulletin, 117, 497–529, 1995). Th…

Expression (architecture)SelfA domainExternal realityMotivational systemControl (linguistics)PsychologyCognitive psychology
researchProduct

Sorted deduplication: How to process thousands of backup streams

2016

The requirements of deduplication systems have changed in the last years. Early deduplication systems had to process dozens to hundreds of backup streams at the same time while today they are able to process hundreds to thousands of them. Traditional approaches rely on stream-locality, which supports parallelism, but which easily leads to many non-contiguous disk accesses, as each stream competes with all other streams for the available resources. This paper presents a new exact deduplication approach designed for processing thousands of backup streams at the same time on the same fingerprint index. The underlying approach destroys the traditionally exploited temporal chunk locality and cre…

File system020203 distributed computingComputer scienceData domainFingerprint (computing)Search engine indexingSorting020206 networking & telecommunications02 engineering and technologyParallel computingcomputer.software_genreBackupServerData_FILES0202 electrical engineering electronic engineering information engineeringData deduplicationcomputer2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)
researchProduct

Poincaré inequalities and Steiner symmetrization

1996

A complete geometric characterization for a general Steiner symmetric domain Ω ⊂ Rn to satisfy the Poincare inequality with exponent p > n−1 is obtained and it is shown that this range of exponents is best possible. In the case where the Steiner symmetric domain is determined by revolving the graph of a Lipschitz continuous function, it is shown that the preceding characterization works for all p > 1 and furthermore for such domains a geometric characterization for a more general Sobolev–Poincare inequality to hold is given. Although the operation of Steiner symmetrization need not always preserve a Poincare inequality, a general class of domains is given for which Poincare inequalities are…

Finite volume methodGeneral MathematicsA domainPoincaré inequalityLipschitz continuityCombinatoricssymbols.namesakeinequalitiesPoincaré conjecturesymbolsExponentSymmetrization46E35Locally integrable function26D10Mathematics
researchProduct

Discovering learning paths on a domain ontology using natural language interaction

2005

The present work investigates the problem of determining a learning path inside a suitable domain ontology. The proposed approach enables the user of a web learning application to interact with the system using natural language in order to browse the ontology itself. The course related knowledge is arranged as a three level hierarchy: content level, symbolic level, and conceptual level bridging the previous ones. The implementation of the ontological, the interaction, and the presentation component inside the TutorJ system is explained, and the first results are presented.

HierarchyNatural language interactionComputer sciencebusiness.industryProcess ontologyA domainOntology (information science)computer.software_genreBridging (programming)Human–computer interactionOntologyUpper ontologyArtificial intelligenceweb learning application natural language ontologybusinesscomputerNatural languageNatural language processing
researchProduct

Local uniqueness of the solutions for a singularly perturbed nonlinear nonautonomous transmission problem

2020

Abstract We consider the Laplace equation in a domain of R n , n ≥ 3 , with a small inclusion of size ϵ . On the boundary of the inclusion we define a nonlinear nonautonomous transmission condition. For ϵ small enough one can prove that the problem has solutions. In this paper, we study the local uniqueness of such solutions.

Local uniqueness of the solutionsLaplace's equation020502 materialsApplied MathematicsNonlinear nonautonomous transmission problem010102 general mathematicsMathematical analysisA domainBoundary (topology)02 engineering and technology01 natural sciencesNonlinear systemMathematics - Analysis of PDEs35J25 31B10 35J65 35B25 35A020205 materials engineeringTransmission (telecommunications)Settore MAT/05 - Analisi MatematicaLocal uniqueness of the solutions; Nonlinear nonautonomous transmission problem; Singularly perturbed perforated domainFOS: MathematicsUniqueness0101 mathematicsSingularly perturbed perforated domainAnalysisMathematicsAnalysis of PDEs (math.AP)
researchProduct

Do mental processes share a domain-general resource?

2010

What determines success and failure in dual-task situations? Many theories propose that the extent to which two activities can be performed concurrently depends on the nature of the information involved in the activities. In particular, verbal and visuospatial activities are thought to be fueled by distinct resources, so that interference occurs between two verbal activities or two visuospatial activities, but little or no interference occurs between verbal and visuospatial activities. The current study examined trade-offs in four dual-task situations in which participants maintained verbal or visuospatial information while concurrently processing either verbal or visuospatial information.…

MaleRecallWorking memoryA domainShort-term memoryRetention PsychologyVerbal LearningVisuospatial abilityDevelopmental psychologyJudgmentYoung AdultResource (project management)Mental Processesddc:150Pattern Recognition VisualOrientationHumansAttentionFemalePsychologyGeneral PsychologyCognitive loadColor PerceptionCognitive psychologyPsychological science
researchProduct

A Domain Decomposition/Nash Equilibrium Methodology for the Solution of Direct and Inverse Problems in Fluid Dynamics with Evolutionary Algorithms

2008

Mathematical optimizationsymbols.namesakeNash equilibriumGenetic algorithmFluid dynamicsEvolutionary algorithmA domainsymbolsDecomposition (computer science)Inverse problemMathematics
researchProduct