GATA3 Expression Is Decreased in Psoriasis and during Epidermal Regeneration; Induction by Narrow-Band UVB and IL-4

Psoriasis is characterized by hyperproliferation of keratinocytes and by infiltration of activated Th1 and Th17 cells in the (epi)dermis. By expression microarray, we previously found the GATA3 transcription factor significantly downregulated in lesional psoriatic skin. Since GATA3 serves as a key switch in both epidermal and T helper cell differentiation, we investigated its function in psoriasis. Because psoriatic skin inflammation shares many characteristics of epidermal regeneration during wound healing, we also studied GATA3 expression under such conditions

Twinning in MAPbI3 at room temperature uncovered through Laue neutron diffraction

The crystal structure of MAPbI3, the signature compound of the hybrid halide perovskites, at room temperature has been a reason for debate and confusion in the past. Part of this confusion may be due to twinning as the material bears a phase transition just above room temperature, which follows a direct group–subgroup relationship and is prone to twinning. Using neutron Laue diffraction, we illustrate the nature of twinning in the room temperature structure of MAPbI3 and explain its origins from a group-theoretical point-of-view

[Sb₇Se₈Br₂]³⁺ and [Sb₁₃Se₁₆Br₂]⁵⁺ - Double and Quadruple Spiro Cubanes from Ionic Liquids

The reaction of antimony and selenium in the bromine-rich Lewis acidic ionic liquid [BMIm] Br center dot 4.7AlBr(3) (BMIm: 1-butyl3- methylimidazolium) in the presence of a small amount of NbCl5 at 160 degrees C yielded dark-red crystals of [Sb7Se8Br2][ AlX4](3). For X = Cl0.15(1)Br0.85(1), the compound is isostructural to [Sb7S8Br2][AlCl4](3) [ P2(1)2(1)2(1), alpha = 12.5132(5) angstrom, b = 17.7394(6) angstrom, c = 18.3013(6) angstrom]. For a higher chlorine content, X = Cl-0.58(1) Br-0.42(1), a slightly disordered variant with a bisected unit cell is found [P2(1)2(1)2, alpha = 12.3757(3) angstrom, b = 17.4116(5) angstrom, c = 9.0420(2) angstrom]. The [Sb7Se8Br2](3+) heteropolycation (C-2 symmetry) is a spiro double-cubane with an antimony atom on the shared corner. From this distorted octahedrally coordinated central atom, tricoordinate selenium and antimony atoms alternate in the bonding sequence. The terminal antimony atoms each bind to a bromine atom. Quantum chemical calculations confirm polar covalent Sb-Sebonding within the cubes and indicate three-center, fourelectron bonds for the six-coordinate spiro atoms. The calculated charge distribution reflects the electron-donor role of the antimony atoms. The use of a chlorine-rich ionic liquid resulted in the formation of triclinic [Sb13Se16Br2][AlX4](5) with X = Cl0.80(1)Br0.20(1) [P1, alpha = 9.0842(5) angstrom, b = 19.607(1) angstrom, c = 21.511(1) angstrom, alpha = 64.116(6)degrees, beta = 79.768(7)degrees, gamma = 88.499(7)degrees]. The cationic cluster [Sb13Se16Br2](5+) is a bromine-terminated spiro quadruple-cubane. This 31 atom concatenation of four cubes is assumed to be the largest known discrete main group polycation. A similar reaction in a chloride-free system yielded [Sb7Se8Br2][Sb13Se16Br2][AlBr4](8). In its monoclinic structure [P2/c, alpha = 27.214(5) angstrom, b = 9.383(2) angstrom, c = 22.917(4) angstrom, beta = 101.68(1)degrees], the two types of polycations alternate in layers along the a axis. In the series [Sb4+3nSe4+4nBr2]((2+n)+), these cations are the members with n = 1 and 3

Ionothermal Synthesis, Structure, and Bonding of the Catena-Heteropolycation 1∞[Sb₂Se₂]⁺

