Relevant bibliographies by topics / Vector systems / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Vector systems.

Dissertations / Theses on the topic 'Vector systems'

Author: Grafiati
Published: 10 January 2023
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Vector systems.'

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

Bharadwaj, Aravind S. "Vector controlled induction motor drive systems." Diss., This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-06062008-172143/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Topham, N. P. "A parallel vector processing system." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.370965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

O'Connell, Heath B. "Vector meson models of strongly interacting systems /." Title page, abstract and table of contents only, 1996. http://web4.library.adelaide.edu.au/theses/09PH/09pho175.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hammam, Yasser, and n/a. "Geographical vector agents." University of Otago. Department of Information Science, 2008. http://adt.otago.ac.nz./public/adt-NZDU20080404.150839.

Full text
Abstract:
Simulating geographic phenomena in a realistic and plausible way requires real-world entities to be abstracted based on the dynamic physical characteristics they exhibit, and treated as individuals in a simulation domain. These processes cannot be adequately supported by the traditional spatial model based on cellular-space such as Cellular Automata (CA). Although this approach has received a great attention as a most favoured technique for simulating the geographic phenomena from different aspects, the need for a generic spatial model to overcome the limitations encountered in such an approach has been raised. This applies particularly to the way real-world entities are represented in a simulation domain regarding their physical characteristics and temporal aspects. In this thesis, a new computational approach for a spatial model suitable for simulating geographic phenomena is presented: the vector agents model. The vector agent is goal-oriented, adaptable, physically defined by an Euclidean geometry and able to change its own geometric characteristics while interacting with other agents in its neighbourhood using a set of rules. The agent is modelled with sensor, state, and strategies. The successful implementation of the model�s architecture allows the representation of the physical characteristics of real-world entities and to observe their complex and dynamic behaviour in a simulation domain. Vector agents have developed out of a need to create a systematic basis for the geometric components of Geographic Automata Systems (GAS), as outlined by Torrens and Benenson (2005). A generic vector agents model was built, then tested and validated from different aspects, from which results demonstrated the model�s efficiency. It is confirmed that vector agents are flexible in producing different complex shapes and patterns for recreating real geographic phenomena through the generic use of three algorithms of geometric manipulation: midpoint displacement by using the relaxed Brownian Motion (fractal-like) algorithm, edge displacement and vertex displacement. The effectiveness of this was initially ascertained visually. A simple heuristic to govern shape growth rate and complexity was derived based on the interplay of the three algorithms. There was a further abstract model comparison against the cellular-agents environment, with the result that vector agents have the ability to emerge patterns similar to what can be produced by cellular-agents with the advantage of representing entities as individuals with their own attributes with realistic geometric boundaries. On the other hand, the city as a complex geographic phenomenon was used as a specific domain for validating the model with a real-world system. The results of the urban land use simulations (driven by simple rules based on three classical urban theories) confirmed that: (a) the model is flexible enough to incorporate various external rules based on real-world systems and (b) the model has a sufficient capability in emerging a variety of patterns under several environments close to actual patterns. The agent environment also proved to be an effective way of easily combining the rules associated with each urban theory (different agents behaved according to different theories). Finally, limitations raised through the development of this work are addressed leading to outline possible extensions of both model computation and the domain of applications.
APA, Harvard, Vancouver, ISO, and other styles
5

Jas, Abhijit. "Test vector compression techniques for systems-on-chip /." Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3008359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Xiaopeng. "Moving base INS/GPS vector gravimetry on a land vehicle." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1195677222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xiao, Yu. "Evaluation of Test Vector Quality for Hybrid Systems." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-347562.

Full text
Abstract:
When testing is performed, a large number of test vectors representing series of signal values are input to the applications under development, and the results of the testing are then analyzed by checking violations of defined safety requirements. However, there is usually limited time, personnel and other resources. Selecting a subset of test vectors with better qualities is one of the possible ways in order to bring down the costs for testing-related activities.This thesis work aims at evaluating and quantifying the qualities of test vectors for a hybrid system. Two possible criteria for good qualities are proposed, evaluated and quantified for test vectors that are input to a hybrid application at Volvo Cars. For validation and analyses purposes, the semantics of Signal Temporal Logic (STL) and its robustness satisfaction are introduced and monitored with the Matlab/Simulink Toolbox Breach. The conclusion is that the method we proposed to evaluate and quantify the qualities of test vectors is able to satisfy the needs from Volvo Cars by far. With the experiences we have at present, however, it is not sufficiently proven that test vectors with higher qualities assessed by our method behave better when the robustness satisfaction of STL formulas is monitored. Nevertheless, it is a good beginning to relate the robustness satisfaction of STL semantics to test vector quality evaluation for people with similar goals to consider in the future.
APA, Harvard, Vancouver, ISO, and other styles
8

Schreiber, Veronika. "Special vector configurations in geometry and integrable systems." Thesis, Loughborough University, 2014. https://dspace.lboro.ac.uk/2134/14695.

Full text
Abstract:
The main objects of study of the thesis are two classes of special vector configurations appeared in the geometry and the theory of integrable systems. In the first part we consider a special class of vector configurations known as the V-systems, which appeared in the theory of the generalised Witten-Dijkgraaf-Verlinde-Verlinde (WDVV) equations. Several families of V-systems are known, but their classification is an open problem. We derive the relations describing the infinitesimal deformations of V-systems and use them to study the classification problem for V-systems in dimension 3. In particular, we prove that the isolated cases in Feigin-Veselov list admit only trivial deformations. We present the catalogue of all known 3D V-systems including graphical representations of the corresponding matroids and values of v-functions. In the second part we study the vector configurations, which form vertex sets for a new class of polyhedra called affine B-regular. They are defined by a 3-dimensional analogue of the Buffon procedure proposed by Veselov and Ward. The main result is the proof of existence of star-shaped affine B-regular polyhedron with prescribed combinatorial structure, under partial symmetry and simpliciality assumptions. The proof is based on deep results from spectral graph theory due to Colin de Verdière and Lovász.
APA, Harvard, Vancouver, ISO, and other styles
9

