Innovative edible films to improve storage ability of fresh-cut apple cv. Bravo de Esmolfe

Dissertação de mestrado, Hortofruticultura, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015

New Cut S172

The South Carolina Department of Natural Resources provides maps to recreational and state shellfish grounds, available to the public for recreational harvesting or to commercial harvest. This map shows the location of New Cut S172 Recreational Shellfish Ground in Charleston County.

Mini invasive skeletal muscle biopsy technique with a tri-axial end cut needle.

OBJECTIVE: Skeletal Muscle Biopsy is a minor surgical procedure for the diagnosis of different neuromuscular pathological conditions and has recently gained popularity also in the research field of age-related muscular modifications and sarcopenia. Few studies focused on the application of mini-invasive muscular biopsy in both normal and pathological conditions. The aim of our study was to describe a mini invasive ultrasound-guided skeletal muscular biopsy technique in complete spinal cord injured (SCI) patients and healthy controls with a tri-axial end-cut needle. PATIENTS AND METHODS: Skeletal muscle biopsies were collected from 6 chronic SCI patients and 3 healthy controls vastus lateralis muscle with a tri-axial end cut needle (Biopince© - Angiotech). Muscle samples were stained for ATPase to determine fibers composition, moreover, gene expression of cyclooxygenase-1 (COX-1) and prostaglandin E2 receptor has been analyzed by Real Time RT-PCR. RESULTS: All the procedures were perfomed easily without failures and complications. Control tissue was macroscopically thicker than SCI one. Control specimen displayed an equal distribution of type I and type II fibers, while SCI sample displayed a prevalence of type II fibers SCI specimen displayed a significant reduction in COX-1 gene expression. This mini-invasive approach was easy, accurate and with low complication rate in performing skeletal muscle biopsy in both SCI patients and controls. CONCLUSIONS: This technique could be useful in conditions in which the overall quantity of specimen required is small like for molecular biology analysis. For histological diagnostic purposes and/or conditions in which the original tissue is already pathologically modified, this technique should be integrated with more invasive techniques.

Second Welland Canal - Book 2, Survey Map 8 - Little Deep Cut in Thorold

Survey map of the Second Welland Canal created by the Welland Canal Company showing the canal in Thorold South. Identified structures associated with the Canal include the Little Deep Cut and the towing path. The surveyors' measurements and notes can be seen in red and black ink and pencil. Local area landmarks are also identified and include streets and roads (ex. Road to Beaverdams and Road to Allanburgh), two unnamed bridges, the Spoil Bank, a pond, and the Back Water. Properties and property owners of note are: Lots 29 and 30, Jacob Keefer, John Brown, William Bouck, C. Gisso, and a property reserved for Bridge Tender.

Second Welland Canal - Book 2, Survey Map 15 - Deep Cut in Thorold

Survey map of the Second Welland Canal created by the Welland Canal Company showing the canal in the Thorold Township just south of Allanburgh. Identified structures and features associated with the Canal include the Deep Cut and the towing path. The surveyors' measurements and notes can be seen in red and black ink and pencil. Local area landmarks are also identified and include streets and roads (ex. Road to Port Robinson), and the Spoil Bank. Properties and property owners of note are: Lots 142 and 143, John J. Church, Henry Vanderburgh, and Martin Delamatter and G. Coulter.

Second Welland Canal - Book 2, Survey Map 16 - Deep Cut in Thorold

Survey map of the Second Welland Canal created by the Welland Canal Company showing the canal in the Thorold Township between Allanburg and Port Robinson. Identified structures and features associated with the Canal include the Deep Cut and the towing path. The surveyors' measurements and notes can be seen in red and black ink and pencil. Local area landmarks are also identified and include streets and roads (ex. Road to Port Allanburg), and the Spoil Bank. Properties and property owners of note are: Lots 185, 186, and 187, J. J. Church and H. Vanderburgh. Four properties adjacent to the canal are outlined in blue and labeled J through M, with L and K belonging to John Beatty, M belonging to John Coulter, and J belonging to G. Jordan (formerly belonging to John Coleman Jordan).

Second Welland Canal - Book 2, Survey Map 17 - Deep Cut and Port Robinson

