Intelligent Assembly/Disassembly System with a Haptic Device for Aircraft Parts Maintenance
|
|
- Vanessa Woods
- 5 years ago
- Views:
Transcription
1 Intelligent Assemly/Disssemly System with Hptic Device for Aircrft Prts Mintennce Christind nd Jungwon Yoon Mechnicl nd Aerospce Engineering nd ReCAPT, GyeongSng Ntionl University, Jinju, Gyeongnm , Kore Astrct. This pper presents the development of n intelligent Assemly/Disssemly (A/D) system with the utiliztion of hptic device. The development ws imed to ssist the A/D process of ircrft prts mintennce with n intelligent lgorithm. A comprehensive methodology is presented y n intelligent lgorithm generting the est sequence for the ssemled/disssemled prts. For this purpose, genetic lgorithm ws chosen ecuse of its effectiveness nd comptiility deling with the A/D sequencing prolem. Furthermore, A/D process of the prts will lso e clculted in the genetic lgorithm process, which will show the effectiveness of the lgorithm. Moreover, the concept of oth nturl nd rtificil constrints re pplied to generte the pth plnning of the ssemled/disssemled prts. It is elieved tht the comintion of hptic, optimized sequence lgorithm nd intelligent pth plnning will increse efficiency for the overll ircrft prts mintennce process. Keywords: Hptic, Genetic Algorithm, Nturl nd Artificil Constrint, Aircrft Prt Mintennce. 1 Introduction The implementtion of Virtul Relity (VR) technologies such s the medicl nd A/D fields, is incresing. The improvement of VR technologies promises right future for the efficiency of the A/D process, including the mintennce of ircrft prts. Since the physicl ojects re represented in digitl form with VR technologies, users do not need to hve rel oject for the simultion of the process. From tht point of view, the efficiency cn e incresed ecuse of the elimintion of rel oject. Furthermore, the development of VR technologies is lso supported y the development of hptic technologies. Nowdys, some hptic devices re ville nd widely used such s Phntom fmilies [1] from SenseAle TM Corportion nd Omeg x TM from the Force Dimension Corportion. Hptic devices give touch sensing y force-feedck mechnism. Through this mechnism, n opertor will feel the result of collision force. Corresponding uthors. Y. Shi et l. (Eds.): ICCS 2007, Prt II, LNCS 4488, pp , Springer-Verlg Berlin Heidelerg 2007
2 Intelligent Assemly/Disssemly System with Hptic Device 761 The mintennce process itself enefits from dvncements in the VR interfce, since the mintennce process involves mny A/D tsk nd depending on the mount of prts involved. A mintennce simultion could e held to oserve the scheme of mintennce tsk y simulting the process in virtul environment (VE). Borro et l. hve developed the system for the mintinility simultion in eronutics. They comined hptic device to the system nd keep the user s movements sme s those tht occur when testing physicl mock-up [2]. Similr work hs lso een suggested y Svl et l. [3]. Another reserch focused on the development lnguge, such s Virtul Fixture Assemly Lnguge (VFAL) [4]. This lirry could e used to construct vrious virtul fixture series with grphic nd force guidnce rules, mking the low-level hptic nd grphic rendering detils trnsprent to the developers. Gllntuci et. l hve reserched the A/D plnning y using fuzzy nd genetic lgorithms [5]. They utilized genetic lgorithm (GAs) to generte the optiml sequence for A/D tsk. Our reserch focuses on the development of A/D system for the ircrft prt mintennce process. We propose comintion of the utiliztion of hptic device nd n intelligent lgorithm for prt sequence genertion. We utilized genetic lgorithm s n optimiztion method to optimize prt sequence genertion. Even though some reserches lredy hve een suggested this for the prts sequence genertion, they didn t consider the utiliztion of hptic device. Nturl nd rtificil constrint concepts re pplied in this pper. Nturl nd rtificil constrint concepts hve een widely pplied in the rootics field. Even though there hs een extensive reserch [6-7] on the constrints in the hptics field, there hs not een detiled study on its pplicility to ircrft prt mintennce. This pper descries the development of the intelligent system for the ircrft prts mintennce with hptic informtion. 2 Description of Aircrft Prt Mintennce System The schemtic of A/D system is shown in Figure 1. The system consists of hptic device (Phntom omni), Virtul Environment (VE), nd trined opertor. The hptic device cn e considered s n pprtus where n opertor inputs the ction for the mnipulted oject. This device hs only three degree of freedom (3-DOF), so it cn not generte torque. The communiction occurred i-directionlly etween the hptic device nd the VE through fire-wire cle. The mnipulted ojects re ircrft prts with scle model, which ws mde in CAD softwre nd sved s the VRML (Virtul Relity Mchine Lnguge) file formt. After the oject ws trnsferred to VE, the opertor could then mnipulte the oject during the scheme of the mintennce tsk. In the future trils ccording to the design, the movement mde y the opertor will e constrined long to the suggested pth. As the opertor looks t VE, he/she will feel the guidnce force from rtificil nd nturl constrints. The rtificil nd nturl constrints will guide the opertor to put the prt in the right position, using the suggested pth. The virtul environment ws uilt sed on the OpenInventor TM grphic lirry, collision detection lirry, pth plnning lgorithm, nd n optiml sequence genertion lgorithm. Those components work together to mke the ircrft prt mintennce system efficient.
3 762 Christind nd J. Yoon () Schemtic of A/D System () An opertor Fig. 1. An intelligent A/D system for ircrft prts mintennce 3 Aircrft Mintennce System Algorithm The overll system lgorithm is shown in the flowchrt in Fig. 2. First of ll, the system should check the hptic device through the device initiliztion, verify the initil position of hptic stylus, nd then confirm whether collision detection is eing performed or not. This step ws imed to decide which prt will e the first position in the sequence. This procedure gives freedom to the opertor to set the first suitle prt s he/she wish. Since the collision detection lirry only retrieves the coordintes of the colliding polygons nd points, the contct configurtion needs to e reconstructed y considering the possile comintion of surfce fetures etween two odies [6]. For collision detection, the functions from grphic API (Appliction Progrmming Interfce) Open Inventor re utilized [8]. After the first prt of the lgorithm is recognized, we cn perform the optiml sequence genertion. The genetic lgorithm (GAs) is pplied in this step. The GAs lgorithm egins y defining the optimiztion vriles, the cost function, nd the cost [9]. The cost function is function tht shows the reltion etween the optimiztion vrile nd the prmeter for evlution of the prolem solution. The cost is difference etween the ctul solution nd the desired solution. Optimiztion vriles re the vriles tht should e optimized to rech optiml solution for the cse model. The optimiztion vriles re rrnged in chromosome form. A cluster of chromosome is clled s popultion. The optimiztion vriles re sequence order (S), direction of ech prt (O), nd used tool for ech prt (T). where : [ S O T ] chromosome = (1)
4 Intelligent Assemly/Disssemly System with Hptic Device 763 S = ( s s s ) = prt sequence 1 O = ( o o o ) = T = ( t t t ) = used tool for ech prt 1 1 n n = numer of s s s n n prt prt orienttion The evlution of disssemly sequence ws relized y using cost function [5]: Cost function = f chromosome) = ( w l) + w ( N 1 o) + w ( N g 1) (2) ( where the prmeters of the cost function were set to l, o, nd g tht vriles re the mximum length of fesile sequence, the orienttion chnge numer, the gripper chnge numer, respectively. Then, every prmeter ws ssocited with the weight w. Fig. 2. System lgorithm of the intelligent A/D system The use of these cost function prmeters re quite representtive for the cse such s the mintennce tsk. In the mintennce tsk, the numers of orienttion chnges nd tool chnges will ffect the efficiency of overll mintennce process. An nlogy cn e mde to descrie the effect of the cost function prmeters for the overll efficiency. A gripper is tool used to do one tsk of the A/D tsks, wheres the orienttion chnges represent how mny step we needed for doing one tsk in A/D tsk list. It needs to e restted in this cse, tht the est sequence is list of prts in the ssemled order which hve the highest cost function vlue. The rnking for chromosomes will e generted in every genertion (itertion). Rnking is mde y sorting the cost vlue for ech chromosome. Some portion of popultion will e destroyed to give spce for new offspring. This process is clled
5 764 Christind nd J. Yoon nturl selection. Selection rte (X rte ) determines the mount of chromosomes tht still exists fter the nturl selection process. The selection rte is set to 50%. The reltion etween the existing chromosomes (P keep ) nd the numer of popultion (P) is shown in (3). Pkeep = X rte P (3) Then, the numers of the empty spce or the disppering chromosomes re shown in (4). Pdispper = P P keep (4) Hlf of the popultion will dispper nd will e replced y new offspring. The disppered chromosomes (P dispper ) re chromosomes tht hve low cost vlues. In ech genertion, GAs opertor: crossover nd muttion re pplied to produce new offspring. By pplying the GAs opertor, the fitness of the chromosomes cn e incresed. Crossover is process mtching of some nodes in one chromosome to nother chromosome. The results of the crossover process re two new offspring. In this pper, the crossover process is sed on prtilly mtched crossover (PMX) tht ws introduced y Lzzerini et.l with more dvncement clled MPMX [10]. Prents re tken from the existing chromosome (P keep ). The pir of prents re rndomly selected from the existing chromosomes (P keep ). Then, three numers re rndomly selected. Let,, nd l represent the strting nodes for the first nd the second chromosomes, nd the length of the mtching portion, respectively. For exmple: the chromosomes re S A nd S B, l = 4, = 3, = 7, n = 10. S S C C A B [ s4 s5 s8 s1 s9 s2 s6 s10 s7 s3 o4 o5 o8 o1 o9 o2 o6 o10 o7 o3 t4 t5 t8 t1 t9 t2 t6 t10 t7 t3] [ s7 s3 s2 s8 s5 s6 s9 s1 s4 s10 o7 o3 o2 o8 o5 o6 o9 o1 o4 o10 t7 t3 t2 t8 t5 t6 t9 t1 t4 t10 ] After the crossover A B [ s2 s5 s9 s1 s4 s10 s6 s8 s7 s3 o2 o5o9 o1 o4 o10 o6 o8 o7 o3 t2 t5 t9 t1 t4 t10 t6 t8 t7 t3] [ s7 s3 s4 s10 s5 s6 s8 s1 s9 s2 o7 o3 o4 o10 o5 o6 o8 o1 o9 o2 t7 t3 t4 t10 t5 t6 t8 t1 t9 t2 ] Then, the offspring (C A nd C B ) will fill the empty spce in the popultion, replcing the disppering chromosome (P dispper ). A muttion opertor is necessry to increse possiilities for getting etter offspring. Muttion is held y modifying the chromosomes individully. The nodes re selected rndomly. If genertion hs reched the cost function threshold, the genertion should e stopped. The most optiml sequence for A/D tsk will e suggested to the opertor. It is worth remrking tht the optiml sequence is conducted sed on the first prt recognition lgorithm chosen y the opertor. When provided with sufficient informtion, the system will generte the guidnce pth for the opertor, which will guide the opertor for the est prt sequence of the mintennce tsk. In order to sense the guidnce force, rtificil nd nturl constrints re pplied to the opertor through the pth. The fundmentl ide of using the force field is tht ech oject in virtul environment is surrounded y repulsive force field [7]. Since we lredy know the trget position of our prt position, the
6 Intelligent Assemly/Disssemly System with Hptic Device 765 force field of whole environment cn e clculted to ssist the opertor to rech the trget position. We cn prescrie the trget position for ircrft prts. During the ssemly tsk, trget position will e the est position for ech prt in Crtesin coordinte relted to the geometry constrint of the ssemled prts. In disssemly tsk, trget position is sfe plce (position) in Crtesin coordinte where we will put the prt for the finl position. The force pplied for the guidnce is summtion etween the rtificil nd nturl constrint. The following reltion summrizes the force implementtion [6] : Constrint totl (x,y,z) = Constrint nturl (y) + Constrint rtificil (x,z) (5) The constrint long the plne x nd z is used to guide the oject to rech the prescried trget position, wheres the nturl constrint is the constrint tht nturlly comes from the oject. After one prt hs reched the trget position, nother guidnce pth for nother prt will e suggested to the opertor. This process repeted until ll prt reches their trget positions. The sequence of tsk sed on the results of the optiml sequence genertion. 4 Experiment nd Result To implement optiml sequence genertion, some experiments were conducted to test the lgorithm. As shown in Fig. 3, An opertor ttempted to disssemle the ssemled prt. To ccomplish the disssemly tsk, prmeters such s gripper nd direction of prt were involved in cost vlue clcultion. While in [5] the numer of fesile sequence ws involved, this tril did not involve tht prmeter in this experiment. Assume the possiility of escpe prt direction only limited to the +z nd z direction. The gripper ws ville in five types. Tle 1. Aville Gripper Prt Aville Gripper 1 G 1,G 2,G 3 2 G 2,G 3,G 4 3 G 1,G 3,G 4 4 G 3,G 4,G 5 5 G 3,G 4 6 G 5 7 G 1,G 2,G 3 8 G 2,G 3,G 4,G 5 9 G 1,G 2,G 3,G 4 10 G 5 Initil popultion consisted of 100 individuls. The numer of genertion ws limited to 50 genertion. In every genertion, mximum nd verge cost vlue ws clculted. Below re the mximl cost vlue fter 100 tril ttempting. In every genertion, mximum nd verge cost vlue ws incresed (Fig. 3) This indicte tht
7 766 Christind nd J. Yoon solution is getting etter from genertion to genertion. The finl solution suggested for disssemly sequence re Becuse the cost function did not involve numer of fesile su-sequence nd fesile su-sequence modules, so there is non-fesile su-sequence in suggested solution. () Mximum cost function () Assemled prt for experiment (c) Averge cost function (d) Assemled prt drwing for experiment Fig. 3. Experiment result nd picture of ssemled prt 5 Conclusion In this pper, we hve suggested the frmework of the intelligent ssemly/disssemly system for ircrft prts mintennce tsk. The lgorithm nd components of the system which del with the complexity of the sequence selection y n optimlized method hve een descried in this pper. Some results hve een showed refer to the selection of optiml sequence. In future works, su-sequence module will e involved in the clcultion of cost vlue to void non fesile susequence pper in sequence solution. Furthermore, novel lgorithm nd strtegy in the hptic utiliztion hs een developed.. In other words, this system could e prototype of n efficient system for the purpose of ircrft prt mintennce tsks. Since this is n ongoing reserch, further developments nd inputs re desired to increse the effectiveness of the system.
8 Intelligent Assemly/Disssemly System with Hptic Device 767 Acknowledgement This work ws supported y the Kore Reserch Foundtion Grnt funded y the Koren Government (MOEHRD) (KRF J09902) nd ws supported y NURI Project. References [1] 4:23 pm. 26/12/2006 [2] Diego Borro, Jon Svll, Aiert Amundrin, Jorge Jun Gil, Alejndro Grci-Alonso, Luis Mtey, A Lrge Hptic Device for Aircrft Engine Mintinility, IEEE Computer Grphics nd Applictions, vol. 24, no. 6, pp , Nov/Dec [3] Jon Svll, Diego Borro, Jorge Jun Gil, Luis Mtey, Description of Hptic System for Virtul Mintinility in Aeronutics, IEEE Interntionl Conference on Intelligent Roots nd Systems, Lussne, Switzerlnd, Octoer [4] Alex B. Kung, Shhrm Pyndeh, Bin Zheng, Frnk Henigmn, Christine L. McKenzie, "Assemling Virtul Fixtures for Guidnce in Trining Environments," hptics, pp , 12th Interntionl Symposium on Hptic Interfces for Virtul Environment nd Teleopertor Systems (HAPTICS'04), [5] L. M. Glntucci; G. Percoco & R. Spin, Assemly nd Disssemly Plnning y using Fuzzy Logic & Genetic Algorithms, Interntionl Journl of Advnced Rootic Systems, volume 1 Numer, 2004 [6] Dniel Gleno nd Shhrm Pyndeh, Artificil nd Nturl Force Constrints in Hptic-ided Pth Plnning, IEEE Interntionl Workshop on Hptic Audio Visul Environments nd their Applictions, Ottw, Cnd, 1-2 Octoer 2005 [7] Dongo Xio nd Roger Huold. Nvigtion Guided y Artificil Force Fields, Proceedings of ACM CHI 98 Conference on Humn Fctors in Computing Systems, vol. 1, pp ACM SIGCHI, Addison Wesley, April 1998 [8] Open Inventor 6, Mercury Computer System, 2006 [9] Rndy L. Hupt nd Sue Ellen Hupt, Prcticl Genetic Algorithms 2nd Edition, John Willey nd Sons, USA, 2004 [10] Lzzerini B., Mrcelloni F., A Genetic Algorithm for generting Optiml Assemly Plns, Artificil Intelligence in Engineering, Vol. 14, pp , 2000
Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationGENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES
GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationToday. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.
CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke
More informationCOLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION
Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationMobile IP route optimization method for a carrier-scale IP network
Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories 3-9-11 Midori-cho, Musshino-shi, Tokyo 180-8585, Jpn Phone:
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationThe Greedy Method. The Greedy Method
Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm
More informationA New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method
A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,
More informationPPS: User Manual. Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, and Ayush Kanodia
PPS: User Mnul Krishnendu Chtterjee, Mrtin Chmelik, Rghv Gupt, nd Ayush Knodi IST Austri (Institute of Science nd Technology Austri), Klosterneuurg, Austri In this section we descrie the tool fetures,
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl component
More informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationSlicer Method Comparison Using Open-source 3D Printer
IOP Conference Series: Erth nd Environmentl Science PAPER OPEN ACCESS Slicer Method Comprison Using Open-source 3D Printer To cite this rticle: M K A Mohd Ariffin et l 2018 IOP Conf. Ser.: Erth Environ.
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationPlanning with Reachable Distances: Fast Enforcement of Closure Constraints
Plnning with Rechle Distnces: Fst Enforcement of Closure Constrints Xinyu Tng, Shwn Thoms, nd Nncy M. Amto Astrct Motion plnning for closed-chin systems is prticulrly difficult due to dditionl closure
More informationEvolutionary Approaches To Minimizing Network Coding Resources
This full text pper ws peer reviewed t the direction of IEEE Communictions Society suject mtter experts for puliction in the IEEE INFOCOM 2007 proceedings. Evolutionry Approches To Minimizing Network Coding
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationEfficient K-NN Search in Polyphonic Music Databases Using a Lower Bounding Mechanism
Efficient K-NN Serch in Polyphonic Music Dtses Using Lower Bounding Mechnism Ning-Hn Liu Deprtment of Computer Science Ntionl Tsing Hu University Hsinchu,Tiwn 300, R.O.C 886-3-575679 nhliou@yhoo.com.tw
More informationAn Algorithm for Enumerating All Maximal Tree Patterns Without Duplication Using Succinct Data Structure
, Mrch 12-14, 2014, Hong Kong An Algorithm for Enumerting All Mximl Tree Ptterns Without Dupliction Using Succinct Dt Structure Yuko ITOKAWA, Tomoyuki UCHIDA nd Motoki SANO Astrct In order to extrct structured
More informationEECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining
EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more
More informationAnnouncements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem
Announcements Project : erch It s live! Due 9/. trt erly nd sk questions. It s longer thn most! Need prtner? Come up fter clss or try Pizz ections: cn go to ny, ut hve priority in your own C 88: Artificil
More informationAn Expressive Hybrid Model for the Composition of Cardinal Directions
An Expressive Hyrid Model for the Composition of Crdinl Directions Ah Lin Kor nd Brndon Bennett School of Computing, University of Leeds, Leeds LS2 9JT, UK e-mil:{lin,brndon}@comp.leeds.c.uk Astrct In
More informationApproximation of Two-Dimensional Rectangle Packing
pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete
More informationFPGA-Based Implementation of Genetic Algorithm for the Traveling Salesman Problem and Its Industrial Application
FPGA-Bsed Implementtion of Genetic Algorithm for the Trveling Slesmn Problem nd Its Industril Appliction Ioulii Sklirov nd António B.Ferrri Deprtment of Electronics nd Telecommunictions University of Aveiro,
More informationTopological Queries on Graph-structured XML Data: Models and Implementations
Topologicl Queries on Grph-structured XML Dt: Models nd Implementtions Hongzhi Wng, Jinzhong Li, nd Jizhou Luo Astrct In mny pplictions, dt is in grph structure, which cn e nturlly represented s grph-structured
More informationAn evolutionary approach to inter-session network coding
An evolutionry pproch to inter-session network coding The MIT Fculty hs mde this rticle openly ville. Plese shre how this ccess enefits you. Your story mtters. Cittion As Pulished Pulisher Kim, M. et l.
More informationMcAfee Network Security Platform
NTBA Applince T-200 nd T-500 Quick Strt Guide Revision B McAfee Network Security Pltform 1 Instll the mounting rils Position the mounting rils correctly nd instll them t sme levels. At the front of the
More informationAnalysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle
Textiles nd Light ndustril Science nd Technology (TLST) Volume 3, 2014 DO: 10.14355/tlist.2014.0301.01 http://www.tlist-journl.org Anlysis of Computed Diffrction Pttern Digrm for Mesuring Yrn Twist Angle
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationSpectral Analysis of MCDF Operations in Image Processing
Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity
More informationOUTPUT DELIVERY SYSTEM
Differences in ODS formtting for HTML with Proc Print nd Proc Report Lur L. M. Thornton, USDA-ARS, Animl Improvement Progrms Lortory, Beltsville, MD ABSTRACT While Proc Print is terrific tool for dt checking
More informationGeometrical tile design for complex neighborhoods
COMPUTATIONAL NEUROSCIENCE ORIGINAL RESEARCH ARTICLE pulished: 23 Novemer 2009 doi: 103389/neuro100202009 Geometricl tile design for complex neighorhoods Eugen Czeizler* nd Lil Kri Deprtment of Computer
More informationVideo-rate Image Segmentation by means of Region Splitting and Merging
Video-rte Imge Segmenttion y mens of Region Splitting nd Merging Knur Anej, Florence Lguzet, Lionel Lcssgne, Alin Merigot Institute for Fundmentl Electronics, University of Pris South Orsy, Frnce knur.nej@gmil.com,
More informationCSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011
CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationShortcomings with Tree-Structured Edge Encodings for Neural Networks
Shortcomings with Tree-Structured Edge Encodings for Neurl Networks Gregory S. Horny QSS Group Inc., NASA Ames Reserch Center Mil Stop 269-3, Moffett Field, CA 94035-1000 horny@emil.rc.ns.gov Astrct. In
More informationPhilosophy Of Creating Macros In Accumark CAD System
Philosophy Of Creting Mcros In Accumrk CAD System Mrie Nejedl Astrct: - The rticle discusses promising method of creting documenttion in design preprtion of clothing production using the "Mcro" module.
More informationAnnouncements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007
CS 88: Artificil Intelligence Fll 2007 Lecture : A* Serch 9/4/2007 Dn Klein UC Berkeley Mny slides over the course dpted from either Sturt Russell or Andrew Moore Announcements Sections: New section 06:
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationApproximation by NURBS with free knots
pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde
More informationSubband coding of image sequences using multiple vector quantizers. Emanuel Martins, Vitor Silva and Luís de Sá
Sund coding of imge sequences using multiple vector quntizers Emnuel Mrtins, Vitor Silv nd Luís de Sá Instituto de Telecomunicções, Deprtmento de Engenhri Electrotécnic Pólo II d Universidde de Coimr,
More informationRegistering as a HPE Reseller. Quick Reference Guide for new Partners in Asia Pacific
Registering s HPE Reseller Quick Reference Guide for new Prtners in Asi Pcific Registering s new Reseller prtner There re five min steps to e new Reseller prtner. Crete your Appliction Copyright 2017 Hewlett
More informationTOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS
TOWARDS GRADIENT BASED AERODYNAMIC OPTIMIZATION OF WIND TURBINE BLADES USING OVERSET GRIDS S. H. Jongsm E. T. A. vn de Weide H. W. M. Hoeijmkers Overset symposium 10-18-2012 Deprtment of mechnicl engineering
More informationUT1553B BCRT True Dual-port Memory Interface
UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl
More informationQubit allocation for quantum circuit compilers
Quit lloction for quntum circuit compilers Nov. 10, 2017 JIQ 2017 Mrcos Yukio Sirichi Sylvin Collnge Vinícius Fernndes dos Sntos Fernndo Mgno Quintão Pereir Compilers for quntum computing The first genertion
More informationLR Parsing, Part 2. Constructing Parse Tables. Need to Automatically Construct LR Parse Tables: Action and GOTO Table
TDDD55 Compilers nd Interpreters TDDB44 Compiler Construction LR Prsing, Prt 2 Constructing Prse Tles Prse tle construction Grmmr conflict hndling Ctegories of LR Grmmrs nd Prsers Peter Fritzson, Christoph
More informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
More informationGeorge Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
More informationNOTES. Figure 1 illustrates typical hardware component connections required when using the JCM ICB Asset Ticket Generator software application.
ICB Asset Ticket Genertor Opertor s Guide Septemer, 2016 Septemer, 2016 NOTES Opertor s Guide ICB Asset Ticket Genertor Softwre Instlltion nd Opertion This document contins informtion for downloding, instlling,
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationCOMPARATIVE genomics is one of the most important
A New Distributed Modified Extreml Optimiztion using Tbu Serch Mechnism for Reducing Crossovers in Reconcilition Grph nd Its Performnce Evlution Keiichi Tmur, Hjime Kitkmi Abstrct To determine the mechnism
More informationRegistering as an HPE Reseller
Registering s n HPE Reseller Quick Reference Guide for new Prtners Mrch 2019 Registering s new Reseller prtner There re four min steps to register on the Prtner Redy Portl s new Reseller prtner: Appliction
More informationON THE DEHN COMPLEX OF VIRTUAL LINKS
ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd
More informationNetwork Interconnection: Bridging CS 571 Fall Kenneth L. Calvert All rights reserved
Network Interconnection: Bridging CS 57 Fll 6 6 Kenneth L. Clvert All rights reserved The Prolem We know how to uild (rodcst) LANs Wnt to connect severl LANs together to overcome scling limits Recll: speed
More informationLanguages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *
Pln for Tody nd Beginning Next week Interpreter nd Compiler Structure, or Softwre Architecture Overview of Progrmming Assignments The MeggyJv compiler we will e uilding. Regulr Expressions Finite Stte
More informationAgenda & Reading. Class Exercise. COMPSCI 105 SS 2012 Principles of Computer Science. Arrays
COMPSCI 5 SS Principles of Computer Science Arrys & Multidimensionl Arrys Agend & Reding Agend Arrys Creting & Using Primitive & Reference Types Assignments & Equlity Pss y Vlue & Pss y Reference Copying
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationA Formalism for Functionality Preserving System Level Transformations
A Formlism for Functionlity Preserving System Level Trnsformtions Smr Abdi Dniel Gjski Center for Embedded Computer Systems UC Irvine Center for Embedded Computer Systems UC Irvine Irvine, CA 92697 Irvine,
More informationA Sparse Grid Representation for Dynamic Three-Dimensional Worlds
A Sprse Grid Representtion for Dynmic Three-Dimensionl Worlds Nthn R. Sturtevnt Deprtment of Computer Science University of Denver Denver, CO, 80208 sturtevnt@cs.du.edu Astrct Grid representtions offer
More informationSERIES. Patterns and Algebra OUT. Name
D Techer Student Book IN OUT 8 Nme Series D Contents Topic Section Ptterns Answers nd (pp. functions ) identifying ptterns nd nd functions_ creting ptterns_ skip equtions counting nd equivlence completing
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing
More informationMachine vision system for surface inspection on brushed industrial parts.
Mchine vision system for surfce inspection on rushed industril prts. Nicols Bonnot, Rlph Seulin, Frederic Merienne Lortoire Le2i, CNRS UMR 5158, University of Burgundy, Le Creusot, Frnce. ABSTRACT This
More informationGeometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More informationPatterns and Algebra. My name. Series
Student Techer Ptterns nd Alger My nme Series D Copyright 009 P Lerning. All rights reserved. First edition printed 009 in Austrli. A ctlogue record for this ook is ville from P Lerning Ltd. ISBN 978--9860--
More informationRanking of Hexagonal Fuzzy Numbers for Solving Multi Objective Fuzzy Linear Programming Problem
Interntionl Journl of Computer pplictions 097 8887 Volume 8 No 8 Decemer 0 nking of egonl Fuzzy Numers Solving ulti Ojective Fuzzy Liner Progrmming Prolem jrjeswri. P Deprtment of themtics Chikknn Government
More informationLoop Pipelining in Hardware-Software Partitioning
Loop Pipelining in Hrdwre-Softwre Prtitioning Jinhwn Jeon nd Kioung Choi School of Electricl Engineering Seoul Ntionl Universit Seoul, Kore 151-742 Tel: +82-2-880-5457 F: +82-2-887-6575 e-mil: {jeonjinh,kchoi}@popp.snu.c.kr
More informationStatistical classification of spatial relationships among mathematical symbols
2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University
More informationRevisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network
Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy
More informationSpotting Separator Points at Line Terminals in Compressed Document Images for Text-line Segmentation
Spotting Seprtor Points t Line Terminls in Compressed Document Imges for Text-line Segmenttion Amrnth R. Deprtment of Studies in Computer Science, University of Mysore, Indi. ABSTRACT Line seprtors re
More informationAn Integrated Simulation System for Human Factors Study
An Integrted Simultion System for Humn Fctors Study Ying Wng, Wei Zhng Deprtment of Industril Engineering, Tsinghu University, Beijing 100084, Chin Foud Bennis, Dmien Chblt IRCCyN, Ecole Centrle de Nntes,
More informationUSING HOUGH TRANSFORM IN LINE EXTRACTION
Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,
More informationVulnerability Analysis of Electric Power Communication Network. Yucong Wu
2nd Interntionl Conference on Advnces in Mechnicl Engineering nd Industril Informtics (AMEII 2016 Vulnerbility Anlysis of Electric Power Communiction Network Yucong Wu Deprtment of Telecommunictions Engineering,
More informationPARALLEL AND DISTRIBUTED COMPUTING
PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce
More informationTruss Topology Optimization Using Genetic Algorithm with Individual Identification Technique
WCE 2009, July - 3, 2009, London, U.K. Truss Topology Optimiztion Using Genetic Algorithm with Individul Identifiction Technique Su Ruiyi, Gui Lingjin, Fn Zijie Abstrct Since the evlution of ech individul
More information2014 Haskell January Test Regular Expressions and Finite Automata
0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded
More informationAngle Properties in Polygons. Part 1 Interior Angles
2.4 Angle Properties in Polygons YOU WILL NEED dynmic geometry softwre OR protrctor nd ruler EXPLORE A pentgon hs three right ngles nd four sides of equl length, s shown. Wht is the sum of the mesures
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Principles nd Prdigms Chpter 11 (version April 7, 2008) Mrten vn Steen Vrije Universiteit Amsterdm, Fculty of Science Dept. Mthemtics nd Computer Science Room R4.20. Tel: (020) 598 7784
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationSimrad ES80. Software Release Note Introduction
Simrd ES80 Softwre Relese 1.3.0 Introduction This document descries the chnges introduced with the new softwre version. Product: ES80 Softwre version: 1.3.0 This softwre controls ll functionlity in the
More informationOn Achieving Optimal Throughput with Network Coding
In IEEE INFOCOM On Achieving Optiml Throughput with Network Coding Zongpeng Li, Bochun Li, Dn Jing, Lp Chi Lu Astrct With the constrints of network topologies nd link cpcities, chieving the optiml end-to-end
More informationReducing a DFA to a Minimal DFA
Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,
More informationLists in Lisp and Scheme
Lists in Lisp nd Scheme Lists in Lisp nd Scheme Lists re Lisp s fundmentl dt structures, ut there re others Arrys, chrcters, strings, etc. Common Lisp hs moved on from eing merely LISt Processor However,
More informationTHE IMPLEMENTATION OF A MODULAR OPEN ARCHITECTURE PC-BASED CNC SYSTEM USED AS A RESEARCH AND EDUCATION EQUIPMENT
Proceedings in Mnufcturing Systems, Volume 12, Issue 2, 2017, 53-58 ISSN 2067-9238 THE IMPLEMENTATION OF A MODULAR OPEN ARCHITECTURE PC-BASED CNC SYSTEM USED AS A RESEARCH AND EDUCATION EQUIPMENT Rdu-Eugen
More informationAPPLICATION OF OPTIMIZATION PRINCIPLES IN CLASSROOM ALLOCATION USING LINEAR PROGRAMMING
Interntionl Journl of Mechnicl Engineering nd Technology (IJMET) Volume 0, Issue 0, Jnury 0, pp., Article ID: IJMET_0_0_0 Aville online t http://www.ieme.com/imet/issues.sp?jtype=ijmet&vtype=0&itype=0
More information