Bushman, Nathan. "Hypercomplex Numbers and Early Vector Systems: A History." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1585666516546138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Payn, Martin. "Flux vector control of asynchronous machines." Thesis, University of Surrey, 1991. http://epubs.surrey.ac.uk/844608/.

Full text
Abstract:
The present work introduces the dynamic induction machine model using the concept of space vector notation, and shows the fundamentals of torque production to be related to the current and flux space vector interaction. By theoretical analysis the transient response of the current and voltage fed machine is determined in terms of the machine eigenvalues, and this is confirmed using simulation techniques. The concept of torque control using the current and flux space vectors' magnitude and phase is introduced. It is shown that maintaining the flux space vector's magnitude constant is a sensible approach and that transient free torque responses are possible by controlling the current space vector magnitude and phase with respect to the flux space vector, which is termed vector control. Previously only magnitude control was realised, and this is termed scalar control. It is shown that the simplest practical vector controllers work in the rotating rotor flux space vector reference frame, generated from a dynamic machine model using current and speed/position measurements from the real machine. The major disadvantage of the parameter sensitivity of this approach is examined. To complement the theoretical analysis a practical vector controller was to be built. This was designed around a new DSP micro-controller (TMS320C14) and featured a 10 kHz sampling rate. A fully instrumented 7.5 kW test rig was also developed with the induction machine driven from a modified 1 kHz inverter. The measurement of high performance shaft torque is investigated, to allow comparisons between the theoretical and practical results. The practical work centred on the comparison of the dynamic machine model with measurements made on the real machine (torque and flux) and with the theory. These showed excellent steady state performance but the dynamic response was disappointing. The implications of the model not representing the real machine transiently are investigated.
APA, Harvard, Vancouver, ISO, and other styles
11

Ren, Yueming Carleton University Dissertation Geography. "Vector data topological encoding error handling and generalization." Ottawa, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
12

Wade, Scott. "Parameter identification for vector controlled induction machines." Thesis, Heriot-Watt University, 1995. http://hdl.handle.net/10399/1311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Thomas, Joan Helen. "Studies in gene transfer using pseudotyped lentiviral vector systems." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

McAleer, Barry E. "Expression of mumps virus proteins in eukaryote vector systems." Thesis, Queen's University Belfast, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Meki, Shintaro. "Studies on Main Memory Database Systems for Vector Processors." Kyoto University, 1999. http://hdl.handle.net/2433/181853.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Yi, Long. "KernTune: self-tuning Linux kernel performance using support vector machines." Thesis, University of the Western Cape, 2006. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_6921_1249280496.

Full text
Abstract:

Self-tuning has been an elusive goal for operating systems and is becoming a pressing issue for modern operating systems. Well-trained system administrators are able to tune an operating system to achieve better system performance for a specific system class. Unfortunately, the system class can change when the running applications change. The model for self-tuning operating system is based on a monitor-classify-adjust loop. The idea of this loop is to continuously monitor certain performance metrics, and whenever these change, the system determines the new system class and dynamically adjusts tuning parameters for this new class. This thesis described KernTune, a prototype tool that identifies the system class and improves system performance automatically. A key aspect of KernTune is the notion of Artificial Intelligence oriented performance tuning. Its uses a support vector machine to identify the system class, and tunes the operating system for that specific system class. This thesis presented design and implementation details for KernTune. It showed how KernTune identifies a system class and tunes the operating system for improved performance.

APA, Harvard, Vancouver, ISO, and other styles
17

Kavak, Adnan. "Vector propagation channel studies for smart antenna wireless communication systems /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Tolman, J. D. "Three-dimensional object recognition using vector encoded scene data." Thesis, University of Bradford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233692.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Yang, Weidong. "Vector channel study and related issues in selective transceiving /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Wu, Jianfei. "Vector-Item Pattern Mining Algorithms and their Applications." Diss., North Dakota State University, 2011. https://hdl.handle.net/10365/28841.

Full text
Abstract:
Advances in storage technology have long been driving the need for new data mining techniques. Not only are typical data sets becoming larger, but the diversity of available attributes is increasing in many problem domains. In biological applications for example, a single protein may have associated sequence-, text-, graph-, continuous and item data. Correspondingly, there is growing need for techniques to find patterns in such complex data. Many techniques exist for mapping specific types of data to vector space representations, such as the bag-of-words model for text [58] or embedding in vector spaces of graphs [94, 91]. However, there are few techniques that recognize the resulting vector space representations as units that may be combined and further processed. This research aims to mine important vector-item patterns hidden across multiple and diverse data sources. We consider sets of related continuous attributes as vector data and search for patterns that relate a vector attribute to one or more items. The presence of an item set defines a subset of vectors that may or may not show unexpected density fluctuations. Two types of vector-item pattern mining algorithms have been developed, namely histogram-based vector-item pattern mining algorithms and point distribution vector-item pattern mining algorithms. In histogram-based vector-item pattern mining algorithms, a vector-item pattern is significant or important if its density histogram significantly differs from what is expected for a random subset of transactions, using ?? goodness-of-fit test or effect size analysis. For point distribution vector-item pattern mining algorithms, a vector-item pattern is significant if its probability density function (PDF) has a big KullbackLeibler divergence from random subsamples. We have applied the vector-item pattern mining algorithms to several application areas, and by comparing with other state-of-art algorithms we justify the effectiveness and efficiency of the algorithms.
APA, Harvard, Vancouver, ISO, and other styles
21

