Search results for "Algorithm"

showing 10 items of 4887 documents

Formation of an interlocked double-chain from an organic-inorganic [2]rotaxane.

2019

Here we show that a structure containing a polymeric interlocking daisy chain is obtained from the reaction of an inorganic–organic [2]rotaxane [HB{CrIII7NiII(μ-F)8(O2CtBu)16}], where B is an organic thread terminated with a bi-pyridyl unit, with an oxo-centered metal carboxylate triangle [FeIII2CoII(μ3-O)(O2CtBu)6(HO2CtBu)3].

Rotaxane010405 organic chemistryChemistryMetals and AlloysGeneral Chemistry010402 general chemistry01 natural sciencesCatalysis0104 chemical sciencesSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsDouble chainMetalchemistry.chemical_compoundTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYvisual_artPolymer chemistryOrganic inorganicMaterials ChemistryCeramics and Compositesvisual_art.visual_art_mediumCarboxylateDaisy chainChemical communications (Cambridge, England)
researchProduct

Digital demodulation for fast set-up of sensorless PMSM electrical drives based on magnetic anisotropy

2009

This paper presents a demodulation algorithm applied to the sensorless control of permanent magnet synchronous motors (PMSM). The sensorless control technique reported in this paper is based on the injection of high frequency voltages to the stator so that the motor currents contain information on the rotor position. This information is then extracted by an appropriate demodulation technique. The presented demodulation algorithm is based on spectral analysis of the signal produced by the sensorless control technique because this is fully characterized and presents not ambiguous correlation between current harmonic content and rotor position. The most important feature of the demodulation al…

Rotor (electric)Computer scienceStatorSensorless Drives Magnetic Anisotropy PMSMSettore ING-IND/32 - Convertitori Macchine E Azionamenti Elettricilaw.inventionControl theorylawPosition (vector)Electronic engineeringDemodulationAlgorithm designSynchronous motorVoltageMachine control
researchProduct

Computer networks stability independence of the queuing delays

2015

Communication in intelligent computer networks is an indispensible attribute of the dataflow quality in Web traffic. We propose a model that investigates intelligent computer networks stability while specifying its limits. Packet queuing delay affects the performance of the network, and especially its stability. If the network is presented as a dynamic system in block diagram form, we compute a transfer function and determine the quasi-polynomial system. The characteristic polynomial distribution of zeros of complex variable quasi-plane determines the boundaries of the network stability. The approach relies on estimation of the network system's transfer functions and its quasi-polynomial. C…

RouterQueueing theorycommunicationbusiness.industryNetwork packetDataflowComputer scienceDistributed computingWeb trafficalgorithmsStability (probability)quasi polynomialsExponential stabilityComputer Science::Networking and Internet ArchitectureQueuing delayqueuing theoryNetwork performancesignal processingbusinessIntelligent computer networksmathematical modelComputer networkFifth International Conference on the Innovative Computing Technology (INTECH 2015)
researchProduct

<title>Revenue-maximization-based adaptive WFQ</title>

2002

In the future Internet, di erent applications such as Voice over IP (VoIP) and Video-on-Demand (VoD) arise with di erent Quality of Service (QoS) parameters including e.g. guaranteed bandwidth, delay jitter, and latency. Different kinds of service classes (e.g. gold, silver, bronze) arise. The customers of di erent classes pay di erent prices to the service provider, who must share resources in a plausible way. In a router, packets are queued using a multi-queue system, where each queue corresponds to one service class. In this paper, an adaptive Weighted Fair Queue based algorithm for traAEc allocation is presented and studied. The weights in gradient type WFQ algorithm are adapted using r…

RouterService qualityVoice over IPAdaptive algorithmbusiness.industryNetwork packetComputer scienceQuality of serviceReal-time computingService providerTelecommunications networklaw.inventionlawInternet ProtocolRevenueThe InternetbusinessQueueWeighted fair queueingComputer networkSPIE Proceedings
researchProduct

Parallel Genetic Algorithms for the Tuning of a Fuzzy AQM Controller

2003

This paper presents the results of the application of a parallel Genetic Algorithm (GA) in order to design a Fuzzy Proportional Integral (FPI) controller for active queue management on Internet routers. The Active Queue Management (AQM) policies are those policies of router queue management that allow the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. Two different parallel implementations of the genetic algorithm are adopted to determine an optimal configuration of the FPI controller parameters. Finally, the results of several experiments carried out on a forty nodes cluster of workst…

RouterSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniQueue management systemComputer sciencebusiness.industryDistributed computingFuzzy control systemActive queue managementFuzzy logicNetwork congestionTCP Actuve Queue Management Genetic algorithms Fuzzy logic AQM TCP congestion controlControl theoryGenetic algorithmbusinessComputer network
researchProduct

