Results 21 to 30 of about 5,740,582 (295)
CMA-ES based topology optimization for acoustic cloak
This paper presents a topology optimization based on a covariance matrix adaptation evolution strategy (CMA-ES) for acoustic cloaks rendering a scattering object acoustically invisible.
Masayuki TAKAHASHI +2 more
doaj +1 more source
Optimization of production and transport infrastructure based on cluster analysis methods [PDF]
In order to solve the problems of optimizing production and transportation systems, a clustering procedure for objects is suggested. The procedure is a universal methodology for dividing a set of objects into subsets with their centers possessing optimal
Moskvichev Oleg +2 more
doaj +1 more source
Energy Efficient Medical Data Dimensionality Reduction using Optimized Principal Component Analysis [PDF]
INTRODUCTION: The method of minimizing the number of random variables or attributes from the enormous data set is the reduction of dimensionality. The space available for storing the database is therefore minimized by decreasing the scale of the features.
S. Sophia, K. Thanammal, S. Sujatha
doaj +1 more source
Least eigenvalue of the connected graphs whose complements are cacti
Suppose that Γ is a graph of order n and A(Γ) = [ai,j] is its adjacency matrix such that ai,j is equal to 1 if vi is adjacent to vj and ai,j is zero otherwise, where 1 ≤ i, j ≤ n.
Wang Haiying +4 more
doaj +1 more source
Level Set Method Combing with Shape Prior for Intensity-texture Image Segmentation [PDF]
Traditional level set methods for image segmentation cannot deal with the efficiency segmentation of intensity-texture image problem,which consider more of the underlying data and ignore the high-level semantic features.Aiming at this problem,this paper ...
WANG Ti,CHEN Jian,ZENG Lei,TONG Li,YAN Bin
doaj +1 more source
A note on the singular set of area-minimizing hypersurfaces
We prove an isoperimetric-type bound on the $$(n-7)$$(n-7)-dimensional measure of the singular set for a large class of area-minimizing n-dimensional hypersurfaces, in terms of the geometry of their ...
Edelen, Nick
core +1 more source
Minimizing the condition number of a positive definite matrix by completion [PDF]
Elsner L, He C, Mehrmann V. Minimizing the condition number of a positive definite matrix by completion. Numerische Mathematik. 1994;69(1):17-23.We consider the problem of minimizing the spectral condition number of a positive definite matrix by ...
Mehrmann, Volker +2 more
core +1 more source
UNA EXTENSIÓN DEL MÉTODO SUBGRADIENTE PARA FUNCIONES CUASICONVEXAS
In this work, we consider the problem of minimizing a quasiconvex, continue and Hölder function on the set optimal, not necessarily differentiable. We use the normalized direction of the normal con e of the set level of function and employ the stepsize ...
Frank Navarro Rojas +1 more
doaj +1 more source
On the minimization of some nonconvex double obstacle problems
We consider a nonconvex variational problem for which the set of admissible functions consists of all Lipschitz functions located between two fixed obstacles.
A. Elfanni
doaj +1 more source
Dialectics of complexity, emergence and management
The article is devoted to the dialectical analysis of such fundamental essences of modern organizations as complexity, emergence and management. It considers approaches to the quantitative assessment of complexity as a constructive feature of the system,
Victor S. Efremov +2 more
doaj +1 more source