Anderdahl, Johan, and Alice Darner. "Particle Systems Using 3D Vector Fields with OpenGL Compute Shaders." Thesis, Blekinge Tekniska Högskola, Institutionen för kreativa teknologier, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5740.

Full text
Abstract:
Context. Particle systems and particle effects are used to simulate a realistic and appealing atmosphere in many virtual environments. However, they do occupy a significant amount of computational resources. The demand for more advanced graphics increases by each generation, likewise does particle systems need to become increasingly more detailed. Objectives. This thesis proposes a texture-based 3D vector field particle system, computed on the Graphics Processing Unit, and compares it to an equation-based particle system. Methods. Several tests were conducted comparing different situations and parameters for the methods. All of the tests measured the computational time needed to execute the different methods. Results. We show that the texture-based method was effective in very specific situations where it was expected to outperform the equation-based. Otherwise, the equation-based particle system is still the most efficient. Conclusions. Generally the equation-based method is preferred, except for in very specific cases. The texture-based is most efficient to use for static particle systems and when a huge number of forces is applied to a particle system. Texture-based vector fields is hardly useful otherwise.
APA, Harvard, Vancouver, ISO, and other styles
22

Rudoy, Melanie Beth. "Multistage mean-variance portfolio selection in cointegrated vector autoregressive systems." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/46794.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 187-190).
The problem of portfolio choice is an example of sequential decision making under uncertainty. Investors must consider their attitudes towards risk and reward in face of an unknown future, in order to make complex financial choices. Often, mathematical models of investor preferences and asset return dynamics aid in this process, resulting in a wide range of portfolio choice paradigms, one of which is considered in this thesis. Specifically, it is assumed that the investor operates so as to maximize his expected terminal wealth, subject to a risk (variance) constraint, in what is known as mean-variance optimal (MVO) portfolio selection, and that the log-prices of the assets evolve according a simple linear system known as a cointegrated vector autoregressive (VAR) process. While MVO portfolio choice remains the most popular formulation for single-stage asset allocation problems in both academia and industry, computational difficulties traditionally limit its use in a dynamic, multistage setting. Cointegration models are popular among industry practitioners as they encode the belief that the log-prices of many groups of assets are not WSS, yet move together in a coordinated fashion. Such systems exhibit temporary states of disequilibrium or relative asset mis-pricings that can be exploited for profit. Here, a set of multiperiod trading strategies are developed and studied. Both static and dynamic frameworks are considered, in which rebalancing is prohibited or allowed, respectively. Throughout this work, the relationship between the resulting portfolio weight vectors and the geometry of a cointegrated VAR process is demonstrated. In the static case, the performance of the MVO solution is analyzed in terms of the use of leverage, the correlation structure of the inter-stage portfolio returns, and the investment time horizon.
(cont.) In the dynamic setting, the use of inter-temporal hedging enables the investor to further exploit the negative correlation among the inter-stage returns. However, the stochastic parameters of the per-stage asset return distributions prohibit the development of a closed-form solution to the dynamic MVO problem, necessitating the use of Monte Carlo methods. To address the computational limitations of this numerical approximation, a set of four approximate dynamic schemes are considered. Each relaxation is suboptimal, yet admits a tractable solution. The relative performance of these strategies, demonstrated through simulations involving synthetic and real data, depends again on the investment time horizon, the use of leverage and the statistical properties of the inter-stage portfolio returns.
by Melanie Beth Rudoy.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
23

Nguyen, Tâm Willy. "Thrust Vector Control of Multi-Body Systems Subject to Constraints." Doctoral thesis, Universite Libre de Bruxelles, 2018. https://dipot.ulb.ac.be/dspace/bitstream/2013/279469/5/contratTN.pdf.

Full text
Abstract:
This dissertation focuses on the constrained control of multi-body systems which are actuated by vectorized thrusters. A general control framework is proposed to stabilize the task configuration while ensuring constraints satisfaction at all times. For this purpose, the equations of motion of the system are derived using the Euler-Lagrange method. It is seen that under some reasonable conditions, the system dynamics are decoupled. This property is exploited in a cascade control scheme to stabilize the points of equilibrium of the system. The control scheme is composed of an inner loop, tasked to control the attitude of the vectorized thrusters, and an outer loop which is tasked to stabilize the task configuration of the system to a desired configuration. To prove stability, input-to-state stability and small gain arguments are used. All stability properties are derived in the absence of constraints, and are shown to be local. The main result of this analysis is that the proposed control scheme can be directly applied under the assumption that a suitable mapping between the generalized force and the real inputs of the system is designed. This thesis proposes to enforce constraints by augmenting the control scheme with two types of Reference Governor units: the Scalar Reference Governor, and the Explicit Reference Governor. This dissertation presents two case studies which inspired the main generalization of this thesis: (i) the control of an unmanned aerial and ground vehicle manipulating an object, and (ii) the control of a tethered quadrotor. Two further case studies are discussed afterwards to show that the generalized control framework can be directly applied when a suitable mapping is designed.
Doctorat en Sciences de l'ingénieur et technologie
info:eu-repo/semantics/nonPublished
APA, Harvard, Vancouver, ISO, and other styles
24

