Search results for " Lower"

showing 10 items of 378 documents

ETC-1002: A future option for lipid disorders?

2014

ETC-1002 is a new investigational low density lipoprotein cholesterol (LDL-C)-lowering agent (Esperion Therapeutics, Inc.). ETC-1002 is a dicarboxylic acid derivative with a novel mechanism of action targeting two hepatic enzymes - adenosine triphosphate-citrate lyase (ACL) and adenosine monophosphate-activated protein kinase (AMPK), inhibiting sterol and fatty acid synthesis and promoting mitochondrial long-chain fatty acid oxidation. This agent is currently in phase II clinical research. Available data report that ETC-1002 significantly decreased LDL-C levels (up to 32%) in both patients with normal and elevated baseline levels of triglycerides. Such beneficial effect is superior to curre…

Apolipoprotein BLow density lipoprotein cholesterolBlood PressureAMP-Activated Protein Kinaseschemistry.chemical_compoundMiceMulticenter Studies as TopicDicarboxylic AcidsBeta oxidationHypolipidemic AgentsRandomized Controlled Trials as TopicHypolipidemic AgentbiologyFatty AcidsHyperlipidemiaTolerabilityLiverlipids (amino acids peptides and proteins)Cardiology and Cardiovascular MedicineAMP-Activated Protein Kinasemedicine.drugHumanmedicine.medical_specialtyStatinmedicine.drug_classHypercholesterolemiaHyperlipidemiasClinical Trials Phase II as TopicInternal medicinemedicineAnimalsHumansFatty acid synthesisApolipoproteins BAnimalBody WeightDicarboxylic AcidAMPKCholesterol LDLAdenosineSterolCardiometabolic riskRatsETC-1002Disease Models AnimalEndocrinologychemistrybiology.proteinATP Citrate (pro-S)-LyaseRatFatty AcidLipid lowering therapy
researchProduct

Linear and cyclic radio k-labelings of trees

2007

International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…

