Search results for "Graph theory"

showing 10 items of 784 documents

Imbalance Effects in the Lucas Model: An Analytical Exploration

2004

In this note, we use a technique analogous to Xie's method (1994) to solve analytically the Lucas model with externality in a specific parametric case. In particular, we characterize the shape of imbalance effects in this model. Our results are entirely consistent with the findings of the related computational literature. Moreover, our analytical investigation tends to show that these findings are robust to the presence of the Lucas externality as long as a unique equilibrium path exist.

Computer sciencePath (graph theory)Mathematical economicsExternalityParametric statisticsSSRN Electronic Journal
researchProduct

Automatic construction of test sets: Practical approach

2005

The problem of symbolic execution and test generation is considered both for sequential and concurrent programs. Practical methods for test construction for the given program path are presented.

Computer scienceProgramming languagePath (graph theory)Path conditionSymbolic executioncomputer.software_genrecomputerTest harnessTest (assessment)
researchProduct

Modelling of Non-WSSUS Channels with Time-Variant Doppler and Delay Characteristics

2018

This paper deals with the modelling of non-wide-sense stationary uncorrelated scattering (non-WSSUS) channels in which the angles of arrival (AOAs), Doppler frequencies, and propagation delays vary with time. Starting from a geometrical model in which the mobile station (MS) travels along a predefined path with time-variant velocity, it is shown how the parameters of the non-WSSUS model can be computed analytically assuming that the scatterers are fixed. One of the key results of our analysis is that the time-variant Doppler frequencies and the time-variant propagation delays of WSSUS and non-WSSUS channels are connected by a fundamental relationship. Furthermore, the time-variant channel t…

Computer scienceScatteringMathematical analysis020302 automobile design & engineering020206 networking & telecommunications02 engineering and technologyPropagation delayUncorrelatedDelay spreadsymbols.namesake0203 mechanical engineeringMobile stationPath (graph theory)0202 electrical engineering electronic engineering information engineeringsymbolsWidebandDoppler effectComputer Science::Information TheoryCommunication channel2018 IEEE Seventh International Conference on Communications and Electronics (ICCE)
researchProduct

Scatter Search Applications

2003

This section provides a collection of “vignettes” that briefly summarize applications of scatter search (SS) and path relinking (PR) in a variety of settings.

Computer scienceSection (archaeology)Path (graph theory)Algorithm
researchProduct

Discovering Aberrant Patterns of Human Connectome in Alzheimer's Disease via Subgraph Mining

2012

Alzheimer's disease (AD) is the most common cause of age-related dementia, which prominently affects the human connectome. Diffusion weighted imaging (DWI) provides a promising way to explore the organization of white matter fiber tracts in the human brain in a non-invasive way. However, the immense amount of data from millions of voxels of a raw diffusion map prevent an easy way to utilizable knowledge. In this paper, we focus on the question how we can identify disrupted spatial patterns of the human connectome in AD based on a data mining framework. Using diffusion tractography, the human connectomes for each individual subject were constructed based on two diffusion derived attributes: …

Computer sciencebusiness.industryPattern recognitionGraph theoryHuman ConnectomeHuman brainGrey mattercomputer.software_genremedicine.diseaseWhite mattermedicine.anatomical_structureVoxelHuman ConnectomesFractional anisotropymedicineDementiaDiffusion TractographyArtificial intelligencebusinesscomputerDiffusion MRI2012 IEEE 12th International Conference on Data Mining Workshops
researchProduct

Hidden attractors on one path : Glukhovsky-Dolzhansky, Lorenz, and Rabinovich systems

2017

In this report, by the numerical continuation method we visualize and connect hidden chaotic sets in the Glukhovsky-Dolzhansky, Lorenz and Rabinovich systems using a certain path in the parameter space of a Lorenz-like system.

Computer sciencechaosChaoticFOS: Physical sciencesPhysics::Data Analysis; Statistics and ProbabilityParameter space01 natural sciences010305 fluids & plasmasRabinovich systemLorenz system0103 physical sciencesAttractorGlukhovsky–Dolzhansky systemApplied mathematics010301 acousticsEngineering (miscellaneous)kaaosteoriaApplied Mathematicsta111Lorenz-like systemNonlinear Sciences - Chaotic DynamicsNonlinear Sciences::Chaotic DynamicsNumerical continuationModeling and SimulationPath (graph theory)numeerinen analyysiChaotic Dynamics (nlin.CD)hidden attractorInternational Journal of Bifurcation and Chaos
researchProduct

