Search results for " telecommunications"

showing 10 items of 980 documents

Is There a Predisposition towards the Use of New Technologies within the Traffic Field of Emerging Countries? The Case of the Dominican Republic

2021

Technological devices are becoming more and more integrated in the management and control of traffic in big cities. The population perceives the benefits provided by these systems, and, therefore, citizens usually have a favorable opinion of them. However, emerging countries, which have fewer available infrastructures, could present a certain lack of trust. The objective of this work is to detect the level of knowledge and predisposition towards the use of new technologies in the transportation field of the Dominican Republic. For this study, the National Survey on Mobility was administered to a sample of Dominican citizens, proportional to the ONE census and to sex, age and province. The k…

TK7800-8360Computer Networks and CommunicationsEmerging technologiesProcess (engineering)Sistemes electrònics de seguretatControl (management)PopulationTransportSample (statistics)02 engineering and technology0502 economics and business0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringMarketingeducationEmerging markets050210 logistics & transportationeducation.field_of_studySeguretat viàriamobility in traffic05 social sciences020206 networking & telecommunicationssustainabilityITS systemsWork (electrical)Hardware and ArchitectureControl and Systems EngineeringSignal ProcessingSustainabilityCirculacióBusinessElectronicsroad safetyElectronics
researchProduct

Exploiting programmable architectures for WiFi/ZigBee inter-technology cooperation

2014

The increasing complexity of wireless standards has shown that protocols cannot be designed once for all possible deployments, especially when unpredictable and mutating interference situations are present due to the coexistence of heterogeneous technologies. As such, flexibility and (re)programmability of wireless devices is crucial in the emerging scenarios of technology proliferation and unpredictable interference conditions. In this paper, we focus on the possibility to improve coexistence performance of WiFi and ZigBee networks by exploiting novel programmable architectures of wireless devices able to support run-time modifications of medium access operations. Differently from software…

Technology and EngineeringCognitive networksComputer Networks and CommunicationsComputer scienceDynamic MAC adaptationTime division multiple access02 engineering and technologyMAC protocolMAC protocols0202 electrical engineering electronic engineering information engineeringWirelessCross-technology interferenceINTERFERENCEProtocol prototypingSettore ING-INF/03 - Telecomunicazionibusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsCognitive networkComputer Science ApplicationsEmbedded systemSignal ProcessingInterference avoidanceIBCNWireless network control020201 artificial intelligence & image processingbusinessCognitive networkDecoupling (electronics)Communication channelComputer networkEURASIP Journal on Wireless Communications and Networking
researchProduct

Cross-technology wireless experimentation: Improving 802.11 and 802.15.4e coexistence

2016

In this demo we demonstrate the functionalities of a novel experimentation framework, called WiSHFUL, that facilitates the prototyping and experimental validation of innovative solutions for heterogeneous wireless networks, including cross-technology coordination mechanisms. The framework supports a clean separation between the definition of the logic for optimizing the behaviors of wireless devices and the underlying device capabilities, by means of a unifying platform-independent control interface and programming model. The use of the framework is demonstrated through two representative use cases, where medium access is coordinated between IEEE-802.11 and IEEE-802.15.4 networks.

Technology and EngineeringInterface (Java)Computer scienceDistributed computing02 engineering and technologySynchronization (computer science)0202 electrical engineering electronic engineering information engineeringMedia TechnologyWirelessUse caseCross technology communicationwirelebusiness.industryWireless networkSettore ING-INF/03 - Telecomunicazioni020206 networking & telecommunicationsExperimental validationunified interfacecross technology communicationComputer Networks and CommunicationAPIProgramming paradigm020201 artificial intelligence & image processingIBCNbusinesscontrolComputer network
researchProduct

3D high definition video coding on a GPU-based heterogeneous system

2013

H.264/MVC is a standard for supporting the sensation of 3D, based on coding from 2 (stereo) to N views. H.264/MVC adopts many coding options inherited from single view H.264/AVC, and thus its complexity is even higher, mainly because the number of processing views is higher. In this manuscript, we aim at an efficient parallelization of the most computationally intensive video encoding module for stereo sequences. In particular, inter prediction and its collaborative execution on a heterogeneous platform. The proposal is based on an efficient dynamic load balancing algorithm and on breaking encoding dependencies. Experimental results demonstrate the proposed algorithm's ability to reduce the…

Technology and EngineeringTheoretical computer scienceGeneral Computer ScienceComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyVideo encodingParallelizationsCollaborative execution0202 electrical engineering electronic engineering information engineeringReference algorithmElectrical and Electronic EngineeringHigh definition video codingMODE DECISION020206 networking & telecommunicationsInter predictionHeterogeneous systemsHeterogeneous platformsHigh-definition videoComputer engineeringSingle viewControl and Systems EngineeringHigh definition020201 artificial intelligence & image processingDynamic load balancing algorithmsEncoderDynamic load balancing algorithmCoding (social sciences)
researchProduct

Work Partitioning on Parallel and Distributed Agent-Based Simulation

2017

