The Connections Between Work, Prostate Cancer Screening, Diagnosis, and the Decision to Undergo Radical Prostatectomy

Prostate cancer diagnosis can occur at a time when men’s work and careers are central to their masculine identity, sense of purpose, and family life. In Canada, an aging male population, along with medical advances, has resulted in increasing numbers of working men being diagnosed with, and treated for, prostate cancer. Little is known about the linkages between men’s work and their experiences of prostate cancer. In this qualitative study, 24 Western Canadian men were interviewed to distil the connections between work, prostate cancer screening, diagnosis, and the decision to undergo radical prostatectomy. Data were analyzed using constant comparison in the context of masculinities theory. The findings demonstrated that work was central to men’s masculine identities and afforded financial security, social status, and a sense of personal growth. However, work-related strain and demands were also found to affect participants’ health and distance them from their families. A diagnosis of prostate cancer tended  to diminish the importance of work, wherein participants focused on optimizing their health and strengthening family relations. In deciding on radical prostatectomy as a treatment to eradicate prostate cancer, few men considered the implications for returning to work. The current study findings indicate that clinicians and patients should explicitly explore and discuss how surgery side effects may affect work and career plans during treatment decision-making

Aspects of Discrete Breathers and New Directions

We describe results concerning the existence proofs of Discrete Breathers (DBs) in the two classes of dynamical systems with optical linear phonons and with acoustic linear phonons. A standard approach is by continuation of DBs from an anticontinuous limit. A new approach, which is purely variational, is presented. We also review some numerical results on intraband DBs in random nonlinear systems. Some non-conventional physical applications of DBs are suggested. One of them is understanding slow relaxation properties of glassy materials. Another one concerns energy focusing and transport in biomolecules by targeted energy transfer of DBs. A similar theory could be used for describing targeted charge transfer of nonlinear electrons (polarons) and, more generally, for targeted transfer of several excitations (e.g. Davydov soliton).Comment: to appear in the Proceedings of NATO Advanced Research Workshop "Nonlinearity and Disorder: Theory and Applications", Tashkent,Uzbekistan,October 1-6, 200

Light dark matter and Z′Z' dark force at colliders

Light Dark Matter, $<10$ GeV, with sizable direct detection rate is an interesting and less explored scenario. Collider searches can be very powerful, such as through the channel in which a pair of dark matter particle are produced in association with a jet. It is a generic possibility that the mediator of the interaction between DM and the nucleus will also be accessible at the Tevatron and the LHC. Therefore, collider search of the mediator can provide a more comprehensive probe of the dark matter and its interactions. In this article, to demonstrate the complementarity of these two approaches, we focus on the possibility of the mediator being a new $U(1)'$ gauge boson, which is probably the simplest model which allows a large direct detection cross section for a light dark matter candidate. We combine searches in the monojet+MET channel and dijet resonance search for the mediator. We find that for the mass of $Z'$ between 250 GeV and 4 TeV, resonance searches at the colliders provide stronger constraints on this model than the monojet+MET searches.Comment: 23 pages and 14 figure

Ant-based Neural Topology Search (ANTS) for Optimizing Recurrent Networks

Hand-crafting effective and efficient structures for recurrent neural networks (RNNs) is a difficult, expensive, and time-consuming process. To address this challenge, we propose a novel neuro-evolution algorithm based on ant colony optimization (ACO), called Ant-based Neural Topology Search (ANTS), for directly optimizing RNN topologies. The procedure selects from multiple modern recurrent cell types such as ∆-RNN, GRU, LSTM, MGU and UGRNN cells, as well as recurrent connections which may span multiple layers and/or steps of time. In order to introduce an inductive bias that encourages the formation of sparser synaptic connectivity patterns, we investigate several variations of the core algorithm. We do so primarily by formulating different functions that drive the underlying pheromone simulation process (which mimic L1 and L2 regularization in standard machine learning) as well as by introducing ant agents with specialized roles (inspired by how real ant colonies operate), i.e., explorer ants that construct the initial feed forward structure and social ants which select nodes from the feed forward connections to subsequently craft recurrent memory structures. We also incorporate communal intelligence, where best weights are shared by the ant colony for weight initialization, reducing the number of backpropagation epochs required to locally train candidate RNNs, speeding up the neuro-evolution process. Our results demonstrate that the sparser RNNs evolved by ANTS significantly outperform traditional one and two layer architectures consisting of modern memory cells, as well as the well-known NEAT algorithm. Furthermore, we improve upon prior state-of-the-art results on the time series dataset utilized in our experiments