The reaction of antimony and selenium in the Lewis-acidic ionic liquid 1-butyl-3-methyl-imidazolium tetrachloridoaluminate, [BMIm]Cl center dot 4.7AlCl(3), yielded dark-red crystals of [Sb2Se2]AlCl4. The formation starts above 160 degrees C; at about 190 degrees C, irreversible decomposition takes place. The compound crystallizes in the triclinic space group P (1) over bar with a = 919.39(2) pm, b = 1137.92(3) pm, c = 1152.30(3) pm, alpha = 68.047(1)degrees, beta = 78.115(1)degrees, gamma = 72.530(1)degrees, and Z = 4. The structure is similar to that of [Sb2Te2] AlCl4 but has only half the number of crystallographically independent atoms. Polycationic chains (1)(infinity)[Sb2Se2](+) form a pseudo-hexagonal arrangement along [01 (1) over bar], which is interlaced by tetrahedral AlCl(4)(-)groups. The catena-heteropolycation (1)(infinity)[Sb2Se2](+) is a sequence of three different four-membered [Sb2Se2] rings. The chemical bonding scheme, established from the topological analysis of the real-space bonding indicator ELI-D, includes significantly polar covalent bonding in four-member rings withinthepolycation. Theringsareconnectedintoaninfinitechainbyhomonuclear non-polar Sb-Sb bonds and highly polar Sb-Se bonds. Half of the selenium atoms are three-bonded

On the Nitridation of Zn2GeO4

ZnGeN 2 as exemplary compound for II IV N 2 materials allows fascinating insights into this class of materials that can be thought of as earth abundant alternative to wurtzite type III V semiconductors. A classical route to achieving ZnGeN 2 is through the ammonolysis reaction of Zn 2 GeO 4 at higher temperatures. Using a combination of X ray and neutron powder diffraction together with chemical analyses, a systematic study of the influences of time and temperature on this reaction, yielding in the formation of zinc germanium oxide nitrides in a wurtzite type structure with variable elemental compositions is presented. This further allows to identify the underlying reaction mechanism of this ammonolysis reactio

A Segmented Bloom Filter Algorithm For Efficient Predictors

