Search results for "Application"

showing 10 items of 5559 documents

Low-Power Wide-Area Networks for Sustainable IoT

2019

Low-power wide-area (LPWA) networks are attracting extensive attention because of their abilities to offer low-cost and massive connectivity to Internet of Things (IoT) devices distributed over wide geographical areas. This article provides a brief overview on the existing LPWA technologies and useful insights to aid the large-scale deployment of LPWA networks. Particularly, we first review the currently competing candidates of LPWA networks, such as narrowband IoT (NB-IoT) and long range (LoRa), in terms of technical fundamentals and large-scale deployment potential. Then we present two implementation examples on LPWA networks. By analyzing the field-test results, we identify several chall…

FOS: Computer and information sciencesComputer scienceComputer Science - Information Theory0805 Distributed Computing02 engineering and technologylaw.inventionComputer Science - Networking and Internet ArchitectureBluetoothGSMlaw1005 Communications Technologies0202 electrical engineering electronic engineering information engineeringBandwidth (computing)Resource managementElectrical and Electronic EngineeringNetworking and Internet Architecture (cs.NI)business.industryInformation Theory (cs.IT)020206 networking & telecommunicationsComputer Science ApplicationsPower (physics)0906 Electrical and Electronic EngineeringWide areaSoftware deploymentNetworking & TelecommunicationsTelecommunicationsbusinessInternet of Things
researchProduct

Capture Aware Sequential Waterfilling for LoraWAN Adaptive Data Rate

2020

LoRaWAN (Long Range Wide Area Network) is emerging as an attractive network infrastructure for ultra low power Internet of Things devices. Even if the technology itself is quite mature and specified, the currently deployed wireless resource allocation strategies are still coarse and based on rough heuristics. This paper proposes an innovative "sequential waterfilling" strategy for assigning Spreading Factors (SF) to End-Devices (ED). Our design relies on three complementary approaches: i) equalize the Time-on-Air of the packets transmitted by the system's EDs in each spreading factor's group; ii) balance the spreading factors across multiple access gateways, and iii) keep into account the c…

FOS: Computer and information sciencesComputer scienceDistributed computingInternet of ThingsWireless communicationresource allocationServers02 engineering and technologyNetwork topologyspreading factorsinter-SF interferenceComputer Science - Networking and Internet Architecturechannel captureBandwidthServerLPWAN0202 electrical engineering electronic engineering information engineeringWirelessComputer architectureElectrical and Electronic Engineeringinternet of t6hingsNetworking and Internet Architecture (cs.NI)Network packetbusiness.industryApplied MathematicsResource managementinternet of t6hings; LoRaWAN; spreading factors; resource allocation; adaptive data rate; channel capture; inter-SF interference020206 networking & telecommunicationsComputer Science ApplicationsLoRaWANadaptive data rateWide area networkScalabilityHeuristicsbusinessInterferenceUplinkCommunication channel
researchProduct

Critical comments on EEG sensor space dynamical connectivity analysis

2019

Many different analysis techniques have been developed and applied to EEG recordings that allow one to investigate how different brain areas interact. One particular class of methods, based on the linear parametric representation of multiple interacting time series, is widely used to study causal connectivity in the brain. However, the results obtained by these methods should be interpreted with great care. The goal of this paper is to show, both theoretically and using simulations, that results obtained by applying causal connectivity measures on the sensor (scalp) time series do not allow interpretation in terms of interacting brain sources. This is because (1) the channel locations canno…

FOS: Computer and information sciencesComputer scienceSocial SciencesTransfer functionStatistics - Applications050105 experimental psychology03 medical and health sciences0302 clinical medicinegranger causalityMVARHumansApplications (stat.AP)Computer Simulation0501 psychology and cognitive sciencesRadiology Nuclear Medicine and imagingBrain connectivityEEGTime domainSpurious relationshipRepresentation (mathematics)Mixing (physics)Parametric statisticsBrain MappingRadiological and Ultrasound TechnologySeries (mathematics)05 social sciencesbrain connectivitysource modellingElectroencephalographyNeurologyFOS: Biological sciencesFrequency domainQuantitative Biology - Neurons and CognitionSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGranger causalityDirected transfer functionNeurons and Cognition (q-bio.NC)Neurology (clinical)AnatomyAlgorithm030217 neurology & neurosurgery
researchProduct

