Bacteria-Responsive Self-Assembly of Antimicrobial Peptide Nanonets for Trap-and-Kill of Antibiotic-Resistant Strains

Bacterial trapping using nanonets is a ubiquitous immune defense mechanism against infectious microbes. These nanonets can entrap microbial cells, effectively arresting their dissemination and rendering them more vulnerable to locally secreted microbicides. Inspired by this evolutionarily conserved anti-infective strategy, a series of 15 to 16 residue-long synthetic β-hairpin peptides is herein constructed with the ability to self-assemble into nanonets in response to the presence of bacteria, enabling spatiotemporal control over microbial killing. Using amyloid-specific K114 assay and confocal microscopy, the membrane components lipoteichoic acid and lipopolysaccharide are shown to play a major role in determining the amyloid-nucleating capacity as triggered by Gram-positive and Gram-negative bacteria respectively. These nanonets displayed both trapping and killing functionalities, hence offering a direct improvement from the trap-only biomimetics in literature. By substituting a single turn residue of the non-amyloidogenic BTT1 peptide, the nanonet-forming BTT1-3A analog is produced with comparable antimicrobial potency. With the same sequence manipulation approach, BTT2-4A analog modified from BTT2 peptide showed improved antimicrobial potency against colistin-resistant clinical isolates. The peptide nanonets also demonstrated robust stability against proteolytic degradation, and promising in vivo efficacy and biosafety profile. Overall, these bacteria-responsive peptide nanonets are promising clinical anti-infective alternatives for circumventing antibiotic resistance.     

JPEG Pleno: Providing representation interoperability for holographic applications and devices

Guaranteeing interoperability between devices and applications is the core role of standards organizations. Since its first JPEG standard in 1992, the Joint Photographic Experts Group (JPEG) has published several image coding standards that have been successful in a plethora of imaging markets. Recently, these markets have become subject to potentially disruptive innovations owing to the rise of new imaging modalities such as light fields, point clouds, and holography. These so‐called plenoptic modalities hold the promise of facilitating a more efficient and complete representation of 3D scenes when compared to classic 2D modalities. However, due to the heterogeneity of plenoptic products that will hit the market, serious interoperability concerns have arisen. In this paper, we particularly focus on the holographic modality and outline how the JPEG committee has addressed these tremendous challenges. We discuss the main use cases and provide a preliminary list of requirements. In addition, based on the discussion of real‐valued and complex data representations, we elaborate on potential coding technologies that range from approaches utilizing classical 2D coding technologies to holographic content‐aware coding solutions. Finally, we address the problem of visual quality assessment of holographic data covering both visual quality metrics and subjective assessment methodologies.     

CO2 emission trading within the European Union and Annex B countries: the cement industry case

The cement industry is the third largest carbon emitting industrial sector in the EU. This article presents the foreseeable technological evolution of the cement industry under business as usual circumstances, and examines the effects on the sector of carbon trading. For those purposes a global dynamic simulation model of the cement industry (CEMSIM) has been developed. The model is composed of a series of interconnected modules on cement consumption and production, international trade and capacity planning. This study quantifies the benefits achieved from emission trading in different markets (EU15, EU27 and Annex B), derived both from the revenues of emission trading, and from the lower compliance costs. The magnitude of the potential carbon leakage effect is also assessed.     

Free convection performance of circular cavities having two active curved vertical sides and two inactive curved horizontal sides

A detailed review of the archival reveals that the heat transfer and fluid flow characteristics of circular cavities have not been investigated so far and of course their physical features are not understood. A prominent application of these cavities arises in the miniaturized packaging of electronic components that are subject to strict constraints. This paper addresses primarily steady-state laminar natural convection of air in a circular cavity of diameter H inscribed in a square cavity of side H where the corresponding sides are in contact at four points. A third cavity, an arc–square cavity whose shape lies between the square and circular cavity shapes is included in the analysis. The finite volume method is used to perform the numerical simulations. The methodology takes into account the second-order-accurate QUICK scheme for the discretization of the convective term, whereas the pressure–velocity coupling is handled with the SIMPLE scheme. Since the air is not assumed a Boussinesq gas, it was decided to take all thermophysical properties as temperature-dependent. In the end, it has been demonstrated that the circular cavity possesses a superior balance between heat transfer enhancement and size in cross-section area in comparison with the standard square cavity. The side of the square cavity is similar to the diameter of the circular cavity.     

Study of the glucide fraction in ropy wines

Gas chromatography was used to study the polysaccharides present in samples that exhibited significant microbially induced viscosity values. Alterations in the media considered were related to the percentage glucose content and the total polysaccharide content.     

An Evolutionary Method for Synthesizing Low-Sensitivity Lossless Matching Networks

