Search arXivSearch

arXiv · 2411.02424

Set-based queries for multiscale shape-material modeling

Abstract

Multiscale structures are becoming increasingly prevalent in the field of mechanical design. The variety of fine-scale structures and their respective representations results in an interoperability challenge. To address this, a query-based API was recently proposed which allows different representations to be combined across the scales for multiscale structures modeling. The query-based approach is fully parallelizable and has a low memory footprint; however, this architecture requires repeated evaluation of the fine-scale structures locally for each individual query. While this overhead is manageable for simpler fine-scale structures such as parametric lattice structures, it is problematic for structures requiring non-trivial computations, such as Voronoi foam structures. In this paper, we develop a set-based query that retains the compatibility and usability of the point-based query while leveraging locality between multiple point-based queries to provide a significant speedup and further decrease the memory consumption for common applications, including visualization and slicing for manufacturing planning. We first define the general set-based query that consolidates multiple point-based queries at arbitrary locations. We then implement specialized preprocessing methods for different types of fine-scale structures which are otherwise inefficient with the point-based query. Finally, we apply the set-based query to downstream applications such as ray-casting and slicing, increasing their performance by an order of magnitude. The overall improvements result in the generation and rendering of complex fine-scale structures such as Voronoi foams at interactive frame rates on the CPU.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oleg Igouchkine, Xingchen Liu. 2024-10-22. Set-based queries for multiscale shape-material modeling. https://arxiv.org/abs/2411.02424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Cosm: Collective switched motion for sparse Ising optimization

We introduce Collective Switched Motion (Cosm), a heuristic optimization framework based on switched collective dynamics. Cosm compiles the objective into subobjectives that are activated sequentially, temporally separating competing local influences. The interplay of switching and local interactions among variables gives rise to collective search behavior, while a new correlated perturbation mechanism encourages coordinated cluster motion. Tests on tuned-hardness spin-glass benchmarks suggest more favorable algorithmic scaling than that reported for leading dynamical solvers. Cosm heuristically attains the certified optima of three of the largest Gset instances (G72, G77, G81), exceeding the previously reported heuristic solutions. On the large random-graph instances G61 and G70, a CPU implementation reliably attains the best-known solutions, reaching cuts of 5799 and 9595 with 99%-confidence times-to-target of 15 s and 2.4 s, respectively. On the heterogeneous-degree G64 instance, Cosm establishes a new best-known cut of 8753. Broadly, the results suggest an alternative approach to heuristic design in which local dynamics and orchestration mechanisms are carefully designed so that effective search emerges.

cs.CE

Decomposing Firm-Level Crisis Responses from Incomplete Market Signals: Evidence from China's IT Sector During COVID-19

Exogenous shocks generate heterogeneous behavioral responses across firms, yet event studies typically report only sector-level averages. This paper develops a multi-method approach combining causal identification (difference-in-differences with cluster-robust inference), unsupervised behavioral discovery (K-means trajectory clustering, Gaussian hidden Markov models), and cross-sectional resilience prediction (logistic regression with nested cross-validation) to decompose firm-level response heterogeneity from noisy market signals. We demonstrate the approach on 246 Chinese A-share IT firms (216 with complete data for all analyses) during the COVID-19 shock (January 2020), using 252 non-IT CSI 300 firms as controls. The return decline was market-wide, not IT-specific (DID p = 0.59); the IT-specific effect was elevated volatility (DID beta = 0.043, cluster-robust p < 0.001), with the effect surviving Benjamini-Hochberg correction in 13 of 30 alternative specifications. Unsupervised clustering produced three trajectory groups: fast recovery (36 companies, +29.7%), resilient/moderate (67 companies), and persistent drag (113 companies, -6.9%). Pre-crisis financial fundamentals showed only modest predictive power for resilience (nested CV AUC = 0.635, 95% CI: 0.558-0.711; permutation p = 0.016), consistent with the limited informativeness of publicly available signals for anticipating crisis outcomes. The combination of causal analysis, unsupervised learning, and prediction represents a reproducible framework which can be applied to crises in other market periods.

cs.CE

An Insurance Broker for Every Small Business: The Economics of Exceptional Care at Scale

Small-business owners need expert guidance on their own terms, across schedules, languages, and channels, but low premiums make exceptional, continuous human service uneconomic for much of the market. Combining public evidence, Kinro operational data, and an illustrative five-year service model, we show why traditional brokerage economics leave 35 million U.S. small businesses underserved. An AI-native brokerage can change those economics by performing and coordinating routine work continuously, while licensed professionals govern consequential exceptions and the brokerage remains accountable.

cs.CE