Automated Modelization of Dynamic Systems

Size: px
Start display at page:

Download "Automated Modelization of Dynamic Systems"

Transcription

1 Automated Modelization o Dynamic Systems Ivan Perl, Aleksandr Penskoi ITMO University Saint-Petersburg, Russia ivan.perl, aleksandr.penskoi@corp.imo.ru Abstract Nowadays, dierent kinds o modelling settled down in most areas o human activities. Oten, it is not easy to design and create a model o an existing systems, because equations linking its components are not known. This article describes an approach allowing to identiy system components interaction based on run-time monitoring and analysis o system behavior. Described method is shown on a simple system that will be turned in to a system dynamics mode by automated equations deinition and results will compared to initial analytic model or the same system. I. INTRODUCTION We are living in a complex world and with new technological and scientiic achievements our world became even more complex, almost, on a daily basis. That is why modelling taking leading positions when it comes to question o systems analysis and design. There are many dierent classes o systems and, consequentially, number o ways to design, deine, build and compute related models. One o the most requent kinds o systems we are seeing around are dynamic systems, or systems, behaving or evolving over time. Approach to work with kind o systems is called System Dynamics. Appeared initially in mid 60s and designed or describing economics processes, later, in terms o growth o its methodological maturity, became applicable to work with almost any dynamic system. System dynamics models consist o two key elements: stocks and lows. Where stocks are representing accumulation o anything accounts receivable, capital, delays, inventories, and so on and lows are representing movement o anything consumption, deliveries, expenses, production, etc.[1] Today, computer modelling, like many other services, is ollowing a trend o moving to the cloud. There are many beneits o using cloud services, comparing to maintenance own deployments o required systems and services, but in a light o discussed topic, key o them are computation capacity and simpliied data access. In most cases, cloud services, especially designed or computation and modelling needs, are hosted on a specialized and well conigured equipment, which is ine-tuned or solving particular types o tasks. Because o various kinds o optimization s, such hosted solution will be more eicient even comparing with the same hardware hosted locally, but without speciic ine-tuning. That is why cloud services can do more and do this cheaper. Second aspect is data access. When dealing with cloud services there are no issues with bubbling data up to the client or with getting them back or sharing with colleagues and your research ellows. When it comes to systems modelling these two beneits starting to play even more valuable role together. Having eicient model execution engine, taken in parallel with monitoring data o the real systems allows to design and build unique services that can change systems analysis and management approaches, by shited these process to a kind o augmented reality, where real systems are extended by their models and their models, like digital shadows, became their integral part. One o such solutions, called continuous modelling, described in [10], allows to perorm monitoring o Internet o Things aware systems in parallel with their running models with constant comparison o expected state o the system with its actual state, what allows to quickly identiy anomalies and deviations in system behavior. Another joint processing o a model and real system data beneit can be achieved during creation o the model or an existing system that can be monitored in IoT-like way. When researcher is working on a new system or trying to deine a new process, he can deine both model structure (stocks, lows and their coniguration) and equations he is going to put into his model as lows deinitions. But not all works are starting rom scratch. System Dynamics is requently used to optimize and improve already existing systems which evolved over time without having their own models o any kind. In such cases, irst action item which rises in the beginning o the work is analysis o the system with identiication o its structure and understanding its behavior. For example, requent case is when we are having a running system and we need to understand how it behaves and what are the options we have to perorm its optimization. When we start dealing with such situation, in majority o cases we do not have equations which will describe interactions between system components. In this case, to create a model we will need to reconstruct required dependencies via system monitoring and analysis. II. MODELIZATION DEFINITION Today more and more system became a part o a paradigm called Internet o Things. In general, it means that components o such systems became connected to the Internet and can be managed and monitored using centralized services. New services, manuacturing, production and other systems became designed now to be IoT-enabled rom scratch and in the same time many systems which are working or years already are enhanced to be IoT-aware with wide range sensors and dierent eedback processing devices allowing inluence ISSN

2 Fig. 1 Basic structure o a demo model with two lows and three stocks systems remotely. An easy example is equipping production lines with monitoring sensors, and remote power management units allowing to start, stop and monitor production lines using a centralized service. Since new technologies are coming to scene, questions about new ways o system optimization are bubbling up. Now with all new monitoring possibilities, it is reasonable to try leveraging them to achieve better productivity and reduce various kinds o waste. Another aspect to take into account is growing computation power and computation accessibility. Today we can perorm much more computations than even ew years back and this leads to growing application o all kinds o computer modelling to support almost any human activity. Joining together these two eatures, gathering o IoT data and application o models or system understanding, monitoring and improvements, can bring lost o beneits or most o industries. In terms o this article, we will ocus on working with dynamic systems and under selected modelling approach we will assume System Dynamics toolkit. To illustrate uture discussion we will use a simple model that consists o three stocks and two lows. For example, such model may represents a supply chain pipeline where we have production warehouse, consumer one, that process items rom this warehouse and consumer two that perorm a inal processing over results o irst-line processing made by consumer one. Fig.1 schema depicts described model. In terms o this articles, under system modelization, we will understand a process o automated deinition o equations representing system dynamics model lows by analyzing stocks monitoring. The basic idea o this approach can be explained in the ollowing way: 1) Model structure deinition. During this step should be deined key stocks (nodes o the model) and lows. Here we are interested only in the structure o the model without its unctional aspects, and it will be enough to deine source and destination stocks or each low without speciying any equations explaining low behavior. 2) Data acquisition. At this stage, we will perorm monitoring o the target and will retrieve the state o each system node. As a result o this stage, we will get a list o aligned time series data sets describing a state o each model low over time. It is important to have this time series aligned in time with the precision that makes sense or the concrete use case. For example, i we are talking about supply chain model, several minutes drit between time series will not be critical, but i we deal with the model o a short running process like cooling down a teacup - several minutes will be the time o the whole experiment. 3) Monitoring data analysis. Ater all time series are received and aligned in time, they should pass through a chain o statistical processing methods like an approximation. The goal o this step is to ind an equation that will describe changes o stock (node) state over time or o low intensive. 4) Restoration o non-measured data. In practice, during the experiment, we can t get all data o a system, or all stacks and lows because technical or economic reasons can t measure some o them. The goal o this step is to ind an equation the will describe changes o stock state and low intensive which we can not measure directly. 5) Flows equations reconstruction. This step is a key element o the proposed schema. Taking into account the behavior o each model stock as unctions rom the time, we will try to reconstruct lows, which are linking stocks which behavior we just investigated and described analytically with equations we extracted rom system monitoring results. It is important to understand, that in most cases, it is not possible to achieve the goal o complete and ully automatic reconstruction o system dynamics data rom real system monitoring, especially or complicated systems with big numbers o lows going back and orth between stocks. Goal o the proposed approach is to design and develop an instrument that will help to reconstruct a model o the system specialist needs to work with, buy providing him advanced and enhanced view o the monitored system with the number o recommendations that will help him to solve this problem. Whole system modelization algorithm can be split on two phases: deining model structure, setting up monitoring, retrieving monitoring data and processing them to get analytic unction deinitions instead o pure time series. Second phase will be an attempt to reconstruct a model rom obtained and processed data. First part o this algorithm is sown on ig. 2 III. MODEL STRUCTURE DEFINITION This is a irst step, in building a model o existing system. When passing this step, it is important to understand that model complexity, will aect complexity o the rest o the process and higher will it be - more complicated computations will be required and more assumptions will be needed to be made on urther process stages. While working with model structure it is better to ollow incremental processes like ones described or sotware development in Agile methodologies. Process o model reconstruction can be treated as an incremental detalization and improvement

