Search results for "Computer Networks"

showing 10 items of 860 documents

A linear generator for a waveroller power device

2017

In this paper experimental tests on a small scale tubular linear generator to be applied to wave rollers device are presented. A reduced scale of gnerator is presented and experimental results obtained in on test bench are shown. Experimental waveforms of current and voltage are recorded. Simulation results are compared to the experimental ones in order to validate the mathematical models used.

Test benchEngineeringSettore ING-IND/11 - Fisica Tecnica AmbientaleMathematical modelScale (ratio)business.industryAcousticsInstrumentationSettore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciOceanographyAcoustics and Ultrasonicelectric machinePower (physics)Computer Networks and CommunicationLinear congruential generatorAutomotive Engineeringwave energy systemElectronic engineeringWaveformbusinessInstrumentationVoltageOCEANS 2017 - Aberdeen
researchProduct

Graph-based exploration and clustering analysis of semantic spaces

2019

Abstract The goal of this study is to demonstrate how network science and graph theory tools and concepts can be effectively used for exploring and comparing semantic spaces of word embeddings and lexical databases. Specifically, we construct semantic networks based on word2vec representation of words, which is “learnt” from large text corpora (Google news, Amazon reviews), and “human built” word networks derived from the well-known lexical databases: WordNet and Moby Thesaurus. We compare “global” (e.g., degrees, distances, clustering coefficients) and “local” (e.g., most central nodes and community-type dense clusters) characteristics of considered networks. Our observations suggest that …

Text corpusSemantic spacesComputer Networks and CommunicationsComputer sciencegraph theory0211 other engineering and technologiesWordNetNetwork science02 engineering and technologysemanttinen webSemantic networkword2vec similarity networksWord2vec similarity networksClique relaxationscohesive clusters0202 electrical engineering electronic engineering information engineeringWord2vecCluster analysisThesaurus (information retrieval)021103 operations researchMultidisciplinaryInformation retrievalverkkoteorialcsh:T57-57.97Graph theorycliquesGraph theoryclique relaxationsComputational MathematicsCliqueslcsh:Applied mathematics. Quantitative methodssemantic spaces020201 artificial intelligence & image processingCohesive clusters
researchProduct

Distributed Data Clustering via Opinion Dynamics

2015

We provide a distributed method to partition a large set of data in clusters, characterized by small in-group and large out-group distances. We assume a wireless sensors network in which each sensor is given a large set of data and the objective is to provide a way to group the sensors in homogeneous clusters by information type. In previous literature, the desired number of clusters must be specified a priori by the user. In our approach, the clusters are constrained to have centroids with a distance at least ε between them and the number of desired clusters is not specified. Although traditional algorithms fail to solve the problem with this constraint, it can help obtain a better cluste…

Theoretical computer scienceArticle SubjectComputer Networks and Communicationsbusiness.industryComputer scienceGeneral EngineeringConstrained clusteringPartition (database)lcsh:QA75.5-76.95NETWORKSDetermining the number of clusters in a data setConsensusSettore ING-INF/04 - AutomaticaCONSENSUS PROBLEMSWirelesslcsh:Electronic computers. Computer sciencebusinessCluster analysis
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

Gl-learning

2016

In this paper, we present a new open-source software library, Gl-learning, for grammatical inference. The rise of new application scenarios in recent years has required optimized methods to address knowledge extraction from huge amounts of data and to model highly complex systems. Our library implements the main state-of-the-art algorithms in the grammatical inference field (RPNI, EDSM, L*), redesigned through the OpenMP library for a parallel execution that drastically decreases execution times. To our best knowledge, it is also the first comprehensive library including a noise tolerance learning algorithm, such as Blue*, that significantly broadens the range of the potential application s…

Theoretical computer scienceComputer sciencemedia_common.quotation_subjectParallel algorithm0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesField (computer science)Grammatical inferenceSoftwareKnowledge extractionSoftware library0202 electrical engineering electronic engineering information engineering1707media_commonSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGrammarbusiness.industryProgramming languageModular designGrammar inductionHuman-Computer InteractionParallel algorithmRange (mathematics)Computer Networks and Communication010201 computation theory & mathematics020201 artificial intelligence & image processingbusinesscomputerSoftwareProceedings of the 17th International Conference on Computer Systems and Technologies 2016
researchProduct

The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions.

2019

