Search results for " Lower"

showing 10 items of 378 documents

Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes

2005

The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…

Discrete mathematicsVertex (graph theory)Frequency assignmentUpper and lower boundsPlanar graphCombinatoricssymbols.namesakeDistributed algorithmTriangle meshCellular networksymbolsPolygon meshMathematicsofComputing_DISCRETEMATHEMATICSComputingMethodologies_COMPUTERGRAPHICSMathematics
researchProduct

Online Scheduling of Task Graphs on Heterogeneous Platforms

2020

Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. [1] , where $m$ m is the number of CPUs and $k$ k the number of GPUs ( $m\geq k$ m ≥ k ). We prove that no online…

Discrete mathematics[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]020203 distributed computingScheduleCompetitive analysisComputer scienceHeuristicSchedulingOnline algorithmsProcessor schedulingSymmetric multiprocessor system02 engineering and technologyUpper and lower boundsGraphScheduling (computing)Computational Theory and MathematicsHardware and ArchitectureSignal Processing0202 electrical engineering electronic engineering information engineeringTask analysisTask graphsHeterogeneous computingOnline algorithm[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct

A genetic system based on simulated crossover of sequences of two-bit genes

2006

AbstractWe introduce a genetic model based on simulated crossover of fixed sequences of two-bit genes. Results are(1)a lower bound on population size is exhibited such that a transition takes the stochastic finite population genetic system near the next state of the deterministic infinite population genetic system (provided both begin in the same state);(2)states and dynamics of the deterministic infinite population genetic system are derived for arbitrary (finite) fitness functions (expressed in terms of multivariate polynomials);(3)in the case of quadratic fitness defined by weight matrices with m nonnull entries it is shown that each state transition can be implemented in time O(m+l), wh…

Discrete mathematicseducation.field_of_studyGeneral Computer SciencePopulation sizeCrossoverPopulationState (functional analysis)Upper and lower boundsQuantitative Biology::GenomicsTheoretical Computer ScienceMarginal distribution genetic algorithmsChromosome (genetic algorithm)Genetic modelGenetic algorithmMax-cut problemeducationAlgorithmComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Therapeutic options for homozygous familial hypercholesterolemia: the role of Lomitapide

2020

Background:Lomitapide (Juxtapid® in US and Lojuxta® in Europe) is the first developed inhibitor of the Microsomal Triglyceride Transfer Protein (MTP) approved as a novel drug for the management of Homozygous Familial Hypercholesterolemia (HoFH). It acts by binding directly and selectively to MTP thus decreasing the assembly and secretion of the apo-B containing lipoproteins both in the liver and in the intestine.Aims:The present review aims at summarizing the recent knowledge on lomitapide in the management of HoFH.Results:The efficacy and safety of lomitapide have been evaluated in several trials and it has been shown a reduction of the plasma levels of Low-Density Lipoprotein Cholesterol …

Drugmedicine.medical_specialtymedia_common.quotation_subjectFamilial hypercholesterolemia030204 cardiovascular system & hematologyBiochemistryMicrosomal triglyceride transfer proteinHyperlipoproteinemia Type II03 medical and health scienceschemistry.chemical_compound0302 clinical medicineInternal medicineDrug DiscoveryMedicineHumans030212 general & internal medicinemedia_commonPharmacologybiologybusiness.industryAnticholesteremic AgentsOrganic ChemistryHypertriglyceridemiaPlasma levelsmedicine.diseaseLomitapideEuropeTolerabilitychemistrybiology.proteinMolecular MedicinePancreatitisBenzimidazolesHoFH – Lomitapide – LOWER Registry – MTP inhibition – MTP SNPsbusiness
researchProduct

Adaptive Finite-Time Control for a Flexible Hypersonic Vehicle with Actuator Fault

2013

The problem of robust fault-tolerant tracking control is investigated. Simulation on the longitudinal model of a flexible air-breathing hypersonic vehicle (FAHV) with actuator faults and uncertainties is conducted. In order to guarantee that the velocity and altitude track their desired commands in finite time with the partial loss of actuator effectiveness, an adaptive fault-tolerant control strategy is presented based on practical finite-time sliding mode method. The adaptive update laws are used to estimate the upper bound of uncertainties and the minimum value of actuator efficiency factor. Finally, simulation results show that the proposed control strategy is effective in rejecting unc…

EngineeringArticle Subjectbusiness.industrylcsh:MathematicsGeneral MathematicsGeneral EngineeringMode (statistics)Hypersonic vehicleControl engineeringlcsh:QA1-939Track (rail transport)Tracking (particle physics)Upper and lower boundsActuator faultEfficiency factorComputer Science::Roboticslcsh:TA1-2040Control theorylcsh:Engineering (General). Civil engineering (General)businessActuatorMathematical Problems in Engineering
researchProduct

Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

2010

International audience; This paper proposes lower and upper bounds for the split-delivery capacitated arc-routing problem (SDCARP), a variant of the capacitated arc-routing problem in which an edge can be serviced by several vehicles. Recent papers on related problems in node routing have shown that this policy can bring significant savings. It is also more realistic in applications such as urban refuse collection, where a vehicle can become full in the middle of a street segment. This work presents the first lower bound for the SDCARP, computed with a cutting plane algorithm and an evolutionary local search reinforced by a multistart procedure and a variable neighborhood descent. Tests on …

EngineeringMathematical optimization0211 other engineering and technologiesTransportation02 engineering and technologyUpper and lower boundsCARP0502 economics and businessLocal search (optimization)capacitated arc-routing problemMetaheuristicCivil and Structural Engineering050210 logistics & transportationSDCARP021103 operations researchbusiness.industryNode (networking)05 social sciences[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]split deliverycutting planeevolutionary local searchMemetic algorithmRouting (electronic design automation)businessArc routingCutting-plane method
researchProduct

Capacity Upper Bound of Channel Assembling in Cognitive Radio Networks with Quasistationary Primary User Activities

2013

In cognitive radio networks (CRNs) with multiple channels, various channel-assembling (ChA) strategies may be applied to secondary users (SUs), resulting in different achieved capacity. However, there is no previous work on determining the capacity upper bound (UB) of ChA for SUs under given system configurations. In this paper, we derive the maximum capacity for CRNs with ChA through Markov chain modeling, considering that primary user (PU) activities are relatively static, compared with SU services. We first deduce a closed-form expression for the maximum capacity in a dynamic ChA strategy and then demonstrate that no other ChA strategy can provide higher capacity than that achieved by th…

EngineeringMathematical optimizationMarkov chainComputer Networks and Communicationsbusiness.industryAerospace EngineeringINGENIERIA TELEMATICAUpper and lower boundsExpression (mathematics)Continuous-time Markov chain (CTMC) modelsCognitive radioChannel assembling (ChA)Automotive EngineeringQuasistationary regime (QSR)Cognitive radio networks (CRNs)Electrical and Electronic EngineeringbusinessSimulationCommunication channel
researchProduct

Reliable estimates in the anisotropic heat conduction problems

2014

Abstract The heat conduction problems for anisotropic bodies are studied taking into account the uncertainties in the material orientation. The best estimations of the upper and lower bounds of the considered energy dissipation functional are based on developing new approach consisting in solution of some optimization problems and finding the extremal internal material structures, which realize minimal and maximal dissipation. The motivation of this study comes from paper making processes, and more precisely, drying process, which consumes about 50% of the energy fed into the paper machine. The understanding of the effect of uncertainties in the process arises from structural properties of …

EngineeringMathematical optimizationbusiness.product_categoryOptimization problembusiness.industry020209 energyAnisotropic materialProcess (computing)02 engineering and technologyDissipationThermal conductionUpper and lower boundsUncertaintiesPaper machine020401 chemical engineeringlämmön johtuminen0202 electrical engineering electronic engineering information engineeringApplied mathematics0204 chemical engineeringAnisotropybusinessReliable estimatesEnergy (signal processing)Journal of Uncertainty Analysis and Applications
researchProduct

Consensus-based Distributed Intrusion Detection for Multi-Robot Systems

2008

This paper addresses a security problem in robotic multi-agent systems, where agents are supposed to cooperate according to a shared protocol. A distributed Intrusion Detection System (IDS) is proposed here, that detects possible non-cooperative agents. Previous work by the authors showed how single monitors embedded on-board the agents can detect non- cooperative behavior, using only locally available information. In this paper, we allow such monitors to share the collected information in order to overcome their sensing limitation. In this perspective, we show how an agreement on the type of behavior of a target-robot may be reached by the monitors, through execution of a suitable consensu…

Engineeringbusiness.industryDistributed computingReal-time computingIntrusion detection systemDecentralised systemUpper and lower boundsComputer Science::Multiagent SystemsConsensusSettore ING-INF/04 - AutomaticaConvergence (routing)Transient (computer programming)Intrusion detectionbusinessIntelligent transportation systemProtocol (object-oriented programming)set--valued consensus algorithm
researchProduct

An upper bound of the index of an equilibrium point in the plane

2012

Abstract We give an upper bound of the index of an isolated equilibrium point of a C 1 vector field in the plane. The vector field is decomposed in gradient and Hamiltonian components. This decomposition is related with the Loewner vector field. Associated to this decomposition we consider the set Π where the gradient and Hamiltonian components are linearly dependent. The number of branches of Π starting at the equilibrium point determines the upper bound of the index.

Equilibrium pointApplied MathematicsMathematical analysisGradient systemsUpper and lower boundsIndexsymbols.namesakesymbolsVector fieldLinear independenceHamiltonian systemsHamiltonian (quantum mechanics)AnalysisPlanar differential systemsMathematics
researchProduct