3 Deine basic model structure InFlow Stock OutFlow Deine system monitoring pattern Flows monitoring Stocks monitoring Hybrid Stock Value Fig. 4 Stock state monitoring options Get analytic deinitions or monitoring results Fig. 2: First phase o modelization algorithm Fig. 3. Simpliied structure o a demo model with two stocks and only one low o the model we are working on with step-by-step diving into the system under analysis. Getting back to our example with a production pipeline with two sections, in a very irst version o the model we may deine it at a glance like a two step model, like shown on ig. 3. In this case, whole processing will be treated as a one single operation without dividing it into processing stages. Such simple model will allow to understand overall system behavior. When on such level all required model components will be reconstructed, this model can made more complicated and intermediate processing stage can be revealed, like it was shown on initial ig. 1. Whereat can be revealed sub-steps o each processing step and so on, until model will not reach required detalization level to address issues it is designed or. Each deine d stock will require perorming monitoring and analysis o monitoring results. For each deined low we will need to pass all steps to reconstruct low equations rom the monitoring data retrieved rom related to it monitoring low. IV. DATA ACQUISITION Ater deining model structure, next important step is proper acquisition o model data. Since we are dealing with real systems, it is not always possible to properly measure states o all system components we are going to include in the model. There are two key measuring cases, how system component can be monitored: state monitoring and lows monitoring. In case o system dynamics model, model nodes, represented by stocks are not unctional and they can be treated just like a storage accumulating some entities. In the same time lows are processes which are changing values o the stocks. In other words, everything what perorms actions on stocks values is a low. For example, a truck which is moving a cargo rom one storage to another is a low connecting two warehouses (stocks). Another example is urniture actory, it consumes wood rom one place, produces urniture and puts it in another. In this case, actory is a low and on dierent sides o this low it c onnects two s tocks w ith c ompletely dierent entities. When we are perorming system monitoring, in most cases we can monitor only state o the stocks, but not lows directly. On ig. 4 shown two options or stock monitoring. I architecture o the system allows to measure stock input and output low, it m eans, t hat we aced a r elatively easy case, because during system monitoring we knows, direction (increasing or decreasing) and pace at which stock value is changed. This is already vary close to the solution we are trying to achieve - deinition o the lows in th e running system. In most cases, it is not possible to properly measure input and output lows and the only metric that can be monitored is stock actual value. In other words, lets say, that we have scales with sugar and there are two lows: one adding sugar to the scales and other is taking it rom there. These two processes are perorming simultaneously and the only thing we know at any given moment is amount o sugar on scales. In this case we will not be able to directly deine properties o each low. To this topic we will get back later in chapter?? V. MONITORING DATA ANALYSIS Next important step is data analysis. In the current context, under data analysis, we will assume processing o monitoring data we got rom the system under analysis. As a result o monitoring, we will receive a time series describing required system components which are represented by stocks in the model. From processing perspective it is not always easy to work with time series directly, also, taking into account that our goal is to ill gaps in the model deinition with illing in, it required to convert this data series into analytic representation. There are several dierent approaches allowing to ind a unction that will approximate experimental data. Approximation o experimental data is a topic that is well described in many sources like [4] or [5]. The goal o approximation is to deine an analytic unction that will go as close as possible to the set o experimental data. When approximation is perormed we need to do key things: irst, deine a unction that will be used or approximation, or example linear, polynomial, exponential, trigonometric and so on, and second - deine proper coniguration and coeicients o this unction. Oten, when a researcher or analytic receives experimental data, he can try guessing the best approximation unction by looking at experimental data charts. In other words, based on

4 his own unique experience, concrete case and a set o available data, he is making a decision about the shape o the unction, that will give him closest approximation results. When designing cloud service solution, it is not possible to address approximation aspect this way, because system under development should be tolerant to dierent sequences o input data received or analysis and these data sets should be processed with some deined precision and quality level. To address this problem in an automated way, there is a couple solution. The irst approach that can be used is a multivariate parallel approximation. For that purpose, on a platorm level, we will deine a set o most popular unctions that can be used or approximation purpose. For example, we may have linear, polynomial, exponential, logarithmic and trigonometric approximation bases in the library. When new data set received or analysis, the system will do a parallel approximation using each o bases available in the library. Quality o approximation can be measured, or example, by using standard deviation between experimental data and ound approximation unction. When all parallel approximations are completed, we can make a decision about best-ound approximation using selected approximation quality metric. The key beneit o such solution will be the ability to easily extend library o approximation bases with new entities and with the ability to update existing ones with better computation methods, because, the polynomial approximation can be perormed with the number o was, or example using a method o Least Squares or using Tailor series. The principal disadvantage o such an approach will be high consumption o computation resources. When designing a cloud solution, we have to assume, that there can be a signiicant number o researches, pushing data to the service or analysis and all o them are expecting responses in a reasonable time. The approximation is an expensive job rom resources consumption perspective and perorming it in parallel with a big library o approximation bases can give very good results, but will take much time. This method can be made cheaper, i we will allow speciying the number o patterns researcher expects in his data, this will lead to decreasing number o required computation, but will require knowledge about time series passed to or analysis. The second approach that might help to address the issue with deining closest approximation unction shape is an application o machine learning algorithms. Machine learning works well or dierent classiication jobs. Deinition o time series shapes is a typical classiication problem where we need to identiy the ranked set o most suitable shapes or the given time series. Deep learning has been used successully or time series prediction. In particular, recurrent neural networks (RNNs), especially those utilizing long short-term memory (LSTM) nodes, are useul or sequential tasks like this. Lipton, Kale, and others [6], have used LSTM RNNs or time series o medical data. They demonstrated that an RNN can ingest a sequence o clinical medical observations and then accurately classiy many diseases based upon these time series o raw sensor readings and lab tests. Having a library o expected time series shapes and trained neural networks will allow reducing the number o parallel approximations we need to attempt to get the result, closest to the sensor data processed. Let describe what we have ater this step rom the mathematical point o view: Functions (F, G, H...) o all measurement stocks rom the time (F : time value). Function o stock value change or a speciic time interval (F : time valuechange). Also, in non-strict means, we can call it a derivative o a stock unction. Functions o all measurement low inluence to source and destination stocks ( : time valuechange and 1 : time valuechange). It should also be noted that this unction is not a low equation, because the low is a unction o stock value, not rom the model time. VI. FLOWS EQUATIONS RECONSTRUCTION This is a key step o the described approach. Goal o this step is to attempt to recreate equations, describing each low o the model which structure was deined in the beginning o modelization process. Let ormalize a problem that should be solved on this step. We already have an inluence unction o most low in the model, but as noted above, it s not a low deinition, because low is a unction rom stocks values : (stockvalue1,stockvalue2...) valuechange. At this step we should replace all low inluence unction to it s low equivalent in regarding to the ollow term: (t) (F (t),g(t)...) There are number o options to use or lows unctions reconstruction and approach selection will depends on what kind o monitoring was possible to perorm on a system under analysis. 1) Input and output lows monitoring. Let s say that or a pair o stocks (or system components) we were able to perorm monitoring o output low or the source stock and input low o destination stock. It means that or this particular low we have its input and output values. Since low, in terms o model, is a pipeline that transport entities rom one stock to another at a certain speed, without changing quantity, it will be enough to know values at any end o the pipeline, because on the other side, low value will be the same, but with opposite sign. Keeping in mind that low is representing a rate at which stock value is changing and the thing that ollowing the described approach or turning monitoring results into analytic representation gives us an equation describing stock changes over time, we can get a low value by getting derivative o a stock unction. 2) Stocks monitoring. This case is much more complicated comparing to processing results o monitoring or input and output lows. Key issue is that rom monitoring result we got is a state o the stock in each moment in

