Highly Efficient Orange and Green Solid‐State Light‐Emitting Electrochemical Cells Based on Cationic IrIII Complexes with Enhanced Steric Hindrance

Highly efficient orange and green emission from single‐layered solid‐state light‐emitting electrochemical cells based on cationic transition‐metal complexes [Ir(ppy)₂sb]PF₆ and [Ir(dFppy)₂sb]PF₆ (where ppy is 2‐phenylpyridine, dFppy is 2‐(2,4‐difluorophenyl)pyridine, and sb is 4,5‐diaza‐9,9′‐spirobifluorene) is reported. Photoluminescence measurements show highly retained quantum yields for [Ir(ppy)₂sb]PF₆ and [Ir(dFppy)₂ sb]PF₆ in neat films (compared with quantum yields of these complexes dispersed in m‐bis(N‐carbazolyl)benzene films). The spiroconfigured sb ligands effectively enhance the steric hindrance of the complexes and reduce the self‐quenching effect. The devices that use single‐layered neat films of [Ir(ppy)₂sb]PF₆ and [Ir(dFppy)₂sb]PF₆ achieve high peak external quantum efficiencies and power efficiencies of 7.1 % and 22.6 lm W^–1) at 2.5 V, and 7.1 % and 26.2 lm W^–1 at 2.8 V, respectively. These efficiencies are among the highest reported for solid‐state light‐emitting electrochemical cells, and indicate that cationic transition‐metal complexes containing ligands with good steric hindrance are excellent candidates for highly efficient solid‐state electrochemical cells.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Estimation of integrated volatility in stochastic volatility models

In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Numerical analysis of turbulent structure in compound meandering open channel by algebraic Reynolds stress model

The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd.