Towards a gravitational wave observatory designer: sensitivity limits of spaceborne detectors

The most promising concept for low frequency (millihertz to hertz) gravitational wave observatories are laser interferometric detectors in space. It is usually assumed that the noise floor for such a detector is dominated by optical shot noise in the signal readout. For this to be true, a careful balance of mission parameters is crucial to keep all other parasitic disturbances below shot noise. We developed a web application that uses over 30 input parameters and considers many important technical noise sources and noise suppression techniques to derive a realistic position noise budget. It optimizes free parameters automatically and generates a detailed report on all individual noise contributions. Thus one can easily explore the entire parameter space and design a realistic gravitational wave observatory. In this document we describe the different parameters, present all underlying calculations, and compare the final observatory's sensitivity with astrophysical sources of gravitational waves. We use as an example parameters currently assumed to be likely applied to a space mission proposed to be launched in 2034 by the European Space Agency. The web application itself is publicly available on the Internet at http://spacegravity.org/designer. Future versions of the web application will incorporate the frequency dependence of different noise sources and include a more detailed model of the observatory's residual acceleration noise.

Top-K Query Processing in Edge-Labeled Graph Data

Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are represented by edges and each edge is labeled with a semantic annotation. Hence, a huge single graph can express many different relationships between entities. The Semantic Web represents each single fragment of knowledge as a triple (subject, predicate, object), which is conceptually identical to an edge from subject to object labeled with predicates. A set of triples constitutes an edge-labeled graph on which knowledge inference is performed. Subgraph matching has been extensively used as a query language for patterns in the context of edge-labeled graphs. For example, in social networks, users can specify a subgraph matching query to find all people that have certain neighborhood relationships. Heavily used fragments of the SPARQL query language for the Semantic Web and graph queries of other graph DBMS can also be viewed as subgraph matching over large graphs. Though subgraph matching has been extensively studied as a query paradigm in the Semantic Web and in social networks, a user can get a large number of answers in response to a query. These answers can be shown to the user in accordance with an importance ranking. In this thesis proposal, we present four different scoring models along with scalable algorithms to find the top-k answers via a suite of intelligent pruning techniques. The suggested models consist of a practically important subset of the SPARQL query language augmented with some additional useful features. The first model called Substitution Importance Query (SIQ) identifies the top-k answers whose scores are calculated from matched vertices' properties in each answer in accordance with a user-specified notion of importance. The second model called Vertex Importance Query (VIQ) identifies important vertices in accordance with a user-defined scoring method that builds on top of various subgraphs articulated by the user. Approximate Importance Query (AIQ), our third model, allows partial and inexact matchings and returns top-k of them with a user-specified approximation terms and scoring functions. In the fourth model called Probabilistic Importance Query (PIQ), a query consists of several sub-blocks: one mandatory block that must be mapped and other blocks that can be opportunistically mapped. The probability is calculated from various aspects of answers such as the number of mapped blocks, vertices' properties in each block and so on and the most top-k probable answers are returned. An important distinguishing feature of our work is that we allow the user a huge amount of freedom in specifying: (i) what pattern and approximation he considers important, (ii) how to score answers - irrespective of whether they are vertices or substitution, and (iii) how to combine and aggregate scores generated by multiple patterns and/or multiple substitutions. Because so much power is given to the user, indexing is more challenging than in situations where additional restrictions are imposed on the queries the user can ask. The proposed algorithms for the first model can also be used for answering SPARQL queries with ORDER BY and LIMIT, and the method for the second model also works for SPARQL queries with GROUP BY, ORDER BY and LIMIT. We test our algorithms on multiple real-world graph databases, showing that our algorithms are far more efficient than popular triple stores.

Hierarchically grouped 2D local features applied to edge contour localisation

