• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4200
  • 1250
  • 510
  • 267
  • 200
  • 119
  • 91
  • 46
  • 45
  • 45
  • 45
  • 45
  • 45
  • 43
  • 35
  • Tagged with
  • 8420
  • 2437
  • 1620
  • 1142
  • 1110
  • 1108
  • 1052
  • 983
  • 926
  • 919
  • 875
  • 806
  • 734
  • 568
  • 527
  • 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.
161

Aspects of the statistical analysis of data from mixture distributions

Polymenis, Athanase January 1997 (has links)
No description available.
162

Sequential and parallel solutions of the convoy movement problem using branch-and-bound and heuristic hybrid techniques

Lee, Yin Nam January 1995 (has links)
No description available.
163

Automated examination timetabling

Weare, Rupert January 1995 (has links)
No description available.
164

On-line geometric control of a spray deposition process

Myerscough, James John January 1992 (has links)
No description available.
165

Efficient practical image compression

Fawcett, Roger James January 1995 (has links)
No description available.
166

Failure detection and isolation in decentralised multisensor systems

Fernández, Mariano January 1994 (has links)
No description available.
167

Partial dynamic reconfiguration of FPGAs for systolic circuits

Cadenas Medina, Oswaldo January 2002 (has links)
No description available.
168

Managing surface ambiguity in the generation of referring expressions

Khan, Imtiaz Hussain January 2010 (has links)
Managing Surface Ambiguity in the Generation of Referring Expressions (Imtiaz Hussain Khan) Most algorithms for the Generation of Referring Expressions tend to generate distinguishing descriptions at the semantic level, disregarding the ways in which surface issues can affect their quality. This thesis explores the role of surface ambiguities in referring expressions and how the risk of such ambiguities should be taken into account by an algorithm that generates referring expressions. This was done by focussing on the type of surface ambiguity which arises when adjectives occur in coordinated structures (as in the old men and women). The central idea is to use statistical information about lexical co-occurrence to estimate which interpretation of a phrase is most likely for human readers, and to avoid generating phrases where misunderstandings are likely. We develop specific hypotheses, and test them by running experiments with human participants. We found that the Word Sketches are a reliable source of information to predict the likelihood of a reading. The avoidance of misunderstandings is not the only issue to be dealt with in this thesis. Since the avoidance of misunderstandings might be achieved at the cost of very lengthy (or perhaps very disfluent) expressions, it is important to select an optimal expression (i.e., the expression which is preferred by most readers) from various alternatives available. Again, we develop specific hypotheses, and recorded human preferences in a forced-choice manner. We found that participants preferred clear (i.e., not likely to be misunderstood) expressions to unclear ones, but if several of the expressions were clear then brief expressions were preferred over their longer counterparts. The results of these empirical studies motivated the design of a GRE algorithm. The implemented algorithm builds a plural distinguishing description for the intended referents (if one exists), using words; applies transformation rules to the distinguishing description to construct a set of distinguishing descriptions that are logically equivalent. Each description in the set is realised as a corresponding English noun phrase (NP) using appropriate realisation rules; the most likely reading of each NP is determined. One NP is selected for output. A further experiment verifies that the kinds of expressions produced by the algorithm are optimal for readers: they are understood accurately and quickly by readers.
169

MACHINE CONDITION MONITORING USING NEURAL NETWORKS: FEATURE SELECTION USING GENETIC ALGORITHM

