15 papers · ranked by Valyu relevance
Timothy M. Chan, Da Wei Zheng
- For a set of n points in a constant dimension d, we give data structures with O(n d ) (or slightly better) space that can answer simplex range counting queries in optimal O(log n) time and simplex range reporting queries in optimal O(log n + k) time, where k denotes the output size. For semigroup range searching, we…
Tianyu Liu
interpolation Authors: ['Tianyu Liu'] State transition algorithm (STA) is a metaheuristic method for global optimization. Recently, a modified STA named parameter optimal state transition algorithm (POSTA) is proposed. In POSTA, the performance of expansion operator, rotation operator and axesion operator is optimized…
Mengyu Huang, Yuxing Zhong, Huiwen Yang, Jiazheng Wang + 3 more
'Bo Bai' 'Ling Shi'] The simplex method is one of the most fundamental technologies for solving linear programming (LP) problems and has been widely applied to different practical applications. In the past literature, how to improve and accelerate the simplex method has attracted plenty of research. One important way…
Anqi Li, Tiande Guo, Congying Han, Bonan Li + 1 more
Based on the existing pivot rules, the simplex method for linear programming is not polynomial in the worst case. Therefore the optimal pivot of the simplex method is crucial. This study proposes the optimal rule to find all shortest pivot paths of the simplex method for linear programming problems based on Monte Carlo…
Haitao Wang
In this paper, we present a deterministic variant of Chan's randomized partition tree [Discret. Comput. Geom., 2012]. This result leads to numerous applications. In particular, for d-dimensional simplex range counting (for any constant d ≥ 2), we construct a data structure using O(n) space and O(n 1+ϵ ) preprocessing…
Anna Pietrenko-Dabrowska, Slawomir Koziel
Formal optimization is nowadays ubiquitous in microwave design. It is frequently conducted using electromagnetic (EM) simulations, which guarantee dependability. Yet, it is computationally expensive. Local tuning may involve hundreds of system analyses, whereas global EM-driven optimization typically generates…
Kalpanarani K., Hannah Grace G.
Introduction In unsupervised learning, data clustering is essential. However, many current algorithms have issues like early convergence, inadequate local search capabilities, and trouble processing complicated or unbalanced input. Established methods like Kmeans are still widely used because of their ease of use…
Denis Kleverov, Ekaterina Aladyeva, Alexey Serdyukov, Maxim N. Artyomov
Non-negative matrix factorization (NMF) is one of the most powerful linear algebra tools, which has found application in various areas of data analysis, including computational biology. Despite numerous optimization methods devised for NMF, our comprehension of the inherent topological structure within factorizable…
Hassan Musafer, Emre Tokgoz, Ausif Mahmood, Jingbo Wang
This article provides a new tool for examining the efficiency and robustness of derivative-free optimization algorithms based on high-dimensional normalized data profiles that test a variety of performance metrics. Unlike the traditional data profiles that examine a single dimension, the proposed data profiles require…
Colin Lynch, Kaitlin Baudier, Douglas Montgomery, Meghan Barrett
Animal nutritionists seek to understand how animals regulate the intake and balance of multiple nutrients, yet the design and analysis of such experiments are often limited by how nutrient spaces are represented. The geometric framework for nutrition (GFN) provides a powerful means to visualize nutrient interactions…
Slawomir Koziel, Anna Pietrenko-Dabrowska, Stanislaw Szczepanski, Leifur Leiffson
'Leifur Leiffson'] Optimization methods have been rapidly entering the realm of antenna design over the last several years. Despite many available algorithms, practical optimization is demanding due to the high electromagnetic (EM) analysis cost necessary for dependable antenna assessment. This is particularly…
Jialin Liu, Yichen Wang, Chen Li, Yichen Gu + 2 more
Cells differentiate to their final fates along unique trajectories, often involving multi-potent progenitors that can produce multiple terminally differentiated cell types. Recent developments in single-cell transcriptomic and epigenomic measurement provide tremendous opportunities for mapping these trajectories. The…
Kirill Kukharenko, Laura Sanità
The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key…
Hanlin Zhu, Assia Chericoni, Taha Ismail, Elizabeth A. Mickiewicz + 17 more
Humans handle numbers nimbly, suggesting a richer neural manifold structure than the prevalent mental number line model. In populations of medial temporal lobe (MTL) neurons in humans performing two simple tasks (dot counting and arithmetic), we find robust neural coding of numerosity that results in high dimensional…
Manuel Miranda, Gissell Estrada-Rodriguez, Ernesto Estrada, Ginestra Bianconi + 3 more
'Ginestra Bianconi' 'Rubén J. Sánchez-García' 'Anthony Baptista' 'Hanlin Sun'] Geometric realization of simplicial complexes makes them a unique representation of complex systems. The existence of local continuous spaces at the simplices level with global discrete connectivity between simplices makes the analysis of…