Search

This study is the first attempt to explore the impact of clarification question modality on user preference in search engines. We introduce the multi-modal search clarification dataset, MIMICS-MM, containing clarification questions with associated expert-collected and model-generated images. We analyse user preferences over different clarification modes of text, image, and combination of both through crowdsourcing by taking into account image and text quality, clarity, and relevance. Our findings demonstrate that users generally prefer multi-modal clarification over uni-modal approaches. We explore the use of automated image generation techniques and compare the quality, relevance, and user preference of model-generated images with human-collected ones. The study reveals that text-to-image generation models, such as Stable Diffusion, can effectively generate multi-modal clarification questions. By investigating multi-modal clarification, this research establishes a foundation for future advancements in search systems.

We propose a new framework for formulating optimal transport distances between Markov chains. Previously known formulations studied couplings between the entire joint distribution induced by the chains, and derived solutions via a reduction to dynamic programming (DP) in an appropriately defined Markov decision process. This formulation has, however, not led to particularly efficient algorithms so far, since computing the associated DP operators requires fully solving a static optimal transport problem, and these operators need to be applied numerous times during the overall optimization process. In this work, we develop an alternative perspective by considering couplings between a flattened version of the joint distributions that we call discounted occupancy couplings, and show that calculating optimal transport distances in the full space of joint distributions can be equivalently formulated as solving a linear program (LP) in this reduced space. This LP formulation allows us to port several algorithmic ideas from other areas of optimal transport theory. In particular, our formulation makes it possible to introduce an appropriate notion of entropy regularization into the optimization problem, which in turn enables us to directly calculate optimal transport distances via a Sinkhorn-like method we call Sinkhorn Value Iteration (SVI). We show both theoretically and empirically that this method converges quickly to an optimal coupling, essentially at the same computational cost of running vanilla Sinkhorn in each pair of states. Along the way, we point out that our optimal transport distance exactly matches the common notion of bisimulation metrics between Markov chains, and thus our results also apply to computing such metrics, and in fact our algorithm turns out to be significantly more efficient than the best known methods developed so far for this purpose.

Intelligent Tutoring Systems (ITSs) have shown great potential in delivering personalized and adaptive education, but their widespread adoption has been hindered by the need for specialized programming and design skills. Existing approaches overcome the programming limitations with no-code authoring through drag and drop, however they assume that educators possess the necessary skills to design effective and engaging tutor interfaces. To address this assumption we introduce generative AI capabilities to assist educators in creating tutor interfaces that meet their needs while adhering to design principles. Our approach leverages Large Language Models (LLMs) and prompt engineering to generate tutor layout and contents based on high-level requirements provided by educators as inputs. However, to allow them to actively participate in the design process, rather than relying entirely on AI-generated solutions, we allow generation both at the entire interface level and at the individual component level. The former provides educators with a complete interface that can be refined using direct manipulation, while the latter offers the ability to create specific elements to be added to the tutor interface. A small-scale comparison shows the potential of our approach to enhance the efficiency of tutor interface design. Moving forward, we raise critical questions for assisting educators with generative AI capabilities to create personalized, effective, and engaging tutors, ultimately enhancing their adoption.

We propose a method for reducing the spatial discretization error of coarse computational fluid dynamics (CFD) problems by enhancing the quality of low-resolution simulations using deep learning. We feed the model with fine-grid data after projecting it to the coarse-grid discretization. We substitute the default differencing scheme for the convection term by a feed-forward neural network that interpolates velocities from cell centers to face values to produce velocities that approximate the down-sampled fine-grid data well. The deep learning framework incorporates the open-source CFD code OpenFOAM, resulting in an end-to-end differentiable model. We automatically differentiate the CFD physics using a discrete adjoint code version. We present a fast communication method between TensorFlow (Python) and OpenFOAM (c++) that accelerates the training process. We applied the model to the flow past a square cylinder problem, reducing the error from 120% to 25% in the velocity for simulations inside the training distribution compared to the traditional solver using an x8 coarser mesh. For simulations outside the training distribution, the error reduction in the velocities was about 50%. The training is affordable in terms of time and data samples since the architecture exploits the local features of the physics.