5 time during monitoring, but this doesn t give us inormation about inluence o input and output made by lows connected to the stock. The only thing which is known or us is a result o a unction which is a superposition o input and output lows o the stock. In other words, at any moment t 1 value o the stock can be represented as F (t 1 )= InputFlows (t) OutputFlows 1 (t). Order o unctions superposition is depending on model structure, because, according to System Dynamics models speciication, lows execution order depends on their order deinition in the model. Situation with stocks monitoring can became even worse, i a stock has multiple input and output lows, what is common in some cases, when model components are tightly couple to each other. Such situations are oten seen in economical and environment-related models. But, there are also cases, when stocks monitoring works well. This is the case when we are dealing with lea-nodes o the model and these nodes have only one input or output low. In this case stock monitoring can be treated as a input or output low monitoring and we will come to the irst case. 3) Hybrid mode. Hybrid mode means that some o the stocks are monitored directly and others are monitoring on a level o their input and output lows. This approach inherits all advantages and disadvantages o both described approaches, but, it can bring beneits upon identiication o system monitoring strategy. For example, we have a system, which consists o three jars o some liquid. These three containers are connected in chain via two ilters cleaning liquid on the way rom then irst jar to the third one. Dealing with liquid low measurement is non-trivial thing, comparing to measurement o its volume. That is why, or the irst and third jars we can use simple volume (or weight measurement liquid density is known) monitoring or the irst and third jars and perorm lows monitoring only or the second one which is aected by superposition o input and output lows. VII. RESTORATION OF NON-MEASURED STOCKS AND FLOWS In some cases, modelization process can be enhanced via model simpliication process. Interms o this section, under simpliication we assumes not optimization o the model itsel, but incremental cut-o process on a way o model lows incremental deinition, where we are dropping already reconstructed lows and continuing processing only the rest o the model, until we ace a tightly couple model piece that can be processed any urther. Basically, lows are describing a rate at which this particular low changes connected stock value. So i a stock has multiple input and output lows, its value at every moment can be calculated as a sum o all itput lows minus sum o all output lows, like this: F (t) = InputFlows OutputFlows (t) 1 (t) In a corner case, i a stock has only one input or output low, we can easily reconstruct its low by getting a derivative o a unction that represent stock value change over time. In this case such stock and easy reconstruct-able lows can be solved and removed rom the model, to leave smaller structure or urther processing. This recurrent and incremental process ends when there will be no single-low stock let int he system. This procedure can be described with the ollowing algoritmh: 1) Find all unambiguously deined lows by lea stocks. I we know the stock unction and only one low will be connected to it, we also know that this low has an identical inluence on it, and it is possible to deine that F (t) (t). 2) Find all unambiguously deined lea stocks by lows and processed as in the previous step. 3) Simpliication. Analysis all known data and remove inluence o all known lows by a unction subtraction. For example: we have three stocks F, G, H, and two lows (rom F to G) and g (rom F to H). We have measured data o F and G stocks. By the irst step o this algorithm we can deine low inluence unction. We know, that F (t) = (t) g(t) and we can ind the g unction by substitution o rom F. 4) Repeat algorithm while we have any unambiguously deined stocks and lows. At the algorithm stop s we have a simpliied version o an initial system dynamic model, in which we can see only ambiguously lows and socks. Fig. 5 depicts described algorithm. I it is a not complicated model, we can go orward to the next modelization method step. But in the dierent case, the computation complexity may be too high to get modelization done in an acceptable time, and researcher should be to return to experiments and extends sensors environment. VIII. MODELIZATION EXAMPLE To show how this method works on practice let s get back to the initial example shown on ig. 1. Let s assume, that we have a simple production line which takes some item rom an input storage, perorms its initial processing, than, rom initial processing results it is taken or inal processing and ater that it goes to the inal production store. When we started monitoring we know that at the beginning o production cycle we have 8 blank pieces that will be turned into products. In terms o this example blank pieces are converted into product 1:1. When we started production monitoring we got stocks states distribution over time shown in table I. In this table S 1 a stock representing starting warehouse, S 2 is a box with initially processed pieces and S 3 is a stock with production pieces

6 System Dynamics model Model has unambiguos element Yes Find unambiguous stocks and lows Deine unambiguous stocks and lows Simpliy model by removing known lows Simpliication completed Fig. 5. Model incremental simpliication TABLE I. SAMPLE PRODUCTION PIPELINE MONITORING RESULTS No Time S 1 value S 2 value S 3 value From our model deinition we see that stocks S 1 and S 3 are aected by only one stock. It means that we can calculate low value or them directly based on monitoring results. Obviously or this simple case, both approximations will be linear unctions y S 1 = 2x and y S 3 = x ater irst item passes though the model. According to the deinition o low in system dynamics, it is the rate at which the stock is changing at any given instant, they either low into a stock (causing it to increase) or low out o a stock (causing it to decrease). From them math we know that change rate or the unction is unction derivative. In our case, lows will turn into -2 or S 1 out low and +1 or S 3 in low. Other sides o the lows connected to S 2 will have the same values, but with opposite sign, because nothing is disappearing rom the low and nothing new appears. To see some corner cases, let s use a bit more advances example. Assuming that we have one more processing step between stocks S 2 and S 3 and monitoring results appeared like they are shown in the table II Here we can see, that we have two lows which are aected stocks S 2 and S n ew. Monitoring data shows, that everything what get s into the new stock - immediately sent to the S 3. Input low which comes rom S 1 to S 2 is known, it is +2. TABLE II. EXTENDED SAMPLE PRODUCTION PIPELINE MONITORING RESULTS Time S 1 value S 2 value S new value S 3 value Based on this and values o S2 that was measured, we can igure out, that output low rom S 2 is 1. But the same technique will not work or the S new. We expect, that input low is +1, but, we can estimate an output one. at minimum, it is equal to the input low, but we are not able to estimate its maximum. This example gives us two important outcomes: 1) Modelization process do not describe system properties and actual characteristics. It allows to ormalize actual current system behaviour. Complete modelization process may require execution o system under dierent workload to see perormance and boundaries o all lows. 2) During the modelization it is easy to identiy lows where overlow (situations when input lows o a stock exceeds output lows) or underlow (situations when output lows o a stock exceeds input lows, like on the second example). In many cases, detection and addressing o such situations in one o the most important cases during system tuning and optimization. IX. METHOD EVALUATION APPROACH Described method was tested on synthetic data sets and shows its eiciency in achieving stated goals. As a baseline or the experiments was taken a library o test system dynamics test models which is used or evaluation and testing o various computation engines developed and maintained by tools community o System Dynamics society [7]. As a models execution engine was selected engine called PySD [8], because it is developed on a Python language and it appears aster and easier to make code modiications or method evaluation purposes than in other available execution engines. Evaluation and testing o proposed approach was perormed on acilities on sdcloud project [9]. Experiment was perormed on 50 dierent models and was designed in a ollowing way. 1) Basic model execution with advanced logging. on this step we executed 50 dierent test models using modiied execution engine. Goal o the modiication was to log values o all lows beore entering or right ater leaving model stocks. This gives us extended model execution results which contains not only time series describing stocks history, but also input and output lows value or each stock

