Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Size: px
Start display at page:

Download "Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System"

Transcription

1 Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department of Tehnologies of the Integrated Computer-aided Systems, Mosow Aviation Institute (National Researh University), Volokolamskoie highway, 4, Mosow , Russia. 2 Department of Radio Engineering Devies and Antenna Systems, National Researh Institute Mosow Power Engineering Institute, Krasnokazarmennaya st., 14, Mosow , Russia. 3 Department of Radio Physis, Voronezh State University, Universitetskaya sq., 1, Voronezh , Russia. *Corresponding author 2# Orid: Abstrat We suggest a simple, fast algorithm for the automated projet generation based on the data integrated in the invariant strutural-parametri model. The sample system is built (based) on this algorithm, and it inludes projet management software and interfae module. It allows user to prepare and ompose fully desribed projet within the Mirosoft Projet appliation. There is no manual data input or onversion needed. This solution an be used while dealing with any task requiring proess modeling and optimization, for example, data ompression, et. Keywords: Projet management, Automation, programming, Data onversion, Data ompression, Data transformation, Modeling, Strutural modeling, Parametri modeling. INTRODUCTION System for the automated generation of projets is a software produt designed for omputer-aided drafting (ompiling lists and tasks) for the purpose of alulation and optimization of any proess, inluding the prodution ones (organizational and tehnial solutions OTR). The system inludes several modules and is based on the invariant model provided by a struture-parametri modeling (SPM). To desribe the model, one uses linguisti apabilities and translators. The output is a omplete set of desriptions of the projet, whih an be loaded, for example, into Mirosoft Projet. This eliminates the need for manual data migration and settlement. A key element of the system is a software interfae for onverting data from the strutural-parametri model. The results of this development are intended to be applied for both omposition and desription of the varied data ompression proesses. THE MATHEMATICAL INTERPRETATION Let us onsider the mathematial interpretation of the funtional aspet of the system interfae. The formalization is arried out using the fundamental foundations of mathematis [1, 2] and set theory [3, 4]. The results of these studies lead us to the onlusion that the proess of the projet generation may be presented at a set-theoreti level, by the model ombining the three main interrelated mehanisms: where П(С)=П I (С)П II (С)П III (С), П I (С) produes analysis of the objet and extrats the design data on the basis of the invariant produt model; П II (С) onverts the objet struture on the basis of the tehnial solution; П III (С) performs both proessing and transformation of resoures (labor and material) and loads the obtained onversion results into the projet management system in order to omplete the projet. Let us present a desription of the mehanisms. П I (С)=A, N, B, R AN, G C, I. Here A is a set of model elements, N is a set of model parameters; B set of link sets (may be interpreted as R AA ); R AN are the relations whih determine the affiliation of parameters to elements; G C is a proess protool; I is a set of proedures that support proessing elements, parameters and relations in the model. We an see that the proedures to be determined will inlude software tools for the operation with the strutural-parametri database, solving the following ruial tasks: extrating elements, extrating parameters, proessing links. П II (С)=A, N, B, R AN, G C, II. (1) Here A is a set of model elements; N is a set of model parameters; B is a set of link sets; R AN are the relations whih determine the affiliation of parameters to elements; G C is a proess protool; II is a set of proedures that support the mehanisms of transformation of the olleted projet data into the import format of Mirosoft Projet. The omposition of the proedures defined in the II = ( f З, f С ), (2) 14199

