The nucleus of Comet 67P/Churyumov-Gerasimenko. A new shape model and thermophysical analysis

Context. Comet 67P/Churyumov-Gerasimenko is the target of the European Space Agency Rosetta spacecraft rendez-vous mission. Detailed physical characteristation of the comet before arrival is important for mission planning as well as providing a test bed for ground-based observing and data-analysis methods. Aims: To conduct a long-term observational programme to characterize the physical properties of the nucleus of the comet, via ground-based optical photometry, and to combine our new data with all available nucleus data from the literature. Methods: We applied aperture photometry techniques on our imaging data and combined the extracted rotational lightcurves with data from the literature. Optical lightcurve inversion techniques were applied to constrain the spin state of the nucleus and its broad shape. We performed a detailed surface thermal analysis with the shape model and optical photometry by incorporating both into the new Advanced Thermophysical Model (ATPM), along with all available Spitzer 8-24 μm thermal-IR flux measurements from the literature. Results: A convex triangular-facet shape model was determined with axial ratios b/a = 1.239 and c/a = 0.819. These values can vary by as much as 7% in each axis and still result in a statistically significant fit to the observational data. Our best spin state solution has Psid = 12.76137 ± 0.00006 h, and a rotational pole orientated at Ecliptic coordinates λ = 78°(±10°), β = + 58°(±10°). The nucleus phase darkening behaviour was measured and best characterized using the IAU HG system. Best fit parameters are: G = 0.11 ± 0.12 and HR(1,1,0) = 15.31 ± 0.07. Our shape model combined with the ATPM can satisfactorily reconcile all optical and thermal-IR data, with the fit to the Spitzer 24 μm data taken in February 2004 being exceptionally good. We derive a range of mutually-consistent physical parameters for each thermal-IR data set, including effective radius, geometric albedo, surface thermal inertia and roughness fraction. Conclusions: The overall nucleus dimensions are well constrained and strongly imply a broad nucleus shape more akin to comet 9P/Tempel 1, rather than the highly elongated or "bi-lobed" nuclei seen for comets 103P/Hartley 2 or 8P/Tuttle. The derived low thermal inertia of

Calcification and ossification of the convexity of the falx cerebri and related subdural space in human cadavers

OBJECTIVE: The present work was planned to report the incidence of calcification and ossification of an isolated cranial dural fold. The form, degree of severity and range of extension of such changes will be described. Involvement of the neighboring brain tissue and blood vessels, whether meningeal or cerebral, will also be determined. The results of this study might highlight the occasional incidence of intracranial calcification and ossification in images of the head and their interpretation, by radiologists and neurologists, to be of dural or vascular origin.

METHODS: Two human formalin-fixed cadavers, one middle-aged female another older male, were investigated at the Anatomy Laboratory, College of Medicine, King Faisal University, Dammam, Kingdom of Saudi Arabia during the period from 2000 to 2003. In each cadaver, the skullcap was removed and the convexity of the cranial dura mater, as well as the individual dural folds, were carefully examined for any calcification or ossification. The meningeal and cerebral blood vessels together with the underlying brain were grossly inspected for such structural changes. Calcified or ossified tissues, when identified, were subjected to histological examination to confirm their construction.

RESULTS: The female cadaver showed a calcified parietal emissary vein piercing the skullcap and projecting into the scalp. The latter looked paler and deficient in hair on its right side. The base of the stump was surrounded by a granular patch of calcification. The upper convex border of the falx cerebri was hardened and it presented granules, plaques and a cauliflower mass, which all proved to be osseous in structure. The meningeal and right cerebral vessels were mottled with calcium granules. The underlying temporal and parietal lobes of the right cerebral hemisphere were degenerated. The male cadaver also revealed a calcified upper border of the falx cerebri and superior sagittal sinus. Osseous granules and plaques, similar to those of the first specimen, were also identified but without gross changes in the underlying brain.

CONCLUSION: Calcification or ossification of an isolated site of the cranial dura mater and the intracranial blood vessels might occur. These changes should be kept in mind while interpreting images of the skull and brain. Clinical assessment and laboratory investigations are required to determine whether these changes are idiopathic, traumatic, or as a manifestation of a generalized disease such as hyperparathyroidism, vitamin D-intoxication, or chronic renal failure.

