• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 64
  • 9
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 108
  • 108
  • 22
  • 20
  • 19
  • 18
  • 16
  • 14
  • 10
  • 10
  • 10
  • 8
  • 8
  • 8
  • 8
  • 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.
71

Characterization & detection of electric Arc Detection in Low-Voltage IEC Networks / Caractérisation et détection d’arcs électriques dans un réseau basse tension IEC

Vasile, Costin 12 April 2018 (has links)
Contexte & Motivation:Les installations électriques des bâtiments se détériorent au fil du temps et leur gravité et leur taux de détérioration dépendent de facteurs environnementaux (chaleur, humidité, réactions chimiques corrosives et vieillies isolations) ou d'actions externes indésirables telles que la manipulation humaine erronée, qui conduit à des charges ou des câbles/réseaux endommagés.L'European Fire Academy (EFA) et de nombreuses compagnies d'assurance indiquent que 25% des incendies de bâtiments sont d'origine électrique. Ces incendies peuvent être déclenchés par des circuits surchargés, des court-circuits, des courants de fuite à la terre, des surtensions et / ou des défauts d'arc électrique dans les connexions et les câbles.Les protections électriques classiques telles que les disjoncteurs et les disjoncteurs différentiels offrent une protection insuffisante. Par exemple, en cas de défauts d'arcs en série, la valeur du courant de défaut d'arc reste inférieure à la valeur du courant nominal, car elle est limitée par la résistance du carbone généré par le défaut d'arc. Dans ce cas, toute protection existante peut détecter ce type de faute.Détection de défaut d'arc : approche de traitement du signalDans le cadre de ce travail, l'objectif a été de détecter chaque instant d'arc, ce qui, pour un réseau alternatif, permettrait d'identifier correctement chaque arc dans chaque demi-cycle de réseau où il se produit.En fonction de la caractéristique numérique utilisée à des fins de détection, nous avons introduit différentes classes de méthodes:• Caractéristiques énergétiques (bandes étroite et large bande)• Caractéristiques statistiques (moments statistiques, analyse de la corrélation etc.)• Caractéristiques basées sur un model (ex. modelés AR, ARMA etc.)• Caractéristiques data-driven (utiliser Phase Space Embedding pour les séries temporelles)Chaque approche a été testée et évaluée sur une base de données de signaux construite avec soin, capable de fournir la variabilité du monde réel, dans un cadre d'évaluation statistique qui permet de trouver des seuils appropriés et leurs plages associées. Il donne également des performances relatives, d'une fonctionnalité à l'autre, en fonction de la façon dont les plages de seuils couvrent tout l'espace des caractéristiques.Une approche prometteuse est montrée avec un résultat intermédiaire sur la figure 8. La configuration est plutôt courante, avec une charge résistive (R-Load) en fonctionnement normal, avec un gradateur allumé et ajouté dans la configuration et un arc persistant apparaissant dans le circuit.Il suffit d'analyser simplement la forme d'onde du courant 50 Hz, car même lors d'une simple inspection visuelle, il est difficile d'identifier l'origine du défaut d'arc et s'il est stable ou s'il s'éteint après (ou où). En mesurant correctement le bruit de défaut d'arc haute fréquence et en sélectionnant correctement la bande passante, nous parvenons à obtenir un signal beaucoup plus facile à traiter. L'arc est difficile à détecter en raison de la variation de l'intensité énergétique d'un réseau à l'autre (encore plus: pour un même réseau, ajouter / enlever des charges ou des rallonges modifie la distribution d'amplitude et de fréquence de l'arc). Par conséquent, nous exploitons le caractère aléatoire intrinsèque de l'arc, ce qui permet une variabilité suffisante d'une réalisation d'arc à une autre.En conclusion, nous proposons une nouvelle méthodologie de traitement du signal pour la détection des défauts d'arc, à mettre en œuvre dans un algorithme de produit AFDD. En outre, une autre approche est présentée, basée sur l'analyse de diagramme de phase, qui permet la séparation entre les arcs et les signaux de communication, ce qui est également un grand défi dans ce domaine. / Context & Motivation:Electrical installations in buildings deteriorate, over time and the severity and rate of deterioration depend on environmental factors (such as heat, humidity, corrosive chemical reactions and aging insulations) and unwanted external actions (such as human mishandling, that leads to damaged devices or cables/network).Caution is mandatory when handling electrical installations, seeing that potential hazards include electric shocks, burns, explosions and fire, if proper safety precautions are ignored or neglected. The European Fire Academy (EFA) and many property and casualty insurance companies report that 25% of building fires are electrical in origin. These fires can be triggered by overloaded circuits, short-circuits, earth leakage currents, overvoltage and/or electrical arc faults in connections and cables.Classical electrical protection such as circuit breakers and RCDs offer insufficient protection. For example, in case of series arc faults, the arc fault current value remains below the rated current value, since it is limited by the resistance of the carbon generated by the arc fault and by the load itself. In this case, no existing protection can detect such kind of fault.Arc Fault Detection: Signal Processing ApproachIn the context of this work, the objective has been to detect each instant of arcing, which for an AC network, would mean correctly identifying each arcing in each network half-cycle where it occurs.Depending on the numerical feature used for detection purposes, we introduced different classes of methods:• Energy-related features (narrow and wideband)• Statistical features (statistical moments, correlation analysis etc.)• Model-based features (using numerical models, such as AR, for example)• Data-driven features (using Phase Space Embedding for time series)Each approach has been tested & evaluated on a carefully constructed signal database, capable of supplying real-world variability, within a statistical evaluation framework which enables finding suitable thresholds and their appropriate ranges. It also gives relative performances, from one feature to another, based on how threshold ranges cover the entire feature space.A promising approach is shown with an intermediary result in Figure 9. The configuration is rather common, with a resistive load (R – Load) in normal operation, with a dimmer being turned on and added in the configuration and a persistent arc appearing in the circuit.Figure 9 Resistive load, dimmer and persistent arcing – processing result (example).Simply analyzing the 50Hz line current waveform is insufficient, as even at a simple visual inspection there is difficulty in identifying where the arc fault ignites and if it is a stable one, or if it extinguishes afterwards (or where). By correctly measuring the high frequency arc fault noise and with correct selection of the bandwidth, we manage to obtain a signal much easier to process further on. Arcing is inherently difficult to detect, due to high frequency energy intensity variation from one network to another (even more: for the same network, adding/removing loads or extension cords will change the amplitude and frequency distribution of the arc fault energy). Therefore, we exploit the intrinsic randomness of arcing, which enables sufficient variability from one arcing realization to another.To conclude, we propose a new signal processing methodology for arc fault detection, to be implemented in an AFDD product algorithm. Also, another approach is presented, based on phase diagram analysis, that allows the separation between the arcs and communication signals, which is also a great challenge in this field.
72