2 where f З is the funtion of the task list reation, f С is the funtion of the formation of the system of relations. П III (С)=P, Q, L, R AN, G C, III. (3) Here P is a set of projet tasks; Q is a set of projet resoures; L is a set of task relationships sets (an be interpreted as R PP ); R PQ are the relations determining the affiliation of resoures to the tasks; G C is a proess protool; III is a set of proedures that support the mehanisms of the generated data loading into the projet management system: III = ( f Р, f 1,, f n ), where f Р is a funtion of the resoures proessing and loading. It is predetermined that these resoures will also inlude the proedures preparing and reording the import files f 1,,f n (the value of n depends on the funtionality of the interfae). Thus, as it has been previously mentioned, the struture of the interfae inludes three main mehanisms together solving the task of the projet generation. The most important among them is the mehanism of data onversion, so now we pass to the study of the basi funtions that it involves. FORMING THE TASK LIST The SPM apparatus analysis shows that the struturalparametri model in its relation to its onditions and tasks an be represented as this set of omponents: M SPM = (A, N, R AA, R AN ), (4) where A is a set of model elements, N is a set of model parameters, R AA are the relations (links) between the elements, R AN are the relations determining the affiliation of the parameters to the elements. We desribe the sets inluded in the SPM as A = { a 1,, a n }, (5) where a i is a single model element defined in the ELEMENTS blok (of the model); N = { n 1,, n n }, (6) where n i is a single parameter of the model defined in the PARAMETERS blok (of the model). The model of the projet resulting from the interfae operation an be desribed by the set of the following omponents: M P = (P, Q, R PP, R PQ ), Desription of the sets inluded into the projet then takes the form of where p i is a single projet task; P = { p 1,, p n }, (7) Q = { q 1,, q n }, where q i is a single unit of the resoures involved in the projet, as defined in the "LIST OF RESOURCES". However, given the arrangement that the SPM elements system and the tasks in the projet have, it is more onvenient to express these omponents through the set where eah element itself is a set of elements of the model, or of the projet, belonging to the link unit: M SPM = (A, N, B, R AN ), M P = (P, Q, L, R PQ ). All the model elements, as well as its parameters, possess ertain properties. In the present ase, the set of properties an be generally presented as a i A (F(a i) = (F 1 F n)), where F i is a property of an element. In order to perform orret work of mehanism П I, the item onverted into a projet task neessarily differs from the rest of the model elements. Firstly, it has to be a part of the solution, and, seondly, it is to be marked with a parameter marker. These are the properties needed. Figures 1 and 2 show how the elements of the model are seleted for their subsequent inlusion in the list of tasks. Let now desribe the set of properties with the help of the table from Figure 1. This is example for a model with 5 elements and 7 possible properties (the dot indiates whether the element has a property). So, there we an find the possible model elements properties, the two of them marked as the ones whose presene makes the ourrene of the element in the future tasks list possible. The tables a and b in Figure 2 present the approximate set of elements and their properties. The table a presents all the elements, and the table b implements the elements seletion. f 1 f 2 f 3 f 4 f 5 f 6 f 7 F(A) Figure 1: Charateristis of the task-element where P is a set of projet tasks, Q is a set of resoures, R PP are the relations (links) between the tasks, and R PQ are the relations determining the belonging of the resoures to the tasks

3 f 1 f 2 f 3 f 4 f 5 f 6 f 7 a 1 a 2 a 3 a 4 a 5 a) f 1 f 2 f 3 f 4 f 5 f 6 f 7 a 2 a 3 b) Figure 2: The tables of the harateristis and of the results of the elements seletion: a) harateristis of the SPM elements; b) the result of the elements seletion From here we selet the ondition for the ourrene of a model element in a future projet as a task: F(A) = (F 3, F 4 ). The solution produed by means of the speified tables is A = (a 2, a 3). That eah element possesses some speifi properties an be desribed by a Boolean matrix of the following form: ij A F A F n1 F n2 Fm 1m a1 2m a2 nm an The parameter takes the value 0 or 1 depending on the properties of the element: ij 1, if Fi F( ai ), 0, if Fi F( ai ). As the seleted properties may belong to the multiple elements, the olletions of items for eah property should be represented as a separate set K = { k 1,, k n }, where we an see that k i has a parameter marker. Then k i : k i A, but it may be that а i K, A: A K, K: F(A) F(K). And the set of the elements inluded in the solution is E = { e 1,, e n }, where e i is the item, for whih the following ondition is fulfilled: e i ELRESH (the list of solution items). Then e i : e i A, but it may be that а i E, A: A E, E: F(A) F(E). As we see, F(A) ontains all the model elements, inluding support and geometri elements, their transmission into the projet management system not required. Thus, F(E) ontains only those elements that need to be transferred to the projet for planning. Finally, we selet a set of elements possessing both properties: D = { d 1,, d n }, where d i is the element with the parameter marker and is inluded in the solution. Then d i : d i A, but it may be that а i D, A: A D, D: F(A) F(D). There F(A) ontains all the model parameters, inluding support and geometri parameters, their transmission into the projet management system not required. Thus, F(D) ontains only those parameters that need to be transferred to the projet for planning. Hene, the set D, as well as K and E, is a subset of A and is formed by the intersetion of the sets K and E: D = K E, F(D)=F(K) F(E). Now we define the ondition for the seletion of the elements to be inluded into the projet: a i D ((a i E)( a i K)) or a i D (F(a i) = F 3(a i) F 4(a i)). As a result, the task of produing the projet task list for the interfae is redued to the desription of the funtion f З: p i = f З(d i). This feature is to be inluded into the mehanism of the SPM data onversion into the Mirosoft Projet data. CREATING A LIST OF RESOURCES The next task is a transfer of resoures. It involves the deision similar to the presented above. As resoures in the SPM are represented by the parameters of a ertain type, we implement additional set V: V = { v 1,, v n }, where v i is the parameter of the "resoure" type. Then 14201

