Search results for "LIMIT"

showing 10 items of 2826 documents

Order-disorder phase transition in random-walk networks

2004

In this paper we study in detail the behavior of random-walk networks (RWN's). These networks are a generalization of the well-known random Boolean networks (RBN's), a classical approach to the study of the genome. RWN's are also discrete networks, but their response is defined by small variations in the state of each gene, thus being a more realistic representation of the genome and a natural bridge between discrete and continuous models. RWN's show a clear transition between order and disorder. Here we explicitly deduce the formula of the critical line for the annealed model and compute numerically the transition points for quenched and annealed models. We show that RBN's and the annealed…

CombinatoricsPhase transitionGeneralizationCritical lineOrder and disorderLimit (mathematics)Statistical physicsState (functional analysis)Representation (mathematics)Random walkMathematicsPhysical Review E
researchProduct

Closedness properties in ex-identification

2001

In this paper we investigate in which cases unions of identifiable classes are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we and n such that (1) if every union of n − 1 classes out of U1, ... , Un is identifiable, so is the union of all n classes; (2) there are classes U1, ... ,Un−1 such that every union of n−2 classes out of them is identifiable, while the union of n − 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of cl…

CombinatoricsSet (abstract data type)Identification (information)General Computer ScienceIdentifiabilityLimit (mathematics)Computer Science(all)Theoretical Computer ScienceMathematicsTheoretical Computer Science
researchProduct

The best constant for the Sobolev trace embedding from into

2004

Abstract In this paper we study the best constant, λ 1 ( Ω ) for the trace map from W 1 , 1 ( Ω ) into L 1 ( ∂ Ω ) . We show that this constant is attained in BV ( Ω ) when λ 1 ( Ω ) 1 . Moreover, we prove that this constant can be obtained as limit when p ↘ 1 of the best constant of W 1 , p ( Ω ) ↪ L p ( ∂ Ω ) . To perform the proofs we will look at Neumann problems involving the 1-Laplacian, Δ 1 ( u ) = div ( Du / | Du | ) .

CombinatoricsSobolev spaceTrace (linear algebra)Applied MathematicsMathematical analysisNeumann boundary conditionEmbeddingTrace mapLimit (mathematics)Constant (mathematics)Laplace operatorAnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Linking Disaster Risk Reduction and Healthcare in Locations with Limited Accessibility: Challenges and Opportunities of Participatory Research

2020

Disaster risk reduction and healthcare support each other, including the mitigation of further harm after illness or injury. These connections are particularly relevant in locations which have permanent or temporary limited accessibility. In these circumstances, people are required to be self-sufficient in providing emergency and long-term healthcare with limited resources. Planning and preparing to mitigate further harm after illness or injury from disasters (disaster risk reduction) must include people living and working in locations with limited accessibility, meaning that participatory research can be used. The challenges and opportunities of enacting participatory research in such cont…

Community-Based Participatory ResearchDisaster risk reductionHealth Toxicology and MutagenesisQualitative evidence0211 other engineering and technologieslcsh:MedicineParticipatory action researchDisaster Planning02 engineering and technologydisaster risk reductionArticleDisasters03 medical and health sciences0302 clinical medicineHealth careHumans030212 general & internal medicineResearch question021110 strategic defence & security studiesRisk Managementbusiness.industrylcsh:RPrincipal (computer security)Public Health Environmental and Occupational HealthhealthcarePublic relationslimited accessibilityHarmVDP::Medisinske Fag: 700::Helsefag: 800participatory researchbusinessDelivery of Health CareMeaning (linguistics)International Journal of Environmental Research and Public Health
researchProduct

Upward and Downward Limit Pricing: The Role of Post-Entry Competition

2005

Under asymmetric information, entry-deterring strategies by an incumbent monopolist can consist of deviations from its static monopoly price through downward deviations termed downward limit pricing, or upward deviations termed upward limit pricing. Our analysis shows that the mode of post-entry competition influences the range of situations in which an incumbent adopts a strategy of downward limit pricing instead of an upward one: this range is greater under price than under output competition; it is decreasing in the degree of product differentiation; and with homogeneous product only downward limit pricing emerges under price competition, while upward limit pricing can still take place w…

Competition (economics)MicroeconomicsInformation asymmetryMonopoly priceHomogeneousEconomicsProduct (category theory)Product differentiationGeneral Economics Econometrics and FinanceLimit priceThe B.E. Journal of Theoretical Economics
researchProduct

