Switched state-feedback controllers with multi-estimators for MIMO systems
|
|
- Antony Weaver
- 5 years ago
- Views:
Transcription
1 Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR TŮMA BOŘIVOJ HANUŠ AND JAROLAV HLAVA Department of Control Engineering Technical Universit of Liberec Faclt of Mechatronics 6 7 Liberec Hálkova 6 CZECH REPUBLIC Abstract: witched controllers can often otperform traditional adaptive control The paper starts with a brief overview of the development of the field of switched controllers After that it describes an original control architectre based on controller and estimator switching This architectre ses state-feedback control with switched controllers to cope with controlled sstem dnamics changes If conventional observer were sed to estimate the nmeasrable state variables the control performance wold deteriorate becase the estimation reslts cold be corrpted b distrbances acting at varios points of the controlled sstem To overcome this problem the proposed architectre incldes also a bank of switched estimators Each of these estimators is tned for a specific inpt point of a distrbance witching logic is sed to select the most sitable estimator that ields the most reliable estimate in an particlar control sitation A considerable deal of attention is devoted to etensive testing of the proposed architectre sing compter simlation The testing reslts are promising ewords: witched sstems Hbrid sstems witched controller witched-estimators Introdction In man practical sitations the controller design is complicated b considerable modelling ncertainties sstem parameters changes non-linearities and large nmeasrable distrbances There are some classical soltions to this kind of problems The aim of the robst control design methodolog is to design controller that achieves a specified level of performance nder an ncertaint from the assmed ncertaint set However if the ncertaint set is too large the controller becomes ver conservative with nacceptabl slggish nominal responses Another classical soltion is adaptive control In this approach the controller is selected on the basis of the crrent estimate of the ncertain process and this selection is done over a continosl parameteried famil of candidate controllers Adaptive control can be sed even if ncertaint is large and robst control design tools are inapplicable However this approach also has some well known inherent limitations In particlar if nknown parameters enter the process model in a complicated wa it ma be difficlt to constrct a continosl parametried famil of candidate controllers Moreover on-line identification of process model over a continm ma also be a difficlt problem Ths the design of adaptive control algorithms ma be fairl complicated and the final sccess will often depend on trial and error In this paper we will focs on an alternative approach that seeks to overcome some of the above mentioned problems Its main distingishing featre is that controller selection is done sing sitable switching logic not b continos tning witching control Unlike adaptive control which can be considered a classical field of the control theor the se of switched controllers is a relativel new idea Althogh its origins can be traced back to the eighties (the pioneering work is b Mårtensson [6] another important earl paper is []) most papers on switched controllers have been pblished dring the last decade Becase of the hbrid (mied continos/logical) strctre of the control sstem switched controllers can be stdied within a more general framework of hbrid control The algorithms proposed in the earl papers sed a ver simple switching mechanism The were based on a seqential or pre-roted search among a set of candidate controllers This blind search of an acceptable controller is time consming and as a reslt of it the control performance (in particlar the transient behavior) of sch controllers is poor Considerabl better reslts can be achieved with switching algorithms that evalate online the potential performance of each candidate controller and se this to direct their search These algorithms can frther be divided into two main categories:
2 block block Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November switching algorithms based on process estimation and algorithms based on a direct performance evalation of each candidate controller The first categor of algorithms can be represented eg b references [7] [8] and [] Its principle can briefl be eplained in the following wa The switching algorithm (spervisor) continosl compares the behavior of the process with the behavior a several admissible process models in order to determine which model is more likel to describe the actal process The decision is based on the estimation errors achieved with respective models The model with smallest estimation error is regarded as an estimate of the actal process and the spervisor places in the loop the candidate controller that is the most adeqate one for this estimated model Ths the strctre of an estimator-based spervisor consists of a mltiestimator responsible for evalating which admissible model best matches the process and a decision logic that selects which candidate controller shold be sed Algorithms based on direct performance evalation can be characteried b the fact that the spervisor attempts to assess directl the potential performance of ever candidate controller withot tring to estimate the model of the process To achieve this the spervisor comptes certain performance signals that provide a measre of how well each of the candidate controllers C n wold perform in a conceptal eperiment in which the actal control signal wold be generated b C n as a response to the measred process otpt This tpe of spervision is inspired b the idea of controller falsification introdced in [] The strctre of this kind of spervisor incldes a performance monitor that generates the performance signals and a decision logic that selects which candidate controller shold be sed This approach is the relativel less sed one An eample of a paper sing this approach is [9] In the seqel we will basicall follow the approach based on process estimation However the standard algorithm that makes the selection among different controllers in response to the controlled sstem dnamics changes will be agmented with another featre If the controller ses state feedback it is necessar not onl to estimate which of the process models is the most appropriate one bt it is also necessar to estimate the nmeasrable state variables If conventional observer were sed to estimate these nmeasrable state variables the control performance wold deteriorate becase the estimation reslts can be corrpted b distrbances acting at varios points of the controlled sstem (distrbance at sstem inpt or otpt distrbance acting at some other point of the controlled sstem) To overcome this problem the proposed architectre incldes also a bank of switched estimators Each of these estimators is tned for a specific inpt point of a distrbance witching logic is etended so that it cold select the most sitable estimator that ields the most reliable estimate in an particlar control sitation Control sstem architectre The basic strctre of the control sstem is shown in Fig A ver simple set of candidate controllers is sed for the sake of eplanation It incldes onl two controllers for two nominal models of the controlled sstem However etension to a larger set is straightforward A bank of estimators tned for different kinds of distrbances is associated with each controller The following distrbances are considered: d IN distrbance acting at sstem inpt d OUT distrbance at sstem otpt d ARX d ARMAX general distrbances acting anwhere in the sstem described b ARX or ARMAX model The discrete integrators (/(- - )) are added to the basic state feedback strctre in order to prevent stead state errors The state feedback controllers are tned for corresponding nominal models according to qadratic performance criterion (- - ) (- ) T T J Q + Q () d IN d ARX d ARMAX d OUT Controlled sstem (- ) - d - M Estimators Controller d Estimators Controller E M - E E E - w Fig The strctre of the control sstem with switched controllers and switched incremental estimators
3 Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November Controlled sstem is described b A A + B + B d () where is vector of measrable state variables is vector of not measrable state variables d is a distrbance (d d IN d ARX d ARMAX d OUT otherwise d ) Estimators are described b where E E A A + E B + + E d ~ () are the state variables of the E estimator corresponding to the ^ time increments of the controlled sstem state variables d ~ - the inpt distrbance which is estimated b means of the estimator ( d ~ M ε s M B for d ~ d IN d ARMAX otherwise d ~ ) The block with the incremental estimators of the tpe E ARMAX and which also model the controlled sstem in the nominal regimes is connected to the otpt of the controlled sstem and forms inpt to the controller The estimators are tned for the tpes of the epected distrbances d s inpts The information abot the step distrbance inpt is estimated b means of the matri M (see Fig ) from the estimators error ε s and it is transferred frther into the estimator b means of the corrective feedback (some frther reslts regarding the strctre of these estimators were pblished b the athors in [] and []) The maimm nmber of distrbances entering the controlled sstem simltaneosl in one grop is eqal to the nmber of the measrable state variables The nmber of sch grops is nlimited The estimator error is also sed to estimate which nominal model tned in the block of the estimators is closest to the crrent behavior of the controlled sstem If discrete controller is sed the estimator ields the estimate of all nmeasrable state variables Ever estimator of ever nominal block is connected permanentl to the measrable otpt of the controlled sstem and its error ε s is evalated The estimator operates either in its nominal fnctions (eg E ARMAX ) or it is switched over in the fnction It is switched into the control operation if it is evalated as the most sitable one (after the evalation of its error ε s ) The strateg of the estimators switching aims at reaching the smallest vale of the estimators errors ε s as fast as possible The switching algorithm is realied b means of the logic fnctions Testing eperiments The following controlled sstem was sed for testing s+ s+ + s+ s+ () where is integer coefficient that parametries nominal models Now onl two nominal regimes are considered for simplicit ( ) The corresponding discrete time transfer fnctions with the sampling interval T s are for and for () (6) The discrete integrators are combined with the description of the controlled sstem A B + (7) A where is vector of controlled state variables is vector of not controlled state variables The description (7) is agmented with state variables of the integrators (see Figa) I A B + A B (8) A B / 6 a) / 6 6 continos case- t/( ) / discrete case 6 c) d) Fig tep response of the discrete integrator b)
4 Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November a) + ( ) c) + ( ) d) ( ) b) T s and T s The proposed hbrid control strctre was tested with the discretied model (() and (6)) of the real continos sstem () Parameter of the model can be changed The otpt controlled variables of the model are connected permanentl to the estimators ( ) witch are tned for the step distrbances (d ARX d IN d OUT ) Control sstem switches over the estimator fnctions ( ) and connects the estimator to the controller and the controller to the disrete integrator The control performance was tested with different vales of and different step distrbance inpts in the controlled sstem The responses are compared with the control responses of a controlled sstem with all state variables measrable The controllers of both control sstems are eqall tned according to the performance criterion () and to the parameter of the controlled sstem Ever single test is carried ot for one nominal regime of the controlled sstem ( or ) and for one-step distrbance (d IN d OUT and w) in the time s The test incldes the responses of on the sstem with measrable state variables and the responses on the sstem with estimators the differences - and and the changes of the nominal regime and of the tpe of the estimators dring the process The testing reslts are in Fig to Fig Fig distrbance d IN Fig distrbance d IN E - E E Fig distrbance d IN E Fig6 distrbance d IN E E
5 Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November Fig7 distrbance 6 8 d OUT E Fig distrbance d OUT E E Fig8 distrbance d OUT E E Fig9 distrbance d OUT - E Fig distrbance Fig distrbance w E - - w E
6 Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November Fig distrbance Fig distrbance Conclsion w - - E E - w - - E E - A novel hbrid control architectre based on controller and estimator switching was described and tested sing the compter simlation with a model of linear mltivariable forth order sstem with two nominal models The control sstem consists of two blocks with the estimators tned for the epected distrbances (d IN d OUT d ARX ) each block with one of the nominal transfer fnctions The vale of the distrbances is evalated from the estimator errors in the first sampling instant (sing matri M) The tpe of the distrbance and the nominal model of the controlled sstem are estimated in the second sampling instant b means of the comparison of the estimator otpt and of the response of the controlled sstem The reference vale w changes are controlled withot error b means of the estimator of an tpe The error vales from the following sampling instants can be accmlated for frther evalation The sampling intervals of the estimators and of the controllers ma be different The testing reslts are promising and the confirm the epectations Frther testing of this control architectre will be done sing the laborator plant for eperiments with hbrid control that was described b the athors in [] Acknowledgement: This research has been spported b the Cech cience Fondation within project //8 References [] F M and Barmish B R Adaptive stabiliation of linear sstems via switching control IEEE Transactions on Atomatic Control Vol 986 pp 97- [] Hanš B and Tůma L Estimators for hbrid mltidimensional control sstem with variable strctre Proceedings of the th International Conference on Process Control Štrbské pleso lovak Repblic Ma [] Hanš B and Tůma L Hbrid Control cheme With Discrete Estimator for Efficient Distrbance Rejection Preprints of the 6th IFAC World Congress Prage Cech Repblic Jl [] Hlava J and Šlc B An Eperimental Approach to Verification of Control Algorithms for Hbrid Continos-Discrete stems WEA Transactions on stems Vol No 6 pp 6-6 [] Liberon D witching in stems and Control Birkhäser [6] Mårtensson B The order of an stabiliing reglator is sfficient a priori information for adaptive stabiliation stems & Control Letters Vol 6 No 98 pp 87 9 [7] Morse A pervisor control of families of linear set-point controllers part : eact matching IEEE Transactions on Atomatic Control Vol No 996 pp - [8] A Morse pervisor control of families of linear set-point controllers - part : robstness IEEE Transactions on Atomatic Control Vol No 997 pp - [9] Mosca E Capecchi F and Casavola A Designing predictors for MIMO switching spervisor control International Jornal of Adaptive Control and ignal Processing pecial Vol No pp 6 86 [] afonov MG and Tsao T-C The nfalsified control concept and learning Proceedings of the rd Conference on Decision and Control pp 89 8 Dec99
Real-Time Implementation of Adaptive Optimal Controller Based on a Pseudo-Space Model into PLC
Proceedings of the th WSEAS International Conference on SYSEMS, Agios Nikolaos, Crete Island, Greece, Jl 3-5, 7 3 Real-ime Implementation of Adaptive Optimal Controller Based on a Psedo-Space Model into
More informationThe effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems
The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, 15-887 Bialstok,
More informationExploiting Actuator Limits with Feedforward Control based on Inverse Models
Exploiting Actator Limits with Feedforward Control based on Inverse Models Manel Gräber TLK-Thermo GmbH Hans-Sommer-Str. 5, 386 Branschweig, German Abstract Feedforward control based on inverse dnamic
More informationHoming, Calibration and Model-Based Predictive Control for Planar Parallel Robots
Homing, Calibration and Model-Based Predictive Control for Planar Parallel Robots Květoslav Belda*, Pavel Píša** * Department of Adaptive Sstems, Institte of Information heor and Atomation, Academ of Sciences
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationA SIMULATION PLATFORM FOR LOCALIZATION AND MAPPING
A SIMULATION PLATFORM FOR LOCALIZATION AND MAPPING Thomas Hanefeld Sejerøe, Niels Kjølstad Polsen Ole Ravn, Ørsted DTU, Atomation, The Technical Universit of Denmark, Bilding 6, DK-8 Kgs. Lngb, Denmark
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationReview. A single-cycle MIPS processor
Review If three instrctions have opcodes, 7 and 5 are they all of the same type? If we were to add an instrction to IPS of the form OD $t, $t2, $t3, which performs $t = $t2 OD $t3, what wold be its opcode?
More informationAn Optimization of Granular Network by Evolutionary Methods
An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationAUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING
AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in
More informationContinuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function
J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationProf. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:
EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationA RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA
A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationPARTITIONING AND MODULAR CODE SYNTHESIS FOR RECONFIGURABLE MECHATRONIC SOFTWARE COMPONENTS
ARTITIONING AND MODULAR CODE SYNTHESIS FOR RECONFIGURABLE MECHATRONIC SOFTWARE COMONENTS Sven Brmester and Holger Giese Software Engineering Grop University of aderborn Warbrger Str. 00, D-33098 aderborn,
More informationPROGRAM LICENSE AGREEMENT LIMITED WARRANTY... 4 Trademarks Contents Preface... 11
. Contents PROGRAM LICENSE AGREEMENT... LIMITED WARRANTY... 4 Trademarks... 6. Contents... 8 Preface... 2. Overview... 3 2. Jst one other important thing... 3 2.2 Abot the ser manal... 4 2.3 Manal System
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationSubgraph Matching with Set Similarity in a Large Graph Database
1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationREDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION
REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION Jdith Redi, Paolo Gastaldo, Rodolfo Znino, and Ingrid Heyndericx (+) University of Genoa, DIBE, Via Opera Pia a - 645 Genova
More informationNew Architectures for Hierarchical Predictive Control
Preprint, 11th IFAC Symposim on Dynamics and Control of Process Systems, inclding Biosystems Jne 6-8, 216. NTNU, Trondheim, Norway New Architectres for Hierarchical Predictive Control Victor M. Zavala
More informationarxiv: v1 [cs.cr] 3 Jun 2017
Spectrm-based deep neral networks for frad detection arxiv:1706.00891v1 [cs.cr] 3 Jn 2017 ABSTRACT Shhan Yan Tongji University 4e66@tongji.ed.cn Jn Li University of Oregon lijn@cs.oregon.ed In this paper,
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationScientific Computing on Bulk Synchronous Parallel Architectures
Scientific Compting on Blk Synchronos Parallel Architectres R. H. Bisseling Department of Mathematics, Utrecht University and W. F. McColl y Programming Research Grop, Oxford University April 27, 1994
More informationAdvance Fuzzy Programming Approach to Bi-Level Quadratic Fractional Programming Problems by Genetic Algorithm
American International Jornal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 38-349, ISSN (Online): 38-3580, ISSN (CD-ROM): 38-369
More informationDynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un
Dynamic Maintenance of Majority Information in Constant Time per Update? Gdmnd S. Frandsen and Sven Skym BRICS 1 Department of Compter Science, University of arhs, Ny Mnkegade, DK-8000 arhs C, Denmark
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationEEC 483 Computer Organization
EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and
More informationTowards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions
Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationIMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING
International Jornal of Modern Engineering Research (IJMER) www.imer.com Vol.1, Isse1, pp-134-139 ISSN: 2249-6645 IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationCombined cine- and tagged-mri for tracking landmarks on the tongue surface
INTERSPEECH 2015 Combined cine- and tagged-mri for tracking landmarks on the tonge srface Honghao Bao 1, Wenhan L 1, Kiyoshi Honda 2,*, Jiango Wei 1, Qiang Fang 3, Jianw Dang 2, 4 1 School of Compter Software,
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationSimplicial Trees are Sequentially Cohen-Macaulay
Simplicial Trees are Seqentiall Cohen-Macala Sara Faridi Agst 27, 2003 Abstract This paper ses dalities between facet ideal theor and Stanle-Reisner theor to show that the facet ideal of a simplicial tree
More informationNormalized averaging using adaptive applicability functions with application in image reconstruction from sparsely and randomly sampled data
Normalized averaging sing adaptive applicability fnctions with application in image reconstrction from sparsely and randomly sampled data Tan Q. Pham, Lcas J. van Vliet Pattern Recognition Grop, Faclty
More information10.2 Solving Quadratic Equations by Completing the Square
. Solving Qadratic Eqations b Completing the Sqare Consider the eqation We can see clearl that the soltions are However, What if the eqation was given to s in standard form, that is 6 How wold we go abot
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationHardware Design Tips. Outline
Hardware Design Tips EE 36 University of Hawaii EE 36 Fall 23 University of Hawaii Otline Verilog: some sbleties Simlators Test Benching Implementing the IPS Actally a simplified 6 bit version EE 36 Fall
More informationTOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS
TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS Bastien Pasdelop, Réda Alami, Vincent Gripon Telecom Bretagne UMR CNRS Lab-STICC name.srname@telecom-bretagne.e Michael Rabbat McGill University ECE
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationWhat s New in AppSense Management Suite Version 7.0?
What s New in AMS V7.0 What s New in AppSense Management Site Version 7.0? AppSense Management Site Version 7.0 is the latest version of the AppSense prodct range and comprises three prodct components,
More informationUnit Testing with VectorCAST and AUTOSAR
Unit Testing with VectorCAST and AUTOSAR Vector TechDay Software Testing with VectorCAST V1.0 2018-11-15 Agenda Introdction Unit Testing Demo Working with AUTOSAR Generated Code Unit Testing AUTOSAR SWCs
More informationPART I: Adding Instructions to the Datapath. (2 nd Edition):
EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================
More informationCSE Introduction to Computer Architecture Chapter 5 The Processor: Datapath & Control
CSE-45432 Introdction to Compter Architectre Chapter 5 The Processor: Datapath & Control Dr. Izadi Data Processor Register # PC Address Registers ALU memory Register # Register # Address Data memory Data
More informationInput Selection Using Local Model Network Trees
Preprints of the 9th World Congress The International Federation of Atomatic Control Cape Town, Soth Africa. Agst -9, Inpt Selection Using Local Model Network Trees Jlian Belz Oliver Nelles Universit of
More informationOn the complexity of Submap Isomorphism
On the compleit of Sbmap Isomorphism Christine Solnon 1,2, Gillame Damiand 1,2, Colin de la Higera 3, and Jean-Christophe Janodet 4 1 INSA de Lon, LIRIS, UMR 5205 CNRS, 69621 Villerbanne, France 2 Université
More informationChapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind
Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationPara-catadioptric camera auto-calibration from epipolar geometry
CENTER FOR MACHINE PERCEPTION CZECH TECHNICAL UNIVERSITY Para-catadioptric camera ato-calibration from epipolar geometry Branislav Mičšík and Tomáš Pajdla micsb1@cmp.felk.cvt.cz, pajdla@cmp.felk.cvt.cz
More informationSecure Biometric-Based Authentication for Cloud Computing
Secre Biometric-Based Athentication for Clod Compting Kok-Seng Wong * and Myng Ho Kim School of Compter Science and Engineering, Soongsil University, Sangdo-Dong Dongjak-G, 156-743 Seol Korea {kswong,kmh}@ss.ac.kr
More informationInteraction Nets. Simon Gay Queens
Interaction Nets Simon Ga Qeens Diploma in Compter Science 1991 Name College Project Title Qeens Simon Ga Interaction Nets Eamination Diploma in Compter Science 1991 Word Cont Approimatel 11200 Originator
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationVideo Denoising using Transform Domain Method
Video Denoising sing Transform Domain Method Lina Desale 1, Prof. S. B. Borse 1 E&TC Dept, LGNSCOE, Nashik E&TC Dept, LGNSCOE, Nashik Abstract Utmost prevailing practical digital video denoising techniqes
More informationStaCo: Stackelberg-based Coverage Approach in Robotic Swarms
Maastricht University Department of Knowledge Engineering Technical Report No.:... : Stackelberg-based Coverage Approach in Robotic Swarms Kateřina Staňková, Bijan Ranjbar-Sahraei, Gerhard Weiss, Karl
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
Implementation of a linear qadratic bmpless transfer method to a magnetically levitated planar actator with moving magnets Kowalski, K.K.; Achterberg, J.; van Lierop, C.M.M.; van den Bosch, P.P.J. Pblished
More informationAddressing in Future Internet: Problems, Issues, and Approaches
Addressing in Ftre Internet: Problems, Isses, and Approaches Mltimedia and Mobile commnications Laboratory Seol National University Jaeyong Choi, Chlhyn Park, Hakyng Jng, Taekyong Kwon, Yanghee Choi 19
More informationASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES
ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES Workgrop Metrology of CNRS research network 2519 a MCIMS, Presented by Larent Robert and Jean-José Orte b a http://www.ifma.fr/lami/gdr2519/ b CROMeP,
More informationA choice relation framework for supporting category-partition test case generation
Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationComputing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3
Compting the weights of criteria with interval-valed fzzy sets for MCDM problems Chen-ng Chen Kan-Hng in 2 Hi-ing Cheng 3 Department of Information Management National nited niversity aiwan 2 Specialist
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationReview: Computer Organization
Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes
More informationNETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS. A Project by. Sandeep Bimali
NETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS A Project by Sandeep Bimali Bacelor s Degree in Electronics Engineering, Tribvani University, Nepal December 21 Sbmitted to te Department of Electrical
More informationThe Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment
More informationMa Lesson 18 Section 1.7
Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationAccess Professional Edition 2.1
Engineered Soltions Access Professional Edition 2.1 Access Professional Edition 2.1 www.boschsecrity.com Compact access control based on Bosch s innovative AMC controller family Integrated Video Verification
More informationMETAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY
VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia
More information