4 v i : v i N, but it may be that v i N, N: N V, V:F(N) F(V). We define all the types of the parameters via the harateristis table (Fig.3). f 1 f 2 f 3 f 4 f 5 f 6 f 7 F(N) Figure 3: Charateristis of the task-element The properties we are interested in are the parameter types "working resoures" and "material resoures". Thus, we an determine the ondition for sampling the parameters to be inluded into the projet as a ertain type of resoures in the following way: n i V (F(n i) = F 6(n i) F 7(n i)). As a result, the task of forming projet resoures for the interfae is redued to the desription of the funtion f Р: q i = f Р(v i). This feature will be inluded in the onversion mehanism of SPM data into the projet data for Mirosoft Projet. THE MODEL AND ALGORITHM In general, we an onlude that the task of developing an interfae an be redued to the implementation of the mehanisms presented above and to the appliation of the modern software development tools. Thus, our three mehanisms will work in the following way: П I (С) the mehanism is based on the built-in proedures for the SPM operating, allowing aessing the elements and parameters of the model in order to retrieve the neessary data; П II (С) the mehanism is based on the algorithms for the data transformation implemented in the environment of Mirosoft Visual Studio C++, its basi sheme onsists in an iterative proessing of the arrays of elements extrated from the model; П III (С) this mehanism works on the basis of the algorithms for the data transformation, implemented in the environment of Mirosoft Visual Studio C++. The basi sheme onsists in an iterative proessing of arrays of parameters (resoures), extrated from the model. The transfer of resoures into the projet management system provides a maro reated by means of VBA. Therefore, the system interfae will inlude three key algorithms: 1. Algorithm for data analysis and extration; the algorithm represents a yle with sequential seletion of elements and parameters and their further analysis (verifiation onditions), aiming at the generation of a projet struture. 2. Algorithm for data onversion and transfer; the algorithm represents a yle of the serial onversion of the obtained struture of the projet into a format suitable for its input into the projet management system. 3. Algorithm for the generation of the list of resoures; the algorithm is a ylial proessing of resoures parameters for resoures alloation (by marker validation) and the generation of their list in the format of the projet management system. Before a software system development, the study is onduted, in order to identify the possible problems and peuliarities, taking into aount the available software produts that an be used as the omponents of the system. Depending on the a priori aepted onditions, there an be several design algorithms. We should onsider the most important fators that, in fat, are the deisive riteria when hoosing a suitable variant for the algorithm implementation. First suh fator is the presene or absene of tools to work with formats and internal funtions of the automated system (AS) and detailed guidelines for their use. In order to develop an algorithm, whih works with the formats of different systems, first of all, you must either learly represent the struture and the form in whih tehnial information is stored in formats of AS, or have a fully desribed and extensively worked on software tools that works with this format. Quite often suh tools and guidane on their appliation is provided by the developer together with the AS, usually the library funtions are ompiled into the standard Windows format DLL Dynamially Linked Library. In order to work with these omponents programmer simply onnet them to the projet and immediately gets the opportunity to work with different internal funtions of AS [5]. In this ase, the task of implementing the interfae beomes simpler, and the work is redued mainly to the maintaining software data onversion. Different situation arises, if the AS produer does not provide the doumentation and other means neessary for external developers to operate the features and formats of AS and just gives a detailed desription of all the formats and aess methods. The system may support only its own speifi and losed formats for information import/export and not the ommon ones. In this ase, the programmer would have to write all the funtions performing the needed information/data extration and proessing, the solution that may require the appliation of heuristi methods. This will inevitably affet the ost of the designed produt, in some ases serving as a possible reason for the rejetion of the hoie of this partiular AS, with subsequent revision of the desired system integration method

