Fabrication of hybrid proton-exchange membranes using a brandnew high temperature ionic liquid as charge transporting and clay modifier

The search for more compatibility between ionic liquids (ILs) and polymer matrices in proton-exchange membrane fuel cells (PEMFCs) is one of the ways in which IL leaking from proton-exchange membranes could be minimized. In this work, it is presented the synthesis of an aromatic high temperature ionic liquid (HTIL), which, incorporated into an aromatic matrix such as sulfonated polyether ether ketone (sPEEK), is expected to diminish the IL leaking that normally affects PEMFC. Phenylethylammonium trifluoromethane sulfonate (PhetaTfO) was successfully synthesized and characterized. Its melting point of 88°C makes it to classify as a HTIL and it was employed as modifier of natural Montmorillonite, forming the phenylethylammonium intercalated montmorillonite (MmtPheta) and thus, ternary membranes containing PhetaTfO, MmtPheta, and sPEEK were prepared and characterized. Immersion tests demonstrated a higher compatibility of PhetaTfO with matrix when compared to the reference DemaTfO, which was reflected in up to 30% lower IL loss by the synthesized IL than the DemaTfO; X-rays diffraction (XRD) patterns demonstrated that the modified clay was properly dispersed inside the membranes, while dynamic mechanical analyses (DMA) results indicated a strong plasticizer effect along the increase of PhetaTfO content inside the membrane, while at the same time, the conductivity increased in an exponential manner, which permitted to identify an empiric exponential equation to evaluate the effect of concentration on ionic conductivity. The maximum conductivity obtained at IL concentrations of around 38 wt% was 0.2 mS/cm. It could expect high ionic conductivities of 10 mS/cm when the concentration of this IL is 60%; nevertheless, in order to achieve that, crosslinking treatments should be done to give the membranes enough mechanical resistance.     

The effect of adding devulcanized rubber on the thermomechanical properties of recycled polypropylene

This work aims to investigate the effect of adding vulcanized or partially devulcanized rubbers on recycled polypropylene (PPr), considering thermomechanical and morphological properties. The study proposes to better understand how structural changes underwent by rubber (after the devulcanization) contributed to improving the mechanical properties of the PPr. The PPr/rubber blends were prepared by a co-rotating twin-screw extruder and then were injected. The blends composed of the most devulcanized rubbers by microwaves with refined microstructure showed higher values of elongation at break and toughness. Data showed that the devulcanization process applied to the rubber interfered positively in its adhesion to the PPr. Data from dynamic mechanical analysis and atomic force microscopy indicated that the most devulcanized rubbers presented an interface more connected to PPr. These chemical interactions possibly impacted the mechanical properties of the PPr. Moreover, dilatation processes favored the fracture mechanisms of the PPr when rubber was added to it.     

When a Tritrophic Interaction Goes Wrong to the Third Level: Xanthoxylin From Trees Causes the Honeybee Larval Mortality in Colonies Affected by the River Disease

The “River Disease” (RD), a disorder impacting honeybee colonies located close to waterways with abundant riparian vegetation (including Sebastiania schottiana, Euphorbiaceae), kills newly hatched larvae. Forager bees from RD-affected colonies collect honeydew excretions from Epormenis cestri (Hemiptera: Flatidae), a planthopper feeding on trees of S. schottiana. First-instar honeybee larvae fed with this honeydew died. Thus, we postulated that the nectars of RD-affected colonies had a natural toxin coming from either E. cestri or S. schottiana. An untargeted metabolomics characterization of fresh nectars extracts from colonies with and without RD allowed to pinpoint xanthoxylin as one of the chemicals present in higher amounts in nectar from RD-affected colonies than in nectars from healthy colonies. Besides, xanthoxylin was also found in the aerial parts of S. schottiana and the honeydew excreted by E. cestri feeding on this tree. A larva feeding assay where xanthoxylin-enriched diets were offered to 1^st instar larvae showed that larvae died in the same proportion as larvae did when offered enriched diets with nectars from RD-colonies. These findings demonstrate that a xenobiotic can mimic the RD syndrome in honeybee larvae and provide evidence of an interspecific flow of xanthoxylin among three trophic levels. Further, our results give information that can be considered when implementing measures to control this honeybee disease.

     

Predicting teamwork results from social network analysis

Modelling students' behaviours has reached a status that can only be overcome by improving the ability of predicting the results on teamwork. Indeed, teamwork is an important piece on the learning process, but understanding their mechanisms and predicting the results achieved is far from being solved by traditional classifiers. In this paper, we address the problem of predicting teamwork results, and propose a recommender system that suggests new teams, in the context of a given curricular unit. Any student, who is looking for a team, may use the system; in particular, he may ask for the best team to join, either considering all available colleagues or just the set of his previous teammates. Our system makes use of social network analysis and classification methods as the algorithmic core of the decision‐making process. System evaluation is presented through a set of experimental results, which report the performance of social network analysis and classification algorithms over real datasets.     

Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

A dynamic overproduce-and-choose strategy for the selection of classifier ensembles

The overproduce-and-choose strategy, which is divided into the overproduction and selection phases, has traditionally focused on finding the most accurate subset of classifiers at the selection phase, and using it to predict the class of all the samples in the test data set. It is therefore, a static classifier ensemble selection strategy. In this paper, we propose a dynamic overproduce-and-choose strategy which combines optimization and dynamic selection in a two-level selection phase to allow the selection of the most confident subset of classifiers to label each test sample individually. The optimization level is intended to generate a population of highly accurate candidate classifier ensembles, while the dynamic selection level applies measures of confidence to reveal the candidate ensemble with the highest degree of confidence in the current decision. Experimental results conducted to compare the proposed method to a static overproduce-and-choose strategy and a classical dynamic classifier selection approach demonstrate that our method outperforms both these selection-based methods, and is also more efficient in terms of performance than combining the decisions of all classifiers in the initial pool.     

LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.