Effect of backbone and end-group regioisomerism on thermomechanical properties of vanillin-based polyurethane networks

Monomer composition, geometry, cross-link density, and cross-link distribution are the primary determinants of material properties in thermosetting networks.

A Link Distribution Algorithm with Efficient Relay Node Optimization for Congestion Control in Urban Vanets

This research work develops a new algorithm i.e. Link distribution algorithm and efficient link distribution algorithm. A Link distribution algorithm is the distribution of the link to the nodes so that communication between the nodes takes place in case of any link failure whereas efficient link distribution algorithm is distribution of the packets to the nodes which has high transmission power. The technique used in Link distribution algorithm (LDA) is link establishment whenever there is any link failure happen we apply this concept which is LDA whereas the technique used in efficient link distribution algorithm (ELDA) is relay node selection the relay node is selected based upon the received signal strength ratio (RSSI) value and which node is having high RSSI value that node we allocate the link. The above algorithms can be applied wherever there is high congestion on the road due to the high congestion link failure will happen and due to the link failure emergency event occurs. Results of model achieved in a realistic state of affairs validate our theoretical deliberation and confirm the efficiency and the efficacy of our protocol by screening significant expansion in terms of busy ratio, collision rate, deviation, local density and transmission power compared to previous scheme ETSI DCC. The work has been successfully done with the help open source network simulator NS3.

How much topological structure is preserved by graph embeddings?

Graph embedding aims at learning representations of nodes in a low dimensional vector space. Good embeddings should preserve the graph topological structure. To study how much such structure can be preserved, we propose evaluation methods from four aspects: 1) How well the graph can be reconstructed based on the embeddings, 2) The divergence of the original link distribution and the embedding-derived distribution, 3) The consistency of communities discovered from the graph and embeddings, and 4) To what extent we can employ embeddings to facilitate link prediction. We find that it is insufficient to rely on the embeddings to reconstruct the original graph, to discover communities, and to predict links at a high precision. Thus, the embeddings by the state-of-the-art approaches can only preserve part of the topological structure.

Afrikaans as a complex network: The word co-occurrence network in André P. Brink’s Donkermaan in Afrikaans, Dutch and English

Language has already been approached as a system since De Saussure, and recently the theory of complex systems has been applied within Linguistics as well. Complex systems, however, can also be modelled as complex networks, and a variety of studies investigating the network structure of language have already been undertaken worldwide. The current study follows in the footsteps of overseas studies and investigates the network structure of Afrikaans by analysing a word co-occurrence network compiled from André P. Brink’s novel Donkermaan. Link distribution patterns and the small-world phenomenon are investigated and then compared to the English and Dutch translations of this novel. The current study represents the first network study of Afrikaans. Firstly, the random network model of Erdös and Rényi and the scale-free network model by Barabási and Albert are used to indicate that the link distribution patterns in a word co-occurrence network of Afrikaans are better described according to the network model of Barabási and Albert than by that of Erdös and Rényi. Furthermore, the method proposed by Humphreys and Gurney to define smallworldedness (S) was used to quantify this phenomenon for the Afrikaans, as well as English and Dutch versions of the text. With 522 ≤ S ≤ 797, it is indicated that Afrikaans, English and Dutch are all clearly small-world networks. Suggestions are also made for further research.