5 The seond fator is whether the AS supports one or more of ommon import formats, whose detailed ontent desription and the struture, as well as their methods and tools, are available for developers. As a rule, for them there are already many third-party software proessing tools, inluding the open soure ones. The next option is: the AS produer does not provide any supporting tools and data for external developers, but the system supports additional import formats, ontent and desription of whih are widely known and available for the programmer, as a DXF format for CAD systems, for example. In this situation, the most diffiult work is redued to the transformation of the data/information and providing its auray and integrity [6]. If the support of ommon formats is missing and there is no software apable of operating the internal funtions of the system, i.e. it is losed as its format, one would have to make a diffiult deision, or to selet a different AC, or a different method of integration of suh systems. The third fator onsists in the size of the budget and the time frame alloated for the projet. They radially affet the hoie of methods and means of integration, espeially for Russian ompanies. Now, on the basis of the above stated, we an present a general desription of the basi options for the ontent of the algorithm onstruting the software interfae, aiming at the integration of the seleted systems. These options differ from one another by presene or absene of ertain operations and by the sequene of operations in the algorithms they provide. Option 1. Diret onversion of the formats from one to another is arried out without running the AS. The interfae works with the file of the system from whih you import by means of the internal funtions of this very system. The result is stored in the importing system s format. In this ase, no AS installed on a omputer is required, whih is one of the advantages of this option. Option 2. The formats are onverted from one to another through the intermediate format, without running the AS. This option presupposes that a ertain external auxiliary onverter is used, performing the transformation of data from the intermediate format into the importing system s format. In this ase, there is also no need to install AS. Option 3. Data onversion triggers one of the AS and utilizes its internal funtions. The interfae operation is only possible on the omputer with the ertain AS and the partiular API funtions library installed (if the latter is not supplied with the interfae already). Option 4. The data onversion triggers both systems and utilizes their internal funtions. As it has been previously mentioned, as a system data soure the SPM Modeler is seleted, and its appliability is determined by the following reasons: SPM is invariant to the semantis of the data in the ontext of the speifi objet modeling; the Modeler allows generating geometri models of omplex topology; SPM an be used in "assembly diagrams" nodes models; SPM S(A) is based on the strutural properties of the systems and an be used in data formulation for the elements of the simulation objet A, the properties of F and the relations between the elements and the properties of R; matrix apparatus and system of relations are the algorithmi basis for the solution of a wide range of tasks by applying a modular priniple of information management during the models proessing; SPM provides extensive features for parameterization and struturing. To illustrate the operation of the system, Mirosoft Projet is seleted as the projet management system, as it is haraterized by a universal availability and a great variety of funtions implementing the tasks regulated in the MRP-I and MRP-II. The hoie in favor of this lass of systems is the result of the suggestion aepted to introdue suh AS as the omponent of the integrated solution, instead of the ERP, that, for the domesti enterprises, appears to be hard to implement and apply. The more so, as the struture of the information oming as the original data in SPM is almost equivalent to the one in ERP, or PDM, systems. Theoretially, the hoie of the AS is not a key fator, signifiantly influening the appliability of the suggested sheme (PS (Modeler) interfae PM (PDM, ERP in existing solutions)), due to the invariane of the latter relative to the speifi systems. Thus, the solution (the proedure) is expeted to have suffiient adaptability, at least within our field of study and researh. The results of this analysis based on the projet operation tasks and the AS seleted, a deision is made to develop the algorithm using the ombined approah involving the following interfae operation sequene: the soure data is extrated by means of the SPM speial internal funtions, used for the external aess to the SPM format without triggering the entire omplex; and then the information is strutured, verified and onverted to the import format of the projet management systems. Part of the data is generated in intermediate format, for its subsequent loading into the system by means of a speial maro integrated in the projet management system [7]. The resulting import file is opened in Mirosoft Projet environment and the generation of the projet framework begins, followed by the loading of resoures and the 14203

