Some results on orbifold quotients and related objects

The quotient of a finite-dimensional Euclidean space by a finite linear group inherits different structures from the initial space, e.g. a topology, a metric and a piecewise linear structure. The question when such a quotient is a manifold leads to the study of finite groups generated by reflections and rotations, i.e. by orthogonal transformations whose fixed point subspace has codimension one or two. We classify such groups and thereby complete earlier results by M. A. Mikhaîlova from the 70s and 80s. Moreover, we show that a finite group is generated by reflections and) rotations if and only if the corresponding quotient is a Lipschitz-, or equivalently, a piecewise linear manifold (with boundary). For the proof of this statement we show in addition that each piecewise linear manifold of dimension up to four on which a finite group acts by piecewise linear homeomorphisms admits a compatible smooth structure with respect to which the group acts smoothly. This solves a challenge by Thurston and confirms a conjecture by Kwasik and Lee. In the topological category a counterexample to the above mentioned characterization is given by the binary icosahedral group. We show that this is the only counterexample up to products. In particular, we answer the question by Davis of when the underlying space of an orbifold is a topological manifold. As a corollary of our results we generalize a fixed point theorem by Steinberg on unitary reflection groups to finite groups generated by reflections and rotations. As an application thereof we answer a question by Petrunin on quotients of spheres.

Sasakian quiver gauge theories and instantons on cones over lens 5-spaces

We consider SU(3)-equivariant dimensional reduction of Yang Mills theory over certain cyclic orbifolds of the 5-sphere which are Sasaki-Einstein manifolds. We obtain new quiver gauge theories extending those induced via reduction over the leaf spaces of the characteristic foliation of the Sasaki-Einstein structure, which are projective planes. We describe the Higgs branches of these quiver gauge theories as moduli spaces of spherically symmetric instantons which are SU(3)-equivariant solutions to the Hermitian Yang-Mills equations on the associated Calabi-Yau cones, and further compare them to moduli spaces of translationally-invariant instantons on the cones. We provide an explicit unified construction of these moduli spaces as Kahler quotients and show that they have the same cyclic orbifold singularities as the cones over the lens 5-spaces. (C) 2015 The Authors. Published by Elsevier B.V.

EXPOSURE TO EXTREME HEAT EVENTS AND CHRONIC RESPIRATORY DISEASES AMONG A NATIONALLY REPRESENTATIVE SAMPLE OF THE UNITED STATES POPULATION

Previous studies have shown that extreme weather events are on the rise in response to our changing climate. Such events are projected to become more frequent, more intense, and longer lasting. A consistent exposure metric for measuring these extreme events as well as information regarding how these events lead to ill health are needed to inform meaningful adaptation strategies that are specific to the needs of local communities. Using federal meteorological data corresponding to 17 years (1997-2013) of the National Health Interview Survey, this research: 1) developed a location-specific exposure metric that captures individuals’ “exposure” at a spatial scale that is consistent with publicly available county-level health outcome data; 2) characterized the United States’ population in counties that have experienced higher numbers of extreme heat events and thus identified population groups likely to experience future events; and 3) developed an empirical model describing the association between exposure to extreme heat events and hay fever. This research confirmed that the natural modes of forcing (e.g., El Niño-Southern Oscillation), seasonality, urban-rural classification, and division of country have an impact on the number extreme heat events recorded. Also, many of the areas affected by extreme heat events are shown to have a variety of vulnerable populations including women of childbearing age, people who are poor, and older adults. Lastly, this research showed that adults in the highest quartile of exposure to extreme heat events had a 7% increased odds of hay fever compared to those in the lowest quartile, suggesting that exposure to extreme heat events increases risk of hay fever among US adults.

No right to sext? A critical examination of media and legal debates about teenage girls' sexual agency in the digital age

