Bis(azidophenyl)phosphole building block for extended π-conjugated systems

Novel bis(azidophenyl)phosphole sulfide building block 8 has been developed to give access to a plethora of phosphole-containing π-conjugated systems in a simple synthetic step. This was explored for the reaction of the two azido moieties with phenyl-, pyridyl- and thienylacetylenes, to give bis(aryltriazolyl)-extended π-systems, having either the phosphole sulfide (9) or the phosphole (10) group as central ring. These conjugated frameworks exhibit intriguing photophysical and electrochemical properties that vary with the nature of the aromatic end-group. The λ3-phospholes 10 display blue fluorescence (λem = 460–469 nm) with high quan-tum yield (ΦF = 0.134–0.309). The radical anion of pyridylsubstituted phosphole sulfide 9b was observed with UV/Vis spectroscopy. TDDFT calculations on the extended π-systems showed some variation in the shape of the HOMOs, which was found to have an effect on the extent of charge transfer, depending on the aromatic end-group. Some fine-tuning of the emission maxima was observed, albeit subtle, showing a decrease in conjugation in the order thienyl � phenyl � pyridyl. These results show that variations in the distal ends of such π-systems have a subtle but significant effect on photophysical properties.

Literal and extended use of kinship terms in documentary papryi

Kinship terms in papyrus letters do not always refer to actual relatives and so pose many problems for modern readers. But by examining all the kinship terms in six centuries of letters it is possible to discover some rules governing the use of kinship terms: in some situations they appear to be always literal, and in others they appear to be almost always extended, though a third group of contexts remains ambiguous. The rules are complex and depend on the particular kinship term involved, the date of writing, the use of names, the position of the kinship term in the letter, and the person to whom it connects the referent.

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 10^18 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.

Efficient group communication for large-scale parallel clustering

Global communication requirements and load imbalance of some parallel data mining algorithms are the major obstacles to exploit the computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication cost in iterative parallel data mining algorithms. In particular, the analysis focuses on one of the most influential and popular data mining methods, the k-means algorithm for cluster analysis. The straightforward parallel formulation of the k-means algorithm requires a global reduction operation at each iteration step, which hinders its scalability. This work studies a different parallel formulation of the algorithm where the requirement of global communication can be relaxed while still providing the exact solution of the centralised k-means algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real world distributed applications or can be induced by means of multi-dimensional binary search trees. The approach can also be extended to accommodate an approximation error which allows a further reduction of the communication costs.