Search results for "Complex."

showing 10 items of 5824 documents

Анализ проблем развития лесопромышленного комплекса при формировании модели экономики замкнутого цикла на примере Томской области

2019

The main objective of the paper is the conduction of the timber industry complex problems analysis from the circular economy and sustainable development point of view. The problem of waste is considered in conjunction with other environmental, economic and social problems. A modeling of the value chain process and the formation of threats along the whole chain «nature (forest) – economy – society (consumer)» is being conducted. A classification of the development problems in the timber industry complex on the basis of «created values» and «production factors» has been developed. Planned growth in logging volume and wood processing, expansion of unused waste require the development of a spec…

sustainable developmentcircular economymodelingустойчивое развитиеtimber industry clusterмоделирование[SHS.ECO]Humanities and Social Sciences/Economics and Financetimber industry complexцепочка поставокэкономика замкнутого циклацепочка ценностилесопромышленный комплекс[SHS.ENVIR] Humanities and Social Sciences/Environmental studiesлесопромышленный кластер[SHS.ENVIR]Humanities and Social Sciences/Environmental studiesvalue chainwasteотходы[SHS.ECO] Humanities and Social Sciences/Economics and Financesupply chain
researchProduct

Saddle index properties, singular topology, and its relation to thermodynamic singularities for aϕ4mean-field model

2004

We investigate the potential energy surface of a ${\ensuremath{\phi}}^{4}$ model with infinite range interactions. All stationary points can be uniquely characterized by three real numbers ${\ensuremath{\alpha}}_{+},{\ensuremath{\alpha}}_{0},{\ensuremath{\alpha}}_{\ensuremath{-}}$ with ${\ensuremath{\alpha}}_{+}+{\ensuremath{\alpha}}_{0}+{\ensuremath{\alpha}}_{\ensuremath{-}}=1$, provided that the interaction strength $\ensuremath{\mu}$ is smaller than a critical value. The saddle index ${n}_{s}$ is equal to ${\ensuremath{\alpha}}_{0}$ and its distribution function has a maximum at ${n}_{s}^{\mathrm{max}}=1∕3$. The density $p(e)$ of stationary points with energy per particle $e$, as well as…

symbols.namesakeDistribution functionMean field theoryEuler characteristicPotential energy surfaceZero (complex analysis)symbolsGround stateTopologyEnergy (signal processing)Real numberMathematicsPhysical Review E
researchProduct

Complex objects classified by morphological shape analysis and elliptical Fourier descriptors

2005

This chapter deals with the classification of complex objects by morphological shape analysis and elliptical Fourier descriptors. An unsupervised method has been proposed to identify components with specific shapes by a simple edge detector and to classify them via the description of their contours. A particular application has been arranged in order to evaluate the goodness of this approach when discriminating between normal and pathological human megakaryocytes. Alterations in these cells can occur in many pathological processes and in such cases the pattern, size and shape of the cytoplasm and/or of the nucleus are extremely varied.

symbols.namesakeFourier transformSettore INF/01 - InformaticaComputer sciencebusiness.industrysymbolsComputer visionArtificial intelligenceComplex objects classified by morphological shape analysis and elliptical Fourier descriptorsbusinessShape analysis (digital geometry)
researchProduct

Champs de vecteurs analytiques commutants, en dimension 3 ou 4: existence de zeros communs

1992

One proves the existence of a common zero for any two ℝ-analytic commuting vector fields on a 4-dimensional manifold with not zero Euler characteristic. A local version of this result remains true on 3-manifolds.

symbols.namesakeGeneral MathematicsEuler characteristicMathematical analysisZero (complex analysis)symbolsVector fieldManifoldMathematicsBoletim da Sociedade Brasileira de Matem�tica
researchProduct

A New Family of Deformations of Darboux-Pöschl-Teller Potentials

2004

The aim of this Letter is to present a new family of integrable functional-difference deformations of the Schrodinger equation with Darboux–Poschl–Teller potentials. The related potentials are labeled by two integers m and n, and also depend on a deformation parameter h. When h→ 0 the classical Darboux–Poschl–Teller model is recovered.

