Search results for "Data type"

showing 10 items of 1183 documents

PARAMETER BOUNDED ESTIMATION FOR QUASISPECIES MODELS OF MOLECULAR EVOLUTION

2006

Abstract The Quasispecies models identification for Evolutionary Dynamics is considered in a worst-case deterministic setting. These models analyze the DNA and RNA evolution or describe the population dynamics of viruses and bacteria. In this paper we identify the Fitness and the Replication Probability parameters of a genetic sequences, subject to a set of stringent constraints to have physical meaning and to guarantee positiveness. The conditional central estimate and the Uncertainty Intervals are determined. The effectiveness of the proposed procedure has been illustrated by means of simulation experiments while tests on real data are under concern.

Set (abstract data type)education.field_of_studyMathematical optimizationIdentification (information)Molecular evolutionBounded functionPopulationReplication (statistics)Viral quasispeciesBiologyeducationEvolutionary dynamicsIFAC Proceedings Volumes
researchProduct

Detection of Anomalous HTTP Requests Based on Advanced N-gram Model and Clustering Techniques

2013

Nowadays HTTP servers and applications are some of the most popular targets for network attacks. In this research, we consider an algorithm for HTTP intrusions detection based on simple clustering algorithms and advanced processing of HTTP requests which allows the analysis of all queries at once and does not separate them by resource. The method proposed allows detection of HTTP intrusions in case of continuously updated web-applications and does not require a set of HTTP requests free of attacks to build the normal user behaviour model. The algorithm is tested using logs acquired from a large real-life web service and, as a result, all attacks from these logs are detected, while the numbe…

Set (abstract data type)n-gramResource (project management)Computer scienceServerAnomaly detectionIntrusion detection systemData miningWeb serviceCluster analysiscomputer.software_genrecomputer
researchProduct

Homogeneous Suslinian Continua

2011

AbstractA continuumis said to be Suslinian if it does not contain uncountably many mutually exclusive non-degenerate subcontinua. Fitzpatrick and Lelek have shown that a metric Suslinian continuum X has the property that the set of points at which X is connected im kleinen is dense in X. We extend their result to Hausdorff Suslinian continua and obtain a number of corollaries. In particular, we prove that a homogeneous, non-degenerate, Suslinian continuum is a simple closed curve and that each separable, non-degenerate, homogenous, Suslinian continuum is metrizable.

Set (abstract data type)symbols.namesakePure mathematicsProperty (philosophy)Continuum (topology)General MathematicsMetrization theoremMetric (mathematics)symbolsHausdorff spaceJordan curve theoremSeparable spaceMathematicsCanadian Mathematical Bulletin
researchProduct

An Introduction to Computational Complexity

2016

This chapter is not strictly about algebra. However, this chapter offers a set of mathematical and computational instruments that will allow us to introduce several concepts in the following chapters. Moreover, the contents of this chapter are related to algebra as they are ancillary concepts that help (and in some cases allow) the understanding of algebra.

Set (abstract data type)symbols.namesakeTheoretical computer scienceComputational complexity theoryComputer scienceAsymptotic computational complexityWorst-case complexitysymbolsComputational problemAlgebra over a fieldComputational resourceHuffman coding
researchProduct

Segmentation and feature extraction in capillaroscopic videos

2015

This contribution describes a method to select regions of interest as capillaries of the oral mucosa and to extract their main features useful for real diagnosis purposes. A discrete version of the wavelet transform has been adopted for segmenting the images coming from video sequences acquired by a prototype capillaroscopic, able to put in evidence the red blood flow. A set of proper characteristics is automatically computed for a correct evaluation of the peripheral microcirculation.

Settore INF/01 - InformaticaComputer sciencebusiness.industryFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONWavelet transformVideo sequenceSet (abstract data type)Oral capillaroscopic videos wavelet segmentation feature extractionPeripheral microcirculationComputer visionSegmentationArtificial intelligencebusiness
researchProduct

Graph Comparison and Artificial Models for Simulating Real Criminal Networks

2021

Network Science is an active research field, with numerous applications in areas like computer science, economics, or sociology. Criminal networks, in particular, possess specific topologies which allow them to exhibit strong resilience to disruption. Starting from a dataset related to meetings between members of a Mafia organization which operated in Sicily during 2000s, we here aim to create artificial models with similar properties. To this end, we use specific tools of Social Network Analysis, including network models (Barabási-Albert identified to be the most promising) and metrics which allow us to quantify the similarity between two networks. To the best of our knowledge, the DeltaCo…

Settore INF/01 - Informaticabusiness.industryComplex networksContext (language use)Network scienceGraph theoryComplex networkGraph comparisonMachine learningcomputer.software_genreNetwork topologyCriminal networksGraph similarityGraph theorySocial network analysisGraph (abstract data type)Graph matchingArtificial intelligencebusinessResilience (network)Social network analysiscomputer
researchProduct