Work partitioning is a key challenge with ap- plications in many scientific and technological fields. The problem is very well studied with a rich literature on both distributed and parallel computing architectures. In this paper we deal with the work partitioning problem for parallel and distributed agent-based simulations which aims at (i) balancing the overall load distribution, (ii) minimizing, at the same time, the communication overhead due to agents' inter-dependencies. We introduce a classification taxonomy of work partitioning strategies and present a space-based work partitioning ap- proach, based on a Quad-tree data structure, which enables to: identify a good space partitioning …

Theoretical computer scienceComputational complexity theoryComputer Networks and CommunicationsComputer scienceDistributed computingContext (language use)02 engineering and technologyParallel ComputingSynchronization (computer science)0202 electrical engineering electronic engineering information engineeringOverhead (computing)Space partitioningAgent-based simulation020203 distributed computingAgent-based simulations; D-MASON; Distributed Systems; Parallel Computing; Work partitioning; Hardware and Architecture; Computer Networks and Communications; Information SystemsFlocking (behavior)Agent-based simulations020206 networking & telecommunicationsWork partitioningData structureDistributed SystemComputer Networks and CommunicationD-MASONDistributed SystemsHardware and ArchitectureBoidsInformation Systems2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
researchProduct

On enhancing the object migration automaton using the Pursuit paradigm

2017

Abstract One of the most difficult problems that is all-pervasive in computing is that of partitioning. It has applications in the partitioning of databases into relations, the realization of the relations themselves into sub-relations based on the partitioning of the attributes, the assignment of processes to processors, graph partitioning, and the task assignment problem, etc. The problem is known to be NP-hard. The benchmark solution for this for the Equi-Partitioning Problem (EPP) has involved the classic field of Learning Automata (LA), and the corresponding algorithm, the Object Migrating Automata (OMA) has been used in all of these application domains. While the OMA is a fixed struct…

Theoretical computer scienceGeneral Computer ScienceLearning automatabusiness.industryComputer scienceGraph partition020206 networking & telecommunications02 engineering and technologyObject (computer science)Field (computer science)Theoretical Computer ScienceAutomatonTask (computing)Modeling and Simulation0202 electrical engineering electronic engineering information engineeringBenchmark (computing)020201 artificial intelligence & image processingArtificial intelligencebusinessAssignment problem
researchProduct

Projector operators in clustering

2016

In a recent paper, the notion of quantum perceptron has been introduced in connection with projection operators. Here, we extend this idea, using these kind of operators to produce a clustering machine, that is, a framework that generates different clusters from a set of input data. Also, we consider what happens when the orthonormal bases first used in the definition of the projectors are replaced by frames and how these can be useful when trying to connect some noised signal to a given cluster. Copyright © 2016 John Wiley & Sons, Ltd.

Theoretical computer scienceGeneral MathematicsGeneral Engineering020206 networking & telecommunications02 engineering and technologyPerceptronlaw.inventionConnection (mathematics)Set (abstract data type)ProjectorlawPattern recognition (psychology)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingOrthonormal basisProjection (set theory)Cluster analysisMathematicsMathematical Methods in the Applied Sciences
researchProduct

User Grouping and Power Allocation in NOMA Systems: A Reinforcement Learning-Based Solution

2020

In this paper, we present a pioneering solution to the problem of user grouping and power allocation in Non-Orthogonal Multiple Access (NOMA) systems. There are two fundamentally salient and difficult issues associated with NOMA systems. The first involves the task of grouping users together into the pre-specified time slots. The subsequent second phase augments this with the solution of determining how much power should be allocated to the respective users. We resolve this with the first reported Reinforcement Learning (RL)-based solution, which attempts to solve the partitioning phase of this issue. In particular, we invoke the Object Migration Automata (OMA) and one of its variants to re…

Theoretical computer scienceLearning automataComputer science020206 networking & telecommunications02 engineering and technologymedicine.diseaseTask (project management)AutomatonPower (physics)NomaSalient0202 electrical engineering electronic engineering information engineeringmedicineReinforcement learningGreedy algorithm
researchProduct

Optimizing channel selection for cognitive radio networks using a distributed Bayesian learning automata-based approach

2015

Consider a multi-channel Cognitive Radio Network (CRN) with multiple Primary Users (PUs), and multiple Secondary Users (SUs) competing for access to the channels. In this scenario, it is essential for SUs to avoid collision among one another while maintaining efficient usage of the available transmission opportunities. We investigate two channel access schemes. In the first model, an SU selects a channel and sends a packet directly without Carrier Sensing (CS) whenever the PU is absent on this channel. In the second model, an SU invokes CS in order to avoid collision among co-channel SUs. For each model, we analyze the channel selection problem and prove that it is a so-called "Exact Potent…

Theoretical computer scienceLearning automataComputer sciencebusiness.industryNetwork packet020206 networking & telecommunications02 engineering and technologyBayesian inferenceAutomatonsymbols.namesakeCognitive radioTransmission (telecommunications)Artificial IntelligenceNash equilibrium0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processingArtificial intelligencebusinessCommunication channelApplied Intelligence
researchProduct

Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

2018

In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineTheoretical computer scienceComputational complexity theoryComputer science020208 electrical & electronic engineering020206 networking & telecommunications02 engineering and technologyUpper and lower boundsAutomatonNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESSimple (abstract algebra)0202 electrical engineering electronic engineering information engineeringState (computer science)Representation (mathematics)Computer Science::Formal Languages and Automata Theory
researchProduct