Updating Credal Networks is Approximable in Polynomial Time

Credal networks relax the precise probability requirement of Bayesian networks, enabling a richer representation of uncertainty in the form of closed convex sets of probability measures. The increase in expressiveness comes at the expense of higher computational costs. In this paper, we present a new variable elimination algorithm for exactly computing posterior inferences in extensively specified credal networks, which is empirically shown to outperform a state-of-the-art algorithm. The algorithm is then turned into a provably good approximation scheme, that is, a procedure that for any input is guaranteed to return a solution not worse than the optimum by a given factor. Remarkably, we show that when the networks have bounded treewidth and bounded number of states per variable the approximation algorithm runs in time polynomial in the input size and in the inverse of the error factor, thus being the first known fully polynomial-time approximation scheme for inference in credal networks.

A self-learning teaching-learning based optimization for dynamic economic/environmental dispatch considering multiple plug-in electric vehicle loads

Economic and environmental load dispatch aims to determine the amount of electricity generated from power plants to meet load demand while minimizing fossil fuel costs and air pollution emissions subject to operational and licensing requirements. These two scheduling problems are commonly formulated with non-smooth cost functions respectively considering various effects and constraints, such as the valve point effect, power balance and ramp rate limits. The expected increase in plug-in electric vehicles is likely to see a significant impact on the power system due to high charging power consumption and significant uncertainty in charging times. In this paper, multiple electric vehicle charging profiles are comparatively integrated into a 24-hour load demand in an economic and environment dispatch model. Self-learning teaching-learning based optimization (TLBO) is employed to solve the non-convex non-linear dispatch problems. Numerical results on well-known benchmark functions, as well as test systems with different scales of generation units show the significance of the new scheduling method.

Differential evolution combined with clonal selection for dynamic economic dispatch

Dynamic economic load dispatch (DELD) is one of the most important steps in power system operation. Various optimisation algorithms for solving the problem have been developed; however, due to the non-convex characteristics and large dimensionality of the problem, it is necessary to explore new methods to further improve the dispatch results and minimise the costs. This article proposes a hybrid differential evolution (DE) algorithm, namely clonal selection-based differential evolution (CSDE), to solve the problem. CSDE is an artificial intelligence technique that can be applied to complex optimisation problems which are for example nonlinear, large scale, non-convex and discontinuous. This hybrid algorithm combines the clonal selection algorithm (CSA) as the local search technique to update the best individual in the population, which enhances the diversity of the solutions and prevents premature convergence in DE. Furthermore, we investigate four mutation operations which are used in CSA as the hyper-mutation operations. Finally, an efficient solution repair method is designed for DELD to satisfy the complicated equality and inequality constraints of the power system to guarantee the feasibility of the solutions. Two benchmark power systems are used to evaluate the performance of the proposed method. The experimental results show that the proposed CSDE/best/1 approach significantly outperforms nine other variants of CSDE and DE, as well as most other published methods, in terms of the quality of the solution and the convergence characteristics.

Critical Nodes In Directed Networks

Critical nodes—or “middlemen”—have an essential place in both social and economic networks when considering the flow of information and trade. This paper extends the concept of critical nodes to directed networks and in doing so identify strong and weak middlemen.
Node contestability is introduced as a form of competition in networks; a duality between uncontested intermediaries and middlemen is established. The brokerage power of middlemen is formally expressed and a general algorithm is constructed to measure the brokerage power of each node from the networks adjacency matrix. Augmentations of the brokerage power measure are discussed to encapsulate relevant centrality measures. Furthermore, we extend these notions and provide measures of the competitiveness of a network.
We use these concepts to identify and measure middlemen in two empirical socio-economic networks, the elite marriage network of Renaissance Florence and Krackhardt’s advice net- work.

A hybrid harmony search with arithmetic crossover operation for economic dispatch