Although the field of learning automata (LA) has made significant progress in the past four decades, the LA-based methods to tackle problems involving environments with a large number of actions is, in reality, relatively unresolved. The extension of the traditional LA to problems within this domain cannot be easily established when the number of actions is very large. This is because the dimensionality of the action probability vector is correspondingly large, and so, most components of the vector will soon have values that are smaller than the machine accuracy permits, implying that they will never be chosen . This paper presents a solution that extends the continuous pursuit paradigm to …

Theoretical computer scienceHierarchical learning automataHierarchy (mathematics)DiscretizationLearning automataComputer Networks and CommunicationsComputer scienceLarge action numbersPursuit learning automata02 engineering and technologyVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420Probability vectorLearning automataComputer Science ApplicationsAutomatonOperator (computer programming)Artificial Intelligence0202 electrical engineering electronic engineering information engineeringBenchmark (computing)Estimator-based learning automata020201 artificial intelligence & image processingVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550SoftwareCurse of dimensionalityIEEE transactions on neural networks and learning systems
researchProduct

Artificial Intelligence + Distributed Systems = Agents

2009

The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms.…

Theoretical computer scienceSpeedupComputer Networks and CommunicationsComputer sciencebusiness.industryDesign elements and principlesBounded rationalityComputer Science ApplicationsSoftwareComputational Theory and MathematicsPosition paperArtificial intelligencebusinessSemantic WebMerge (version control)International Journal of Computers Communications & Control
researchProduct

A Lightweight Network Discovery Algorithm for Resource-constrained IoT Devices

2019

Although quite simple, existing protocols for the IoT suffer from the inflexibility of centralized infrastructures and require several configuration stages. The implementation of these protocols is often prohibitive on resource-constrained devices. In this work, we propose a distributed lightweight implementation of network discovery for simple IoT devices. Our approach is based on the exchange of symbolic executable code among nodes. Based on this abstraction, we propose an algorithm that makes even IoT resource-constrained nodes able to construct the network topology graph incrementally and without any a priori information about device positioning and presence. The minimal set of executab…

Topology constructionSIMPLE (military communications protocol)Computer scienceExecutable code exchangeResource-constrained devicecomputer.file_formatConstruct (python library)Network topologyDistributed processingSet (abstract data type)Computer Networks and CommunicationHardware and ArchitectureA priori and a posterioriGraph (abstract data type)Symbolic processingExecutableInternet of ThingAlgorithmcomputerSoftwareAbstraction (linguistics)2019 International Conference on Computing, Networking and Communications (ICNC)
researchProduct

Mixed Harmonic Elimination Control for a Single-Phase 9 Level Grid-Connected Inverter

2018

The power quality requirements are increasingly stringent, due to the continuous growth of devices connected to the grid that introduce harmonics. These devices include DC to AC energy conversion systems, i.e. grid connected inverters. The design, control and operation of these systems must take into account the rules of interconnection to the electricity grid. To improve the quality of the output waveform of the grid-connected inverter, Multilevel Converters (MC) with selective harmonic elimination modulation technique can be used. This paper presents a single-phase nine level grid-connected inverter with DC/DC input stages. The obtained switching angles for THD minimization are independen…

Total harmonic distortionselective Harmonic elimination (SHE)business.industryComputer scienceTotal Harmonic Distortion (THD)Electrical engineeringModulation indexEnergy Engineering and Power TechnologyConvertersAC powerGridDC-AC conversionHarmonic MitigationSettore ING-IND/31 - ElettrotecnicaComputer Networks and CommunicationArtificial IntelligenceHarmonicsMultilevel InverterWaveformInverterSafety Risk Reliability and Qualitybusiness2018 International Conference on Smart Grid (icSmartGrid)
researchProduct

Indexing Method for Transitive Relationships of Product Information

2008

To successfully use a relational database management system (RDBMS) as a repository for product information, the RDBMS must efficiently process and properly answer ontological queries. The key to processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. In particular, the transitive relationships (e.g., is-a, component-of relationships) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. We propose an efficient index using a numbering scheme (labeling scheme) to process queries over transitive relationships. (This paper is an extended version o…

Transitive relationInformation retrievalComputer Networks and CommunicationsRelational databasecomputer.internet_protocolComputer scienceSearch engine indexingInformationSystems_DATABASEMANAGEMENTOntology (information science)computer.software_genreNumberingDatabase indexNumbering schemeIndex (publishing)Relational database management systemArtificial IntelligenceTaxonomy (general)Product (mathematics)OntologycomputerSoftwareXML2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
researchProduct