7 2) Ater execution is completed, rom the model deinition excluded all equations representing lows. This turns a model into pure structure model that contains only rame o the model. 3) All time series describing stocks values rom modelling results are converted into closes analytic representation. According to the approach deinition both approaches were tested: with simple parallel approximation using dierent unctional patterns and selection o best option by estimating approximation quality and with application o trained neural network or time series shape detection or uture approximation using top three detected shapes. 4) Since we had all input and output lows (rom extended model execution logs), or each model we were able to reconstruct its lows via deinition o approximation unction based on logged input and output low values X. METHOD EVALUATION RESULTS As a result o our experiment was ound that or majority o models, 89% o lows across all test models, were recovered correctly. Correctness o the reconstruction o each low was identiy by comparing lows equations in original and newly created model. Flow reconstruction was count as successul i correct low shape was used without taking into account contestant term and allowing slight deviation o coeicients or lower power terms. Parallel approximation shows a bit better results in selection o approximation unction comparing to application o neural network-based classiier, 89% against 75%. But second option shows much better results in perormance and resources consumption. Most probably, this gap can be reduced in case o better training o neural network. Drat implementation o proposed eature was implemented within sdcloud platorm application and integrated with the service or continuous modelling, to leverage its mechanisms or accepting input data streams or urther processing within the platorm. This work was supported by grant IND a rom RFBR. XI. CONCLUSION In this article was described an approach aimed to help building System Dynamics models out o existing system by integrating system monitoring, data analysis and model execution practices. Proposed approach signiicantly depends on abilities or monitoring o target system and has number o limitation, but or many system dynamics application areas it can signiicantly improve modelization process and make it easier and aster than manual system investigation. Proposed method is trying to leverage both classical statistics methodology and modern machine learning mechanisms allowing to solve some issues with the higher run-time perormance and less resources consumption, but, in the same time requiring special eorts on a preparation step, like training o neural networks. REFERENCES [1] Business Dictionary, Web: /deinition/system-dynamics-sd.html [2] Kermack WO, McKendrick AG (August 1, 1927). A Contribution to the Mathematical Theory o Epidemics. Proceedings o the Royal Society A. 115 (772): doi: /rspa [3] Hethcote H (2000). The Mathematics o Inectious Diseases. SIAM Review. 42 (4): [4] Smirnov, V.Y., Kuznetsova, A.V., Approximation o experimental data by solving linear dierence equations with constant coeicients (in particular, by exponentials and exponential cosines), Pattern Recognit. Image Anal. (2017) 27: [5] Belikovich, V.V., Approximation o experimental data by exponential unction, Radiophys Quantum Electron (1993) 36: [6] Lipton Z., Kale D., Elkan C., Wetzel R., Learning to Diagnose with LSTM Recurrent Neural Networks, arxiv: [7] Repository with System Dynamics test models: [8] Python-based execution engine or System Dynamics models PySD: [9] sdcloud - cloud-based platorm or system dynamics modelling: [10] Penskoi A., Gaiosh A., Platunov A., Kluchev A. Specialised computational platorm or system dynamics: ISBN , ISSN , DOI: /sgem2018/2.1, 2 July - 8 July, 2018, Vol. 18, Issue 2.1, pp

Chapter 3 Image Enhancement in the Spatial Domain

Chapter 3 Image Enhancement in the Spatial Domain Chapter 3 Image Enhancement in the Spatial Domain Yinghua He School o Computer Science and Technology Tianjin University Image enhancement approaches Spatial domain image plane itsel Spatial domain methods

More information

Neighbourhood Operations

Neighbourhood Operations Neighbourhood Operations Neighbourhood operations simply operate on a larger neighbourhood o piels than point operations Origin Neighbourhoods are mostly a rectangle around a central piel Any size rectangle

More information

A Fault Model Centered Modeling Framework for Self-healing Computing Systems

A Fault Model Centered Modeling Framework for Self-healing Computing Systems A Fault Model Centered Modeling Framework or Sel-healing Computing Systems Wei Lu 1, Yian Zhu 1, Chunyan Ma 1, and Longmei Zhang 2 1 Department o Sotware and Microelectronics, Northwestern Polytechnical

More information

Intelligent knowledge-based system for the automated screwing process control

Intelligent knowledge-based system for the automated screwing process control Intelligent knowledge-based system or the automated screwing process control YULIYA LEBEDYNSKA yuliya.lebedynska@tu-cottbus.de ULRICH BERGER Chair o automation Brandenburg University o Technology Cottbus

More information

THE FINANCIAL CALCULATOR

THE FINANCIAL CALCULATOR Starter Kit CHAPTER 3 Stalla Seminars THE FINANCIAL CALCULATOR In accordance with the AIMR calculator policy in eect at the time o this writing, CFA candidates are permitted to use one o two approved calculators

More information

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm Int J Contemp Math Sciences, Vol 6, 0, no 0, 45 465 A Proposed Approach or Solving Rough Bi-Level Programming Problems by Genetic Algorithm M S Osman Department o Basic Science, Higher Technological Institute

More information

Automatic Video Segmentation for Czech TV Broadcast Transcription

Automatic Video Segmentation for Czech TV Broadcast Transcription Automatic Video Segmentation or Czech TV Broadcast Transcription Jose Chaloupka Laboratory o Computer Speech Processing, Institute o Inormation Technology and Electronics Technical University o Liberec

More information

9.8 Graphing Rational Functions

9.8 Graphing Rational Functions 9. Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm P where P and Q are polynomials. Q An eample o a simple rational unction

More information

Abalone Age Prediction using Artificial Neural Network

Abalone Age Prediction using Artificial Neural Network IOSR Journal o Computer Engineering (IOSR-JCE) e-issn: 2278-066,p-ISSN: 2278-8727, Volume 8, Issue 5, Ver. II (Sept - Oct. 206), PP 34-38 www.iosrjournals.org Abalone Age Prediction using Artiicial Neural

More information

MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM

MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM UDC 681.3.06 MATRIX ALGORITHM OF SOLVING GRAPH CUTTING PROBLEM V.K. Pogrebnoy TPU Institute «Cybernetic centre» E-mail: vk@ad.cctpu.edu.ru Matrix algorithm o solving graph cutting problem has been suggested.

More information

Classifier Evasion: Models and Open Problems

Classifier Evasion: Models and Open Problems Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin I. P. Rubinstein 2, Ling Huang 3, Anthony D. Joseph 1,3, and J. D. Tygar 1 1 UC Berkeley 2 Microsot Research 3 Intel Labs Berkeley

More information

The Graph of an Equation Graph the following by using a table of values and plotting points.

The Graph of an Equation Graph the following by using a table of values and plotting points. Calculus Preparation - Section 1 Graphs and Models Success in math as well as Calculus is to use a multiple perspective -- graphical, analytical, and numerical. Thanks to Rene Descartes we can represent

More information

ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION

ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION ROBUST FACE DETECTION UNDER CHALLENGES OF ROTATION, POSE AND OCCLUSION Phuong-Trinh Pham-Ngoc, Quang-Linh Huynh Department o Biomedical Engineering, Faculty o Applied Science, Hochiminh University o Technology,

More information

Section III. Advanced Programming Topics

Section III. Advanced Programming Topics Section III. Advanced Programming Topics This section provides inormation about several advanced embedded programming topics. It includes the ollowing chapters: Chapter 8, Exception Handling Chapter 9,

More information

A Classification System and Analysis for Aspect-Oriented Programs

A Classification System and Analysis for Aspect-Oriented Programs A Classiication System and Analysis or Aspect-Oriented Programs Martin Rinard, Alexandru Sălcianu, and Suhabe Bugrara Massachusetts Institute o Technology Cambridge, MA 02139 ABSTRACT We present a new

More information

Wave load formulae for prediction of wave-induced forces on a slender pile within pile groups

