New model generates code from GUI screenshots using attention and hierarchical structure.
problem Challenges in converting abstract image features to code.
method Attention-based hierarchical decoder trained end-to-end.
result Model outperforms state-of-the-art methods on GUI-code datasets.
The paper solves three problems related to monostable polyhedra.
problem Three problems related to monostable polyhedra posed by Conway and Goldberg.
method General theorem describing approximations of smooth convex bodies by convex polyhedra in terms of static equilibrium points.
result Existence of a convex polyhedron with only one stable and one unstable point.
We provide complete source code for a front-end GUI and its back-end counterpart for a stock market visualization tool. It is built based on the "functional visualization" concept we discuss, whereby functionality is not sacrificed for fancy graphics. The GUI, among other things, displays a color-coded signal (computed…
TODS automates time series outlier detection with customizable pipelines.
problem Automated detection of outliers in time series data.
method Modular system with 70 primitives for data processing, time series analysis, and detection algorithms. GUI and data-driven searcher for pipeline design.
result Automated discovery and construction of effective outlier detection pipelines.
We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topolog…
In this paper it is shown that a complete graph with n vertices has an optimal diagram, i.e., a diagram whose crossing number equals the value of Guy's formula, with a free maximal linear tree and without free hamiltonian cycles for any odd integer n≥7.
Deep learning model classifies concurrent human interactions from WiFi data with high accuracy.
problem Classifying concurrent human interactions from WiFi data with high accuracy.
method Attention-BiGRU deep learning model using Multiple Input Multiple Output radio link.
result Maximum benchmark accuracy of 94% for a single subject-pair, 88% for ten subject pairs.
We study global Mumford-Shah minimizers in RN, introduced by Bonnet as blow-up limits of Mumford-Shah minimizers. We prove a new monotonicity formula for the energy of u when the singular set K is contained in a smooth enough cone. We then use this monotonicity to prove that for any reduced global minimizer $(u…
Circular disc can be tiled with up to 3 congruent pieces, showing symmetry.
problem Tiling a circular disc with congruent pieces.
method Proving the existence of a k-fold rotational symmetry for k≤3. result First nontrivial estimate on minimum number of tiles for certain tiling configurations.
LIBTwinSVM offers a free library for efficient Twin Support Vector Machines.
problem Large-scale classification problems.
method Efficient implementation of Twin Support Vector Machines.
result Effectiveness demonstrated through benchmarks.
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph M(i) of a generic surface i:F→S3 is the set of values which are either singularities or intersections. It is a multigraph whose edges are trans…
RAMANMETRIX simplifies Raman spectroscopy data analysis.
problem Complexity of Raman spectroscopy data processing.
method User-friendly software with chemometric analysis workflow.
result Facilitates integration of Raman spectroscopy into clinical routines.
stCEG models spatial events using Chain Event Graphs in R.
problem Modeling events over spatial areas.
method Full specification of CEG models from data, interactive plots, web GUI.
result First software for CEGs with full model customisation.
Local Lipschitz continuity of sub-elliptic harmonic maps into CAT(0) spaces proved.
problem Proving Lipschitz continuity of sub-elliptic harmonic maps between singular spaces.
method Analyzing sub-elliptic harmonic maps from the Heisenberg group into CAT(0) spaces.
result Local Lipschitz continuity established for sub-elliptic harmonic maps.
Requirements elicitation can be very challenging in projects that require deep domain knowledge about the system at hand. As analysts have the full control over the elicitation process, their lack of knowledge about the system under study inhibits them from asking related questions and reduces the accuracy of requireme…
YOLOv3 detects ships in real-time with high accuracy.
problem Real-time target detection in maritime scenarios.
method YOLOv3 model trained on a large dataset of marine vessels.
result Average Precision up to 96% for IoU of 0.5.
Sharp uniqueness result for Q-curvature type equation on S^6.
problem Proving uniqueness of axially symmetric solutions to a Q-curvature type equation on S^6.
method New estimates on semi-norm and Gegenbauer coefficients.
result Axially symmetric solutions are constants for a specific range of α.
Data visualization and interaction with large data sets is known to be essential and critical in many businesses today, and the same applies to research and teaching, in this case, when exploring large and complex mathematical objects. GAP is a computer algebra system for computational discrete algebra with an emphasis…
The Morris Water Maze is commonly used in behavioural neuroscience for the study of spatial learning with rodents. Over the years, various methods of analysing rodent data collected in this task have been proposed. These methods span from classical performance measurements (e.g. escape latency, rodent speed, quadrant p…
BPt is a Python library for ML with neuroimaging data.
problem Analyzing large neuroimaging datasets using machine learning.
method Unified framework of ML tools for tabulated and neuroimaging data.
result Unified ML tools for neuroimaging and tabulated data.
MaaSim creates an open-source liveability simulation for urban planning.
problem Improving liveability in cities through better urban planning.
method Developed an open-source simulation with AI, feature selection, and optimization.
result Achieved a recall of 0.83 with 10-fold cross-validation for predictions.
CNNs identify stock market trend endpoints based on expert opinion.
problem Finding optimal entry and exit points for stock market trends.
method Three CNN submodels sequentially identify changepoints, locate them, and classify trends as upward, downward, or flat.
result CNNs can identify long-term trends based on expert opinion, offering a new approach to stock market analysis.
Software automates metabolomics data analysis for reproducible results.
problem Automating reproducible metabolomics data analysis.
method Object-oriented software engineering, Java, XML database, GUI, version control system.
result MeKDDaM-SAGA successfully guides metabolomics applications.
Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called Black-Box problems, and function evaluations are considered to be expensive. In the case of continuous single-obje…
Paper defines generalized braids and proves their subgroup status.
problem Understanding the structure of generalized braids and knots.
method Defined generalized braid theories and computed their generating sets.
result Quasitoric normal generalized braids form a subgroup of normal generalized braid group.
Defines a new Poisson structure for generalized Sasakian spaces.
problem No specific problem stated; focuses on new structure definition.
method Defines a canonical Poisson structure on generalized contact metric spaces.
result Shows distinction between generalized Sasakian and coKähler structures.
Characterizes integrability of generalized structures on Courant algebroids.
problem Integrability of generalized structures on Courant algebroids.
method Characterization via torsion-free generalized connections and Dirac generating operators.
result Criterion for integrability of generalized almost Hermitian structures and hyper-Hermitian structures.
Improved image generation through iterative flow matching to reduce hallucinations.
problem Hallucinations in image generation models.
method Iterative flow matching to refine and correct paths in generative models.
result Enhanced generative modeling with reduced unrealistic images.
Plug-and-play multimodal controller improves class-conditional image generation.
problem Generating class-conditional images from user-specified labels.
method Introduces a `multimodal controller` to generate multimodal data without additional learning parameters.
result Multimodal controlled generative models produce higher quality class-conditional images and novel modalities.
Framework generates personalized insulin treatment strategies using deep models.
problem Developing optimal personalized treatment strategies for diabetes patients.
method Combines deep generative time series models with decision theory.
result Demonstrated improved personalized insulin treatment strategies for diabetes patients.
The study addresses exposure bias in generative models, proposing unconditional generation as a solution.
problem Exposure bias in autoregressive generative models using ground-truth contexts at training and generated ones at test.
method Combining latent variable modeling with reinforcement learning exploration, the study proposes unconditional generation as a benchmark for generalization.
result The model demonstrates improved generalization capability on language modeling and variational sentence auto-encoding tasks.
Survey on deep models for graph generation.
problem Improving fidelity of generated graphs.
method Taxonomy and comparison of deep generative models.
result Advances in deep generative models for graph generation.
OptiGAN uses GAN and RL to optimize sequence generation for specific goals.
problem Challenging in sequence generation tasks to generate sequences with specific desired goals.
method Integrates GAN and RL to optimize desired goal scores using policy gradients.
result Achieves higher desired scores in text and real-valued sequence generation.
Improves deep generative models to generate images of any size.
problem Fixed-sized output images from deep generative models.
method Integrates spatial noise vectors into fully convolutional neural networks.
result Theoretical interpretation of infinite spatial generation using spatial stochastic processes.
Develops a unified theory of Yang-Mills and GR using generalized principal bundles.
problem Combining Yang-Mills theories and General Relativity into a single framework.
method Using generalized principal bundle theory, the authors develop a new approach to field theories.
result Recover General Relativity within the framework of generalized principal connections.
Meta-CoTGAN improves adversarial text generation by preventing mode collapse.
problem Mode collapse in adversarial text generation.
method Meta-Cooperative Training Paradigm with a language model.
result Meta-CoTGAN effectively slows down mode collapse and improves generation quality and diversity.
Generative models can still learn from contaminated data, but with limitations.
problem How much contamination can generative models tolerate?
method Characterized robustness under contaminated enumerations, proving generation is achievable for all countable collections if contamination fraction converges to zero.
result Generation under contamination is achievable for all countable collections if contamination fraction converges to zero, but dense generation is strictly less robust.
Generative models use EOT cost for better image generation.
problem Developing models to learn implicit distributions for image generation.
method Two models: one-shot optimization with EOT cost and adversarial game with EOT cost.
result Improved image generation performance on MNSIT.
Generative AI tasks analyzed for text, images, audio, video, code, and molecules.
problem What is the core question when using generative AI?
method Survey of generative model families, probabilistic framework, game-theoretic setup, post-training modifications, socially responsible considerations.
result Generative AI is a distinct machine learning task with connections to prediction, compression, and decision-making.
New method learns text generation orders without pre-specification.
problem Generating text in arbitrary orders without manual specification.
method Generates text in non-monotonic orders using a binary tree structure and imitation learning.
result Models can generate text without pre-specifying an order, achieving competitive performance.
Defines Kahler angle for a broader context.
problem Generalizing results about Kahler angle.
method Provides a general definition of Kahler angle.
result Generalized results about Kahler angle.
Established a generalized Boothby-Wang theorem in contact geometry.
problem Generalized contact structures and their properties.
method Courant reduction methods and construction of principal bundles.
result Induced symplectic foliation on leaf space under certain conditions.
The twistor construction for Riemannian manifolds is extended to the case of manifolds endowed with generalized metrics (in the sense of generalized geometry à la Hitchin). The generalized twistor space associated to such a manifold is defined as the bundle of generalized complex structures on the tangent spaces of the…
This research proves guarantees on sequence models' generalization to longer and novel sequences.
problem Generalization to longer sequences and novel token combinations in sequence models.
method Provable guarantees on length and compositional generalization for various sequence models.
result Limited capacity models achieve both length and compositional generalization with diverse training distributions.
SHADOWCAST generates graphs with user-specified attributes.
problem Controlling graph generation with understandable structures.
method Conditional generative adversarial network guided by Markov model.
result Competitive performance in generating desired graphs.
In this paper we define the notion of a generalized coKähler structure and prove that the product M1×M2 of generalized contact metric manifolds (Mi,Φi,E±,i,Gi), i=1,2, where M1×M2 is endowed with the product generalized complex structure induced from Φ1 and Φ2, is gener…
Paper analyzes and improves GANs' generalization and stability.
problem Poor generalization of GANs' discriminators in practical settings.
method Proposes a zero-centered gradient penalty to improve discriminator's generalization.
result Improves GANs' generalization and convergence through the proposed penalty.
In this communication, we describe some interrelations between generalized q-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of en…