Initially designed to predict and explain the economic trajectories of countries, cities, and regions, economic complexity has been found applicable in diverse contexts such as ecology and chess openings. The success of economic complexity stems from its capacity to assess hidden capabilities within a system indirectly. The existing algorithms for economic complexity operate only when the underlying interaction topology conforms to a bipartite graph. A single link disrupting the bipartite structure renders these algorithms inapplicable, even if the weight of that link is tiny compared to others. This paper presents a novel extension of economic complexity to encompass any graph, overcoming the constraints of bipartite structures. Additionally, it introduces fitness centrality and orthofitness centrality as new centrality measures in graphs. Fitness Centrality emerges as a promising metric for assessing node vulnerability, akin to node betweenness centrality. Furthermore, we unveil the cost functions that drive the minimization procedures underlying the economic complexity index and fitness centrality algorithms. This extension broadens the scope of economic complexity analysis, enabling its application in diverse network structures beyond bipartite graphs., Comment: 20 pages, 8 figures, 1 table, 5 appendices

The recently proposed soft finite element method (SoftFEM) reduces the stiffness (condition numbers), consequently improving the overall approximation accuracy. The method subtracts a least-square term that penalizes the gradient jumps across mesh interfaces from the FEM stiffness bilinear form while maintaining the system's coercivity. Herein, we present two generalizations for SoftFEM that aim to improve the approximation accuracy and further reduce the discrete systems' stiffness. Firstly and most naturally, we generalize SoftFEM by adding a least-square term to the mass bilinear form. Superconvergent results of rates $h^6$ and $h^8$ for eigenvalues are established for linear uniform elements; $h^8$ is the highest order of convergence known in the literature. Secondly, we generalize SoftFEM by applying the blended Gaussian-type quadratures. We demonstrate further reductions in stiffness compared to traditional FEM and SoftFEM. The coercivity and analysis of the optimal error convergences follow the work of SoftFEM. Thus, this paper focuses on the numerical study of these generalizations. For linear and uniform elements, analytical eigenpairs, exact eigenvalue errors, and superconvergent error analysis are established. Various numerical examples demonstrate the potential of generalized SoftFEMs for spectral approximation, particularly in high-frequency regimes.

The Deep Fourier Residual (DFR) method is a specific type of variational physics-informed neural networks (VPINNs). It provides a robust neural network-based solution to partial differential equations (PDEs). The DFR strategy is based on approximating the dual norm of the weak residual of a PDE. This is equivalent to minimizing the energy norm of the error. To compute the dual of the weak residual norm, the DFR method employs an orthonormal spectral basis of the test space, which is known for rectangles or cuboids for multiple function spaces. In this work, we extend the DFR method with ideas of traditional domain decomposition (DD). This enables two improvements: (a) to solve problems in more general polygonal domains, and (b) to develop an adaptive refinement technique in the test space using a Dofler marking algorithm. In the former case, we show that under non-restrictive assumptions we retain the desirable equivalence between the employed loss function and the H1-error, numerically demonstrating adherence to explicit bounds in the case of the L-shaped domain problem. In the latter, we show how refinement strategies lead to potentially significant improvements against a reference, classical DFR implementation with a test function space of significantly lower dimensionality, allowing us to better approximate singular solutions at a more reasonable computational cost.

Laboratory measurements on Vaca Muerta formation samples show stress-dependent elastic behavior and compaction at representative in-situ conditions. Experimental results show that the analyzed samples exhibit elasto-plastic deformation and shear-enhanced compaction as the main plasticity mechanism. These experimental observations conflict with the anticipated linear-elastic response prior to the brittle failure reported in several works on the geomechanical characterization of the Vaca Muerta formation. Therefore, we present a complete laboratory analysis of samples from the Vaca Muerta formation showing experimental evidence of nonlinear elastic and unrecoverable shear-enhanced compaction. We also calibrate an elastoplastic constitutive model using these experimental observations; the resulting model reproduces the observed phenomena adequately.

