Results 51 to 60 of about 3,205,738 (186)
Azimuthal Anisotropy in High Energy Nuclear Collision - An Approach based on Complex Network Analysis [PDF]
Recently, a complex network based method of Visibility Graph has been applied to confirm the scale-freeness and presence of fractal properties in the process of multiplicity fluctuation.
Bhaduri, Susmita, Ghosh, Dr. Dipak
core +3 more sources
H‐function with complex parameters II: evaluation [PDF]
Sufficient conditions for computation of the H‐functions with complex parameters by means of residues are derived and some examples are given.
Fadhel A. Al-Musallam, Vu Kim Tuan
openaire +3 more sources
Efficient parameter generation for constrained models using MCMC
Mathematical models of complex systems rely on parameter values to produce a desired behavior. As mathematical and computational models increase in complexity, it becomes correspondingly difficult to find parameter values that satisfy system constraints.
Natalia Kravtsova +2 more
doaj +1 more source
Crossover behavior for complex order parameter in high-Tc superconductors
A number of recent experiments have suggested the presence of either real or complex components in the gap symmetry of high-$T_c$ superconductors (HTSC). In this paper we introduce a novel approach to study the competition of such complex order parameter
Allgeier +34 more
core +1 more source
Complex Pattern Formations by Spatial Varying Parameters
Summary: Pattern formations by Gierer-Meinhardt (GM) activator-inhibitor model are considered in this paper. By linear analysis, critical value of bifurcation parameter can be evaluated to ensure Turing instability. Numerical simulations are tested by using second order semi-implicit backward difference methods for time discretization and the meshless ...
Li, Siqing, Ling, Leevan
openaire +3 more sources
Fixed-Parameter Complexity and Approximability of Norm Maximization [PDF]
The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem is $\NP$-hard for all values $p \in \mathbb{N}$, if the dimension $d$ of the ambient space is part of the input. In
Knauer, Christian +2 more
openaire +2 more sources
EAS primary particle parameter estimation with the complex Pamir-XXI detector array
Some new developments in EAS methods made in the framework of the Pamir-XXI project are presented. First, primary energy and direction definition accuracies by a network of fast scintillators are considered, optimum network cell size is defined for 10 ...
Galkin V.I. +5 more
doaj +2 more sources
Banding the inverse of a covariance matrix has become a popular technique for estimating a covariance matrix from a limited number of samples. It is of interest to provide criteria to determine if a matrix is bandable, as well as to test the bandedness ...
Zhenghan Zhu
doaj +1 more source
On the Strominger system and holomorphic deformations [PDF]
We show that the property of existence of solution to the Strominger system in dimension six is neither open nor closed under holomorphic deformations of the complex structure.
Ivanov, Stefan, Ugarte, Luis
core +3 more sources
The determination of unknown parameters of photovoltaic models has always been a difficult problem in the field of nonlinear optimization, which is inseparable from the energy conversion efficiency of photovoltaic power generation systems.
Xiaoyun Yang +4 more
doaj +1 more source

