近2千万年以来东亚季风演化的南海沉积矿物学记录

本论文通过对南海南部ODP1143站和北部ODP1146站两个长柱状沉积物的陆源矿物组成和堆积速率、生物硅含量和堆积速率、粘土矿物组成、结晶学特征、微形貌和化学成分、陆源物质粒度和元素地球化学的综合研究，分析了1143站和1146站的陆源物质来源的演变，分别建立了南海南部和北部的季风演化代用指标，并与黄土、深海风尘沉积、海洋微体古生物记录对比，重建了东亚季风在近20 Ma以来的长期演化，并探讨了青藏高原隆升在季风长期演化中的驱动作用。 地质背景和元素地球化学分析表明ODP1143站的陆源物质主要来自于湄公河的输入。但陆源物质堆积速率、中值粒径、粘土矿物组合、蒙脱石结晶度指数和生物硅含量和堆积速率在5.2 Ma前后的变化表明ODP1143站的湄公河物源在10–5.2 Ma可能受到了越南区域性地壳隆升和玄武岩喷发的影响。而自~5.2 Ma以来，到达ODP1143站的沉积物受湄公河流域内部物源通量所控制。 ODP1146站的陆源物质为多物源、多传输方式供应，并且近20 Ma以来各个物源/传输方式的强度发生了改变。粒度端员组分模拟揭示出，近20 Ma以来风尘平均贡献了20%物质到1146站，河流输入贡献80%。河流输入中，75%来自珠江和台湾，25%来自吕宋岛。1146站的沉积环境、粘土矿物、地球化学分析表明河流输入的石英、长石来自珠江、台湾；蒙脱石主要来自于吕宋岛，高岭石主要来自于珠江，伊利石和绿泥石来自于珠江、台湾、长江。 ODP1146站17–15 Ma间异常高的陆源物质(石英、长石、蒙脱石、高岭石)、生物硅和碳酸盐的堆积速率暗示了在17–15 Ma南海周围地区发生了强烈的构造活动，这可能与南海扩张停止有关。而ODP1146站稀土元素地球化学、粘土矿物结晶学特征在3 Ma以来的明显变化显示近3 Ma以来台湾物质的输入强度显著加强，这可能与3 Ma以来台湾造山活动加强有关。 ODP1143站粘土矿物/长石、高岭石/绿泥石比值和生物硅含量和堆积速率、陆源物质堆积速率的指标组合被用来建立了一个简单的东亚夏季风演化模型。结果显示8.5–7.6 Ma和 7.1–6.2 Ma分别为两个较强的夏季风阶段，在6.2–3.5 Ma为一相对稳定的阶段，然后在3.5–2.5 Ma不断加强，随后从2.5 Ma以来又不断减弱，直到1.0 Ma夏季风强度又再次加强，并且变化幅度和频率加大。 ODP1146站风尘含量、风尘堆积速率、(伊利石+绿泥石)/蒙脱石、(石英+长石)%、陆源物质的平均粒径被用来作为南海北部季风演化的代用指标。研究表明，近20 Ma以来东亚冬季风强度、亚洲内陆干旱程度和冬季风相对夏季风强度在12−9 Ma、8−4 Ma有所加强，在3 Ma以来显著加强。相比而言，夏季风强度在15−3 Ma间比较稳定，在3 Ma可能与冬季风同步加强。 ODP1143站、1146站、1148站的线性沉积速率，以及1143、1146站的总陆源物质、石英、长石和粘土矿物的物质堆积速率在3.5–2.5 Ma的几乎同时增加，代表着对3.5 Ma以来全球气候恶化和东亚夏季风加强的侵蚀响应。青藏高原的阶段性隆升可能促进了东亚季风在8 Ma和3 Ma左右的加强，但两极冰川扩展和全球变冷也是一个可能因素，也可能季风演化是二者共同作用的结果。我们的研究结果倾向于支持青藏高原阶段性隆升在东亚季风长期演化中的驱动作用。

PCBs and its coupling with eco-environments in Southern Yellow Sea surface sediments

