Diffuse color patterning using blended electrochromic polymers for proof‐of‐concept adaptive camouflage plaques

A study using three different pairs of electrochromic polymers (ECPs) synthesized onto plaques by means of a modified vapor phase polymerization (VPP) technique is presented. Restriction of the respective polymerization times, allowed both faster and slower polymerizing monomers to be controlled, and produced blended plaques with visually diffuse interfaces. The ECPs within the blended plaques retain their individual electrochromic behavior and when encapsulated into an electrochromic device, show outstanding optical switching performance with little degradation evident over 10,000 cycles, coupled with a switching time of the order of 1 second. Blends also allow multiple diffuse color changes within an electrochromic device, due to the difference in oxidation potentials of the individual ECPs, making them candidates for adaptive camouflage use. © 2015 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2015 , 132, 42158.     

Design of Trehalose-Based Amide/Sulfonamide C-type Lectin Receptor Signaling Compounds

Mincle agonists have been shown to induce inflammatory cytokine production, such as tumor necrosis factor-alpha (TNF) and promote the development of a Th1/Th17 immune response that might be crucial to development of effective vaccination against pathogens such as Mycobacterium tuberculosis. As an expansion of our previous work, a library of 6,6′-amide and sulfonamide α,α-d -trehalose compounds with various substituents on the aromatic ring was synthesized efficiently in good to excellent yields. These compounds were evaluated for their ability to activate the human C-type lectin receptor Mincle by the induction of cytokines from human peripheral blood mononuclear cells. A preliminary structure–activity relationship (SAR) of these novel trehalose diamides and sulfonamides revealed that aryl amide-linked trehalose compounds demonstrated improved activity and relatively high potency cytokine production compared to the Mincle ligand trehalose dibehenate adjuvant (TDB) and the natural ligand trehalose dimycolate (TDM) inducing dose-dependent and human-Mincle-specific stimulation in a HEK reporter cell line.     

Formulation of a ceramic ink for a wide-array drop-on-demand ink-jet printer

This paper describes the methodology for simulating a reprographic ink with a ceramic ink based on a commercially available zirconia powder for direct ceramic ink-jet printing. Of over-riding importance was matching viscosity and this was tested systematically by using a mineral oil–hexane binary system. Of secondary importance was adjustment of the pressure defect behind the nozzle to compensate for small differences in surface tension. The inks tested in the wide array print-head were based on low electrical conductivity liquids to avoid damage to the electroding system. The organic binder for the zirconia ink was paraffin wax and the dispersant was a hydroxystearic acid based polyester.     

Toughening of Dental Porcelain by Tetragonal ZrO2 Additions

The effect on mechanical behavior of ZrO₂ additions to a dental porcelain was investigated. The ZrO₂ was introduced into the glassy matrix phase of the porcelain by refritting the all-glass porcelain constituent. X-ray diffraction indicated that a sizeable fraction of the ZrO₂ was retained in the tetragonal form after the porcelain was fired. Zirconia additions to the porcelain produced substantial improvements in fracture toughness, strength, and thermal shock resistance.     

An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

A searching algorithm is presented for determining which members of a set of n points in an N dimensional space lie inside a prescribed space subregion. The algorithm is then extended to handle finite size objects as well as points. In this form it is capable of solving problems such as that of finding the objects from a given set which intersect with a prescribed object. The suitability of the algorithm is demonstrated for the problem of three dimensional unstructured mesh generation using the advancing front method.     

Conditionals and conditional probability.

The authors report 3 experiments in which participants were invited to judge the probability of statements of the form if p then q given frequency information about the cases pq, p?q, ?pq, and ?p?q (where ? = not). Three hypotheses were compared: (a) that people equate the probability with that of the material conditional, 1 - P(p?q); (b) that people assign the conditional probability, P(q/p); and (c) that people assign the conjunctive probability P(pq). The experimental evidence allowed rejection of the 1st hypothesis but provided some support for the 2nd and 3rd hypotheses. Individual difference analyses showed that half of the participants used conditional probability and that most of the remaining participants used conjunctive probability as the basis of their judgments. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Optimal management of logistic activities in multi-site environments

The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined production/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude of the associated transportation costs and the good chance of getting large savings on such expenses. This paper first develops an exact MILP mathematical formulation for the multiple vehicle time-window-constrained pickup and delivery (MVPDPTW) problem. The approach is able to account for many-to-many transportation requests, pure pickup and delivery tasks, heterogeneous vehicles and multiple depots. Optimal solutions for a variety of benchmark problems with cluster/random distributions of pickup and delivery locations and limited sizes in terms of customer requests and vehicles have been discovered. However, the computational cost exponentially grows with the number of requests. For large-scale m-PDPTW problems, a local search improvement algorithm steadily providing a better solution through two evolutionary steps is also presented. A neighborhood structure around the starting solution is generated by first allowing multiple request exchanges among nearby trips and then permitting the reordering of nodes on every individual route. If a better set of routes is found, both steps are repeated until no improved solution is discovered. Compact MILP mathematical formulations for both sub-problems have been developed and solved through an efficient branch-and-bound algorithm. A significant number of large-scale m-PDPTW benchmark problems, some of them including up to 100 transportation requests, were successfully solved in reasonable CPU times.