Search results for " Network"

showing 10 items of 6428 documents

Digital background calibration algorithm and its FPGA implementation for timing mismatch correction of time-interleaved ADC

2019

Sample time error can degrade the performance of time-interleaved analog to digital converters (TIADCs). A fully digital background algorithm is presented in this paper to estimate and correct the timing mismatch errors between four interleaved channels, together with its hardware implementation. The proposed algorithm provides low computation burden and high performance. It is based on the simplified representation of the coefficients of the Lagrange interpolator. Simulation results show that it can suppress error tones in all of the Nyquist band. Results show that, for a four-channel TIADC with 10-bit resolution, the proposed algorithm improves the signal to noise and distortion ratio (SN…

Spurious-free dynamic rangeEnginyeria elèctricaComputer scienceDynamic rangeComputation020208 electrical & electronic engineering020206 networking & telecommunications02 engineering and technologySurfaces Coatings and FilmsData acquisitionHardware and ArchitectureSignal Processing0202 electrical engineering electronic engineering information engineeringElectronic engineeringNyquist–Shannon sampling theoremCircuits integratsSystem timeField-programmable gate arrayCommunication channel
researchProduct

Radio k-Labelings for Cartesian Products of Graphs

2005

International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…

Square tilingGraph labelingradio k-labelingradio channel assignmentAntipodal point0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Span (engineering)01 natural sciencesUpper and lower boundsradio numberCombinatoricssymbols.namesakeIntegerCartesian productDiscrete Mathematics and CombinatoricsChromatic scale0101 mathematicsantipodal numberMathematicsDiscrete mathematicsApplied Mathematics010102 general mathematicsGraph theory[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productGraph theory[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]010201 computation theory & mathematicsCellular networksymbolsHypercubeMSC 05C15 05C78Graph product
researchProduct

About the Stability of Active Queue Management Mechanism

2004

In this paper, we discuss the influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis. To see this, we consider a network scenario where RED is configured at each router according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. Yet, we show that instability may arise when two links become congested. We justify this result through a multiple bottleneck model.

Stability analysis Communication Networks Control Theory
researchProduct

AQM Generalized Nyquist stability in multiple bottlenecks networks

2005

The influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis is discussed. We consider a network scenario where RED is configured at each router according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. We show that instability may arise when two links become congested. We justify this result through a multiple bottleneck model using the Generalized Nyquist stability criterion.

Stability analysis Communication Networks Control Theory
researchProduct

Finite-time stability analysis and stabilization for linear discrete-time system with time-varying delay

2014

Abstract The problem of finite-time stability for linear discrete-time systems with time-varying delay is studied in this paper. In order to deal with the time delay, the original system is firstly transformed into two interconnected subsystems. By constructing a delay-dependent Lyapunov–Krasovskii functional and using a two-term approximation of the time-varying delay, sufficient conditions of finite-time stability are derived and expressed in terms of linear matrix inequalities (LMIs). The derived stability conditions can be applied into analyzing the finite-time stability and deriving the maximally tolerable delay. Compared with the existing results on finite-time stability, the derived …

Stability conditionsDiscrete time systemComputer Networks and CommunicationsControl and Systems EngineeringControl theoryApplied MathematicsSignal ProcessingLinear matrixFinite timeControl and Systems Engineering; Signal Processing; Computer Networks and Communications; Applied MathematicsStability (probability)MathematicsJournal of the Franklin Institute
researchProduct

INTER-ORGANIZATIONAL NETWORKS FOR INNOVATIONS AND SUSTAINABILITY

2021

The present Thesis is structured as a collection of three essays linked by one core idea: contributing to research knowledge on inter-organizational network dynamics in the context of innovation and the promotion of sustainability. In this Thesis, the author takes a systemic perspective and analyses the interactions between diverse groups of stakeholders, aiming to identify and interpret the logic underlying the formation of inter-organizational partnerships to promote innovation and sustainability. The dynamics of inter-organizational networks are influenced by several internal and external factors, such as strategic cooperation with stakeholders, structural changes (such as an R&I policy …

StakeholdersFramework programPolicySustainabilityPath dependenceSustainable innovationHealthcare sectorNetwork analysisPublic-private partnershipsSettore SECS-P/08 - Economia E Gestione Delle ImpreseInter-organizational networksCoronavirus (COVID-19)
researchProduct

LoneStar RAID

2016

The need for huge storage archives rises with the ever growing creation of data. With today’s big data and data analytics applications, some of these huge archives become active in the sense that all stored data can be accessed at any time. Running and evolving these archives is a constant tradeoff between performance, capacity, and price. We present the LoneStar RAID, a disk-based storage architecture, which focuses on high reliability, low energy consumption, and cheap reads. It is designed for MAID systems with up to hundreds of disk drives per server and is optimized for “write once, read sometimes” workloads. We use dedicated data and parity disks, and export the data disks as individu…

Standard RAID levelsHardware_MEMORYSTRUCTURESRAIDDisk array controllerComputer sciencebusiness.industryDisk mirroring020206 networking & telecommunicationsFault tolerance02 engineering and technologycomputer.software_genreDisk Data Formatlaw.inventionHardware and Architecturelaw020204 information systemsEmbedded systemData_FILES0202 electrical engineering electronic engineering information engineeringOperating systemCacheNon-standard RAID levelsbusinesscomputerACM Transactions on Storage
researchProduct

VLPZ: The Vehicular Location Privacy Zone

2016

International audience; One of the key challenges in the success of vehicular ad hoc networks (VANETs) is to consider the location privacy of drivers. Although, the pseudonym changing approach is suggested by standardization development organizations such as IEEE and ETSI, the development of an effective pseudonym changing strategy is still an open issue. The existing pseudonym changing strategies are either not effective to protect against the pseudonyms linking attacks or can have a negative impact on the VANETs’ applications. To address these issues, this paper proposes a new pseudonym changing strategy based on the Vehicular Location Privacy Zone (VLPZ), which is a roadside infrastructu…

StandardizationComputer scienceWireless ad hoc networkSecurity.02 engineering and technologyPseudonymComputer securitycomputer.software_genre[SPI]Engineering Sciences [physics]0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringVANETsGeneral Environmental ScienceLocation privacybiologybusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020302 automobile design & engineering020206 networking & telecommunicationsPseudonym ChangingTollMetric (mathematics)biology.proteinKey (cryptography)SecurityGeneral Earth and Planetary SciencesComputingMilieux_COMPUTERSANDSOCIETYbusinesscomputerAnonymityComputer network
researchProduct

Invariant aspects in M-commerce environments

2005

Mobile phones and other small and powerful portable devices have revolutionized personal communication and affected the lifestyles of the people in the industrialized world. Following credible estimates, in a few years there will over two - billions of such portable devices in use. An emerging trend is the electronic commerce performed using mobile terminals over wireless networks, often called mobile commerce or M-commerce. Mobile commerce environments are characterized by high complexity, including myriads of technical and organizational aspects. This property makes it difficult to distinguish the more fundamental issues, structures, and concepts in mobile commerce from the hype. To captu…

Standardizationbusiness.industryComputer scienceWireless networkMobile commerceMobile computingBusiness modelHigh complexitymedia_common.cataloged_instanceInvariant (mathematics)European unionTelecommunicationsbusinessmedia_commonProceedings of the 6th international conference on Mobile data management
researchProduct

Measurement of the single-top-quark production cross section at CDF.

2008

We report a measurement of the single top quark production cross section in 2.2 ~fb-1 of p-pbar collision data collected by the Collider Detector at Fermilab at sqrt{s}=1.96 TeV. Candidate events are classified as signal-like by three parallel analyses which use likelihood, matrix element, and neural network discriminants. These results are combined in order to improve the sensitivity. We observe a signal consistent with the standard model prediction, but inconsistent with the background-only model by 3.7 standard deviations with a median expected sensitivity of 4.9 standard deviations. We measure a cross section of 2.2 +0.7 -0.6(stat+sys) pb, extract the CKM matrix element value |V_{tb}|=0…

StandardsTop quarkParticle physicsFOS: Physical sciencesGeneral Physics and Astronomyddc:500.2Astrophysics::Cosmology and Extragalactic Astrophysics114 Physical sciences01 natural sciencesStandard ModelHigh Energy Physics - ExperimentNuclear physicsHigh Energy Physics - Experiment (hep-ex)Tellurium compoundsMatrix elementsCross section (physics)Colliding beam acceleratorsStandard deviations0103 physical sciences[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]Sensitivity (control systems)010306 general physicsStandard models14.65.Ha 13.85Qk 12.15Hh 12.15.JiPhysicshep-ex010308 nuclear & particles physicsCabibbo–Kobayashi–Maskawa matrixPhysicsStatisticsHigh Energy Physics::PhenomenologyOrder (ring theory)Collider Detector at FermilabCross sections_Parallel analysisProduction (computer science)High Energy Physics::ExperimentCollider Detector at FermilabNeural networksQuark productions
researchProduct