• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 86
  • 16
  • 4
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 139
  • 139
  • 89
  • 31
  • 19
  • 15
  • 15
  • 14
  • 13
  • 12
  • 12
  • 12
  • 12
  • 12
  • 12
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

An efficient wavelet representation for large medical image stacks

Forsberg, Daniel January 2007 (has links)
Like the rest of the society modern health care has to deal with the ever increasing information flow. Imaging modalities such as CT, MRI, US, SPECT and PET just keep producing more and more data. Especially CT and MRI and their 3D image stacks cause problems in terms of how to effectively handle these data sets. Usually a PACS is used to manage the information flow. Since a PACS often is implemented with a server-client setup, the management of these large data sets requires an efficient representation of medical image stacks that minimizes the amount of data transmitted between server and client and that efficiently supports the workflow of a practitioner. In this thesis an efficient wavelet representation for large medical image stacks is proposed for the use in a PACS. The representation supports features such as lossless viewing, random access, ROI-viewing, scalable resolution, thick slab viewing and progressive transmission. All of these features are believed to be essential to form an efficient tool for navigation and reconstruction of an image stack. The proposed wavelet representation has also been implemented and found to be better in terms of memory allocation and amount of data transmitted between server and client when compared to prior solutions. Performance tests of the implementation has also shown the proposed wavelet representation to have a good computational performance.
102

Next Generation Ferroelectric Memories enabled by Hafnium Oxide

Mikolajick, T., Schroeder, U., Lomenzo, P. D., Breyer, E. T., Mulaosmanovic, H., Hoffmann, M., Mittmann, T., Mehmood, F., Max, B., Slesazeck, S. 22 June 2022 (has links)
Ferroelectrics are theoretically an ideal solution for low write power nonvolatile memories. However, the complexity of ferroelectric perovskites has hindered the scaling of such devices to competitive feature sizes. The discovery of ferroelectricity in hafnium oxide solved this issue. Ferroelectric memories in three variants, capacitor based ferroelectric RAM, ferroelectric field effect transistors and ferroelectric tunneling junctions have become competitors for future memory solutions again. In this paper, the basics and current status of hafnium oxide based ferroelectric memory devices is described and recent results are shown.
103

On Throughput-Reliability-Delay Tradeoffs in Wireless Networks

Nam, Young-Han 19 March 2008 (has links)
No description available.
104

Study and improvement of radiation hard monolithic active pixel sensors of charged particle tracking / Etude et amélioration de capteurs monolithiques actifs à pixels résistants aux rayonnements pour reconstruire la trajectoire des particules chargées