Advances in digital photography and distribution technologies enable many people to produce and distribute images of their sex acts. When teenagers do this, the photos and videos they create can be legally classified as child pornography since the law makes no exception for youth who create sexually explicit images of themselves. The dominant discussions about teenage girls producing sexually explicit media (including sexting) are profoundly unproductive: (1) they blame teenage girls for creating private images that another person later maliciously distributed and (2) they fail to respect—or even discuss—teenagers’ rights to freedom of expression. Cell phones and the internet make producing and distributing images extremely easy, which provide widely accessible venues for both consensual sexual expression between partners and for sexual harassment. Dominant understandings view sexting as a troubling teenage trend created through the combination of camera phones and adolescent hormones and impulsivity, but this view often conflates consensual sexting between partners with the malicious distribution of a person’s private image as essentially equivalent behaviors. In this project, I ask: What is the role of assumptions about teen girls’ sexual agency in these problematic understandings of sexting that blame victims and deny teenagers’ rights? In contrast to the popular media panic about online predators and the familiar accusation that youth are wasting their leisure time by using digital media, some people champion the internet as a democratic space that offers young people the opportunity to explore identities and develop social and communication skills. Yet, when teen girls’ sexuality enters this conversation, all this debate and discussion narrows to a problematic consensus. The optimists about adolescents and technology fall silent, and the argument that media production is inherently empowering for girls does not seem to apply to a girl who produces a sexually explicit image of herself. Instead, feminist, popular, and legal commentaries assert that she is necessarily a victim: of a “sexualized” mass media, pressure from her male peers, digital technology, her brain structures or hormones, or her own low self-esteem and misplaced desire for attention. Why and how are teenage girls’ sexual choices produced as evidence of their failure or success in achieving Western liberal ideals of self-esteem, resistance, and agency? Since mass media and policy reactions to sexting have so far been overwhelmingly sexist and counter-productive, it is crucial to interrogate the concepts and assumptions that characterize mainstream understandings of sexting. I argue that the common sense that is co-produced by law and mass media underlies the problematic legal and policy responses to sexting. Analyzing a range of nonfiction texts including newspaper articles, talk shows, press releases, public service announcements, websites, legislative debates, and legal documents, I investigate gendered, racialized, age-based, and technologically determinist common sense assumptions about teenage girls’ sexual agency. I examine the consensus and continuities that exist between news, nonfiction mass media, policy, institutions, and law, and describe the limits of their debates. I find that this early 21st century post-feminist girl-power moment not only demands that girls live up to gendered sexual ideals but also insists that actively choosing to follow these norms is the only way to exercise sexual agency. This is the first study to date examining the relationship of conventional wisdom about digital media and teenage girls’ sexuality to both policy and mass media.

The Real-Quaternionic Indicator of Irreducible Self-Conjugate Representations of Real Reductive Algebraic Groups and A Comment on the Local Langlands Correspondence of GL(2, F )

The real-quaternionic indicator, also called the $\delta$ indicator, indicates if a self-conjugate representation is of real or quaternionic type. It is closely related to the Frobenius-Schur indicator, which we call the $\varepsilon$ indicator. The Frobenius-Schur indicator $\varepsilon(\pi)$ is known to be given by a particular value of the central character. We would like a similar result for the $\delta$ indicator. When $G$ is compact, $\delta(\pi)$ and $\varepsilon(\pi)$ coincide. In general, they are not necessarily the same. In this thesis, we will give a relation between the two indicators when $G$ is a real reductive algebraic group. This relation also leads to a formula for $\delta(\pi)$ in terms of the central character. For the second part, we consider the construction of the local Langlands correspondence of $GL(2,F)$ when $F$ is a non-Archimedean local field with odd residual characteristics. By re-examining the construction, we provide new proofs to some important properties of the correspondence. Namely, the construction is independent of the choice of additive character in the theta correspondence.

Rank metric convolutional codes

In this contribution, we propose a first general definition of rank-metric convolutional codes for multi-shot network coding. To this aim, we introduce a suitable concept of distance and we establish a generalized Singleton bound for this class of codes.

Linear non-local diffusion problems in metric measure spaces

The aim of this paper is to provide a comprehensive study of some linear non-local diffusion problems in metric measure spaces. These include, for example, open subsets in ℝN, graphs, manifolds, multi-structures and some fractal sets. For this, we study regularity, compactness, positivity and the spectrum of the stationary non-local operator. We then study the solutions of linear evolution non-local diffusion problems, with emphasis on similarities and differences with the standard heat equation in smooth domains. In particular, we prove weak and strong maximum principles and describe the asymptotic behaviour using spectral methods.

Efficient Image and Video Representations for Retrieval