A self-routing protocol for distributed consensus on logical information

2010

In this paper, we address decision making problems, depending on a set of input events, with networks of dynamic agents that have partial visibility of such events. Previous work by the authors proposed so-called logical consensus approach, by which a network of agents, that can exchange binary values representing their local estimates of the events, is able to reach a unique and consistent decision. The approach therein proposed is based on the construction of an iterative map, whose computation is centralized and guaranteed under suitable conditions on the input visibility and graph connectivity. Under the same conditions, we extend the approach in this work by allowing the construction o…

Routing protocol020301 aerospace & aeronautics0209 industrial biotechnologyoptimal information flowComputer scienceDistributed computingMulti-agent systemVisibility (geometry)Graph theory02 engineering and technologyLogical consensus algorithm020901 industrial engineering & automationSettore ING-INF/04 - Automatica0203 mechanical engineeringConsensusRouting (electronic design automation)Wireless sensor networkConnectivity
researchProduct

A Novel Architecture for Inter-FPGA Traffic Collision Management

2014

International audience; —with the increasing complexity of various communi-cations and applications, Network-On-Chip (NoC) is one of the most efficient communication structures. Multi-FPGA platforms are considered as the most appropriate experimental solutions to emulate a large size of MPSoCs (Multi-Processor System-on-Chip) based on a NoC. The deployment of the NoC into several FPGAs requires the use of inter-FPGA communication links. The number and performance of external links restrict the bandwidth of communication. Currently, the number of inter-FPGA signals is considered as a substantial problem in NoC implemented on Multi-FPGA architectures. In this paper, we propose the integration…

Routing protocolComputer sciencebusiness.industryBandwidth (signal processing)Inter-FPGACollision[INFO.INFO-ES] Computer Science [cs]/Embedded SystemsMulti-FPGASoftware deploymentHardware_INTEGRATEDCIRCUITSAlgorithm designResource management[INFO.INFO-ES]Computer Science [cs]/Embedded Systems[ INFO.INFO-ES ] Computer Science [cs]/Embedded SystemsbusinessField-programmable gate arrayIndex Terms—Traffic CollisionNoCCollision avoidanceComputer network
researchProduct

Notice of Violation of IEEE Publication Principles: Reinforcement learning for P2P searching

2005

For a peer-to-peer (P2P) system holding a massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple reinforcement learni…

Routing protocolSmall-world networkComputer scienceSearch algorithmbusiness.industryDistributed computingScalabilityReinforcement learningbusinessNetwork topologyComputer networkShared resourceFlooding (computer networking)Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)
researchProduct

Developement of new techniques of Optimal Control in Quantum Dynamics : from nuclear magnetic resonance to molecular physics

2011

The goal of this thesis is to apply the optimal control theory to the dynamics of quantum systems.The first part aim at introducing the tools of optimal control in quantum control which were initially developedin mathematics. This approch has been applied on different kinds of quantum system with small and largedimensions. The first part of this manuscript introduces the optimal control tools which are used with a pointof view suited to a public of physicists. In the second part these techniques are used to control the dynamics ofspins in NMR and MRI. The third part deals with the development of new iterative algorithms applied to thecontrol by laser fields of the rotational dynamics of lin…

Résonance magnétique nucléaire (RMN)[ PHYS.QPHY ] Physics [physics]/Quantum Physics [quant-ph]Nuclear Magnetic Resonance (NMR)Optimal Control[ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM]Magnetic Resonance Imaging (MRI)Contrôle localAlgorithme de KrotovAlgorithme monotoneBosonic Josephson Junction (BJJ)Pontryagin Maximum Principle (PMP)[MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM][PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph][PHYS.COND.CM-GEN] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Krotov AlgorithmLocal Control[PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]Alignement moléculaireMonotonic AlgorihtmJonction Josephon bosonique[MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM][ PHYS.COND.CM-GEN ] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Imagerie par résonance magnétique (IRM)Quantum ControlMolecular Alignment[PHYS.COND.CM-GEN]Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Contrôle optimalPrincipe du maximum de Pontryagin (PMP)GRAPEContrôle quantique
researchProduct

Partitionability, coverability and colorability in graphs

2014

Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a cla…

S-coloration de packingDistanceColoration de GrundyPacking coloringLatticDominationGraphColoration de packingComputational complexityParameterized complexity[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]ColorationGrapheCombinatoricsRegular graphColoringGrundy coloringGraphe régulierS -packing coloringComplexité algorithmiqueComplexité paramétrée
researchProduct