Wei, Xiaomin 18 December 2012 (has links)
Les capteurs monolithiques actifs à pixels (Monolithic Active Pixel Sensors, MAPS) sont de bons candidats pour être utilisés dans des expériences en Physique des Hautes Énergies (PHE) pour la détection des particules chargées. Dans les applications en PHE, des puces MAPS sont placées dans le voisinage immédiat du point d’interaction et sont directement exposées au rayonnement intense de leur environnement. Dans cette thèse, nous avons étudié et amélioré la résistance aux radiations des MAPS. Les effets principaux de l’irradiation et le progrès de la recherche sur les MAPS sont étudiés tout d'abord. Nous avons constaté que les cœurs des SRAM IP incorporées dans la puce MAPS limitent sensiblement la tolérance aux radiations de la puce MAPS entière. Aussi, pour améliorer la radiorésistance des MAPS, trois mémoires radiorésistantes sont conçues et évaluées pour les expériences en PHE. Pour remplacer les cœurs des IP SRAM, une SRAM radiorésistante est développée sur une petite surface. Pour les procédés de plus petit taille de grille des transistors, dans lequel les effets SEU (Single Event Upset) deviennent significatifs, une SRAM radiorésistante avec une tolérance SEU accrue est réalisée à l’aide d’un algorithme de détection et de correction d'erreurs (Error Detection And Correction, EDAC) et un stockage entrelacé des bits. Afin d'obtenir une tolérance aux rayonnements et une densité de micro-circuits plus élevées, une mémoire à double accès avec une cellule à 2 transistors originale est développée et évaluée pour des puces MAPS futures. Enfin, la radiorésistance des puces MAPS avec des nouveaux procédés disponibles est étudiée, et les travaux futurs sont proposés. / Monolithic Active Pixel Sensors (MAPS) are good candidates to be used in High Energy Physics (HEP) experiments for charged particle detection. In the HEP applications, MAPS chips are placed very close to the interaction point and are directly exposed to harsh environmental radiation. This thesis focuses on the study and improvement of the MAPS radiation hardness. The main radiation effects and the research progress of MAPS are studied firstly. During the study, the SRAM IP cores built in MAPS are found limiting the radiation hardness of the whole MAPS chips. Consequently, in order to improve the radiation hardness of MAPS, three radiation hard memories are designed and evaluated for the HEP experiments. In order to replace the SRAM IP cores, a radiation hard SRAM is developed on a very limited area. For smaller feature size processes, in which the single event upset (SEU) effects get significant, a radiation hard SRAM with enhanced SEU tolerance is implemented by an error detection and correction algorithm and a bit-interleaving storage. In order to obtain higher radiation tolerance and higher circuitry density, a dual-port memory with an original 2-transistor cell is developed and evaluated for future MAPS chips. Finally, the radiation hardness of the MAPS chips using new available processes is studied, and the future works are prospected.
105

MAC protocols design and a cross-layered QoS framework for next generation wireless networks / Conception de protocoles de la couche MAC et modélisation des réseaux hétérogènes de nouvelle génération

Sabir, Essaïd 24 September 2010 (has links)
Ce manuscrit est centré sur la conception, l'amélioration et l'évaluation des protocoles des couches RESEAU, MAC et PHY. En particulier, nous nous focalisons sur la conception de nouveaux protocoles distribués pour une utilisation optimale/améliorée des ressources radio disponibles. Par ailleurs, nous caractérisons les performances des réseaux ad hoc à accès aléatoire au canal en utilisant des paramètres de plusieurs couches avec aptitude de transfert d'information (data forwarding). La majeure partie de nos analyses se base sur le concept d'interaction entre les couches OSI (cross-layer). En effet, cette nouvelle et attractive approche est devenue en peu de temps omniprésente dans le domaine de recherche et développement et dans le domaine industriel. Les métriques de performances qui nous intéressent sont la stabilité des files d'attentes de transfert, le débit, le délai et la consommation d'énergie. Principalement, la compréhension de l'interaction entre les couches MAC/PHY et routage du standard IEEE 802.11e DCF/EDCF, d'une part, et l'interaction entre noeuds en terme d'interférences, d'autre part, constituent le coeur central de notre travail / The present dissertation deals with the problem of under-utilization of collision channels and other related problems in wireless networks. It deals with the design of random access protocols for wireless systems and provides a mathematical framework for performance evaluation of multihop based heterogeneous wireless networks. This thesis is divided into three parts. In the first part, we propose new versions of slotted aloha incorporating power control, priority and hierarchy. Our simulations were important to understand the behaviour of such a system and the real impact of involved parameters (transmit power, transmit rate, arrival rate, hierarchy order). Both team problem (common objective function is maximized) and game problem (each user maximizes its own objective) were discussed. Introducing hierarchy seems to provide many promising improvement without/or with a low amount of external information. We also proposed two distributed algorithms to learn the desired throughput. Next, we developed in the second part an analytical Framework to evaluate performances of multihop based heterogeneous Wireless networks. We built a cross-layer model and derived expression of stability, end-to-end throughput and end-to-end delay. Furthermore, we provided an accurate approximation for the distribution of end-to-end delay in multihop ad hoc networks (operating with slotted aloha protocol). As a direct application, we highlighted how streaming and conversational flows could be supported in this class of ubiquitous networks. The third part of this thesis is devoted to understanding and modelling of IEEE 802.11e DCF/EDCF-operated multihop ad hoc networks. We indeed built a complete and simple APPLICATION/NETWORK/MAC/PHY cross-layered model with finite retries per packet per flow. We analyzed the stability of forwarding queues and derived expression of end-to-end throughput. We finally proposed a Fountain code-based MAC layer to improve the throughput/fairness over the network
106