Economic dispatch (ED) problems often exhibit non-linear, non-convex characteristics due to the valve point effects. Further, various constraints and factors, such as prohibited operation zones, ramp rate limits and security constraints imposed by the generating units, and power loss in transmission make it even more challenging to obtain the global optimum using conventional mathematical methods. Meta-heuristic approaches are capable of solving non-linear, non-continuous and non-convex problems effectively as they impose no requirements on the optimization problems. However, most methods reported so far mainly focus on a specific type of ED problems, such as static or dynamic ED problems. This paper proposes a hybrid harmony search with arithmetic crossover operation, namely ACHS, for solving five different types of ED problems, including static ED with valve point effects, ED with prohibited operating zones, ED considering multiple fuel cells, combined heat and power ED, and dynamic ED. In this proposed ACHS, the global best information and arithmetic crossover are used to update the newly generated solution and speed up the convergence, which contributes to the algorithm exploitation capability. To balance the exploitation and exploration capabilities, the opposition based learning (OBL) strategy is employed to enhance the diversity of solutions. Further, four commonly used crossover operators are also investigated, and the arithmetic crossover shows its efficiency than the others when they are incorporated into HS. To make a comprehensive study on its scalability, ACHS is first tested on a group of benchmark functions with a 100 dimensions and compared with several state-of-the-art methods. Then it is used to solve seven different ED cases and compared with the results reported in literatures. All the results confirm the superiority of the ACHS for different optimization problems.

Rent: apartment blocks and their uses

In 1974, pursuing his interest in the infra-ordinary – ‘the banal, the quotidian, the obvious, the common, the ordinary, the back-ground noise, the habitual’ – Georges Perec wrote about an idea for a novel:
‘I imagine a Parisian apartment building whose façade has been removed … so that all the rooms in the front, from the ground floor up to the attics, are instantly and simultaneously visible’.
In Life A User’s Manual (1978) the consummation of this precis, patterns of existence are measured within architectural space with an archaeological sensibility that sifts through narrative and décor, structure and history, services and emotion, the personal and the system, ascribing commensurate value to each.
Apartment comes from the Italian appartare meaning ‘to separate’. The space of the boundary between activities is reduced to a series of intimately thin lines: the depth of a floor, a party wall, a window, the convex peep-hole in a door, or the façade that Perec seeks to render invisible. The apartness of the apartment is accelerated when aligned with short-term tenancies. Here Perec’s interweaving of personal histories over time using the structure of the block, gives way to convivialities of detachment: inhabitants are temporary, their personalities anonymous, their activities unknown or overlooked.
Borrowing methods from Perec, to move somewhere between conjecture, analysis and other documentation and tracing relationships between form, structure, materiality, technology, organisation, tenure and narrative use, this paper interrogates the late twentieth-century speculative apartment block in Britain and Ireland arguing that its speculative and commodified purpose allows a series of lives that are often less than ordinary to inhabit its spaces.
Henri Lefebvre described the emergence of an ‘abstract space’ under capitalism in terms which can be applied to the apartment building: the division of space into freely alienable privatised parcels which can be exchanged. Vertical distributions of class and other new, contiguous social and spatial relationships are couched within a paradox: the building which allows such proximities is also a conductor of division. Apartment comes from the Italian appartare meaning ‘to separate’. The space of the boundary between activities is reduced to a series of intimately thin lines: the depth of a floor, a party wall, a window, the convex peep-hole in a door, or the façade that Perec seeks to render invisible. The apartness of the apartment is accelerated when aligned with short-term tenancies. Here Perec’s interweaving of personal histories over time using the structure of the block, gives way to convivialities of detachment: inhabitants are temporary, their personalities anonymous, their activities unknown or overlooked.

The basic principles of uncertain information fusion. An organised review of merging rules in different representation frameworks.