Gupta, Anil K. "Functional fault modeling and test vector development for VLSI systems." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/90932.

Full text
Abstract:
The attempts at classification of functional faults in VLSI chips have not been very successful in the past. The problem is blown out of proportions because methods used for testing have not evolved at the same pace as the technology. The fault-models proposed for LSI systems are no longer capable of testing VLSI devices efficiently. Thus the stuck-at and short/open fault models are outdated. Despite this fact, these old models are used in the industry with some modifications. Also, these gate-level fault models are very time-consuming and costly to run on the mainframe computers. In this thesis, a new method is developed for fault modeling at the functional level. This new method called 'Model Perturbation' is shown to be very simple and viable for automation. Some general sets of rules are established for fault selection and insertion. Based on the functional fault model introduced, a method of test vector development is formulated. Finally, the results obtained from functional fault simulation are related to gate level coverage. The validity and simplicity of using these models for combinational and sequential VLSI circuits is discussed. As an example, the modeling of IBM's AMAC chip, the work on which was done under contract YD 190121, is described.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
25

Wang, Xuyan. "Landscape dynamic modelling with vector map algebra in GIS /." [St. Lucia, Qld.], 2004. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18161.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Hayes, Timothy. "Novel vector architectures for data management." Doctoral thesis, Universitat Politècnica de Catalunya, 2015. http://hdl.handle.net/10803/397645.

Full text
Abstract:
As the rate of annual data generation grows exponentially, there is a demand to manage, query and summarise vast amounts of information quickly. In the past, frequency scaling was relied upon to push application throughput. Today, Dennard scaling has ceased, and further performance must come from exploiting parallelism. Vector architectures offer a highly efficient and scalable way of exploiting data-level parallelism (DLP) through sophisticated single instruction-multiple data (SIMD) instruction sets. Traditionally, vector machines were used to accelerate scientific workloads rather than business-domain applications. In this thesis, we design innovative vector extensions for a modern superscalar microarchitecture that are optimised for data management workloads. Based on extensive analysis of these workloads, we propose new algorithms, novel instructions and microarchitectural optimisations. We first profile a leading commercial decision support system to better understand where the execution time is spent. We find that the hash join operator is responsible for a significant portion of the time. Based on our profiling, we develop lightweight integer-based pipelined vector extensions to capture the DLP in the operator. We then proceed to implement and evaluate these extensions using a custom simulation framework based on PTLsim and DRAMSim2. We motivate key design decisions based on the structure of the algorithm and compare these choices against alternatives experimentally. We discover that relaxing the base architecture's memory model is very beneficial when executing a vectorised implementation of the algorithm. This relaxed model serves as a powerful mechanism to execute indexed vector memory instructions out of order without requiring complex associative hardware. We find that our vectorised implementation shows good speedups. Furthermore, the vectorised version exhibits better scalability compared to the original scalar version run on a microarchitecture with larger superscalar and out-of-order structures. We then make a detailed study of SIMD sorting algorithms. Using our simulation framework, we evaluate the strengths, weaknesses and scalability of three diverse vectorised sorting algorithms- quicksort, bitonic mergesort and radix sort. We find that each of these algorithms has its unique set of bottlenecks. Based on these findings, we propose VSR sort- a novel vectorised non-comparative sorting algorithm that is based on radix sort but without its drawbacks. VSR sort, however, cannot be implemented directly with typical vector instructions due to the irregularity of its DLP. To facilitate the implementation of this algorithm, we define two new vector instructions and propose a complementary hardware structure for their execution. We find that VSR sort significantly outperforms each of the other vectorised algorithms. Next, we propose and evaluate five different ways of vectorising GROUP BY data aggregations. We find that although data aggregation algorithms are abundant in DLP, it is often too irregular to be expressed efficiently using typical vector instructions. By extending the hardware used for VSR sort, we propose a set of vector instructions and novel algorithms to better capture this irregular DLP. Furthermore, we discover that the best algorithm is highly dependent on the characteristics of the input. Finally, we evaluate the area, energy and power of these extensions using McPAT. Our results show that our proposed vector extensions come with a modest area overhead, even when using a large maximum vector length with lockstepped parallel lanes. Using sorting as a case study, we find that all of the vectorised algorithms consume much less energy than their scalar counterpart. In particular, our novel VSR sort requires an order of magnitude less energy than the scalar baseline. With respect to power, we discover that our vector extensions present a very reasonable increase in wattage.
El crecimiento exponencial de la ratio de creación de datos anual conlleva asociada una demanda para gestionar, consultar y resumir cantidades enormes de información rápidamente. En el pasado, se confiaba en el escalado de la frecuencia de los procesadores para incrementar el rendimiento. Hoy en día los incrementos de rendimiento deben conseguirse mediante la explotación de paralelismo. Las arquitecturas vectoriales ofrecen una manera muy eficiente y escalable de explotar el paralelismo a nivel de datos (DLP, por sus siglas en inglés) a través de sofisticados conjuntos de instrucciones "Single Instruction-Multiple Data" (SIMD). Tradicionalmente, las máquinas vectoriales se usaban para acelerar aplicaciones científicas y no de negocios. En esta tesis diseñamos extensiones vectoriales innovadoras para una microarquitectura superescalar moderna, optimizadas para tareas de gestión de datos. Basándonos en un extenso análisis de estas aplicaciones, también proponemos nuevos algoritmos, instrucciones novedosas y optimizaciones en la microarquitectura. Primero, caracterizamos un sistema comercial de soporte de decisiones. Encontramos que el operador "hash join" es responsable de una porción significativa del tiempo. Basándonos en nuestra caracterización, desarrollamos extensiones vectoriales ligeras para datos enteros, con el objetivo de capturar el paralelismo en este operandos. Entonces implementos y evaluamos estas extensiones usando un simulador especialmente adaptado por nosotros, basado en PTLsim y DRAMSim2. Descubrimos que relajar el modelo de memoria de la arquitectura base es altamente beneficioso, permitiendo ejecutar instrucciones vectoriales de memoria indexadas, fuera de orden, sin necesitar hardware asociativo complejo. Encontramos que nuestra implementación vectorial consigue buenos incrementos de rendimiento. Seguimos con la realización de un estudio detallado de algoritmos de ordenación SIMD. Usando nuestra infraestructura de simulación, evaluamos los puntos fuertes y débiles así como la escalabilidad de tres algoritmos vectorizados de ordenación diferentes quicksort, bitonic mergesort y radix sort. A partir de este análisis, proponemos "VSR sort" un nuevo algoritmo de ordenación vectorizado, basado en radix sort pero sin sus limitaciones. Sin embargo, VSR sort no puede ser implementado directamente con instrucciones vectoriales típicas, debido a la irregularidad de su DLP. Para facilitar la implementación de este algoritmo, definimos dos nuevas instrucciones vectoriales y proponemos una estructura hardware correspondiente. VSR sort consigue un rendimiento significativamente más alto que los otros algoritmos. A continuación, proponemos y evaluamos cinco maneras diferentes de vectorizar agregaciones de datos "GROUP BY". Encontramos que, aunque los algoritmos de agregación de datos tienen DLP abundante, frecuentemente este es demasiado irregular para ser expresado eficientemente usando instrucciones vectoriales típicas. Mediante la extensión del hardware usado para VSR sort, proponemos un conjunto de instrucciones vectoriales y algoritmos para capturar mejor este DLP irregular. Finalmente, evaluamos el área, energía y potencia de estas extensiones usando McPAT. Nuestros resultados muestran que las extensiones vectoriales propuestas conllevan un aumento modesto del área del procesador, incluso cuando se utiliza una longitud vectorial larga con varias líneas de ejecución vectorial paralelas. Escogiendo los algoritmos de ordenación como caso de estudio, encontramos que todos los algoritmos vectorizados consumen mucha menos energía que una implementación escalar. En particular, nuestro nuevo algoritmo VSR sort requiere un orden de magnitud menos de energía que el algoritmo escalar de referencia. Respecto a la potencia disipada, descubrimos que nuestras extensiones vectoriales presentan un incremento muy razonable
APA, Harvard, Vancouver, ISO, and other styles
27

