Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.6% · Dec 201919922001200920172026
48 results for reconfigurable layout

New method characterizes surface quadrilateral layouts as special immersions.

problem Characterize surface quadrilateral layouts mathematically.
method Characterizes quadrilateral layouts as special immersions of a cut representation of the surface into the Euclidean plane.
result Mathematically describes and generalizes integer grid maps.

Different layouts can characterize different aspects of the same graph. Finding a "good" layout of a graph is thus an important task for graph visualization. In practice, users often visualize a graph in multiple layouts by using different methods and varying parameter settings until they find a layout that best suits …

2019-04-27abs ↗pdf ↗

This work evaluates machine learning-based hotspot detectors on synthesized layout patterns.

problem Evaluating model robustness and generality of machine learning-based hotspot detectors.
method Developed an automatic layout generation tool to synthesize various layout patterns and tested machine learning-based detectors on these synthesized layouts.
result Machine learning-based detectors need continuous study for robustness and generality in DFM flows.

OLALA automates document layout annotation by selecting ambiguous regions for labeling.

problem Efficiently annotating complex document layouts with limited resources.
method Object-Level Active Learning framework that selects ambiguous regions for labeling and uses semi-automatic correction.
result OLALA significantly boosts model performance and improves annotation efficiency.

AutoLL uses neural networks to automatically reorder graph nodes for linear layouts.

problem Finding optimal node order in adjacency matrices without predefined features.
method Developed AutoLL-D and AutoLL-U neural network models for one-mode reordering of directed and undirected graphs.
result Demonstrated effectiveness of AutoLL through qualitative and quantitative evaluations.

Framework predicts and prepares for rain-induced microwave link attenuation.

problem Severe signal attenuation due to weather conditions degrades network performance.
method Predictive Network Reconfiguration (PNR) framework using LSTM for attenuation prediction and MSNR for dynamic routing.
result Framework improves network utilization by more than 200% compared to reactive algorithms.

Federated edge learning improves with CSIT-free model aggregation using RIS.

problem Lack of CSIT in federated edge learning systems.
method Use RIS to align channel coefficients for model aggregation without CSIT, optimize RIS and receiver jointly.
result Achieves similar learning accuracy as CSIT-based methods without CSIT.

A grid layout method for graph classification using CNNs.

problem How to project graphs onto grids for CNNs to work effectively.
method Proposes a novel graph-preserving grid layout (GPGL) using integer programming to minimize topological loss, and solves it approximately with a regularized Kamada-Kawai algorithm.
result Demonstrates the success of the method for graph classification using multi-scale maxout CNNs.

Proposes AtCoR for predicting bike station usage, improving station network reconfiguration.

problem Challenges in predicting new bike stations due to lack of historical data.
method AtCoR algorithm that predicts both existing and new bike stations using station-centered heatmaps and historical correlations.
result AtCoR outperforms existing models in predicting bike station usage.

We present an approach for reconfiguration of dynamic visual sensor networks with deep reinforcement learning (RL). Our RL agent uses a modified asynchronous advantage actor-critic framework and the recently proposed Relational Network module at the foundation of its network architecture. To address the issue of sample…

2018-08-13abs ↗pdf ↗

Optimization is commonly employed to determine the content of web pages, such as to maximize conversions on landing pages or click-through rates on search engine result pages. Often the layout of these pages can be decoupled into several separate decisions. For example, the composition of a landing page may involve dec…

2018-10-22abs ↗pdf ↗

A machine-learning method speeds up RIS design by predicting reflection coefficients.

problem Extensive full-wave EM simulations are time-consuming for RIS design.
method Combining MLP and dual-port network to develop a fast model.
result The proposed method significantly reduces the time for RIS design.

SPX optimizes multiple graph drawing metrics for better readability.

problem Graph drawing algorithms often optimize one metric at a time, leading to suboptimal layouts.
method Introduces Stress-Plus-X (SPX) framework that optimizes stress, crossings, angles, and upwardness simultaneously.
result SPX achieves results close to state-of-the-art algorithms that optimize metrics individually.