Techniques d’amélioration des performances des méthodes d’accès aléatoire synchrones pour les communications par satellite / Improving Synchronous Random Access Schemes for Satellite Communications

Zidane, Karine 25 November 2016 (has links)
L’optimisation des communications par satellite devient un enjeu crucial pour fournir un accèsInternet aux zones blanches et/ou défavorisées et pour supporter des réseaux à grande échelle.Dans ce contexte, l’utilisation des techniques d’accès aléatoires sur le lien retour permetd’améliorer les performances de ces systèmes. Cependant, les techniques d’accès aléatoireclassiques comme ‘Aloha’ et ‘Slotted Aloha’ ne sont pas optimales pour la transmission dedonnées sur le lien retour. En effet, ces techniques présentent un taux élevé de pertes depaquets suite aux collisions. Par conséquent, des études récentes ont proposé de nouvellesméthodes d’accès aléatoire pour résoudre les collisions entre les paquets et ainsi, améliorerles performances. En particulier, ces méthodes se basent sur la redondance de l’informationet l’annulation successive des interférences. Dans ces systèmes, l’estimation de canal sur le lien retour est un problème difficile en raison du haut niveau de collisions de paquets. Dans une première contribution dans cette thèse, nous décrivons une technique améliorée d’estimation de canal pour les paquets en collision. Par ailleurs, nous analysons l’impact des erreurs résiduelles d’estimation de canal sur la performance des annulations successives des interférences. Même si les résultats obtenus sont encore légèrement inférieurs au cas de connaissance parfaite du canal, on observe une amélioration significative des performances par rapport aux algorithmes d’estimation de canal existants. Une autre contribution de cette thèse présente une méthode appelée ‘Multi-Replica Decoding using Correlation based Localisation’ (MARSALA). Celle-ci est une nouvelle technique de décodage pour la méthode d’accès aléatoire synchrone ‘Contention Résolution diversité Slotted Aloha’ (CRDSA), qui est basée sur les principe de réplication de paquets et d’annulation successive des interférences. Comparée aux méthodes d’accès aléatoire traditionnelles, CRDSA permet d’améliorer considérablement les performances. Toutefois, le débit offert par CRDSA peut être limité à cause des fortes collisions de paquets. L’utilisation deMARSALA par le récepteur permet d’améliorer les résultats en appliquant des techniques de corrélation temporelles pour localiser et combiner les répliques d’un paquet donné. Cette procédure aboutit à des gains en termes de débit et de taux d’erreurs paquets. Néanmoins, le gain offert par MARSALAest fortement dépendant de la synchronisation en temps et en phase des répliques d’un mêmepaquet. Dans cette thèse, nous détaillons le fonctionnement de MARSALA afin de corriger ladésynchronisation en temps et en phase entre les répliques. De plus, nous évaluons l’impactde la combinaison imparfaite des répliques sur les performances, en fournissant un modèle analytique ainsi que des résultats de simulation. En outre, plusieurs schémas d’optimisationde MARSALA sont proposés tels que le principe du ‘MaximumRatio Combining’, ou la transmissiondes paquets à des puissances différentes. Utilisées conjointement, ces différentespropositions permettent d’obtenir une amélioration très significative des performances. Enfin,nous montrons qu’en choisissant la configuration optimale pour MARSALA, le gain deperformance est considérablement amélioré. / With the need to provide the Internet access to deprived areas and to cope with constantlyenlarging satellite networks, enhancing satellite communications becomes a crucial challenge.In this context, the use of Random Access (RA) techniques combined with dedicated accesson the satellite return link, can improve the system performance. However conventionalRA techniques like Aloha and Slotted Aloha suffer from a high packet loss rate caused bydestructive packet collisions. For this reason, those techniques are not well-suited for datatransmission in satellite communications. Therefore, researchers have been studying andproposing new RA techniques that can cope with packet collisions and decrease the packet lossratio. In particular, recent RA techniques involving information redundancy and successiveinterference cancellation, have shown some promising performance gains.With such methods that can function in high load regimes and resolve packets with high collisions,channel estimation is not an evident task. As a first contribution in this dissertation, wedescribe an improved channel estimation scheme for packets in collision in new RAmethodsin satellite communications. And we analyse the impact of residual channel estimation errorson the performance of interference cancellation. The results obtained show a performancedegradation compared to the perfect channel knowledge case, but provide a performanceenhancement compared to existing channel estimation algorithms. Another contribution of this thesis is presenting a method called Multi-Replica Decoding using Correlation based Localisation (MARSALA). MARSALA is a new decoding technique for a recent synchronous RAmethod called Contention Resolution Diversity Slotted Aloha (CRDSA). Based on packets replication and successive interference cancellation, CRDSA enables to significantly enhance the performance of legacy RA techniques. However, if CRDSA is unable to resolve additional packets due to high levels of collision, MARSALA is applied. At the receiver side, MARSALA takes advantage of correlation procedures to localise the replicas of a given packet, then combines the replicas in order to obtain a better Signal to Noise plus Interference Ratio. Nevertheless, the performance ofMARSALA is highly dependent on replicas synchronisation in timing and phase, otherwise replicas combination would not be constructive. In this dissertation, we describe an overall framework ofMARSALA including replicas timing and phase estimation and compensation, then channel estimation for theresulting signal. This dissertation also provides an analytical model for the performancedegradation of MARSALA due to imperfect replicas combination and channel estimation.In addition, several enhancement schemes forMARSALA are proposed likeMaximum RatioCombining, packets power unbalance, and various coding schemes. Finally, we show thatby choosing the optimal design configuration for MARSALA, the performance gain can besignificantly enhanced.
107