Matsuo, Reijiro. "LAGRANGIAN FORMULATION OF MOND; MOND FIELD IN PERTURBED SPHERICAL SYSTEMS." Case Western Reserve University School of Graduate Studies / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1278389814.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Jeanrenaud, Philippe. "Subband coding of images with recursive allpass filters using vector quantization." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/15659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Shakeel, Mohammad Danish. "Land Cover Classification Using Linear Support Vector Machines." Connect to resource online, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1231812653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Drezet, Pierre M. L. "Kernel methods and their application to systems idenitification and signal processing." Thesis, University of Sheffield, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Karagiozis, Konstantinos. "Analytical map approximations to vector fields, the Rössler and Lorenz systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0018/MQ54629.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Krishnamurthy, Sandeep Humchadakatte. "Fundamental Limits and Joint Design of Wireless Systems with Vector Antennas." NCSU, 2005. http://www.lib.ncsu.edu/theses/available/etd-08302005-191341/.

Full text
Abstract:
Multiple-antenna systems have generated tremendous research interest in the recent past mainly because of their promise of significant gains in capacity and performance as compared to single-antenna systems. Most work on multiple antennas has focused on the design of coding and modulation schemes, channel estimation algorithms and decoding architectures. Information is sent by the transmitter as electromagnetic (EM) waves which subsequently undergo multipath fading before they reach the receiver. The EM properties of the antennas and the nature of the scattering environment jointly impact the performance of communication algorithms. However, there are relatively few works in the literature that consider this interrelation in the design of transmitter-receiver architectures. In this dissertation we study three such problems: the dependence of capacity on the EM properties of antennas and the scattering environment, the limits on performance of parameter estimation algorithms at the receiver and finally, the fundamental limits on the capacity that volume-limited multiple-antenna systems can achieve. We first consider the joint design of multi-element antennas and capacity-optimal signalling for a multiple-input multiple-output (MIMO) wireless channel. We use EM theory and ray-tracing methods to derive a channel propagation model for antennas that can detect or excite more than one component of the electric field vector (known as vector antennas) in a discrete-multipath channel environment. This model provides insights into the inter-relation between the spatial multiplexing gain and the nature of the multipath environment for vector antennas. We then generalize this model to the case of antennas with more general electric-field patterns in a fading environment with clusters of scatterers. Capacity-optimal signalling and the impact of antenna electric field patterns on capacity are studied. We focus on joint antenna-signal design and derive optimality criterion for multi-element antenna systems for maximizing the ergodic capacity. We show that antennas that have orthogonal and equal norm electric-field patterns maximize the ergodic capacity. Vector antennas satisfy this criteria, but a uniform linear array does not. We next consider the problem of positioning and direction-of-arrival (DOA) estimation with ultrawideband (UWB) vector antennas. Due to the wideband nature of the antenna response and directional sensitivity of vector antennas, precise ranging and DOA estimation of a transmitting source can be jointly performed. We first derive a frequency-domain Cramer-Rao Bound formula in the asymptotic case of a large number of observation samples in stationary noise. We apply this formula to two UWB vector antennas and obtain closed-form lower-bound expressions for the ranging and DOA error covariances. A criterion based on the linearized confidence region is used to design signal pulses that give uniform resolving capability to the antennas for any DOA. Finally, we consider the fundamental capacity limits that a multi-element antenna system that is restricted to occupy a finite volume can achieve. For simplicity, we consider the problem of a spherical volume current source radiating into space with a receiver in the far-field capable of detecting the electric field on a concentric spherical surface. The system is first described as a linear operator, and the exact singular values of the system are derived in closed form. The singular values and hence the capacity is shown to depend on the transmitter volume only through its radius. We calculate the capacity of such a system, and provide capacity formulas that are accurate at high signal-to-noise ratio.
APA, Harvard, Vancouver, ISO, and other styles
33