We propose and advocate basic principles for the fusion of incomplete or uncertain information items, that should apply regardless of the formalism adopted for representing pieces of information coming from several sources. This formalism can be based on sets, logic, partial orders, possibility theory, belief functions or imprecise probabilities. We propose a general notion of information item representing incomplete or uncertain information about the values of an entity of interest. It is supposed to rank such values in terms of relative plausibility, and explicitly point out impossible values. Basic issues affecting the results of the fusion process, such as relative information content and consistency of information items, as well as their mutual consistency, are discussed. For each representation setting, we present fusion rules that obey our principles, and compare them to postulates specific to the representation proposed in the past. In the crudest (Boolean) representation setting (using a set of possible values), we show that the understanding of the set in terms of most plausible values, or in terms of non-impossible ones matters for choosing a relevant fusion rule. Especially, in the latter case our principles justify the method of maximal consistent subsets, while the former is related to the fusion of logical bases. Then we consider several formal settings for incomplete or uncertain information items, where our postulates are instantiated: plausibility orderings, qualitative and quantitative possibility distributions, belief functions and convex sets of probabilities. The aim of this paper is to provide a unified picture of fusion rules across various uncertainty representation settings.

Existência de minimizantes relaxados e fenómeno de Lavrentiev

Neste trabalho prova-se a existência de minimizantes relaxados em problemas de controlo óptimo não convexos usando técnicas de compactificação. Faz-se a extensão do exemplo de Manià a dimensão dois, obtendo-se uma classe de problemas variacionais em 2D que apresentam Fenómeno de Lavrentiev. Prova-se que o fenómeno persiste a certas perturbações, obtendo- -se assim uma classe de funcionais cujos Lagrangianos são coercivos e convexos em relação ao gradiente. Adicionalmente, apresentam-se exemplos de problemas do cálculo das variações com diferentes condições de fronteira, e em diferentes tipos de domínios (incluindo domínios com fronteira fractal), que exibem Fenómeno de Lavrentiev.

Limited range coverage problems

Tal como o título indica, esta tese estuda problemas de cobertura com alcance limitado. Dado um conjunto de antenas (ou qualquer outro dispositivo sem fios capaz de receber ou transmitir sinais), o objectivo deste trabalho é calcular o alcance mínimo das antenas de modo a que estas cubram completamente um caminho entre dois pontos numa região. Um caminho que apresente estas características é um itinerário seguro. A definição de cobertura é variável e depende da aplicação a que se destina. No caso de situações críticas como o controlo de fogos ou cenários militares, a definição de cobertura recorre à utilização de mais do que uma antena para aumentar a eficácia deste tipo de vigilância. No entanto, o alcance das antenas deverá ser minimizado de modo a manter a vigilância activa o maior tempo possível. Consequentemente, esta tese está centrada na resolução deste problema de optimização e na obtenção de uma solução particular para cada caso. Embora este problema de optimização tenha sido investigado como um problema de cobertura, é possível estabelecer um paralelismo entre problemas de cobertura e problemas de iluminação e vigilância, que são habitualmente designados como problemas da Galeria de Arte. Para converter um problema de cobertura num de iluminação basta considerar um conjunto de luzes em vez de um conjunto de antenas e submetê-lo a restrições idênticas. O principal tema do conjunto de problemas da Galeria de Arte abordado nesta tese é a 1-boa iluminação. Diz-se que um objecto está 1-bem iluminado por um conjunto de luzes se o invólucro convexo destas contém o objecto, tornando assim este conceito num tipo de iluminação de qualidade. O objectivo desta parte do trabalho é então minimizar o alcance das luzes de modo a manter uma iluminação de qualidade. São também apresentadas duas variantes da 1-boa iluminação: a iluminação ortogonal e a boa !-iluminação. Esta última tem aplicações em problemas de profundidade e visualização de dados, temas que são frequentemente abordados em estatística. A resolução destes problemas usando o diagrama de Voronoi Envolvente (uma variante do diagrama de Voronoi adaptada a problemas de boa iluminação) é também proposta nesta tese.

Problems of minimal aerodynamic resistance