In this paper, the spatial distribution and source of the PCBs in surface sediments of the Southern Yellow Sea (SYS) and influencing factors, such as the sediment characteristics (components, relative proportions and total organic carbon contents), and hydrodynamic conditions were analyzed. PCB concentrations in the surface sediments ranged from 518-5848 pg/g, with average values of 1715 pg/g decreasing sharply compared to last year. In the study area, the PCB pollution level in the middle area was the highest, followed by that of the east coast and the west coast, respectively. Although the PCB level in the coastal areas was lower than that in the middle areas, it was proven in our study that the Yellow Sea obtained PCBs by virtue of river inputs. There was a positive and pertinent correlation between the clay proportion and PCB concentrations, and the increase of the PCB concentrations was directly proportional to the increase of TOC contents, with r = 0.61, but it was contrary to the sediment grain size. Consequently, the factors controlling PCB distribution had direct or indirect relationships with sediment grain size; moreover, the hydrodynamic conditions determined the sediment components and grain size. In conclusion, hydrodynamic conditions of the Yellow Sea were the most important influencing factors effecting the distribution of PCBs in the surface sediments of the SYS. (C) 2007 Elsevier Ltd. All rights reserved.

基于加速度传感器的机器人最优学习控制

为工业机器人提出了一种最优学习控制法。这种控制法用加速度误差校正驱动器运动。并提出了一种基于几何级数的极限条件估计学习控制过程收敛条件的理论方法。所提出学习控制法的有效性通过PUMA562机器人的计算机仿真结果得到了证实。

水库汞生物地球化学循环研究进展

对近年来国内外有关水库汞生物地球化学循环的研究现状进行了综述, 主要从基质释汞行为、汞释放对水体的影响、汞在水库水生食物链中的迁移富集和水库对河流汞输送的影响等四个方面进行了探讨, 并指出该领域研究工作的薄弱环节及发展方向。

针式微萃取结合GC-IRMS测定水溶液中甲酸、乙酸的稳定碳同位素组成

甲酸和乙酸稳定碳同位素组成（δ^13C）的分析对环境、食品、制药和自然产品等的研究具有重要的应用价值。但目前尚缺乏有效的测定方法。本研究利用最近出现的针式固相微萃取技术（NeedlEX），以吹扫．捕集方式对水溶液中的有机酸进行了萃取，然后利用气相色谱．同位素比值质谱联用仪（GC—IRMS）对所萃取的有机酸分子进行了占δ^13C的测定。结果显示，质谱计的信号强度与水溶液中有机酸的浓度存在显著的线性相关关系（R^2〉0．99，P〈0．05），表明Needl EX对水溶液中有机酸具有稳定的萃取能力。在甲酸与乙酸含量分别不低于300μg／mL与200μg／mL的水溶液中，1000mL的吹扫体积可以使两者δ^13C多次分析结果的相对误差分别保持在3％和1％左右，且整个实验流程没有造成可检测的碳同位素分馏作用。低于这两个浓度界线，则分析误差随浓度的降低迅速增加。本研究虽然是针对水溶液中有机酸δ^13C的测定，其萃取方法对其他水溶性挥发和半挥发有机物δ^13C的分析也同样具有应用价值.

从赌博游戏中的损失厌恶行为看情感预测与体验在决策中的作用

In Kermer, Driver-Linn, Wilson and Gilbert’s (2006) study on affective forecast, they found that people have a tendency to overestimate affective reactions in gains and losses, and people expect losses to have greater hedonic impact than gains of equal magnitude. Because of thus affective forecasting error, people prefer to irrationally avoid losses. Loss aversion is then seen as both a wealth-maximizing error and an affect-maximizing error. The present study examined the relationships among affective forecast, affective experience and loss aversion, and tested Kermer et al.’s (2006) conclusion that people’s loss aversion is an affective forecasting error. In experiment 1, we examined the relationship between affective forecast and loss aversion. Kermer et al.’s (2006) hypothesized that when people expect losses to have greater hedonic impact than gains, they will accept the gambling task, and when people expect gains to have greater hedonic impact than losses, they will refuse the gambling task. We found that (1) individuals with lower loss aversion had a greater tendency to accept a gambling task than those with higher loss aversion; (2) individuals with lower loss aversion expected losses and gains to have smaller affective impacts than those with higher loss aversion. Thus, people never exactly calculated their forecasting affective. In experiment 2, we examined the relationship between affective forecast and affective experience. Consistent with Kermer et al.’s (2006) finding, we found that our participants tended to overestimate affective reactions in gains as well as losses. More interestingly, Kermer et al.’s (2006) found that participants’ predictions for a loss were significantly more distant from experienced emotions than were their predictions for a win, we, however, found the opposite —participants’ predictions for a win were significantly more distant from the experienced emotions than were their predictions for a loss. These experiments further validated the relations between affection and decision making, and contributed to our understanding on the affective reactions to future events. Our study imply that it was not the exact calculation of affective forecast on decision outcomes, but rather the magnitude of affection on outcomes, that influenced people’s affective decision making. It indicated that those with lower magnitude of affection would less like to avoid losses, and thus more like to accept a gambling task.