Dickmeis, Christina Verfasser], Rainer [Akademischer Betreuer] [Fischer, and Dirk [Akademischer Betreuer] Prüfer. "Artificial plant viral vector systems / Christina Dickmeis ; Rainer Fischer, Dirk Prüfer." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1130151190/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Song, Yidi. "Parallel vector fitting of systems characterised by measured or simulated data." Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=117134.

Full text
Abstract:
During the past decade, technology in the electronics industry has advanced considerably. The integrated circuits we are using today are becoming more and more complex. As a result, modeling those complex systems has become a difficult task. The vector fitting method is a very efficient tool for building a model based on measured or simulated data. However, for large scale systems, the vector fitting method runs slowly or even fails to converge at the end. One of the solutions to the problem is the parallel vector fitting which was introduced a few years ago. Recently, the parallel computing and cloud computing have become more popular. It would be much more efficient if we can use the concept of parallel computing to do the vector fitting. Since each column in the admittance matrix Y is independent from each other. Calculations on one column will not affect the results of another column. Thus, we can do multiple column vector fittings at the same time. This concept leads to the idea of doing the vector fitting in a parallel way. During the algorithm, many columns are being vector fitted at the same time. There is one small model for each column. After all columns are done, an extra routine will be executed to combine all sub-models into one complete model. In this way, we can achieve a descent speedup factor which leads to less total computing time. The final model is verified so that it is as accurate as the one generated by the traditional vector fitting. In this thesis, detailed concepts will be presented. Methods will be explained step by step and examples will be tested and analyzed.
Au cours des dix dernières années, la technologie dans l'industrie d'électronique a avancé fortement. Le circuit intégré que nous utilisons aujourd'hui est devenu de plus en plus complexe. En conséquence, la modélisation de ces systèmes complexes est devenue une tâche difficile. Le vector fitting est un outil très efficace pour la construction d'un modèle basé sur des données mesurées ou simulées. Cependant, pour le système sur une grande échelle, le montage vecteur fonctionne lentement ou n'arrive même pas à obtenir de résultat à la fin. Une des solutions à ce problème est le vector fitting parallèle qui a été introduit il ya quelques années. Récemment, le calcul parallèle et le cloud computing sont devenus plus populaires. Il serait beaucoup plus efficace si nous pouvons utiliser le concept de calcul parallèle pour faire le vector fitting. Étant donné que chaque colonne de la matrice admittance Y est indépendante de l'autre. Travailler sur une colonne n'affectera pas les résultats d'une autre colonne. Ainsi, nous pouvons faire plusieurs de vector fitting de colonne en même temps. Ce concept conduit à l'idée de vector fitting parallèle. Au cours de l'algorithme, de nombreuses colonnes sont muni vecteur en même temps. Il y a un petit modèle pour chaque colonne. Après toutes les colonnes sont faites, une routine supplémentaire sera exécuté à combiner tous les sous-modèles dans un modèle complet. De cette façon, nous pouvons parvenir à une application plus rapide et il y aura moins de temps d'exécution. Le modèle final est vérifié pour être sûr qu'il soit aussi précise que la seule tradition. Dans cette thèse, les concepts détaillés seront présentés. Le méthode sera expliquée étape par étape et les exemples seront testés et analysés.
APA, Harvard, Vancouver, ISO, and other styles
35

Qi, Xiaomin. "Fixed points, fractals, iterated function systems and generalized support vector machines." Licentiate thesis, Mälardalens högskola, Utbildningsvetenskap och Matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-33511.

Full text
Abstract:
In this thesis, fixed point theory is used to construct a fractal type sets and to solve data classification problem. Fixed point method, which is a beautiful mixture of analysis, topology, and geometry has been revealed as a very powerful and important tool in the study of nonlinear phenomena. The existence of fixed points is therefore of paramount importance in several areas of mathematics and other sciences. In particular, fixed points techniques have been applied in such diverse fields as biology, chemistry, economics, engineering, game theory and physics. In Chapter 2 of this thesis it is demonstrated how to define and construct a fractal type sets with the help of iterations of a finite family of generalized F-contraction mappings, a class of mappings more general than contraction mappings, defined in the context of b-metric space. This leads to a variety of results for iterated function system satisfying a different set of contractive conditions. The results unify, generalize and extend various results in the existing literature. In Chapter 3, the theory of support vector machine for linear and nonlinear classification of data and the notion of generalized support vector machine is considered. In the thesis it is also shown that the problem of generalized support vector machine can be considered in the framework of generalized variation inequalities and results on the existence of solutions are established.
FUSION
APA, Harvard, Vancouver, ISO, and other styles
36

Dickmeis, Christina [Verfasser], Rainer [Akademischer Betreuer] Fischer, and Dirk [Akademischer Betreuer] Prüfer. "Artificial plant viral vector systems / Christina Dickmeis ; Rainer Fischer, Dirk Prüfer." Aachen : Universitätsbibliothek der RWTH Aachen, 2015. http://d-nb.info/1130151190/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Damera-Venkata, Niranjan. "Analysis and design of vector error diffusion systems for image halftoning /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004247.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Perez, Daniel Antonio. "Performance comparison of support vector machine and relevance vector machine classifiers for functional MRI data." Thesis, Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34858.

Full text
Abstract:
Multivariate pattern analysis (MVPA) of fMRI data has been growing in popularity due to its sensitivity to networks of brain activation. It is performed in a predictive modeling framework which is natural for implementing brain state prediction and real-time fMRI applications such as brain computer interfaces. Support vector machines (SVM) have been particularly popular for MVPA owing to their high prediction accuracy even with noisy datasets. Recent work has proposed the use of relevance vector machines (RVM) as an alternative to SVM. RVMs are particularly attractive in time sensitive applications such as real-time fMRI since they tend to perform classification faster than SVMs. Despite the use of both methods in fMRI research, little has been done to compare the performance of these two techniques. This study compares RVM to SVM in terms of time and accuracy to determine which is better suited to real-time applications.
APA, Harvard, Vancouver, ISO, and other styles
39

Arens, Robert Segre Alberto Maria. "Learning to rank documents with support vector machines via active learning." [Iowa City, Iowa] : University of Iowa, 2009. http://ir.uiowa.edu/etd/331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Punzi, Clara. "Stable Isomorphism vs Isomorphism of Vector Bundles: an Application to Quantum Systems." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18229/.

Full text
Abstract:
La classificazione dei materiali sulla base delle fasi topologiche della materia porta allo studio di particolari fibrati vettoriali sul d-toro con alcune strutture aggiuntive. Solitamente, tale classificazione si fonda sulla nozione di isomorfismo tra fibrati vettoriali; tuttavia, quando il sistema soddisfa alcune assunzioni e ha dimensione abbastanza elevata, alcuni autori ritengono invece sufficiente utilizzare come relazione d’equivalenza quella meno fine di isomorfismo “stabile”. Scopo di questa tesi è fissare le condizioni per le quali la relazione di isomorfismo “stabile” può sostituire quella di isomorfismo senza generare inesattezze. Ciò nei particolari casi in cui il sistema fisico quantistico studiato non ha simmetrie oppure è dotato della simmetria discreta di inversione temporale.
APA, Harvard, Vancouver, ISO, and other styles
41

Usmani, Bilal Ahmed. "Investigating disease persistence in host vector systems : dengue as a case study." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7416/.

Full text
Abstract:
The investigation of pathogen persistence in vector-borne diseases is important in different ecological and epidemiological contexts. In this thesis, I have developed deterministic and stochastic models to help investigating the pathogen persistence in host-vector systems by using efficient modelling paradigms. A general introduction with aims and objectives of the studies conducted in the thesis are provided in Chapter 1. The mathematical treatment of models used in the thesis is provided in Chapter 2 where the models are found locally asymptotically stable. The models used in the rest of the thesis are based on either the same or similar mathematical structure studied in this chapter. After that, there are three different experiments that are conducted in this thesis to study the pathogen persistence. In Chapter 3, I characterize pathogen persistence in terms of the Critical Community Size (CCS) and find its relationship with the model parameters. In this study, the stochastic versions of two epidemiologically different host-vector models are used for estimating CCS. I note that the model parameters and their algebraic combination, in addition to the seroprevalence level of the host population, can be used to quantify CCS. The study undertaken in Chapter 4 is used to estimate pathogen persistence using both deterministic and stochastic versions of a model with seasonal birth rate of the vectors. Through stochastic simulations we investigate the pattern of epidemics after the introduction of an infectious individual at different times of the year. The results show that the disease dynamics are altered by the seasonal variation. The higher levels of pre-existing seroprevalence reduces the probability of invasion of dengue. In Chapter 5, I considered two alternate ways to represent the dynamics of a host-vector model. Both of the approximate models are investigated for the parameter regions where the approximation fails to hold. Moreover, three metrics are used to compare them with the Full model. In addition to the computational benefits, these approximations are used to investigate to what degree the inclusion of the vector population in the dynamics of the system is important. Finally, in Chapter 6, I present the summary of studies undertaken and possible extensions for the future work.
APA, Harvard, Vancouver, ISO, and other styles
42

McDonald, Ian Robert. "Development of Bacillus host/vector systems for studying gene transfer in compost." Thesis, University of Liverpool, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Cheung, Bing-Leung Patrick. "Simulation of Adaptive Array Algorithms for OFDM and Adaptive Vector OFDM Systems." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/34915.

Full text
Abstract:
The increasing demand for high data rate services necessitates the adoption of very wideband waveforms. In this case, the channel is frequency-selective, that is, a large number of resolvable multipaths are present in this environment and fading is not highly correlated across the band. Orthogonal frequency division multiplexing (OFDM) is well-known to be effective against multipath distortion. It is a multicarrier communication scheme, in which the bandwidth of the channel is divided into subcarriers and data symbols are modulated and transmitted on each subcarrier simultaneously. By inserting guard time that is longer than the delay spread of the channel, an OFDM system is able to mitigate intersymbol interference (ISI). Deploying an adaptive antenna array at the receiver can help separate the desired signal from interfering signals which originate from different spatial locations. This enhancement of signal integrity increases system capacity. In this research, we apply adaptive array algorithms to OFDM systems and study their performance in a multipath environment with the presence of interference. A novel adaptive beamforming algorithm based on the minimum mean-squared error (MMSE) criterion, which is referred to as frequency-domain beamforming, is proposed that exploits the characteristics of OFDM signals. The computational complexity of frequency-domain beamforming is also studied. Simulation results show employing an adaptive antenna array with an OFDM system significantly improves system performance when interference is present. Simulations also show that the computational complexity of the algorithm can be reduced by half without significant performance degradation. Adaptive array algorithms based on the maximum signal-to-noise ratio (MSNR) and the maximum signal-to-interference-plus-noise ratio (MSINR) criteria are also applied to adaptive vector OFDM systems (AV-OFDM). Simulation results show that the adaptive algorithm based on the MSNR criterion has superior performance in the multipath environment but performs worse than the one based on the MSINR criterion under the flat fading channel.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
44

Kim, Sang-youb. "A fast estimation algorithm of array response vector for adaptive smart antenna systems /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Love, Kimberly R. "Modeling Error in Geographic Information Systems." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/29900.

Full text
Abstract:
Geographic information systems (GISs) are a highly influential tool in today's society, and are used in a growing number of applications, including planning, engineering, land management,and environmental study. As the field of GISs continues to expand, it is very important to observe and account for the error that is unavoidable in computerized maps. Currently, both statistical and non-statistical models are available to do so, although there is very little implementation of these methods. In this dissertation, I have focused on improving the methods available for analyzing error in GIS vector data. In particular, I am incorporating Bayesian methodology into the currently popular G-band error model through the inclusion of a prior distribution on point locations. This has the advantage of working well with a small number of points, and being able to synthesize information from multiple sources. I have also calculated the boundary of the confidence region explicitly, which has not been done before, and this will aid in the eventual inclusion of these methods in GIS software. Finally, I have included a statistical point deletion algorithm, designed for use in situations where map precision has surpassed map accuracy. It is very similar to the Douglas-Peucker algorithm, and can be used in a general line simplification situation, but has the advantage that it works with the error information that is already known about a map rather than adding unknown error. These contributions will make it more realistic for GIS users to implement techniques for error analysis.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
46

Claesson, Kenji. "Implementation and Validation of Independent Vector Analysis." Thesis, Umeå University, Physics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-32306.

Full text
Abstract:

This Master’s Thesis was part of the project called Multimodalanalysis at the Depart-ment of Biomedical Engineering and Informatics at the Ume˚ University Hospital inUme˚ Sweden. The aim of the project is to develop multivariate measurement anda,analysis methods of the skeletal muscle physiology. One of the methods used to scanthe muscle is functional ultrasound. In a study performed by the project group datawas aquired, where test subjects were instructed to follow a certain exercise scheme,which was measured. Since there currently is no superior method to analyze the result-ing data (in form of ultrasound video sequences) several methods are being looked at.One considered method is called Independent Vector Analysis (IVA). IVA is a statisticalmethod to find independent components in a mix of components. This Master’s Thesisis about segmenting and analyzing the ultrasound images with help of IVA, to validateif it is a suitable method for this kind of tasks.First the algorithm was tested on generated mixed data to find out how well itperformed. The results were very accurate, considering that the method only usesapproximations. Some expected variation from the true value occured though.When the algorithm was considered performing to satisfactory, it was tested on thedata gathered by the study and the result can very well reflect an approximation of truesolution, since the resulting segmented signals seem to move in a possible way. But themethod has weak sides (which have been tried to be minimized) and all error analysishas been done by human eye, which definitly is a week point. But for the time being itis more important to analyze trends in the signals, rather than analyze exact numbers.So as long as the signals behave in a realistic way the result can not be said to becompletley wrong. So the overall results of the method were deemed adequate for the application at hand.


Multimodalanalys
APA, Harvard, Vancouver, ISO, and other styles
47

Aslam, Salman Muhammad. "Target tracking using residual vector quantization." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42883.

Full text
Abstract:
In this work, our goal is to track visual targets using residual vector quantization (RVQ). We compare our results with principal components analysis (PCA) and tree structured vector quantization (TSVQ) based tracking. This work is significant since PCA is commonly used in the Pattern Recognition, Machine Learning and Computer Vision communities. On the other hand, TSVQ is commonly used in the Signal Processing and data compression communities. RVQ with more than two stages has not received much attention due to the difficulty in producing stable designs. In this work, we bring together these different approaches into an integrated tracking framework and show that RVQ tracking performs best according to multiple criteria on publicly available datasets. Moreover, an advantage of our approach is a learning-based tracker that builds the target model while it tracks, thus avoiding the costly step of building target models prior to tracking.
APA, Harvard, Vancouver, ISO, and other styles
48

Devine, Jon. "Support Vector Methods for Higher-Level Event Extraction in Point Data." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/DevineJ2009.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Schenck, Hannes [Verfasser], Thomas [Akademischer Betreuer] Nattermann, and Joachim [Akademischer Betreuer] Krug. "Vector Chiral Phases in Frustrated Systems / Hannes Schenck. Gutachter: Thomas Nattermann ; Joachim Krug." Köln : Universitäts- und Stadtbibliothek Köln, 2015. http://d-nb.info/1074243277/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Naveendra, Thiyagarajah Sudharshan. "Diffuse vector channel estimation and robust reception for antenna array DS-CDMA systems." Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417919.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Vector systems' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography