7,642 research outputs found

    Breaking boundaries:Charge density waves, quantum measurement, and black holes in theoretical physics

    Get PDF
    This thesis, titled “Breaking Boundaries” is a journey through three topics united by the theme of boundaries in physics. First, the journey begins with an investigation into charge density waves (CDWs) and their nearly commensurate phase, focusing on the materials 2H-TaSe2 and 1T-TaS2. An extensive treatment of Ginzburg-Landau theory is covered with an extension into truly two-dimensional systems. This extension is used to study spiral patches of commensurate charge density waves observed in experiment. The research leads to a novel perspective on CDW behaviour with the existence of a spiral CDW phase in a range of materials. Secondly, transitioning to the quantum realm, the thesis addresses the quantum measurement problem, emphasizing the constraints any valid theory must possess. It critiques existing models, demonstrates the non-linearity of objective collapse theories, and proposes a minimal model that bridges quantum mechanics and classical physics. Thirdly, the thesis delves into black holes and specifically the phenomena of thermal radiation due to a horizon. First, we explore analogue models that mimic the thermal spectrum near a black hole horizon, to pave the way to experimental realization. Then we focus on the region far away from a black hole horizon and challenge the notion of remnant radiation at this position. With a theoretical toy model, we study the regime and find a non-evaporating black hole. This questions the validity of standard Hawking radiation calculations.In conclusion, the thesis navigates through the boundaries of material behaviours, the quantum-classical divide, and the enigmatic nature of black holes. It highlights the blurring and breaking of boundaries in physics, offering new perspectives and promising avenues for future discoveries

    Classical and quantum algorithms for scaling problems

    Get PDF
    This thesis is concerned with scaling problems, which have a plethora of connections to different areas of mathematics, physics and computer science. Although many structural aspects of these problems are understood by now, we only know how to solve them efficiently in special cases.We give new algorithms for non-commutative scaling problems with complexity guarantees that match the prior state of the art. To this end, we extend the well-known (self-concordance based) interior-point method (IPM) framework to Riemannian manifolds, motivated by its success in the commutative setting. Moreover, the IPM framework does not obviously suffer from the same obstructions to efficiency as previous methods. It also yields the first high-precision algorithms for other natural geometric problems in non-positive curvature.For the (commutative) problems of matrix scaling and balancing, we show that quantum algorithms can outperform the (already very efficient) state-of-the-art classical algorithms. Their time complexity can be sublinear in the input size; in certain parameter regimes they are also optimal, whereas in others we show no quantum speedup over the classical methods is possible. Along the way, we provide improvements over the long-standing state of the art for searching for all marked elements in a list, and computing the sum of a list of numbers.We identify a new application in the context of tensor networks for quantum many-body physics. We define a computable canonical form for uniform projected entangled pair states (as the solution to a scaling problem), circumventing previously known undecidability results. We also show, by characterizing the invariant polynomials, that the canonical form is determined by evaluating the tensor network contractions on networks of bounded size

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    Posthuman Creative Styling can a creative writer’s style of writing be described as procedural?

    Get PDF
    This thesis is about creative styling — the styling a creative writer might use to make their writing unique. It addresses the question as to whether such styling can be described as procedural. Creative styling is part of the technique a creative writer uses when writing. It is how they make the text more ‘lively’ by use of tips and tricks they have either learned or discovered. In essence these are rules, ones the writer accrues over time by their practice. The thesis argues that the use and invention of these rules can be set as procedures. and so describe creative styling as procedural. The thesis follows from questioning why it is that machines or algorithms have, so far, been incapable of producing creative writing which has value. Machine-written novels do not abound on the bookshelves and writing styled by computers is, on the whole, dull in comparison to human-crafted literature. It came about by thinking how it would be possible to reach a point where writing by people and procedural writing are considered to have equal value. For this reason the thesis is set in a posthuman context, where the differences between machines and people are erased. The thesis uses practice to inform an original conceptual space model, based on quality dimensions and dynamic-inter operation of spaces. This model gives an example of the procedures which a posthuman creative writer uses when engaged in creative styling. It suggests an original formulation for the conceptual blending of conceptual spaces, based on the casting of qualities from one space to another. In support of and informing its arguments are ninety-nine examples of creative writing practice which show the procedures by which style has been applied, created and assessed. It provides a route forward for further joint research into both computational and human-coded creative writing

    Revisiting the capitalization of public transport accessibility into residential land value: an empirical analysis drawing on Open Science

    Get PDF
    Background: The delivery and effective operation of public transport is fundamental for a for a transition to low-carbon emission transport systems’. However, many cities face budgetary challenges in providing and operating this type of infrastructure. Land value capture (LVC) instruments, aimed at recovering all or part of the land value uplifts triggered by actions other than the landowner, can alleviate some of this pressure. A key element of LVC lies in the increment in land value associated with a particular public action. Urban economic theory supports this idea and considers accessibility to be a core element for determining residential land value. Although the empirical literature assessing the relationship between land value increments and public transport infrastructure is vast, it often assumes homogeneous benefits and, therefore, overlooks relevant elements of accessibility. Advancements in the accessibility concept in the context of Open Science can ease the relaxation of such assumptions. Methods: This thesis draws on the case of Greater Mexico City between 2009 and 2019. It focuses on the effects of the main public transport network (MPTN) which is organised in seven temporal stages according to its expansion phases. The analysis incorporates location based accessibility measures to employment opportunities in order to assess the benefits of public transport infrastructure. It does so by making extensive use of the open-source software OpenTripPlanner for public transport route modelling (≈ 2.1 billion origin-destination routes). Potential capitalizations are assessed according to the hedonic framework. The property value data includes individual administrative mortgage records collected by the Federal Mortgage Society (≈ 800,000). The hedonic function is estimated using a variety of approaches, i.e. linear models, nonlinear models, multilevel models, and spatial multilevel models. These are estimated by the maximum likelihood and Bayesian methods. The study also examines possible spatial aggregation bias using alternative spatial aggregation schemes according to the modifiable areal unit problem (MAUP) literature. Results: The accessibility models across the various temporal stages evidence the spatial heterogeneity shaped by the MPTN in combination with land use and the individual perception of residents. This highlights the need to transition from measures that focus on the characteristics of transport infrastructure to comprehensive accessibility measures which reflect such heterogeneity. The estimated hedonic function suggests a robust, positive, and significant relationship between MPTN accessibility and residential land value in all the modelling frameworks in the presence of a variety of controls. The residential land value increases between 3.6% and 5.7% for one additional standard deviation in MPTN accessibility to employment in the final set of models. The total willingness to pay (TWTP) is considerable, ranging from 0.7 to 1.5 times the equivalent of the capital costs of the bus rapid transit Line-7 of the MetrobĂșs system. A sensitivity analysis shows that the hedonic model estimation is sensitive to the MAUP. In addition, the use of a post code zoning scheme produces the closest results compared to the smallest spatial analytical scheme (0.5 km hexagonal grid). Conclusion: The present thesis advances the discussion on the capitalization of public transport on residential land value by adopting recent contributions from the Open Science framework. Empirically, it fills a knowledge gap given the lack of literature around this topic in this area of study. In terms of policy, the findings support LVC as a mechanism of considerable potential. Regarding fee-based LVC instruments, there are fairness issues in relation to the distribution of charges or exactions to households that could be addressed using location based measures. Furthermore, the approach developed for this analysis serves as valuable guidance for identifying sites with large potential for the implementation of development based instruments, for instance land readjustments or the sale/lease of additional development rights

    Assessment of microplastics and other contaminants in marine vertebrates from the Western Mediterranean Sea

    Get PDF
    Mediterranean marine biodiversity is under threat by pollution. For this reason, the main objective of this thesis was to analyse the presence of pollutants of concern in Mediterranean marine species. These studies are located in the Valencian Community (Spain), where we find loggerhead turtles, striped dolphins, and jewel lanternfish. Hence, we: 1. Analysed pesticides, heavy metals and phthalates in tissues of loggerhead turtles. 2. Studied microdebris present in beaches that are sporadically used as nesting grounds by loggerhead turtles. 3. Analysed striped dolphins# exposure to microplastics. 4. Quantified jewel lanternfish exposure to microplastics and tested their role as bioindicators of microplastic pollution in the bathypelagic environment. Results indicate the ubiquity of all the analysed pollutants. Pesticide analyses showed that all the analysed loggerheads (N=25) were exposed to 39 pesticides, of which 38.5% are forbidden in the EU. Results indicated low heavy metal burden. Mean concentrations of Cd, Pb and Hg were 0.04 μg/g., 0.09 μg/g. and 0.03 μg/g w.w. in fat and 0.05 μg/g, 0.08 μg/g and 0.04 μg/g w.w. in muscle. The juvenile size could account for these low concentrations. Seven phthalate metabolites in turtles were detected in more than 85% of the samples (DR>85%). The sum of the median concentration of the phthalate metabolites that had DR>85%, showed a negative correlation with size and also a significant increase in concentration from 2020 onwards; possibly explained by an increase in single-use plastic, or by uncontrolled wastewater discharges. Microdebris in beaches was ubiquitous although concentrations were not of concern for the success of loggerhead turtle clutches. In July, total mean±SD was 5.66 ± 3.66 MPs/kg at surface and 12.15 ± 7.76 MPs/kg at depth; while in November values were 6.45 ± 4.42 MPs/kg at surface and 5.51 ± 3.14 MPs/kg at depth. There were no significant differences among beaches, months, depths nor protection regime. Polymers found were commonly used in consumer goods and tires.MPs were present in 90.5% of the striped dolphins (N=43), although amount per dolphin was low and variable (median = 5, range = 0 - 82). Polyacrylamide, PET and HDPE were the most common polymers. MPs concentration from different periods of time (1989 # 2007/2010#2017) or locations were not different. Finally, the jewel lanternfish, (N=97), showed high frequency of occurrence of MPs, although a low body burden. Size and body condition were not correlated with the number of MPs. To sum up, an overview of the pollutants in the westernmost part of the Mediterranean Sea is provided, focusing on the aforementioned species and highlighting their potential as bioindicators

    A Survey on Enterprise Network Security: Asset Behavioral Monitoring and Distributed Attack Detection

    Full text link
    Enterprise networks that host valuable assets and services are popular and frequent targets of distributed network attacks. In order to cope with the ever-increasing threats, industrial and research communities develop systems and methods to monitor the behaviors of their assets and protect them from critical attacks. In this paper, we systematically survey related research articles and industrial systems to highlight the current status of this arms race in enterprise network security. First, we discuss the taxonomy of distributed network attacks on enterprise assets, including distributed denial-of-service (DDoS) and reconnaissance attacks. Second, we review existing methods in monitoring and classifying network behavior of enterprise hosts to verify their benign activities and isolate potential anomalies. Third, state-of-the-art detection methods for distributed network attacks sourced from external attackers are elaborated, highlighting their merits and bottlenecks. Fourth, as programmable networks and machine learning (ML) techniques are increasingly becoming adopted by the community, their current applications in network security are discussed. Finally, we highlight several research gaps on enterprise network security to inspire future research.Comment: Journal paper submitted to Elseive

    Exploration autonome et efficiente de chantiers miniers souterrains inconnus avec un drone filaire

    Get PDF
    Abstract: Underground mining stopes are often mapped using a sensor located at the end of a pole that the operator introduces into the stope from a secure area. The sensor emits laser beams that provide the distance to a detected wall, thus creating a 3D map. This produces shadow zones and a low point density on the distant walls. To address these challenges, a research team from the UniversitĂ© de Sherbrooke is designing a tethered drone equipped with a rotating LiDAR for this mission, thus benefiting from several points of view. The wired transmission allows for unlimited flight time, shared computing, and real-time communication. For compatibility with the movement of the drone after tether entanglements, the excess length is integrated into an onboard spool, contributing to the drone payload. During manual piloting, the human factor causes problems in the perception and comprehension of a virtual 3D environment, as well as the execution of an optimal mission. This thesis focuses on autonomous navigation in two aspects: path planning and exploration. The system must compute a trajectory that maps the entire environment, minimizing the mission time and respecting the maximum onboard tether length. Path planning using a Rapidly-exploring Random Tree (RRT) quickly finds a feasible path, but the optimization is computationally expensive and the performance is variable and unpredictable. Exploration by the frontier method is representative of the space to be explored and the path can be optimized by solving a Traveling Salesman Problem (TSP) but existing techniques for a tethered drone only consider the 2D case and do not optimize the global path. To meet these challenges, this thesis presents two new algorithms. The first one, RRT-Rope, produces an equal or shorter path than existing algorithms in a significantly shorter computation time, up to 70% faster than the next best algorithm in a representative environment. A modified version of RRT-connect computes a feasible path, shortened with a deterministic technique that takes advantage of previously added intermediate nodes. The second algorithm, TAPE, is the first 3D cavity exploration method that focuses on minimizing mission time and unwound tether length. On average, the overall path is 4% longer than the method that solves the TSP, but the tether remains under the allowed length in 100% of the simulated cases, compared to 53% with the initial method. The approach uses a 2-level hierarchical architecture: global planning solves a TSP after frontier extraction, and local planning minimizes the path cost and tether length via a decision function. The integration of these two tools in the NetherDrone produces an intelligent system for autonomous exploration, with semi-autonomous features for operator interaction. This work opens the door to new navigation approaches in the field of inspection, mapping, and Search and Rescue missions.La cartographie des chantiers miniers souterrains est souvent rĂ©alisĂ©e Ă  l’aide d’un capteur situĂ© au bout d’une perche que l’opĂ©rateur introduit dans le chantier, depuis une zone sĂ©curisĂ©e. Le capteur Ă©met des faisceaux laser qui fournissent la distance Ă  un mur dĂ©tectĂ©, crĂ©ant ainsi une carte en 3D. Ceci produit des zones d’ombres et une faible densitĂ© de points sur les parois Ă©loignĂ©es. Pour relever ces dĂ©fis, une Ă©quipe de recherche de l’UniversitĂ© de Sherbrooke conçoit un drone filaire Ă©quipĂ© d’un LiDAR rotatif pour cette mission, bĂ©nĂ©ficiant ainsi de plusieurs points de vue. La transmission filaire permet un temps de vol illimitĂ©, un partage de calcul et une communication en temps rĂ©el. Pour une compatibilitĂ© avec le mouvement du drone lors des coincements du fil, la longueur excĂ©dante est intĂ©grĂ©e dans une bobine embarquĂ©e, qui contribue Ă  la charge utile du drone. Lors d’un pilotage manuel, le facteur humain entraĂźne des problĂšmes de perception et comprĂ©hension d’un environnement 3D virtuel, et d’exĂ©cution d’une mission optimale. Cette thĂšse se concentre sur la navigation autonome sous deux aspects : la planification de trajectoire et l’exploration. Le systĂšme doit calculer une trajectoire qui cartographie l’environnement complet, en minimisant le temps de mission et en respectant la longueur maximale de fil embarquĂ©e. La planification de trajectoire Ă  l’aide d’un Rapidly-exploring Random Tree (RRT) trouve rapidement un chemin rĂ©alisable, mais l’optimisation est coĂ»teuse en calcul et la performance est variable et imprĂ©visible. L’exploration par la mĂ©thode des frontiĂšres est reprĂ©sentative de l’espace Ă  explorer et le chemin peut ĂȘtre optimisĂ© en rĂ©solvant un Traveling Salesman Problem (TSP), mais les techniques existantes pour un drone filaire ne considĂšrent que le cas 2D et n’optimisent pas le chemin global. Pour relever ces dĂ©fis, cette thĂšse prĂ©sente deux nouveaux algorithmes. Le premier, RRT-Rope, produit un chemin Ă©gal ou plus court que les algorithmes existants en un temps de calcul jusqu’à 70% plus court que le deuxiĂšme meilleur algorithme dans un environnement reprĂ©sentatif. Une version modifiĂ©e de RRT-connect calcule un chemin rĂ©alisable, raccourci avec une technique dĂ©terministe qui tire profit des noeuds intermĂ©diaires prĂ©alablement ajoutĂ©s. Le deuxiĂšme algorithme, TAPE, est la premiĂšre mĂ©thode d’exploration de cavitĂ©s en 3D qui minimise le temps de mission et la longueur du fil dĂ©roulĂ©. En moyenne, le trajet global est 4% plus long que la mĂ©thode qui rĂ©sout le TSP, mais le fil reste sous la longueur autorisĂ©e dans 100% des cas simulĂ©s, contre 53% avec la mĂ©thode initiale. L’approche utilise une architecture hiĂ©rarchique Ă  2 niveaux : la planification globale rĂ©sout un TSP aprĂšs extraction des frontiĂšres, et la planification locale minimise le coĂ»t du chemin et la longueur de fil via une fonction de dĂ©cision. L’intĂ©gration de ces deux outils dans le NetherDrone produit un systĂšme intelligent pour l’exploration autonome, dotĂ© de fonctionnalitĂ©s semi-autonomes pour une interaction avec l’opĂ©rateur. Les travaux rĂ©alisĂ©s ouvrent la porte Ă  de nouvelles approches de navigation dans le domaine des missions d’inspection, de cartographie et de recherche et sauvetage

    Automated Distinct Bone Segmentation from Computed Tomography Images using Deep Learning

    Get PDF
    Large-scale CT scans are frequently performed for forensic and diagnostic purposes, to plan and direct surgical procedures, and to track the development of bone-related diseases. This often involves radiologists who have to annotate bones manually or in a semi-automatic way, which is a time consuming task. Their annotation workload can be reduced by automated segmentation and detection of individual bones. This automation of distinct bone segmentation not only has the potential to accelerate current workflows but also opens up new possibilities for processing and presenting medical data for planning, navigation, and education. In this thesis, we explored the use of deep learning for automating the segmentation of all individual bones within an upper-body CT scan. To do so, we had to find a network architec- ture that provides a good trade-off between the problem’s high computational demands and the results’ accuracy. After finding a baseline method and having enlarged the dataset, we set out to eliminate the most prevalent types of error. To do so, we introduced an novel method called binary-prediction-enhanced multi-class (BEM) inference, separating the task into two: Distin- guishing bone from non-bone is conducted separately from identifying the individual bones. Both predictions are then merged, which leads to superior results. Another type of error is tack- led by our developed architecture, the Sneaky-Net, which receives additional inputs with larger fields of view but at a smaller resolution. We can thus sneak more extensive areas of the input into the network while keeping the growth of additional pixels in check. Overall, we present a deep-learning-based method that reliably segments most of the over one hundred distinct bones present in upper-body CT scans in an end-to-end trained matter quickly enough to be used in interactive software. Our algorithm has been included in our groups virtual reality medical image visualisation software SpectoVR with the plan to be used as one of the puzzle piece in surgical planning and navigation, as well as in the education of future doctors

    Fundamental and Applied Problems of the String Theory Landscape

    Get PDF
    In this thesis we study quantum corrections to string-derived effective actions \textit{per se} as well as their implications for phenomenologically relevant setups like the \textit{Large Volume Scenario} (LVS) and the \textit{anti-D3-brane} uplift. In the first part of this thesis, we improve the understanding of string loop corrections on general Calabi-Yau orientifolds from an effective field theory perspective by proposing a new classification scheme for quantum corrections. Thereby, we discover new features of string loop corrections, like for instance possible logarithmic effects in the Kahler and scalar potential, which are relevant for phenomenological applications like models of inflation. In the next part of the thesis, we derive a simple and explicit formula, the \textit{LVS parametric tadpole constraint} (PTC), that ensures that the anti-D3-brane uplifted LVS dS vacuum is protected against the most dangerous higher order corrections. The main difficulty appears to be the small uplifting contribution which is necessary due to the exponentially large volume obtained via the LVS. This in turn requires a large negative contribution to the tadpole which is quantified in the PTC. As the negative contribution to the tadpole is limited in weakly coupled string theories, the PTC represents a concrete challenge for the LVS. The last part of the thesis investigates the impact of αâ€Č\alpha' corrections to the brane-flux annihilation process discovered by Kachru, Pearson, and Verlinde (KPV) on which the anti-D3-brane uplift is based. We find that αâ€Č\alpha' corrections drastically alter the KPV analysis with the result that much more flux in the Klebanov-Strassler throat is required than previously assumed in order to control the leading αâ€Č\alpha' corrections on the NS5-brane. The implication for the LVS with standard anti-D3-brane uplift can again be quantified by the PTC. Incorporating this new bound significantly increases the required negative contribution to the tadpole. In addition, we uncover a new uplifting mechanism not relying on large fluxes and hence deep warped throats, thereby sidestepping the main difficulties related to the PTC
    • 

    corecore