Modeling of systems

The handbook contains the fundamentals of modeling of complex systems. The classification of mathematical models is represented and the methods of their construction are given. The analytical modeling of the basic types of processes in the complex systems is considered. The principles of simulation, statistical and business processes modeling are described. The handbook is oriented on students of higher education establishments that obtain a degree in directions of “Software engineering” and “Computer science” as well as on lecturers and specialists in the domain of computer modeling

Virtual Machine Allocation Policy in Cloud Computing Environment using CloudSim

Cloud computing has been widely accepted by the researchers for the web applications. During the past years, distributed computing replaced the centralized computing and finally turned towards the cloud computing. One can see lots of applications of cloud computing like online sale and purchase, social networking web pages, country wide virtual classes, digital libraries, sharing of pathological research labs, supercomputing and many more. Creating and allocating VMs to applications use virtualization concept. Resource allocates policies and load balancing polices play an important role in managing and allocating resources as per application request in a cloud computing environment. Cloud analyst is a GUI tool that simulates the cloud-computing environment. In the present work, the cloud servers are arranged through step network and a UML model for a minimization of energy consumption by processor, dynamic random access memory, hard disk, electrical components and mother board is developed. A well Unified Modeling Language is used for design of a class diagram. Response time and internet characteristics have been demonstrated and computed results are depicted in the form of tables and graphs using the cloud analyst simulation tool

Study of material interpolation for 3D lightweight structures

The use of computer tools has become essential in modern engineering, from the use of specific software to programming it. That is why this work seeks to provide the tools to understand the essential knowledge of programming for a modern engineer, which allows the easy correction, understanding and efficiency of the code. In addition, the thesis seeks to solve one of the heuristic problems of topology optimization. It is a research field that obtains optimal design structures in terms of volume usage. The most popular approach, the SIMP method, an auto-penalized interpolation function in a relaxed topology optimization problem, does not always propose actual solutions. For this reason, an alternative solution to the SIMP method is to be found for any case scenario. Finally, it is intended to apply these knowledge by rewriting part of the Swan code. By refactoring a previously programmed code from the subject ’aerospace structures’, called ”Codi Cante”, the sections object oriented programming, work with cloud backups, test driven development and clean code are developed. These are tools used by modern software engineers. Regarding topology optimization, an alternative method called SIMP-All is used to solve the drawbacks of the SIMP method. From the previously defined methods, knowledge is acquired to program efficiently and structurally. At this point, object oriented programming, cloud-backed work, test driven development and clean code are discussed. On the other hand, the results concerning topology optimization allow the obtaining of optimal and actual structures. Firstly, the SIMP-All method solution for three-dimensional cases is found. The solution is then shown to be part of the physical limits called ”Hashin-Shtrikman bounds” and a comprehensive solution for the SIMP-All method is proposed. These results are compared with the SIMP method in two and three dimensions. Finally, all the new knowledge is applied to rewrite part of the Swan code. In conclusion, from the refactoring of the ”Codi Cante”, sufficient tools have been developed to understand essential knowledge of programming by a modern engineer. Besides that, it has been possible to obtain a general equation for the SIMP-ALL method. Not only does the generalized equation allow to find optimal results, but the generated structures are also possible in the reality. Furthermore, the equation has been implemented in the Swan program using the new programming knowledge, thus allowing an easy correction, understanding and efficiency of the code

FROM MUSIC INFORMATION RETRIEVAL (MIR) TO INFORMATION RETRIEVAL FOR MUSIC (IRM)

This thesis reviews and discusses certain techniques from the domain of (Music) Information Retrieval, in particular some general data mining algorithms. It also describes their specific adaptations for use as building blocks in the CACE4 software application. The use of Augmented Transition Networks (ATN) from the field of (Music) Information Retrieval is, to a certain extent, adequate as long as one keeps the underlying tonal constraints and rules as a guide to understanding the structure one is looking for. However since a large proportion of algorithmic music, including music composed by the author, is atonal, tonal constraints and rules are of little use. Analysis methods from Hierarchical Clustering Techniques (HCT) such as k-means and Expectation-Maximisation (EM) facilitate other approaches and are better suited for finding (clustered) structures in large data sets. ART2 Neural Networks (Adaptive Resonance Theory) for example, can be used for analysing and categorising these data sets. Statistical tools such as histogram analysis, mean, variance as well as correlation calculations can provide information about connections between members in a data set. Altogether this provides a diverse palette of usable data analysis methods and strategies for creating algorithmic atonal music. Now acting as (software) strategy tools, their use is determined by the quality of their output within a musical context, as demonstrated when developed and programmed into the Computer Assisted Composition Environment: CACE4. Music Information Retrieval techniques are therefore inverted: their specific techniques and associated methods of Information Retrieval and general data mining are used to access the organisation and constraints of abstract (non-specific musical) data in order to use and transform it in a musical composition

An Integrated framework for firewall testing and validation

In today's global world, most corporations are bound to have an Internet presence. This phenomenon has led to a significant increase in all kinds of network attacks. Firewalls are used to protect organizational networks against these attacks. Firewall design is based on a set of filtering rules. Because of the nature of these rules, and due to the rising complexity of security policies, an increasing number of mistakes are found in configurations. A reliable and automated technique for testing firewall configuration is becoming necessary to ensure the full functionality of the firewall. In this thesis, a new approach to fully test a firewall has been developed using a white box approach that takes into account its inner implementation. Also--thanks to the information provided by the network information file--the environment where the firewall will be deployed is considered, ensuring a better accuracy and performance than previous work. Moreover, the method uses a combination of algorithms that remove common misconfigurations widely present in current firewall configurations [I] and guarantees a coverage that is greater than previous methods for generating test sets with a novel test set generation approach. The developed framework is fully automated and contains the full steps to get testing done, from the parsing of the firewall file to the generation of the test set based on the actual configuration of the firewall to the correction of the error in the firewall file, avoiding all types of errors of omission and misconfiguration that occur during a manual configuration. Keywords: Firewall, Policy Language, Conflict Free Rules, Rule Set, White Box Testing, Misconfiguration Errors, Configuration, Rule Updat

Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality

We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts published in a same volume. Part II is dedicated to the relation between logic and information system, within the scope of Kolmogorov algorithmic information theory. We present a recent application of Kolmogorov complexity: classification using compression, an idea with provocative implementation by authors such as Bennett, Vitanyi and Cilibrasi. This stresses how Kolmogorov complexity, besides being a foundation to randomness, is also related to classification. Another approach to classification is also considered: the so-called "Google classification". It uses another original and attractive idea which is connected to the classification using compression and to Kolmogorov complexity from a conceptual point of view. We present and unify these different approaches to classification in terms of Bottom-Up versus Top-Down operational modes, of which we point the fundamental principles and the underlying duality. We look at the way these two dual modes are used in different approaches to information system, particularly the relational model for database introduced by Codd in the 70's. This allows to point out diverse forms of a fundamental duality. These operational modes are also reinterpreted in the context of the comprehension schema of axiomatic set theory ZF. This leads us to develop how Kolmogorov's complexity is linked to intensionality, abstraction, classification and information system.Comment: 43 page