Fast Implementation of Double-coupled Nonnegative Canonical Polyadic Decomposition

2019

Real-world data exhibiting high order/dimensionality and various couplings are linked to each other since they share some common characteristics. Coupled tensor decomposition has become a popular technique for group analysis in recent years, especially for simultaneous analysis of multi-block tensor data with common information. To address the multiblock tensor data, we propose a fast double-coupled nonnegative Canonical Polyadic Decomposition (FDC-NCPD) algorithm in this study, based on the linked CP tensor decomposition (LCPTD) model and fast Hierarchical Alternating Least Squares (Fast-HALS) algorithm. The proposed FDCNCPD algorithm enables simultaneous extraction of common components, i…

Computer sciencelinked CP tensor decomposition (LCPTD)02 engineering and technologySignal-to-noise ratiotensor decompositionConvergence (routing)0202 electrical engineering electronic engineering information engineeringDecomposition (computer science)TensorHigh orderta113konvergenssiconvergencesignal to noise ratio020206 networking & telecommunicationsbrain modelinghierarchical alternating least squares (HALS)Alternating least squaresCore (graph theory)coupled tensor decomposition020201 artificial intelligence & image processingAlgorithmsignal processing algorithmselectroencephalographymathematical modelCurse of dimensionality
researchProduct

Analysing Intercultural Dialogue Through Conceptual Densities

2020

In this chapter, we exemplify our methodological approach to analysing ‘densities’ of interrelated concepts in European education policy documents. We scrutinize instances where many of the core concepts of intercultural dialogue appear in the documents at the same time. Four core educational themes and four longer excerpts from the selected policy documents are examined in more detail. The chosen documents deal especially with multilingualism, migration, history teaching, and lifelong learning. The analysis of the conceptual densities in the chosen excerpts indicates how the meanings of intercultural dialogue are constructed through the conceptual frameworks and co-occurrences of their cor…

Conceptual frameworkLifelong learningCore (graph theory)MultilingualismEducation policySociologyEpistemology
researchProduct

Organization and evolution of synthetic idiotypic networks

2012

We introduce a class of weighted graphs whose properties are meant to mimic the topological features of idiotypic networks, namely the interaction networks involving the B-core of the immune system. Each node is endowed with a bit-string representing the idiotypic specificity of the corresponding B cell and a proper distance between any couple of bit-strings provides the coupling strength between the two nodes. We show that a biased distribution of the entries in bit-strings can yield fringes in the (weighted) degree distribution, small-worlds features, and scaling laws, in agreement with experimental findings. We also investigate the role of ageing, thought of as a progressive increase in …

Condensed Matter Physics; Statistical and Nonlinear Physics; Statistics and ProbabilityTime FactorsTime FactorDistribution (number theory)Molecular Networks (q-bio.MN)FOS: Physical sciencesBit arrayThermodynamicComputer GraphicsCluster AnalysisHumansQuantitative Biology - Molecular NetworksMathematicsDiscrete mathematicsB-LymphocytesCluster AnalysiDegree (graph theory)Percolation (cognitive psychology)B-LymphocyteModels ImmunologicalGraph theoryDisordered Systems and Neural Networks (cond-mat.dis-nn)Condensed Matter - Disordered Systems and Neural NetworksComputer GraphicDegree distributionFOS: Biological sciencesImmune SystemCore (graph theory)ThermodynamicsNode (circuits)Human
researchProduct

Mond's conjecture for maps between curves

2017

A theorem by D. Mond shows that if f:(C,0)→C2,0 is finite and has has degree one onto its image (Y, 0), then the Ae-codimension is less than or equal to the image Milnor number μI(f), with equality if and only if (Y, 0) is weighted homogeneous. Here we generalize this result to the case of a map germ f:(X,0)→C2,0, where (X, 0) is a plane curve singularity.

ConjectureDegree (graph theory)Plane curveGeneral MathematicsImage (category theory)010102 general mathematicsMathematical analysisCodimension01 natural sciencesMilnor numberCombinatoricsSingularity0103 physical sciencesGerm010307 mathematical physics0101 mathematicsMathematicsMathematische Nachrichten
researchProduct