One of the most significant research topics in computer vision is object detection. Most of the reported object detection results localise the detected object within a bounding box, but do not explicitly label the edge contours of the object. Since object contours provide a fundamental diagnostic of object shape, some researchers have initiated work on linear contour feature representations for object detection and localisation. However, linear contour feature-based localisation is highly dependent on the performance of linear contour detection within natural images, and this can be perturbed significantly by a cluttered background. In addition, the conventional approach to achieving rotation-invariant features is to rotate the feature receptive field to align with the local dominant orientation before computing the feature representation. Grid resampling after rotation adds extra computational cost and increases the total time consumption for computing the feature descriptor. Though it is not an expensive process if using current computers, it is appreciated that if each step of the implementation is faster to compute especially when the number of local features is increasing and the application is implemented on resource limited ”smart devices”, such as mobile phones, in real-time. Motivated by the above issues, a 2D object localisation system is proposed in this thesis that matches features of edge contour points, which is an alternative method that takes advantage of the shape information for object localisation. This is inspired by edge contour points comprising the basic components of shape contours. In addition, edge point detection is usually simpler to achieve than linear edge contour detection. Therefore, the proposed localization system could avoid the need for linear contour detection and reduce the pathological disruption from the image background. Moreover, since natural images usually comprise many more edge contour points than interest points (i.e. corner points), we also propose new methods to generate rotation-invariant local feature descriptors without pre-rotating the feature receptive field to improve the computational efficiency of the whole system. In detail, the 2D object localisation system is achieved by matching edge contour points features in a constrained search area based on the initial pose-estimate produced by a prior object detection process. The local feature descriptor obtains rotation invariance by making use of rotational symmetry of the hexagonal structure. Therefore, a set of local feature descriptors is proposed based on the hierarchically hexagonal grouping structure. Ultimately, the 2D object localisation system achieves a very promising performance based on matching the proposed features of edge contour points with the mean correct labelling rate of the edge contour points 0.8654 and the mean false labelling rate 0.0314 applied on the data from Amsterdam Library of Object Images (ALOI). Furthermore, the proposed descriptors are evaluated by comparing to the state-of-the-art descriptors and achieve competitive performances in terms of pose estimate with around half-pixel pose error.

Sea-level control on the connection between shelf-edge deltas and the Bourcart canyon head (western Mediterranean) during the last glacial/interglacial cycle

A dense grid of high- and very high resolution seismic data, together with piston cores and borehole data providing time constraints, enables us to reconstruct the history of the Bourcart canyon head in the western Mediterranean Sea during the last glacial/interglacial cycle. The canyon fill is composed of confined channel–levee systems fed by a series of successively active shelf fluvial systems, originating from the west and north. Most of the preserved infill corresponds to the interval between Marine Isotope Stage (MIS) 3 and the early deglacial (19 cal ka BP). Its deposition was strongly controlled by a relative sea level that impacted the direct fluvial/canyon connection. During a period of around 100 kyr between MIS 6 and MIS 2, the canyon “prograded” by about 3 km. More precisely, several parasequences can be identified within the canyon fill. They correspond to forced-regressed parasequences (linked to punctuated sea-level falls) topped by a progradational-aggradational parasequence (linked to a hypothetical 19-ka meltwater pulse (MWP)). The bounding surfaces between forced-regressed parasequences are condensed intervals formed during intervals of relative sediment starvation due to flooding episodes. The meandering pattern of the axial incision visible within the canyon head, which can be traced landward up to the Agly paleo-river, is interpreted as the result of hyperpycnal flows initiated in the river mouth in a context of increased rainfall and mountain glacier flushing during the early deglacial.

Aerodynamic behavior of an airfoil with morphing trailing edge for wind turbine applications

The length of wind turbine rotor blades has been increased during the last decades. Higher stresses arise especially at the blade root because of the longer lever arm. One way to reduce unsteady blade-root stresses caused by turbulence, gusts, or wind shear is to actively control the lift in the blade tip region. One promising method involves airfoils with morphing trailing edges to control the lift and consequently the loads acting on the blade. In the present study, the steady and unsteady behavior of an airfoil with a morphing trailing edge is investigated. Two-dimensional Reynolds-Averaged Navier-Stokes (RANS) simulations are performed for a typical thin wind turbine airfoil with a morphing trailing edge. Steady-state simulations are used to design optimal geometry, size, and deflection angles of the morphing trailing edge. The resulting steady aerodynamic coefficients are then analyzed at different angles of attack in order to determine the effectiveness of the morphing trailing edge. In order to investigate the unsteady aerodynamic behavior of the optimal morphing trailing edge, time-resolved RANS-simulations are performed using a deformable grid. In order to analyze the phase shift between the variable trailing edge deflection and the dynamic lift coefficient, the trailing edge is deflected at four different reduced frequencies for each different angle of attack. As expected, a phase shift between the deflection and the lift occurs. While deflecting the trailing edge at angles of attack near stall, additionally an overshoot above and beyond the steady lift coefficient is observed and evaluated.

