Дисертації з теми "Algebraic system"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Algebraic system".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Wilder, A. J. "Algebraic tables : abstract computability and system documentation." Thesis, Swansea University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.636599.
Повний текст джерелаPietschker, Andrej. "Automated test generation from algebraic specifications." Thesis, University of Newcastle Upon Tyne, 2002. http://hdl.handle.net/10443/2015.
Повний текст джерелаWeickert, J. "Navier-Stokes equations as a differential-algebraic system." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800942.
Повний текст джерелаEl, Nabrawy Iman Mohamed Omar. "Algebraic issues in linear multi-dimensional system theory." Thesis, Loughborough University, 2006. https://dspace.lboro.ac.uk/2134/36004.
Повний текст джерелаHjelmblom, Magnus. "Norm-Regulation of Agent Systems : Instrumentalizing an algebraic approach to agent system norms." Doctoral thesis, Stockholms universitet, Institutionen för data- och systemvetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-120602.
Повний текст джерелаEn arkitektur för normreglerade multiagentsystem baserad på en algebraisk representation av normativa system instrumentaliseras och vidareutvecklas. Kärnan i instrumentaliseringen utgörs av en Prolog-modul som tillsammans med ett Java-bibliotek kan användas för att skapa client/server-baserad körbar kod. Normer representeras som ordnade par av grundvillkor och följdvillkor. De senare konstrueras genom att normativa operatorer appliceras på deskriptiva villkor. Från sådana generella normativa villkor följer normativa satser om specifika sakförhållanden, vilka i sin tur ger upphov till förbud mot eller tillåtelse att utföra enskilda handlingar i olika situationer. Vidare skisseras en metod för att göra körbara multiagentsystem till verktyg för problemlösning genom att använda evolutionära mekanismer för att odla fram normativa system. Konstruktionen av normskapande operatorer på villkor, vilka ligger till grund för representationen av normativa system, betraktas ur två olika synvinklar. (i) En logisk analys, baserad på Kanger-Lindahls teori om normativa positioner. Denna resulterar i två utökade uppsättningar av typer av normativa positioner och utgående från en algebraisk version av ett av dessa utökade system konstrueras sedan en uppsättning operatorer för att skapa agentspecifika normer. (ii) En alternativ analys, som tar sin utgångspunkt i en systematisk undersökning av olika typer av tillståndsövergångar. Denna ger upphov till en uppsättning av normskapande operatorer som är baserade på förbud mot olika typer av övergångar. Argument presenteras vidare för att inom ramen för en klass av övergångssystem, där övergångar är deterministiska och associerade med en agent som utför en handling, så specificerar operatorer baserade på (ii) en meningsfull semantik för operatorer baserade på (i). Teoretiska resultat tillsammans med tillgängliggjord programkod och exempel på tillämpningar bidrar till att underlätta skapandet av teoretiskt sunda, transparent beskrivna och effektivt implementerade normreglerade system av autonoma agenter.
At the time of the doctoral defense, the following papers were unpublished and had a status as follows: Paper 4: Submitted. Paper 5: Forthcoming.
Moyer, Nathan Thomas. "A knapsack-type cryptographic system using algebraic number rings." Pullman, Wash. : Washington State University, 2010. http://www.dissertations.wsu.edu/Dissertations/Spring2010/n_moyer_032610.pdf.
Повний текст джерелаAlmaghrawi, Ahmed Almaamoun. "The application of an algebraic constraint system in electromagnetics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0021/MQ55016.pdf.
Повний текст джерелаAlmaghrawi, Ahmed Almaamoun. "The application of an algebraic constraint system in electormagnetics /." Thesis, McGill University, 1999. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29852.
Повний текст джерелаACS has the ability to solve a set of equations. Also, it is able to answer user queries and reveal the reasoning process used in obtaining a solution. With respect to inconsistencies, the system is able to verify the data provided by the user. In the case of inconsistencies, the user is notified as to the appropriate course of action to be taken.
The system has the ability to permit the user to investigate other design possibilities and find alternate design paths. Also, the system allows a default design strategy that can be imposed by an expert and invoked by a novice designer. The purpose is to provide assistance and guidelines to a novice designer, thereby allowing him to reach the desired solution.
Scott, B. G. O. "A methodology for formal system development using process algebraic techniques." Thesis, University of Oxford, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294356.
Повний текст джерелаHays, Christopher Thomas. "An algebraic axiom environment for software testing (axenvironment)." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186399.
Повний текст джерелаSaldanha, Carlos M. "An algebraic constraint system for computer-aided design in magnetics /." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=64003.
Повний текст джерелаEghosa, Edeghagba Elijah. "Ω-Algebraic Structures". Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2017. https://www.cris.uns.ac.rs/record.jsf?recordId=104206&source=NDLTD&language=en.
Повний текст джерелаTema ovog rada je fazifikovanje algebarskih i relacijskih struktura u okviru omega- skupova, gdeje Ω kompletna mreza. U radu se bavimo sintezom oblasti univerzalne algebre i teorije rasplinutih (fazi) skupova. Naša istraživanja omega-algebarskih struktura bazirana su na omega-vrednosnoj jednakosti,zadovoljivosti identiteta i tehnici rada sa nivoima. U radu uvodimo omega-algebre,omega-vrednosne kongruencije, odgovarajuće omega-strukture, i omega-vrednosne homomorfizme i istražujemo veze izmedju ovih pojmova. Dokazujemo da postoji Ω -vrednosni homomorfizam iz Ω -algebre na odgovarajuću količničku Ω -algebru. Jezgro Ω -vrednosnog homomorfizma je Ω- vrednosna kongruencija. U vezi sa nivoima struktura, dokazujemo da Ω -vrednosni homomorfizam odredjuje klasične homomorfizme na odgovarajućim količničkim strukturama preko nivoa podalgebri. Osim toga, Ω-vrednosna kongruencija odredjuje sistem zatvaranja klasične kongruencije na nivo podalgebrama. Dalje, identiteti su očuvani u Ω- vrednosnim homomorfnim slikama.U nastavku smo u okviru Ω-skupova uveli Ω-mreže kao uredjene skupove i kao algebre i dokazali ekvivalenciju ovih pojmova. Ω-poset je definisan kao Ω -relacija koja je antisimetrična i tranzitivna u odnosu na odgovarajuću Ω-vrednosnu jednakost. Definisani su pojmovi pseudo-infimuma i pseudo-supremuma i tako smo dobili definiciju Ω-mreže kao uredjene strukture. Takodje je definisana Ω-mreža kao algebra, u ovim kontekstu nosač te strukture je bi-grupoid koji je saglasan sa Ω-vrednosnom jednakošću i ispunjava neke mrežno-teorijske formule. Koristeći aksiom izbora dokazali smo da su dva pristupa ekvivalentna. Dalje smo uveli i pojam potpune Ω-mreže kao uopštenje klasične potpune mreže. Dokazali smo još neke rezultate koji karakterišu Ω-strukture.Data je i veza izmedju Ω-algebre i pojma slabih kongruencija.Na kraju je dat prikaz pravaca daljih istrazivanja.
Rashed, Shawki al [Verfasser], and Gerhard [Akademischer Betreuer] Pfister. "Numerical Algorithms in Algebraic Geometry with Implementation in Computer Algebra System SINGULAR / Shawki Al-Rashed. Betreuer: Gerhard Pfister." Kaiserslautern : Universitätsbibliothek Kaiserslautern, 2011. http://d-nb.info/1017757763/34.
Повний текст джерелаSato, Kazuhiro. "An Algebraic Analysis Approach to Trajectory Tracking Control." 京都大学 (Kyoto University), 2014. http://hdl.handle.net/2433/188865.
Повний текст джерелаSyrmos, Vassilis L. "Feedback design techniques in linear system theory : geometric and algebraic approaches." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/13348.
Повний текст джерелаSong, Xuefeng. "Dynamic modeling issues for power system applications." Texas A&M University, 2003. http://hdl.handle.net/1969.1/1591.
Повний текст джерелаLin, Chuan-kai. "Practical Type Inference for the GADT Type System." PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/367.
Повний текст джерелаGabrielson, Donald D. "Battle group stationing algebraic modeling system : an anti-air warfare tactical decision aid methodology /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1995. http://handle.dtic.mil/100.2/ADA296246.
Повний текст джерелаBarrachina, Sergio, Peter Benner, and Enrique S. Quintana-Ortí. "Solving Large-Scale Generalized Algebraic Bernoulli Equations via the Matrix Sign Function." Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601684.
Повний текст джерелаMiscione, Steven. "Loop algebras and algebraic geometry." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=116115.
Повний текст джерелаGroechenig, Michael. "Autoduality of the Hitchin system and the geometric Langlands programme." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:f0a08e96-2f25-4df1-9e56-99931e411f73.
Повний текст джерелаPUERTO, AUBEL ADRIAN. "Algebraic Structures for the Analysis of Distributability of Elementary Systems and their Processes." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2019. http://hdl.handle.net/10281/241253.
Повний текст джерелаThis work studies systems, and the processes they execute, in the way they can be distributed. To this aim, the central notion is that when a system is distributed, a remote observation requires an exchange of information from the different locations of the system. This approach is characterised by the fact that handshaking is the basic mode of interaction. The chosen formalisms are taken in the framework Petri net theory. Elemen- tary net systems, and condition/event net systems provide specifications for the systems. Causal nets and partially ordered sets allow for modelling processes. With these last formalisations, the state of the art provides a notion of subpro- cesses that can be structured so as to carry information on how a process can be distributed. This structure is formalised as an orthomodular lattice. This work shows that the minimal non trivial elements of this lattice, the minimal subprocesses, can be ordered so as to provide an abstraction of the process. The nature of this notion of subprocess permits to show that this abstraction depicts the localities of the process, parts of the process which can run independently from each other. The behaviour of elementary, and condition/event net systems, is modelled with labelled transition systems. This work adheres to an interpretation of the set of elementary regions, as the one of locally observable properties of the sys- tem, motivated by elementary net synthesis. According to this interpretation, elementary regions represent a suitable specification of the available infrastruc- ture on which to distribute a system. The state of the art shows that the set of regions of an elementary, or condition/event system, forms an orthomodular poset, and a way to retrieve a canonical labelled transition system such that all regions of the orthomodular poset are also regions of it. The question of whether this canonical transition system has more regions than the specified ones is an open problem. The canonical transition system is the largest one can obtain from an orthomodular poset, in the sense that systems complying with the specification, can be found as subsystems of it. However, not all its subsystems display the same regional structure. This work presents a sufficient condition for this to happen. This is achieved by providing a structure to the set of events, or labels, of the canonical system, which reflects concurrency. An orthomodular poset is called stable when it is isomorphic to the set of regions of its canonical transition system. The state of the art shows that when the first poset is of a given class, it embeds in the second. It is conjectured that all posets that arise as the set of elementary regions of an elementary system, regional posets, are stable. This work provides a condition necessary for an orthomodular poset to be regional, and shows that when it holds, the embedding is strong. Not every embedding is strong, but all isomorphisms are, in particular, strong embeddings. This result implies that the embedding maps minimal regions to minimal regions.
Rebahi, Yacine. "Irrégularité des D-modules algébriques holonomes." Université Joseph Fourier (Grenoble ; 1971-2015), 1996. http://www.theses.fr/1996GRE10205.
Повний текст джерелаChapman, Suzannah M. "TEACHING AN ALGEBRAIC EQUATION TO HIGH SCHOOL STUDENTS WITH MODERATE TO SEVERE INTELLECTUAL DISABILITY." UKnowledge, 2016. http://uknowledge.uky.edu/edsrc_etds/25.
Повний текст джерелаLeclerc, Marc-Antoine. "Homogeneous Projective Varieties of Rank 2 Groups." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23558.
Повний текст джерелаHaiech, Mercedes. "Étude algébrique des systèmes d'équations différentielles polynomiales d'ordre arbitraire." Thesis, Rennes 1, 2020. http://www.theses.fr/2020REN1S035.
Повний текст джерелаIn this thesis, several lines of study whose common denominator is differential algebra have been followed to highlight some algebraic properties of systems of differential equations. In one part we have been interested in the overdetermination of ordinary linear differential equation systems and have produced an algorithm to find the generators of such a system.Another part deals with the understanding of the support of partial differential equation solutions using tools from tropical geometry. In a third part, we were interested in the geometrical object described by the set of solutions of an ordinary differential equation and relate the existence of singular essential components for the considered differential equation and the decrease of the dimension of the tangent space of this object calculated at the neighborhood of non-degenerated solutions. In particular, this study involves looking at completion of non-Netherian rings; this situation and the related pathologies are also at the heart of two other parts of this thesis
Sauthoff, Georg [Verfasser]. "Bellman's GAP : a 2nd generation language and system for algebraic dynamic programming / Georg Sauthoff. Technische Fakultät - AG Praktische Informatik." Bielefeld : Universitätsbibliothek Bielefeld, Hochschulschriften, 2011. http://d-nb.info/1015210317/34.
Повний текст джерелаHanselmann, Thomas. "Approximate dynamic programming with adaptive critics and the algebraic perceptron as a fast neural network related to support vector machines." University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2003. http://theses.library.uwa.edu.au/adt-WU2004.0005.
Повний текст джерелаAlmabruk, Bleblou Omalkhear Salem. "Some new lattice valued algebraic structures with comparative analysis of various approaches." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2017. https://www.cris.uns.ac.rs/record.jsf?recordId=105400&source=NDLTD&language=en.
Повний текст джерелаOvaj rad bavi se komparativnom analizom različitih pristupa rasplinutim (fazi) algebarskim strukturama i odnosom tih struktura sa odgovarajućim klasičnim algebrama. Posebna pažnja posvećena je poredenju postojećih pristupa ovom problemu sa novim tehnikama i pojmovima nedavno razvijenim na Univerzitetu u Novom Sadu. U okviru ove analize, proučavana su i proširenja kao i redukti algebarskih struktura u kontekstu rasplinutih algebri. Brojne važne konkretne algebarske strukture istraživane su u ovom kontekstu, a neke nove uvedene su i ispitane. Bavili smo se detaljnim istrazivanjima Ω-grupa, sa stanovista kongruencija, normalnih podgrupa i veze sa klasicnim grupama. Nove strukture koje su u radu uvedene u posebnom delu, istrazene su sa aspekta svojstava i medusobne ekvivalentnosti. To su Ω-Bulove algebre, kao i odgo-varajuce mreže i Bulovi prsteni. Uspostavljena je uzajamna ekvivalentnost tih struktura analogno odnosima u klasičnoj algebri. U osnovi naše konstrukcije su mrežno vrednosne algebarske strukture denisane na klasičnim algebrama koje ne zadovoljavaju nužno identitete ispunjene na odgovarajucim klasičnim strukturama (Bulove algebre, prsteni, grupe itd.), već su to samo algebre istog tipa. Klasična jednakost zamenjena je posebnom kompatibilnom rasplinutom (mrežno-vrednosnom) relacijom ekvivalencije. Na navedeni nacin i u cilju koji je u osnovi teze (poredenja sa postojecim pristupima u ovoj naucnoj oblasti) proucavane su (vec denisane) Ω-grupe. U nasim istraživanju uvedene su odgovarajuće normalne podgrupe. Uspostavljena je i istražena njihova veza sa Ω-kongruencijama. Normalna podgrupa Ω-grupe definisana je kao posebna klasa Ω-kongruencije. Jedan od rezultata u ovom delu je da su količničke grupe definisane pomocu nivoa Ω-jednakosti klasične normalne podgrupe odgovarajućih količničkih podgrupa polazne -grupe. I u ovom slučaju osnovna struktura na kojoj je denisana Ω-grupa je grupoid, ne nužno grupa. Opisane su osobine najmanje normalne podgrupe u terminima Ω-kongruencija, a date su i neke konstrukcije Ω-kongruencija.Rezultati koji su izloženi u nastavku povezuju različite pristupe nekim mrežno- vrednosnim strukturama. Ω-Bulova algebra je uvedena na strukturi sa dve binarne, unarnom i dve nularne operacije, ali za koju se ne zahteva ispunjenost klasičnih aksioma. Identiteti za Bulove algebre važe kao mrežno-teoretske formule u odnosu na mrežno-vrednosnu jednakost. Klasicne Bulove algebre ih zadovoljavaju, ali obratno ne vazi: iz tih formula ne slede standardne aksiome za Bulove algebre. Na analogan nacin uveden je i Ω-Bulov prsten. Glavna svojstva ovih struktura su opisana. Osnovna osobina je da se klasične Bulove algebre odnosno Bulovi prsteni javljaju kao količničke strukture na nivoima Ω -jednakosti. Veza ove strukture sa Ω-Bulovom mrežom je pokazana.Kao ilustracija ovih istraživanja, u radu je navedeno više primera.
Jones, Clinton Christopher. "Determining Coefficients of Checking Polynomials for an Algebraic Method of Fault Tolerant Computations of Numerical Functions." Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5242.
Повний текст джерелаSong, Kyle Seregay. "Two-Phase Flow Measurement using Fast X-ray Line Detector System." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/103371.
Повний текст джерелаDoctor of Philosophy
Gas-liquid flow phenomenon exists in an extensive range of natural and engineering systems, for example, hydraulic pipelines in a nuclear reactor, heat exchanger, pump cavitation, and boilers in the gas-fired power stations. Accurate measurement of the void fraction is essential to understand the behaviors of the two-phase flow phenomenon. However, measuring void fraction distribution in two-phase flow is a difficult task due to its complex and fast-changing interfacial structure. This study developed a comprehensive suite of the non-intrusive x-ray measurement techniques, and a pixel-to-radial conversion algorithm to process the line- and time-averaged void fraction information. The newly developed algorithm, called the Area-based Onion-Peeling (ABOP) method, can convert the pixel measurement to the radial void fraction distribution, which is more useful for studying and modeling axisymmetric flows. Various flow conditions are measured and evaluated for the benchmarking of the algorithm. Finally, classical 2-D reconstruction algorithms are investigated for the void fraction measurement in non-axisymmetric flows. A comprehensive summary of the performance of these algorithms for a two-phase flow study is provided. An in-depth sensitivity study using synthetic bubbles has been performed to examine the effect of uncertainty factors and to benchmark the algorithms for the non-axisymmetric flows.
Kipps, Mark Rew. "A modular approach to modeling an isolated power system on a finite voltage bus using a differential algebraic equation solving routine." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA281036.
Повний текст джерелаLonghi, Maurício Borges. "Controle de sistemas quadráticos sujeitos à saturação de atuadores." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/107486.
Повний текст джерелаThis work addresses the problem of local stabilization of continuous-time quadratic systems (possibly open-loop unstable) and subject to actuator saturation. Furthermore, the work addresses a study of techniques for synthesis of anti-windup compensators for quadratic systems subject to actuator saturation. The study approach is comparative in the sense of considering two representations of quadratic systems. The first one is the Differential Algebraic Representation — DAR, suitable for the entire class of rational systems. The second representation consists in a quadratic decomposition, particular for quadratic systems. In both cases, it is used the deadzone nonlinearity and the generalized sector condition in order to deal with the saturation. For both representations, state-dependent Linear Matrix Inequalities — LMIs conditions are obtained to provide a control law with the aim of stabilize the closed-loop system while providing a region of guaranteed stability, associated to a Lyapunov function. Based on the same methodology, techniques are proposed for the synthesis of static and dynamic anti-windup compensators. Numerical examples are presented to verify the effectiveness of proposed methods.
Arruda, Rafael Lucas de [UNESP]. "Teorema de Riemann-Roch e aplicações." Universidade Estadual Paulista (UNESP), 2011. http://hdl.handle.net/11449/86493.
Повний текст джерелаFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
O objetivo principal deste trabalho é estudar o Teorema de Riemann-Roch, um dos resultados fundamentais na teoria de curvas algébricas, e apresentar algumas de suas aplicações. Este teorema é uma importante ferramenta para a classificação das curvas algébricas, pois relaciona propriedades algébricas e topológicas. Daremos uma descrição das curvas algébricas de gênero g, 1≤ g ≤ 5, e faremos um breve estudo dos pontos de inflexão de um sistema linear sobre uma curva algébrica
The main purpose of this work is to discuss The Riemann-Roch Theorem, wich is one of the most important results of the theory algebraic curves, and to present some applications. This theorem is an important tool of the classification of algebraic curves, sinces relates algebraic and topological properties. We will describle the algebraic curves of genus g, 1≤ g ≤ 5, and also study inflection points of a linear system on an algebraic curve
Pierce, Robyn U. "An exploration of algebraic insight and effective use of computer algebra systems /." Connect to thesis, 2001. http://eprints.unimelb.edu.au/archive/00000739.
Повний текст джерелаKUSAKARI, Keiichirou, Masahiko SAKAI, and Toshiki SAKABE. "Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting." IEICE, 2005. http://hdl.handle.net/2237/9580.
Повний текст джерелаKondo, Naoya, Kimihiro Umemura, Liren Zhou, and Hideyuki Azegami. "Shape optimization for a link mechanism." Springer, 2013. http://hdl.handle.net/2237/21125.
Повний текст джерелаSydney, Ali. "The evaluation of software defined networking for communication and control of cyber physical systems." Diss., Kansas State University, 2013. http://hdl.handle.net/2097/15577.
Повний текст джерелаDepartment of Electrical and Computer Engineering
Don Gruenbacher
Caterina Scoglio
Cyber physical systems emerge when physical systems are integrated with communication networks. In particular, communication networks facilitate dissemination of data among components of physical systems to meet key requirements, such as efficiency and reliability, in achieving an objective. In this dissertation, we consider one of the most important cyber physical systems: the smart grid. The North American Electric Reliability Corporation (NERC) envisions a smart grid that aggressively explores advance communication network solutions to facilitate real-time monitoring and dynamic control of the bulk electric power system. At the distribution level, the smart grid integrates renewable generation and energy storage mechanisms to improve reliability of the grid. Furthermore, dynamic pricing and demand management provide customers an avenue to interact with the power system to determine electricity usage that satisfies their lifestyle. At the transmission level, efficient communication and a highly automated architecture provide visibility in the power system; hence, faults are mitigated faster than they can propagate. However, higher levels of reliability and efficiency rely on the supporting physical communication infrastructure and the network technologies employed. Conventionally, the topology of the communication network tends to be identical to that of the power network. In this dissertation, however, we employ a Demand Response (DR) application to illustrate that a topology that may be ideal for the power network may not necessarily be ideal for the communication network. To develop this illustration, we realize that communication network issues, such as congestion, are addressed by protocols, middle-ware, and software mechanisms. Additionally, a network whose physical topology is designed to avoid congestion realizes an even higher level of performance. For this reason, characterizing the communication infrastructure of smart grids provides mechanisms to improve performance while minimizing cost. Most recently, algebraic connectivity has been used in the ongoing research effort characterizing the robustness of networks to failures and attacks. Therefore, we first derive analytical methods for increasing algebraic connectivity and validate these methods numerically. Secondly, we investigate impact on the topology and traffic characteristics as algebraic connectivity is increased. Finally, we construct a DR application to demonstrate how concepts from graph theory can dramatically improve the performance of a communication network. With a hybrid simulation of both power and communication network, we illustrate that a topology which may be ideal for the power network may not necessarily be ideal for the communication network. To date, utility companies are embracing network technologies such as Multiprotocol Label Switching (MPLS) because of the available support for legacy devices, traffic engineering, and virtual private networks (VPNs) which are essential to the functioning of the smart grid. Furthermore, this particular network technology meets the requirement of non-routability as stipulated by NERC, but these benefits are costly for the infrastructure that supports the full MPLS specification. More importantly, with MPLS routing and other switching technologies, innovation is restricted to the features provided by the equipment. In particular, no practical method exists for utility consultants or researchers to test new ideas, such as alternatives to IP or MPLS, on a realistic scale in order to obtain the experience and confidence necessary for real-world deployments. As a result, novel ideas remain untested. On the contrary, OpenFlow, which has gained support from network providers such as Microsoft and Google and equipment vendors such as NEC and Cisco, provides the programmability and flexibility necessary to enable innovation in next-generation communication architectures for the smart grid. This level of flexibility allows OpenFlow to provide all features of MPLS and allows OpenFlow devices to co-exist with existing MPLS devices. Therefore, in this dissertation we explore a low-cost OpenFlow Software Defined Networking solution and compare its performance to that of MPLS. In summary, we develop methods for designing robust networks and evaluate software defined networking for communication and control in cyber physical systems where the smart grid is the system under consideration.
Kochinke, Sebastian. "Special Linear Systems on Curves and Algorithmic Applications." Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-219598.
Повний текст джерелаHöfner, Peter. "Algebraic calculi for hybrid systems." Norderstedt Books on Demand, 2009. http://d-nb.info/1000477002/34.
Повний текст джерелаGrundling, Hendrik. "Algebraic structure of degenerate systems /." Title page, table of contents and summary only, 1986. http://web4.library.adelaide.edu.au/theses/09PH/09phg888.pdf.
Повний текст джерелаHadj, Said Yanis. "Prise en compte de la complexité de modélisation dans la gestion énergétique des bâtiments." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAT121/document.
Повний текст джерелаEnergy management for building has become a major issue this last decade because of its energy impact. Building energy management reduces energy wastes and enable a better matching between energy needs and grid capabilities. Different types of energy management systems are proposed in scientific literature, most of them with anticipation capacities.The first results do not really consider the complexity issue coming from the number of modeling elements and also coming from the diversity of energy management applications.This thesis proposes elements of solution to the complexity problem. The work started by analyzing the energy management system 'GHomeTech' and its adaptation to the complex building prototype CANOPEA. The issue of composition from elementary models is explored. A solution is proposed; it enables the reusability of elementary models. Aggregation and transformation into mixed integer linear programming optimization models is presented. The resulting tool has been validated on the CANOPEA project.Energy management is not limited to MILP optimization. Different types of applications are also used to provide other services: parametric estimation models to simplify the configuration of energy management systems, simulation for validation and prediction depending on pre-defined scenarios for example. This other dimension of complexity is discussed in a second part of the manuscript. Solutions for automatic rewriting of models are detailed. It relies on symbolic manipulations in different types of processing. Several examples of applications illustrating the automatic generation of models are presented
Molgado, Alberto. "Refined algebraic quantisation : finite dimensional systems." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423639.
Повний текст джерелаScheufele, Wolfgang. "Algebraic query optimization in Database Systems /." [S.l. : s.n.], 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8299303.
Повний текст джерелаJunqueira, Luiz Antonio Custódio Manganelli. "Estudo de suavizadores para o método Multigrid algébrico baseado em wavelet." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-18082008-141740/.
Повний текст джерелаThis work is comprised of WAMG (Wavelet-Based Algebraic Multigrid) method behavioral analysis based on variety of smoothers, numerical method based on linear equation systems resolution developed at LMAG (Applied Electromagnetism Laboratory). Based on the fact that the vectors represented by WAMG Prolongation and Restriction matrix operators are orthonormals allows the use of a variety of theoretical and practical analysis, and therefore gain visibility of characteristics not feasible through others Multigrid (MG) methods, such as Geometric Multigrid (GMG) and Algebraic Multigrid (AMG). WAMG V-Cycle method with Haar Filter is tested under a variety of linear equation systems, by varying smoothers, relaxation coefficient at Damped Jacobi and Successive Over Relaxation (SOR) smoothers, and pre and post smoothers configurations. The tested smoothers are stationary iterative methods such as Damped Jacobi, SOR, Diagonal type-Sparse Approximate Inverse (SPAI-0) and suggested ones with optimized smoothing characteristic. For comparison purposes, the Conjugate Gradients, Bi-Conjugate Gradient and ICCG non-stationary iterative methods are also tested as smoothers. The testing results are formally presented and commented.
Sehnalová, Pavla. "Konvergence řešení soustav algebraických rovnic." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-236797.
Повний текст джерелаHöfner, Peter [Verfasser]. "Algebraic calculi for hybrid systems / Peter Höfner." Norderstedt : Books on Demand, 2009. http://d-nb.info/1000477002/34.
Повний текст джерелаMatooane, ʾMantśika Amelia. "Parallel systems in symbolic and algebraic computation." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621402.
Повний текст джерелаKammar, Ohad. "Algebraic theory of type-and-effect systems." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/8910.
Повний текст джерелаRabehaja, Mananjanahary Tahiry. "Algebraic verification of probabilistic and concurrent systems." Thesis, University of Sheffield, 2014. http://etheses.whiterose.ac.uk/7456/.
Повний текст джерела