No description available.

No description available.

Against the theoretical background of evolutionary behavioral economics, this project analyzes bounded rationality and adaptive behaviour in organizational settings characterized by complexity and persistent uncertainty. In particular, drawing upon the standard NK model, two laboratory experiments investigate individual and collective decision-making in combinatorial problems of resource allocation featuring multiple dimensions and various levels of complexity. In the first study, investment horizons of different length are employed to induce a near or distant future temporal orientation, in order to assess the effects of complexity and time horizon on performance and search behaviour, examine the presence of a temporal midpoint heuristic, and inspect the moderating effects of deadline proximity on the performance-risk relationship. This is relevant for organizational science because the passage of time is essential to articulate many strategic practices, such as assessing progress, scheduling and coordinating task-related activities, discerning the processual dynamics of how these activities emerge, develop, and terminate, or interpreting retrospected, current, and anticipated events. A greater or lesser amount of time reflects then a greater or lesser provision of resources, thereby representing a constraint that can greatly affect the ability to maintain a competitive advantage or ensure organizational survival. In the second study, the accuracy of the imitative process is varied to induce a flawless or flawed information diffusion system and, congruently, an efficient or inefficient communication network, in order to assess the effects of complexity and parallel problem-solving on autonomous search behaviour, clarify the core drivers of imitative behaviour, control for the degree of strategic diversity under different communication networks, and evaluate individual as well as collective performance conditional to the interaction between the levels of complexity and the modalities of parallel problem-solving. This is relevant for organizational science because imitating the practices of high-performing actors is one of the key strategies employed by organizations to solve complex problems and improve their performance, thereby representing a major part of the competitive process. The project is intended to contribute grounding individual and collective behaviour in a more psychologically and socially informed decision-making, with a view to further the research agenda of behavioral strategy and sustain the paradigm shift towards an evolutionary-complexity approach to real economic structures.

There are some systems (or parts of systems) that are very critical and need especially good test suites to test them. For these critical systems, exhaustive testing may be a good way to test them. Thus, we have implemented two versions of bounded exhaustive search (BES) algorithms in a model-based testing tool called, Modbat. One of the BES versions (BESnL) visits each self-loop in the model only once. The other version (BESL) has no constraint or limitation on the number of time it visits each self-loop. We have then compared the two BES algorithms with each other and with an already implemented algorithm in Modbat called random search (RS). We have run the three mentioned algorithms (BESL, BESnL and RS) on five different models and compared their performance on these models in terms of time, coverage and finding faults. We have found that BESnL is faster than BESL and it can miss some faults that BESL can find. However, BESnL can find errors faster than BESL. BESL has sometimes better performance than BESnL in terms of branch coverage. In terms of other coverage criteria (like state coverage, transition coverage and instruction coverage), both BESL and BESnL has very similar performance. We have also found that running the RS algorithm is, in general, faster than both BES algorithms at generating tests (given the same total number of tests generated) if the model has a clear end state. RS may also be faster at finding faults than the BES algorithms. However, The BES algorithms and the RS algorithm have similar behaviours regarding coverage. Nevertheless, RS can sometimes reach higher coverage faster than the BES algorithms and with a smaller number of tests. / Det finns vissa system (eller delar av system) som är mycket essentiella och som behöver särskilt bra testsviter för att testa dem. För dessa essentiella system kan uttömmande tester vara ett bra sätt att testa dem. Således har vi implementerat två versioner av begränsad uttömmande sökning eller på engelska ”bounded exhuastive search” (BES) algoritmer i ett modellbaserat testverktyg kallat Modbat. En av BES-versionerna (BESnL) besöker varje självslinga i modellen bara en gång. Den andra versionen (BESL) har ingen begränsning av hur många gånger den besöker varje självslinga. Vi har sedan jämfört de två BES-algoritmerna med varandra och med en redan implementerad algoritm i Modbat som kallas slumpmässig sökning eller på engelska ”random search” (RS). Vi har kört de tre nämnda algoritmerna (BESL, BESnL och RS) på fem olika modeller och jämfört deras prestanda på dessa modeller när det gäller tid, täckning (coverage) och att hitta fel. Vi har funnit att BESnL är snabbare än BESL och det kan missa några fel som BESL kan hitta, men BESnL kan hitta fel snabbare än BESL. BESL har ibland bättre prestanda än BESnL när det gäller filialtäckning (branch-coverage). När det gäller andra täckningskriterier (som statlig täckning, övergångstäckning (tranintion-coverage) och instruktionstäckning) har både BESL och BESnL mycket liknande resultat. Vi har också funnit att körning av RS-algoritmen i allmänhet är snabbare än båda BES- algoritmerna vid generering av tester (givet samma totala antal genererade tester) om modellen har ett klart slutläge (end-state). RS kan också vara snabbare att hitta fel än BES-algoritmerna. BES-algoritmerna och RS-algoritmen har dock liknande beteenden när det gäller täckning. RS kan ibland nå högre täckning snabbare än BES-algoritmerna och med ett mindre antal tester.