Wave load formulae for prediction of wave-induced forces on a slender pile within pile groups Wave load ormulae or prediction o wave-induced orces on a slender pile within pile groups Lisham Bonakdar 1 *, Hocine Oumeraci 1 and Amir Etemad-Shahidi 2 1 Leichtweiss-Institute or Hydraulic Engineering

More information

Automated Planning for Feature Model Configuration based on Functional and Non-Functional Requirements

Automated Planning for Feature Model Configuration based on Functional and Non-Functional Requirements Automated Planning or Feature Model Coniguration based on Functional and Non-Functional Requirements Samaneh Soltani 1, Mohsen Asadi 1, Dragan Gašević 2, Marek Hatala 1, Ebrahim Bagheri 2 1 Simon Fraser

More information

Study and Analysis of Edge Detection and Implementation of Fuzzy Set. Theory Based Edge Detection Technique in Digital Images

Study and Analysis of Edge Detection and Implementation of Fuzzy Set. Theory Based Edge Detection Technique in Digital Images Study and Analysis o Edge Detection and Implementation o Fuzzy Set Theory Based Edge Detection Technique in Digital Images Anju K S Assistant Proessor, Department o Computer Science Baselios Mathews II

More information

Classifier Evasion: Models and Open Problems

Classifier Evasion: Models and Open Problems . In Privacy and Security Issues in Data Mining and Machine Learning, eds. C. Dimitrakakis, et al. Springer, July 2011, pp. 92-98. Classiier Evasion: Models and Open Problems Blaine Nelson 1, Benjamin

More information

Binary Morphological Model in Refining Local Fitting Active Contour in Segmenting Weak/Missing Edges

Binary Morphological Model in Refining Local Fitting Active Contour in Segmenting Weak/Missing Edges 0 International Conerence on Advanced Computer Science Applications and Technologies Binary Morphological Model in Reining Local Fitting Active Contour in Segmenting Weak/Missing Edges Norshaliza Kamaruddin,

More information

Research on Image Splicing Based on Weighted POISSON Fusion

Research on Image Splicing Based on Weighted POISSON Fusion Research on Image Splicing Based on Weighted POISSO Fusion Dan Li, Ling Yuan*, Song Hu, Zeqi Wang School o Computer Science & Technology HuaZhong University o Science & Technology Wuhan, 430074, China

More information

Section II. Nios II Software Development

Section II. Nios II Software Development Section II. Nios II Sotware Development This section o the Embedded Design Handbook describes how to most eectively use the Altera tools or embedded system sotware development, and recommends design styles

More information

ScienceDirect. Using Search Algorithms for Modeling Economic Processes

ScienceDirect. Using Search Algorithms for Modeling Economic Processes vailable online at www.sciencedirect.com ScienceDirect Procedia Economics and Finance 6 ( 03 ) 73 737 International Economic onerence o Sibiu 03 Post risis Economy: hallenges and Opportunities, IES 03

More information

SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING FUNCTIONS

SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING FUNCTIONS SIMULATION OPTIMIZER AND OPTIMIZATION METHODS TESTING ON DISCRETE EVENT SIMULATIONS MODELS AND TESTING UNCTIONS Pavel Raska (a), Zdenek Ulrych (b), Petr Horesi (c) (a) Department o Industrial Engineering

More information

2. Recommended Design Flow

2. Recommended Design Flow 2. Recommended Design Flow This chapter describes the Altera-recommended design low or successully implementing external memory interaces in Altera devices. Altera recommends that you create an example

More information

Road Sign Analysis Using Multisensory Data

Road Sign Analysis Using Multisensory Data Road Sign Analysis Using Multisensory Data R.J. López-Sastre, S. Lauente-Arroyo, P. Gil-Jiménez, P. Siegmann, and S. Maldonado-Bascón University o Alcalá, Department o Signal Theory and Communications

More information

Lagrangian relaxations for multiple network alignment

Lagrangian relaxations for multiple network alignment Noname manuscript No. (will be inserted by the editor) Lagrangian relaxations or multiple network alignment Eric Malmi Sanjay Chawla Aristides Gionis Received: date / Accepted: date Abstract We propose

More information

3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY

3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY 3-D TERRAIN RECONSTRUCTION WITH AERIAL PHOTOGRAPHY Bin-Yih Juang ( 莊斌鎰 ) 1, and Chiou-Shann Fuh ( 傅楸善 ) 3 1 Ph. D candidate o Dept. o Mechanical Engineering National Taiwan University, Taipei, Taiwan Instructor

More information

First Video Streaming Experiments on a Time Driven Priority Network

First Video Streaming Experiments on a Time Driven Priority Network First Video Streaming Experiments on a Driven Priority Network Mario Baldi and Guido Marchetto Department o Control and Computer Engineering Politecnico di Torino (Technical University o Torino) Abstract

More information

Piecewise polynomial interpolation

Piecewise polynomial interpolation Chapter 2 Piecewise polynomial interpolation In ection.6., and in Lab, we learned that it is not a good idea to interpolate unctions by a highorder polynomials at equally spaced points. However, it transpires

More information

An Efficient Configuration Methodology for Time-Division Multiplexed Single Resources

An Efficient Configuration Methodology for Time-Division Multiplexed Single Resources An Eicient Coniguration Methodology or Time-Division Multiplexed Single Resources Benny Akesson 1, Anna Minaeva 1, Přemysl Šůcha 1, Andrew Nelson 2 and Zdeněk Hanzálek 1 1 Czech Technical University in

More information

foldr CS 5010 Program Design Paradigms Lesson 5.4

foldr CS 5010 Program Design Paradigms Lesson 5.4 oldr CS 5010 Program Design Paradigms Lesson 5.4 Mitchell Wand, 2012-2014 This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. 1 Introduction In this lesson,

More information

A fast and area-efficient FPGA-based architecture for high accuracy logarithm approximation

A fast and area-efficient FPGA-based architecture for high accuracy logarithm approximation A ast and area-eicient FPGA-based architecture or high accuracy logarithm approximation Dimitris Bariamis, Dimitris Maroulis, Dimitris K. Iakovidis Department o Inormatics and Telecommunications University

More information

2. Getting Started with the Graphical User Interface

2. Getting Started with the Graphical User Interface February 2011 NII52017-10.1.0 2. Getting Started with the Graphical User Interace NII52017-10.1.0 The Nios II Sotware Build Tools (SBT) or Eclipse is a set o plugins based on the popular Eclipse ramework

More information

2. Design Planning with the Quartus II Software

2. Design Planning with the Quartus II Software November 2013 QII51016-13.1.0 2. Design Planning with the Quartus II Sotware QII51016-13.1.0 This chapter discusses key FPGA design planning considerations, provides recommendations, and describes various

More information

A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOGY

A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOGY In: Stilla U et al (Eds) PIA7. International Archives o Photogrammetry, Remote Sensing and Spatial Inormation Sciences, 36 (3/W49B) A MULTI-LEVEL IMAGE DESCRIPTION MODEL SCHEME BASED ON DIGITAL TOPOLOG

More information

Structured Parallel Programming with Deterministic Patterns

Structured Parallel Programming with Deterministic Patterns Structured Parallel Programming with Deterministic Patterns May 14, 2010 USENIX HotPar 2010, Berkeley, Caliornia Michael McCool, Sotware Architect, Ct Technology Sotware and Services Group, Intel Corporation

More information

Computer Data Analysis and Plotting

Computer Data Analysis and Plotting Phys 122 February 6, 2006 quark%//~bland/docs/manuals/ph122/pcintro/pcintro.doc Computer Data Analysis and Plotting In this lab we will use Microsot EXCEL to do our calculations. This program has been

