4 resultados para alignment-free methods
em Universitätsbibliothek Kassel, Universität Kassel, Germany
Resumo:
Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.
Resumo:
The application of nonlinear schemes like dual time stepping as preconditioners in matrix-free Newton-Krylov-solvers is considered and analyzed. We provide a novel formulation of the left preconditioned operator that says it is in fact linear in the matrix-free sense, but changes the Newton scheme. This allows to get some insight in the convergence properties of these schemes which are demonstrated through numerical results.
Resumo:
Even though there have been many studies on the impact of trade liberalisation on labour standards, most of the studies are at national level, and there is a lack of research at industry level. This paper examines the impact of free trade on labour standards in capital- and labour-intensive industries in a developing country. For empirical findings, I take the case of the garment industry, representing labour-intensive industry, and automotive industry, representing capital-intensive industry, in Indonesia in the face of ASEAN Free Trade Area (AFTA). Since the garment industry is a women-dominated industry, while the automotive industry is a men-dominated industry, this paper also employs a feminist perspective. As such, this paper also investigates whether free trade equally affects men and women workers. Besides free trade, other independent variables are also taken into account. Employing quantitative and qualitative methods, empirical evidence shows that there is an indication that free trade has a negative relationship with labour standards in the garment industry, whereas a positive relationships with labour standards in the automotive industry. This implies that free trade might result in decreasing labour standards in labour-intensive industry, while increasing standards in capital-intensive industry. It can also be inferred that free trade unequally affect men and women workers, in that women workers bear the brunt of free trade. The results also show that other internal and external independent variables are indicated to have relationships with labour standards in the garment and automotive industries. Therefore, these variables need to be considered in examining the extent of the impact of free trade on labour standards in labour- and capital-intensive industries.
Resumo:
We consider numerical methods for the compressible time dependent Navier-Stokes equations, discussing the spatial discretization by Finite Volume and Discontinuous Galerkin methods, the time integration by time adaptive implicit Runge-Kutta and Rosenbrock methods and the solution of the appearing nonlinear and linear equations systems by preconditioned Jacobian-Free Newton-Krylov, as well as Multigrid methods. As applications, thermal Fluid structure interaction and other unsteady flow problems are considered. The text is aimed at both mathematicians and engineers.