Penis deformity after intra-urethral liquid paraffin administration in a young male: a case report

This is an Open Access article distributed under the terms of the Creative Commons Attribution Licens

Agreement Computing

[EN] In this paper we introduce the concept of Agreement Computing, motivate the central role that the concept of agreement plays in open software systems and discuss a number of research challenges that need to be addressed to make the agreement computing vision a reality.Research supported by the Agreement Technologies CONSOLIDER project under contract CSD2007-0022 and INGENIO 2010 and by the Agreement Technologies COST Action, IC0801.Sierra Garcia, C.; Botti Navarro, VJ.; Ossowski, DS. (2011). Agreement Computing. KI - Künstliche Intelligenz. 25(1):57-61. https://doi.org/10.1007/s13218-010-0070-yS5761251Arcos JL, Esteva M, Noriega P, Rodríguez JA, Sierra C (2005) Engineering open environments with electronic institutions. Eng Appl Artif Intell 18(2):191–204Boella G, Noriega P, Pigozzi G, Verhagen H (2009) In: Dagstuhl seminar proceedings 09121: normative multi-agent systems.Henrik G, Wright V (1963) Norm and action, a logical enquiry. Routledge and Kegan Paul, LondonHermenegildo M, Albert E, López-García P, Puebla G (2005) Abstraction carrying code and resource-awareness. In: Principle and practice of declarative programming. ACM Press, New YorkJennings N, Faratin P, Lomuscio A, Parsons S, Sierra C, Wooldridge M (2001) Automated negotiation: prospects methods and challenges. Group Decis Negot 10(2):199–215Jøsang A, Ismail R, Boyd C (2007) A survey of trust and reputation systems for online service provision. Decis Support Syst 43(2):618–644Kalfoglou Y, Schorlemmer M (2003) IF-Map: an ontology-mapping method based on information-flow theory. In: Spaccapietra S, March S, Aberer K (eds) Journal on data semantics I. Lecture notes in computer science, vol 2800. Springer, Heidelberg, pp 98–127Ko RKL, Lee SSG, Lee EW (2009) Business process management (bpm) standards: a survey. Bus Process Manag J 15(5):744–791Kraus S (1997) Negotiation and cooperation in multi-agent environments. Artif Intell 94(1–2):79–97March J (1996) A preface to understanding how decisions happen in organizations. In: Organizational decision-making, Cambridge University Press, CambridgeNecula GC, Lee P (1996) Proof-carrying code. Tech repRoss A (1968) Directives and norms. Humanities, Atlantic HighlandsSierra C, Debenham J (2006) Trust and honour in information-based agency. In: Proceedings of the 5th international conference on autonomous agents and multiagent systems. ACM Press, New York, pp 1225–1232Simon HA Administrative behavior. Free Press (1997)Vasirani M, Ossowski S (2009) A market-inspired approach to reservation-based urban road traffic management. In: Proceedings of the 8th international conference on autonomous agents and multiagent systems, IFAAMAS, pp. 617–62

A Hierarchy of Polynomial Kernels

In parameterized algorithmics, the process of kernelization is defined as a polynomial time algorithm that transforms the instance of a given problem to an equivalent instance of a size that is limited by a function of the parameter. As, afterwards, this smaller instance can then be solved to find an answer to the original question, kernelization is often presented as a form of preprocessing. A natural generalization of kernelization is the process that allows for a number of smaller instances to be produced to provide an answer to the original problem, possibly also using negation. This generalization is called Turing kernelization. Immediately, questions of equivalence occur or, when is one form possible and not the other. These have been long standing open problems in parameterized complexity. In the present paper, we answer many of these. In particular, we show that Turing kernelizations differ not only from regular kernelization, but also from intermediate forms as truth-table kernelizations. We achieve absolute results by diagonalizations and also results on natural problems depending on widely accepted complexity theoretic assumptions. In particular, we improve on known lower bounds for the kernel size of compositional problems using these assumptions