Applied Mathematics010102 general mathematicsGraph theory[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Astrophysics::Cosmology and Extragalactic Astrophysics0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Span (engineering)01 natural sciencesUpper and lower boundsCombinatoricsGraph theory[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]IntegerRadio channel assignment010201 computation theory & mathematicsCyclic and linear radio k-labelingMetric (mathematics)Path (graph theory)Discrete Mathematics and CombinatoricsOrder (group theory)0101 mathematicsMSC 05C15 05C78ConnectivityMathematics
researchProduct

One-dimensional families of projections

2008

Let m and n be integers with 0 < m < n. We consider the question of how much the Hausdorff dimension of a measure may decrease under typical orthogonal projections from onto m-planes provided that the dimension of the parameter space is one. We verify the best possible lower bound for the dimension drop and illustrate the sharpness of our results by examples. The question stems naturally from the study of measures which are invariant under the geodesic flow.

Applied MathematicsMinkowski–Bouligand dimensionGeneral Physics and AstronomyDimension functionStatistical and Nonlinear PhysicsGeometryParameter spaceEffective dimensionUpper and lower boundsCombinatoricsPacking dimensionHausdorff dimensionInvariant (mathematics)Mathematical PhysicsMathematicsNonlinearity
researchProduct

Finite-Time Control for Attitude Tracking Maneuver of Rigid Satellite

2014

Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2014/302982 Open Access The problem of finite-time control for attitude tracking maneuver of a rigid spacecraft is investigated. External disturbance, unknown inertia parameters are addressed. As stepping stone, a sliding mode controller is designed. It requires the upper bound of the lumped uncertainty including disturbance and inertia matrix. However, this upper bound may not be easily obtained. Therefore, an adaptive sliding mode control law is then proposed to release that drawback. Adaptive technique is applied to estimate that bound. It is prov…

Article Subjectbusiness.industrymedia_common.quotation_subjectApplied Mathematicslcsh:MathematicsTracking systemAngular velocityAnalysis; Applied MathematicsInertiaTracking (particle physics)lcsh:QA1-939Sliding mode controlUpper and lower boundsVDP::Mathematics and natural science: 400::Mathematics: 410::Analysis: 411Sylvester's law of inertiaControl theorybusinessAnalysisMathematicsmedia_commonAbstract and Applied Analysis
researchProduct

In situ observation of new particle formation (NPF) in the tropical tropopause layer of the 2017 Asian monsoon anticyclone – Part 1: Summary of Strat…

2021

During the monsoon season of the year 2017 the airborne StratoClim mission took place in Kathmandu, Nepal, with eight mission flights of the M-55 Geophysica in the upper troposphere–lower stratosphere (UTLS) of the Asian monsoon anticyclone (AMA) over northern India, Nepal, and Bangladesh. More than 100 events of new particle formation (NPF) were observed. In total, more than 2 h of flight time was spent under NPF conditions as indicated by the abundant presence of nucleation-mode aerosols, i.e. with particle diameters dp smaller than 15 nm, which were detected in situ by means of condensation nuclei counting techniques. Mixing ratios of nucleation-mode particles (nnm) of up to ∼ 50 000 mg−…

Atmospheric Science010504 meteorology & atmospheric sciencesPhysicsQC1-999010502 geochemistry & geophysicsAtmospheric sciences01 natural sciencesupper troposphere; lower stratosphere; sulfuric-acid; gravity waves; atmospheric particlesAerosolChemistryAltitude13. Climate actionAnticycloneddc:550Environmental scienceEast Asian MonsoonCloud condensation nucleiTropopauseQD1-999StratosphereAir mass0105 earth and related environmental sciencesAtmospheric Chemistry and Physics
researchProduct

Über die pharmakologische Prüfung von 2-Skatyl-alkylpyridinen

1968

2-Skatyl-alkylpyridine wurden an verschiedenen isolierten Organen untersucht. Die Substanzen zeigten am isolierten Rattendarm eine kompetitiv-nichtkompetitive anticholinerge Wirkung, am isolierten Meerschweinchendarm eine kompetitiv-nichtkompetitive Antihistaminwirkung. An isolierten Meerschweinchenvorhofen trat nach Gabe der tertiaren 2-Skatyl-alkylpyridine eine durch Atropin aufzuhebende negativ inotrope Wirkung auf, die quartaren Substanzen waren dagegen positiv inotrop wirksam. Die tertiaren Stoffe wirkten blutdrucksenkend, die quartaren bei kleinen Dosen blutdrucksteigernd, bei hoheren Dosen blutdrucksenkend. 2-Skatyl-alkyl-pyridines have been studied on different isolated organs. The …

AtropineContraction amplitudeRat intestineChemistryStereochemistryDrug DiscoverymedicinePharmaceutical ScienceBlood pressure loweringPharmacologyGuinea pig ileumGuinea pig atriamedicine.drugArchiv der Pharmazie
researchProduct

Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game

2019

With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…

Bargaining problemMathematical optimizationspace information networkComputer sciencetietoliikennesatelliititresource allocation020302 automobile design & engineering020206 networking & telecommunications02 engineering and technologyFunction (mathematics)Upper and lower boundslangaton tiedonsiirtooptimointi0203 mechanical engineeringConvergence (routing)Nash bargaining solutions0202 electrical engineering electronic engineering information engineeringBandwidth (computing)peliteoriaResource allocationtightest lower bound function2019 15th International Wireless Communications &amp; Mobile Computing Conference (IWCMC)
researchProduct

Efficient lower and upper bounds of the diagonal-flip distance between triangulations

2006

There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.

Binary treeOpen problem010102 general mathematicsDiagonalApproximation algorithmTriangulation (social science)0102 computer and information sciences01 natural sciencesUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYSignal Processing[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsRotation (mathematics)Time complexityComputingMilieux_MISCELLANEOUSInformation SystemsMathematics
researchProduct

An efficient upper bound of the rotation distance of binary trees

2000

A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.

Binary treeRegular polygonComputer Science::Computational GeometryUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYLattice (order)Signal ProcessingTime complexityComputingMethodologies_COMPUTERGRAPHICSInformation SystemsMathematicsInformation Processing Letters
researchProduct

Long-range interactions in 1D heterogeneous solids with uncertainty

2013

Abstract In this paper, the authors aim to analyze the response of a one-dimensional non-local elastic solid with uncertain Young's modulus. The non-local effects are represented as long-range central body forces between non-adjacent volume elements. Following a non-probabilistic approach, the fluctuating elastic modulus of the material is modeled as an interval field. The analysis is conducted resorting to a novel formulation that confines the overestimation effect involved in interval models. Approximate closed-form expressions are derived for the bounds of the interval displacement field.

Body forceNon-local elasticityField (physics)non-local elasticity; long-range interactions; interval field; upper bound and lower bound.Mathematical analysisModulusGeneral MedicineInterval (mathematics)Upper and lower boundsLong-range interactionLong-range interactionsInterval field; Long-range interactions; Non-local elasticity; Upper bound and lower boundDisplacement fieldRange (statistics)Interval fieldUpper bound and lower boundSettore ICAR/08 - Scienza Delle CostruzioniElastic modulusMathematics
researchProduct