Nesta tese estamos preocupados com o problema da resistência mínima primeiro dirigida por I. Newton em seu Principia (1687): encontrar o corpo de resistência mínima que se desloca através de um médio. As partículas do médio não interagem entre si, bem como a interação das partículas com o corpo é perfeitamente elástica. Diferentes abordagens desse modelo foram feitas por vários matemáticos nos últimos 20 anos. Aqui damos uma visão geral sobre estes resultados que representa interesse independente, uma vez que os autores diferentes usam notações diferentes. Apresentamos uma solução do problema de minimização na classe de corpos de revolução geralmente não convexos e simplesmente conexos. Acontece que nessa classe existem corpos com resistência menor do que o mínimo da resistência na classe de corpos convexos de revolução. Encontramos o infimum da resistência nesta classe e construimos uma sequência regular de corpos que aproxima este infimum. Também apresentamos um corpo de resistência nula. Até agora ninguém sabia se tais corpos existem ou não, evidentemente o nosso corpo não pertence a nenhuma classe anteriormente analisado. Este corpo é não convexo e não simplesmente conexo; a forma topológica dele é um toro, parece um UFO extraterrestre. Apresentamos aqui várias famílias de tais corpos e estudamos as suas propriedades. Também apresentamos um corpo que é natural de chamar um corpo "invisíveis em uma direção", uma vez que a trajectória de cada partícula com a certa direcção coincide com a linha recta fora do invólucro convexo do corpo. ABSTRACT: In this thesis we are concerned with the problem of minimal resistance first addressed by I. Newton in his Principia (1687): find the body of minimal resistance moving through a medium. The medium particles do not mutually interact, and the interaction of particles with the body is perfectly elastic. Different approaches to that model have been tried by several mathematicians during the last 20 years. Here we give an overview of these results that represents interest in itself since all authors use different notations. We present a solution of the minimization problem in the class of generally non convex, simply connected bodies of revolution. It happens that in this class there are bodies with smaller resistance than the minimum in the class of convex bodies of revolution. We find the infimum of the resistance in this class, and construct a sequence of bodies which approximates this infimum. Also we present a body of zero resistance. Since earlier it was unknown if such bodies exists or not, evidently our body does not belong to any class previously examined. The zero resistance body found by us is non-convex and non-simply connected; topologically it is a torus, and it looks like an extraterrestrial UFO. We present here several families of such bodies and study their properties. We also present a body which is natural to call a body "invisible in one direction", since the trajectory of each particle with the given direction, outside the convex hull of the body, coincides with a straight line.

Cuidar na "Entrada na reforma": uma intervenção conducente à promoção da saúde de indivíduos e de famílias

ENQUADRAMENTO: Ao longo do ciclo vital, os indivíduos e as suas famílias estão em constante desenvolvimento. Os acontecimentos de vida transicionais, pelos fenómenos de mudança e adaptação que envolvem, são em grande parte responsáveis por esse processo e dada a vulnerabilidade em saúde a que os poderá expor; constituem momentos cruciais de intervenção para a Enfermagem (Meleis, 2010). A “entrada na reforma” constitui um desses acontecimentos que, quando não devidamente preparado, poderá pôr em causa o processo de envelhecimento activo (Fonseca, 2004a; Veríssimo, 2008). Estudar os efeitos que esta transição exerce nas vivências dos indivíduos e das suas famílias, ajudará a compreender a forma como esta poderá comprometer o envelhecimento e, simultaneamente, poderá trazer um conhecimento mais profícuo para aquele que deverá ser o cuidar de indivíduos e famílias num período da “entrada na reforma”. OBJECTIVO: Conhecer as vivências percepcionadas pelos indivíduos e suas famílias durante o processo de transição originado pela “entrada na reforma”, de forma a apresentar estratégias e linhas orientadoras de intervenção de Enfermagem, conducentes à promoção do seu estado de saúde. MÉTODO: O estudo foi desenvolvido em duas fases. Uma primeira, de carácter quantitativo, na qual foi aplicado um questionário a 432 indivíduos, que se encontravam aposentados há menos de cinco anos. A selecção da amostra foi conseguida pelo método “bola de neve” e os dados obtidos foram analisados com recurso ao programa SPSS17 e à técnica de análise de conteúdo de Bardin. Uma segunda fase, de carácter qualitativo, na qual foram entrevistadas 14 famílias de indivíduos que tinham percepcionado alterações e/ou dificuldades, na primeira fase deste estudo. A análise da informação sustentou-se num referencial teórico de interaccionismo simbólico e numa metodologia de investigação narrativa, contando com o auxílio do Nvivo8. RESULTADOS E DISCUSSÃO: As características sócio-demográficas, os motivos da aposentação e as expectativas que detinham relativamente à “entrada na reforma”, interferiram na forma como os indivíduos viveram a transição. Para os protagonistas, as principais alterações e/ou dificuldades percepcionadas na referida vivência foram a adaptação à alteração das rotinas diárias (26,5%), a dificuldade em ocupar o tempo (14,7%) e a diminuição do poder económico (14,0%) e as famílias constituíram a principal fonte de apoio (71,5%), para fazer face às mesmas. As famílias percepcionaram uma idêntica mudança e traduziram-na por uma dualidade de significados que se identificou com percepções de ganho e de perda, para as suas vidas. Os significados reaprender a “estar”, a “sentir” e a “ser”, traduziram o processo de adaptação a que estiveram sujeitos. IMPLICAÇÕES PARA A PRÁTICA DA ENFERMAGEM: Cuidar no período da “entrada na reforma” deverá obedecer a um modelo de intervenção muito próprio que se harmonize, não apenas com a singularidade dos indivíduos e famílias que protagonizam este acontecimento de vida, mas, também, e de forma muito particular, com a especificidade das mudanças que essa vivência transicional lhes possa vir a suscitar.

