USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL
|
|
- Melvin Casey
- 5 years ago
- Views:
Transcription
1 USING ARTIFICIAL NEURAL NETWORKS TO APPROXIMATE A DISCRETE EVENT STOCHASTIC SIMULATION MODEL Robert A. Kilmer Department of Sytem Engineering Unite State Military Acaemy Wet Point, NY 1996 Alice E. Smith Department of Inutrial Engineering Univerity of Pittburgh Pittburgh, PA ABSTRACT: A computer imulation moel may be regare a a tochatic function that map a et of input to a et of output; in many cae computer imulation moel are quite computationally expenive. It woul be beneficial to have fat, accurate approximation of computer imulation moel to perform uch tak a quick turnaroun tuie, enitivity analye, moel aggregation/reuction, an imulation optimization. Thi paper examine the ue of two metho, artificial neural network (ANN) an multiple linear regreion, for approximating a lot ize - reorer point inventory ytem imulation. INTRODUCTION Computer imulation ha been ientifie in urvey a the mot wiely ue tool of inutrial engineer an management cientit (Pritker, 1992); however, computer imulation can become computationally expenive in term of proceing time an/or memory requirement. For thee reaon it woul be beneficial to have a quick proceing metho that provie accurate approximation of computer imulation. Thi paper provie ANN approximation of a computer imulation an compare the reult with firt an econ orer linear regreion moel for interpolation an extrapolation. There i a nee to reuce the computational buren of running computer imulation particularly for avance tak uch a imulation optimization. The work in thi paper i bae upon two aumption: (1) there i little or no obervational ata of the real ytem uner conieration an (2) an accurate, but low, mechanitic computer imulation of the ytem exit. The coure of action that we are invetigating for thi ituation i to obtain ata from the mechanitic computer imulation in orer to formulate a fat operating empirical moel of the ytem.
2 There are three major ifference between uing ANN to approximate tochatic imulation an uing ANN to perform function approximation. Firt, a given et of input yiel ifferent output, compouning training. Secon, training an teting ata i computationally expenive to generate, an therefore mut be leverage. Thir, training an teting ata i uually eigne, i.e. i not choen uniformly ranomly from the problem omain. (Hurrion, 1992) howe that it i poible to fit a neural network to moel the generalize repone of parameter change in a viual interactive imulation. Even though hi reearch wa not a ytematic examination of the ANN approach to approximating computer imulation, it howe how thi approach coul ait imulation uer. The firt iue examine in thi paper involve a comparion of ANN approximation with the type of multiple linear regreion typically ue in repone urface metho. The econ iue coniere i ata preentation metho, e.g., preenting iniviual replication or mean from the computer imulation to the ANN. Since ANN uually o better with more training ata, it eem reaonable to try to evelop ANN moel uing the iniviual replication of imulation output. On the other han, ince the operation of the ANN an regreion moel both provie eterminitic reult (i.e., for any given input there i only one output repone) both try to approximate the expecte value of the output of the imulation. THE INVENTORY SYSTEM SIMULATION The ytem examine i the inventory ytem ecribe in the experimental eign an optimization chapter of (Law an Kelton, 1991). Thi ytem i a lot ize-reorer point ytem (i.e., an (S,) inventory ytem where S = orer quantity an = reorer point). Law an Kelton hel all input parameter fixe except for = reorer point, an = S - = reorer quantity. It houl be note that i jut a convenient reparameterization of the reorer quantity, S. The only output meaure wa the average annual total cot, tc, of operating the inventory ytem. For comparion purpoe, the work preente in thi paper wa limite to the ame input parameter an output meaure. The mechanitic moel of the inventory ytem wa built with the SIMAN imulation language a a tochatic, icrete-event, terminating computer imulation. The ata ue to evelop the empirical approximation moel conite of two ifferent et of input parameter. The firt ata et conite of 4 combination of an, where = {2, 6} an = {1, 5}. The econ et conite of 36 combination of an, where = {, 2, 4, 6, 8, 1} an = {5, 2, 4, 6, 8, 1}. Our tet et of 42 point wa contructe with all poible combination of 21 equally pace value of between an 1 (i.e.,, 5, 1,..., 1) an 2 equally pace value of between 5 an 1 (i.e., 5, 1, 15,..., 1). Ten replication of the computer imulation were mae for each combination of an for the tet et an both training et; the mean tc of each et of ten provie the correct, or target, anwer, a wa one in Law an Kelton. Moel A an B tet the ability of approximation technique to extrapolate beyon the four ata point ue to evelop the approximation tool. Moel C an D examine the ability of the approximation technique to interpolate between the 36 ata point. Two ifferent metho of preenting the target ata to the
3 approximation tool were ue: one ue the mean tc value over the ten replication (moel A an C), an the other ue the iniviual tc value from each replication (moel B an D). Thee are ummarize in Table 1. TABLE 1: DATA PRESENTATION METHODS USED Moel Label Data Set Target Data Preentation Metho A 4 point mean B 4 point iniviual replication C 36 point mean D 36 point iniviual replication THE REGRESSION MODELS Moel A an B ue full, firt-orer multiple linear regreion moel. Moel, C an D ue full, econ-orer multiple linear regreion moel. Thee regreion moel were electe to permit comparion with Law an Kelton reult, an becaue they are the type typically ue in repone urface metho (Donohue, 1988). The linear regreion moel obtaine in each cae are hown in Table 2. The F tet for regreion wa ignificant for α =.1 for regreion moel B, C an D. In aition, the regreion moel obtaine by Law an Kelton for moel B* an D* are alo provie in Table 2 for valiation/verification purpoe. There i cloe agreement in the coefficient of the regreion equation for moel B an B* an for moel D an D*. It houl be note that the lat three value in the equation for D* are milabele in Law an Kelton. Thi can be een by olving for the minimum of the function. The minimum value for the Law an Kelton function i foun at = 148 an = -42. By making the change given in Table 2, row D*, the minimum value i at = 29 an = 68. Thee reult are conitent with the contour iagram of the function foun in Law an Kelton, an in Figure 1c in thi paper. Moel Label Regreion Equation TABLE 2: REGRESSION MODELS P Value of F Statitic (egree of freeom) R 2 A Cot = (2,1).8 B Cot = *E -12 (2,37).76 B* Cot = Not Given NA C Cot = *E -9 (5,3).78 D Cot = *E -11 (5,354).77 D* Cot = Not Given NA * Reult from Law an Kelton Note that regreion moel A an B are the ame moel, an that C an D are the ame moel. Thi i jut a manifetation of the regreion attempting to etimate the expecte value of the output for any particular input value. The benefit of incluing all of the ata in regreion (moel B an D) i that lack of fit tet can be performe, although thi wa not one here.
4 THE ANN MODELS The ANN moel ue were feeforwar, fully connecte, traine with the backpropagation algorithm with a moothing factor uring training. All of the ANN moel ha two input noe, one correponing to an the other correponing to, an one output noe correponing to tc. The pecific architecture i given in Table 3. All of the ANN' were traine up to a maximum of 5, epoch with a convergence criterion of.5 for the tolerance value. The reult of training the ANN moel for the variou ata et in each experiment are provie in Table 3. A can be een from the table, the ANN that wa traine on the mean ata require fewer hien noe an fewer preentation of the ata to train the network, which wa expecte ince the ata ha alreay been conveniently preprocee. It wa not expecte that the ANN learn all the ata point from the iniviual replication to.5, ince for each combination of an, there were 1 ifferent tc target. TABLE 3: ANN MODELS Moel Label Architecture # Data Point Not Learne To.5 / Total # Of Training Iteration A 1 hien layer, / 4 2,849 1 noe B 2 hien layer, 1 / 4 8,32 1 noe each C 1 hien layer, 1 noe / 36 1,111 D 2 hien layer, 1 noe each 48 / 36 24,29 RESULTS The contour plot (line connect point of equal tc) given in Figure 1 permit a viual comparion of the regreion an ANN moel with the original computer imulation. Figure 1a plot the mean of 1 replication of the computer imulation at the 42 tet point. Figure 1b plot the mean of 1 replication of the 36 point (i.e., the training et for moel C). Figure 1c an 1 are the plot of the regreion an ANN moel, repectively, that were contructe uing the mean of 1 replication of the 36 ata point (moel C). The bet one coul hope for from the ANN or the regreion woul be a contour plot ientical to 1b. Thee plot how that the ANN (1) i cloer than the econ orer regreion (1c) to approximating the computer imulation. Each regreion moel an each ANN were tete with the 42 value from the tet et. The experimental reult for both the regreion moel an the ANN moel are provie in Table 4. Moel A an B were ue to examine the extrapolation ability of the approximation metho uing only four combination of an for training. The relatively high MAE for both the ANN an the regreion inicate the anger in trying to preict repone in region where training ata ha not been provie. Moel C an D were ue to examine the interpolation ability of the approximation metho. The reult in Table 4 inicate that the ANN, regarle of training on mean ata or on iniviual
5 replication, outperforme the correponing regreion moel. Thee reult were ignificant at α =.1 for a matche t tet. Thi inicate that ANN moel can provie better reult for interpolating from a computer imulation than the multiple firt an econ orer regreion moel commonly ue in repone urface metho. Although not performe here, higher orer regreion moel might yiel better reult than thee lower orer moel Fig. 4a. Direct imulation 42 point. Fig. 4b. Direct imulation 36 point Fig. 4c. Regreion on 36 point. Fig. 4. ANN on 36 point. TABLE 4: COMPARISON OF TEST SET RESULTS Moel Label # of an Point # of Training Vector Regreion MAE ANN MAE A B C D
6 Table 4 alo permit a comparion of the metho of preenting target ata for eveloping each approximation moel. For the regreion approximation technique, both metho of preenting output ata (mean an replication) yiel the ame accuracy in term MAE. While the mean metho (moel A an C) ha lightly better R 2 value than the correponing iniviual replication metho (moel B an D), they ha le ignificant level for the F tatitic (ee Table 2). The ANN traine on the iniviual replication ha a very lightly larger MAE. However, it houl be note that thi i not a fair comparion ince the ANN traine on iniviual replication ue more hien noe an require many more training iteration in orer to obtain the achieve preciion. Our current work fully invetigate the two preentation metho for ANN approximation of imulation moel. CONCLUSIONS The reult of thi imple tuy emontrate that for mall number of input parameter an output meaure the ANN approach can outperform the firt an econ orer linear regreion moel typically ue in imulation repone urface metho. Training the ANN on iniviual replication may prouce comparable reult, but at the expene of increae training time, an poibly larger network ize. Our current work expan the two input imulation to four input, an fully explore the alternative preentation metho of mean an iniviual replication. We alo evelop an ANN to preict variance a well a expecte value for tc. Thi network i ue to evelop ANN preiction interval for interpolate point. Finally we have ue our methoology on a full cale, real worl imulation of a hopital emergency room. Future work will take the ANN moel of the imulation an ue them to perform imulation optimization. REFERENCES Donohue, M., (1988). The Ue of Correlate Simulation Experiment in Repone Surface Optimization. Ph.D. Diertation, Virginia Polytechnic Intitute an State Univerity. Hurrion, R. D., (1992). Uing a neural network to enhance the eciion making quality of a viual interactive imulation moel, Journal of Operation Reearch Society, 43 (4), Law, A. an Kelton, D., (1991). Simulation Moeling an Analyi. McGraw- Hill, New York. Pritker, A. A., (1992). Moelling for imulation analyi, in Hanbook of Inutrial Engineering (G. Salveny, E.). John Wiley & Son, New York.
Modelling data-aggregation in multi-replication data centric storage systems for wireless sensor and actor networks
Publihe in IET Communication Receive on 1t July 2010 Revie on 31t March 2011 oi: 10.1049/iet-com.2010.0574 In Special Iue on Ditribute Intelligence an Data Fuion for Senor Sytem Moelling ata-aggregation
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationDiffraction I Version 1.0 : March 12, 2019
Diffraction I Interference an Diffraction of Light Through Slit: The Jut Give Me The Formulae Verion! Steve Smith March 12, 2019 Content 1 Introuction 3 1.1 Huygen Principle.............................................
More informationSun trajectory modeling for specific location using PV measured data
oi:10.15199/48.2015.11.63 Igor PETROVIĆ 1, Zenko ŠIMIĆ 2, Tomilav TOMIŠA 2 Technical College in Bjelovar, Croatia (1), Univerity of Zagreb, Faculty of Electrical Engineering an Computing (2) Sun trajectory
More informationDynamic Configuration of Resource-Aware Services
Proceeing of the 26 th International Conference on Software Engineering (ICSE), Einburgh, Scotlan, May 2004. Dynamic Configuration of Reource-Aware Service Vahe Polaian, João Pero Soua, Davi Garlan, Mary
More informationAutomatic Basis Selection Techniques for RBF Networks
Automatic Bai Selection Technique for RBF Network Ali Ghoi School of Computer Science Univerity of Waterloo Univerity Avenue Wet NL G, Canaa Email: aghoib@c.uwaterloo.ca Dale Schuurman School of Computer
More informationThe norm Package. November 15, Title Analysis of multivariate normal datasets with missing values
The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationReporting Checklist for Nature Neuroscience
Correponding Author: Manucript Number: Manucript Type: Jeremy Elman NNBC48172A Brief Communication Reporting Checklit for Nature Neurocience # Figure: 2 # Figure: 5 # Table: 6 # Video: 0 Thi checklit i
More informationACTIVE PIPES: SERVICE COMPOSITION FOR PROGRAMMABLE NETWORKS
ACTIVE PIPES: SERVICE COMPOSITION FOR PROGRAMMABLE NETWORKS Ralph Keller, Jeyahankher Ramamirtham, Tilman Wolf, Bernhar Plattner [keller plattner]@tik.ee.ethz.ch [jai wolf]@arl.wutl.eu Computer Engineering
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationTeaching and Learning Experiences of an Integrated Mechanism and Machine Design Course
Seion 566 Teaching an Learning Experience of an Integrate Mechanim an Machine Deign Coure Raghu Echempati, Arnalo Mazzei Kettering Univerity Mechanical Engineering Department 700 Wet Thir Av Flint, MI
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationComplexity of Saliency-Cognizant Error Concealment Based on the Itti-Koch-Niebur Saliency Model
SIMON FRASER UNIVERSITY Complexity of Saliency-Cognizant Error Concealment Bae on the Itti-Koch-Niebur Saliency Moel Hai Haizaeh, Ivan V. Bajić, an Gene Cheung MCL TECHNICAL REPORT MCL-TR-01-11-01 November
More informationCONTROL RAPID PROTOTYPING OF REDUNDANTLY ACTUATED PARALLEL KINEMATICAL MACHINE
CONROL RAPID PROOYPING OF REDUNDANLY ACUAED PARALLEL KINEMAICAL MACHINE Michael Valášek, Zbyněk Šika, Jan Zavřel, omáš Skopec, Pavel Steinbauer CU in Prague, Faculty of Mechanical Engineering Abtract Reunantly
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationDesign of a Stewart Platform for General Machining Using Magnetic Bearings
eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationWeb Science and additionality
Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationParallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs
Parallel Minimum Spanning Tree Heuritic for the Steiner Problem in Graph Hoa Akbari 1, Zeinab Iranmaneh 1, an Mohamma Ghoi 1,2* 1 Sharif Univerity of Technology, 2 IPM chool of Computer Science, Tehran,
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationConstructing disjoint paths for failure recovery and multipath routing
Computer Network Computer Network (211) 1 12 Contructing ijoint path for failure recovery an multipath routing Yong Oh Lee, A. L. Naraimha rey 1 Dept. of Electrical an Computer Engineering, Texa A & M
More informationTopology Overview. Interconnection Networks: Latency. Abstract Metrics. Impact of Topology on Latency. Throughput 4/8/2009
Topology Overview Interconnection Network: Topology an Routing Natalie EnrightJerger Definition: etermine arrangement of channel an noe in network Analogou to roa map Often firt tep in network eign Routing
More informationRemoval of Specular Reflection Component Using Multi-view Images and 3D Object Model
Removal of Specular Reflection Component Uing Multi-view Image an 3D Object Moel Shu-Kam Chow an Kwok-Leung Chan Department of Electronic Engineering, City Univerity of Hong Kong, 83 Tat Chee Avenue, Kowloon,
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationA MODEL OF TOPOGRAPHIC CORRECTION AND REFLECTANCE RETRIEVAL FOR OPTICAL SATELLITE DATA IN FORESTED AREAS
A MODEL OF TOPOGRAPHIC CORRECTION AND REFLECTANCE RETRIEVAL FOR OPTICAL SATELLITE DATA IN FORESTED AREAS Cheng Wei a,, Tian Qingjiu b, Wang Liming a a The Center for Earth Obervation an Digital Earth,
More informationResearch on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function
016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationControl Flow Analysis
Control Flow Analyi Efficiency Control Flow Analyi Type an Effect ytem Data Flow Analyi Abtract Interpretation Correctne Control Flow Analyi p.1/35 Control Flow Analyi Flow information i eential for the
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More informationBayesian Markov Chain Monte Carlo inversion for fluid term and dry fracture weaknesses
Bayeian Markov Chain Monte Carlo inverion or lui term an ry racture weaknee Huaizhen Chen an Kri Innanen CREWES project, Department o Geocience, Univerity o Calgary Summary Fracture weaknee an lui actor
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationGrowing Networks Through Random Walks Without Restarts
Growing Network Through Random Walk Without Retart Bernardo Amorim, Daniel Figueiredo, Giulio Iacobelli, Giovanni Neglia To cite thi verion: Bernardo Amorim, Daniel Figueiredo, Giulio Iacobelli, Giovanni
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationPerformance Evaluation of search engines via user efforts measures
IJCSI International Journal of Computer Science Iue, Vol. 9, Iue 4, No, July 01 www.ijcsi.org 437 Performance Evaluation of earch engine via uer effort meaure Raeh Kumar Goutam 1 and Sanay K. Dwivedi 1
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationUsing Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images
2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationUninformed Search Complexity. Informed Search. Search Revisited. Day 2/3 of Search
Informed Search ay 2/3 of Search hap. 4, Ruel & Norvig FS IFS US PFS MEM FS IS Uninformed Search omplexity N = Total number of tate = verage number of ucceor (branching factor) L = Length for tart to goal
More informationNew DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index
New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationA Deterministic Fault-Tolerant and Deadlock-Free Routing Protocol in 2-D Meshes Based on Odd-Even Turn Model
A Determinitic Fault-Tolerant an Dealock-Free Routing Protocol in -D Mehe Bae on -ven Turn Moel Jie Wu Department of Computer Science an ngineering Floria Atlantic Univerity Boca Raton, FL 3343 jie@ce.fau.eu
More informationMultiscale Shaders for the Efficient Realistic Rendering of Pine-Trees
Multicale Shaer for the Efficient ealitic enering of Pine-Tree Alexanre Meyer Fabrice Neyret imagis -GAVI / IMAG-INIA Email:{Alexanre.Meyer Fabrice.Neyret}@imag.fr Abtract The frame of our work i the efficient
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationNUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE
4th International Conference on Earthquake Engineering Taipei, Taiwan October 12-13, 2006 Paper No. 183 NUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE Han jun 1, Li Yingmin 2, Liu Liping 3,
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationPosition Control of Manipulator s Links Using Artificial Neural Network with Backpropagation Training Algorithm
Poition Control of Manipulator Link Uing Artificial Neural Network with Backpropagation Training Algorith Thiang, Handry Khowanto, Tan Hendra Sutanto Electrical Engineering Departent, Petra Chritian Univerity
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationCOLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
XI International Conference on Computational Platicity. Fundamental and Application COMPLAS XI E. Oñate, D.R.J. Owen, D. Peric and B. Suárez (Ed) COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
More informationIntegration of Digital Test Tools to the Internet-Based Environment MOSCITO
Integration of Digital Tet Tool to the Internet-Baed Environment MOSCITO Abtract Current paper decribe a new environment MOSCITO for providing acce to tool over the internet. The environment i built according
More informationDWH Performance Tuning For Better Reporting
DWH Performance Tuning For Better Sandeep Bhargava Reearch Scholar Naveen Hemrajani Aociate Profeor Dineh Goyal Aociate Profeor Subhah Gander IT Profeional ABSTRACT: The concept of data warehoue deal in
More informationIntroduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07
Introduction to PET Image Recontruction Adam Aleio Nuclear Medicine Lecture Imaging Reearch Laboratory Diviion of Nuclear Medicine Univerity of Wahington Fall 2007 http://dept.wahington.edu/nucmed/irl/education.html
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More informationGeometric Transformations Hearn & Baker Chapter 5. Some slides are taken from Robert Thomsons notes.
Geometric Tranformation Hearn & Baker Chapter 5 Some lie are taken from Robert Thomon note. OVERVIEW Two imenional tranformation Matri repreentation Invere tranformation Three imenional tranformation OpenGL
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL
ANALYSIS OF PILE DRIVING IN VERTICAL AND HORIZONTAL DIRECTIONS USING A HYBRID MODEL TATSUNORI MATSUMOTO i) PASTSAKORN KITIYODOM ii) EIJI KOJIMA iii) HIROMICHI KUMAGAI iv) SATOSHI NISHIMOTO v) and KOUICHI
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationExample 2 (visibility deadlock)
Fault Tolerant Moility Planning for apily Deployale Wirele Network? Charle Shiel Jr., Vika Jain, Simeon Ntafo avi Prakah, S. Venkatean fchiel, vika, ntafo, ravip, venkyg@utalla.eu Erik Jonon School of
More information