Efficient and 1,8-diiodooctane-free ternary organic solar cells fabricated via nanoscale morphology tuning using small-molecule dye additive

The ternary strategy for incorporating multiple photon-sensitive components into a single junction has emerged as an effective method for optimizing the nanoscale morphology and improving the device performance of organic solar cells (OSCs).In this study,efficient and stable ternary OSCs were achieved by introducing the small-molecule dye (5E,5'E)-5,5'-(4',4″-(1,2-diphenylethene-1,2-diyl)bis(biphenyl-4',4-diyl))bis(methan-1-yl-1-ylidene)bis(3-ethyl-2-thioxothia zolidin-4-one) (BTPERn) into poly[4,8-bis(5-(2-ethylhexyl)thiophen-2-yl)benzo[1,2-b:4,5-b']dithiopheneco-3-fluorothieno[3,4-b]thiophene-2-carboxylate] (PTB7-Th):[6,6]-phenyl C71 butyric acid methyl ester (PC71BM) blend films processed using a 1,8-diiodooctane (DIO)-free solvent.The incorporation of BTPE-Rn enhanced the short-circuit current density and fill factor of the ternary OSCs compared with those of binary OSCs.An investigation of the optical,electronic,and morphological properties of the ternary blends indicated that the third component of BTPE-Rn not only promoted the photon utilization of blends through the energy-transfer process but also improved the electron mobility of the blends owing to the fullerene-rich nanophase optimization.More importantly,this ternary strategy of utilizing a small-molecule dye to replace the photounstable DIO additive enhanced the operational stability of the OSCs.     

Developments in quantitative dimensional synthesis (1970-present): four-bar motion generation

Dimensional synthesis is a type of inverse problem in linkage kinematics where the objective is to calculate the linkage dimensions required to achieve prescribed linkage output motion. Motion generation is a particular category of dimensional synthesis where the objective is to calculate the linkage dimensions required to achieve a group of prescribed link positions. In motion generation for a four-bar linkage, positions are prescribed for the coupler link. While early motion generation methods were primarily qualitative, ongoing advancements in computing hardware and software continue to make quantitative motion generation more practical. By providing overviews of works representative of developments in quantitative four-bar motion generation since 1970, this work is essentially an overview that spans over 40 years of developments in quantitative four-bar motion generation.     

Expression, characterization, and detection of human uridine phosphorylase and identification of variant uridine phosphorolytic activity in selected human tumors

Uridine phosphorylase (UPase) catalyzes the reversible phosphorolysis of uridine to uracil. We purified the enzyme from the murine colon 26 tumor using a two-step procedure through 5-amino-benzylacyclouridine affinity chromatography. Antibodies raised in rabbits against the purified protein revealed single bands in Western blots of normal human tissue and tumor extracts. The polyclonal antibody used to screen a human liver expression library allowed the isolation of a 1.2-kb clone that contained the entire open reading frame of the human UPase. The UPase cDNA has been expressed as a fusion protein in Escherichia coli using the pMal-C2 vector. The kinetic analysis demonstrated that the recombinant UPase preferentially uses uridine, 5-fluorouracil, and uracil as substrates, although lower levels of activity were observed with 2-deoxyuridine and thymidine. Clinical samples of human tumors and adjacent normal tissues were assayed for phosphorolytic activity and sensitivity to 5-benzylacyclouridine (BAU), a potent inhibitor of the enzyme presently in Phase I-II clinical trial. Activity in normal tissues appeared to be low but very sensitive to BAU (approximately 90% inhibition at 10 microM). Tumors had generally 2-3-fold greater activity compared with adjacent normal tissues. In breast cancer specimens and head-neck squamous carcinomas, however, uridine cleavage was only partially inhibited (40-60%) by 10 or 100 microM BAU. The BAU-insensitive activity requires phosphate and pH conditions similar to the normal enzyme, and the new phosphorolytic activity was independent from thymidine phosphorylase. The BAU-insensitive phosphorolytic activity in selected tumors, coupled with the potent inhibitory activity of BAU against the "classical" uridine phosphorylase in normal human tissues, provides the rationale for combining BAU with 5-fluorouracil in the treatment of breast and head-neck tumors.     

AdaBoost-based face detection for embedded systems

Face detection is a widely studied topic in computer vision, and recent advances in algorithms, low cost processing, and CMOS imagers make it practical for embedded consumer applications. As with graphics, the best cost-performance ratio is achieved with dedicated hardware. In this paper, we design an embedded face detection system for handheld digital cameras or camera phones. The challenges of face detection in embedded environments include an efficient pipeline design, bandwidth constraints set by low cost memory, a need to find parallelism, and how to utilize the available hardware resources efficiently. In addition, consumer applications require reliability which calls for a hard real-time approach to guarantee that processing deadlines are met. Specifically, the main contributions of the paper include: (1) incorporation of a Genetic Algorithm in the AdaBoost training to optimize the detection performance given the number of Haar features; (2) a complexity control scheme to meet hard real-time deadlines; (3) a hardware pipeline design for Haar-like feature calculation and a system design exploiting several levels of parallelism. The proposed architecture is verified by synthesis to Altera’s low cost Cyclone II FPGA. Simulation results show the system can achieve about 75–80% detection rate for group portraits.     

Using knowledge structures to redesign an instructor-operator station

Frequently, user interface (UI) designers must choose between modifying an established, but suboptimal and familiar, UI or to avoid such changes. Changing the UI’s, organization may frustrate users who have become familiar with the original design, whereas failing to make changes may force users to perform at an unsatisfactory level. This paper presents two studies that investigate whether users familiar with a poorly designed UI would find items faster, and prefer a reorganized UI that conformed to domain expert knowledge, or would their familiarity with the original UI yield faster performance and higher satisfaction.This paper describes activities to redesign a menu structure in a simulator instructor–operator station (IOS) using hierarchical card sorting and cluster analysis (Romesburg, 2004). This analysis was used to reorganize the menu structure to reflect the knowledge representations of domain experts in accordance with the principle of proximity compatibility (Wickens and Carswell, 1995, Rothrock et al., 2006). The new design was validated with a separate set of users by a reaction time experiment and preference selection.     

A flexible extreme value mixture model

Extreme value theory is used to derive asymptotically motivated models for unusual or rare events, e.g. the upper or lower tails of a distribution. A new flexible extreme value mixture model is proposed combining a non-parametric kernel density estimator for the bulk of the distribution with an appropriate tail model. The complex uncertainties associated with threshold choice are accounted for and new insights into the impact of threshold choice on density and quantile estimates are obtained. Bayesian inference is used to account for all uncertainties and enables inclusion of expert prior information, potentially overcoming the inherent sparsity of extremal data. A simulation study and empirical application for determining normal ranges for physiological measurements for pre-term infants is used to demonstrate the performance of the proposed mixture model. The potential of the proposed model for overcoming the lack of consistency of likelihood based kernel bandwidth estimators when faced with heavy tailed distributions is also demonstrated.     

A Stronger Model of Dynamic Programming Algorithms

We define a formal model of dynamic programming algorithms which we call Prioritized Branching Programs (pBP). Our model is a generalization of the BT model of Alekhnovich et al. (IEEE Conference on Computational Complexity, pp. 308–322, 2005), which is in turn a generalization of the priority algorithms model of Borodin, Nielson and Rackoff. One of the distinguishing features of these models is that they not only capture large classes of algorithms generally considered to be greedy, backtracking or dynamic programming algorithms, but they also allow characterizations of their limitations. Hence they give meaning to the statement that a given problem can or cannot be solved by dynamic programming. After defining the model, we prove three main results: (i) that certain types of natural restrictions of our seemingly more powerful model can be simulated by the BT model; (ii) that in general our model is stronger than the BT model—a fact which is witnessed by the classical shortest paths problem; (iii) that our model has very real limitations, namely that bipartite matching cannot be efficiently computed in it, hence suggesting that there are problems that can be solved efficiently by network flow algorithms and by simple linear programming that cannot be solved by natural dynamic programming approaches.