Scalable video compression with optimized visual performance and random accessibility

Leung, Raymond, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW January 2006 (has links)
This thesis is concerned with maximizing the coding efficiency, random accessibility and visual performance of scalable compressed video. The unifying theme behind this work is the use of finely embedded localized coding structures, which govern the extent to which these goals may be jointly achieved. The first part focuses on scalable volumetric image compression. We investigate 3D transform and coding techniques which exploit inter-slice statistical redundancies without compromising slice accessibility. Our study shows that the motion-compensated temporal discrete wavelet transform (MC-TDWT) practically achieves an upper bound to the compression efficiency of slice transforms. From a video coding perspective, we find that most of the coding gain is attributed to offsetting the learning penalty in adaptive arithmetic coding through 3D code-block extension, rather than inter-frame context modelling. The second aspect of this thesis examines random accessibility. Accessibility refers to the ease with which a region of interest is accessed (subband samples needed for reconstruction are retrieved) from a compressed video bitstream, subject to spatiotemporal code-block constraints. We investigate the fundamental implications of motion compensation for random access efficiency and the compression performance of scalable interactive video. We demonstrate that inclusion of motion compensation operators within the lifting steps of a temporal subband transform incurs a random access penalty which depends on the characteristics of the motion field. The final aspect of this thesis aims to minimize the perceptual impact of visible distortion in scalable reconstructed video. We present a visual optimization strategy based on distortion scaling which raises the distortion-length slope of perceptually significant samples. This alters the codestream embedding order during post-compression rate-distortion optimization, thus allowing visually sensitive sites to be encoded with higher fidelity at a given bit-rate. For visual sensitivity analysis, we propose a contrast perception model that incorporates an adaptive masking slope. This versatile feature provides a context which models perceptual significance. It enables scene structures that otherwise suffer significant degradation to be preserved at lower bit-rates. The novelty in our approach derives from a set of "perceptual mappings" which account for quantization noise shaping effects induced by motion-compensated temporal synthesis. The proposed technique reduces wavelet compression artefacts and improves the perceptual quality of video.
108