Speckle noise occurs in a wide range of images due to sampling and digital degradation. Understanding how noise can be present in images have led to multiple denoising techniques. Most of these denoising techniques assume equal noise distribution. When the noise present in the image is not uniform, the resulting denoised image becomes less than the highest standard or quality. For this research, we will be focusing on speckle noise. Unlike Gaussian noise, which affects single pixels on an image, speckle noise affects multiple pixels. Hence it is not possible to remove speckle noise with the traditional gaussian denoising model. We develope a more accurate speckle denoising model and its stable numerical methods. This model is based on the TV minimization and the associated non-linear PDE and Krissian $et$ $al$.'s speckle noise equation model. A realistic and efficient speckle noise equation model was introduced with an edge enhancing feature by adopting a non-convex functional. An effective numerical scheme was introduced and its stability was proved. Also, while working with TV minimization for non-linear PDE and Krissian $et$ $al$ we used a dual approach for faster computation. This work is based on Chambolle's approach for image denoising. The NLM algorithm takes advantage of the high degree of redundancy of any natural image. Also, the NLM algorithm is very accurate since all pixels contribute for denoising at any given pixel. However, due to non-local averaging, one major drawback is computational cost. For this research, we will discuss new denoising techniques based on NLM and total variation for images contaminated by speckle noise. We introduce blockwise and selective denoising methods based on NLM technique and Partial Differential Equations (PDEs) methods for total variation to enhance computational efficiency. Our PDE methods have shown to be very computational efficient and as mentioned before the NLM process is very accurate.

