Synthesis and self-association in aqueous media of poly(ethylene oxide)/poly(ethyl glycidyl carbamate) amphiphilic block copolymers

New temperature sensitive AB, ABA, and BAB amphiphilic block copolymers consisting of hydrophilic poly(ethylene oxide) and hydrophobic poly(ethyl glycidyl carbamate) blocks were synthesized by anionic polymerization followed by chemical modification reactions. The self-association of the block copolymers in aqueous media was studied by UV-vis spectroscopy and dynamic and static light scattering. The obtained block copolymers spontaneously form micelles in aqueous media. The critical micellization concentration varied from 0.5 to 4 g/L depending on the copolymer architecture and composition. The influence of the temperature upon the self-association of the block copolymers was investigated. The increase of temperature did not affect the value of the critical micellization concentration, but led to the formation of better defined micelles with narrow size distribution.     

A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half.     

Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Alternating-time temporal logic (ATL) is a modal logic that allows to reason about agents’ abilities in game-like scenarios. Semantic variants of ATL are usually built upon different assumptions about the kind of game that is played, including capabilities of agents (perfect vs. imperfect information, perfect vs. imperfect memory, etc.). ATL has been studied extensively in previous years; however, most of the research focused on model checking. Studies of other decision problems (e.g., satisfiability) and formal meta-properties of the logic (like axiomatization or expressivity) have been relatively scarce, and mostly limited to the basic variant of ATL where agents possess perfect information and perfect memory. In particular, a comparison between different semantic variants of the logic is largely left untouched. In this paper, we show that different semantics of ability in ATL give rise to different validity sets. The issue is important for several reasons. First, many logicians identify a logic with its set of true sentences. As a consequence, we prove that different notions of ability induce different strategic logics. Secondly, we show that different concepts of ability induce different general properties of games. Thirdly, the study can be seen as the first systematic step towards satisfiability-checking algorithms for ATL with imperfect information. We introduce sophisticated unfoldings of models and prove invariance results that are an important technical contribution to formal analysis of strategic logics.     

MapReduce approach to relational influence propagation in complex networks

The relational label propagation problem for large data sets using MapReduce programming model was considered in the paper. The method we propose estimates class probability in relational domain in the networks. The method was examined on large real telecommunication data set. The results indicated that it could be used successfully to classify networks’ nodes and, thanks to that, new offerings or tariffs might be proposed to customers who belong to other providers. Moreover, basic properties of relational label propagation were examined and reported.     

Electro-oxidation of methanol on Pt-Rh alloys

Methanol adsorption and electro-oxidation on Pt-Rh alloys have been studied in aqueous 0.5 M H₂SO₄ for a broad range of alloy surface composition including the pure Pt and Rh metals. Adsorption results have been compared with equivalent data obtained for CO and CO₂ adsorption on these alloys. Current densities of continuous methanol oxidation on Pt, Rh and a Pt-Rh alloy with optimum surface molar fraction of Rh have been measured.Although on the pure Pt and Rh metals the methanol adsorption products exhibit similar energetic stability, as judged from the peak potential of electro-desorption, on the Pt-Rh alloys, there is a lowering of the stability. Similar behavior is observed for the CO and CO₂ adsorption products, however, the lowering for methanol is much less than for CO and CO₂. In the case of methanol, the maximum lowering is obtained for a surface molar fraction of Rh equal to ca. 0.65 and it is the same alloy surface composition that results in maximum lowering of the stability of the CO₂ adsorption products, but not of the CO adsorption products (optimal fraction of Rh equal ca. 0.10). Structural similarity of the methanol and the CO₂ adsorption products finds support in similar values of the electrons-per-site parameter obtained.Pt-Rh alloys show insufficient electrode potential improvement over Pt in continuous methanol electro-oxidation due to the susceptibility of Rh to strong poisoning by the methanol adsorption products, which switches off the bi-functional mechanism of methanol electro-oxidation on this alloy. The presence of Rh in the alloy with Pt additionally strongly lowers the methanol electro-oxidation turnover rate of the Pt component.     

An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping

Journal of Scheduling - Rapid growth of demand for remote computational power, along with high energy costs and infrastructure limits, has led to treating power usage as a primary constraint in...     

XPS spectra of the AFe4Al8 compounds with A=Y, Sc, U and Th

The XPS electronic structures of the AFe₄Al₈ (A=Sc, Y, U, Th) single crystals were measured. The valence band of UFe₄Al₈ exhibits domination of the U 5f states at the Fermi level, while for the other AFe₄Al₈ compounds the valence states are shifted by 0.5 eV toward higher binding energy. The multiplet structure of the U 4f and Th 4f states was analyzed in comparison with the U 4f states of U₃Ge₅ and UNiSb₂.     

INSIGMA: an intelligent transportation system for urban mobility enhancement

Intelligent Transportation Systems (ITS) aim to improve safety, mobility and environmental performance of road transport. The INSIGMA project provides a fresh look at the possible innovations in this field, by enhancing the functionality and accuracy of ITS in urban environments. This paper describes the architecture, sensors, processing algorithms, output modules and advantages of the developed system. A comparison of existing ITS systems has been provided as background. Special attention has been given to performance and privacy issues, as the system includes social aspects such as location monitoring.     

Summary Maps for Lifelong Visual Localization

Robots that use vision for localization need to handle environments that are subject to seasonal and structural change, and operate under changing lighting and weather conditions. We present a framework for lifelong localization and mapping designed to provide robust and metrically accurate online localization in these kinds of changing environments. Our system iterates between offline map building, map summary, and online localization. The offline mapping fuses data from multiple visually varied datasets, thus dealing with changing environments by incorporating new information. Before passing these data to the online localization system, the map is summarized, selecting only the landmarks that are deemed useful for localization. This Summary Map enables online localization that is accurate and robust to the variation of visual information in natural environments while still being computationally efficient. We present a number of summary policies for selecting useful features for localization from the multisession map, and we explore the tradeoff between localization performance and computational complexity. The system is evaluated on 77 recordings, with a total length of 30 kilometers, collected outdoors over 16 months. These datasets cover all seasons, various times of day, and changing weather such as sunshine, rain, fog, and snow. We show that it is possible to build consistent maps that span data collected over an entire year, and cover day‐to‐night transitions. Simple statistics computed on landmark observations are enough to produce a Summary Map that enables robust and accurate localization over a wide range of seasonal, lighting, and weather conditions.