The effect of progressive muscle relaxation on daily cortisol secretion

Abbreviated progressive muscle relaxation (APMR) is a much used stress-management technique. Its efficacy relevant to placebo control is already established in the literature and the primary aim of the present study was to ascertain whether its proven impact on psychological stress measures is matched by a decrease in prevailing levels of the stress-associated hormone cortisol, using accurate and robust measurement based on multiple sampling of full diurnal cortisol secretion profiles. First-year university students can face significant stress in adjustment to academic demands and immersion in a novel social network and provided a convenient study population. One hundred and one first-year students completed APMR with prevailing stress levels assessed a week before and after intervention. Both cortisol and self-report measures were significantly reduced post-intervention by 8% and 10%, respectively. The efficacy of the intervention was independent of, and not modulated by neuroticism, gender, age and smoking status. We also demonstrated that cortisol reduction was unlikely to have been a consequence of adaptation to any initial cortisol elevation prompted by the challenge of the demanding saliva collection protocol. We conclude that the efficacy of APMR in this population extends to reduction in biologically expressed stress levels as well as levels based solely on self-report

Rapid subduction of organic matter by maldanid polychaetes on the North Carolina slope

In situ tracer experiments conducted on the North Carolina continental slope reveal that tube-building worms (Polychaeta: Maldanidae) can, without ingestion, rapidly subduct freshly deposited, algal carbon (13C-labeled diatoms) and inorganic materials (slope sediment and glass beads) to depths of 10 cm or more in the sediment column. Transport over 1.5 days appears to be nonselective but spatially patchy, creating localized, deep hotspots. As a result of this transport, relatively fresh organic matter becomes available soon after deposition to deep-dwelling microbes and other infauna, and both aerobic and anaerobic processes may be enhanced. Comparison of tracer subduction with estimates from a diffusive mixing model using 234Th-based coefficients, suggests that maldanid subduction activities, within 1.5 d of particle deposition, could account for 25–100% of the mixing below 5 cm that occurs on 100-day time scales. Comparisons of community data from the North Carolina slope for different places and times indicate a correlation between the abundance of deep-dwelling maldanids and the abundance and the dwelling depth in the sediment column of other infauna. Pulsed inputs of organic matter occur frequently in margin environments and maldanid polychaetes are a common component of continental slope macrobenthos. Thus, the activities we observe are likely to be widespread and significant for chemical cycling (natural and anthropogenic materials) on the slope. We propose that species like maldanids, that rapidly redistribute labile organic matter within the seabed, probably function as keystone resource modifiers. They may exert a disproportionately strong influence (relative to their abundance) on the structure of infaunal communities and on the timing, location and nature of organic matter diagenesis and burial in continental margin sediments

Guías para la práctica de la autopsia en casos de muerte súbita cardíaca

A pesar de que la muerte súbita cardíaca es una de las formas más importantes de muerte en los países occidentales, este problema no ha recibido la atención que merece por parte de los patólogos y de los médicos de los sistemas públicos de salud. Se han desarrollado nuevos métodos de prevención de arritmias potencialmente mortales, y el diagnóstico de certeza de las causas de muerte súbita cardíaca es en este momento de particular importancia. Los patólogos son responsables de determinar la causa exacta de la muerte súbita pero existen diferencias considerables en el modo en el que se aborda esta cada vez más compleja tarea. La Asociación Europea de Patología Cardiovascular desarrolló unas guías que representan el estándar mínimo necesario en la práctica habitual de la autopsia para la valoración de la muerte súbita cardíaca, incluyendo no sólo un protocolo para el examen del corazón y el muestreo histopatológico, sino también para la investigación toxicológica y molecular. Nuestras recomendaciones son aplicables a centros médicos universitarios, a hospitales regionales y locales y a todo tipo de Institutos de Medicina Forense. La adopción a lo largo de la Unión Europea de un método uniforme de investigación supondrá la mejora de la práctica habitual, permitirá realizar comparaciones significativas entre distintas comunidades y regiones y, lo que es más importante aún, favorecerá que se monitoricen los patrones de las enfermedades que causan una muerte súbita. Although sudden cardiac death is one of the most important mode of death in Western Countries, pathologists and public health physicians have not given this problem the attention it deserves. New methods of preventing potentially fatal arrhythmias have been developed, and the accurate diagnosis of the causes of sudden cardiac death is now of particular importance. Pathologists are responsible for determining the precise cause of sudden death but there is considerable variation in the way in which they approach this increasingly complex task. The Association for European Cardiovascular Pathology developed guidelines, which represent the minimum standard that is required in the routine autopsy practice for the adequate assessment of sudden cardiac death, including not only a protocol for heart examination and histological sampling, but also for toxicology and molecular investigation. Our recommendations apply to university medical centres, regional and district hospitals and all types of forensic medicine institutes. If a uniform method of investigation is adopted throughout the European Union, this will lead to improvements in standards of practice, allow meaningful comparisons between different communities and regions and, most importantly, permit future trends in the patterns of disease causing sudden death to be monitored

