Dynamic stability metrics for the container loading problem

The Container Loading Problem (CLP) literature has traditionally evaluated the dynamic stability of cargo by applying two metrics to box arrangements: the mean number of boxes supporting the items excluding those placed directly on the floor (M1) and the percentage of boxes with insufficient lateral support (M2). However, these metrics, that aim to be proxies for cargo stability during transportation, fail to translate real-world cargo conditions of dynamic stability. In this paper two new performance indicators are proposed to evaluate the dynamic stability of cargo arrangements: the number of fallen boxes (NFB) and the number of boxes within the Damage Boundary Curve fragility test (NB_DBC). Using 1500 solutions for well-known problem instances found in the literature, these new performance indicators are evaluated using a physics simulation tool (StableCargo), replacing the real-world transportation by a truck with a simulation of the dynamic behaviour of container loading arrangements. Two new dynamic stability metrics that can be integrated within any container loading algorithm are also proposed. The metrics are analytical models of the proposed stability performance indicators, computed by multiple linear regression. Pearson’s r correlation coefficient was used as an evaluation parameter for the performance of the models. The extensive computational results show that the proposed metrics are better proxies for dynamic stability in the CLP than the previous widely used metrics.

Estimating data divergence in cloud computing storage systems

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Complexity Simplicity Simplexity

“In the midst of order, there is chaos; but in the midst of chaos, there is order”, John Gribbin wrote in his book Deep Simplicity (p.76). In this dialectical spirit, we discuss the generative tension between complexity and simplicity in the theory and practice of management and organization. Complexity theory suggests that the relationship between complex environments and complex organizations advanced by the well-known Ashby’s law, may be reconsidered: only simple organization provides enough space for individual agency to match environmental turbulence in the form of complex organizational responses. We suggest that complex organizing may be paradoxically facilitated by a simple infrastructure, and that the theory of organizations may be viewed as resulting from the interplay between simplicity and complexity.

Managing innovation complexity: About the co-existence of innovation types

The purpose of this study is to contribute to the changing innovation management literature by providing an overview of different innovation types and organizational complexity factors. Aiming at a better understanding of effective innovation management, innovation and complexity are related to the formulation of an innovation strategy and interaction between different innovation types is further explored. The chosen approach in this study is to review the existing literature on different innovation types and organizational complexity factors in order to design a survey which allows for statistical measurement of their interactions and relationships to innovation strategy formulation. The findings demonstrate interaction between individual innovation types. Additionally, organizational complexity factors and different innovation types are significantly related to innovation strategy formulation. In particular, more closed innovation and incremental innovation positively influence the likelihood of innovation strategy formulation. Organizational complexity factors have an overall negative influence on innovation strategy formulation. In order to define best practices for innovation management and to guide managerial decision making, organizations need to be aware of the co-existence of different innovation types and formulate an innovation strategy to more closely align their innovation objectives.

Tax compliance and tax complexity in Portugal: essays on the perception of tax professionals

Tese de Doutoramento em Contabilidade.

Tradução e validação para o português do Medication Regimen Complexity Index

FUNDAMENTO: A complexidade da farmacoterapia consiste de múltiplas características do regime prescrito, incluindo o número de diferentes medicações no esquema, o número de unidades de dosagem por dose, o número total de doses por dia e os cuidados na administração dos medicamentos. O Medication Regimen Complexity Index (MRCI) é um instrumento específico, validado e utilizado para medir a complexidade da farmacoterapia, desenvolvido originalmente em língua inglesa. OBJETIVO: Tradução transcultural e validação desse instrumento para o português do Brasil. MÉTODOS: Foi desenvolvido um estudo transversal envolvendo 95 pacientes com diabete do tipo 2 utilizando múltiplas medicações. O processo de validação teve início pela tradução, retrotradução e pré-teste do instrumento, gerando uma versão adaptada chamada Índice de Complexidade da Farmacoterapia (ICFT). Em seguida foram analisados parâmetros psicométricos, incluindo validade convergente, validade divergente, confiabilidade entre avaliadores e teste-reteste. RESULTADOS: A complexidade da farmacoterapia medida pelo ICFT obteve média de 15,7 pontos (desvio padrão = 8,36). O ICFT mostrou correlação significativa com o número de medicamentos em uso (r = 0,86; p < 0,001) e a idade dos pacientes (r = 0,28; p = 0,005). A confiabilidade entre avaliadores obteve correlação intraclasse igual a 0,99 (p < 0,001) e a confiabilidade teste-reteste obteve correlação de 0,997 (p < 0,001). CONCLUSÃO: Os resultados demonstraram que o ICFT apresenta bom desempenho de validade e confiabilidade, podendo ser utilizado como ferramenta útil na prática clínica e em pesquisas envolvendo análise da complexidade da terapia.