Bayesian Decoding for Improved Random Access in Compressed Video Streams

Ljungqvist, Martin January 2005 (has links)
<p>A channel change in digital television is usually conducted at a reference frame, which are sent at certain intervals. A higher compression ratio could however be obtained by sending reference frames at arbitrary long intervals. This would on the other hand increase the average channel change time for the end user. This thesis investigates various approaches for reducing the average channel change time while using arbitrary long intervals between reference frames, and presents an implementation and evaluation of one of these methods, called Baydec.</p><p>The approach of Baydec for solving the channel switch problem is to statistically estimate what the original image looked like, starting with an incoming P-frame and estimate an image between the original and current image. Baydec gathers statistical data from typical video sequences and calculates expected likelihood for estimation. Further on it uses the Simulated Annealing search method to maximise the likelihood function.</p><p>This method is more general than the requirements of this thesis. It is not only applicable to channel switches between video streams, but can also be used for random access in general. Baydec could also be used if an I-frame is dropped in a video stream.</p><p>However, Baydec has so far shown only theoretical result, but very small visual improvements. Baydec produces images with better PSNR than without the method in some cases, but the visual impression is not better than for the motion compensated residual images. Some examples of future work to improve Baydec is also presented.</p>
109

Synthesis and characterization of refractory oxides doped with transition metal ions

Cho, Suyeon 01 September 2011 (has links) (PDF)
In this study, the oxygen-deficient TiO2, SrTiO3 systems and transition metal ion (Cr or V) doped TiO2, SrTiO3 and SrZrO3 systems have been investigated. We prepared samples as polycrystals, single crystals and thin films for various desires. Their structural, physical and electronic properties were measured by bulk-sensitive techniques (X-Ray Diffraction, SQUID and Electro Paramagnetic Resonance) or surface-sensitive techniques (Photoemission spectroscopy and X-ray absorption spectroscopy). The measurement of SQUID and EPR showed not only their magnetic properties but also the valence state of Cr dopant. We verified the valence state of Cr ions in oxides and found the key parameters of sample synthesis which control the valence state of Cr ions. Segregated phases such as SrCrO4 were formed when the samples were synthesized under O2 rich environment. The surface properties of Cr doped SrZrO3 films are also discussed. We found the synthesis conditions which influence on not only the behavior of Cr ions but also the resistive-switching behaviors. Various resistive-switching behaviors seem to depend on the surface chemistry of films. We found that the accumulation of Cr3+ on film surface provides a clean interface without any non-stoichiometric oxides and that this sharp interface termination results in a good performance of resistive-switching.
110

TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE

Samara, Rafat January 2012 (has links)
Top-k and Skyline queries are a long study topic in database and information retrieval communities and they are two popular operations for preference retrieval. Top-k query returns a subset of the most relevant answers instead of all answers. Efficient top-k processing retrieves the k objects that have the highest overall score. In this paper, some algorithms that are used as a technique for efficient top-k processing for different scenarios have been represented. A framework based on existing algorithms with considering based cost optimization that works for these scenarios has been presented. This framework will be used when the user can determine the user ranking function. A real life scenario has been applied on this framework step by step. Skyline query returns a set of points that are not dominated (a record x dominates another record y if x is as good as y in all attributes and strictly better in at least one attribute) by other points in the given datasets. In this paper, some algorithms that are used for evaluating the skyline query have been introduced. One of the problems in the skyline query which is called curse of dimensionality has been presented. A new strategy that based on the skyline existing algorithms, skyline frequency and the binary tree strategy which gives a good solution for this problem has been presented. This new strategy will be used when the user cannot determine the user ranking function. A real life scenario is presented which apply this strategy step by step. Finally, the advantages of the top-k query have been applied on the skyline query in order to have a quickly and efficient retrieving results.

Page generated in 0.0704 seconds