Search results for: M. Brun

Authors: Mostafa Elbaba

Abstract:

Because childhood renal diseases are grossly different compared to adult diseases, pediatric nephrology was founded as a specialty in 1965. Renal pathology specialty was introduced at the London Ciba Symposium in 1961. The history of renal pathology can be divided into two eras: one starting in the 1650s with the invention of the microscope, the second in the 1950s with the implementation of renal biopsy, and the presence of electron microscopy and immunofluorescence study. Prior to the 1950s, the study of diseased human kidneys was restricted to postmortem examination by gross pathology. In 1827, Richard Bright first described his triad of kidney disease, which was confirmed by morbid kidney changes at autopsy. In 1905 Friedrich Mueller coined the term “nephrosis” describing the inflammatory form of “degenerative” diseases, and later F. Munk added the term “lipoid nephrosis”. The most profound influence on renal diseases’ classification came from the publication of Volhard and Fahr in 1914. In 1899, Carl Max Wilhelm Wilms described Wilms' tumor of the kidneys in children. Chronic pyelonephritis was a popular renal diagnosis and the most common cause of uremia until the 1960s. Although kidney biopsy had been used early in the 1930s for renal tumors, the earliest reports of its use in the diagnosis of medical kidney disease were by Iversen and Brun in 1951, followed by Alwall in 1952, then by Pardo in 1953. The earliest intentional renal biopsies were done in 1944 by Nils Alwall, while the procedure was abandoned after the death of one of his 13 patients who biopsied. In 1950, Antonino Perez-Ara attempted renal biopsies, but his results were missed because of an unpopular journal publication. In the year 1951, Claus Brun and Poul Iverson developed the biopsy procedure using an aspiration technique. Popularizing renal biopsy practice is accredited to Robert Kark, who published his distinct work in 1954. He perfected the technique of renal biopsy in the prone position using the Vim-Silverman needle and used intravenous pyelography to improve the localization of the kidney.

Keywords: history, medicine, nephrology, pediatrics, pathology

Procedia PDF Downloads 37

Authors: F. Fekak, A. Gravouil, M. Brun, B. Depale

Abstract:

During an earthquake, a bridge crane may be subjected to multiple impacts between crane wheels and rail. In order to model such phenomena, a time-history dynamic analysis with a multi-scale approach is performed. The high frequency aspect of the impacts between wheels and rails is taken into account by a Lagrange explicit event-capturing algorithm based on a velocity-impulse formulation to resolve contacts and impacts. An implicit temporal scheme is used for the rest of the structure. The numerical coupling between the implicit and the explicit schemes is achieved with a heterogeneous asynchronous time-integrator.

Keywords: bridge crane, earthquake, dynamic analysis, explicit, implicit, impact

Procedia PDF Downloads 274

Authors: Sami Baraketi, Jean Marie Garcia, Olivier Brun

Abstract:

Wavelength Division Multiplexing (WDM) is the dominant transport technology used in numerous high capacity backbone networks, based on optical infrastructures. Given the importance of costs (CapEx and OpEx) associated to these networks, resource management is becoming increasingly important, especially how the optical circuits, called “lightpaths”, are routed throughout the network. This requires the use of efficient algorithms which provide routing strategies with the lowest cost. We focus on the lightpath routing and wavelength assignment problem, known as the RWA problem, while optimizing wavelength fragmentation over the network. Wavelength fragmentation poses a serious challenge for network operators since it leads to the misuse of the wavelength spectrum, and then to the refusal of new lightpath requests. In this paper, we first establish a new Integer Linear Program (ILP) for the problem based on a node-link formulation. This formulation is based on a multilayer approach where the original network is decomposed into several network layers, each corresponding to a wavelength. Furthermore, we propose an efficient heuristic for the problem based on a greedy algorithm followed by a post-treatment procedure. The obtained results show that the optimal solution is often reached. We also compare our results with those of other RWA heuristic methods.

Keywords: WDM, lightpath, RWA, wavelength fragmentation, optimization, linear programming, heuristic

Procedia PDF Downloads 498

Authors: Van Son Nguyen, Van Huy Mai, Alec Moradpour, Pascale Auban Senzier, Claude Pasquier, Kang Wang, Pierre-Antoine Albouy, Marcelo J. Rozenberg, John Giapintzakis, Christian N. Mihailescu, Charis M. Orfanidou, Thomas Maroutian, Philippe Lecoeur, Guillaume Agnus, Pascal Aubert, Sylvain Franger, Raphaël Salot, Nathalie Brun, Katia March, David Alamarguy, Pascal ChréTien, Olivier Schneegans

Abstract:

In the field of Nanoelectronics, a major research activity is being developed towards non-volatile memories. To face the limitations of existing Flash memory cells (endurance, downscaling, rapidity…), new approaches are emerging, among them resistive switching memories (Re-RAM). In this work, we analysed the behaviour of LixCoO2 oxide thin films in electrode/film/electrode devices. Preliminary results have been obtained concerning the influence of bias pulses characteristics (duration, value) on some performance parameters, such as endurance and resistance ratio (ROFF/RON). Besides, Conducting Probe Atomic Force Microscopy (CP-AFM) characterizations of the devices have been carried out to better understand some causes of performance failure, and thus help optimizing the switching performance of such devices.

Keywords: non volatile resistive memories, resistive switching, thin films, endurance

Procedia PDF Downloads 583

Authors: Simeon Mayala, Ida Herdlevær, Jonas Bull Haugsøen, Shamundeeswari Anandan, Sonia Gavasso, Morten Brun

Abstract:

In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters. The steps involve preprocessing, making a graph, constructing a minimum spanning tree, and a newly implemented way of interactively segmenting the region of interest. In the preprocessing step, a Gaussian filter is applied to 2D images to remove the noise. Then, the pixel neighbor graph is weighted by intensity differences and the corresponding minimum spanning tree is constructed. The image is loaded in an interactive window for segmenting the tumor. The region of interest and the background are selected by clicking to split the minimum spanning tree into two trees. One of these trees represents the region of interest and the other represents the background. Finally, the segmentation given by the two trees is visualized. The proposed method was tested by segmenting two different 2D brain T1-weighted magnetic resonance image data sets. The comparison between our results and the standard gold segmentation confirmed the validity of the minimum spanning tree approach. The proposed method is simple to implement and the results indicate that it is accurate and efficient.

Keywords: brain tumor, brain tumor segmentation, minimum spanning tree, segmentation, image processing

Procedia PDF Downloads 98