Image (Video) retrieval is an interesting problem of retrieving images (videos) similar to the query. Images (Videos) are represented in an input (feature) space and similar images (videos) are obtained by finding nearest neighbors in the input representation space. Numerous input representations both in real valued and binary space have been proposed for conducting faster retrieval. In this thesis, we present techniques that obtain improved input representations for retrieval in both supervised and unsupervised settings for images and videos. Supervised retrieval is a well known problem of retrieving same class images of the query. We address the practical aspects of achieving faster retrieval with binary codes as input representations for the supervised setting in the first part, where binary codes are used as addresses into hash tables. In practice, using binary codes as addresses does not guarantee fast retrieval, as similar images are not mapped to the same binary code (address). We address this problem by presenting an efficient supervised hashing (binary encoding) method that aims to explicitly map all the images of the same class ideally to a unique binary code. We refer to the binary codes of the images as `Semantic Binary Codes' and the unique code for all same class images as `Class Binary Code'. We also propose a new class­ based Hamming metric that dramatically reduces the retrieval times for larger databases, where only hamming distance is computed to the class binary codes. We also propose a Deep semantic binary code model, by replacing the output layer of a popular convolutional Neural Network (AlexNet) with the class binary codes and show that the hashing functions learned in this way outperforms the state­ of ­the art, and at the same time provide fast retrieval times. In the second part, we also address the problem of supervised retrieval by taking into account the relationship between classes. For a given query image, we want to retrieve images that preserve the relative order i.e. we want to retrieve all same class images first and then, the related classes images before different class images. We learn such relationship aware binary codes by minimizing the similarity between inner product of the binary codes and the similarity between the classes. We calculate the similarity between classes using output embedding vectors, which are vector representations of classes. Our method deviates from the other supervised binary encoding schemes as it is the first to use output embeddings for learning hashing functions. We also introduce new performance metrics that take into account the related class retrieval results and show significant gains over the state­ of­ the art. High Dimensional descriptors like Fisher Vectors or Vector of Locally Aggregated Descriptors have shown to improve the performance of many computer vision applications including retrieval. In the third part, we will discuss an unsupervised technique for compressing high dimensional vectors into high dimensional binary codes, to reduce storage complexity. In this approach, we deviate from adopting traditional hyperplane hashing functions and instead learn hyperspherical hashing functions. The proposed method overcomes the computational challenges of directly applying the spherical hashing algorithm that is intractable for compressing high dimensional vectors. A practical hierarchical model that utilizes divide and conquer techniques using the Random Select and Adjust (RSA) procedure to compress such high dimensional vectors is presented. We show that our proposed high dimensional binary codes outperform the binary codes obtained using traditional hyperplane methods for higher compression ratios. In the last part of the thesis, we propose a retrieval based solution to the Zero shot event classification problem - a setting where no training videos are available for the event. To do this, we learn a generic set of concept detectors and represent both videos and query events in the concept space. We then compute similarity between the query event and the video in the concept space and videos similar to the query event are classified as the videos belonging to the event. We show that we significantly boost the performance using concept features from other modalities.

Multicenter prospective validation of the Baveno IV and Baveno II/III criteria in cirrhosis patients with variceal bleeding

International audience

Motion Planning and Controls with Safety and Temporal Constraints

Motion planning, or trajectory planning, commonly refers to a process of converting high-level task specifications into low-level control commands that can be executed on the system of interest. For different applications, the system will be different. It can be an autonomous vehicle, an Unmanned Aerial Vehicle(UAV), a humanoid robot, or an industrial robotic arm. As human machine interaction is essential in many of these systems, safety is fundamental and crucial. Many of the applications also involve performing a task in an optimal manner within a given time constraint. Therefore, in this thesis, we focus on two aspects of the motion planning problem. One is the verification and synthesis of the safe controls for autonomous ground and air vehicles in collision avoidance scenarios. The other part focuses on the high-level planning for the autonomous vehicles with the timed temporal constraints. In the first aspect of our work, we first propose a verification method to prove the safety and robustness of a path planner and the path following controls based on reachable sets. We demonstrate the method on quadrotor and automobile applications. Secondly, we propose a reachable set based collision avoidance algorithm for UAVs. Instead of the traditional approaches of collision avoidance between trajectories, we propose a collision avoidance scheme based on reachable sets and tubes. We then formulate the problem as a convex optimization problem seeking control set design for the aircraft to avoid collision. We apply our approach to collision avoidance scenarios of quadrotors and fixed-wing aircraft. In the second aspect of our work, we address the high level planning problems with timed temporal logic constraints. Firstly, we present an optimization based method for path planning of a mobile robot subject to timed temporal constraints, in a dynamic environment. Temporal logic (TL) can address very complex task specifications such as safety, coverage, motion sequencing etc. We use metric temporal logic (MTL) to encode the task specifications with timing constraints. We then translate the MTL formulae into mixed integer linear constraints and solve the associated optimization problem using a mixed integer linear program solver. We have applied our approach on several case studies in complex dynamical environments subjected to timed temporal specifications. Secondly, we also present a timed automaton based method for planning under the given timed temporal logic specifications. We use metric interval temporal logic (MITL), a member of the MTL family, to represent the task specification, and provide a constructive way to generate a timed automaton and methods to look for accepting runs on the automaton to find an optimal motion (or path) sequence for the robot to complete the task.