Surviving Academia

The process of healing from first episode psychosis as a queer person of color is not represented in the medical model, academia, or media. As a pansexual, non-binary, Latinx femme with a psychological disability, walking out of the hospital doors for the final time incited immense amounts of isolation that overcame my spirit because of the lack of dialogue around such healing. I assembled this zine with the intention of my intuition that somehow, somewhere, someone with my identities and positionality exists with similar trauma to mine from having experienced a mental health crisis. Zines are an accessible multimedia approach to sharing collective wisdom. The very definition of a zine varies as each publication can differ in size, art and writing media, price, and shape. Through this multimedia personal narrative of the different stages of healing, I continue to endure as a graduate student still affected by my trauma, I hope to center the power of personal narrative and lived experience as valid scholarship

Algorithms For Extracting Timeliness Graphs

We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes will be correct processes and all links will be timely. We first present a general extraction algorithm and then a more specific extraction algorithm that is communication efficient (i.e., eventually all the messages of the extraction algorithm use only links of the extracted graph)

On the Mailbox Problem

The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in their 2010 DC paper with an algorithm that uses two flag registers that carry 14 values each. An interesting problem that they ask is whether there is a mailbox algorithm with smaller flag values. We give a positive answer by describing a mailbox algorithm with 6 and 4 values in the two flag registers

Clock spectroscopy of interacting bosons in deep optical lattices

We report on high-resolution optical spectroscopy of interacting bosonic $^{174}$Yb atoms in deep optical lattices with negligible tunneling. We prepare Mott insulator phases with singly- and doubly-occupied isolated sites and probe the atoms using an ultra-narrow "clock" transition. Atoms in singly-occupied sites undergo long-lived Rabi oscillations. Atoms in doubly-occupied sites are strongly affected by interatomic interactions, and we measure their inelastic decay rates and energy shifts. We deduce from these measurements all relevant collisional parameters involving both clock states, in particular the intra- and inter-state scattering lengths

Non-linear Relaxation of Interacting Bosons Coherently Driven on a Narrow Optical Transition

We study the dynamics of a two-component Bose-Einstein condensate (BEC) of $^{174}$Yb atoms coherently driven on a narrow optical transition. The excitation transfers the BEC to a superposition of states with different internal and momentum quantum numbers. We observe a crossover with decreasing driving strength between a regime of damped oscillations, where coherent driving prevails, and an incoherent regime, where relaxation takes over. Several relaxation mechanisms are involved: inelastic losses involving two excited atoms, leading to a non-exponential decay of populations; Doppler broadening due to the finite momentum width of the BEC and inhomogeneous elastic interactions, both leading to dephasing and to damping of the oscillations. We compare our observations to a two-component Gross-Pitaevskii (GP) model that fully includes these effects. For small or moderate densities, the damping of the oscillations is mostly due to Doppler broadening. In this regime, we find excellent agreement between the model and the experimental results. For higher densities, the role of interactions increases and so does the damping rate of the oscillations. The damping in the GP model is less pronounced than in the experiment, possibly a hint for many-body effects not captured by the mean-field description.Comment: 7 pages, 4 figures; supplementary material available as ancillary fil

Faster ASV decomposition for orthogonal polyhedra using the Extreme Vertices Model (EVM)

The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a B-Rep into a CSG model. The obtained CSG tree has convex primitives at its leaf nodes, while the contents of its internal nodes alternate between the set union and difference operators. This work first shows that the obtained CSG tree T can also be expressed as the regularized Exclusive-OR operation among all the convex primitives at the leaf nodes of T, regardless the structure and internal nodes of T. This is an important result in the case in which EVM represented orthogonal polyhedra are used because in this model the Exclusive-OR operation runs much faster than set union and difference operations. Therefore this work applies this result to EVM represented orthogonal polyhedra. It also presents experimental results that corroborate the theoretical results and includes some practical uses for the ASV decomposition of orthogonal polyhedra.Postprint (published version

Fast connected component labeling algorithm: a non voxel-based approach

This paper presents a new approach to achieve connected component labeling on both binary images and volumes by using the Extreme Vertices Model (EVM), a representation model for orthogonal polyhedra, applied to digital images and volume datasets recently. In contrast with previous techniques, this method does not use a voxel-based approach but deals with the inner sections of the object.Postprint (published version

Nonlocality effects on spin-one pairing patterns in two-flavor color superconducting quark matter and compact stars applications

We study the influence of nonlocality in the interaction on two spin one pairing patterns of two-flavor quark matter: the anisotropic blue color paring besides the usual two color superconducting matter (2SCb), in which red and green colors are paired, and the color spin locking phase (CSL). The effect of nonlocality on the gaps is rather large and the pairings exhibit a strong dependence on the form factor of the interaction, especially in the low density region. The application of these small spin-one condensates for compact stars is analyzed: the early onset of quark matter in the nonlocal models may help to stabilize hybrid star configurations. While the anisotropic blue quark pairing does not survive a big asymmetry in flavor space as imposed by the charge neutrality condition, the CSL phase as a flavor independent pairing can be realized as neutral matter in compact star cores. However, smooth form factors and the missmatch between the flavor chemical potential in neutral matter make the effective gaps of the order of magnitude $\simeq 10$ keV, and a more systematic analysis is needed to decide whether such small gaps could be consistent with the cooling phenomenology.Comment: 18 pages, 7 figures, corrected version with revised parameterizatio