Hippolyte, Djonon Tsague 26 February 2007 (has links)
Student Number : 9800233A - MSc dissertation - School of Electrical and Information Engineering - Faculty of Engineering and the Built Environment / Condition monitoring of machinery has increased in importance as more engineering processes are automated and the manpower required to operate and supervise plants is reduced. The monitoring of the condition of machinery can significantly reduce the cost of maintenance. Firstly, it can allow an early detection of potential catastrophic fault, which could be extremely expensive to repair. Secondly, it allows the implementation of conditions based maintenance rather than periodic or failure based maintenance [1]. In these cases, significant savings can be made by delaying schedule maintenance until convenient or necessary. Although there are numerous efficient methods for modeling of mechanical systems, they all suffer the disadvantage that they are only valid for a particular machine. Changes within the design or the operational mode of the machine normally require a manual adaptation. Using Neural Networks to model technical systems eliminates this major disadvantage. The basis for a successful model is an adequate knowledge base on which the network is "trained". Without prior knowledge of the machines systematic behavior or its history, training of a neural Network is not possible. Therefore, it is a pre-requisite that the knowledge base contains a complete behavior of the machine covering the respective operational modes whereby, not all rather the most important modes are required. Neural networks have a proven ability in the area of nonlinear pattern classification. After being trained, they contain expert knowledge and can correctly identify the different causes of bearing vibration. The capacity of artificial neural networks to mimic and automate human expertise is what makes them ideally suited for handling nonlinear systems. Neural networks are able to learn expert knowledge by being trained using a representative set of data [2]-[6]. At the beginning of a neural network’s training session, the neural network fault detector’s diagnosis of the motor’s condition will not be accurate. An error quantity is measured and used to adjust the neural network’s internal parameters in order to produce a more accurate output. This process is repeated until a suitable error is achieved. Once the network is sufficiently trained and the parameters have been saved, the neural network contains all the necessary knowledge to perform the fault detection. One of the most important aspects of achieving good neural network performance has proven to be the proper selection of training features. The curse of dimensionality states that, as a rule of thumb, the required cardinality of the training set for accurate training increases exponentially with the input dimension [7]. Thus feature selection which is a process of identifying those features that contribute most to the discrimination ability of the neural network is required. Proposed methods for selecting an appropriate subset of features are numerous [8]-[11]. Methods based on generating a single solution, such as the popular forward step wise approach, can fail to select features which do poorly alone but offer valuable information together. Approaches that maintain a population of solutions, such as genetic algorithms (GA) are more likely to speedily perform efficient searches in high dimensional spaces, with strong interdependencies among the features. The emphasis in using the genetic algorithm for feature selection is to reduce the computational load on the training system while still allowing near optimal results to be found relatively quickly. To obtain accurate measure of the condition of machinery, a wide range of approaches can be employed to select features indicative of condition. By comparing these features with features for known normal and probable fault conditions, the machine’s condition can be estimated. The most common approach is that of analysis in the frequency domain by applying a Fast Fourier Transform (FFT) to the time domain history data. The idea is simply to measure the energy (mean square value) of the vibrations. As the machine condition deteriorates, this measure is expected to increase. The method is able to reveal the harmonics around the fundamental frequency of the machine and other predominant frequency component (such as the cage frequency) [12]. Frequency analysis is well established and may be used to detect, diagnose and discriminate a variety of induction motor faults such as broken rotor bars, cage faults, phase imbalance, inner and outer race faults. However, as common in the monitoring of any industrial machine, background noise in recorded data can make spectra difficult to interpret. In addition, the accuracy of a spectrum is limited due to energy leakage [12- 14]. Like many of the new techniques now finding application in machinery condition monitoring, Higher Order Statistics was originally confined to the realms of non-linear structural dynamics. It has of recent however found successful application to the identification of abnormal operation of diesel engines and helicopter gearboxes [5, 7]. Higher Order Statistics provide convenient basis for comparison of data between different measurement instances and are sufficiently robust for on-line use. They are fast in computation compared with frequency or time-domain analysis. Furthermore, they give a more robust assessment than lower orders and can be used to calculate higher order spectra. This dissertation reports work which attempts to extend this capability to induction motors. The aim of this project is therefore to examine the use of Genetic Algorithms to select the most significant input features from a large set of possible features in machine condition monitoring contexts. The results show the effectiveness of the selected features from the acquired raw and preprocessed signals in diagnosis of machine condition. This project consists of the following tasks: #1; Using Fast Fourier transform and higher order signals techniques to preprocess data samples. #1; Create an intelligent engine using computational intelligence methods. The aim of this engine will be to recognize faulty bearings and assess the fault severity from sensor data. #1; Train the neural network using a back propagation algorithm. #1; Implement a feature selection algorithm using genetic algorithms to minimize the number of selected features and to maximize the performance of the neural network. #1; Retrain the neural network with the reduced set of features from genetic algorithm and compare the two approaches. #1; Investigate the effect of increasing the number of hidden nodes in the performance of the computational intelligence engine. #1; Evaluate the performance of the system using confusion matrices. The output of the design is the estimate of fault type and its severity, quantified on a scale between 0-3. Where, 0 corresponds to the absence of the specific fault and 3 the presence of a severe machine bearing fault. This research should make contribution to many sectors of industry such as electricity supply companies, and the railroad industry due to their need of techniques that are capable of accurately recognizing the development of a fault condition within a machine system component. Quality control of electric motors is an essential part of the manufacturing process as competition increases, the need for reliable and economical quality control becomes even more pressing. To this effect, this research project will contribute in the area of faults detection in the production line of electric motor.
170

Classical and parameterized complexity of cliques and games

Scott, Allan Edward Jolicoeur 10 April 2008 (has links)
No description available.

Page generated in 0.2176 seconds