Majorantes para a ordem de subgrafos induzidos k-regulares

Muitos dos problemas de otimização em grafos reduzem-se à determinação de um subconjunto de vértices de cardinalidade máxima que induza um subgrafo k-regular. Uma vez que a determinação da ordem de um subgrafo induzido k-regular de maior ordem é, em geral, um problema NP-difícil, são deduzidos novos majorantes, a determinar em tempo polinomial, que em muitos casos constituam boas aproximações das respetivas soluções ótimas. Introduzem-se majorantes espetrais usando uma abordagem baseada em técnicas de programação convexa e estabelecem-se condições necessárias e suficientes para que sejam atingidos. Adicionalmente, introduzem-se majorantes baseados no espetro das matrizes de adjacência, laplaciana e laplaciana sem sinal. É ainda apresentado um algoritmo não polinomial para a determinação de umsubconjunto de vértices de umgrafo que induz umsubgrafo k-regular de ordem máxima para uma classe particular de grafos. Finalmente, faz-se um estudo computacional comparativo com vários majorantes e apresentam-se algumas conclusões.

Polyhedral study of mixed integer sets arising from inventory problems

“Branch-and-cut” algorithm is one of the most efficient exact approaches to solve mixed integer programs. This algorithm combines the advantages of a pure branch-and-bound approach and cutting planes scheme. Branch-and-cut algorithm computes the linear programming relaxation of the problem at each node of the search tree which is improved by the use of cuts, i.e. by the inclusion of valid inequalities. It should be taken into account that selection of strongest cuts is crucial for their effective use in branch-and-cut algorithm. In this thesis, we focus on the derivation and use of cutting planes to solve general mixed integer problems, and in particular inventory problems combined with other problems such as distribution, supplier selection, vehicle routing, etc. In order to achieve this goal, we first consider substructures (relaxations) of such problems which are obtained by the coherent loss of information. The polyhedral structure of those simpler mixed integer sets is studied to derive strong valid inequalities. Finally those strong inequalities are included in the cutting plane algorithms to solve the general mixed integer problems. We study three mixed integer sets in this dissertation. The first two mixed integer sets arise as a subproblem of the lot-sizing with supplier selection, the network design and the vendor-managed inventory routing problems. These sets are variants of the well-known single node fixed-charge network set where a binary or integer variable is associated with the node. The third set occurs as a subproblem of mixed integer sets where incompatibility between binary variables is considered. We generate families of valid inequalities for those sets, identify classes of facet-defining inequalities, and discuss the separation problems associated with the inequalities. Then cutting plane frameworks are implemented to solve some mixed integer programs. Preliminary computational experiments are presented in this direction.