Search results for "coding"

showing 10 items of 920 documents

Topology Inference and Signal Representation Using Dictionary Learning

2019

This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…

Computer science0202 electrical engineering electronic engineering information engineeringInferenceGraph (abstract data type)Topological graph theory020206 networking & telecommunications020201 artificial intelligence & image processingTopology inference02 engineering and technologyNeural codingAlgorithmDictionary learningGraph2019 27th European Signal Processing Conference (EUSIPCO)
researchProduct

Reestimating a minimum acceptable geocoding hit rate for conducting a spatial analysis

2019

Geocoding consists in converting a textual description of a location into coordinates. Hence, geocoding a dataset of events has to be carried out before performing a spatial analysis of some data. ...

Computer science05 social sciencesGeography Planning and Development0211 other engineering and technologies0507 social and economic geography02 engineering and technologyLibrary and Information Sciencescomputer.software_genreGeocodingHit rateData mining050703 geographycomputer021101 geological & geomatics engineeringInformation SystemsInternational Journal of Geographical Information Science
researchProduct

Interchannel Interference and Mitigation in Distributed MIMO RF Sensing

2021

In this paper, we analyze and mitigate the cross-channel interference, which is found in multiple-input multiple-output (MIMO) radio frequency (RF) sensing systems. For a millimeter wave (mm-Wave) MIMO system, we present a geometrical three-dimensional (3D) channel model to simulate the time-variant (TV) trajectories of a moving scatterer. We collected RF data using a state-of-the-art radar known as Ancortek SDR-KIT 2400T2R4, which is a frequency-modulated continuous wave (FMCW) MIMO radar system operating in the K-band. The Ancortek radar is currently the only K-band MIMO commercial radar system that offers customized antenna configurations. It is shown that this radar system encounters th…

Computer science3D channel modelMIMOVDP::Informasjons- og kommunikasjonsteknologi: 550Data_CODINGANDINFORMATIONTHEORYTP1-1185Interference (wave propagation)BiochemistryVDP::Information and communication technology: 550ArticleAnalytical Chemistrylaw.inventionmillimeter wave (mm-Wave)lawElectronic engineeringElectrical and Electronic EngineeringRadarInstrumentationsensor networkComputer Science::Information Theoryinterchannel interferencedistributed MIMOmicro-Doppler signaturesChemical technologyPropagation delayAtomic and Molecular Physics and OpticsRF sensingVDP::Teknologi: 500Extremely high frequencyFMCWRadio frequencyAntenna (radio)Wireless sensor networkSensors
researchProduct

Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization

2018

Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.

Computer scienceAnt colony optimization algorithmsMathematicsofComputing_NUMERICALANALYSISMerkle–Hellman knapsack cryptosystemPlaintextData_CODINGANDINFORMATIONTHEORYAnt colonyComputingMethodologies_ARTIFICIALINTELLIGENCElaw.inventionKnapsack problemlawTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYCryptosystemCryptanalysisAlgorithmMetaheuristicSSRN Electronic Journal
researchProduct

Performance of Hybrid-ARQ with Incremental Redundancy over Double Rayleigh Fading Channels

2011

In this paper, we study the performance of hybrid automatic repeat request (HARQ) with incremental redundancy (IR) over double Rayleigh channels. Such channels can be used to model the fading amplitude for vehicle-to-vehicle (V2V) communications. We study the performance of HARQ from an information theoretic perspective. Analytical expressions are derived for the $\epsilon$-outage capacity, the average number of transmissions, and the average transmission rate for HARQ with IR, assuming a maximum number of rounds for the HARQ protocol. In our study, the communication rate per HARQ round is adjusted to the average signal-to-noise ratio (SNR) such that a target outage probability is not excee…

Computer scienceAutomatic repeat requestTransmitterHybrid automatic repeat requestSpectral efficiencyRedundancy (information theory)Channel state informationRedundancy (engineering)Electronic engineeringFadingAlgorithmDecoding methodsComputer Science::Information TheoryRayleigh fadingCommunication channel2011 IEEE 73rd Vehicular Technology Conference (VTC Spring)
researchProduct

Part of Speech Tagging Using Hidden Markov Models

2020

Abstract In this paper, we present a wide range of models based on less adaptive and adaptive approaches for a PoS tagging system. These parameters for the adaptive approach are based on the n-gram of the Hidden Markov Model, evaluated for bigram and trigram, and based on three different types of decoding method, in this case forward, backward, and bidirectional. We used the Brown Corpus for the training and the testing phase. The bidirectional trigram model almost reaches state of the art accuracy but is disadvantaged by the decoding speed time while the backward trigram reaches almost the same results with a way better decoding speed time. By these results, we can conclude that the decodi…

Computer scienceBrown CorpusSpeech recognitionBigramTrigramHidden Markov modelTag systemSentenceWord (computer architecture)Decoding methodsInternational Journal of Advanced Statistics and IT&C for Economics and Life Sciences
researchProduct

