Search results for "Random"

showing 10 items of 3931 documents

Percolation on correlated random networks

2011

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministic (deleting links based on rank weights), each mimicking a different physical process. The evolution of the network is accordingly different, as evidenced by the behavior of the largest component size and of the distribution of cluster sizes. In particular, we can derive that weak ties are crucial in o…

Condensed Matter Physics; Statistical and Nonlinear Physics; Statistics and ProbabilityStatistics and ProbabilitySocial and Information Networks (cs.SI)FOS: Computer and information sciencesRandom graphDiscrete mathematicsPhysics - Physics and SocietyStatistical Mechanics (cond-mat.stat-mech)Interdependent networksFOS: Physical sciencesComputer Science - Social and Information NetworksStatistical and Nonlinear PhysicsPercolation thresholdPhysics and Society (physics.soc-ph)Complex networkCondensed Matter PhysicsGiant componentPercolationContinuum percolation theoryStatistical physicsCondensed Matter - Statistical MechanicsClustering coefficientMathematicsPhysical Review E
researchProduct

Brownian dynamics of polydisperse colloidal hard spheres: Equilibrium structures and random close packings

1994

Recently we presented a new technique for numerical simulations of colloidal hard-sphere systems and showed its high efficiency. Here, we extend our calculations to the treatment of both 2- and 3-dimensional monodisperse and 3-dimensional polydisperse systems (with sampled finite Gaussian size distribution of particle radii), focusing on equilibrium pair distribution functions and structure factors as well as volume fractions of random close packing (RCP). The latter were determined using in principle the same technique as Woodcock or Stillinger had used. Results for the monodisperse 3-dimensional system show very good agreement compared to both pair distribution and structure factor predic…

Condensed Matter::Soft Condensed MatterPhase transitionDistribution functionMaterials scienceRandom close packVolume fractionBrownian dynamicsThermodynamicsStatistical and Nonlinear PhysicsHard spheresAtomic packing factorStructure factorMathematical PhysicsJournal of Statistical Physics
researchProduct

Phase transitions in polymer blends and block copolymer melts: Some recent developments

2005