6 generation of the resoure table, until the projet generation is ompleted. The results of the projet design are presented as a high-level algorithm of the interfae module operation, desribed following the IDEF0 methodology [8, 9]. The orresponding hart is shown in Fig. 4, 5. Fig. 4b presents the deployment of the root diagram showing the basi stages of the projet generation, implemented by means of the three interfae mehanisms desribed above. Fig. 5a, presents the deployment of the first blok of the first level diagram, demonstrating the main stages of the extration proess. Fig. 5b presents the deployment of the seond blok of the first level diagram, showing the basi steps of the data onversion proess. Fig. 5 shows the deployment of the third blok of the first level diagram, illustrating the main stages the projet data loading into the Mirosoft Projet takes. a) b) Figure 4: Upper level diagrams: a) root diagram; b) first level diagram (shows usage of П I П II П III mehanisms) a) 14204

7 b) ) Figure 5: Bloks deployment for the first level diagram: a) diagram 1, seond level; b) diagram 2, seond level (shows usage of f 3, f P, f C funtions); ) diagram 3, seond level As we an see, the diagrams below present the harts that depit the most important stages of the proess of the interfae operation and, in fat, onstitute together the oneptual sheme of the projet generation proedure. П II (С) operates within bloks 7, 10, 11; П III (С) operates within blok 13. Fig. 6 shows high-level algorithm for the proess of data transition from SPM to Mirosoft Projet: П I (С) operates within blok 6; 14205

8 Figure 6: High-level algorithm sheme The diagrams present the main stages and bloks of the proess of the interfae operation. Most of these bloks inlude yli algorithms for the operation with the arrays of elements and parameters of the model to be onverted into tasks and projet resoures. The suggested solution was tested as a part of the orporate information system for management and planning, deployed at a spae plant. The system is based on the omplex modeling produt (SPM), with the Mirosoft Projet environment managing the projet applied. This omplex was used for the tehnial produts manufaturing planning. A trial period shows signifiant redution of the data input time and errors quantity. The period needed for the data entry into the projet management system is redued almost by two times. But there are still some restritions enountered during the testing: some versions of the Mirosoft Projet appliations annot support large models that ontain huge numbers of elements (from to ). Given this, we have to test the models of the middle and small sizes. The suggested solution allows avoiding manual entry of data into the projet management system, and thus the number of errors is redued. We expet a signifiant redution in the time it takes to build the projets for planning through the automated data transfer from the modeling system. CONCLUSION The suggested simple and fast digital algorithm onverting data for projet generation allows reating and managing various proess models, in order to find optimal (balaned) solution. Projets an be loaded into any Projet Management system for the subsequent analysis and optimization. Suggested solution provides the possibilities to avoid multiple errors produed by the manual data input and onversion