This paper interprets the stabilized finite element method via residual minimization as a variational multiscale method. We approximate the solution to the partial differential equations using two discrete spaces that we build on a triangulation of the domain; we denote these spaces as coarse and enriched spaces. Building on the adaptive stabilized finite element method via residual minimization, we find a coarse-scale approximation in a continuous space by minimizing the residual on a dual discontinuous Galerkin norm; this process allows us to compute a robust error estimate to construct an on-the-fly adaptive method. We reinterpret the residual projection using the variational multiscale framework to derive a fine-scale approximation. As a result, on each mesh of the adaptive process, we obtain stable coarse- and fine-scale solutions derived from a symmetric saddle-point formulation and an a-posteriori error indicator to guide automatic adaptivity. We test our framework in several challenging scenarios for linear and nonlinear convection-dominated diffusion problems to demonstrate the framework's performance in providing stability in the solution with optimal convergence rates in the asymptotic regime and robust performance in the pre-asymptotic regime. Lastly, we introduce a heuristic dual-term contribution in the variational form to improve the full-scale approximation for symmetric formulations (e.g., diffusion problem).

Isoporous membranes made from diblock copolymers have numerous applications, including water treatment and protein separation, and are successfully produced at a laboratory scale under controlled conditions. However, achieving optimal conditions for membrane preparation remains a challenge due to the complexity of the involved phenomena. Experimental studies have shown that the self-assembly of block copolymers in solution significantly affects the final membrane structure. Despite extensive research, understanding the multiscale phenomena leading to the characteristic morphology is still elusive. We address this gap by using mesoscale computational simulations to investigate the self-assembly of block copolymers in selective solvents, consistent with isoporous membrane preparation. We focus on the interplay between entropic and enthalpic interactions and their effects on the morphology of the micellar aggregates in solution. Our computational results are consistent with experimental evidence, revealing a morphological transition of the aggregates as the polymer concentration and solvent affinity change. We propose different phase parameters to characterize the emergence of monodisperse-spherical micelles in solution and describe the order of crew-cut micelles using a rigid-sphere approximation. Our study provides valuable insights into the self-assembly of diblock copolymers to optimize the preparation of isoporous membranes.

IoT devices are sorely underutilized in the medical field, especially within machine learning for medicine, yet they offer unrivaled benefits. IoT devices are low-cost, energy-efficient, small and intelligent devices. In this paper, we propose a distributed federated learning framework for IoT devices, more specifically for IoMT (Internet of Medical Things), using blockchain to allow for a decentralized scheme improving privacy and efficiency over a centralized system; this allows us to move from the cloud-based architectures, that are prevalent, to the edge. The system is designed for three paradigms: 1) Training neural networks on IoT devices to allow for collaborative training of a shared model whilst decoupling the learning from the dataset to ensure privacy. Training is performed in an online manner simultaneously amongst all participants, allowing for the training of actual data that may not have been present in a dataset collected in the traditional way and dynamically adapt the system whilst it is being trained. 2) Training of an IoMT system in a fully private manner such as to mitigate the issue with confidentiality of medical data and to build robust, and potentially bespoke, models where not much, if any, data exists. 3) Distribution of the actual network training, something federated learning itself does not do, to allow hospitals, for example, to utilize their spare computing resources to train network models., Comment: Submitted to IEEE EMBC 2023