The Ph.D. Thesis ¿Operators on weighted spaces of holomorphic functions¿ presented here treats different areas of functional analysis such as spaces of holomorphic functions, infinite dimensional holomorphy and dynamics of operators. After a first chapter that introduces the notation, definitions and the basic results we will use throughout the thesis, the text is divided into two parts. A first one, consisting of Chapters 1 and 2, focused on a study of weighted (LB)-spaces of entire functions on Banach spaces, and a second one, corresponding to Chapters 3 and 4, where we consider differentiation and integration operators acting on different classes of weighted spaces of entire functions to study its dynamical behaviour. In what follows, we give a brief description of the different chapters: In Chapter 1, given a decreasing sequence of continuous radial weights on a Banach space X, we consider the weighted inductive limits of spaces of entire functions VH(X) and VH0(X). Weighted spaces of holomorphic functions appear naturally in the study of growth conditions of holomorphic functions and have been investigated by many authors since the work of Williams in 1967, Rubel and Shields in 1970 and Shields and Williams in 1971. We determine conditions on the family of weights to ensure that the corresponding weighted space is an algebra or has polynomial Schauder decompositions. We study Hörmander algebras of entire functions defined on a Banach space and we give a description of them in terms of sequence spaces. We also focus on algebra homomorphisms between these spaces and obtain a Banach-Stone type theorem for a particular decreasing family of weights. Finally, we study the spectra of these weighted algebras, endowing them with an analytic structure, and we prove that each function f ¿ VH(X) extends naturally to an analytic function defined on the spectrum. Given an algebra homomorphism, we also investigate how the mapping induced between the spectra acts on the corresponding analytic structures and we show how in this setting composition operators have a different behavior from that for holomorphic functions of bounded type. This research is related to recent work by Carando, García, Maestre and Sevilla-Peris. The results included in this chapter are published by Beltrán in [14]. Chapter 2 is devoted to study the predual of VH(X) in order to linearize this space of entire functions. We apply Mujica¿s completeness theorem for (LB)-spaces to find a predual and to prove that VH(X) is regular and complete. We also study conditions to ensure that the equality VH0(X) = VH(X) holds. At this point, we will see some differences between the finite and the infinite dimensional cases. Finally, we give conditions which ensure that a function f defined in a subset A of X, with values in another Banach space E, and admitting certain weak extensions in a space of holomorphic functions can be holomorphically extended in the corresponding space of vector-valued functions. Most of the results obtained have been published by the author in [13]. The rest of the thesis is devoted to study the dynamical behaviour of the following three operators on weighted spaces of entire functions: the differentiation operator Df(z) = f (z), the integration operator Jf(z) = z 0 f(¿)d¿ and the Hardy operator Hf(z) = 1 z z 0 f(¿)d¿, z ¿ C. In Chapter 3 we focus on the dynamics of these operators on a wide class of weighted Banach spaces of entire functions defined by means of integrals and supremum norms: the weighted spaces of entire functions Bp,q(v), 1 ¿ p ¿ ¿, and 1 ¿ q ¿ ¿. For q = ¿ they are known as generalized weighted Bergman spaces of entire functions, denoted by Hv(C) and H0 v (C) if, in addition, p = ¿. We analyze when they are hypercyclic, chaotic, power bounded, mean ergodic or uniformly mean ergodic; thus complementing also work by Bonet and Ricker about mean ergodic multiplication operators. Moreover, for weights satisfying some conditions, we estimate the norm of the operators and study their spectrum. Special emphasis is made on exponential weights. The content of this chapter is published in [17] and [15]. For differential operators ¿(D) : Bp,q(v) ¿ Bp,q(v), whenever D : Bp,q(v) ¿ Bp,q(v) is continuous and ¿ is an entire function, we study hypercyclicity and chaos. The chapter ends with an example provided by A. Peris of a hypercyclic and uniformly mean ergodic operator. To our knowledge, this is the first example of an operator with these two properties. We thank him for giving us permission to include it in our thesis. The last chapter is devoted to the study of the dynamics of the differentiation and the integration operators on weighted inductive and projective limits of spaces of entire functions. We give sufficient conditions so that D and J are continuous on these spaces and we characterize when the differentiation operator is hypercyclic, topologically mixing or chaotic on projective limits. Finally, the dynamics of these operators is investigated in the Hörmander algebras Ap(C) and A0 p(C). The results concerning this topic are included by Bonet, Fernández and the author in [16]. / Beltrán Meneu, MJ. (2014). Operators on wighted spaces of holomorphic functions [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/36578 / Premios Extraordinarios de tesis doctorales

We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientation of a tree with fewer vertices the corresponding CSP can be solved in polynomial time. We also compute the smallest tree that is NL-hard (assuming L≠NL), the smallest tree that cannot be solved by arc consistency, and the smallest tree that cannot be solved by Datalog. Our experimental results also support a conjecture of Bulín concerning a question of Hell, Nešetřil and Zhu, namely that ‘easy trees lack the ability to count’. Most proofs are computer-based and make use of the most recent universal-algebraic theory about the complexity of finite-domain CSPs. However, further ideas are required because of the huge number of orientations of trees. In particular, we use the well-known fact that it suffices to study orientations of trees that are cores and show how to efficiently decide whether a given orientation of a tree is a core using the arc-consistency procedure. Moreover, we present a method to generate orientations of trees that are cores that works well in practice. In this way we found interesting examples for the open research problem to classify finite-domain CSPs in NL.

Orientador: Rubén Augusto Romero Lázaro / Resumo: Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver. / Doutor

Submitted by JEFERSON BACK VANDERLINDE null (jefersonbv@yahoo.com.br) on 2017-11-01T16:38:25Z No. of bitstreams: 1 jeferson_tese_final_20171101.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5) / Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-11-13T15:38:34Z (GMT) No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5) / Made available in DSpace on 2017-11-13T15:38:34Z (GMT). No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5) Previous issue date: 2017-09-06 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver. / In this research, the theoretical analysis and computational implementation of the specialized dual simplex algorithm (DSA) and primal simplex algorithm (PSA) for bounded variables is considered. These algorithms have been incorporated in a Branch and Bound (B&B) algorithm to solve the Transmission Network Expansion Planning (TNEP) problem. In this case, the TNEP problem is modeled using transportation model and linear disjunctive model (DM), which produces a mixed-integer linear programming (MILP) problem. After relaxing the integrality of investment variables of the original MILP problem, the PSA is used to solve the initial linear programming (LP) problem. Also, it has been implemented a strategy in PSA to reduce the number of artificial variables which are added into the LP problem, and consequently reduces the number of iterations of PSA. Through optimal solution of the initial LP, the DSA is used in efficient reoptimization of subproblems, resulting from the B&B algorithm, thus excludes the need for complete resolution of each subproblems, which results reducing the CPU time and memory consumption. This research presents the implementation of the proposed approach using the FORTRAN programming language which operates independently and does not use any commercial solver.

The works deals with the possibilities of using non-standard fraction of fine crushed aggregate in route base layers. Goal of my thesis is research of using material from specific location. Theoretical part summarizes basic knowledge regarding bound mixtures and their normative requirements. Practical part of my thesis describes my various mixture design and following testing and determination of design properties by official and experimental tests. The conclusion summarizes the researched outputs and findings, which confirm the future possibilities of using this material in base layers.