Miracle-dz/UniFAR-FTUs huggingface dataset:
“Preparing them for the profession”: An interpretative phenomenological analysis of anatomy educators coping with complexity in the United Kingdom curriculum

Efforts to integrate the basic sciences into the ever‐changing curriculum are a trending area of research in health professions education. Low‐stakes, high‐frequency assessment methods such as the progress test are now widely implemented in the United Kingdom and Northern Ireland as a means of furthering curricular integration toward contemporary goals of competency and professional identity formation. The anatomy educator's experience vis‐à‐vis these curricular changes is not well understood. This study aimed to explore how anatomy educators make sense of the shifting demands of their role. The interviews were semi‐structured, particularly concerned with the phenomenon of teachers adapting to the complexity of their learning environment. The study used interpretative phenomenological analysis (IPA) to focus on the lived experiences of participants coping with the phenomena in question: how do anatomy educators make sense of the learning environment in the United Kingdom? Interviews were transcribed verbatim and interpreted inductively, identifying four key themes: confidence through connectedness, variations in appraisals of curricular integration, managing expectations to perform in paradoxical situations, and the emergence of innovative teaching. Results point to the learning environment as a complex system and highlight the importance of feeling support from and connection to colleagues, enabling individual educators to develop confidence, meet the top‐down demands of changing curricula, and experience personal identity development and uncertainty tolerance within their role. This IPA study offers insight into the lived experiences of anatomy educators whose experiential interpretations of a complex and changing curriculum can uniquely inform stakeholders in health professions education.
Wage Rigidity and Retirement in Optimal Portfolio Choice

We study an agent's lifecycle portfolio choice problem with stochastic labor income, borrowing constraints and a finite retirement date. Similarly to arXiv:2002.00201, wages evolve in a path-dependent way, but the presence of a finite retirement time leads to a novel, two-stage infinite dimensional stochastic optimal control problem with explicit optimal controls in feedback form. This is possible as we find an explicit solution to the associated Hamilton-Jacobi-Bellman (HJB) equation, which is an infinite dimensional PDE of parabolic type. The identification of the optimal feedbacks is delicate due to the presence of time-dependent state constraints, which appear to be new in the infinite dimensional stochastic control literature. The explicit solution allows us to study the properties of optimal strategies and discuss their implications for portfolio choice. As opposed to models with Markovian dynamics, path dependency can now modulate the hedging demand arising from the implicit holding of risky assets in human capital, leading to richer asset allocation predictions consistent with wage rigidity and the agents learning about their earning potential.
Photoconductance of aligned SnO2 nanowire field effect transistors

We report on the optoelectronic properties of the aligned SnO2 nanowire (NW) field effect transistors (FETs) fabricated via a sliding transfer of NWs grown by chemical vapor deposition. Photocurrent measurements with polarized UV light confirmed a well aligned NWs along the channels. UV photosensitivity of ∼107 at the gate voltage Vg=−40 V was obtained due to a small dark-current at the turn-off state of FET. The dynamic response of the photocurrent became faster for the higher mobility SnO2 NW FETs. We expect our aligned SnO2 NW FETs will be useful as polarized UV detectors with a high sensitivity.
Shape Completion with Points in the Shadow

Single-view point cloud completion aims to recover the full geometry of an object based on only limited observation, which is extremely hard due to the data sparsity and occlusion. The core challenge is to generate plausible geometries to fill the unobserved part of the object based on a partial scan, which is under-constrained and suffers from a huge solution space. Inspired by the classic shadow volume technique in computer graphics, we propose a new method to reduce the solution space effectively. Our method considers the camera a light source that casts rays toward the object. Such light rays build a reasonably constrained but sufficiently expressive basis for completion. The completion process is then formulated as a point displacement optimization problem. Points are initialized at the partial scan and then moved to their goal locations with two types of movements for each point: directional movements along the light rays and constrained local movement for shape refinement. We design neural networks to predict the ideal point movements to get the completion results. We demonstrate that our method is accurate, robust, and generalizable through exhaustive evaluation and comparison. Moreover, it outperforms state-of-the-art methods qualitatively and quantitatively on MVP datasets.
Rounds vs Communication Tradeoffs for Maximal Independent Sets