JASPAR 2016: a major expansion and update of the open-access database of transcription factor binding profiles.

JASPAR (http://jaspar.genereg.net) is an open-access database storing curated, non-redundant transcription factor (TF) binding profiles representing transcription factor binding preferences as position frequency matrices for multiple species in six taxonomic groups. For this 2016 release, we expanded the JASPAR CORE collection with 494 new TF binding profiles (315 in vertebrates, 11 in nematodes, 3 in insects, 1 in fungi and 164 in plants) and updated 59 profiles (58 in vertebrates and 1 in fungi). The introduced profiles represent an 83% expansion and 10% update when compared to the previous release. We updated the structural annotation of the TF DNA binding domains (DBDs) following a published hierarchical structural classification. In addition, we introduced 130 transcription factor flexible models trained on ChIP-seq data for vertebrates, which capture dinucleotide dependencies within TF binding sites. This new JASPAR release is accompanied by a new web tool to infer JASPAR TF binding profiles recognized by a given TF protein sequence. Moreover, we provide the users with a Ruby module complementing the JASPAR API to ease programmatic access and use of the JASPAR collection of profiles. Finally, we provide the JASPAR2016 R/Bioconductor data package with the data of this release

BFF: A tool for eliciting tie strength and user communities in social networking services

The final publication is available at Springer via http://dx.doi.org/ 10.1007/s10796-013-9453-6The use of social networking services (SNSs) such as Facebook has explosively grown in the last few years. Users see these SNSs as useful tools to find friends and interact with them. Moreover, SNSs allow their users to share photos, videos, and express their thoughts and feelings. However, users are usually concerned about their privacy when using SNSs. This is because the public image of a subject can be affected by photos or comments posted on a social network. In this way, recent studies demonstrate that users are demanding better mechanisms to protect their privacy. An appropriate approximation to solve this could be a privacy assistant software agent that automatically suggests a privacy policy for any item to be shared on a SNS. The first step for developing such an agent is to be able to elicit meaningful information that can lead to accurate privacy policy predictions. In particular, the information needed is user communities and the strength of users' relationships, which, as suggested by recent empirical evidence, are the most important factors that drive disclosure in SNSs. Given the number of friends that users can have and the number of communities they may be involved on, it is infeasible that users are able to provide this information without the whole eliciting process becoming confusing and time consuming. In this work, we present a tool called Best Friend Forever (BFF) that automatically classifies the friends of a user in communities and assigns a value to the strength of the relationship ties to each one. We also present an experimental evaluation involving 38 subjects that showed that BFF can significantly alleviate the burden of eliciting communities and relationship strength.This work has been partially supported by CONSOLIDER-INGENIO 2010 under grant CSD2007-00022, and TIN 2008-04446 and PROMETEO II/2013/019 projects. This article has been developed as a result of a mobility stay funded by the Erasmus Mundus Programme of the European Comission under the Transatlantic Partnership for Excellence in Engineering - TEE Project.López Fogués, R.; Such Aparicio, JM.; Espinosa Minguet, AR.; García-Fornes, A. (2014). BFF: A tool for eliciting tie strength and user communities in social networking services. Information Systems Frontiers. 16:225-237. https://doi.org/10.1007/s10796-013-9453-6S22523716Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008.Boyd, D., & Hargittai, E. (2010). Facebook privacy settings: who cares? First Monday, 15(8).Burt, R. (1995). Structural holes: the social structure of competition. Harvard University Pr.Culotta, A., Bekkerman, R., McCallum, A. (2004). Extracting social networks and contact information from email and the web.Ellison, N., Steinfield, C., Lampe, C. (2007). The benefits of facebook friends: social capital and college students use of online social network sites. Journal of Computer-Mediated Communication, 12(4), 1143–1168.Fang, L., & LeFevre, K. (2010). Privacy wizards for social networking sites. In Proceedings of the 19th international conference on World wide web (pp. 351–360). ACM.Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3-5), 75–174.Gilbert, E., & Karahalios, K. (2009). Predicting tie strength with social media. In Proceedings of the 27th international conference on human factors in computing systems (pp. 211–220). ACM.Girvan, M., & Newman, M. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Science, 99(12), 7821.Granovetter, M. (1973). The strength of weak ties. American Journal of Sociology, 1360–1380.Gross, R., & Acquisti, A. (2005). Information revelation and privacy in online social networks. In Proceedings of the 2005 ACM workshop on privacy in the electronic society (pp. 71–80). ACM.Johnson, M., Egelman, S., Bellovin, S. (2012). Facebook and privacy: it’s complicated. In Proceedings of the eighth symposium on usable privacy and security (p. 9). ACM .Kahanda, I., & Neville, J. (2009). Using transactional information to predict link strength in online social networks. In Proceedings of the third international conference on weblogs and social media (ICWSM).Lancichinetti, A., & Fortunato, S. (2009). Community detection algorithms: a comparative analysis. Physical Review E, 80, 056–117.Lancichinetti, A., Fortunato, S., Kertsz, J. (2009). Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3), 033–015.Lin, N., Ensel, W., Vaughn, J. (1981). Social resources and strength of ties: Structural factors in occupational status attainment. American Sociological Review, 393–405.Lipford, H., Besmer, A., Watson, J. (2008). Understanding privacy settings in facebook with an audience view. In Proceedings of the 1st conference on usability, psychology, and security (pp. 1–8). Berkeley: USENIX Association.Liu, G., Wang, Y., Orgun, M. (2010). Optimal social trust path selection in complex social networks. In Proceedings of the 24th AAAI conference on artificial intelligence (pp. 139–1398). AAAI.Matsuo, Y., Mori, J., Hamasaki, M., Nishimura, T., Takeda, H., Hasida, K., Ishizuka, M. (2007). Polyphonet: an advanced social network extraction system from the web. Web Semantics: Science, Services and Agents on the World Wide Web, 5(4), 262–278. World Wide Web Conference 2006 Semantic Web Track.Murukannaiah, P., & Singh, M. (2011). Platys social: relating shared places and private social circles. Internet Computing IEEE, 99, 1–1.Quercia, D., Lambiotte, R., Kosinski, M., Stillwell, D., Crowcroft, J. (2012). The personality of popular facebook users. In Proceedings of the ACM 2012 conference on computer supported cooperative work (CSCW’12).Rosvall, M., & Bergstrom, C. (2008). Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4), 1118–1123.Sharma, G., Qiang, Y., Wenjun, S., Qi, L. (2013). Communication in virtual world: Second life and business opportunities. Information Systems Frontiers, 15(4), 677–694.Shen, K., Song, L., Yang, X., Zhang, W. (2010). A hierarchical diffusion algorithm for community detection in social networks. In 2010 international conference on cyber-enabled distributed computing and knowledge discovery (CyberC) (pp. 276–283). IEEE.Sierra, C., & Debenham, J. (2007). The LOGIC negotiation model. In AAMAS ’07: proceedings of the 6th international joint conference on autonomous agents and multiagent systems (pp. 1–8). ACM.Staddon, J., Huffaker, D., Brown, L., Sedley, A. (2012). Are privacy concerns a turn-off?: engagement and privacy in social networks. In Proceedings of the eighth symposium on usable privacy and security (p. 10). ACM.Strater, K., & Lipford, H.R. (2008). Strategies and struggles with privacy in an online social networking community. In Proceedings of the 22nd British HCI group annual conference on people and computers: culture, creativity, interaction, BCS-HCI ’08 (Vol. 1, pp. 111–119). Swinton: British Computer Society.Wellman, B., & Wortley, S. (1990). Different strokes from different folks: Community ties and social support. American Journal of Sociology, 558–588.Wiese, J., Kelley, P., Cranor, L., Dabbish, L., Hong, J., Zimmerman, J. (2011). Are you close with me? are you nearby? investigating social groups, closeness, and willingness to share. In Proceedings of the 13th international conference on Ubiquitous computing (pp. 197–206). ACM.Xiang, R., Neville, J., Rogati, M. (2010). Modeling relationship strength in online social networks. In Proceedings of the 19th international conference on World wide web (pp. 981–990). ACM

A genetic approach for long term virtual organization distribution

Electronic versíon of an article published as International Journal on Artificial Intelligent Tools, Volume 20, issue 2, 2011. 10.1142/S0218213011000152. © World Scientific Publishing Company[EN] An agent-based Virtual Organization is a complex entity where dynamic collections of agents agree to share resources in order to accomplish a global goal or offer a complex service. An important problem for the performance of the Virtual Organization is the distribution of the agents across the computational resources. The final distribution should provide a good load balancing for the organization. In this article, a genetic algorithm is applied to calculate a proper distribution across hosts in an agent-based Virtual Organization. Additionally, an abstract multi-agent system architecture which provides infrastructure for Virtual Organization distribution is introduced. The developed genetic solution employs an elitist crossover operator where one of the children inherits the most promising genetic material from the parents with higher probability. In order to validate the genetic proposal, the designed genetic algorithm has been successfully compared to several heuristics in different scenarios. © 2011 World Scientific Publishing Company.This work is supported by TIN2008-04446, TIN2009-13839-C03-01, CSD2007-00022 and FPU grant AP2008-00600 of the Spanish government, and PROMETEO 2008/051 of the Generalitat Valenciana.Sánchez Anguix, V.; Valero Cubas, S.; García Fornes, AM. (2011). A genetic approach for long term virtual organization distribution. International Journal on Artificial Intelligence Tools. 20(2):271-295. https://doi.org/10.1142/S0218213011000152S27129520

INTERTIDAL BIODIVERSITY IN CENTRAL CHILE REVISTA CHILENA DE HISTORIA NATURAL

ABSTRACT Along the coast of central Chile, geographic trends of diversity have been inferred from literature compilations and museum collections based on species range limits for some taxonomic groups. However, spatially-intensive fieldbased assessments of macrobenthic species richness are largely missing. Over the course of a multiyear study (1998)(1999)(2000)(2001)(2002)(2003)(2004)(2005), we characterized latitudinal patterns of rocky intertidal diversity at 18 sites along the coast of central Chile (29-36º S). At each site, the number of sessile and mobile macrobenthic species was quantified in 0.25 m 2 quadrats. Two estimators of local (alpha) diversity were used: observed local species richness, calculated from the asymptote of a species-rarefaction curve, and the Chao2 index, which takes into account the effect of rare species on estimates of local richness. We identified a total of 71 species belonging to 66 genera for a total of 86 taxa. The most diverse groups were herbivorous mollusks (27 taxa) and macroalgae (43 taxa). Diversity showed a complex spatial pattern with areas of high species richness interspersed with areas of low richness. In accordance with previous work, we found no trend in the number of herbivorous mollusks and an inverse and significant latitudinal gradient in the number of algal species. Our results highlight the need for taxonomically diverse assessments of biodiversity of the dominant taxa that conform intertidal communities

Advances in infrastructures and tools for multiagent systems

In the last few years, information system technologies have focused on solving challenges in order to develop distributed applications. Distributed systems can be viewed as collections of service-provider and ser vice-consumer components interlinked by dynamically defined workflows (Luck and McBurney 2008).Alberola Oltra, JM.; Botti Navarro, VJ.; Such Aparicio, JM. (2014). Advances in infrastructures and tools for multiagent systems. Information Systems Frontiers. 16:163-167. doi:10.1007/s10796-014-9493-6S16316716Alberola, J. M., Búrdalo, L., Julián, V., Terrasa, A., & García-Fornes, A. (2014). An adaptive framework for monitoring agent organizations. Information Systems Frontiers, 16(2). doi: 10.1007/s10796-013-9478-x .Alfonso, B., Botti, V., Garrido, A., & Giret, A. (2014). A MAS-based infrastructure for negotiation and its application to a water-right market. Information Systems Frontiers, 16(2). doi: 10.1007/s10796-013-9443-8 .Andrighetto, G., Castelfranchi, C., Mayor, E., McBreen, J., López-Sánchez, M., & Parsons, S. (2013). (Social) norm dynamics. In G. Andrighetto, G. Governatori, P. Noriega, & L. W. van der Torre (Eds.), Normative multi-agent systems (pp. 135–170). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.Baarslag, T., Fujita, K., Gerding, E. H., Hindriks, K., Ito, T., Jennings, N. R., et al. (2013). Evaluating practical negotiating agents: results and analysis of the 2011 international competition. Artificial Intelligence, 198, 73–103.Boissier, O., Bordini, R. H., Hübner, J. F., Ricci, A., & Santi, A. (2013). Multi-agent oriented programming with JaCaMo. Science of Computer Programming, 78(6), 747–761.Campos, J., Esteva, M., López-Sánchez, M., Morales, J., & Salamó, M. (2011). Organisational adaptation of multi-agent systems in a peer-to-peer scenario. Computing, 91(2), 169–215.Carrera, A., Iglesias, C. A., & Garijo, M. (2014). Beast methodology: an agile testing methodology for multi-agent systems based on behaviour driven development. Information Systems Frontiers, 16(2). doi: 10.1007/s10796-013-9438-5 .Criado, N., Such, J. M., & Botti, V. (2014). Norm reasoning services. Information Systems Frontiers, 16(2). doi: 10.1007/s10796-013-9444-7 .Del Val, E., Rebollo, M., & Botti, V. (2014). Enhancing decentralized service discovery in open service-oriented multi-agent systems. Journal of Autonomous Agents and Multi-Agent Systems, 28(1), 1–30.Denti, E., Omicini, A., & Ricci, A. (2002). Coordination tools for MAS development and deployment. Applied Artificial Intelligence, 16(9–10), 721–752.Dignum, V., & Dignum, F. (2012). A logic of agent organizations. Logic Journal of IGPL, 20(1), 283–316.Ferber, J., & Gutknecht, O. (1998). A meta-model for the analysis and design of organizations in multi-agent systems. In Multi agent systems. Proceedings. International Conference on (pp. 128–135). IEEE.Fogués, R. L., Such, J. M., Espinosa, A., & Garcia-Fornes, A. (2014). BFF: a tool for eliciting tie strength and user communities in social networking services. Information Systems Frontiers, 16(2). doi: 10.1007/s10796-013-9453-6 .Garcia, E., Giret, A., & Botti, V. (2011). Evaluating software engineering techniques for developing complex systems with multiagent approaches. Information and Software Technology, 53(5), 494–506.Garcia-Fornes, A., Hübner, J., Omicini, A., Rodriguez-Aguilar, J., & Botti, V. (2011). Infrastructures and tools for multiagent systems for the new generation of distributed systems. Engineering Applications of Articial Intelligence, 24(7), 1095–1097.Jennings, N., Faratin, P., Lomuscio, A., Parsons, S., Sierra, C., & Wooldridge, M. (2001). Automated negotiation: prospects, methods and challenges. International Journal of Group Decision and Negotiation, 10(2), 199–215.Jung, Y., Kim, M., Masoumzadeh, A., & Joshi, J. B. (2012). A survey of security issue in multi-agent systems. Artificial Intelligence Review, 37(3), 239–260.Kota, R., Gibbins, N., & Jennings, N. R. (2012). Decentralized approaches for self-adaptation in agent organizations. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 7(1), 1.Kraus, S. (1997). Negotiation and cooperation in multi-agent environments. Artificial Intelligence, 94(1), 79–97.Lin, Y. I., Chou, Y. W., Shiau, J. Y., & Chu, C. H. (2013). Multi-agent negotiation based on price schedules algorithm for distributed collaborative design. Journal of Intelligent Manufacturing, 24(3), 545–557.Luck, M., & McBurney, P. (2008). Computing as interaction: agent and agreement technologies.Luck, M., McBurney, P., Shehory, O., & Willmott, S. (2005). Agent technology: Computing as interaction (A roadmap for agent based computing). AgentLink.Ossowski, S., & Menezes, R. (2006). On coordination and its significance to distributed and multiagent systems. Concurrency and Computation: Practice and Experience, 18(4), 359–370.Ossowski, S., Sierra, C., & Botti. (2013). Agreement technologies: A computing perspective. In Agreement Technologies (pp. 3–16). Springer Netherlands.Pinyol, I., & Sabater-Mir, J. (2013). Computational trust and reputation models for open multi-agent systems: a review. Artificial Intelligence Review, 40(1), 1–25.Ricci, A., Piunti, M., & Viroli, M. (2011). Environment programming in multi-agent systems: an artifact-based perspective. Autonomous Agents and Multi-Agent Systems, 23(2), 158–192.Sierra, C., & Debenham, J. (2006). Trust and honour in information-based agency. In Proceedings of the 5th international conference on autonomous agents and multi agent systems, (p. 1225–1232). New York: ACM.Sierra, C., Botti, V., & Ossowski, S. (2011). Agreement computing. KI-Knstliche Intelligenz, 25(1), 57–61.Vasconcelos, W., García-Camino, A., Gaertner, D., Rodríguez-Aguilar, J. A., & Noriega, P. (2012). Distributed norm management for multi-agent systems. Expert Systems with Applications, 39(5), 5990–5999.Wooldridge, M. (2002). An introduction to multiagent systems. New York: Wiley.Wooldridge, M., & Jennings, N. R. (1995). Intelligent agents: theory and practice. Knowledge Engineering Review, 10(2), 115–152