symbols.namesakeIntegrable systemMathematical analysissymbolsComplex systemMathematics::Mathematical PhysicsStatistical and Nonlinear PhysicsDeformation (meteorology)Mathematical PhysicsSchrödinger equationMathematicsMathematical physicsLetters in Mathematical Physics
researchProduct

Jacobi Fields, Conjugate Points

2001

Let us go back to the action principle as realized by Jacobi, i.e., time is eliminated, so we are dealing with the space trajectory of a particle. In particular, we want to investigate the conditions under which a path is a minimum of the action and those under which it is merely an extremum. For illustrative purposes we consider a particle in two-dimensional real space.

symbols.namesakeJacobi rotationJacobi method for complex Hermitian matricesConjugate pointsPath (graph theory)TrajectorysymbolsApplied mathematicsSpace (mathematics)Action (physics)Mathematics
researchProduct

An Improved Method for Estimating the Time ACF of a Sum of Complex Plane Waves

2010

Time averaging is a well-known technique for evaluating the temporal autocorrelation function (ACF) from a sample function of a stochastic process. For stochastic processes that can be modelled as a sum of plane waves, it is shown that the ACF obtained by time averaging can be expressed as a sum of auto-terms (ATs) and cross-terms (CTs). The ATs result from the autocorrelation of the individual plane waves, while the CTs are due to the cross-correlation between different plane wave components. The CTs cause an estimation error of the ACF. This estimation error increases as the observation time decreases. For the practically important case that the observation time interval is limited, we pr…

symbols.namesakeMathematical optimizationFourier transformStochastic processKernel (statistics)AutocorrelationMathematical analysisPlane wavesymbolsInterval (mathematics)Frequency modulationComplex planeMathematics2010 IEEE Global Telecommunications Conference GLOBECOM 2010
researchProduct

THE ARITHMETIC BOHR RADIUS

2007

We study the arithmetic Bohr radius of Reinhardt domains in ℂ n which was successfully used in our study of monomial expansions for holomorphic functions in infinite dimensions. We show that this new Bohr radius is different from the radii invented by Boas and Khavinson and Aizenberg. It gives an explicit formula for the n-dimensional hypercone (which means n-dimensional variants of classical results of Bohr and Bombieri), and moreover asymptotically corrects upper and lower estimates for various types of convex and non-convex Reinhardt domains.

symbols.namesakeMonomialMathematics::Complex VariablesGeneral MathematicssymbolsRegular polygonHolomorphic functionHyperconeArithmeticBohr radiusBohr modelMathematicsThe Quarterly Journal of Mathematics
researchProduct

COMPLEX CONVEXITY AND VECTOR-VALUED LITTLEWOOD–PALEY INEQUALITIES

2003

Let 2 p 0s uch thatfHp(X) (� f(0)� p + λ (1 −| z| 2 ) p−1 � f � (z)� p dA(z)) 1/p ,f or all f ∈ H p (X). Applications to embeddings between vector-valued BMOA spaces defined via Poisson integral or Carleson measures are provided.

symbols.namesakePure mathematicsComplex convexityLittlewood paleyGeneral MathematicsMathematical analysisPoisson kernelsymbolsMathematicsBulletin of the London Mathematical Society
researchProduct

Twister Tries

2015

Many commonly used data-mining techniques utilized across research fields perform poorly when used for large data sets. Sequential agglomerative hierarchical non-overlapping clustering is one technique for which the algorithms’ scaling properties prohibit clustering of a large amount of items. Besides the unfavorable time complexity of O(n 2 ), these algorithms have a space complexity of O(n 2 ), which can be reduced to O(n) if the time complexity is allowed to rise to O(n 2 log2 n). In this paper, we propose the use of locality-sensitive hashing combined with a novel data structure called twister tries to provide an approximate clustering for average linkage. Our approach requires only lin…

ta113Hierarchical agglomerative clusteringta112Fuzzy clusteringBrown clusteringComputer scienceSingle-linkage clusteringcomputer.software_genreHierarchical clusteringLocality-sensitive hashingData setCURE data clustering algorithmlocality-sensitive hashingaverage linkageData miningHierarchical clustering of networkslinear complexityCluster analysishierarchical clusteringAlgorithmcomputerTime complexityProceedings of the 2015 ACM SIGMOD International Conference on Management of Data
researchProduct