The impact of geometric non-linearities on the fatigue analysis of trailing edge bond lines in wind turbine rotor blades

The accurate prediction of stress histories for the fatigue analysis is of utmost importance for the design process of wind turbine rotor blades. As detailed, transient, and geometrically non-linear three-dimensional finite element analyses are computationally weigh too expensive, it is commonly regarded sufficient to calculate the stresses with a geometrically linear analysis and superimpose different stress states in order to obtain the complete stress histories. In order to quantify the error from geometrically linear simulations for the calculation of stress histories and to verify the practical applicability of the superposition principal in fatigue analyses, this paper studies the influence of geometric non-linearity in the example of a trailing edge bond line, as this subcomponent suffers from high strains in span-wise direction. The blade under consideration is that of the IWES IWT-7.5-164 reference wind turbine. From turbine simulations the highest edgewise loading scenario from the fatigue load cases is used as the reference. A 3D finite element model of the blade is created and the bond line fatigue assessment is performed according to the GL certification guidelines in its 2010 edition, and in comparison to the latest DNV GL standard from end of 2015. The results show a significant difference between the geometrically linear and non-linear stress analyses when the bending moments are approximated via a corresponding external loading, especially in case of the 2010 GL certification guidelines. This finding emphasizes the demand to reconsider the application of the superposition principal in fatigue analyses of modern flexible rotor blades, where geometrical nonlinearities become significant. In addition, a new load application methodology is introduced that reduces the geometrically non-linear behaviour of the blade in the finite element analysis.

Some results on open-edge and open mobile guarding of polygons and triangulations

This paper focuses on a variation of the Art Gallery problem that considers open-edge guards and open mobile-guards. A mobile guard can be placed on edges and diagonals of a polygon, and the ‘open’ prefix means that the endpoints of such an edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open-edge and open mobile-guards. A wide range of polygons is studied, which include orthogonal polygons with or without holes, spirals, orthogonal spirals and monotone polygons. Moreover, this problem is also considered for planar triangulation graphs using open-edge guards.

Introducing mobile edge computing capabilities through distributed 5G Cloud Enabled Small Cells

Current trends in broadband mobile networks are addressed towards the placement of different capabilities at the edge of the mobile network in a centralised way. On one hand, the split of the eNB between baseband processing units and remote radio headers makes it possible to process some of the protocols in centralised premises, likely with virtualised resources. On the other hand, mobile edge computing makes use of processing and storage capabilities close to the air interface in order to deploy optimised services with minimum delay. The confluence of both trends is a hot topic in the definition of future 5G networks. The full centralisation of both technologies in cloud data centres imposes stringent requirements to the fronthaul connections in terms of throughput and latency. Therefore, all those cells with limited network access would not be able to offer these types of services. This paper proposes a solution for these cases, based on the placement of processing and storage capabilities close to the remote units, which is especially well suited for the deployment of clusters of small cells. The proposed cloud-enabled small cells include a highly efficient microserver with a limited set of virtualised resources offered to the cluster of small cells. As a result, a light data centre is created and commonly used for deploying centralised eNB and mobile edge computing functionalities. The paper covers the proposed architecture, with special focus on the integration of both aspects, and possible scenarios of application.

The Indistinct Edge: Reconnecting Experience in Nature and Architecture

This thesis explores how architectures sense of place is rooted in the natural environment. The built environment has been constructed to protect and sustain human culture from the weathering of nature. Separating experience from the natural environment removes a sense of place and belonging in the natural and reinforces architectural dominance. This separation distinguishes the natural world as an article of spectacle and gives the human experience an unnatural voyeurship to natural changes. By examining the fusion of architectural and natural edges this thesis analyzes how the human experience can reconnect with a naturalistic sense of place through architecture, blending the finite edge where architecture maintains nature, and adapting buildings to the cycles of the environment. Removing dominance of man-made spaces and replacing them with the cohabitation of the edge between built and natural forms.