The classical concepts about unmixing of polymer blends (Flory-Huggins theory) and about mesophase ordering in block copolymers (Leibler's theory) are briefly reviewed and their validity is discussed in the light of recent experiments, computer simulations and other theoretical concepts. It is emphasized that close to the critical point of unmixing non-classical critical exponents of the Ising universality class are observed, in contrast to the classical mean-field exponents implied by the Flory-Huggins theory. The temperature range of this non-mean-field behavior can be understood by Ginzburg criteria. The latter are also useful to discuss the conditions under which the linearized (Cahn-li…

Condensed Matter::Soft Condensed MatterPhysicsPhase transitionSpinodal decompositionCritical point (thermodynamics)Polymer chemistryThermodynamicsIsing modelRenormalization groupRandom phase approximationCritical valueCritical exponent
researchProduct

Structure of diblock copolymers in supercritical carbon dioxide and critical micellization pressure

1999

This paper reports a small angle neutron scattering investigation of micelle formation by fluorocarbon-hydrocarbon block copolymers in supercritical ${\mathrm{CO}}_{2}{(\mathrm{s}\mathrm{c}\ensuremath{-}\mathrm{C}\mathrm{O}}_{2})$ at 65 \ifmmode^\circ\else\textdegree\fi{}C. A sharp unimer-micelle transition is obtained due to the tuning of the solvating ability of ${\mathrm{s}\mathrm{c}\ensuremath{-}\mathrm{C}\mathrm{O}}_{2}$ by profiling pressure, so that the block copolymer, in a semidilute solution, finds ${\mathrm{s}\mathrm{c}\ensuremath{-}\mathrm{C}\mathrm{O}}_{2}$ a good solvent at high pressure and a poor solvent at low pressure. At high pressure the copolymer is in a monomeric state…

Condensed Matter::Soft Condensed MatterQuantitative Biology::BiomoleculesCrystallographyColloidMaterials scienceSupercritical carbon dioxideAqueous solutionSolvationFluorocarbonPhysics::Chemical PhysicsMicelleSmall-angle neutron scatteringRandom coilPhysical Review E
researchProduct

Critical Exponents and Randomness in SrTiO3 : Ca

1994

Since its discovery, the SrTiO3: Ca system is known to exhibit a number of features which were thought to arise from an impurity induced disorder. Non-linear dielectric measurements are used to obtain a more quantitative insight into this disorder. For 0.001 < xCa < 0.05, it is found that the non-linear susceptibility diverges at low temperatures. This is similar to what was previously reported in the dielectric random system KTaO3: Na. A method is proposed to quantify the contribution of the disorder to the non-linearities. It is found that the deviation from a true ferroelectric behaviour is not enough to call the low-temperature phase of SrTiO3: Ca a glass one. The maximum non-linearity …

Condensed matter physicsCritical phenomenaMineralogyDielectricCondensed Matter PhysicsFerroelectricityElectronic Optical and Magnetic MaterialsCondensed Matter::Materials ScienceDipolechemistry.chemical_compoundchemistryPhase (matter)Strontium titanateCritical exponentRandomnessphysica status solidi (b)
researchProduct

Arabic Named Entity Recognition: A Feature-Driven Study

2009

The named entity recognition task aims at identifying and classifying named entities within an open-domain text. This task has been garnering significant attention recently as it has been shown to help improve the performance of many natural language processing applications. In this paper, we investigate the impact of using different sets of features in three discriminative machine learning frameworks, namely, support vector machines, maximum entropy and conditional random fields for the task of named entity recognition. Our language of interest is Arabic. We explore lexical, contextual and morphological features and nine data-sets of different genres and annotations. We measure the impact …

Conditional random fieldAcoustics and UltrasonicsComputer sciencebusiness.industryPrinciple of maximum entropycomputer.software_genreMachine learningLinear discriminant analysisCable televisionSupport vector machineDiscriminative modelNamed-entity recognitionEntropy (information theory)Artificial intelligenceElectrical and Electronic EngineeringbusinesscomputerNatural language processingIEEE Transactions on Audio, Speech, and Language Processing
researchProduct

Gesture Modeling by Hanklet-Based Hidden Markov Model

2015

In this paper we propose a novel approach for gesture modeling. We aim at decomposing a gesture into sub-trajectories that are the output of a sequence of atomic linear time invariant (LTI) systems, and we use a Hidden Markov Model to model the transitions from the LTI system to another. For this purpose, we represent the human body motion in a temporal window as a set of body joint trajectories that we assume are the output of an LTI system. We describe the set of trajectories in a temporal window by the corresponding Hankel matrix (Hanklet), which embeds the observability matrix of the LTI system that produced it. We train a set of HMMs (one for each gesture class) with a discriminative a…

Conditional random fieldKinectbusiness.industryComputer scienceMaximum-entropy Markov modelAction ClassificationHankel matrixMarkov modelHidden Markov ModelLTI system theoryGestureAction RecognitionGesture recognitionObservabilityArtificial intelligencebusinessHidden Markov modelAlgorithmHankel matrixSkeleton
researchProduct

On general conditional prevision assessments

2009

In this paper we consider general conditional random quantities of the kind $X|Y$, where $X$ and $Y$ are finite discrete random quantities. Then, we introduce the notion of coherence for conditional prevision assessments on finite families of general conditional random quantities. Moreover, we give a compound prevision theorem and we examine the relation between the previsions of $X|Y$ and $Y|X$. Then, we give some results on random gains and, by a suitable alternative theorem, we obtain a characterization of coherence. We also propose an algorithm for the checking of coherence. Finally, we briefly examine the case of imprecise conditional prevision assessments by introducing the notions of…

Conditional random quantities; coherence; conditional prevision assessments; random gain; alternative theorems; algorithms; imprecise assessments; generalized and total coherence.Settore MAT/06 - Probabilita' E Statistica Matematicarandom gainConditional events general conditional random quantitiesgeneral conditional prevision assessments generalized compound prevision theorem generalized Bayes TheoremConditional random quantitiesalgorithmsimprecise assessmentsalternative theoremsgeneralized and total coherencecoherenceconditional prevision assessments
researchProduct

1136 In Vivo Endoscope-Based Confocal Laser Endomicroscopy (eCLE) Improves Detection of Unlocalized Barrett's Esophagus-Related Neoplasia Over High R…

2012

Confocal laser endomicroscopymedicine.medical_specialtyEndoscopebusiness.industryGastroenterologyHigh resolutionmedicine.diseaseSurgerylaw.inventionRandomized controlled trialIn vivolawWhite light endoscopyBarrett's esophagusMedicineRadiology Nuclear Medicine and imagingRadiologybusinessGastrointestinal Endoscopy
researchProduct

On utilizing dependence-based information to enhance micro-aggregation for secure statistical databases

2011

Published version of an article in the journal: Pattern Analysis and Applications. Also available from the publisher at: http://dx.doi.org/10.1007/s10044-011-0199-9 We consider the micro-aggregation problem which involves partitioning a set of individual records in a micro-data file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the micro-data file, is known to be NP-hard, and has been tackled using many heuristic solutions. In this paper, we would like to demonstrate that in the process of developing micro-aggregation techniques (MATs), it is expedient to incorporate information about the dependence between the random variable…

ConjectureTheoretical computer scienceVariablesComputer scienceCovariance matrixmedia_common.quotation_subjectmicro-aggregation techniqueVDP::Technology: 500::Information and communication technology: 550Mutually exclusive eventscomputer.software_genrePartition (database)CorrelationVDP::Mathematics and natural science: 400::Information and communication science: 420::Knowledge based systems: 425Artificial IntelligenceJoint probability distributionprojected variablesComputer Vision and Pattern RecognitionData miningmaximun spanning treeRandom variablecomputermedia_common
researchProduct