Scalable Creation of Long-Lived Multipartite Entanglement.

2017

We demonstrate the deterministic generation of multipartite entanglement based on scalable methods. Four qubits are encoded in Ca+40, stored in a microstructured segmented Paul trap. These qubits are sequentially entangled by laser-driven pairwise gate operations. Between these, the qubit register is dynamically reconfigured via ion shuttling operations, where ion crystals are separated and merged, and ions are moved in and out of a fixed laser interaction zone. A sequence consisting of three pairwise entangling gates yields a four-ion Greenberger-Horne-Zeilinger state |ψ=(1/2)(|0000+|1111), and full quantum state tomography reveals a state fidelity of 94.4(3)%. We analyze the decoherence o…

Computer scienceCiencias Físicasmedia_common.quotation_subjectGeneral Physics and AstronomyFidelityFOS: Physical sciencesData_CODINGANDINFORMATIONTHEORY02 engineering and technologySquashed entanglement01 natural sciencesMultipartite entanglement//purl.org/becyt/ford/1 [https]Computer Science::Emerging TechnologiesQuantum mechanics0103 physical sciencesComputación Cuántica010306 general physicsmedia_commonQuantum PhysicsTheoryofComputation_GENERAL//purl.org/becyt/ford/1.3 [https]Quantum Physics021001 nanoscience & nanotechnologyIones FríosAstronomíaScalabilityIon trapW state0210 nano-technologyQuantum Physics (quant-ph)CIENCIAS NATURALES Y EXACTASPhysical review letters
researchProduct

Encriptación óptica empleando llaves Weierstrass-Mandelbrot

2013

[EN] This paper presents the generation of encryption keys using the local oscillating properties of the partial sums of Weierstrass-Mandelbrot fractal function. In this way, the security key can be replicated if the parameters used to obtain it are known. Therefore, these parameters can be sent instead of sending the key. This procedure reduces the amount of information to be sent and prevents possible interception of the key. Moreover, the key can not be affected by data loss or pollution. The effectiveness of the Weierstrass-Mandelbrot keys were demonstrated by computer simulation in a 4f optical encryption system and the double random phase encoding technique. These keys allow us to enc…

Computer scienceCiencias FísicasÓptica y FotónicaData securityLlaveData lossEncryptionComputer securitycomputer.software_genrelcsh:Education (General)Doble máscaraDouble-masked//purl.org/becyt/ford/1 [https]FractalEncoding (memory)Encriptación ópticaOptical cryptographyCiencias ExactasÓpticaclaves o llavesbusiness.industryFunction (mathematics)//purl.org/becyt/ford/1.3 [https]encriptaciónOptical encryptionoptical cryptography fractal key double-maskedFractal keybusinesslcsh:L7-991FractalAlgorithmcomputerCIENCIAS NATURALES Y EXACTAScriptografíaencriptación óptica fractal llave doble máscara
researchProduct

Enhancing HSUPA system level performance with dual carrier capability

2010

The purpose of this paper is to analyze how dual carrier capability can enhance High Speed Uplink Packet Access performance in comparison to using only single carrier. Dual carrier operation gives the User Equipment the possibility to transmit simultaneously using two 5 MHz bands, theoretically doubling the peak data rates and user throughput. The analysis is conducted with a system level simulation tool. This paper first indicates with single carrier simulations that, especially in small cells, terminals have spare power available for dual carrier operation. These observations are verified with dual carrier simulations by showing that the burst throughput can be practically doubled. In the…

Computer scienceCode division multiple accessbusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSSystem-level simulationData_CODINGANDINFORMATIONTHEORYInterference (wave propagation)Electronic mailSpread spectrumUser equipmentElectronic engineeringFadingbusinessThroughput (business)Computer networkIEEE 5th International Symposium on Wireless Pervasive Computing 2010
researchProduct

Single neuron binding properties and the magical number 7

2008

When we observe a scene, we can almost instantly recognize a familiar object or can quickly distinguish among objects differing by apparently minor details. Individual neurons in the medial temporal lobe of humans have been shown to be crucial for the recognition process, and they are selectively activated by different views of known individuals or objects. However, how single neurons could implement such a sparse and explicit code is unknown and almost impossible to investigate experimentally. Hippocampal CA1 pyramidal neurons could be instrumental in this process. Here, in an extensive series of simulations with realistic morphologies and active properties, we demonstrate how n radial (ob…

Computer scienceCognitive NeuroscienceModels NeurologicalHippocampusCA1 pyramidal neuronHippocampusTemporal lobesynaptic integrationmedicineCode (cryptography)Humansoblique dendritesNeuronsbinding proceSettore INF/01 - InformaticahippocampuProcess (computing)Oblique casefood and beveragesObject (computer science)computational modelmedicine.anatomical_structureMemory Short-TermNeuronNeural codingNeuroscience
researchProduct