Remotely sensed mid-channel bar dynamics in downstream of the Three Gorges Dam, China

The downstream reach of the Three Gorges Dam (TGD) along the Yangtze River (1560 km) hosts numerous mid-channel bars (MCBs). MCBs dynamics are crucial to the river’s hydrological processes and local ecological function. However, a systematic understanding of such dynamics and their linkage to TGD remains largely unknown. Using Landsat-image-extracted MCBs and several spatial-temporal analysis methods, this study presents a comprehensive understanding of MCB dynamics in terms of number, area, and shape, over downstream of TGD during the period 1985−2018. On average, a total of 140 MCBs were detected and grouped into four types representing small ( 2 km2), middle (2 km2 − 7 km2), large (7 km2 − 33 km2) and extra-large size (>33 km2) MCBs, respectively. MCBs number decreased after TGD closure but most of these happened in the lower reach. The area of total MCBs experienced an increasing trend (2.77 km2/yr, p-value 0.01) over the last three decades. The extra-large MCBs gained the largest area increasing rate than the other sizes of MCBs. Small MCBs tended to become relatively round, whereas the others became elongate in shape after TGD operation. Impacts of TGD operation generally diminished in the longitudinal direction from TGD to Hankou and from TGD to Jiujiang for shape and area dynamics, respectively. The quantified longitudinal and temporal dynamics of MCBs across the entire Yangtze River downstream of TGD provides a crucial monitoring basis for continuous investigation of the changing mechanisms affecting the morphology of the Yangtze River system

The Rise of Transgender and Gender Diverse Representation in the Media: Impacts on the Population

In recent years, the transgender and gender diverse (TGD) population has gained a stronger voice in the media. Although these voices are being heard, there are limits on the types of TGD representation displayed in media. The current study interviewed 27 TGD individuals. These interviews exposed how participants view the rise of TGD media representation. The main themes that emerged were TGD awareness and TGD identity discovery and role modeling. Clearly, there is a disconnect between transnormativity in the media and transnormativity in reality

Ground state and constrained domain walls in Gd/Fe multilayers

The magnetic ground state of antiferromagnetically coupled Gd/Fe multilayers and the evolution of in-plane domain walls is modelled with micromagnetics. The twisted state is characterised by a rapid decrease of the interface angle with increasing magnetic field. We found that for certain ratios M(Fe):M(Gd), the twisted state is already present at low fields. However, the magnetic ground state is not only determined by the ratio M(Fe):M(Gd) but also by the thicknesses of the layers, that is the total moments of the layer. The dependence of the magnetic ground state is explained by the amount of overlap of the domain walls at the interface. Thicker layers suppress the Fe aligned and the Gd aligned state in favour of the twisted state. Whereas ultrathin layers exclude the twisted state, since wider domain walls can not form in these ultrathin layers

The data-exchange chase under the microscope

In this paper we take closer look at recent developments for the chase procedure, and provide additional results. Our analysis allows us create a taxonomy of the chase variations and the properties they satisfy. Two of the most central problems regarding the chase is termination, and discovery of restricted classes of sets of dependencies that guarantee termination of the chase. The search for the restricted classes has been motivated by a fairly recent result that shows that it is undecidable to determine whether the chase with a given dependency set will terminate on a given instance. There is a small dissonance here, since the quest has been for classes of sets of dependencies guaranteeing termination of the chase on all instances, even though the latter problem was not known to be undecidable. We resolve the dissonance in this paper by showing that determining whether the chase with a given set of dependencies terminates on all instances is coRE-complete. For the hardness proof we use a reduction from word rewriting systems, thereby also showing the close connection between the chase and word rewriting. The same reduction also gives us the aforementioned instance-dependent RE-completeness result as a byproduct. For one of the restricted classes guaranteeing termination on all instances, the stratified sets dependencies, we provide new complexity results for the problem of testing whether a given set of dependencies belongs to it. These results rectify some previous claims that have occurred in the literature.Comment: arXiv admin note: substantial text overlap with arXiv:1303.668

Functional Dependencies Unleashed for Scalable Data Exchange

We address the problem of efficiently evaluating target functional dependencies (fds) in the Data Exchange (DE) process. Target fds naturally occur in many DE scenarios, including the ones in Life Sciences in which multiple source relations need to be structured under a constrained target schema. However, despite their wide use, target fds' evaluation is still a bottleneck in the state-of-the-art DE engines. Systems relying on an all-SQL approach typically do not support target fds unless additional information is provided. Alternatively, DE engines that do include these dependencies typically pay the price of a significant drop in performance and scalability. In this paper, we present a novel chase-based algorithm that can efficiently handle arbitrary fds on the target. Our approach essentially relies on exploiting the interactions between source-to-target (s-t) tuple-generating dependencies (tgds) and target fds. This allows us to tame the size of the intermediate chase results, by playing on a careful ordering of chase steps interleaving fds and (chosen) tgds. As a direct consequence, we importantly diminish the fd application scope, often a central cause of the dramatic overhead induced by target fds. Moreover, reasoning on dependency interaction further leads us to interesting parallelization opportunities, yielding additional scalability gains. We provide a proof-of-concept implementation of our chase-based algorithm and an experimental study aiming at gauging its scalability with respect to a number of parameters, among which the size of source instances and the number of dependencies of each tested scenario. Finally, we empirically compare with the latest DE engines, and show that our algorithm outperforms them

Composition with Target Constraints

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.Comment: This paper is an extended version of: M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. In 13th International Conference on Database Theory (ICDT), pages 129-142, 201