Whereas the present practice of designing matching networks for antennas is limited to conventional topologies, requiring a significant amount of domain knowledge, evolutionary algorithms can be used for automatically identifying unconventional designs that are more effective than would otherwise be developed. In this work, an automatic method to design lossless matching networks driven by an evolutionary algorithm (EA) that considers the sensitivities of the network parameters during the synthesis process is presented. To this end, a closed-form expression for the transducer power gain (TPG) sensitivity with respect to the component values is employed in such a way that the effects of the components tolerance on the matching network performance can easily be quantified. A 3D data structure based on the adjacency matrix is conveniently used to represent any type of network topologies. The proposed EA employs a novel set of topology variation operators, tailored for changing the circuit topology, and an association step, with the aim of reducing the number of nodes of the matching circuit. The efficiency of the proposed EA is tested in the synthesis of an impedance matching network for a VHF monopole whip antenna. This study’s results indicate a matching bandwidth improvement, a more uniformly distributed TPG along the operation frequency band and a more stable TPG regarding the components tolerance compared to the results obtained by previous approaches.     

Ligand‐Free Synthesis of Aluminum‐Doped Zinc Oxide Nanocrystals and their Use as Optical Spacers in Color‐Tuned Highly Efficient Organic Solar Cells

The color of polymer solar cells using an opaque electrode is given by the reflected light, which depends on the composition and thickness of each layer of the device. Metal‐oxide‐based optical spacers are intensively studied in polymer solar cells aiming to optimize the light absorption. However, the low conductivity of materials such as ZnO and TiO₂ limits the thickness of such optical spacers to tenths of nanometers. A novel synthesis route of cluster‐free Al‐doped ZnO (AZO) nanocrystals (NCs) is presented for solution processing of highly conductive layers without the need of temperature annealing, including thick optical spacers on top of polymer blends. The processing of 80 nm thick optical spacers based on AZO nanocrystal solutions on top of 200 nm thick polymer blend layer is demonstrated leading to improved photocurrent density of 17% compared to solar cells using standard active layers of 90 nm in combination with thin ZnO‐based optical spacers. These AZO NCs also open new opportunities for the processing of high‐efficiency color tuned solar cells. For the first time, it is shown that applying solution‐processed thick optical spacer with polymer blends of different thicknesses can process solar cells of similar efficiency over 7% but of different colors.     

Real-Time Receiver Clock Jump Detection for Code Absolute Positioning with Kalman Filter

In global navigation satellite systems (GNSS) navigation the receiver and satellite clocks play a key role. The receivers are usually equipped with inaccurate quartz clocks, which experiment large drift relative to system time and consequently offset growing very fast; receiver manufactures bound the magnitude of the receiver clock offset to prevent it becomes too large and the actual bounding procedures vary from one manufacturer to another. The most common approach consists of introducing discrete jumps when the offset exceeds a threshold (usually 1 ms). This method is common in low-cost GNSS receivers and influences several applications as differential positioning, cycle-slip detection, precise point positioning technique, absolute positioning with Kalman filter. In this work some techniques to detect and account for millisecond clock jump, suitable for code positioning of a single receiver with Kalman filter, are proposed. Two deterministic algorithms to detect receiver clock jumps are shown: in measurement and parameter domain. The technique in measurement domain uses current pseudorange measurements compared with pseudorange and Doppler measurements at previous epoch; the technique in parameter domain compares current and previous least squares estimations of receiver clock bias, considering the clock drift. Two different approaches are described to account for the clock jumps, once detected, a deterministic one, consisting of fixing the pseudorange discontinuities, and a statistic one, consisting of suitably varying the Kalman filter settings. A static GNSS data set is processed with and without the proposed algorithms to demonstrate their efficiency.     

Compressive Creep of SiC-Whisker-Reinforced Al2O3

Compressive creep of SiC-whisker-reinforced Al₂O₃ composites (0, 5, 15, and 25 wt% SiC) was measured in the temperature range of 1300° to 1500°C in air and argon. The creep resistance increased with increasing whisker concentration. The results indicated that the whiskers degraded in air, increasing strain rates compared to those in argon. Stress exponents between 1.0 and 2.0 and an activation energy of 620 ± 100 kJ/mol were measured. Transmission electron microscopy observations indicated that cavitation was minimal and that the deformed composites had the same dislocation structure as did the as-received samples.     

Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container

A Packing problem consists in the best arrangement of several objects inside a bounded area named as the container. This arrangement must fulfill with technological constraints, for example, objects should not be overlapping. Some packing models for circular objects are typically formulated as non-convex optimization problems; where the continuous variables are the coordinates of the objects, so they are limited to not finding optimal solutions. Due to the combinatorial nature in the arrangement of such objects, heuristic methods are being used extensively which combine methods of global search and methods of local exhaustive search of local minima or their approximations. In this paper, we will address the packing problem for non-congruent (different size) circles with the binary version of the monkey algorithm which incorporates a cooperation process and a greedy strategy. We use a rectangular grid for covering the container. Every node in the grid represent potential positions for a circle. In this sense, binary monkey algorithm for the knapsack problem, can be used to solve de 0–1 approximate packing problem for non-congruet circles. The binary monkey problem uses two additional processes of the original monkey algorithm, these two processes are a greedy process and a cooperation processes.