Challenges in the Application of Stochastic Modal Identification Methods to a Cable-Stayed Bridge

This paper presents an analysis of the data collected in the ambient vibration test of the International Guadiana cable-stayed Bridge, which links Portugal and Spain, based on different output-only identification techniques: peak-picking, frequency domain decomposition, covariance-driven stochastic subspace identification, and data-driven stochastic subspace identification. The purpose of the analysis is to compare the performance of the four techniques and evaluate their efficiency in dealing with specific challenges involved in the modal identification of the tested cable-stayed bridge, namely the existence of closely spaced modes, the perturbation produced by the local vibration of stay-cables, and the variation of modal damping coefficients with wind velocity. The identified natural frequencies and mode shapes are compared with the corresponding modal parameters provided by a previously developed numerical model. Additionally, the variability of some modal damping coefficients is related with the variation of the wind characteristics and associated with a component of aerodynamic damping.     

Recent thinking about the concept of alcohol dependence

This paper reviews past definitions of alcohol dependence as well as that presently adopted in the 4th edition of the Diagnostic and Statistical Manual of the American Psychiatric Association. The role of alcohol consumption in diagnostic criteria and the measurement of various dimensions of drinking (frequency, usual quantity per occasion, overall volume) are also discussed. Reliable criteria for identifying both alcohol abuse and dependence are available. Methodology for assessment of different dimensions of drinking behavior also exists. Epidemiologists examining the role of alcohol in health problems should consider the diagnostic category and the dimensions of drinking behavior that are important to their study. Measurements should be adopted in accordance with this assessment.     

Effect of immunosuppression and splenectomy in transplantation sarcomas in mice

After spontaneous regression of transplanted tumours, marked reduction in number of tumours was found when challenged with isogenic tumour cells. The ALS abrogates this effect. Tumour removal by surgical excision of limb and subsequent time scheduled challenge by tumour cells maximally suppress on the 10th day and continues up to the 42nd day the tumorogenic effect. Splenectomy has no effect if done before a day or 3 days after challenge but marked decrease in tumour development was seen when challenged on the 8th day after splenectomy. Amputation and splenectomy together potentiates tumour formation. Only in tumour extrication, does resistance develop up to the 42nd day from surgery. Challenging at a different site in mice with tumours, resulted in prolongation of the intervals of tumour formation. Challenge after surgical removal of tumour after a time lapse, results in marked reduction in number and size of tumours. Surgical tumour extrication after splenectomy and subsequent challenge on 11th day inhibited tumour formation. Whereas splenectomized tumour bearing mice when challenged at a heterosite did not develop resistance.     

Graph rigidity, cyclic belief propagation, and point pattern matching

A recent paper \cite{CaeCaeSchBar06} proposed a provably optimal, polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be \emph{globally rigid}, implying that exact inference provides the \emph{same} matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph which is also globally rigid but has an advantage over the graph proposed in \cite{CaeCaeSchBar06}: its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal and thus standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that of \cite{CaeCaeSchBar06} when there is noise in the point patterns.     

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper, we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests.     

Histology, histochemistry and stereology of the adipose fin of Prochilodus lineatus

The adipose fin is small, nonpared, and usually located medially between the dorsal and caudal fin. Its taxonomic occurrence is very restrict; thus, it represents an important trace for taxon distinction. As it does not play a known vital physiological roll and it is easily removed, it is commonly used in marking and recapture studies. The present study characterizes the adipose fin of Prochilodus lineatus, as it is poorly explored by the literature. The adipose fin consists basically of a loose connective core, covered by a stratified epithelium supported by collagen fibers. At the epithelium, pigmented cells and alarm substance cells are found. Despite the name, adipocytes or lipid droplets are not observed on the structure of the fin.     

GIS母线中金属异物运动的探讨

介绍GIS母线内部存在金属异物时的影响，对金属异物在不同情况下的运动规律进行了探讨和研究。     

Burial grounds’ impact on groundwater and public health: an overview

The most common practice for disposal of dead bodies is inhumation in soil, which favours interactions with the surrounding environment and returns nutrients to the life cycle. However, when the burial ground is located where hydrogeological, geological and climatic conditions are not favourable to the process, contamination of soils and groundwater may occur, and decomposition may be inhibited, leading to social, economic and political problems. The most critical parameters when assessing the pollution potential of a burial ground are inhumation depth, geological formation, depth of the water table, density of inhumations, soil type and climate. Considering that, this paper presents an overview of the potential threat that cemeteries can pose, analysing and discussing the influence of the main variables causing environmental impacts and public health risks.