Evidence of successful river spawning by lake trout (Salvelinus namaycush) in the Lower Niagara River,Lake Ontario

Restoration of a wild-produced lake trout Salvelinus namaycush population in Lake Ontario has not been successful despite the adult population often meeting or exceeding restoration targets. Lack of high-quality spawning habitat in Lake Ontario is suggested as one impediment to recruitment of wild lake trout, although the quantity and location of spawning habitat is poorly understood. If high-quality spawning habitat is limited in Lake Ontario, lake trout may be using uncommon spawning locations such as rivers. Anecdotal angler accounts point to the Niagara River as a lake trout spawning location. To better understand the potential of the Niagara River as a spawning location, egg and juvenile fish collections were conducted 12–14 river kilometers from the mouth of the Niagara River from 2010 to 2012; and mature female lake trout with surgically implanted acoustic tags were monitored from 2015 to 2019. Genetic analyses confirmed 60% of collected eggs and 93% of collected post-hatch juvenile fish in the Niagara River were lake trout. Tagged female lake trout returned to the Niagara River over consecutive years during the spawning season. The short duration of lake trout presence in the river (mean = 56 days/year) suggests female lake trout use the Niagara River primarily for spawning. Diversity in spawning locations may provide lake trout population’s resilience against environmental variability through a portfolio effect. Improved identification of riverine spawning locations, including their overall contribution to wild recruitment, may be a useful tool for managers to restore a wild-produced population of lake trout in Lake Ontario.     

Monte Carlo despeckling of transrectal ultrasound images of the prostate

In this paper, a novel stochastic method is developed for despeckling transrectal ultrasound (TRUS) images of the prostate. By incorporating the circular probe acquisition particularities and speckle noise statistics of TRUS images of the prostate into a likelihood-weighted Monte Carlo estimation scheme, the proposed method can better remove speckle noise while preserving image structures and details that are relevant for image screening, allowing for a better delineation of the lesion contour. Our in silico and in vivo experimental results are promising, which was confirmed by a clinical evaluation of the in vivo test cases by experienced clinicians, and indicate that our method potentially can perform better than other previously proposed methods.     

Model-driven design for the visual analysis of heterogeneous data

As heterogeneous data from different sources are being increasingly linked, it becomes difficult for users to understand how the data are connected, to identify what means are suitable to analyze a given data set, or to find out how to proceed for a given analysis task. We target this challenge with a new model-driven design process that effectively codesigns aspects of data, view, analytics, and tasks. We achieve this by using the workflow of the analysis task as a trajectory through data, interactive views, and analytical processes. The benefits for the analysis session go well beyond the pure selection of appropriate data sets and range from providing orientation or even guidance along a preferred analysis path to a potential overall speedup, allowing data to be fetched ahead of time. We illustrate the design process for a biomedical use case that aims at determining a treatment plan for cancer patients from the visual analysis of a large, heterogeneous clinical data pool. As an example for how to apply the comprehensive design approach, we present Stack'n'flip, a sample implementation which tightly integrates visualizations of the actual data with a map of available data sets, views, and tasks, thus capturing and communicating the analytical workflow through the required data sets.     

Majority gates vs. general weighted threshold gates

In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following:

Predicting fully plastic mode II crack growth from an asymmetric defect

Asymmetrically cracked specimens fail with considerably less ductility than symmetrically cracked ones, due to the crack progressing along a shear band into pre-damaged material. A formulation for the accumulation of damage ahead of an asymmetric crack is presented, based on strain increments following a power law relation. These results are integrated both numerically and approximately.The crack growth per unit displacement increases approximately as the logarithm of the total crack advance per inclusion spacing , and varies inversely as the critical fracture strain c. This provides a basis for predicting large-scale, fully plastic fracture from asymmetric weld defects, using small-scale laboratory specimens.

---

Résumé Les éprouvettes fissurées de manière asymétrique se rompent avec beaucoup moins de ductilité que celles qui sont fissurées de manières symétrique, en raison du fait que la fissure se développe suivant une bande de cisaillement dans un matériau préendommagé. On Présente une formulation de l'accumulation du dommage en avant d'une fissure asymétrique, en se basant sur des gradients de déformations répartis selon une loi quadratique. L'interprétation des résultats est effectuée par voie numérique et par approximation.On constate que le croissance d'une fissure par unité de déplacement est sensiblement proportionnelle au logarithme de l'avancement total de la fissure rapporté à l'espacement entre deux inclusions , et en raison inverse de la déformation critique à la rupture c. Ceci fournt une base pour prédire une rupture à plus grande échelle et en conditions tout à fait plastiques, qui résulteront de défauts de soudage asymétriques, et ce en utilisant des éprouvettes réduites de laboratoire.

     

Ultrasonic crack characterization via a constrained inversion algorithm

The Kirchhoff approximation is used to show that the time domain impulse response of an isolated flat crack can be given a simple geometrical interpretation in terms of the derivative of a projected length function. For an elliptical crack, this derivative can be obtained explicitly to yield the two edge-diffracted waves which originate from the flashpoints of the crack. An explicit coordinate invariant expression is obtained from this elliptical crack solution which relates the time difference, t, between the arrival of these edge-diffracted waves and the crack size and orientation. Previously, we have proposed that this expression, together with t measurements in different scattering directions, could be used in a regression analysis as the basis for performing a constrained inversion of crack scattering data (i.e., where we attempt to obtain the best equivalent flat elliptical crack that fits the scattering measurements). Here we will demonstrate some results of applying the proposed algorithm using noisy synthetic data. The sensitivity of the results to both, number of measurements and transducer orientation, will be discussed.     

Textures in3He-A: Magnetic deformation in a narrow slab

A variational technique is used to analyze the deformed texture of superfluid³He-A in a narrow slab subject to a perpendicular magnetic field. Specific predictions are made for the anisotropy parameters and , averaged across the width.     

Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's tactile sensor. This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper bounds on the length of generated paths are produced.Supported in part by the National Science Foundation Grant DMC-8519542.