The Adaptive Stabilized Finite Element method (AS-FEM) developed in Calo et. al. combines the idea of the residual minimization method with the inf-sup stability offered by the discontinuous Galerkin (dG) frameworks. As a result, the discretizations deliver stabilized approximations and residual representatives in the dG space that can drive automatic adaptivity. We generalize AS FEM by considering continuous test spaces; thus, we propose a residual minimization method on a stable Continuous Interior Penalty (CIP) formulation that considers a C0-conforming trial FEM space and a test space based on the enrichment of the trial space by bubble functions. In our numerical experiments, the test space choice results in a significant reduction of the total degrees of freedom compared to the dG test spaces of Calo et. al. that converge at the same rate. Moreover, as trial and test spaces are C0-conforming, implementing a full dG data structure is unnecessary, simplifying the method's implementation considerably and making it appealing for industrial applications, see Labanda et. al.

Deep Learning (DL) developers come from different backgrounds, e.g., medicine, genomics, finance, and computer science. To create a DL model, they must learn and use high-level programming languages (e.g., Python), thus needing to handle related setups and solve programming errors. This paper presents DeepBlocks, a visual programming tool that allows DL developers to design, train, and evaluate models without relying on specific programming languages. DeepBlocks works by building on the typical model structure: a sequence of learnable functions whose arrangement defines the specific characteristics of the model. We derived DeepBlocks' design goals from a 5-participants formative interview, and we validated the first implementation of the tool through a typical use case. Results are promising and show that developers could visually design complex DL architectures.

Design mockups are essential instruments for visualizing and testing design ideas. However, the process of generating mockups can be time-consuming and challenging for designers. In this article, we present and evaluate two different modalities for generating mockup ideas to support designers in their work: (1) a sketch-based approach to generate mockups based on hand-drawn sketches, and (2) a semantic-based approach to generate interfaces based on a set of predefined design elements. To evaluate the effectiveness of these two approaches, we conducted a series of experiments with 13 participants in which we asked them to generate mockups using each modality. Our results show that sketch-based generation was more intuitive and expressive, while semantic-based generative AI obtained better results in terms of quality and fidelity. Both methods can be valuable tools for UI designers looking to increase their creativity and efficiency.

The minimization of propositional formulae is a classical problem in logic, whose first algorithms date back at least to the 1950s with the works of Quine and Karnaugh. Most previous work in the area has focused on obtaining minimal, or quasi-minimal, formulae in conjunctive normal form (CNF) or disjunctive normal form (DNF), with applications in hardware design. In this paper, we are interested in the problem of obtaining an equivalent formula in any format, also allowing connectives that are not present in the original formula. We are primarily motivated in applying minimization algorithms to generate natural language translations of the original formula, where using shorter equivalents as input may result in better translations. Recently, Buchfuhrer and Umans have proved that the (decisional version of the) problem is $\Sigma_2^p$-complete. We analyze three possible (practical) approaches to solving the problem. First, using brute force, generating all possible formulae in increasing size and checking if they are equivalent to the original formula by testing all possible variable assignments. Second, generating the Tseitin coding of all the formulae and checking equivalence with the original using a SAT solver. Third, encoding the problem as a Quantified Boolean Formula (QBF), and using a QBF solver. Our results show that the QBF approach largely outperforms the other two.