Machine learning speeds up RIS design for efficient RF components.

problem Designing reconfigurable intelligent surfaces (RIS) for efficient RF components is time-consuming and resource-intensive.
method Machine/deep learning techniques are used to reduce the computational cost and time of RIS inverse design.
result Machine learning techniques significantly reduce the time and computational cost of RIS design.

Adversarial perturbations and RIS interaction vectors improve covert communication.

problem Covert communication in the presence of RISs.
method Designing RIS interaction vectors to balance receiver and eavesdropper detection, adding adversarial perturbations to signals.
result Adversarial perturbations and RIS interaction vectors can be jointly designed to boost covert communications.

Efficiently generates high-resolution images with reduced sampling time using LEGO bricks.

problem Efficiently generating high-resolution images with reduced sampling time.
method Introduces LEGO bricks that integrate Local-feature Enrichment and Global-content Orchestration to create a test-time reconfigurable diffusion backbone.
result Significantly reduces sampling time compared to other methods.

In this work, we give some new characterizations for inclined curves and slant helices in n-dimensional Euclidean space E^{n}. Morever, we consider the pre-characterizations about inclined curves and slant helices and reconfigure them.

2012-08-12abs ↗pdf ↗

Graph autoencoders enable ML across diverse sensor networks.

problem Deploying ML across different sensor networks with varying types or layouts.
method Graph Autoencoders for activity recognition across heterogeneous sensor networks.
result Transferable activity classifiers achieve 75% accuracy on unseen sensor layouts.

We reconfigure the Milnor invariant of links in terms of central group extensions and unipotent Magnus embeddings. We also develop a diagrammatic computation of the invariant and compute the first non-vanishing invariants of the Milnor link and of several other links. Moreover, we refine the original Milnor invariants …

2017-09-21abs ↗pdf ↗

Wind farm layout optimisation tackles space constraints with Bayesian multi-objective approach.

problem Optimizing wind farm layout due to limited space and conflicting objectives.
method Set-based multi-objective Bayesian optimisation using Gaussian process.
result Demonstrates potential of set-based Bayesian multi-objective optimisation for wind farm layout.

PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.

problem Persistent positional biases and sensitivity to role assignments in fixed topologies.
method Dynamic reconfiguration of agent roles and sparse topologies based on evolving agent states.
result Significantly improves average accuracy over debate baselines across multiple reasoning benchmarks.

The paper uses deep learning to speed up spatial and visual connectivity analysis.

problem Slow calculation of spatial and visual connectivity metrics.
method Investigates machine learning models and a pipeline for training them on spatial and visual connectivity analysis.
result Deep learning models significantly speed up the analysis process.

Layout design with complex constraints is a challenging problem to solve due to the non-uniqueness of the solution and the difficulties in incorporating the constraints into the conventional optimization-based methods. In this paper, we propose a design method based on the recently developed machine learning technique,…

2018-06-07abs ↗pdf ↗

Deep generative models have shown promising results in generating realistic images, but it is still non-trivial to generate images with complicated structures. The main reason is that most of the current generative models fail to explore the structures in the images including spatial layout and semantic relations betwe…

2018-07-10abs ↗pdf ↗

Researchers often summarize their work in the form of posters. Posters provide a coherent and efficient way to convey core ideas from scientific papers. Generating a good scientific poster, however, is a complex and time consuming cognitive task, since such posters need to be readable, informative, and visually aesthet…

2016-04-05abs ↗pdf ↗

New method learns quantum states using neural networks, revealing hidden dynamics.

problem High-precision ground state estimation of quantum many-body problems.
method Stochastic reconfiguration method with neural network Ansatz states.
result Learning landscape modes with least entanglement have largest eigenvalues, suggesting correlations are encoded in large flat valleys.

Method reconstructs missing wind farm data using graph theory and nearest neighbors.

problem Missing data in wind farm records due to sensor failures.
method Combines spectral graph theory and k-Nearest Neighbors to estimate missing data.
result Significant improvement in data reconstruction over existing methods.