9 ACKNOWLEDGEMENT This work was supported by the Ministry of Eduation and Siene of the Russian Federation (projet No ). REFERENCES [1] Gorbatov, V.F., 2000, Fundamentals of Disrete Mathematis (in Russian), Nauka, Fizmatlit, Mosow. [2] Chenin, P., Cosnard, M., Gardan, Y., et al., 1985, Mathematiques et САО: In 2 Volumes, Hermes Publishing, New Castle. [3] Mostowski, A., 1969, Construtive Sets with Appliations, North Holland PWN, Amsterdam Warszawa. [4] Jeh, T.J., 2003, Set Theory, Springer-Verlag, Berlin. [5] Blagodatskih, V.A., Engibaryan, M.A., Kovalevskaya E.V., et al., 1995, Eonomis, Development and Use of PC Software (in Russian), Mosow, Finansy i Statistika. [6] Hotyashov, E.N., 1995, Fundamentals of Automati Data Proessing Systems Engineering (in Russian), Finansy i Statistika, Mosow. [7] Martin, P., and Tate, K., 2001, Getting Started in Projet Management, Wiley, New Jersey. [8] Integrated Information Support System. Information Modeling Manual IDEF0-Extended. ICAM Projet Priority 6201, General Eletri Company, New York, [9] Integrated Computer-Aided Manufaturing (ICAM) Arhiteture. Part II. Volume IV Funtion Modeling Manual (IDEF0), SoftTeh. In., Waltham,

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger. - 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Parametric Abstract Domains for Shape Analysis

Parametric Abstract Domains for Shape Analysis Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

The recursive decoupling method for solving tridiagonal linear systems

The recursive decoupling method for solving tridiagonal linear systems Loughborough University Institutional Repository The reursive deoupling method for solving tridiagonal linear systems This item was submitted to Loughborough University's Institutional Repository by the/an

More information

Adobe Certified Associate

Adobe Certified Associate Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R. EngOpt 2008 - International Conferene on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. Automated System for the Study of Environmental Loads Applied to Prodution Risers Dustin M. Brandt

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

Verifying Interaction Protocol Compliance of Service Orchestrations

Verifying Interaction Protocol Compliance of Service Orchestrations Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

This fact makes it difficult to evaluate the cost function to be minimized

This fact makes it difficult to evaluate the cost function to be minimized RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method 3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Query Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks

Query Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks Query Evaluation Overview Query Optimization: Chap. 15 CS634 Leture 12 SQL query first translated to relational algebra (RA) Atually, some additional operators needed for SQL Tree of RA operators, with

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

The AMDREL Project in Retrospective

The AMDREL Project in Retrospective The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis

More information

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC Priya N. Werahera and Anura P. Jayasumana Department of Eletrial Engineering Colorado State University

More information

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8 Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4

More information

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial

More information

Semi-Supervised Affinity Propagation with Instance-Level Constraints

Semi-Supervised Affinity Propagation with Instance-Level Constraints Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,

More information

High-level synthesis under I/O Timing and Memory constraints

High-level synthesis under I/O Timing and Memory constraints Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,

More information

The SODA AOSE Methodology

The SODA AOSE Methodology The SODA AOSE Methodology Multiagent Systems LM Sistemi Multiagente LM Ambra Molesini & Andrea Omiini {ambra.molesini, andrea.omiini}@unibo.it Dipartimento di Informatia Sienza e Ingegneria (DISI) Alma

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Dynamic Algorithms Multiple Choice Test

Dynamic Algorithms Multiple Choice Test 3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

Sparse Certificates for 2-Connectivity in Directed Graphs

Sparse Certificates for 2-Connectivity in Directed Graphs Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale

More information

Mining effective design solutions based on a model-driven approach

Mining effective design solutions based on a model-driven approach ata Mining VI 463 Mining effetive design solutions based on a model-driven approah T. Katsimpa 2, S. Sirmakessis 1,. Tsakalidis 1,2 & G. Tzimas 1,2 1 Researh ademi omputer Tehnology Institute, Hellas 2

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

A Formal Hybrid Analysis Technique for Composite Web Services Verification

A Formal Hybrid Analysis Technique for Composite Web Services Verification A Formal Hybrid Analysis Tehnique for Composite Web Servies Verifiation MAY HAIDAR 1,2, HICHAM H. HALLAL 1 1 Computer Siene Department / Department of Eletrial Engineering Fahad Bin Sultan University P.O

More information

Improved flooding of broadcast messages using extended multipoint relaying

Improved flooding of broadcast messages using extended multipoint relaying Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia

More information

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst XML Stream Proessing Yanlei Diao University of Massahusetts Amherst XML Data Streams XML is the wire format for data exhanged online. Purhase orders http://www.oasis-open.org/ommittees/t_home.php?wg_abbrev=ubl

