We construct for an equivariant homology theory for proper equivariant CW -complexes an equivariant Chern character under certain conditions. This applies for instance to the sources of the assembly maps in the Farrell-Jones Conjecture with respect to the family F of finite subgroups and in the Baum-Connes Conjecture. Thus we get an explicit calculation of Q ⊗Z Kn(RG) and Q ⊗Z Ln(RG) for a comm...

Stephen Kopecky, MD, FACC, FACP; Seth Baum, MD, FACC, FACPM, FAHA, FNLA; JoAnne M. Foody, MD, FACC, FAHA; Michael Koren, MD, FACC; James McKenney, PharmD, FNLA; Laurence Sperling, MD, FACC, FAHA, FACP; Nathan D. Wong, PhD, MPH, FACC, FAHA; Statin Intolerance Roundtable Participants Division of Cardiovascular Diseases (Kopecky), Mayo Clinic, Rochester, Minnesota; Women’s Preventive Cardiology Ce...

In this paper, we address the problem of learning models for complex processes under the assumption that the processes can be represented within the hidden Markov model (HMM) framework. Toward that aim, we investigate the strengths and weaknesses of two compet­ ing algorithms for learning HMMs: Baum-VVelch and Bayesian Model Merging. VVe offer insight into the reasons for the success or failure...

T, . etrazolium stains permit the histochemical demonstration of dehydrogenase enzymes in tissue sections. These stains are soluble compounds which act as hydrogen acceptors developing insoluble formazan precipitates in the reduced state. Blue tetrazolium was first used by DeBerardinis to study frozen corneal tissue sections and subsequently has been used by Kuwabara and Cogan, who studied the ...

For any countable discrete group Γ (without further assumptions on it) we first construct an explicit morphism from the Left-Hand side of Baum-Connes assembly map, Ktop⁎(Γ), to periodic cyclic homology algebra, HP⁎(CΓ). This morphism, called Chern-Baum-Connes allows in particular give a proper and formulation for Chern-Connes pairingKtop⁎(Γ)×HP⁎(CΓ)⟶C. Several theorems are needed formulate map....

We address the problem of learning discrete hidden Markov models from very long sequences of observations. Incremental versions of the Baum-Welch algorithm that approximate the β-values used in the backward procedure are commonly used for this problem, since their memory complexity is independent of the sequence length. We introduce an improved incremental Baum-Welch algorithm with a new backwa...

Training probabilistic finite automata with the EM/Baum-Welch algorithm is computationally very intensive, especially if random ergodic automata are used initially, and additional strategies such as deterministic annealing are used. In this paper we present some optimization and parallelization strategies to the Baum-Welch algorithm that often allow for training of much larger automata with a l...

WAVES AND PERSISTENCE IN MERGER AND ACQUISITION ACTIVITY Corresponding author. Tel. 1+617-552-3673, fax +1-617-552-2308, email [email protected]. John T. Barkoulas Department of Economics and Finance Louisiana Tech University Ruston, LA 71272 USA Christopher F. Baum Department of Economics Boston College Chestnut Hill, MA 02467 USA Atreya Chakraborty Charles River Associates Boston, MA 02116 USA Mark...

In diesem Modell wird ein Baum aus Knoten aufgebaut, die gleichmäßig über das Einheitsquadrat verteilt sind. Wenn der i-te Knoten eingefügt wird, verbindet er sich durch eine Kante mit einem der früheren Knoten. Aber mit welchem Knoten soll es verbunden werden? Eine intuitive Idee ist den Euklidischen Abstand zu minimieren. Aber ein neu eingefügter Knoten möchte auch mit einem Knoten in dem Bau...