Concept

Yield to maturity

Related publications (68)

Pt-Zn nanoparticles supported on porous polymeric matrix for selective 3-nitrostyrene hydrogenation

Lioubov Kiwi, Fernando Cardenas Lizana, Charline Berguerand, Artur Yarulin, Irina Prokopyeva

We report the promoting effect of Zn on performance of Pt-based catalyst in liquid-phase hydrogenation of 3-nitrostyrene (3-NS) to 3-vinylaniline (3-VA). Bimetallic Pt-Zn nanoparticles (NPs) were prepared within the hypercross-linked polystyrene (HPS) supp ...

Elsevier2015

The Swaption Cube

We infer conditional swap rate moments model independently from swaption cubes. Conditional volatility and skewness exhibit systematic variation across swap maturities and option expiries (conditional kurtosis less so), with conditional skewness sometimes ...

Oxford Univ Press Inc2014

The term structure of interbank risk

Damir Filipovic

We infer a term structure of interbank risk from spreads between rates on interest rate swaps indexed to the London Interbank Offered Rate (LIBOR) and overnight indexed swaps. We develop a tractable model of interbank risk to decompose the term structure i ...

Elsevier2013

Dislocation densities and internal stress in Ni3Al

Jean-Luc Martin

Dislocation densities have been measured in Ni3Al(Hf) single crystals after deformation at various temperatures and strains. In addition, effective and athermal stresses have been determined by strain dip tests. A model is proposed for the strength anomaly ...

Taylor & Francis Ltd2013

Iron-Catalyzed [3+2] Annulation of Aminocyclopropanes with Aldehydes: Stereoselective Synthesis of Aminotetrahydrofurans

Jérôme Waser, Fides Benfatti, Florian Patrick Marie Daniel De la Barre De Nanteuil

The first method for the [3 + 2] annulation of donor acceptor aminocyclopropanes with aldehydes is reported. The reaction is catalyzed by iron trichlorlde on alumina in yields up to 99% and with excellent cis selectivities (up to >20:1) and represents a st ...

American Chemical Society2012

Tight Bounds on the Redundancy of Huffman Codes

Ali Kakhbod

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Temperature response of the submicron organic aerosol from temperate forests

Satoshi Takahama

Observations from four periods (three late springs and one early summer) at temperate forest sites in western and eastern Canada offer the first estimation of how the concentrations of submicron forest organic aerosol mass (SFOM) from the oxidation of biog ...

Elsevier2011

A Minimum Energy solution to Monocular Simultaneous Localization and Mapping

Andrea Alessandretti, António Pedro Rodrigues de Aguiar

In this paper we propose an alternative solution to the Monocular Simultaneous Localization and Mapping (SLAM) problem. This approach uses a Minimum-Energy Observer for Systems with Perspective Outputs and provides an optimal solution. Contrarily to the mo ...

IEEE2011

Manufacturing recombinant proteins in kg-ton quantities using animal cells in bioreactors

Florian Maria Wurm

Mammalian cells in bioreactors as production host are the focus of this review. We wish to briefly describe today's technical status and to highlight emerging trends in the manufacture of recombinant therapeutic proteins, focusing on Chinese hamster ovary ...

Elsevier2011

Design and Feasibility of Multi-Gb/s Quasi-Serial Vertical Interconnects based on TSVs for 3D ICs

Yusuf Leblebici, Alessandro Cevrero, Panagiotis Athanasopoulos, Fengda Sun

This paper proposes a novel technique to exploit the high bandwidth offered by through silicon vias (TSVs). In the proposed approach, synchronous parallel 3D links are replaced by serialized links to save silicon area and increase yield. Detailed analysis ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.