Graph-based minimal path tracking in the skeleton of the retinal vascular network

2012

This paper presents a semi-automatic framework for minimal path tracking in the skeleton of the retinal vascular network. The method is based on the graph structure of the vessel network. The vascular network is represented based on the skeleton of the available segmented vessels and using an undirected graph. Significant points on the skeleton are considered nodes of the graph, while the edge of the graph is represented by the vessel segment linking two neighboring nodes. The graph is represented then in the form of a connectivity matrix, using a novel method for defining vertex connectivity. Dijkstra and Floyd-Warshall algorithms are applied for detection of minimal paths within the graph…

Settore INF/01 - Informaticabusiness.industryComputer sciencePath trackingGraph theoryImage segmentationGraph bandwidthRetinal Images Graphs Dijkstra Floyd-WarshallGraph (abstract data type)Computer visionArtificial intelligencebusinessBeta skeletonDijkstra's algorithmAlgorithmRandom geometric graphMathematicsofComputing_DISCRETEMATHEMATICS2012 25th IEEE International Symposium on Computer-Based Medical Systems (CBMS)
researchProduct

Ionic shortcut currents via manifolds in reverse electrodialysis stacks

2020

Abstract Reverse electrodialysis (RED) is a blue energy technology for clean and sustainable electricity harvesting from the mixing entropy of salinity gradients. Recently, many efforts have been devoted to improving the performance of RED units by developing new ion-exchange membranes and by reducing the detrimental phenomena affecting the process. Among these sources of “irreversibility”, the shortcut currents (or parasitic currents) flowing through alternative pathways may affect the process efficiency. Although such phenomena occur in several electrochemical processes (e.g. fuel cells, bipolar plate cells and vanadium redox flow batteries), they have received a poor attention in RED uni…

Settore ING-IND/26 - Teoria Dello Sviluppo Dei Processi ChimiciMaterials scienceGeneral Chemical Engineering02 engineering and technology7. Clean energyElectromembrane process020401 chemical engineeringElectrical resistance and conductanceStack (abstract data type)Reverse electrodialysisReversed electrodialysisGeneral Materials Science0204 chemical engineeringProcess engineeringIonic shortcut currentsWater Science and TechnologyIon exchange membraneParasitic phenomenaSalinity gradient energybusiness.industryMechanical EngineeringGeneral ChemistryElectrodialysis021001 nanoscience & nanotechnologyEnergy technology6. Clean waterMembraneSettore ING-IND/23 - Chimica Fisica ApplicataElectricity0210 nano-technologybusinessEnergy source
researchProduct

CFD analysis of the fluid flow behavior in a reverse electrodialysis stack

2012

Salinity Gradient Power by Reverse Electrodialysis (SGP-RE) technology allows the production of electricity from the different chemical potentials of two differently concentrated salty solutions flowing in alternate channels suitably separated by selective ion exchange membranes. In SGP-RE, as well as in conventional ElectroDialysis (ED) technology, the process performance dramatically depends on the stack geometry and the internal fluid dynamics conditions: optimizing the system geometry in order to guarantee lower pressure drops (DP) and uniform flow rates distribution within the channels is a topic of primary importance. Although literature studies on Computational Fluid Dynamics (CFD) a…

Settore ING-IND/26 - Teoria Dello Sviluppo Dei Processi ChimiciSpacer-filled channelSettore ING-IND/25 - Impianti ChimiciOcean Engineering02 engineering and technology010501 environmental sciencesComputational fluid dynamics01 natural sciencesStack (abstract data type)Reversed electrodialysisFluid dynamicsOsmotic powerStack designPressure dropSettore ING-IND/19 - Impianti NucleariSimulation0105 earth and related environmental sciencesWater Science and Technologybusiness.industryChemistryModelingProcess (computing)MechanicsElectrodialysis021001 nanoscience & nanotechnologyPollution6. Clean waterCFD; Modeling; Stack design; Pressure drops; Spacer-filled channelSettore ING-IND/06 - FluidodinamicaPotential flowCFD0210 nano-technologybusinessDesalination and Water Treatment
researchProduct

Logical Consensus for Distributed Network Agreement

2008

In this paper we introduce a novel consensus mechanism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. Under suitable joint conditions on agents? visibility and communication capability, we provide an algorithm generating a logical linear consensus system that is globally stable. The solution is optimal in terms of the number of messages to be exchanged and the time needed to reach a consensus. Moreover, to cope with possible sensor failure, we propose a second design approach that produces robust logical nonlinear consensus systems tolerating a maximum n…

Settore ING-INF/04 - AutomaticaRobustness (computer science)Computer scienceDistributed computingVisibility (geometry)Stability (learning theory)Algorithm designIntrusion detection systemdistributed systemConsensus algorithmBoolean data typelogical consensuUniform consensus
researchProduct