We consider the problem of finding a maximal independent set (MIS) in the shared blackboard communication model with vertex-partitioned inputs. There are n players corresponding to vertices of an undirected graph, and each player sees the edges incident on its vertex – this way, each edge is known by both its endpoints and is thus shared by two players. The players communicate in simultaneous rounds by posting their messages on a shared blackboard visible to all players, with the goal of computing an MIS of the graph. While the MIS problem is well studied in other distributed models, and while shared blackboard is, perhaps, the simplest broadcast model, lower bounds for our problem were only known against one-round protocols. We present a lower bound on the round-communication tradeoff for computing an MIS in this model. Specifically, we show that when r rounds of interaction are allowed, at least one player needs to communicate $\Omega(n^{1/20^{r+1}})$ bits. In particular, with logarithmic bandwidth, finding an MIS requires $\Omega(\log\log n)$ rounds. This lower bound can be compared with the algorithm of Ghaffari, Gouleakis, Konrad, Mitrović, and Rubinfeld [PODC 2018] that solves MIS in $O(\log\log n)$ rounds but with a logarithmic bandwidth for an average player. Additionally, our lower bound further extends to the closely related problem of maximal bipartite matching. The presence of edge-sharing gives the algorithms in our model a surprising power and numerous algorithmic results exploiting this power are known. For a similar reason, proving lower bounds in this model is much more challenging, as this sharing in the players’ inputs prohibits the use of standard number-in-hand communication complexity arguments. Thus, to prove our results, we devise a new round elimination framework, which we call partial-input embedding, that may also be useful in future work for proving round-sensitive lower bounds in the presence of shared inputs. Finally, we discuss several implications of our results to multi-round (adaptive) distributed sketching algorithms, broadcast congested clique, and to the welfare maximization problem in two-sided matching markets.
Number of paths in a graph

The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of paths constitutes a relatively small subset of all possible walks. We introduce three types of walks, representing subsets of all possible walks. Considered types of walks allow for deriving an analytic solution for the number of paths of a certain length between node pairs in a matrix form. Depending on the path length, different approaches possess the lowest computational complexity. We also propose a recursive algorithm for determining all paths in a graph, which can be generalised to directed (un)weighted networks.
Representation Learning Strategies to Model Pathological Speech: Effect of Multiple Spectral Resolutions

This paper considers a representation learning strategy to model speech signals from patients with Parkinson's disease and cleft lip and palate. In particular, it compares different parametrized representation types such as wideband and narrowband spectrograms, and wavelet-based scalograms, with the goal of quantifying the representation capacity of each. Methods for quantification include the ability of the proposed model to classify different pathologies and the associated disease severity. Additionally, this paper proposes a novel fusion strategy called multi-spectral fusion that combines wideband and narrowband spectral resolutions using a representation learning strategy based on autoencoders. The proposed models are able to classify the speech from Parkinson's disease patients with accuracy up to 95\%. The proposed models were also able to asses the dysarthria severity of Parkinson's disease patients with a Spearman correlation up to 0.75. These results outperform those observed in literature where the same problem was addressed with the same corpus.
HLA predictions from long sequence read alignments, streamed directly into HLAminer

The rapidly changing landscape of sequencing technologies brings new opportunities to genomics research. Longer sequence reads and higher sequence throughput coupled with ever-improving base accuracy and decreasing per-base cost is now making long reads suitable for analyzing polymorphic regions of the human genome, such as those of the human leucocyte antigen (HLA) gene complex. Here I present a simple protocol for predicting HLA signatures from whole genome shotgun (WGS) long sequencing reads, by directly streaming sequence alignments into HLAminer. The method is as simple as running minimap2, it scales with the number of sequences to align, and can be used with any read aligner capable of sam format output without the need to store bulky alignment files to disk. I show how the predictions are robust even with older and less [base] accurate WGS nanopore datasets and relatively low (10X) sequence coverage and present a step-by-step protocol to predict HLA class I and II genes from the long sequencing reads of modern third-generation technologies.
A Sharp Rate of Convergence in the Functional Central Limit Theorem with Gaussian Input

When the underlying random variables are Gaussian, the classical Central Limit Theorem (CLT) is trivial, but the functional CLT is not. The objective of the paper is to investigate the functional CLT for stationary Gaussian processes in the Wasserstein-1 metric on the space of continuous functions. Matching upper and lower bounds are established, indicating that the convergence rate is slightly faster than in the L´evy-Prokhorov metric.
Broadband THz-TDS with 5.6 mW average power at 540 kHz with organic crystal BNA

We demonstrate a high dynamic range THz-TDS operating with high average power (5.6 mW) at 540 kHz repetition rate, with a broad bandwidth of 8 THz using the organic crystal BNA. The pump laser is an industrial Yb-laser system, temporally compressed to a pulse duration of sub-50 fs, and a high conversion efficiency of 0.1% is achieved.
Optimal Scaling for Locally Balanced Proposals in Discrete Spaces