Impact of LTE’s Periodic Interference on Heterogeneous Wi-Fi Transmissions

2018

The problem of Wi-Fi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Rather than focusing on the problem of resource sharing between the two technologies, in this paper, we study the effects of LTE's structured transmissions on the Wi-Fi random access protocol. We show how the scheduling of periodic LTE transmissions modifies the behavior of 802.11's distributed coordination function (DCF), leading to a degradation of Wi-Fi performance, both in terms of channel utilization efficiency and in terms of channel access fairness. We also discuss the applicability and…

FOS: Computer and information sciencesComputer scienceThroughput02 engineering and technologyDistributed coordination functionSpectrum managementAnalytical modelScheduling (computing)Computer Science - Networking and Internet ArchitectureC.2.0C.2.50202 electrical engineering electronic engineering information engineeringLong Term EvolutionWireless fidelityElectrical and Electronic EngineeringProbabilitySensorNetworking and Internet Architecture (cs.NI)business.industrySettore ING-INF/03 - TelecomunicazioniComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsComputer Science Applications1707 Computer Vision and Pattern RecognitionThroughput91A06 91A10 91A80Computer Science ApplicationsShared resourceModeling and SimulationbusinessC.2.0; C.2.5InterferenceRandom accessComputer networkCommunication channel
researchProduct

A Comprehensive Utility Function for Resource Allocation in Mobile Edge Computing

2020

In mobile edge computing (MEC), one of the important challenges is how much resources of which mobile edge server (MES) should be allocated to which user equipment (UE). The existing resource allocation schemes only consider CPU as the requested resource and assume utility for MESs as either a random variable or dependent on the requested CPU only. This paper presents a novel comprehensive utility function for resource allocation in MEC. The utility function considers the heterogeneous nature of applications that a UE offloads to MES. The proposed utility function considers all important parameters, including CPU, RAM, hard disk space, required time, and distance, to calculate a more realis…

FOS: Computer and information sciencesComputer sciencemedia_common.quotation_subjectG.3Cloud computingComputer Science - Networking and Internet ArchitectureC.2.3BiomaterialsC.2.1Resource (project management)Electrical and Electronic EngineeringFunction (engineering)media_commonNetworking and Internet Architecture (cs.NI)Mobile edge computingbusiness.industryEnergy consumptionComputer Science ApplicationsTask (computing)User equipmentMechanics of MaterialsModeling and SimulationResource allocationG.3; C.2.3; C.2.1business46FxxComputer networkComputers, Materials & Continua
researchProduct

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

2016

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