Estatísticas de ordem superior para detecção, classificação e identificação de distúrbios de qualidade de energia elétrica

Moreira, Mariana Geny 31 May 2016 (has links)
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-04-26T13:23:08Z No. of bitstreams: 1 marianagenymoreira.pdf: 8374988 bytes, checksum: 38a7b2c61f3df104e6c9f034df1386ae (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-04-26T13:53:43Z (GMT) No. of bitstreams: 1 marianagenymoreira.pdf: 8374988 bytes, checksum: 38a7b2c61f3df104e6c9f034df1386ae (MD5) / Made available in DSpace on 2017-04-26T13:53:43Z (GMT). No. of bitstreams: 1 marianagenymoreira.pdf: 8374988 bytes, checksum: 38a7b2c61f3df104e6c9f034df1386ae (MD5) Previous issue date: 2016-05-31 / Nas últimas décadas a qualidade da energia elétrica disponibilizada na rede elétrica tornou-se foco. Este fato é justificado pela combinação dos aumentos da poluição dos sinais na rede e do número de dispositivos eletrônicos sensíveis às variações do sinal de alimentação, especialmente tendo em vista o novo cenário de redes inteligentes. Um dos desafios das redes inteligentes é a redução de eventos ou falhas devido à baixa qualidade de energia elétrica, principalmente envolvendo distúrbios harmônicos e inter-harmônicos, provocados pela utilização de cargas e sistemas eletrônicos. Os impactos e prejuízos causados por distúrbios harmônicos e inter-harmônicos são importantes o suficiente para torná-los foco de inúmeros estudos, posto que não há, até a presente data, um método de análise desses componentes eficiente o bastante para atuar no controle e proteção de sistemas de potência. Este trabalho busca contribuir para a melhoria da análise desses componentes de frequência e, nesse sentido, propõe um sistema de detecção, classificação e identificação de distúrbios de qualidade de energia, especialmente, harmônicos, sub-harmônicos e inter harmônicos, baseado em estatística de ordem superior. São contemplados ainda distúrbios de amplitude de curta duração: sags e swells. A estrutura proposta contempla ainda um contador de componentes inter-harmônicos e sub-harmônicos, capaz de apontar a existência e quantificar esses componentes mesmo quando combinados a outros distúrbios harmônicos. As metodologias propostas pelo trabalho exibem resultados bastante expressivos tanto em relação à eficiência das aplicações em qualidade de energia quanto em relação ao desempenho computacional. / The power quality available on the electrical power system became focus in the last decades. This fact is explained by the combination of signal pollutions increasing and the number of electronic devices sensitive to power signal variations, especially in the smart grids scenario. One of the challenges of smart grids is the reduction of events or failures due to the low power quality, mainly involving harmonics and inter-harmonics disturbances, caused by the use of fillers and electronic systems. Impacts and losses caused by these disturbances are of great concern in numerous studies, since there is not an efficient analysis method capable of dealing with this kind of disturbances. This thesis seeks to contribute in the sense of harmonics and inter-harmonics analysis by proposing a power quality disturbances detection, classification and identification system, based on higher order statistics. The proposed structure also includes a inter-harmonics and sub-harmonics components counter, able to point out the existence and to quantify these components even when they are combined with other harmonic disturbances. The proposed methodologies show suitable results both in terms of efficiency of investments in power quality as compared to the computational performance.
73

Application of Inter-Die Rank Statistics in Defect Detection

Bakshi, Vivek 01 March 2012 (has links)
This thesis presents a statistical method to identify the test escapes. Test often acquires parametric measurements as a function of logical state of a chip. The usual method of classifying chips as pass or fail is to compare each state measurement to a test limit. Subtle manufacturing defects are escaping the test limits due to process variations in deep sub-micron technologies which results in mixing of healthy and faulty parametric test measurements. This thesis identifies the chips with subtle defects by using rank order of the parametric measurements. A hypothesis is developed that a defect is likely to disturb the defect-free ranking, whereas a shift caused by process variations will not affect the rank. The hypothesis does not depend on a-priori knowledge of a defect-free ranking of parametric measurements. This thesis introduces a modified Estimation Maximization (EM) algorithm to separate the healthy and faulty tau components calculated from parametric responses of die pairs on a wafer. The modified EM uses generalized beta distributions to model the two components of tau mixture distribution. The modified EM estimates the faulty probability of each die on a wafer. The sensitivity of the modified EM is evaluated using Monte Carlo simulations. The modified EM is applied on production product A. An average 30% reduction in DPPM (defective parts per million) is observed in Product A across all lots.
74

The Interquartile Range: Theory and Estimation.

Whaley, Dewey Lonzo 16 August 2005 (has links) (PDF)
The interquartile range (IQR) is used to describe the spread of a distribution. In an introductory statistics course, the IQR might be introduced as simply the “range within which the middle half of the data points lie.” In other words, it is the distance between the two quartiles, IQR = Q3 - Q1. We will compute the population IQR, the expected value, and the variance of the sample IQR for various continuous distributions. In addition, a bootstrap confidence interval for the population IQR will be evaluated.
75

Study of Generalized Lomax Distribution and Change Point Problem

Alghamdi, Amani Saeed 23 July 2018 (has links)
No description available.
76

A Parametric Test for Trend Based on Moving Order Statistics

Tan, Tao 10 1900 (has links)
<p>When researchers work on time series or sequence, certain fundamental questions will naturally arise. One of them will be whether the series or sequence exhibits a gradual trend over time. In this thesis, we propose a test statistic based on moving order statistics and establish an exact procedure to test for the presence of monotone trends. We show that the test statistic under the null hypothesis that there is no trend follows the closed skew normal distribution. An efficient algorithm is then developed to generate realizations from this null distribution. A simulation study is conducted to evaluate the proposed test under the alternative hypotheses with linear, logarithmic and quadratic trend functions. Finally, a practical example is provided to illustrate the proposed test procedure.</p> / Master of Science (MSc)
77

On the theory of records and applications

Mbah, Alfred Kubong 01 June 2007 (has links)
No description available.
78

Signal processing techniques for modern radar systems

Elhoshy, Mostafa Kamal Kamel 07 August 2019 (has links)
This dissertation considers radar detection and tracking of weak fluctuating targets using dynamic programming (DP) based track-before-detect (TBD). TBD combines target detection and tracking by integrating data over consecutive scans before making a decision on the presence of a target. A novel algorithm is proposed which employs order statistics in dynamic programming based TBD (OS-DP-TBD) to detect weak fluctuating targets. The well-known Swerling type 0, 1 and 3 targets are considered with non-Gaussian distributed clutter and complex Gaussian noise. The clutter is modeled using the Weibull, K and G0 distributions. The proposed algorithm is shown to provide better performance than well-known techniques in the literature. In addition, a novel expanding window multiframe (EW-TBD) technique is presented to improve the detection performance with reasonable computational complexity compared to batch processing. It is shown that EW-TBD has lower complexity than existing multiframe processing techniques. Simulation results are presented which confirm the superiority of the proposed expanding window technique in detecting targets even when they are not present in every scan in the window. Further, the throughput of the proposed technique is higher than with batch processing. Depending on the range and azimuth resolution of the radar system, the target may appear as a point in some radar systems and there will be target energy spillover in other systems. This dissertation considers both extended targets with different energy spillover levels and point targets. Simulation results are presented which confirm the superiority of the proposed algorithm in both cases. / Graduate
79

Estima e igualación ciega de canales MIMO con y sin redundancia espacial

Vía Rodríguez, Javier 02 July 2007 (has links)
La mayor parte de los sistemas de comunicaciones requieren el conocimiento previo del canal, el cual se suele estimar a partir de una secuencia de entrenamiento. Sin embargo, la transmisión de símbolos piloto se traduce en una reducción de la eficiencia espectral del sistema, lo que imposibilita que se alcancen los límites predichos por la Teoría de la Información. Este problema ha motivado el desarrollo de un gran número de técnicas para la estima e igualación ciega de canal, es decir, para la obtención del canal o la fuente sin necesidad de transmitir una señal de entrenamiento. Normalmente, estas técnicas se basan en el conocimiento previo de ciertas características de la señal, tales como su pertenencia a un alfabeto finito, o sus estadísticos de orden superior. Sin embargo, en el caso de sistemas de múltiples entradas y salidas (MIMO), se ha demostrado que los estadísticos de segundo orden de las observaciones proporcionan la información suficiente para resolver el problema ciego.El objetivo de esta Tesis consiste en la obtención de nuevas técnicas para la estima e igualación ciega de canales MIMO, tanto en sistemas con redundancia espacial, como en casos más generales en los que las fuentes no presentan ningún tipo particular de estructura. De manera general, los métodos propuestos se basan en los estadísticos de segundo orden de las observaciones. Sin embargo, las técnicas se presentan desde un punto de vista determinista, es decir, los algoritmos propuestos explotan directamente la estructura de las matrices de datos, lo que permite obtener resultados más precisos cuando se dispone de un número reducido de observaciones. Adicionalmente, la reformulación de los criterios propuestos como problemas clásicos del análisis estadístico de señales, ha permitido la obtención de algoritmos adaptativos eficientes para la estima e igualación de canales MIMO. En primer lugar se aborda el caso de sistemas sin redundancia. Más concretamente, se analiza el problema de igualación ciega de canales MIMO selectivos en frecuencia, el cual se reformula como un conjunto de problemas de análisis de correlaciones canónicas (CCA). La solución de los problemas CCA se puede obtener de manera directa mediante un problema de autovalores generalizado. Además, en esta Tesis se presenta un algoritmo adaptativo basado en la reformulación de CCA como un conjunto de problemas de regresión lineal acoplados. De esta manera, se obtienen nuevos algoritmos bloque y adaptativos para la igualación ciega de canales MIMO de una manera sencilla. Finalmente, el método propuesto se basa, como muchas otras técnicas ciegas, en el conocimiento a priori del orden del canal, lo que constituye un problema casi tan complicado como el de la estima o igualación ciega. Así, en el caso de canales de una entrada y varias salidas (SIMO), la combinación de la técnica propuesta con otros métodos para la estima ciega del canal permite obtener un nuevo criterio para extracción del orden de este tipo de canalesEn segundo lugar se considera el problema de estima ciega de canal en sistemas con algún tipo de redundancia o estructura espacial, con especial interés en el caso de sistemas con codificación espacio-temporal por bloques (STBC). Específicamente, se propone una nueva técnica para la estima ciega del canal, cuya complejidad se reduce a la extracción del autovector principal de una matriz de correlación modificada. El principal problema asociado a este tipo de sistemas viene dado por la existencia de ciertas ambigüedades a la hora de estimar el canal. En esta Tesis se plantea el problema de identificabilidad de una manera general, y en el caso de códigos ortogonales (OSTBCs) se presentan varios nuevos teoremas que aseguran la identificabilidad del canal en un gran número de casos. Adicionalmente, se proponen varias técnicas para la resolución de las ambigüedades, tanto en el caso OSTBC como para códigos más generales. En concreto, se introduce el concepto de diversidad de código, que consiste en la combinación de varios códigos STBC. Esta técnica permite resolver las indeterminaciones asociadas a un gran número de problemas, y en su versión más sencilla se reduce a una precodificación no redundante consistente en una simple rotación o permutación de las antenas transmisoras.En definitiva, en esta Tesis se abordan los problemas de estima e igualación ciega de canal en sistemas MIMO, y se presentan varias técnicas ciegas, cuyas prestaciones se evalúan mediante un gran número de ejemplos de simulación. / The majority of communication systems need the previous knowledge of the channel, which is usually estimated by means of a training sequence. However, the transmission of pilot symbols provokes a reduction in bandwidth efficiency, which precludes the system from reaching the limits predicted by the Information Theory. This problem has motivated the development of a large number of blind channel estimation and equalization techniques, which are able to obtain the channel or the source without the need of transmitting a training signal. Usually, these techniques are based on the previous knowledge of certain properties of the signal, such as its belonging to a finite alphabet, or its higher-order statistics. However, in the case of multiple-input multiple-output (MIMO) systems, it has been proven that the second order statistics of the observations provide the sufficient information for solving the blind problem.The aim of this Thesis is the development of new blind MIMO channel estimation and equalization techniques, both in systems with spatial redundancy, and in more general cases where the sources do not have any particular spatial structure. In general, the proposed methods are based on the second order statistics of the observations. However, the techniques are presented from a deterministic point of view, i.e., the proposed algorithms directly exploit the structure of the data matrices, which allows us to obtain more accurate results when only a reduced number of observations is available. Additionally, the reformulation of the proposed criteria as classical statistical signal processing problems is exploited to obtain efficient adaptive algorithms for MIMO channel estimation and equalization.Firstly, we consider the case of systems without spatial redundancy. Specifically, we analyze the problem of blind equalization of frequency selective MIMO channels, which is reformulated as a set of canonical correlation analysis (CCA) problems. The solution of the CCA problems can be obtained by means of a generalized eigenvalue problem. In this Thesis, we present a new adaptive algorithm based on the reformulation of CCA as a set of coupled linear regression problems. Therefore, new batch and adaptive algorithms for blind MIMO channel equalization are easily obtained. Finally, the proposed method, as well as many other blind techniques, is based on the previous knowledge of the channel order, which is a problem nearly as complicated as the blind channel estimation or equalization. Thus, in the case of single-input multiple-output (SIMO) channels, the combination of the proposed technique with other blind channel estimation methods provides a new criterion for the order extraction of this class of channels.Secondly, we consider the problem of blind channel estimation in systems with some kind of redundancy or spatial structure, with special interest in space-time block coded (STBC) systems. Specifically, a new blind channel estimation technique is proposed, whose computational complexity reduces to the extraction of the principal eigenvector of a modified correlation matrix. The main problem in these cases is due to the existence of certain ambiguities associated to the blind channel estimation problem. In this Thesis the general identifiability problem is formulated and, in the case of orthogonal codes (OSTBCs), we present several new theorems which ensure the channel identifiability in a large number of cases. Additionally, several techniques for the resolution of the ambiguities are proposed, both in the OSTBC case as well as for more general codes. In particular, we introduce the concept of code diversity, which consists in the combination of several STBCs. This technique avoids the ambiguities associated to a large number of problems, and in its simplest version it reduces to a non-redundant precoding consisting of a single rotation or permutation of the transmit antennas.In summary, in this Thesis the blind MIMO channel estimation and equalization problems are analyzed, and several blind techniques are presented, whose performance is evaluated by means of a large number of simulation examples.
80

Throughput Scaling Laws in Point-to-Multipoint Cognitive Networks

Jamal, Nadia 07 1900 (has links)
Simultaneous operation of different wireless applications in the same geographical region and the same frequency band gives rise to undesired interference issues. Since licensed (primary) applications have been granted priority access to the frequency spectrum, unlicensed (secondary) services should avoid imposing interference on the primary system. In other words, secondary system’s activity in the same bands should be in a controlled fashion so that the primary system maintains its quality of service (QoS) requirements. In this thesis, we consider collocated point-to-multipoint primary and secondary networks that have simultaneous access to the same frequency band. Particularly, we examine three different levels at which the two networks may coexist: pure interference, asymmetric co-existence, and symmetric co-existence levels. At the pure interference level, both networks operate simultaneously regardless of their interference to each other. At the other two levels, at least one of the networks attempts to mitigate its interference to the other network by deactivating some of its users. Specifically, at the asymmetric co-existence level, the secondary network selectively deactivates its users based on knowledge of the interference and channel gains, whereas at the symmetric level, the primary network also schedules its users in the same way. Our aim is to derive optimal sum-rates (i.e., throughputs) of both networks at each co-existence level as the number of users grows asymptotically and evaluate how the sum-rates scale with the network size. In order to find the asymptotic throughput results, we derive two propositions; one on the asymptotic behaviour of the largest order statistic and one on the asymptotic behaviour of the sum of lower order statistics. As a baseline comparison, we calculate primary and secondary sum-rates for the time division (TD) channel sharing. Then, we compare the asymptotic secondary sum-rate in TD to that under simultaneous channel sharing, while ensuring the primary network maintains the same sum-rate in both cases. Our results indicate that simultaneous channel sharing at both asymmetric and symmetric co-existence levels can outperform TD. Furthermore, this enhancement is achievable when user scheduling in uplink mode is based only on the interference gains to the opposite network and not on a network’s own channel gains. In other words, the optimal secondary sum-rate is achievable by applying a scheduling strategy, referred to as the least interference strategy, for which only the knowledge of interference gains is required and can be performed in a distributed way.

Page generated in 0.068 seconds