We present DECO ("Discrete and Efficient Counting of Operators"), an implementation of the Hilbert Series to enumerate subleading operator bases for SMEFT-like EFTs with symmetry groups as typically found in flavour and BSM physics. DECO can accommodate EFTs with arbitrary numbers and combinations of the SM gauge groups, as well as the discrete groups S4, A4, and Zn, and U(1) groups with residual global charge (and these groups' most important representations). The program is highly modular and can easily be extended to additional groups and/or representations. We demonstrate the design cases for DECO by using it to cross-check subleading operator bases of EFTs in the literature, which allows us to identify a missing operator in a widely used model for the neutrino masses and discuss said operator's impact., Comment: 20 pages, no figures. Published version

In September 2016, Stanford's "One Hundred Year Study on Artificial Intelligence" project (AI100) issued the first report of its planned long-term periodic assessment of artificial intelligence (AI) and its impact on society. It was written by a panel of 17 study authors, each of whom is deeply rooted in AI research, chaired by Peter Stone of the University of Texas at Austin. The report, entitled "Artificial Intelligence and Life in 2030," examines eight domains of typical urban settings on which AI is likely to have impact over the coming years: transportation, home and service robots, healthcare, education, public safety and security, low-resource communities, employment and workplace, and entertainment. It aims to provide the general public with a scientifically and technologically accurate portrayal of the current state of AI and its potential and to help guide decisions in industry and governments, as well as to inform research and development in the field. The charge for this report was given to the panel by the AI100 Standing Committee, chaired by Barbara Grosz of Harvard University., Comment: 52 pages, https://ai100.stanford.edu/2016-report

The ExoClock project has been created with the aim of increasing the efficiency of the Ariel mission. It will achieve this by continuously monitoring and updating the ephemerides of Ariel candidates over an extended period, in order to produce a consistent catalogue of reliable and precise ephemerides. This work presents a homogenous catalogue of updated ephemerides for 450 planets, generated by the integration of $\sim$18000 data points from multiple sources. These sources include observations from ground-based telescopes (ExoClock network and ETD), mid-time values from the literature and light-curves from space telescopes (Kepler/K2 and TESS). With all the above, we manage to collect observations for half of the post-discovery years (median), with data that have a median uncertainty less than one minute. In comparison with literature, the ephemerides generated by the project are more precise and less biased. More than 40\% of the initial literature ephemerides had to be updated to reach the goals of the project, as they were either of low precision or drifting. Moreover, the integrated approach of the project enables both the monitoring of the majority of the Ariel candidates (95\%), and also the identification of missing data. The dedicated ExoClock network effectively supports this task by contributing additional observations when a gap in the data is identified. These results highlight the need for continuous monitoring to increase the observing coverage of the candidate planets. Finally, the extended observing coverage of planets allows us to detect trends (TTVs - Transit Timing Variations) for a sample of 19 planets. All products, data, and codes used in this work are open and accessible to the wider scientific community., Comment: Recommended for publication to ApJS (reviewer's comments implemented). Main body: 13 pages, total: 77 pages, 7 figures, 7 tables. Data available at http://doi.org/10.17605/OSF.IO/P298N

We perform phase-field simulations of the electrodeposition process that forms dendrites within metal-anode batteries including anisotropic representation. We describe the evolution of a phase field, the lithium-ion concentration, and an electric potential, during a battery charge cycle, solving equations using time-marching algorithms with automatic time-step adjustment and implemented on an open-source finite element library. A modified lithium crystal surface anisotropy representation for phase-field electrodeposition model is proposed and evaluated through different numerical tests, exhibiting low sensitivity to the numerical parameters. Change of dendritic morphological behaviour is captured by a variation of the simulated inter-electrode distance. A set of simulations are presented to validate the proposed formulation, showing their agreement with experimentally-observed lithium dendrite growth rates, and morphologies reported in the literature., Comment: Under Review

We extend the softFEM idea to isogeometric analysis (IGA) to reduce the stiffness (consequently, the condition numbers) of the IGA discretized problem. We refer to the resulting approximation technique as softIGA. We obtain the resulting discretization by first removing the IGA spectral outliers to reduce the system's stiffness. We then add high-order derivative-jump penalization terms (with negative penalty parameters) to the standard IGA bilinear forms. The penalty parameter seeks to minimize spectral/dispersion errors while maintaining the coercivity of the bilinear form. We establish dispersion errors for both outlier-free IGA (OF-IGA) and softIGA elements. We also derive analytical eigenpairs for the resulting matrix eigenvalue problems and show that the stiffness and condition numbers of the IGA systems significantly improve (reduce). We prove a superconvergent result of order $h^{2p+4}$ for eigenvalues where $h$ characterizes the mesh size and $p$ specifies the order of the B-spline basis functions. To illustrate the main idea and derive the analytical results, we focus on uniform meshes in 1D and tensor-product meshes in multiple dimensions. For the eigenfunctions, softIGA delivers the same optimal convergence rates as the standard IGA approximation. Various numerical examples demonstrate the advantages of softIGA over IGA.