Erythema nodosum as a result of estrogen patch therapy for prostate cancer: a case report.

© 2015 Coyle et al.Introduction: Erythema nodosum is often associated with a distressing symptomatology, including painful subcutaneous nodules, polyarthropathy, and significant fatigue. Whilst it is a well-documented side-effect of estrogen therapy in females, we describe what we believe to be the first report in the literature of erythema nodosum as a result of estrogen therapy in a male. Case presentation: A 64-year-old Afro-Caribbean man with locally advanced carcinoma of the prostate agreed to participate in a randomized controlled trial comparing estrogen patches with luteinizing hormone-releasing hormone analogs to achieve androgen deprivation, and was allocated to the group receiving estrogen patches. One month later he presented with tender lesions on his shins and painful swelling of his ankles, wrists, and left shoulder. This was followed by progressive severe fatigue that required hospital admission, where he was diagnosed with erythema nodosum by a rheumatologist. Two months after discontinuing the estrogen patches the erythema nodosum, and associated symptoms, had fully resolved, and to date he remains well with no further recurrence. Conclusion: Trial results may establish transdermal estrogen as an alternative to luteinizing hormone-releasing hormone analogs in the management of prostate cancer, and has already been established as a therapy for male to female transsexuals. It is essential to record the toxicity profile of transdermal estrogen in men to ensure accurate safety information. This case report highlights a previously undocumented toxicity of estrogen therapy in men, of which oncologists, urologists, and endocrinologists need to be aware. Rheumatologists and dermatologists should add estrogen therapy to their differential diagnosis of men presenting with erythema nodosum

A management architecture for active networks

In this paper we present an architecture for network and applications management, which is based on the Active Networks paradigm and shows the advantages of network programmability. The stimulus to develop this architecture arises from an actual need to manage a cluster of active nodes, where it is often required to redeploy network assets and modify nodes connectivity. In our architecture, a remote front-end of the managing entity allows the operator to design new network topologies, to check the status of the nodes and to configure them. Moreover, the proposed framework allows to explore an active network, to monitor the active applications, to query each node and to install programmable traps. In order to take advantage of the Active Networks technology, we introduce active SNMP-like MIBs and agents, which are dynamic and programmable. The programmable management agents make tracing distributed applications a feasible task. We propose a general framework that can inter-operate with any active execution environment. In this framework, both the manager and the monitor front-ends communicate with an active node (the Active Network Access Point) through the XML language. A gateway service performs the translation of the queries from XML to an active packet language and injects the code in the network. We demonstrate the implementation of an active network gateway for PLAN (Packet Language for Active Networks) in a forty active nodes testbed. Finally, we discuss an application of the active management architecture to detect the causes of network failures by tracing network events in time

A novel synthetic chemistry approach to linkage-specific ubiquitin conjugation.

Ubiquitination is of great importance as the post-translational modification of proteins with ubiquitin, or ubiquitin chains, facilitates a number of vital cellular processes. Herein we present a facile method of preparing various ubiquitin conjugates under mild conditions using michael acceptors based on dibromo-maleimides and dibromo-pyridazinediones

Binary Decision Diagrams: from Tree Compaction to Sampling

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique subtree. This yields the celebrated and widely used structure called reduced ordered binary decision diagram (ROBDD). We propose to revisit the classical compaction process to give a new way of enumerating ROBDDs of a given size without considering fully expanded trees and the compaction step. Our method also provides an unranking procedure for the set of ROBDDs. As a by-product we get a random uniform and exhaustive sampler for ROBDDs for a given number of variables and size

Highlights of the SLD Physics Program at the SLAC Linear Collider

Starting in 1989, and continuing through the 1990s, high-energy physics witnessed a flowering of precision measurements in general and tests of the standard model in particular, led by e+e- collider experiments operating at the Z0 resonance. Key contributions to this work came from the SLD collaboration at the SLAC Linear Collider. By exploiting the unique capabilities of this pioneering accelerator and the SLD detector, including a polarized electron beam, exceptionally small beam dimensions, and a CCD pixel vertex detector, SLD produced a broad array of electroweak, heavy-flavor, and QCD measurements. Many of these results are one of a kind or represent the world's standard in precision. This article reviews the highlights of the SLD physics program, with an eye toward associated advances in experimental technique, and the contribution of these measurements to our dramatically improved present understanding of the standard model and its possible extensions.Comment: To appear in 2001 Annual Review of Nuclear and Particle Science; 78 pages, 31 figures; A version with higher resolution figures can be seen at http://www.slac.stanford.edu/pubs/slacpubs/8000/slac-pub-8985.html; Second version incorporates minor changes to the tex

Spiralling dynamics near heteroclinic networks

There are few explicit examples in the literature of vector fields exhibiting complex dynamics that may be proved analytically. We construct explicitly a {two parameter family of vector fields} on the three-dimensional sphere \EU^3, whose flow has a spiralling attractor containing the following: two hyperbolic equilibria, heteroclinic trajectories connecting them {transversely} and a non-trivial hyperbolic, invariant and transitive set. The spiralling set unfolds a heteroclinic network between two symmetric saddle-foci and contains a sequence of topological horseshoes semiconjugate to full shifts over an alphabet with more and more symbols, {coexisting with Newhouse phenonema}. The vector field is the restriction to \EU^3 of a polynomial vector field in \RR^4. In this article, we also identify global bifurcations that induce chaotic dynamics of different types.Comment: change in one figur

Towards Verifying Nonlinear Integer Arithmetic

We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits. Such short proofs were conjectured not to exist. More precisely, we give n^{O(1)} size regular resolution proofs for arbitrary degree 2 identities on array, diagonal, and Booth multipliers and quasipolynomial- n^{O(\log n)} size proofs for these identities on Wallace tree multipliers.Comment: Expanded and simplified with improved result