Dissertations / Theses on the topic 'Systems methods'
To see the other types of publications on this topic, follow the link: Systems methods.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Systems methods.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Moorhouse, Thomas. "Methods for integrable systems." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5484/.
Full textAbstract:
This work concerns the study of certain methods for investigating integrable systems, and the application of these methods to specific problems and examples. After introducing the notion of integrability in chapters 1 and 2, we go on, in chapter 3, to develop a novel type of discrete integrable equation by considering ways of enforcing Leibniz's rule for finite difference operators. We look at several approaches to the problem, derive some solutions and study several examples. Chapter 4 describes a numerical implementation of a method for solving initial value problems for an integrable equation in 2+1 dimensions, exploiting the integrability of the equation. The introduction of twisters enables a powerful scheme to be developed. In chapter 5 Darboux transformations derived from the factorisation of a scattering problem are examined, and a general operator form considered. The topic of chapter 6 is the relationship between the Darboux transform for the sine-Gordon and related equations and certain ansatze established by twistor methods. Finally in chapter 7 a geometric setting for partial differential equations is introduced and used to investigate the structure of Bäcklund transformations and generalised symmetries.
2
Wistrand, Kai. "Method rationale revealed : communication of knowledge in systems development methods." Doctoral thesis, Örebro universitet, Handelshögskolan vid Örebro universitet, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-6180.
Full textAbstract:
The practice of developing information systems with the support of information systems development methods is not new. A vast number of systems development methods have been suggested over the years in an attempt to solve the problems a development organisation might encounter. From early approaches like the Waterfall model to more modern monolithic methods such as the Rational Unified Process and the newest approaches exemplified in the Agile methods, the ambition has often been to find the silver bullet and the most effective ways to produce quality systems. Methods are prescriptive by nature as they suggest action and as such they represent rationale. Thus, one can speak of a method rationale as the dimension within methods that motivate their existence. Method rationale is understood as the goal and value rational relations between a method’s underlying philosophy and its proposed actions. During the methods’ evolution, the practice of systems development and the supporting systems development methods have been subjected to research from many perspectives. One possible way to understand the nature of the existing research is to separate it into two fields. The suggested fields have different strengths and weaknesses. The field of traditional research on information systems development (ISD) emphasise relevance in their studies but often overlook aspects of generalisation. The field of method engineering (ME) is highly formalistic and emphasise rigour but often miss aspects concerning relevance, such as the role methods play in peoples daily systems development efforts. In this dissertation, a polarisation of existing systems development method research is suggested in order to find a synthesis more capable of serving as a common ground for method research and for the understanding of the systems development method phenomenon. This is achieved through a proposed extension of the field of ME into the field of extended method engineering (EME). The foundation of the EME is found in the concept of method rationale and a method component concept design capable of carrying and expressing method rationale. The method component concept design is applied, evaluated, and re-designed in three different empirical settings in order to ascertain its practical potential and the benefits in explicating the dimension of method rationale.
3
Zhou, Ning. "Subspace methods of system identification applied to power systems." Laramie, Wyo. : University of Wyoming, 2005. http://proquest.umi.com/pqdweb?did=1095432761&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Full text
4
Mason, Douglas Joseph. "Analytical Methods in Mesoscopic Systems." Thesis, Harvard University, 2012. http://dissertations.umi.com/gsas.harvard:10548.
Full textAbstract:
The propsect of designing technologies around the quantum behavior of mesoscopic devices is enticing. This thesis present several tools to facilitate the process of calculating and analyzing the quantum properties of such devices – resonance, boundary conditions, and the quantum-classical correspondence are major themes that we study with these tools. In Chapter 1, we begin by laying the groundwork for the tools that follow by defining the Hamiltonian, the Green’s function, the scattering matrix, and the Landauer formalism for ballistic conduction. In Chapter 2, we present an efficient and easy-to-implement algorithm called the Outward Wave Algorithm, which calculates the conductance function and scattering density matrix when a system is coupled to an environment in a variety of geometries and contexts beyond the simple two-lead schematic. In Chapter 3, we present a unique geometry and numerical method called the Boundary Reflectin Matrix that allows us to calculate the full scattering matrix from arbitrary boundaries of a lattice system, and introduce the phenomenon of internal Bragg diffraction. In Chapter 4, we present a new method for visualizing wavefunctions called the Husimi map, which uses measurement by coherent states to form a bridge between the quantum flux operator and semiclassics. We extend the formalism from Chapter 4 to lattice systems in Chapter 5, and comment on our results in Chapter 3 and other work in the literature. These three tools – the Outward Wave Algorithm, the Boundary Reflection Matrix, and the Husimi map – work together to throw light on our interpretation of resonance and scattering in quantum systems, effectively codifying the expertise developed in semiclassics over the past few decades in an efficient and robust package. The data and images that they make available promise to help design better technologies based on quantum scattering.Physics
5
Ashi, Hala. "Numerical methods for stiff systems." Thesis, University of Nottingham, 2008. http://eprints.nottingham.ac.uk/10663/.
Full textAbstract:
Some real-world applications involve situations where different physical phenomena acting on very different time scales occur simultaneously. The partial differential equations (PDEs) governing such situations are categorized as "stiff" PDEs. Stiffness is a challenging property of differential equations (DEs) that prevents conventional explicit numerical integrators from handling a problem efficiently. For such cases, stability (rather than accuracy) requirements dictate the choice of time step size to be very small. Considerable effort in coping with stiffness has gone into developing time-discretization methods to overcome many of the constraints of the conventional methods. Recently, there has been a renewed interest in exponential integrators that have emerged as a viable alternative for dealing effectively with stiffness of DEs. Our attention has been focused on the explicit Exponential Time Differencing (ETD) integrators that are designed to solve stiff semi-linear problems. Semi-linear PDEs can be split into a linear part, which contains the stiffest part of the dynamics of the problem, and a nonlinear part, which varies more slowly than the linear part. The ETD methods solve the linear part exactly, and then explicitly approximate the remaining part by polynomial approximations. The first aspect of this project involves an analytical examination of the methods' stability properties in order to present the advantage of these methods in overcoming the stability constraints. Furthermore, we discuss the numerical difficulties in approximating the ETD coefficients, which are functions of the linear term of the PDE. We address ourselves to describing various algorithms for approximating the coefficients, analyze their performance and their computational cost, and weigh their advantages for an efficient implementation of the ETD methods. The second aspect is to perform a variety of numerical experiments to evaluate the usefulness of the ETD methods, compared to other competing stiff integrators, for integrating real application problems. The problems considered include the Kuramoto-Sivashinsky equation, the nonlinear Schrödinger equation and the nonlinear Thin Film equation, all in one space dimension. The main properties tested are accuracy, start-up overhead cost and overall computation cost, since these parameters play key roles in the overall efficiency of the methods.
6
Mulvey, Joseph Anthony. "Symmetry methods for integrable systems." Thesis, Durham University, 1996. http://etheses.dur.ac.uk/5379/.
Full textAbstract:
This thesis discusses various properties of a number of differential equations which we will term "integrable". There are many definitions of this word, but we will confine ourselves to two possible characterisations — either an equation can be transformed by a suitable change of variables to a linear equation, or there exists an infinite number of conserved quantities associated with the equation that commute with each other via some Hamiltonian structure. Both of these definitions rely heavily on the concept of the symmetry of a differential equation, and so Chapters 1 and 2 introduce and explain this idea, based on a geometrical theory of p.d.e.s, and describe the interaction of such methods with variational calculus and Hamiltonian systems. Chapter 3 discusses a somewhat ad hoc method for solving evolution equations involving a series ansatz that reproduces well-known solutions. The method seems to be related to symmetry methods, although the precise connection is unclear. The rest of the thesis is dedicated to the so-called Universal Field Equations and related models. In Chapter 4 we look at the simplest two-dimensional cases, the Bateman and Born-lnfeld equations. By looking at their generalised symmetries and Hamiltonian structures, we can prove that these equations satisfy both the definitions of integrability mentioned above. Chapter Five contains the general argument which demonstrates the linearisability of the Bateman Universal equation by calculation of its generalised symmetries. These symmetries are helpful in analysing and generalising the Lagrangian structure of Universal equations. An example of a linearisable analogue of the Born-lnfeld equation is also included. The chapter concludes with some speculation on Hamiltoian properties.
7
MOSTARDEIRO, MARIANA. "METHODS FOR WCDMA SYSTEMS PLANNING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5095@1.
Full textAbstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOEste trabalho apresenta um estudo detalhado de técnicas de planejamento de sistemas celulares de terceira geração WCDMA. Primeiramente é realizado um estudo teórico do sistema WCDMA, da estrutura da interface aérea, dos diversos tipos de canais presentes no downlink e no uplink. A seguir são aprentadas técnicas de planejamento de rede, com uma análise detalhada do cálculo de enlace e do planejamento de cobertura do sistema celular. Com base neste estudo foram realizadas diversas simulações com o software aberto NPSW para diferentes situações em relação a tipos de serviço, condições de uso e carga no sistema. Estas simulações permitiram caracterizar os efeitos dos diversos parâmetros de entrada no desempenho do sistema. Finalmente, é apresentado um estudo de caso de planejamento para a região do centro do Rio de Janeiro.
This work presents a detailed study of planning tecniques for third generation WCDMA cellular systems. At first a theoretical study of the WCDMA system is presented, including the structure of the air interface and the various channel types in the downlink and uplink. Following, network planning techniques are presented, with a detailed analysis of the link budget calculations and the system coverage planning issues. Based on this study, the system behaviour was simulated using the open software NPSW for different configurations of service, operation condition and system load. The simulations allowed the characterization of the effect of several parameters on the system performance. Finally, a case study of coverage planning for downtown Rio de Janeiro is presented.
8
Lee, Moshin. "Methods for configuring manufacturing systems." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/11400.
Full text
9
SLEZAK, CYRILL BRANKO. "METHODS FOR CORRELATED ELECTRON SYSTEMS." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1151419509.
Full text
10
Simonis, Joseph P. "Inexact Newton methods applied to under-determined systems." Link to electronic dissertation, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-050406-103442/.
Full textAbstract:
Dissertation (Ph.D.)--Worcester Polytechnic Institute.Keywords: Periodic Solutions, Under-Determined Systems, Continuation, Nonlinear Eigenvalue, Inexact Newton Methods, Newton's Method, Trust Region Methods Includes bibliographical references (p.93-95).
11
Hallgrímsson, Guðmundur. "The implementation, adaptation, and use of the Rational Unified Process at Volvo Information Technology : a case study." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-657.
Full textAbstract:
The use of systems development methods are, by many, seen as the way to solve development problems, decrease development time, and improve the quality of software systems. Despite this, little is known about how development methods are actually used in the software industry. The aim of this project is to investigate how a widespread development method is implemented and used in an organisational setting.
The result of this project is a case study description of how Volvo Information Technology implements, adapts, and uses the commercial development method Rational Unified Process® (RUP®) in combination with other methods. The implementation is centrally administered and done incrementally over several years in order to build competence in the organisation. RUP is also adapted to the specific situation of the organisation, each division, each development project, and even adapted by individual developers.
12
Karelius, Fanny. "Stationary iterative methods : Five methods and illustrative examples." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-69711.
Full textAbstract:
Systems of large sparse linear equations frequently arise in engineering and science. Therefore, there is a great need for methods that can solve these systems. In this thesis we will present three of the earliest and simplest iterative methods and also look at two more sophisticated methods. We will study their rate of convergence and illustrate them with examples.
13
Huismann, Immo. "Computational fluid dynamics on wildly heterogeneous systems." TUDPress, 2018. https://tud.qucosa.de/id/qucosa%3A74002.
Full textAbstract:
In the last decade, high-order methods have gained increased attention. These combine the convergence properties of spectral methods with the geometrical flexibility of low-order methods. However, the time step is restrictive, necessitating the implicit treatment of diffusion terms in addition to the pressure. Therefore, efficient solution of elliptic equations is of central importance for fast flow solvers. As the operators scale with O(p · N), where N is the number of degrees of freedom and p the polynomial degree, the runtime of the best available multigrid algorithms scales with O(p · N) as well. This super-linear scaling limits the applicability of high-order methods to mid-range polynomial orders and constitutes a major road block on the way to faster flow solvers.
This work reduces the super-linear scaling of elliptic solvers to a linear one. First, the static condensation method improves the condition of the system, then the associated operator is cast into matrix-free tensor-product form and factorized to linear complexity. The low increase in the condition and the linear runtime of the operator lead to linearly scaling solvers when increasing the polynomial degree, albeit with low robustness against the number of elements. A p-multigrid with overlapping Schwarz smoothers regains the robustness, but requires inverse operators on the subdomains and in the condensed case these are neither linearly scaling nor matrix-free. Embedding the condensed system into the full one leads to a matrix-free operator and factorization thereof to a linearly scaling inverse. In combination with the previously gained operator a multigrid method with a constant runtime per degree of freedom results, regardless of whether the polynomial degree or the number of elements is increased.
Computing on heterogeneous hardware is investigated as a means to attain a higher performance and future-proof the algorithms. A two-level parallelization extends the traditional hybrid programming model by using a coarse-grain layer implementing domain decomposition and a fine-grain parallelization which is hardware-specific. Thereafter, load balancing is investigated on a preconditioned conjugate gradient solver and functional performance models adapted to account for the communication barriers in the algorithm. With the new model, runtime prediction and measurement fit closely with an error margin near 5 %.
The devised methods are combined into a flow solver which attains the same throughput when computing with p = 16 as with p = 8, preserving the linear scaling. Furthermore, the multigrid method reduces the cost of implicit treatment of the pressure to the one for explicit treatment of the convection terms. Lastly, benchmarks confirm that the solver outperforms established high-order codes.
14
Zeng, Yang. "Finite Element Methods for Microelectromechanical Systems." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-110896.
Full textAbstract:
The stationary Joule heating problem is a crucial multiphysical problem for many microelectromechanical (MEMS) applications. In our paper, we derive a finite element method for this problem and introduce iterative solution-techniques to compute the numerical simulation. Further we construct an adaptive algorithm for mesh refinement based on a posteriori error estimation.Finally, we present two numerical tests: convergences analysis of different iterative methods for distinct materials which are classified by electrical conductivities, and a test of the new adaptive refinement algorithm. All the numerical implementations have been done in MATLAB.
15
Chan, Ka Hou. "Bayesian methods for solving linear systems." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2493250.
Full text
16
Laamiri, Hassan. "Optimisation methods in structural systems reliability." Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46878.
Full text
17
Miller, David J. Ghosh Avijit. "New methods in computational systems biology /." Philadelphia, Pa. : Drexel University, 2008. http://hdl.handle.net/1860/2810.
Full text
18
Parambath, Shameem Ahamed Puthiya. "Matrix Factorization Methods for Recommender Systems." Thesis, Umeå universitet, Institutionen för datavetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-74181.
Full textAbstract:
This thesis is a comprehensive study of matrix factorization methods used in recommender systems. We study and analyze the existing models, specifically probabilistic models used in conjunction with matrix factorization methods, for recommender systems from a machine learning perspective. We implement two different methods suggested in scientific literature and conduct experiments on the prediction accuracy of the models on the Yahoo! Movies rating dataset.
19
Finney, James. "Autocoding methods for networked embedded systems." Thesis, University of Warwick, 2009. http://wrap.warwick.ac.uk/36892/.
Full textAbstract:
The volume and complexity of software is increasing; presenting developers with an ever increasing challenge to deliver a system within the agreed timescale and budget [1]. With the use of Computer-Aided Software Engineering (CASE) tools for requirements management, component design, and software validation the risks to the project can be reduced. This project focuses on Autocoding CASE tools, the methods used by such tools to generate the code, and the features these tools provide the user. The Extensible Stylesheet Language Transformation (XSLT) based autocoding method used by Rapicore in their NetGen embedded network design tool was known to have a number of issues and limitations. The aim of the research was to identify these issues and develop an innovative solution that would support current and future autocoding requirements. Using the literature review and a number of practical projects, the issues with the XSLT-based method were identified. These issues were used to define the requirements with which a more appropriate autocoding method was researched and developed. A more powerful language was researched and selected, and with this language a prototype autocoding platform was designed, developed, validated, and evaluated. The work concludes that the innovative use and integration of programmer-level Extensible Markup Language (XML) code descriptions and PHP scripting has provided Rapicore with a powerful and flexible autocoding platform to support current and future autocoding application requirements of any size and complexity.
20
Suwignjo, Patdono. "Quantitative methods for performance measurement systems." Thesis, University of Strathclyde, 1999. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=21437.
Full textAbstract:
The business environment has changed dramatically since the 1980s. Many researchers have shown that the traditional financially-based performance measurement systems have failed to cope with the current dynamic business environment. Even although new performance measurement systems have been proposed, such as Activity-Based Costing, the Balanced Scorecard, the SMART system, the Performance Measurement Questionnaires and the Cambridge model, the problem of quantifying the interaction of the factors affecting business performance still remains. The objectives of this thesis are: 1. To develop a performance measurement system model that can be used to quantify the effects of factors on performance and consolidate them into a single performance indicator. 2. To develop a model for reducing the number of performance reports. 3. To carry out experiments for testing the validity, applicability and stability of the models developed. To achieve these objectives this thesis reviews research methodology literature, studies the traditional and new performance measurement systems, identifies the current problems of performance measurement systems, reviews existing methods for identifying, structuring and prioritising performance measures, reviews the multicriteria methods, studies the analytic hierarchy process (AHP) and its controversy, develops quantitative methods for performance measurement systems and carries out experiments to test the validity, stability and applicability of the methods developed. To quantify the effect of factors on performance and consolidate them into a single performance indicator a quantitative method for performance measurement system (QMPMS) was developed. The method uses cognitive maps for identifying factors affecting performance and their relationship, structured diagrams for structuring the factors hierarchically and analytic hierarchy process for quantifying the effects of factors on performance. The method was then extended to reduce the number of performance reports. The QMPMS and its extension were implemented in three case studies to test their theoretical and application validity. The first case study applied the models to 'J&B Scotland Ltd.' to identify whether the models can produce the intended outputs. The second case study applied the QMPMS to 'Seagate Distribution (UK) Ltd.' to test the validity (accuracy) and stability of the QMPMS. Finally, the third case implemented the QMPMS to quantify and consolidate Inland Revenue, Cumbernauld's performance measures. It was found from the experiments that the QMPMS is quite accurate (the mean percentage of deviation is less than 4 percent), stable for a reasonable period of time and it can be applied comfortably to real cases. The QMPMS is now being used by the Inland Revenue - Cumbernauld for producing a single performance indicator of their business processes and overall office.
21
Lewis, John N. "Expert systems development utilizing heuristic methods." Thesis, Monterey, California. Naval Postgraduate School, 1996. http://hdl.handle.net/10945/8376.
Full textAbstract:
Approved for public release; distribution is unlimited.This thesis analyzes the diagnostic domain and isolates the heuristics employed by experts to arrive at diagnostic solutions. These heuristic methods are then generalized in order to arrive at a series of heuristic rules that can be applied to a wide range of diagnostic processes independent of there respective domain. To test the validity of the generalized heuristics, a prototype expert system was created targeting the heuristics employed by avionics repair technicians in repair of the APS- 1 15 radar system on the P-3C Orion.
22
Belavendram, Nicolo. "Taguchi methods for manufacturing systems design." Thesis, University of the West of Scotland, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306300.
Full text
23
Dalianis, Sotirios A. "Time-frequency methods for nonstationary systems." Thesis, University of Southampton, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246198.
Full text
24
Sukardjo, Wishnu. "Methods of avionics systems maintenance procedures." Thesis, University of Central Lancashire, 1995. http://clok.uclan.ac.uk/21166/.
Full textAbstract:
Avionics System Maintenance Procedures are discussed in this thesis in the context of a BPhil project involving formal training in research methods and includes information obtained by investigating issues pertinent to aircraft avionics systems maintenance. Personnel matters, problem specification and identification, maintenance procedures, health and safety issues, and quality control issues are discussed in terms of their influence in effectively carrying out required maintenance. The work described in the thesis demonstrates that several research methods are applicable to, and effective for, gathering information on avionics systems maintenance. Evidence is presented to support the view that research of maintenance procedures can produce considerable benefits in terms of improved overall maintenance performance. A critical comparison of maintenance procedures used by British Aerospace and the Indonesian Air Force is included, and conclusions are drawn which highlight a number of significant possibilities for developing improved procedures. Specific recommendations for improving maintenance productivity are given, and the benefits of addressing issues of Continuing Professional Development, Health and Safety matters, problem identification, use of computer databases, particularly for information governed by Standards, are discussed.
25
Benbow, Steven James. "Iterative methods for augmented linear systems." Thesis, University of Bath, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760703.
Full text
26
Araikum, Shawn. "Bayesian methods for composite radiopharmacokinetic systems." Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624556.
Full text
27
Shearer, J. M. "Interval methods for non-linear systems." Thesis, University of St Andrews, 1986. http://hdl.handle.net/10023/13779.
Full textAbstract:
In numerical mathematics, there is a need for methods which provide a user with the solution to his problem without requiring him to understand the mathematics underlying the method of solution. Such a method involves computable tests to determine whether or not a solution exists in a given region, and whether, if it exists, such a solution may be found by using the given method. Two valuable tools for the implementation of such methods are interval mathematics and symbolic computation. In. practice all computers have memories of finite size and cannot perform exact arithmetic. Therefore, in addition to the error which is inherent in a given numerical method, namely truncation error, there is also the error due to rounding. Using interval arithmetic, computable tests which guarantee the existence of a solution to a given problem in a given region, and the convergence of a particular iterative method to this solution, become practically realizable. This is not possible using real arithmetic due to the accumulation of rounding error on a computer. The advent of packages which allow symbolic computations to be carried out on a given computer is an important advance for computational numerical mathematics. In particular, the ability to compute derivatives automatically removes the need for a user to supply them, thus eliminating a major source of error in the use of methods requiring first or higher derivatives. In this thesis some methods which use interval arithmetic and symbolic computation for the solution of systems of nonlinear algebraic equations are presented. Some algorithms based on the symmetric single-step algorithm are described. These methods however do not possess computable existence, uniqueness, and convergence tests. Algorithms which do possess such tests, based on the Krawczyk-Moore algorithm are also presented. A simple package which allows symbolic computations to be carried out is described. Several applications for such a package are given. In particular, an interval form of Brown's method is presented.
28
Corker, Lloyd A. "Probabilistic methods applied to fluctuating systems." Doctoral thesis, University of Cape Town, 2012. http://hdl.handle.net/11427/10320.
Full textAbstract:
In this work the hierarchical structure of three diverse stochastic systems is studied by investigating the probability densities of their scale-dependent measures across various scales. In the first system studied, velocity increments are used to investigate the order of complexity and disorder of wind turbulence. The second system investigates the disorders of skeletal muscles and the nervous system by considering the fluctuation of electric potentials of skeletal muscles. The last system studied is a non-physical system where price increments are used to classify the financial markets in terms of predictability of price changes and market efficiency. In all three stochastic systems a Fokker-Planck equation is used to describe how the scale-dependent measure is correlated across nested scales.
29
Gibson, Michael Andrew Bruck Jehoshua. "Computational methods for stochastic biological systems /." Diss., Pasadena, Calif. : California Institute of Technology, 2000. http://resolver.caltech.edu/CaltechETD:etd-05132005-154222.
Full text
30
Sehloho, Nobaene Elizabeth. "An indoor positioning system using multiple methods and tools." Thesis, Cape Peninsula University of Technology, 2015. http://hdl.handle.net/20.500.11838/2288.
Full textAbstract:
Thesis (MTech (Information Technology))--Cape Peninsula University of Technology, 2015.Recently, the deployment and availability of wireless technology have led to the development of location and positioning services. These Location Based Services (LBSs) are attracting the attention of researchers and mobile service providers. With the importance of ubiquitous computing, the main challenge seen in the LBS is in the mobile positioning or localization within reasonable and certain accuracy. The Global Positioning System (GPS), as a widely known and used navigation system, is only appropriate for use in outdoor environments, due to the lack of line-of-sight (LOS) in satellite signals that they cannot be used accurately inside buildings and premises. Apart from GPS, Wi-Fi is among others, a widely used technology as it is an already existing infrastructure in most places. This work proposes and presents an indoor positioning system. As opposed to an Ad-hoc Positioning System (APS), it uses a Wireless Mesh Network (WMN). The system makes use of an already existing Wi-Fi infrastructure. Moreover, the approach tests the positioning of a node with its neighbours in a mesh network using multi-hopping functionality. The positioning measurements used were the ICMP echo requests, RSSI and RTS/CTS requests and responses. The positioning method used was the trilateral technique, in combination with the idea of the fingerprinting method. Through research and experimentation, this study developed a system which shows potential as a positioning system with an error of about 2 m – 3 m. The hybridization of the methods proves an enhancement in the system though improvements are still required
31
Abbas, Waseem. "Network-centric methods for heterogeneous multiagent systems." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50400.
Full textAbstract:
We present tools for a network topology based characterization of heterogeneity in multiagent systems, thereby providing a framework for the analysis and design of heterogeneous multiagent networks from a network structure view-point. In heterogeneous networks, agents with a diverse set of resources coordinate with each other. Coordination among different
agents and the structure of the underlying network topology have significant impacts on the overall behavior and functionality of the system. Using constructs from graph theory, a qualitative as well as a quantitative analysis is performed to examine an inter-relationship between the network topology and the distribution of agents with various capabilities in heterogeneous networks. Our goal is to allow agents maximally exploit heterogeneous resources available within the network through local interactions, thus exploring a promise heterogeneous networks hold to accomplish complicated tasks by leveraging upon the assorted capabilities of agents. For a reliable operations of such systems, the issue of security against intrusions and malicious agents is also addressed. We provide a scheme to secure a network against a sequence of intruder attacks through a set of heterogeneous guards. Moreover, robustness of networked systems against noise corruption and structural changes in the underlying network topology is also examined.
32
Boyanova, Petia. "On Numerical Solution Methods for Block-Structured Discrete Systems." Doctoral thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-173530.
Full textAbstract:
The development, analysis, and implementation of efficient methods to solve algebraic systems of equations are main research directions in the field of numerical simulation and are the focus of this thesis. Due to their lesser demands for computer resources, iterative solution methods are the choice to make, when very large scale simulations have to be performed. To improve their efficiency, iterative methods are combined with proper techniques to accelerate convergence. A general technique to do this is to use a so-called preconditioner. Constructing and analysing various preconditioning methods has been an active field of research already for decades. Special attention is devoted to the class of the so-called optimal order preconditioners, that possess both optimal convergence rate and optimal computational complexity. The preconditioning techniques, proposed and studied in this thesis, utilise the block structure of the underlying matrices, and lead to methods that are of optimal order. In the first part of the thesis, we construct an Algebraic MultiLevel Iteration (AMLI) method for systems arising from discretizations of parabolic problems, using Crouzeix-Raviart finite elements. The developed AMLI method is based on an approximated block factorization of the original system matrix, where the partitioning is associated with a sequence of nested discretization meshes. In the second part of the thesis we develop solution methods for the numerical simulation of multiphase flow problems, modelled by the Cahn-Hilliard (C-H) equation. We consider the discrete C-H problem, obtained via finite element discretization in space and implicit schemes in time. We propose techniques to precondition the Jacobian of the discrete nonlinear system, based on its natural two-by-two block structure. The preconditioners are used in the framework of inexact Newton methods. We develop two nonlinear solution algorithms for the Cahn-Hilliard problem. Both lead to efficient optimal order methods. One of the main advantages of the proposed methods is that they are implemented using available software toolboxes for both sequential and distributed execution. The theoretical analysis of the solution methods presented in this thesis is combined with numerical studies that confirm their efficiency.
33
Amy, John Victor. "Composite system stability methods applied to advanced shipboard electric power systems." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/10945/23576.
Full textAbstract:
CIVINSLarge increases in the complexity of shipboard electric loads as well as development of electric drive, integrated electric drive and pulsed power systems make manifest the present and future importance of naval electric power systems. The most crucial attribute of these systems is their ability to fulfill their function in the presence of "large-signal" perturbations. Fundamental differences between shipboard and commercial electric power systems make all but the most general nonlinear, "large-signal" stability analyses inappropriate for the design and assessment of naval electric power systems. The tightly coupled and compact nature of shipboard systems are best accommodated by composite system stability analyses. Composite system methods, based upon Lyapunov's direct method, require that each component's stability be represented by a Lyapunov function. A new Lyapunov function which is based upon coenergy is developed for 3-phase synchronous machines. This use of coenergy is generalizable to all electromechanical energy conversion devices. The coenergy-based Lyapunov function is implemented as a "stability organ" which generates waveforms at information teirninals of a "device object" in the object oriented simulation environment of WAVESIM. Single generator simulation results are used to acquire a measure of the "over sufficiency" of the coenergy-based Lyapunov function. Some means of combining the components' Lyapunov functions is necessary with composite system stability criterions. To provide the largest stability region in a Lyapunov function convective derivative space, thereby reducing "over sufficiency", a "timevariant weighted-sum" composite system criterion is developed. This criterion is implemented as a "stability demon" "device object" within the WAVESIM environment. The "stability demon" is tested through RLC circuit simulations and a two-generator simulation. The output of the "stability demon" is suitable for use within an overall system stabilising controller.
34
Evans, Andrew Stephen. "Z for concurrent systems." Thesis, Leeds Beckett University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.309794.
Full text
35
Jennings, Daniel Blair. "Welding information system : design, operations, methods." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/29988.
Full textAbstract:
This thesis encompasses a Welding Information System for Design, Operations, and Methods (WISDOM). In essence, the WISDOM project aimed at research and development of an innovative and comprehensive information collection on welding in close cooperation with industry utilizing modern micro-computer techniques of information review, retrieval, storage, updating, and transfer. Emphasis is placed on new and more efficient methods of knowledge communication, pursuing the idea of exploring knowledge (in contrast to rehearsing recipes). The development of this project concentrated on the following three main topics:
1. Background information on steel metallurgy and welding
2. Analysis and Design Methods for Welded Connections
3. Code Requirements of Welds
Preliminary research on the WISDOM project involved communications with industry to determine primary objectives. The need for an information system on welding was unquestionably
apparent. The knowledge base is supplemented with graphic images and analysis and design programs. It is hoped that the information in this system will be delivered to the engineer in an efficient and useful manner. The priority here is to raise welding awareness while promoting efficient welded design. In addition, we hope that the WISDOM system will close the ever widening gap between the design engineer and the fabricator. In the most general sense, the primary objective of the WISDOM project was to produce an integrated self-paced teaching tool for both engineering professional and student alike. The versatility of the system is maintained by presenting the information in modular form. Screen graphics oriented learning modules encourage the user to become more involved in the learning process than more conventional teaching methods allow. Analysis and design modules promote rapid and efficient connection design in a more consistent and professional manner. A smooth transition from the learning environment to engineering practice is envisioned by providing realistic design tools with a transparent background.Applied Science, Faculty of
Civil Engineering, Department of
Graduate
36
Shchekinova, Elena Y. "Analysis of Multidimensional Phase Space Hamiltonian Dynamics: Methods and Applications." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-03172006-083600/.
Full textAbstract:
Thesis (Ph. D.)--Physics, Georgia Institute of Technology, 2006.Mustafa Aral, Committee Member ; John Wood, Committee Member ; Kurt Wiesenfeld, Committee Member ; M. Raymond Flannery, Committee Member ; Turgay Uzer, Committee Chair.
37
de, Tenorio Cyril. "Methods for collaborative conceptual design of aircraft power architectures." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34818.
Full textAbstract:
This thesis proposes an advanced architecting methodology. This methodology allows for the sizing and optimization of aircraft system architecture concepts and the establishment of subsystem development strategies. The process is implemented by an architecting team composed of subsystem experts and architects. The methodology organizes the architecture definition using the SysML language. Using meta-modeling techniques, this definition is translated into an analysis model which automatically integrates subsystem analyses in a fashion that represents the specific architecture concept described by the team. The resulting analysis automatically sizes the subsystems composing it, synthesizes their information to derive architecture-level performance and explores the architecture internal trade-offs. This process is facilitated using the Coordinated Optimization method proposed in this dissertation. This method proposes a multi-level optimization setup. An architecture-level optimizer orchestrates the subsystem sizing optimizations in order to optimize the aircraft as whole. The methodologies proposed in this thesis are tested and demonstrated on a proof of concept based on the exploration of turbo-electric propulsion aircraft concepts.
38
Liu, Jianhua. "System design and signal processing for OFDM-based wireless communication systems." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0006701.
Full text
39
Verleyen, Wim. "Machine learning for systems pathology." Thesis, University of St Andrews, 2013. http://hdl.handle.net/10023/4512.
Full textAbstract:
Systems pathology attempts to introduce more holistic approaches towards pathology and attempts to integrate clinicopathological information with “-omics” technology. This doctorate researches two examples of a systems approach for pathology: (1) a personalized patient output prediction for ovarian cancer and (2) an analytical approach differentiates between individual and collective tumour invasion. During the personalized patient output prediction for ovarian cancer study, clinicopathological measurements and proteomic biomarkers are analysed with a set of newly engineered bioinformatic tools. These tools are based upon feature selection, survival analysis with Cox proportional hazards regression, and a novel Monte Carlo approach. Clinical and pathological data proves to have highly significant information content, as expected; however, molecular data has little information content alone, and is only significant when selected most-informative variables are placed in the context of the patient's clinical and pathological measures. Furthermore, classifiers based on support vector machines (SVMs) that predict one-year PFS and three-year OS with high accuracy, show how the addition of carefully selected molecular measures to clinical and pathological knowledge can enable personalized prognosis predictions. Finally, the high-performance of these classifiers are validated on an additional data set. A second study, an analytical approach differentiates between individual and collective tumour invasion, analyses a set of morphological measures. These morphological measurements are collected with a newly developed process using automated imaging analysis for data collection in combination with a Bayesian network analysis to probabilistically connect morphological variables with tumour invasion modes. Between an individual and collective invasion mode, cell-cell contact is the most discriminating morphological feature. Smaller invading groups were typified by smoother cellular surfaces than those invading collectively in larger groups. Interestingly, elongation was evident in all invading cell groups and was not a specific feature of single cell invasion as a surrogate of epithelialmesenchymal transition. In conclusion, the combination of automated imaging analysis and Bayesian network analysis provides an insight into morphological variables associated with transition of cancer cells between invasion modes. We show that only two morphologically distinct modes of invasion exist. The two studies performed in this thesis illustrate the potential of a systems approach for pathology and illustrate the need of quantitative approaches in order to reveal the system behind pathology.
40
Lee, Bin Hong Alex. "Empty container logistics optimization : an implementation framework and methods." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/90715.
Full textAbstract:
Thesis: S.M. in Engineering and Management, Massachusetts Institute of Technology, Engineering Systems Division, System Design and Management Program, 2014.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 68-70).
Empty container logistics is a huge cost component in an ocean carrier's operations. Managing this cost is important to ensure profitability of the business. This thesis proposes a 3-stage framework to handle empty container logistics with cost management as the objective. The first stage studies the forecasting of laden shipment demand, which provides the empty container supply requirement. Based on the supply needs, the problem of optimizing the fleet size was then addressed by using an inventory model to establish the optimal safety stock level. Simulations were used to understand the sensitivity of safety stock to desired service level. The final stage involves using mathematical programming to optimize repositioning costs incurred by carriers to ship empty containers to places which need them due to trade imbalance. At the same time, costs that are incurred due to leasing and storage are considered. A comparison between just-in-time and pre-emptive replenishment was performed and impact due to uncertainties is investigated. The framework is then implemented in a Decision Support System for an actual ocean carrier and is used to assist the empty container logistics team to take the best course of action in daily operations. The results from the optimizations show that there are opportunities for the carrier to reduce its fleet size and cut empty container logistics related costs.
by Bin Hong Alex Lee.
S.M. in Engineering and Management
41
Chan, Francis Chun Ngai Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Statistical methods on detecting superpositional signals in a wireless channel." Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/30596.
Full textAbstract:
The objective of the thesis is concerned on the problem of detecting superpositional signals in a wireless channel. In many wireless systems, an observed signal is commonly represented as a linear combination of the transmitted signal with the interfering signals dispersed in space and time. These systems are generally known as the interference-limited systems. The mathematical model of these systems is generally referred as a superpositional model. A distinguished characteristic of signal transmission in a time-varying wireless channel is that the channel process is not known a priori. Reliable signal reception inherently requires exploiting the structure of the interfering signals under channel uncertainty. Our goal is to design computational efficient receivers for various interference-limited systems by using advanced statistical signal processing techniques. The thesis consists of four main parts. Firstly, we have proposed a novel Multi-Input Multi-Output (MIMO) signal detector, known as the neighbourhood exploring detector (NED). According to the maximum likelihood principle, the space time MIMO detection problem is equivalent to a NP-hard combinatorial optimization problem. The proposed detector is a sub-optimal maximum likelihood detector which eliminates exhaustive multidimensional searches. Secondly, we address the problem of signal synchronization for Global Positioning System (GPS) in a multipath environment. The problem of multipath mitigation constitutes a joint estimation of the unknown amplitudes, phases and time delays of the linearly combined signals. The complexity of the nonlinear joint estimation problem increases exponentially with the number of signals. We have proposed two robust GPS code acquisition systems with low complexities. Thirdly, we deal with the problem of multipath mitigation in the spatial domain. A GPS receiver integrated with the Inertial Navigation System (INS) and a multiple antenna array is considered. We have designed a software based GPS receiver which effectively estimates the directions of arrival and the time of arrival of the linearly combined signals. Finally, the problem of communications with unknown channel state information is investigated. Conventionally, the information theoretical communication problem and the channel estimation problem are decoupled. However the training sequence, which facilitates the estimation of the channel, reduces the throughput of the channel. We have analytically derived the optimal length of the training sequence which maximizes the mutual information in a block fading channel.
42
Manongga, D. H. F. "Using genetic algorithm-based methods for financial analysis." Thesis, University of East Anglia, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320950.
Full text
43
Chau, Pui-hing. "Statistical methods for surveillance and monitoring systems /." View the Table of Contents & Abstract, 2005. http://sunzi.lib.hku.hk/hkuto/record/B30575485.
Full text
44
Akiba, Yasuhiro. "Automatic evaluation methods for machine translation systems." 京都大学 (Kyoto University), 2005. http://hdl.handle.net/2433/144795.
Full text
45
Protheroe, D. W. "Systematic methods for designing large digital systems." Thesis, London South Bank University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618625.
Full text
46
Henderson, Matthew S. "Discriminative methods for statistical spoken dialogue systems." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/249015.
Full textAbstract:
Dialogue promises a natural and effective method for users to interact with and obtain information from computer systems. Statistical spoken dialogue systems are able to disambiguate in the presence of errors by maintaining probability distributions over what they believe to be the state of a dialogue. However, traditionally these distributions have been derived using generative models, which do not directly optimise for the criterion of interest and cannot easily exploit arbitrary information that may potentially be useful. This thesis presents how discriminative methods can overcome these problems in Spoken Language Understanding (SLU) and Dialogue State Tracking (DST). A robust method for SLU is proposed, based on features extracted from the full posterior distribution of recognition hypotheses encoded in the form of word confusion networks. This method uses discriminative classifiers, trained on unaligned input/output pairs. Performance is evaluated on both an off-line corpus, and on-line in a live user trial. It is shown that a statistical discriminative approach to SLU operating on the full posterior ASR output distribution can substantially improve performance in terms of both accuracy and overall dialogue reward. Furthermore, additional gains can be obtained by incorporating features from the system's output. For DST, a new word-based tracking method is presented that maps directly from the speech recognition results to the dialogue state without using an explicit semantic decoder. The method is based on a recurrent neural network structure that is capable of generalising to unseen dialogue state hypotheses, and requires very little feature engineering. The method is evaluated in the second and third Dialog State Tracking Challenges, as well as in a live user trial. The results demonstrate consistently high performance across all of the off-line metrics and a substantial increase in the quality of the dialogues in the live trial. The proposed method is shown to be readily applied to expanding dialogue domains, by exploiting robust features and a new method for online unsupervised adaptation. It is shown how the neural network structure can be adapted to output structured joint distributions, giving an improvement over estimating the dialogue state as a product of marginal distributions.
47
Engström, Felix, and Eli Pleaner. "Learning Methods for Improving News Retrieval Systems." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187492.
Full textAbstract:
Content providers require an efficient and accurate way of retrieving relevant content with minimal human aid. News retrieval, for instance, often requires human intervention to recognize which text documents are news articles and which are not. The differences between a factual news article and an opinionated blog piece may be subtle, yet are critical for providing informative and relevant content to users. This thesis explores the problem of format classification: the task of classifying text documents based on the format in which they are written, such as a news article, blog entry or forum text. More explicitly, the goal of the thesis is to examine how well state-of-the-art supervised text classifica- tion techniques work for format classification. We select a number of classifiers that have been shown to perform well in other text classification tasks and evaluate their perfor- mance in this unexplored task. Experimental evaluation, performed on a novel dataset created from multiple existing datasets, explores both binary and multi-class classification in a bag-of-words feature space. Based on our experimental results, we have found that state-of-the-art supervised text classification techniques perform acceptably well at format classification. Furthermore, we propose a Gradient Boost model as a candidate classifier for the task of format clas- sification, and provide a discussion of future work.Företag som tillhandahåller innehållshanteringstjänster be- höver effektiva och precisa metoder för att med minsta möjliga mänskliga arbetskraft utvinna relevant innehåll ur stora mängder data. Ett exempel på detta är tjänster för insamlande av nyheter, där nyheter skall utvinnas från olika källor. Som en del av den processen krävs att de kan avgöra om en text är en nyhetsartikel eller någon annan form av text. Skillnaden mellan en nyhetsartikel och en text skriven för en blogg kan vara subtil, men är avgörande för dessa företag. Denna rapport utforskar formatklassifi- cering: uppgiften att klassificera texter baserat på vilket format de är skrivna för. Exempel på format är: nyhet- sartikel, bloggtext eller forumtext. Mer specifikt tar den sig an uppgiften att undersöka hur väl de metoder som idag används i den väl utforskade uppgiften att klassificera texter baserat på ämne fungerar applicerade på formatk- lassificering. Det utforskas med experimentell evaluering på ett nytt dataset som konstruerats genom att kombin- era ett flertal existerande dataset. Detta görs både som en binär- och multiklassificeringsuppgift i en bag-of-word vektorrymd. Ett antal ämnesklassificeringsmetoder väljs baserat på resultat från tidigare forskning, och hur dessa presterar på formatklassificering undersöks. Vi drar slut- satsen att våra resultat visar att de textklassificeringsme- toder vi testat fungerar acceptabelt väl på formatklassifi- cering. Vi föreslår vidare gradient-boost eller multinomial naive bayes för att lösa uppgiften, beroende på om fokus ligger på kvaliteten av klassificeringen eller prestanda. Slut- ligen diskuteras resultaten , de sätts i relation till de begrän- sningar som förelegat och förslag till framtida forskning ges.
48
Betschart, Willie. "Applying intelligent statistical methods on biometric systems." Thesis, Blekinge Tekniska Högskola, Avdelningen för signalbehandling, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1694.
Full textAbstract:
This master’s thesis work was performed at Optimum Biometric Labs, OBL, located in Karlskrona, Sweden. Optimum Biometric Labs perform independent scenario evaluations to companies who develop biometric devices. The company has a product Optimum preConTM which is surveillance and diagnosis tool for biometric systems. This thesis work’s objective was to develop a conceptual model and implement it as an additional layer above the biometric layer with intelligence about the biometric users. The layer is influenced by the general procedure of biometrics in a multimodal behavioural way. It is working in an unsupervised way and performs in an unsupervised manner. While biometric systems are increasingly adopted the technologies have some inherent problems such as false match and false non-match. In practice, a rejected user can not be interpreted as an impostor since the user simply might have problems using his/her biometric feature. The proposed methods in this project are dealing with these problems when analysing biometric usage in runtime. Another fact which may give rise to false rejections is template aging; a phenomenon where the enrolled user’s template is too old compared towards the user’s current biometric feature. A theoretical approach of template aging was known; however since the analysis of template aging detection was correlated with potential system flaws such as device defects or human generated risks such as impostor attacks this task would become difficult to solve in an unsupervised system but when ignoring the definition of template aging, the detection of similar effects was possible. One of the objectives of this project was to detect template aging in a predictive sense; this task failed to be carried out because the absence of basis performing this kind of tasks. The developed program performs abnormality detection at each incoming event from a biometric system. Each verification attempt is assumed to be from a genuine user unless any deviation according to the user's history is found, an abnormality. The possibility of an impostor attack depends on the degree of the abnormality. The application makes relative decisions between fraud possibilities or if genuine user was the source of what caused the deviations. This is presented as an alarm with the degree of impostor possibility. This intelligent layer has increased Optimum preCon´s capacity as a surveillance tool for biometrics. This product is an efficient complement to biometric systems in a steady up-going worldwide market.
49
Marcińczuk, Michał. "Pattern Acquisition Methods for Information Extraction Systems." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4291.
Full textAbstract:
This master thesis treats about Event Recognition in the reports of Polish stockholders. Event Recognition is one of the Information Extraction tasks. This thesis provides a comparison of two approaches to Event Recognition: manual and automatic. In the manual approach regular expressions are used. Regular expressions are used as a baseline for the automatic approach. In the automatic approach three Machine Learning methods were applied. In the initial experiment the Decision Trees, naive Bayes and Memory Based Learning methods are compared. A modification of the standard Memory Based Learning method is presented which goal is to create a classifier that uses only positives examples in the classification task. The performance of the modified Memory Based Learning method is presented and compared to the baseline and also to other Machine Learning methods. In the initial experiment one type of annotation is used and it is the meeting date annotation. The final experiment is conducted using three types of annotations: the meeting time, the meeting date and the meeting place annotation. The experiments show that the classification can be performed using only one class of instances with the same level of performance.(+48)669808616
50
Aghdam, Amir G. "Decentralized control of systems using switching methods." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0015/NQ53722.pdf.
Full text