More information

Clustering Analysis for Object Formation in Software Modeling

Clustering Analysis for Object Formation in Software Modeling Clustering Analysis or Object Formation in Sotware Modeling Dusan Sormaz, Danyu You, and Arkopaul Sarkar Department o Industrial and Systems Engineering, Ohio Uniersity, Athens, OH, USA Institute or Corrosion

More information

Decision Support Systems for E-Purchasing using Case-Based Reasoning and Rating Based Collaborative Filtering

Decision Support Systems for E-Purchasing using Case-Based Reasoning and Rating Based Collaborative Filtering Decision Support Systems or E-Purchasing using Case-Based Reasoning and Rating Based Collaborative Filtering ABSTRACT The amount o trade conducted electronically has grown dramatically since the wide introduction

More information

ITU - Telecommunication Standardization Sector. G.fast: Far-end crosstalk in twisted pair cabling; measurements and modelling ABSTRACT

ITU - Telecommunication Standardization Sector. G.fast: Far-end crosstalk in twisted pair cabling; measurements and modelling ABSTRACT ITU - Telecommunication Standardization Sector STUDY GROUP 15 Temporary Document 11RV-22 Original: English Richmond, VA. - 3-1 Nov. 211 Question: 4/15 SOURCE 1 : TNO TITLE: G.ast: Far-end crosstalk in

More information

AC : DEVELOPMENT OF A ROBOTIC PLATFORM FOR TEACH- ING MODEL-BASED DESIGN TECHNIQUES IN DYNAMICS AND CON- TROL PROGRAM

AC : DEVELOPMENT OF A ROBOTIC PLATFORM FOR TEACH- ING MODEL-BASED DESIGN TECHNIQUES IN DYNAMICS AND CON- TROL PROGRAM AC 011-714: DEVELOPMENT OF A ROBOTIC PLATFORM FOR TEACH- ING MODEL-BASED DESIGN TECHNIQUES IN DYNAMICS AND CON- TROL PROGRAM Bingen Yang, University o Southern Caliornia Dr. Bingen Yang is Proessor o Aerospace

More information

Lab 9 - GEOMETRICAL OPTICS

Lab 9 - GEOMETRICAL OPTICS 161 Name Date Partners Lab 9 - GEOMETRICAL OPTICS OBJECTIVES Optics, developed in us through study, teaches us to see - Paul Cezanne Image rom www.weidemyr.com To examine Snell s Law To observe total internal

More information

KANGAL REPORT

KANGAL REPORT Individual Penalty Based Constraint handling Using a Hybrid Bi-Objective and Penalty Function Approach Rituparna Datta Kalyanmoy Deb Mechanical Engineering IIT Kanpur, India KANGAL REPORT 2013005 Abstract

More information

ScienceDirect. Testing Optimization Methods on Discrete Event Simulation Models and Testing Functions

ScienceDirect. Testing Optimization Methods on Discrete Event Simulation Models and Testing Functions Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 768 777 24th DAAAM International Symposium on Intelligent Manuacturing and Automation, 2013 Testing Optimization

More information

Theoretical calculation of the natural flock restoration time of a cotton comber

Theoretical calculation of the natural flock restoration time of a cotton comber Indian Journal o Fibre & Textile esearch Vol. 40, September 05, pp. 88-9 Theoretical calculation o the natural lock restoration time o a cotton comber Li Xin-rong a, Jiang Xiu-ming, Yang Jian-cheng & Wang

More information

SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN

SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN SUPER RESOLUTION IMAGE BY EDGE-CONSTRAINED CURVE FITTING IN THE THRESHOLD DECOMPOSITION DOMAIN Tsz Chun Ho and Bing Zeng Department o Electronic and Computer Engineering The Hong Kong University o Science

More information

CS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012

CS485/685 Computer Vision Spring 2012 Dr. George Bebis Programming Assignment 2 Due Date: 3/27/2012 CS8/68 Computer Vision Spring 0 Dr. George Bebis Programming Assignment Due Date: /7/0 In this assignment, you will implement an algorithm or normalizing ace image using SVD. Face normalization is a required

More information

Computer Data Analysis and Use of Excel

Computer Data Analysis and Use of Excel Computer Data Analysis and Use o Excel I. Theory In this lab we will use Microsot EXCEL to do our calculations and error analysis. This program was written primarily or use by the business community, so

More information

Joint Congestion Control and Scheduling in Wireless Networks with Network Coding

Joint Congestion Control and Scheduling in Wireless Networks with Network Coding Title Joint Congestion Control and Scheduling in Wireless Networks with Network Coding Authors Hou, R; Wong Lui, KS; Li, J Citation IEEE Transactions on Vehicular Technology, 2014, v. 63 n. 7, p. 3304-3317

More information

Formalizing Cardinality-based Feature Models and their Staged Configuration

Formalizing Cardinality-based Feature Models and their Staged Configuration Formalizing Cardinality-based Feature Models and their Staged Coniguration Krzyszto Czarnecki, Simon Helsen, and Ulrich Eisenecker 2 University o Waterloo, Canada 2 University o Applied Sciences Kaiserslautern,

More information

A Novel Accurate Genetic Algorithm for Multivariable Systems

A Novel Accurate Genetic Algorithm for Multivariable Systems World Applied Sciences Journal 5 (): 137-14, 008 ISSN 1818-495 IDOSI Publications, 008 A Novel Accurate Genetic Algorithm or Multivariable Systems Abdorreza Alavi Gharahbagh and Vahid Abolghasemi Department

More information

Semi-Supervised SVMs for Classification with Unknown Class Proportions and a Small Labeled Dataset

Semi-Supervised SVMs for Classification with Unknown Class Proportions and a Small Labeled Dataset Semi-Supervised SVMs or Classiication with Unknown Class Proportions and a Small Labeled Dataset S Sathiya Keerthi Yahoo! Labs Santa Clara, Caliornia, U.S.A selvarak@yahoo-inc.com Bigyan Bhar Indian Institute

More information

10. SOPC Builder Component Development Walkthrough

10. SOPC Builder Component Development Walkthrough 10. SOPC Builder Component Development Walkthrough QII54007-9.0.0 Introduction This chapter describes the parts o a custom SOPC Builder component and guides you through the process o creating an example

More information

Research Article Synthesis of Test Scenarios Using UML Sequence Diagrams

Research Article Synthesis of Test Scenarios Using UML Sequence Diagrams International Scholarly Research Network ISRN Sotware Engineering Volume 2012, Article ID 324054, 22 pages doi:10.5402/2012/324054 Research Article Synthesis o Test Scenarios Using UML Sequence Diagrams

More information

A Series Lighting Controller Modbus Register Map

A Series Lighting Controller Modbus Register Map DEH41097 Rev. 3 g A Series Lighting Control Panelboards A Series Lighting Controller Modbus Register Map Table o Contents Introduction...1 RTU Transmission Mode...1 Message rame...1 RTU Mode Message Frames...1

More information

AN 608: HST Jitter and BER Estimator Tool for Stratix IV GX and GT Devices

AN 608: HST Jitter and BER Estimator Tool for Stratix IV GX and GT Devices AN 608: HST Jitter and BER Estimator Tool or Stratix IV GX and GT Devices July 2010 AN-608-1.0 The high-speed communication link design toolkit (HST) jitter and bit error rate (BER) estimator tool is a

More information

EMBEDDED DIGITAL IMAGE CORRELATION IN A FULL-FIELD DISPLACEMENT SENSOR. A Thesis. Presented to. The Graduate Faculty of The University of Akron

