Search results for " rando"

showing 10 items of 498 documents

Modeling Spatial Data Pooled over Time: Schematic Representation and Monte Carlo Evidences

2015

The spatial autocorrelation issue is now well established, and it is almost impossible to deal with spatial data without considering this reality. In addition, recent developments have been devoted to developing methods that deal with spatial autocorrelation in panel data. However, little effort has been devoted to dealing with spatial data (cross-section) pooled over time. This paper endeavours to bridge the gap between the theoretical modeling development and the application based on spatial data pooled over time. The paper presents a schematic representation of how spatial links can be expressed, depending on the nature of the variable, when combining the spatial multidirectional relatio…

Complete spatial randomnessComputer scienceMonte Carlo method[SHS.ECO]Humanities and Social Sciences/Economics and FinanceVariable (computer science)Autoregressive modelSpatial descriptive statisticsEconometrics[ SHS.ECO ] Humanities and Social Sciences/Economies and financesSpatial econometricsmodeling spatialRepresentation (mathematics)[SHS.ECO] Humanities and Social Sciences/Economics and FinanceSpatial analysisMonte CarloComputingMilieux_MISCELLANEOUS
researchProduct

The spatial pattern of a forest ecosystem

1998

Abstract Statistical analysis of stands of trees as a whole need suitable methods of spatial statistics. Obviously, trees within a stand affect development and survival of their neighbours. They interact and therefore have to be considered as a system of dependent random variates from an unknown stochastic process. One such statistical model which considers the spatial dependence among trees in a forest and their characteristics is a marked point process. The `points', called events in spatial statistics, are the tree positions and the `marks' are tree characteristics such as crown lengths or tree species. A minimal prerequisite for any serious attempt to model an observed pattern is to tes…

Complete spatial randomnessEcological ModelingStatisticsParametric modelEconometricsSpatial ecologyStatistical modelSpatial dependenceSpatial analysisTree (graph theory)Point processMathematicsEcological Modelling
researchProduct

A Methodology for the Analysis of Memory Response to Radiation through Bitmap Superposition and Slicing

2015

A methodology is proposed for the statistical analysis of memory radiation test data, with the aim of identifying trends in the single-even upset (SEU) distribution. The treated case study is a 65nm SRAM irradiated with neutrons, protons and heavy-ions.

Computer sciencebitmap slicingParallel computingHardware_PERFORMANCEANDRELIABILITYRadiationSlicingUpsetElectronic mailSuperposition principleStatic random-access memoryMemoriesstatic testNuclear Experimentdynamic testta114ta213computer.file_formatSRAMBitmap[SPI.TRON]Engineering Sciences [physics]/ElectronicsMultiple Cell Upset (MCU)MCUSERBitmapradiation testevent accumulationSingle Event Upset (SEU)AlgorithmcomputerSEUTest data
researchProduct

M-GRASP: A GRASP With Memory for Latency-Aware Partitioning Methods in DVE Systems

2009

A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alt…

Computer sciencebusiness.industryDistributed computingGRASPComputer Science ApplicationsHuman-Computer InteractionControl and Systems EngineeringServerLocal search (optimization)Electrical and Electronic EngineeringGreedy algorithmbusinessMetaheuristicSoftwareGreedy randomized adaptive search procedureIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
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

A novel strategy for solving the stochastic point location problem using a hierarchical searching scheme

2014

Stochastic point location (SPL) deals with the problem of a learning mechanism (LM) determining the optimal point on the line when the only input it receives are stochastic signals about the direction in which it should move. One can differentiate the SPL from the traditional class of optimization problems by the fact that the former considers the case where the directional information, for example, as inferred from an Oracle (which possibly computes the derivatives), suffices to achieve the optimization-without actually explicitly computing any derivatives. The SPL can be described in terms of a LM (algorithm) attempting to locate a point on a line. The LM interacts with a random environme…

Continuous-time stochastic processMathematical optimizationOptimization problemControlled random walkTime reversibilityDiscretized learning02 engineering and technologyTime reversibilityLearning automataStochastic-point problem0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringStochastic neural networkMathematicsBinary treeLearning automata020206 networking & telecommunicationsRandom walkComputer Science ApplicationsHuman-Computer InteractionControl and Systems Engineering020201 artificial intelligence & image processingStochastic optimizationSoftwareInformation Systems
researchProduct

R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case

2010

This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.

Convex hullDiscrete mathematicsSimplexMultivariate random variableMathematicsofComputing_NUMERICALANALYSISHausdorff spaceAuxiliary functionFunction (mathematics)CombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYMathematics::Metric GeometryHausdorff measureStatistical dispersionMathematics
researchProduct

Enhancement of the Lifetime of Metastable States in Er-Doped Si Nanocrystals by External Colored Noise

2015

The changes in the lifetime of a metastable energy level in Er-doped Si nanocrystals in the presence of an external source of colored noise are analyzed for different values of noise intensity and correlation time. Exciton dynamics is simulated by a set of phenomenological rate equations which take into account all the possible phenomena inherent in the energy states of Si nanocrystals and Er^{3+} ions in the host material of Si oxide. Electronic deexcitation is studied by examining the decay of the initial population of the Er atoms in the first excitation level 4I_{13/2} through fluorescence and cooperative energy transfer upconversion. Our results show that the deexcitation process of th…

Cooperative energy transfer upconversionSilicon nanocrystalFluctuation phenomena and random processePhotoluminescenceSettore FIS/03 - Fisica Della MateriaStochastic modeling and numerical simulationErbium
researchProduct