Optimal scaling has been well studied for Metropolis-Hastings (M-H) algorithms in continuous spaces, but a similar understanding has been lacking in discrete spaces. Recently, a family of locally balanced proposals (LBP) for discrete spaces has been proved to be asymptotically optimal, but the question of optimal scaling has remained open. In this paper, we establish, for the first time, that the efficiency of M-H in discrete spaces can also be characterized by an asymptotic acceptance rate that is independent of the target distribution. Moreover, we verify, both theoretically and empirically, that the optimal acceptance rates for LBP and random walk Metropolis (RWM) are $0.574$ and $0.234$ respectively. These results also help establish that LBP is asymptotically $O(N^\frac{2}{3})$ more efficient than RWM with respect to model dimension $N$. Knowledge of the optimal acceptance rate allows one to automatically tune the neighborhood size of a proposal distribution in a discrete space, directly analogous to step-size control in continuous spaces. We demonstrate empirically that such adaptive M-H sampling can robustly improve sampling in a variety of target distributions in discrete spaces, including training deep energy based models.
ALEXSIS-PT: A New Resource for Portuguese Lexical Simplification

Lexical simplification (LS) is the task of automatically replacing complex words for easier ones making texts more accessible to various target populations (e.g. individuals with low literacy, individuals with learning disabilities, second language learners). To train and test models, LS systems usually require corpora that feature complex words in context along with their potential substitutions. To continue improving the performance of LS systems we introduce ALEXSIS-PT, a novel multi-candidate dataset for Brazilian Portuguese LS containing 9,605 candidate substitutions for 387 complex words. ALEXSIS-PT has been compiled following the ALEXSIS-ES protocol for Spanish opening exciting new avenues for cross-lingual models. ALEXSIS-PT is the first LS multi-candidate dataset that contains Brazilian newspaper articles. We evaluated three models for substitute generation on this dataset, namely mBERT, XLM-R, and BERTimbau. The latter achieved the highest performance across all evaluation metrics.
Automated Identification of Security-Relevant Configuration Settings Using NLP

To secure computer infrastructure, we need to configure all security-relevant settings. We need security experts to identify security-relevant settings, but this process is time-consuming and expensive. Our proposed solution uses state-of-the-art natural language processing to classify settings as security-relevant based on their description. Our evaluation shows that our trained classifiers do not perform well enough to replace the human security experts but can help them classify the settings. By publishing our labeled data sets and the code of our trained model, we want to help security experts analyze configuration settings and enable further research in this area.
Topology of Complements of Skeletons

Given a polytopal complex $X$, we examine the topological complement of its $k$-skeleton. We construct a long exact sequence relating the homologies of the skeleton complements and links of faces in $X$, and using this long exact sequence, we obtain characterisations of Cohen--Macaulay and Leray complexes, stacked balls, and neighbourly spheres in terms of their skeleton complements. We also apply these results to CAT(0) cubical complexes, and find new similarities between such a complex and an associated simplicial complex, the crossing complex.
Price Formation in Field Prediction Markets: The Wisdom in the Crowd

Prediction markets are a popular, prominent, and successful structure for a collective intelligence platform. However the exact mechanism by which information known to the participating traders is incorporated into the market price is unknown. Kyle (1985) detailed a model for price formation in continuous auctions with information distributed heterogeneously amongst market participants. This paper demonstrates a novel method derived from the Kyle model applied to data from a field experiment prediction market. The method is able to identify traders whose trades have price impact that adds a significant amount of information to the market price. Traders who are not identified as informed in aggregate have price impact consistent with noise trading. Results are reproduced on other prediction market datasets. Ultimately the results provide strong evidence in favor of the Kyle model in a field market setting, and highlight an under-discussed advantage of prediction markets over alternative group forecasting mechanisms: that the operator of the market does not need to have information on the distribution of information amongst participating traders.
Practical LR Parser Generation

Parsing is a fundamental building block in modern compilers, and for industrial programming languages, it is a surprisingly involved task. There are known approaches to generate parsers automatically, but the prevailing consensus is that automatic parser generation is not practical for real programming languages: LR/LALR parsers are considered to be far too restrictive in the grammars they support, and LR parsers are often considered too inefficient in practice. As a result, virtually all modern languages use recursive-descent parsers written by hand, a lengthy and error-prone process that dramatically increases the barrier to new programming language development. In this work we demonstrate that, contrary to the prevailing consensus, we can have the best of both worlds: for a very general, practical class of grammars -- a strict superset of Knuth's canonical LR -- we can generate parsers automatically, and the resulting parser code, as well as the generation procedure itself, is highly efficient. This advance relies on several new ideas, including novel automata optimization procedures; a new grammar transformation ("CPS"); per-symbol attributes; recursive-descent actions; and an extension of canonical LR parsing, which we refer to as XLR, which endows shift/reduce parsers with the power of bounded nondeterministic choice. With these ingredients, we can automatically generate efficient parsers for virtually all programming languages that are intuitively easy to parse -- a claim we support experimentally, by implementing the new algorithms in a new software tool called langcc, and running them on syntax specifications for Golang 1.17. 8 and Python 3.9. 12. The tool handles both languages automatically, and the generated code, when run on standard codebases, is 1.2x faster than the corresponding hand-written parser for Golang, and 4.3x faster than the CPython parser, respectively.
Nonlinear Mixing driven by Internal Gravity Waves