RamboNodes for the Metropolitan Ad Hoc Network

We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away from failures or toward regions of high demand. The PersistentNode algorithm provides this service robustly, but with limited safety guarantees. We use the RAMBO framework to transform PersistentNode into RamboNode, an algorithm that guarantees atomic consistency in exchange for increased cost and decreased liveness. In addition, a half-life analysis of RamboNode shows that it is robust against continuous low-rate failures. Finally, we provide experimental simulations for the algorithm on 2000 nodes, demonstrating how it services requests and examining how it responds to failures.

Um modelo computacional para estudar a influência dos anticorpos na manutenção da memória imunológica.

Este artigo apresenta um modelo computacional para estudar a evolução temporal do repertório clonal, incluindo populações de anticorpos. O modelo proposto também foi utilizado para estudar o comportamento da memória imunológica quando populações antigênicas são inoculadas aleatoriamente para simular um processo de mutação viral. Os resultados das simulações realizadas sugerem que um decréscimo na produção de anticorpos favorece a manutenção global da memória imunológica. O modelo aqui exposto permite representar a geração, manutenção e regulação da memória imunológica de uma forma mais completa, através de uma rede de memória, que combina as características da teoria de seleção clonal de F. M. Burnet e a hipótese de rede de N. K. Jerne, considerando somente interações idiotípicas?anti-idiotípicas.

Atelier ORIXAS: Projeto Tripartite África/Brasil/França: luta contra a desertificação: promoção da segurança alimentar e redução da pobreza.

No âmbito do Programa de Cooperação Científica Tripartite entre a Agence Inter-établissements de Recherche pourle Développement (AIRD), Agence Panafricaine de la Grande Muraille Verte (APGMV) e o Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), o projeto ORIXAS "Observatórios Regionais Integrados de Regiões Árida, Semiáridas e Sub-úmidas secas" concebido em uma visão transversal, foca principalmente em metodologias e ferramentas para apoiar dispositivos de monitoramento ambiental para ser aplicado nos países inseridos na iniciativa africana Grande Muralha Verde - GMV (Burkina-Faso, Djibouti, Érythrée, Éthiopie, Mali, Mauritanie, Niger, Nigeria, Sénégal, Soudan, Tchad) e tem como objetivo desenvolver abordagens metodológicas e produtos compartilhados para melhorar a avaliação e monitoramento da desertificação e os impactos diretos ou indiretos de iniciativas para lutar contra o desmatamento e desertificação no âmbito da GMV. Esta publicação contempla aspectos metodológicos utilizados pelo projeto "ORIXAS" durante a primeira oficina de trabalho coletivo África-Brasil-França - Atelier (MAISON DE LA TÉLÉDÉTECTION), realizada de 10 a 19 de junho de 2014, em Montpellier França, objetivando informar a forma de execução dos estudos que vêm sendo realizados no escopo do projeto, visando principalmente a luta contra a desertificação, promoção da segurança alimentar e redução da pobreza nos países inseridos na iniciativa africana Grande Muralha Verde - GMV.

Annales del Reyno de Navarra

Signaturas: *6, A-F4, G2, H-Z4, 2A-2Z4, 3A-3Z4, 4A-4Z4, 5A-5D4, 5E2, 5F4 ; *5, A-Z4, 2A-2Z4, 3A-3Y4, Z2, 4A4 ; *5, A-Z4, 2A-2Z4, 3A-3Z4, 4A-4N4, 4O5 ; *5, A-Z4, 2A-2Z4, 3A-3Z4, 4A-4O4, 4P2, 4Q1, 4R4 ; *5, A-Z4, 2A-2Z4, 3A-3M4, *2, A-S4.

Farmacocinética do paracetamol

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

An Appearance-Based Framework for 3D Hand Shape Classification and Camera Viewpoint Estimation

An appearance-based framework for 3D hand shape classification and simultaneous camera viewpoint estimation is presented. Given an input image of a segmented hand, the most similar matches from a large database of synthetic hand images are retrieved. The ground truth labels of those matches, containing hand shape and camera viewpoint information, are returned by the system as estimates for the input image. Database retrieval is done hierarchically, by first quickly rejecting the vast majority of all database views, and then ranking the remaining candidates in order of similarity to the input. Four different similarity measures are employed, based on edge location, edge orientation, finger location and geometric moments.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.