EMBEDDED DIGITAL IMAGE CORRELATION IN A FULL-FIELD DISPLACEMENT SENSOR. A Thesis. Presented to. The Graduate Faculty of The University of Akron EMBEDDED DIGITAL IMAGE CORRELATIO I A FULL-FIELD DIPLACEMET EOR A Thesis Presented to The Graduate Faculty o The University o Akron In Partial Fulillment o the Requirements or the Degree Master o cience

More information

Jaroslav Moravec. Object recognition using 3D convolutional neural networks

Jaroslav Moravec. Object recognition using 3D convolutional neural networks BACHELOR THESIS Jaroslav Moravec Object recognition using 3D convolutional neural networks Department o Sotware Engineering Supervisor o the bachelor thesis: Study programme: Study branch: RNDr. Jakub

More information

Abstract. I. Introduction

Abstract. I. Introduction 46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics & Materials Conerence 8 - April 005, Austin, Texas AIAA 005-83 M Intuitive Design Selection Using Visualized n-dimensional Pareto Frontier G.

More information

ES 240: Scientific and Engineering Computation. a function f(x) that can be written as a finite series of power functions like

ES 240: Scientific and Engineering Computation. a function f(x) that can be written as a finite series of power functions like Polynomial Deinition a unction () that can be written as a inite series o power unctions like n is a polynomial o order n n ( ) = A polynomial is represented by coeicient vector rom highest power. p=[3-5

More information

3D Hand and Fingers Reconstruction from Monocular View

3D Hand and Fingers Reconstruction from Monocular View 3D Hand and Fingers Reconstruction rom Monocular View 1. Research Team Project Leader: Graduate Students: Pro. Isaac Cohen, Computer Science Sung Uk Lee 2. Statement o Project Goals The needs or an accurate

More information

Larger K-maps. So far we have only discussed 2 and 3-variable K-maps. We can now create a 4-variable map in the

Larger K-maps. So far we have only discussed 2 and 3-variable K-maps. We can now create a 4-variable map in the EET 3 Chapter 3 7/3/2 PAGE - 23 Larger K-maps The -variable K-map So ar we have only discussed 2 and 3-variable K-maps. We can now create a -variable map in the same way that we created the 3-variable

More information

PATH PLANNING OF UNMANNED AERIAL VEHICLE USING DUBINS GEOMETRY WITH AN OBSTACLE

PATH PLANNING OF UNMANNED AERIAL VEHICLE USING DUBINS GEOMETRY WITH AN OBSTACLE Proceeding o International Conerence On Research, Implementation And Education O Mathematics And Sciences 2015, Yogyakarta State University, 17-19 May 2015 PATH PLANNING OF UNMANNED AERIAL VEHICLE USING

More information

Characterizing the network behavior of P2P traffic

Characterizing the network behavior of P2P traffic Characterizing the network behavior o PP traic Raaele Bolla, Marco Canini, Riccardo Rapuzzi, Michele Sciuto DIST - Department o Communication, Computer and System Sciences, University o Genoa Via Opera

More information

Method estimating reflection coefficients of adaptive lattice filter and its application to system identification

Method estimating reflection coefficients of adaptive lattice filter and its application to system identification Acoust. Sci. & Tech. 28, 2 (27) PAPER #27 The Acoustical Society o Japan Method estimating relection coeicients o adaptive lattice ilter and its application to system identiication Kensaku Fujii 1;, Masaaki

More information

Adaptation of System Dynamics Model Execution Algorithms for Cloud-based Environment

Adaptation of System Dynamics Model Execution Algorithms for Cloud-based Environment Adaptation of System Dynamics Model Execution Algorithms for Cloud-based Environment Alexey Mulyukin, Ivan Perl ITMO University Saint-Petersburg, Russia alexprey@yandex.ru, ivan.perl@corp.ifmo.ru Abstract

More information

A New Framework of Quantifying Differences Between Images by Matching Gradient Fields and Its Application to Image Blending

A New Framework of Quantifying Differences Between Images by Matching Gradient Fields and Its Application to Image Blending A New Framework o Quantiying Dierences Between Images by Matching Gradient Fields and Its Application to Image Blending Wei-Hsun Liao Chin-Lung Yu Marvin Bergsneider Luminita Vese and Sung-Cheng Huang

More information

In astroinformatics, the processing and analyzing. Scaling Astroinformatics: Python + Automatic Parallelization COVER FEATURE

In astroinformatics, the processing and analyzing. Scaling Astroinformatics: Python + Automatic Parallelization COVER FEATURE Scaling Astroinormatics: Python + Automatic Parallelization Stean C. Müller, ETH Zürich and University o Applied Sciences Northwestern Switzerland Gustavo Alonso, ETH Zürich André Csillaghy, University

More information

MAPI Computer Vision. Multiple View Geometry

MAPI Computer Vision. Multiple View Geometry MAPI Computer Vision Multiple View Geometry Geometry o Multiple Views 2- and 3- view geometry p p Kpˆ [ K R t]p Geometry o Multiple Views 2- and 3- view geometry Epipolar Geometry The epipolar geometry

More information

Performance Assessment of the Hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 Test Problems

Performance Assessment of the Hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 Test Problems Perormance Assessment o the Hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC9 Test Problems Santosh Tiwari, Georges Fadel, Patrick Koch, and Kalyanmoy Deb 3 Department o Mechanical Engineering,

More information

MA/CS-109: Graph Random Walks. Azer Bestavros

MA/CS-109: Graph Random Walks. Azer Bestavros /CS-09: Graph Random Walks zer estavros Wandering around in a graph We saw that given a map graph, one can determine paths that satisy a speciic objective inimize cost or going rom to Shortest Path Visit

More information

CPS 303 High Performance Computing. Wensheng Shen Department of Computational Science SUNY Brockport

CPS 303 High Performance Computing. Wensheng Shen Department of Computational Science SUNY Brockport CPS 303 High Perormance Computing Wensheng Shen Department o Computational Science SUNY Brockport Chapter 4 An application: numerical integration Use MPI to solve a problem o numerical integration with

More information

Understanding Signal to Noise Ratio and Noise Spectral Density in high speed data converters

Understanding Signal to Noise Ratio and Noise Spectral Density in high speed data converters Understanding Signal to Noise Ratio and Noise Spectral Density in high speed data converters TIPL 4703 Presented by Ken Chan Prepared by Ken Chan 1 Table o Contents What is SNR Deinition o SNR Components

More information

Classification Method for Colored Natural Textures Using Gabor Filtering

Classification Method for Colored Natural Textures Using Gabor Filtering Classiication Method or Colored Natural Textures Using Gabor Filtering Leena Lepistö 1, Iivari Kunttu 1, Jorma Autio 2, and Ari Visa 1, 1 Tampere University o Technology Institute o Signal Processing P.

More information

HIGH SPEED LASER STRUCTURING OF CRYSTALLINE SILICON SOLAR CELLS

HIGH SPEED LASER STRUCTURING OF CRYSTALLINE SILICON SOLAR CELLS HIGH SPEED LASER STRUCTURING OF CRYSTALLINE SILICON SOLAR CELLS S. Eidelloth, T. Neubert, T. Brendemühl, S. Hermann, P. Giesel, and R. Brendel Institut ür Solarenergieorschung Hameln (ISFH), Am Ohrberg

More information

Ad-hoc Workflow: Problems and Solutions

Ad-hoc Workflow: Problems and Solutions Ad-hoc Worklow: Problems and Solutions M. Voorhoeve and W. van der Aalst Dept. o Mathematics and Computing Science Eindhoven University o Technology Eindhoven, The Netherlands, 5600MB Abstract The paper

More information

Design and Realization of user Behaviors Recommendation System Based on Association rules under Cloud Environment

Design and Realization of user Behaviors Recommendation System Based on Association rules under Cloud Environment Research Journal o Applied Sciences, Engineering and Technology 6(9): 1669-1673, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientiic Organization, 2013 Submitted: January 19, 2013 Accepted: March

More information

AUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS. Ricardo A. Garcia *

AUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS. Ricardo A. Garcia * AUTOMATING THE DESIGN OF SOUND SYNTHESIS TECHNIQUES USING EVOLUTIONARY METHODS Ricardo A. Garcia * MIT Media Lab Machine Listening Group 20 Ames St., E5-49, Cambridge, MA 0239 rago@media.mit.edu ABSTRACT

More information

Fractal Art: Fractal Image and Music Generator

Fractal Art: Fractal Image and Music Generator Proceedings o the 7th WSEAS Int. Con. on Signal Processing, Computational Geometry & Artiicial Vision, Athens, Greece, August 4-6, 007 159 Fractal Art: Fractal Image and Music Generator RAZVAN TANASIE

More information

Intelligent Optimization Methods for High-Dimensional Data Classification for Support Vector Machines

Intelligent Optimization Methods for High-Dimensional Data Classification for Support Vector Machines Intelligent Inormation Management, 200, 2, ***-*** doi:0.4236/iim.200.26043 Published Online June 200 (http://www.scirp.org/journal/iim) Intelligent Optimization Methods or High-Dimensional Data Classiication

More information

13. Power Management in Stratix IV Devices

13. Power Management in Stratix IV Devices February 2011 SIV51013-3.2 13. Power Management in Stratix IV Devices SIV51013-3.2 This chapter describes power management in Stratix IV devices. Stratix IV devices oer programmable power technology options

More information

Status. We ll do code generation first... Outline

Status. We ll do code generation first... Outline Status Run-time Environments Lecture 11 We have covered the ront-end phases Lexical analysis Parsin Semantic analysis Next are the back-end phases Optimization Code eneration We ll do code eneration irst...

More information

Object Tracking with Dynamic Feature Graph

Object Tracking with Dynamic Feature Graph Object Tracking with Dynamic Feature Graph Feng Tang and Hai Tao Department o Computer Engineering, University o Caliornia, Santa Cruz {tang,tao}@soe.ucsc.edu Abstract Two major problems or model-based

More information

A Research on Moving Human Body Detection Based on the Depth Images of Kinect

A Research on Moving Human Body Detection Based on the Depth Images of Kinect Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com A Research on Moving Human Body Detection Based on the Depth Images o Kinect * Xi an Zhu, Jiaqi Huo Institute o Inormation

More information

Traffic-Aware Placement of NFV Middleboxes

Traffic-Aware Placement of NFV Middleboxes Traic-Aware Placement o NFV Middleboxes Wenrui Ma, Carlos Medina, and Deng Pan School o Computing and Inormation Sciences Florida International University, Miami, FL wma6@iu.edu, cmedi45@iu.edu, pand@iu.edu

More information

Face Detection for Automatic Avatar Creation by using Deformable Template and GA

Face Detection for Automatic Avatar Creation by using Deformable Template and GA Face Detection or Automatic Avatar Creation by using Deormable Template and GA Tae-Young Park*, Ja-Yong Lee **, and Hoon Kang *** * School o lectrical and lectronics ngineering, Chung-Ang University, Seoul,

More information

Reducing the Bandwidth of a Sparse Matrix with Tabu Search

Reducing the Bandwidth of a Sparse Matrix with Tabu Search Reducing the Bandwidth o a Sparse Matrix with Tabu Search Raael Martí a, Manuel Laguna b, Fred Glover b and Vicente Campos a a b Dpto. de Estadística e Investigación Operativa, Facultad de Matemáticas,

More information

Review: Chip Design Styles

Review: Chip Design Styles MPT-50 Introduction to omputer Design SFU, Harbour entre, Spring 007 Lecture 9: Feb. 6, 007 Programmable Logic Devices (PLDs) - Read Only Memory (ROM) - Programmable Array Logic (PAL) - Programmable Logic

More information

A Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics of Boolean Interacting Automata

A Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics of Boolean Interacting Automata A Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics o Boolean Interacting Automata Roberto Serra Department o Statistics, Ca Foscari University, Fondamenta

More information

Digital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4)

Digital Image Processing. Image Enhancement in the Spatial Domain (Chapter 4) Digital Image Processing Image Enhancement in the Spatial Domain (Chapter 4) Objective The principal objective o enhancement is to process an images so that the result is more suitable than the original

More information

13. Power Optimization

13. Power Optimization 13. Power Optimization May 2013 QII52016-13.0.0 QII52016-13.0.0 The Quartus II sotware oers power-driven compilation to ully optimize device power consumption. Power-driven compilation ocuses on reducing

More information

Unsupervised Learning of Probabilistic Models for Robot Navigation

Unsupervised Learning of Probabilistic Models for Robot Navigation Unsupervised Learning o Probabilistic Models or Robot Navigation Sven Koenig Reid G. Simmons School o Computer Science, Carnegie Mellon University Pittsburgh, PA 15213-3891 Abstract Navigation methods

More information

A Requirement Specification Language for Configuration Dynamics of Multiagent Systems

A Requirement Specification Language for Configuration Dynamics of Multiagent Systems A Requirement Speciication Language or Coniguration Dynamics o Multiagent Systems Mehdi Dastani, Catholijn M. Jonker, Jan Treur* Vrije Universiteit Amsterdam, Department o Artiicial Intelligence, De Boelelaan

More information

An Analytic Model for Embedded Machine Vision: Architecture and Performance Exploration

An Analytic Model for Embedded Machine Vision: Architecture and Performance Exploration 419 An Analytic Model or Embedded Machine Vision: Architecture and Perormance Exploration Chan Kit Wai, Prahlad Vadakkepat, Tan Kok Kiong Department o Electrical and Computer Engineering, 4 Engineering

More information

Reflection and Refraction

Reflection and Refraction Relection and Reraction Object To determine ocal lengths o lenses and mirrors and to determine the index o reraction o glass. Apparatus Lenses, optical bench, mirrors, light source, screen, plastic or

More information

Shape Retrieval Based on Dynamic Programming

Shape Retrieval Based on Dynamic Programming IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 9, NO. 1, JANUARY 2000 141 # can be ound by solving the ollowing system o equations: z =k H i # k = z =k H i^ i : (16) 3 Repeat 1 and 2 until cluster membership

More information

Passive Distance Learning for Robot Navigation

Passive Distance Learning for Robot Navigation Passive Distance Learning or Robot Navigation Sven Koenig Reid G. Simmons School o Computer Science Carnegie Mellon University Pittsburgh, PA 1213-3890 skoenig@cs.cmu.edu reids@cs.cmu.edu Abstract Autonomous

More information

Balanced Multiresolution for Symmetric/Antisymmetric Filters

Balanced Multiresolution for Symmetric/Antisymmetric Filters Balanced Multiresolution or Symmetric/Antisymmetric Filters Mahmudul Hasan Faramarz F. Samavati Mario C. Sousa Department o Computer Science University o Calgary Alberta Canada {mhasan samavati smcosta}@ucalgary.ca

More information

GEOMETRICAL OPTICS OBJECTIVES

GEOMETRICAL OPTICS OBJECTIVES Geometrical Optics 207 Name Date Partners OBJECTIVES OVERVIEW GEOMETRICAL OPTICS To examine Snell s Law and observe total internal relection. To understand and use the lens equations. To ind the ocal length

More information