FOS: Computer and information sciencesCoupled-task scheduling model[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Computer science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchComputational Complexity (cs.CC)Topology01 natural sciencesExecution timeTheoretical Computer ScienceComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)021103 operations researchJob shop schedulingPolynomial-time approximation algorithmApproximation algorithmCompatibility graphComplexityIdle timeComputer Science ApplicationsComputer Science - Computational Complexity[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsCompatibility (mechanics)Bipartite graphMinification
researchProduct

Multi-scale analysis of the European airspace using network community detection

2014

We show that the European airspace can be represented as a multi-scale traffic network whose nodes are airports, sectors, or navigation points and links are defined and weighted according to the traffic of flights between the nodes. By using a unique database of the air traffic in the European airspace, we investigate the architecture of these networks with a special emphasis on their community structure. We propose that unsupervised network community detection algorithms can be used to monitor the current use of the airspaces and improve it by guiding the design of new ones. Specifically, we compare the performance of three community detection algorithms, also by using a null model which t…

FOS: Computer and information sciencesDatabases FactualDistributed computingSocial SciencesPoison controllcsh:MedicineSociologycommunity detectionData Mininglcsh:SciencePhysicsMultidisciplinaryMathematical modelApplied MathematicsPhysicsCommunity structureComputer Science - Social and Information NetworksAir traffic controlAir TravelSocial NetworksPhysical SciencesInterdisciplinary PhysicsSocial SystemsEngineering and TechnologyFree flightInformation TechnologyNetwork AnalysisAlgorithmsResearch ArticlePhysics - Physics and SocietyComputer and Information SciencesControl (management)FOS: Physical sciencesComputerApplications_COMPUTERSINOTHERSYSTEMSPhysics and Society (physics.soc-ph)Statistical MechanicsDatabasescomplex networkHumansArchitectureNetworks network communities socio-technical system complex systems Air Traffic ManagementSocial and Information Networks (cs.SI)Null modellcsh:RModels TheoreticalSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Computational SociologySignal ProcessingAir trafficlcsh:QMathematics
researchProduct

Algorithms for Anti-Powers in Strings

2018

Abstract A string S [ 1 , n ] is a power (or tandem repeat) of order k and period n / k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an anti-power of order k to be a string composed of k pairwise-distinct blocks of the same length ( n / k , called anti-period). Anti-powers are a natural converse to powers, and are objects of combinatorial interest in their own right. In this paper we initiate the algorithmic study of anti-powers. Given a string S, we describe an op…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ComputationComputer Science - Formal Languages and Automata Theory0102 computer and information sciencesString processingInformation System01 natural sciencesUpper and lower boundsAnti-powersTheoretical Computer ScienceLemma (logic)ConverseComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)0101 mathematicsMathematicsCombinatorics on wordSignal processingCombinatorics on wordsComputer Science Applications1707 Computer Vision and Pattern RecognitionAnti-power16. Peace & justice113 Computer and information sciencesSubstringComputer Science Applications010101 applied mathematicsAlgorithmCombinatorics on words010201 computation theory & mathematicsSignal ProcessingAlgorithmAlgorithmsInformation SystemsComputer Science - Discrete Mathematics
researchProduct

Randomized kernels for large scale Earth observation applications

2020

Abstract Current remote sensing applications of bio-geophysical parameter estimation and image classification have to deal with an unprecedented big amount of heterogeneous and complex data sources. New satellite sensors involving a high number of improved time, space and wavelength resolutions give rise to challenging computational problems. Standard physical inversion techniques cannot cope efficiently with this new scenario. Dealing with land cover classification of the new image sources has also turned to be a complex problem requiring large amount of memory and processing time. In order to cope with these problems, statistical learning has greatly helped in the last years to develop st…

FOS: Computer and information sciencesEarth observationComputer Science - Machine Learning010504 meteorology & atmospheric sciencesComputer scienceRemote sensing application0211 other engineering and technologiesSoil Science02 engineering and technologycomputer.software_genre01 natural sciencesMachine Learning (cs.LG)Computers in Earth Sciences021101 geological & geomatics engineering0105 earth and related environmental sciencesRemote sensingContextual image classificationEstimation theoryHyperspectral imagingGeology15. Life on landKernel methodKernel regressionData miningComputational problemcomputerRemote Sensing of Environment
researchProduct

Futures pricing in electricity markets based on stable CARMA spot models

2012

We present a new model for the electricity spot price dynamics, which is able to capture seasonality, low-frequency dynamics and the extreme spikes in the market. Instead of the usual purely deterministic trend we introduce a non-stationary independent increments process for the low-frequency dynamics, and model the large uctuations by a non-Gaussian stable CARMA process. The model allows for analytic futures prices, and we apply these to model and estimate the whole market consistently. Besides standard parameter estimation, an estimation procedure is suggested, where we t the non-stationary trend using futures data with long time until delivery, and a robust L 1 -lter to nd the states of …

FOS: Computer and information sciencesEconomics and EconometricsElectricity spot pricebusiness.industryEstimation theoryRisk premium60G52 62M10 91B84 (Primary) 60G10 60G51 91B70 (Secondary)Lévy processStatistics - ApplicationsCARMA model electricity spot prices electricity forward prices continuous time linear model Lévy process stable CARMA process risk premium robust filterddc:MicroeconomicsFOS: Economics and businessGeneral EnergyBase load power plantPeak loadEconometricsEconomicsApplications (stat.AP)ElectricityPricing of Securities (q-fin.PR)businessFutures contractQuantitative Finance - Pricing of Securities
researchProduct