Search results for "telecommunications"

showing 10 items of 1639 documents

An innovative approach towards E-health in development of tele auscultation system for heart using GSM mobile communication technology

2013

Health is one of the major issues for normal existence of human life and it is a global agenda to increase the health care facilities for the peoples who don't have an immediate access to these facilities and are living in rural and undeveloped areas. From the beginning of twenty first century field of E-health has been developed rapidly to encounter these problems properly. The healthcare infrastructure gaining betterment day by day under the shadow of E-health technologies, where using mobile phones are becoming an efficient tool in monitoring and transmitting different physiological signals. Cardiac sound is an initiative physiological parameter that is helpful for diagnosing changes in …

Telemedicinemedicine.diagnostic_testStethoscopeComputer sciencebusiness.industryRemote patient monitoringMobile computingAuscultationlaw.inventionGSMlawHeart soundsmedicineMobile telephonybusinessTelecommunications2013 IEEE 19th International Symposium for Design and Technology in Electronic Packaging (SIITME)
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

Automata and forbidden words

1998

Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automaton0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automaton0202 electrical engineering electronic engineering information engineeringTwo-way deterministic finite automatonNondeterministic finite automatonMathematicsPowerset constructionLevenshtein automaton020206 networking & telecommunicationsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science ApplicationsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsSignal ProcessingProbabilistic automatonComputer Science::Programming LanguagesComputer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

Electric vehicles and psychology

2021

The popularity of electric vehicles is evidenced by the broad range of manufacturers presenting new models of plug-in hybrid and battery vehicles. However, the success of the revolution or, rather, the rebirth of electric vehicles, is hanging by a thread, as it lacks the involvement of a large number of users, and many psychological mechanisms hinder it. What are users’ true feelings about this new world of vehicles? Are people ready for the fifth level of automation, i.e., fully automatic driving and the absence of the driving position? The purpose of this paper is to present and discuss the psychological aspects that influence the adoption of electric vehicles. Topics such as the chicken …

Thread (network protocol)Electric vehiclesPublic perception020209 energymedia_common.quotation_subjectGeography Planning and DevelopmentTJ807-830Battery02 engineering and technologyManagement Monitoring Policy and LawTD194-195Renewable energy sourcesChicken and egg paradox0502 economics and business0202 electrical engineering electronic engineering information engineeringGE1-350Range anxietymedia_common050210 logistics & transportationRange anxietyEnvironmental effects of industries and plantsRenewable Energy Sustainability and the Environmentbusiness.industry05 social sciencesPopularityAutomationKey motivators and barriersIronyEnvironmental sciencesFully automaticPosition (finance)Psychological aspectsTelecommunicationsbusiness
researchProduct

Indoor free space optics link under the weak turbulence regime: Measurements and model validation

2015

In this study, the authors present the measurements performed on a free space optics (FSO) communications link using an indoor atmospheric chamber. In particular, the authors have generated several different optical turbulence conditions, demonstrating how even the weak turbulence regime can strongly affect the FSO link performance. The authors have carried out an in-depth analysis of the data collected during the measurements, and calculated the turbulence strength (i.e. scintillation index and Rytov variance) and the important performance metrics (i.e. the Q-factor and bit error rate) to evaluate the FSO link quality. Moreover, the authors have tested, for the first time, an appositely de…

Time seriesComputer scienceOptical linksIrradianceGamma gamma channel modelSettore ING-INF/01 - ElettronicaScintillation indexoptical turbulenceQuality (physics)TEORIA DE LA SEÑAL Y COMUNICACIONESStatistical physicsError statisticsElectrical and Electronic EngineeringComunicació i tecnologiaScintillationtime-correlated channel modelbusiness.industryTurbulenceSettore ING-INF/03 - TelecomunicazioniIndoor atmospheric chamberRytov varianceAtmospheric turbulenceExperimental dataQ-factorTurbulence strengthSettore ING-INF/02 - Campi ElettromagneticiÒpticaComputer Science ApplicationsBit error rateQ factorFree Space OpticBit error rateGamma-Gamma modelIndoor free space optics communications linkTelecommunicationsbusinessFree-space optical communicationindoor link
researchProduct