More information

Definitions Homework. Quine McCluskey Optimal solutions are possible for some large functions Espresso heuristic. Definitions Homework

Definitions Homework. Quine McCluskey Optimal solutions are possible for some large functions Espresso heuristic. Definitions Homework EECS 33 There be Dragons here http://ziyang.ees.northwestern.edu/ees33/ Teaher: Offie: Email: Phone: L477 Teh dikrp@northwestern.edu 847 467 2298 Today s material might at first appear diffiult Perhaps

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Cluster Centric Fuzzy Modeling

Cluster Centric Fuzzy Modeling 10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we

More information

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

Compilation Lecture 11a. Register Allocation Noam Rinetzky. Text book: Modern compiler implementation in C Andrew A.

Compilation Lecture 11a. Register Allocation Noam Rinetzky. Text book: Modern compiler implementation in C Andrew A. Compilation 0368-3133 Leture 11a Text book: Modern ompiler implementation in C Andrew A. Appel Register Alloation Noam Rinetzky 1 Registers Dediated memory loations that an be aessed quikly, an have omputations

More information

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering

More information

A scheme for racquet sports video analysis with the combination of audio-visual information

A scheme for racquet sports video analysis with the combination of audio-visual information A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Fast Elliptic Curve Algorithm of Embedded Mobile Equipment

Fast Elliptic Curve Algorithm of Embedded Mobile Equipment Send Orders for Reprints to reprints@benthamsiene.net 8 The Open Eletrial & Eletroni Engineering Journal, 0, 7, 8-4 Fast Ellipti Curve Algorithm of Embedded Mobile Equipment Open Aess Lihong Zhang *, Shuqian

More information

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints 5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of

More information

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

PERSISTENT NAMING FOR PARAMETRIC MODELS

PERSISTENT NAMING FOR PARAMETRIC MODELS PERSISTENT NAMING FOR PARAMETRIC MODELS Dago AGBODAN, David MARCHEIX and Guy PIERRA Laboratory of Applied Computer Siene (LISI) National Shool of Engineers in Mehanis and Aeronautis (ENSMA) Téléport 2

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008

More information

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G. Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland

More information

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0 Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Title: Time-Based Tree Graphs for Stabilized Force Structure Representations

Title: Time-Based Tree Graphs for Stabilized Force Structure Representations Paper for the 8 th International Command & Control Researh & Tehnology Symposium Title: Time-Based Tree Graphs for Stabilized Fore Struture Representations Submitted by: Sam Chamberlain U.S. Army Researh

More information

Improved Circuit-to-CNF Transformation for SAT-based ATPG

Improved Circuit-to-CNF Transformation for SAT-based ATPG Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia

More information

One Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?

One Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs? One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2

CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2 CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2 PROPRIETARY AND CONFIDENTIAL INFMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For

More information

Assembling Paradigms of Programming in Software Engeneering

Assembling Paradigms of Programming in Software Engeneering Journal of Software Engineering and Appliations, 2016, 9, 296-317 Published Online June 2016 in SiRes. http://www.sirp.org/journal/jsea http://dx.doi.org/10.4236/jsea.2016.96021 Assembling Paradigms of

More information

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING

TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING Proeedings of DETC 97: 1997 ASME Design Engineering Tehnial Conferenes September 14-17,1997, Saramento, California DETC97/DFM-4333 TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING Alexei Elinson Dept.

More information

Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis

Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis Reverse Engineering of Assembler Programs: A Model-Based Approah and its Logial Basis Tom Lake and Tim Blanhard, InterGlossa Ltd., Reading, UK Tel: +44 174 561919 email: {Tom.Lake,Tim.Blanhard}@glossa.o.uk

More information

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen The Heterogeneous Bulk Synhronous Parallel Model Tiani L. Williams and Rebea J. Parsons Shool of Computer Siene University of Central Florida Orlando, FL 32816-2362 fwilliams,rebeag@s.uf.edu Abstrat. Trends

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information