Search results for "distributed"

showing 10 items of 1260 documents

A Novel Deep Learning Stack for APT Detection

2019

We present a novel Deep Learning (DL) stack for detecting Advanced Persistent threat (APT) attacks. This model is based on a theoretical approach where an APT is observed as a multi-vector multi-stage attack with a continuous strategic campaign. To capture these attacks, the entire network flow and particularly raw data must be used as an input for the detection process. By combining different types of tailored DL-methods, it is possible to capture certain types of anomalies and behaviour. Our method essentially breaks down a bigger problem into smaller tasks, tries to solve these sequentially and finally returns a conclusive result. This concept paper outlines, for example, the problems an…

Advanced persistent threatProcess (engineering)Computer science020209 energyDistributed computing02 engineering and technologylcsh:Technologylcsh:ChemistryStack (abstract data type)020204 information systemsAdvanced Persistent Thread (APT)0202 electrical engineering electronic engineering information engineeringGeneral Materials Sciencetietoturvalcsh:QH301-705.5Instrumentationta113Fluid Flow and Transfer Processeslcsh:Tbusiness.industryProcess Chemistry and TechnologyDeep learningGeneral EngineeringFlow networklcsh:QC1-999Computer Science Applicationsnetwork anomaly detectionkoneoppiminenlcsh:Biology (General)lcsh:QD1-999lcsh:TA1-2040Deep Learning (DL)Artificial intelligencelcsh:Engineering (General). Civil engineering (General)Raw databusinessverkkohyökkäyksetlcsh:Physics
researchProduct

A Bio-Inspired Cognitive Agent for Autonomous Urban Vehicles Routing Optimization

2017

Autonomous urban vehicle prototypes are expected to be efficient even in not explicitly planned circumstances and dynamic environments. The development of autonomous vehicles for urban driving needs real-time information from vehicles and road network to optimize traffic flows. In traffic agent-based models, each vehicle is an agent, while the road network is the environment. Cognitive agents are able to reason on the perceived data, to evaluate the information obtained by reasoning, and to learn and respond, preserving their self-sufficiency, independency, self-determination, and self-reliance. In this paper, a bio-inspired cognitive agent for autonomous urban vehicles routing optimization…

Agent behaviorComputer scienceProcess (engineering)Functional featuresDistributed computingMetabolic network020206 networking & telecommunications02 engineering and technologyvehicular ad hoc networks (VANETs)Urban roadCognitive agentArtificial IntelligenceAutonomous urban vehicles routing optimization0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingRouting (electronic design automation)cellular metabolismSoftwareSimulationCell survivalcognitive agentIEEE Transactions on Cognitive and Developmental Systems
researchProduct

SW—Soil and Water

2002

Abstract Recent research has directed attention to the size distribution of eroded material because of its influence on deposition mechanics and in carrying capacity of pollutant materials. At first, in this paper the relationship between aggregate breakdown mechanism and erosion processes is briefly reviewed. Then the link between the clay enrichment ratio and the sediment delivery ratio at morphological unit scale is investigated. For 129 soil samples well distributed over the Sicilian Sparacia basin, the values for the experimental clay enrichment ratio calculated by the measured ultimate grain-size distributions are compared with the theoretical clay enrichment ratio values obtained by …

Aggregate (composite)Soil testDistributed element modelSoil ScienceMineralogySedimentSedimentationDeposition (geology)Control and Systems EngineeringParticle-size distributionErosionAgronomy and Crop ScienceGeologyFood ScienceBiosystems Engineering
researchProduct

Ensuring High Performance of Consensus-Based Estimation by Lifetime Maximization in WSNs

2015

The estimation of a parameter corrupted by noise is a common tasks in wireless sensor networks, where the deployed nodes cooperate in order to improve their own inaccurate observations. This cooperation usually involves successive data exchanges and local information updates until a global consensus value is reached. The quality of the final estimator depends on the amount of collected observations, hence the number of active nodes. Moreover, the inherent iterative nature of the consensus process involves a certain energy consumption. Since the devices composing the network are usually battery powered, nodes becoming inactive due to battery depletion emerges as a serious problem. In this wo…

Algebraic connectivityComputer scienceDistributed computingTopology optimizationProcess (computing)EstimatorMaximizationEnergy consumptionNetwork topologyWireless sensor network2015 International Conference on Distributed Computing in Sensor Systems
researchProduct

Ancestral Reconstruction and Investigations of Genomic Recombination on some Pentapetalae Chloroplasts

2019

Abstract In this article, we propose a semi-automated method to rebuild genome ancestors of chloroplasts by taking into account gene duplication. Two methods have been used in order to achieve this work: a naked eye investigation using homemade scripts, whose results are considered as a basis of knowledge, and a dynamic programming based approach similar to Needleman-Wunsch. The latter fundamentally uses the Gestalt pattern matching method of sequence matcher to evaluate the occurrences probability of each gene in the last common ancestor of two given genomes. The two approaches have been applied on chloroplastic genomes from Apiales, Asterales, and Fabids orders, the latter belonging to Pe…