Comment on: A critical analysis of the internal logic in the Life-Space Assessment (LSA) composite score and suggested solutions

2016

Background:An individual’s ability to live independently is commonly measured in health research interested in identifying risk factors associated with disablement processes. In order to inform clinical practice, population research has attempted to identify the contraction of “lived-space” by using various survey instruments.Problem:Studies assessing habitual movements over the environment with the Life-Space Assessment (LSA) survey instrument should carefully consider how the LSA Composite Score (LSA-CS) is computed. Until now, no publication has carefully delineated the assumptions guiding the internal logic used in the computation of the LSA-CS.Core argument:Because the internal logic o…

Composite scoreLogicPopulation researchLife-Space AssessmentPhysical Therapy Sports Therapy and Rehabilitationcomputer.software_genre03 medical and health sciences0302 clinical medicineScoring algorithmActivities of Daily LivingHumans030212 general & internal medicineMobility LimitationInternal logicbusiness.industryRehabilitationGeriatric assessmentta3141ta3142Clinical PracticeLife spaceArtificial intelligenceSurvey instrumentbusinessPsychologycomputerSocial psychology030217 neurology & neurosurgeryNatural language processingClinical Rehabilitation
researchProduct

Local operators to detect regions of interest

1997

The performance of a visual system is strongly influenced by the information processing that is done in the early vision phase. The need exists to limit the computation on areas of interest to reduce the total amount of data and their redundancy. This paper describes a new method to drive the attention during the analysis of complex scenes. Two new local operators, based on the computation of local moments and symmetries, are combined to drive the selection. Experimental results on real data are also reported. © 1997 Elsevier Science B.V.

ComputationEarly visioncomputer.software_genreMachine learningFacial recognition systemSegmentationArtificial IntelligenceRedundancy (engineering)Selection (linguistics)AttentionSegmentationLimit (mathematics)Face recognitionElectrical and Electronic Engineering1707MathematicsSettore INF/01 - Informaticabusiness.industryInformation processingSignal ProcessingSymmetry operatorComputer Vision and Pattern RecognitionArtificial intelligenceData miningbusinesscomputerSoftwarePattern Recognition Letters
researchProduct

Spectral approach to the scattering map for the semi-classical defocusing Davey–Stewartson II equation

2019

International audience; The inverse scattering approach for the defocusing Davey–Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We treat the D-bar problem as a complex linear second order integral equation which is solved with discrete Fourier transforms complemented by a regularization of the singular parts by explicit analytic computation. The resulting algebraic equation is solved either by fixed point iterations or GMRES. Several examples for small values of the semi-classical parameter in the system are discussed.

ComputationFOS: Physical sciences010103 numerical & computational mathematicsFixed point01 natural sciencesRegularization (mathematics)[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]Davey-Stewartson equationsFOS: MathematicsApplied mathematicsMathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]Mathematics[PHYS]Physics [physics]Nonlinear Sciences - Exactly Solvable and Integrable SystemsScattering010102 general mathematicsStatistical and Nonlinear PhysicsD-bar problemsNumerical Analysis (math.NA)Condensed Matter PhysicsFourier spectral methodGeneralized minimal residual methodIntegral equationAlgebraic equationInverse scattering problemExactly Solvable and Integrable Systems (nlin.SI)Limit
researchProduct

A mixed finite element method for the heat flow problem

1981

A semidiscrete finite element scheme for the approximation of the spatial temperature change field is presented. The method yields a better order of convergence than the conventional use of linear elements.

Computer Networks and CommunicationsFinite element limit analysisApplied MathematicsMathematical analysishp-FEMMixed finite element methodSuperconvergenceBoundary knot methodFinite element methodMathematics::Numerical AnalysisComputational MathematicsSmoothed finite element methodSoftwareMathematicsExtended finite element methodBIT
researchProduct

Collusion constrained equilibrium

2018

We study collusion within groups in non-cooperative games. The primitives are the preferences of the players, their assignment to non-overlapping groups and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives that are suboptimal for the group in certain razor's edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained e…

Computer Science::Computer Science and Game TheoryClass (set theory)Group (mathematics)05 social sciencesTheoryofComputation_GENERALMicroeconomicssymbols.namesakeInformation asymmetryIncentive compatibilityNash equilibrium0502 economics and businessCollusionsymbolsEconomicsLimit (mathematics)050207 economicsSet (psychology)General Economics Econometrics and FinanceMathematical economics050205 econometrics Theoretical Economics
researchProduct