Smoothing singularities of Riemannian metrics while preserving lower curvature bounds

Magdeburg, Univ., Fak. für Mathematik, Diss., 2014

Assessing the performance of macroinvertebrate metrics in the Challhuaco-Ñireco System (Northern Patagonia, Argentina)

ABSTRACT Seven sites were examined in the Challhuaco-Ñireco system, located in the reserve of the Nahuel Huapi National Park, however part of the catchment is urbanized, being San Carlos de Bariloche (150,000 inhabitants) placed in the lower part of the basin. Physico-chemical variables were measured and benthic macroinvertebrates were collected during three consecutive years at seven sites from the headwater to the river outlet. Sites near the source of the river were characterised by Plecoptera, Ephemeroptera, Trichoptera and Diptera, whereas sites close to the river mouth were dominated by Diptera, Oligochaeta and Mollusca. Regarding functional feeding groups, collector-gatherers were dominant at all sites and this pattern was consistent among years. Ordination Analysis (RDA) revealed that species assemblages distribution responded to the climatic and topographic gradient (temperature and elevation), but also were associated with variables related to human impact (conductivity, nitrate and phosphate contents). Species assemblages at headwaters were mostly represented by sensitive insects, whereas tolerant taxa such as Tubificidae, Lumbriculidae, Chironomidae and crustacean Aegla sp. were dominant at urbanised sites. Regarding macroinvertebrate metrics employed, total richness, EPT taxa, Shannon diversity index and Biotic Monitoring Patagonian Stream index resulted fairly consistent and evidenced different levels of disturbances at the stream, meaning that this measures are suitable for evaluation of the status of Patagonian mountain streams.

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.

Contractive metrics for a Boltzmann equation for granular gases: diffusive equilibriaThe Patterson-Sullivan embedding and minimal volume entropy for outer space

We quantify the long-time behavior of a system of (partially) inelastic particles in a stochastic thermostat by means of the contractivity of a suitable metric in the set of probability measures. Existence, uniqueness, boundedness of moments and regularity of a steady state are derived from this basic property. The solutions of the kinetic model are proved to converge exponentially as t→ ∞ to this diffusive equilibrium in this distance metrizing the weak convergence of measures. Then, we prove a uniform bound in time on Sobolev norms of the solution, provided the initial data has a finite norm in the corresponding Sobolev space. These results are then combined, using interpolation inequalities, to obtain exponential convergence to the diffusive equilibrium in the strong L¹-norm, as well as various Sobolev norms.

The complexity of random ordered structures

"Vegeu el resum a l'inici del document del fitxer adjunt."

Metrics on diagram groups and uniform embeddings in a Hilbert space

"Vegeu el resum a l'inici del document del fitxer adjunt".

Contractive probability metrics and asymptotic behavior of dissipative kinetic equations

The present notes are intended to present a detailed review of the existing results in dissipative kinetic theory which make use of the contraction properties of two main families of probability metrics: optimal mass transport and Fourier-based metrics. The first part of the notes is devoted to a self-consistent summary and presentation of the properties of both probability metrics, including new aspects on the relationships between them and other metrics of wide use in probability theory. These results are of independent interest with potential use in other contexts in Partial Differential Equations and Probability Theory. The second part of the notes makes a different presentation of the asymptotic behavior of Inelastic Maxwell Models than the one presented in the literature and it shows a new example of application: particle's bath heating. We show how starting from the contraction properties in probability metrics, one can deduce the existence, uniqueness and asymptotic stability in classical spaces. A global strategy with this aim is set up and applied in two dissipative models.

On the complexity of the Whitehead minimization problem

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem – to decide whether a word is an element of some basis of the free group – and the free factor problem can also be solved in polynomial time.