Bloom Filters are a technique to reduce the effects of conflicts/ interference in hash table-like structures. Conventional hash tables store information in a single location which is susceptible to destructive interference through hash conflicts. A Bloom Filter uses multiple hash functions to store information in several locations, and recombines the information through some voting mechanism. Many microarchitectural predictors use simple single-index hash tables to make binary 0/1 predictions, and Bloom Filters help improve predictor accuracy. However, implementing a true Bloom Filter requires k hash functions, which in turn implies a k-ported hash table, or k sequential accesses. Unfortunately, the area of a hardware table increases quadratically with the port count, increasing costs of area, latency and power consumption. We propose a simple but elegant modification to the Bloom Filter algorithm that uses banking combined with special hash functions that guarantee all hash indexes fall into non-conflicting banks. We evaluate several applications of our Banked Bloom Filter (BBF) prediction in processors: BBF branch prediction, BBF load hit/miss prediction, and BBF last-tag prediction. We show that BBF predictors can provide accurate predictions with substantially less cost than previous techniques. © 2008 IEEE.123130The 1st JILP Championship Branch Prediction Competition (CBP-1), , http://www.jilp.org/cbpBloom, B.H., Space/Time Tradeoffs in Hash Coding with Allowable Errors (1970) Communications of the Association for Computing Machinery, 13 (7), pp. 422-426. , JulyBratbergsengen, K., Hashing Methods and Relational Algebra Operations (1984) Proc. of 10th Int. Conf. on Very Large Databases, pp. 323-333. , AugustDean, J., Ghemawar, S., MapReduce: Simplified Data Processing on Large Clusters (2004) OSDI 2004, pp. 137-150. , Usenix AssocErnst, D., Austin, T., Efficient Dynamic Scheduling Through Tag Elimination (2002) Proc. of 29th Int. Symp. on Comp. Arch, pp. 37-45. , Anchorage, AK, USA, MayFan, L., Cao, P., Almeida, J.M., Broder, A.Z., Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol (1998) Proc. of ACM SIG-COMM Conf. on Applications, Technologies, Architectures and Protocols for Computer Communication, pp. 254-265. , Vancouver, Canada, AugustFields, B., Rubin, S., Bodík, R., Focusing Processor Policies via Critical-Path Prediction (2001) Proc. of 28th Int. Symp. on Comp. Arch, pp. 74-85. , Göteborg, Sweden, JuneGuthaus, M.R., Ringenberg, J.S., Ernst, D., Austin, T.M., Mudge, T., Brown, R.B., MiBench: A Free, Commerically Representative Embedded Benchmark Suite (2001) Proc. of 4th Workshop on Workload Characterization, pp. 83-94. , Austin, TX, USA, DecemberJacobson, E., Rotenberg, E., Smith, J.E., Assigning Confidence to Conditional Branch Predictions (1996) Proc. of 29th Int. Symp. on Microarchitecture, pp. 142-152. , Paris, France, DecemberLarson, E., Chatterjee, S., Austin, T., MASE: A Novel Infrastructure for Detailed Microarchitectural Modeling (2001) Proc. of 2001 Int. Symp. on Performance Analysis of Systems and Software, pp. 1-9. , Tucson, AZ, USA, NovemberLee, C., Potkonjak, M., Mangione-Smith, W.H., MediaBench: A Tool for Evaluating and Synthesizing Multimedia and Communication Systems (1997) Proc. of 30th Int. Symp. on Microarchitecture, pp. 330-335. , Research Triangle Park, NC, USA, DecemberLoh, G.H., Exploiting Data-Width Locality to Increase Superscalar Execution Bandwidth (2002) Proc. of 35th Int. Symp. on Microarchitecture, pp. 395-405. , Istanbul, Turkey, NovemberLoh, G.H., Deconstructing the Frankenpredictor for Implementable Branch Predictors (2005) Journal of Instruction Level Parallelism, 7, pp. 1-10McFarling, S., (1993) Combining Branch Predictors, p. 36. , TN, Compaq Computer Corporation Western Research Laboratory, JuneMichaud, P., PPM-like, A., Tag-Based Predictor (2005) Journal of Instruction Level Parallelism, 7, pp. 1-10Michaud, P., Seznec, A., Uhlig, R., Trading Conflict and Capacity Aliasing in Conditional Branch Predictors (1997) Proc. of 24th Int. Symp. on Comp. Arch, pp. 292-303. , JunePeir, J.-K., Lai, S.-C., Lu, S.-L., Stark, J., Lai, K., Bloom Filtering Cache Misses for Accurate Data Speculation and Prefetching (2002) Proc. of 16th Int. Conf. on Supercomputing, pp. 189-198. , JunePerelman, E., Hamerly, G., Calder, B., Picking Statistically Valid and Early Simulation Points (2004) Proc. of 2003 Int. Conf. on Par. Arch. and Comp. Techniques, pp. 244-255. , SeptemberRhea, S.C., Kubiatowicz, J., Probabilistic Location and Routing (2002) Proc. of 21st Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), pp. 1248-1257. , JuneRoth, A., Store Vulnerability Window (SVW): Re-Execution Filtering for Enhanced Load Optimization (2005) Proc. of 32nd Int. Symp. on Comp. Arch, pp. 458-468. , JuneSanchez, D., Yen, L., Hill, M.D., Sankaralingam, K., Implementing Signatures for Transactional Memory (2007) Proc. of 40th Int. Symp. on Microarchitecture, pp. 123-133. , Chicago, IL, DecemberSethumadhavan, S., Desikan, R., Burger, D., Moore, C.R., Keckler, S.W., Scalable Hardware Memory Disambiguation for High ILP Processors (2003) Proc. of 36th Int. Symp. on Microarchitecture, pp. 118-127. , MaySeznec, A., Analysis of the O-GEometric History Length Branch Predictor (2005) Proc. of 32nd Int. Symp. on Comp. Arch, , Madison, WI, USA, JuneYoaz, A., Erez, M., Ronen, R., Jourdan, S., Speculation Techniques for Improving Load Related Instruction Scheduling (1999) Proc. of 26th Int. Symp. on Comp. Arch, pp. 42-53. , Atlanta, GA, USA, Jun

COIN: Combinational Intelligent Networks

We introduce Combinational Intelligent Networks (COIN), a machine learning technique that targets edge inference using low-resourced FPGAs or ASICs. COIN is an improvement on LogicWiSARD, a recent weightless neural network that achieves low power, small area, and high throughput. We convert the LogicWiSARD model into a binary neural network, train it using backpropagation, and then convert it to a COIN model. As a result, COIN can achieve higher accuracy than LogicWiSARD or it can require significantly fewer hardware resources when comparing models with similar accuracies. In comparison to a BNN implementation, FINN, small and large COIN models are more energy efficient demonstrating up to 11.5x higher inferences/Joule at similar accuracy. Our tool executes the complete flow, from training to RTL. and is publicly available.info:eu-repo/semantics/acceptedVersio