Survey map of the Second Welland Canal created by the Welland Canal Company showing the canal at Port Robinson. Identified structures and features associated with the Canal include the Deep Cut, Old Channel of Canal, and the towing path. The surveyors' measurements and notes can be seen in red and black ink and pencil. Local area landmarks are also identified and include streets and roads (ex. Road to Port Allanburg), the Spoil Bank, an island, several bridges, and a church. Several unidentified structures are present but not labeled. Properties and property owners of note are: Lots 202, 203, and 204. Lot 203 is divided into several properties labeled A - J. Owners of these properties include James McCoppen, John Coulter, James Griffith, John C. Jordan, W. Hendershot, John Greer, Charles Richards, C. Stuart, and S. D. Woodruff. Other property owners include D. McFarland.

Welland Canal Survey of Lands Plan of a cut at the mouth of Chippewa or Welland River, n.d.

Survey map and description of the land at the cut of the Chippewa or Welland River. Created by The Welland Canal Company. Included is a drawing of the land along with brief surveyors notes. Noteable features include; bridge, Welland River, road, Stone house, J. Cummings Esq. house, military line, military land, Old Fort, old military draw bridge. Surveyor notes are seen in pencil on the map.

Pay roll voucher #27 from the Engineer Department of the Welland Railway for sundries for the month of August, 1857. A section of the list has been cut from the page, Aug. 31, 1857

Pay roll voucher #27 from the Engineer Department of the Welland Railway for sundries for the month of August, 1857. A section of the list has been cut from the page, Aug. 31, 1857.

Chart of approximate quantity of excavation in slides in the deep cut

Chart of approximate quantity of excavation in slides in the deep cut, July 1, 1848.

Note regarding cut glass prices

Note regarding cut glass prices, n.d.

Développement d’un algorithme de branch-and-price-and-cut pour le problème de conception de réseau avec coûts fixes et capacités

De nombreux problèmes en transport et en logistique peuvent être formulés comme des modèles de conception de réseau. Ils requièrent généralement de transporter des produits, des passagers ou encore des données dans un réseau afin de satisfaire une certaine demande tout en minimisant les coûts. Dans ce mémoire, nous nous intéressons au problème de conception de réseau avec coûts fixes et capacités. Ce problème consiste à ouvrir un sous-ensemble des liens dans un réseau afin de satisfaire la demande, tout en respectant les contraintes de capacités sur les liens. L'objectif est de minimiser les coûts fixes associés à l'ouverture des liens et les coûts de transport des produits. Nous présentons une méthode exacte pour résoudre ce problème basée sur des techniques utilisées en programmation linéaire en nombres entiers. Notre méthode est une variante de l'algorithme de branch-and-bound, appelée branch-and-price-and-cut, dans laquelle nous exploitons à la fois la génération de colonnes et de coupes pour la résolution d'instances de grande taille, en particulier, celles ayant un grand nombre de produits. En nous comparant à CPLEX, actuellement l'un des meilleurs logiciels d'optimisation mathématique, notre méthode est compétitive sur les instances de taille moyenne et supérieure sur les instances de grande taille ayant un grand nombre de produits, et ce, même si elle n'utilise qu'un seul type d'inégalités valides.

L'algorithme de Branch and Price and Cut pour le problème de conception de réseaux avec coûts fixes et sans capacité

Le problème de conception de réseaux est un problème qui a été beaucoup étudié dans le domaine de la recherche opérationnelle pour ses caractéristiques, et ses applications dans des nombreux domaines tels que le transport, les communications, et la logistique. Nous nous intéressons en particulier dans ce mémoire à résoudre le problème de conception de réseaux avec coûts fixes et sans capacité, en satisfaisant les demandes de tous les produits tout en minimisant la somme des coûts de transport de ces produits et des coûts fixes de conception du réseau. Ce problème se modélise généralement sous la forme d’un programme linéaire en nombres entiers incluant des variables continues. Pour le résoudre, nous avons appliqué la méthode exacte de Branch-and-Bound basée sur une relaxation linéaire du problème avec un critère d’arrêt, tout en exploitant les méthodes de génération de colonnes et de génération de coupes. Nous avons testé la méthode de Branch-and-Price-and-Cut sur 156 instances divisées en cinq groupes de différentes tailles, et nous l’avons comparée à Cplex, l’un des meilleurs solveurs d’optimisation mathématique, ainsi qu’à la méthode de Branch-and- Cut. Notre méthode est compétitive et plus performante sur les instances de grande taille ayant un grand nombre de produits.