Hydrodynamic waves propagate through stellar interiors, transporting energy and angular momentum. They can also advect ﬂuid elements to produce mixing, but this eﬀect has not been quantiﬁed from ﬁrst principles. We derive the leading order non-linear wave mixing due to internal gravity waves in a thermally and compositionally-stratiﬁed ﬂuid. We ﬁnd that this scales as the fourth power of wave velocity, that it is suppressed by compositional stratiﬁcation, and that it depends on the thermal and compositional diﬀusivities.
Enhanced Fairness Testing via Generating Effective Initial Individual Discriminatory Instances

Fairness testing aims at mitigating unintended discrimination in the decision-making process of data-driven AI systems. Individual discrimination may occur when an AI model makes different decisions for two distinct individuals who are distinguishable solely according to protected attributes, such as age and race. Such instances reveal biased AI behaviour, and are called Individual Discriminatory Instances (IDIs). In this paper, we propose an approach for the selection of the initial seeds to generate IDIs for fairness testing. Previous studies mainly used random initial seeds to this end. However this phase is crucial, as these seeds are the basis of the follow-up IDIs generation. We dubbed our proposed seed selection approach I&D. It generates a large number of initial IDIs exhibiting a great diversity, aiming at improving the overall performance of fairness testing. Our empirical study reveal that I&D is able to produce a larger number of IDIs with respect to four state-of-the-art seed generation approaches, generating 1.68X more IDIs on average. Moreover, we compare the use of I&D to train machine learning models and find that using I&D reduces the number of remaining IDIs by 29% when compared to the state-of-the-art, thus indicating that I&D is effective for improving model fairness
An Argumentation-Based Legal Reasoning Approach for DL-Ontology

Ontology is a popular method for knowledge representation in different domains, including the legal domain, and description logics (DL) is com-monly used as its description language. To handle reasoning based on inconsistent DL-based legal ontologies, the current paper presents a structured argumentation framework particularly for reasoning in legal contexts on the basis of ASPIC + , and translates the legal ontology into formulas and rules of an argumentation theory. With a particular focus on the design of autonomous vehicles from the per-spective of legal AI, we show that using this combined theory of formal argumentation and DL-based legal ontology, acceptable assertions can be obtained based on inconsistent ontologies, and the traditional reasoning tasks of DL ontologies can also be accomplished. In addition, a formal deﬁnition of explanations for the result of reasoning is presented.
Learning Visual Robotic Control Efficiently with Contrastive Pre-training and Data Augmentation

Recent advances in unsupervised representation learning significantly improved the sample efficiency of training Reinforcement Learning policies in simulated environments. However, similar gains have not yet been seen for real-robot reinforcement learning. In this work, we focus on enabling data-efficient real-robot learning from pixels. We present Contrastive Pre-training and Data Augmentation for Efficient Robotic Learning (CoDER), a method that utilizes data augmentation and unsupervised learning to achieve sample-efficient training of real-robot arm policies from sparse rewards. While contrastive pre-training, data augmentation, demonstrations, and reinforcement learning are alone insufficient for efficient learning, our main contribution is showing that the combination of these disparate techniques results in a simple yet data-efficient method. We show that, given only 10 demonstrations, a single robotic arm can learn sparse-reward manipulation policies from pixels, such as reaching, picking, moving, pulling a large object, flipping a switch, and opening a drawer in just 30 minutes of mean real-world training time. We include videos and code on the project website: https://sites.google. com/view/efficient-robotic-manipulation/home.
Overview of the SV-Ident 2022 Shared Task on Survey Variable Identification in Social Science Publications

In this paper, we provide an overview of the SV-Ident shared task as part of the 3rd Workshop on Scholarly Document Processing (SDP) at COLING 2022. In the shared task, participants were provided with a sentence and a vocabulary of variables, and asked to identify which variables, if any, are mentioned in individual sentences from scholarly documents in full text. Two teams made a total of 9 submissions to the shared task leaderboard. While none of the teams improve on the baseline systems, we still draw insights from their submissions. Furthermore, we provide a detailed evaluation. Data and baselines for our shared task are freely available at https://github.com/vadis-project/sv-ident.