Ancestral reconstructionMost recent common ancestor0206 medical engineeringGenomic recombination02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Dynamic programmingGenome[INFO.INFO-IU]Computer Science [cs]/Ubiquitous ComputingEvolution Molecular[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]AsteralesGene duplication0202 electrical engineering electronic engineering information engineeringPattern matchingGenome ChloroplastRosaceaeResearch ArticlesPhylogenySequence (medicine)Recombination GeneticbiologyGeneral Medicinebiology.organism_classification[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationAncestral genome reconstructionApialesEvolutionary biology[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Pentapetalae chloroplasts020602 bioinformaticsTP248.13-248.65BiotechnologyJournal of Integrative Bioinformatics
researchProduct

Oscillation criteria for even-order neutral differential equations

2016

Abstract We study oscillatory behavior of solutions to a class of even-order neutral differential equations relating oscillation of higher-order equations to that of a pair of associated first-order delay differential equations. As illustrated with two examples in the final part of the paper, our criteria improve a number of related results reported in the literature.

Applied Mathematics010102 general mathematicsMathematical analysisDelay differential equation01 natural sciences010101 applied mathematicsExamples of differential equationsStochastic partial differential equationNonlinear systemDistributed parameter systemSimultaneous equationsCollocation method0101 mathematicsDifferential algebraic equationMathematics
researchProduct

A Hardware and Secure Pseudorandom Generator for Constrained Devices

2018

Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…

Applied cryptography; Chaotic circuits; Constrained devices; Discrete dynamical systems; FPGA; Lightweight Cryptography; Random number generators; Statistical tests; Control and Systems Engineering; Information Systems; Computer Science Applications1707 Computer Vision and Pattern Recognition; Electrical and Electronic EngineeringHardware security moduleComputer scienceRandom number generationCryptography[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technologyPseudorandom generatorConstrained devicesLightweight CryptographyChaotic circuits[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]PermutationRandom number generatorsStatistical tests0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringField-programmable gate arrayThroughput (business)FPGAPseudorandom number generatorGenerator (category theory)business.industry020208 electrical & electronic engineeringComputer Science Applications1707 Computer Vision and Pattern Recognition020206 networking & telecommunicationsDiscrete dynamical systems[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationComputer Science ApplicationsApplied cryptography[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Control and Systems EngineeringKey (cryptography)[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessComputer hardwareInformation SystemsIEEE Transactions on Industrial Informatics
researchProduct

Hopfield Neural Network - Based Approach for Joint Dynamic Resource Allocation in Heterogeneous Wireless Networks

2006

This paper presents a comprehensive approach to solve the problem of joint dynamic resource allocation (JDRA) in heterogeneous wireless networks using a Hopfield neural network (HNN). A generic formulation for packet services with delay constraints is proposed to decide the optimal bit rate and radio access technology (RAT) allocation. Some illustrative simulations results in a basic scenario are presented to evaluate performance of the proposed algorithm.

Artificial neural networkComputer scienceWireless networkRadio access technologyNetwork packetDistributed computingBit rateResource allocationJoint (audio engineering)Dynamic resourceIEEE Vehicular Technology Conference
researchProduct

Joint Dynamic Resource Allocation for Coupled Heterogeneous Wireless Networks Based on Hopfield Neural Networks

2008

This paper proposes an algorithm to solve the problem of Joint Dynamic Resource Allocation in heterogeneous wireless networks. The algorithm is based on Hopfield Neural Networks to achieve fast and suboptimal solutions. The generic formulation is particularized and evaluated in an HSDPA and 802.11e WLAN coupled networks. Some illustrative simulations results are presented to evaluate the performance of the new algorithm as compared with other strategies. The obtained results confirm the validity of the proposal.

Artificial neural networkWireless networkComputer scienceDistributed computingComputer Science::Networking and Internet ArchitectureLocal area networkHeterogeneous wireless networkResource allocationThroughputResource managementIEEE 802.11e-2005VTC Spring 2008 - IEEE Vehicular Technology Conference
researchProduct

Distributed Consensus in Networks of Dynamic Agents

2006

Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…

Asymptotic stability; Distributed consensus protocolsEngineeringMathematical optimizationAsymptotic stabilitybusiness.industryFunction (mathematics)Network topologyUniform consensusComputer Science::Multiagent SystemsLTI system theorySet (abstract data type)Distributed consensus protocolsConsensusExponential stabilityComputer Science::Systems and ControlControl theoryexperimental mechanics Fourier transform load stepping photoelasticityGeneralized meanbusinessProceedings of the 44th IEEE Conference on Decision and Control
researchProduct