scholarly journals Everything is connected: network thinking in entomology

2017 ◽  
Vol 42 ◽  
pp. 1-3 ◽  
Author(s):  
Darren M. Evans ◽  
James D. J. Gilbert ◽  
Gordon R. Port
Keyword(s):  
Connected Network

scholarly journals Public Awareness: What Climate Change Scientists Should Consider

2020 ◽  
Vol 12 (20) ◽  
pp. 8369
Author(s):  
Mohammad Rahimi
Keyword(s):  
Climate Change ◽  
Social Media ◽  
Large Scale ◽  
Public Awareness ◽  
Connected Network ◽  
Multi Scale ◽  
Valuable Addition ◽  
Scientific Approach ◽  
Design Solutions ◽  
Mitigate Climate Change

In this Opinion, the importance of public awareness to design solutions to mitigate climate change issues is highlighted. A large-scale acknowledgment of the climate change consequences has great potential to build social momentum. Momentum, in turn, builds motivation and demand, which can be leveraged to develop a multi-scale strategy to tackle the issue. The pursuit of public awareness is a valuable addition to the scientific approach to addressing climate change issues. The Opinion is concluded by providing strategies on how to effectively raise public awareness on climate change-related topics through an integrated, well-connected network of mavens (e.g., scientists) and connectors (e.g., social media influencers).

Poor reading is characterized by a more connected network with wrong hubs

2021 ◽  
Vol 220 ◽  
pp. 104983
Author(s):  
Jiaqi Mao ◽  
Lanfang Liu ◽  
Kyle Perkins ◽  
Fan Cao
Keyword(s):  
Poor Reading ◽  
Connected Network

scholarly journals An Uneven Node Self-Deployment Optimization Algorithm for Maximized Coverage and Energy Balance in Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1368 ◽  
Author(s):  
Luoheng Yan ◽  
Yuyao He ◽  
Zhongmin Huangfu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Optimization Algorithm ◽  
Growth Ring ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Connected Network ◽  
Deployment Optimization

The underwater wireless sensor networks (UWSNs) have been applied in lots of fields such as environment monitoring, military surveillance, data collection, etc. Deployment of sensor nodes in 3D UWSNs is a crucial issue, however, it is a challenging problem due to the complex underwater environment. This paper proposes a growth ring style uneven node depth-adjustment self-deployment optimization algorithm (GRSUNDSOA) to improve the coverage and reliability of UWSNs, meanwhile, and to solve the problem of energy holes. In detail, a growth ring style-based scheme is proposed for constructing the connective tree structure of sensor nodes and a global optimal depth-adjustment algorithm with the goal of comprehensive optimization of both maximizing coverage utilization and energy balance is proposed. Initially, the nodes are scattered to the water surface to form a connected network on this 2D plane. Then, starting from sink node, a growth ring style increment strategy is presented to organize the common nodes as tree structures and each root of subtree is determined. Meanwhile, with the goal of global maximizing coverage utilization and energy balance, all nodes depths are computed iteratively. Finally, all the nodes dive to the computed position once and a 3D underwater connected network with non-uniform distribution and balanced energy is constructed. A series of simulation experiments are performed. The simulation results show that the coverage and reliability of UWSN are improved greatly under the condition of full connectivity and energy balance, and the issue of energy hole can be avoided effectively. Therefore, GRSUNDSOA can prolong the lifetime of UWSN significantly.

Poly[[μ2-1,3-bis(pyridin-4-yl)propane](μ3-1,4-phenylenediacetato)cadmium]

2012 ◽  
Vol 68 (2) ◽  
pp. m34-m36 ◽  
Author(s):  
Dong Liu
Keyword(s):  
Title Complex ◽  
Point Of View ◽  
Solvothermal Reaction ◽  
Dimensional Chain ◽  
Two Dimensional ◽  
One Dimensional ◽  
Connected Network ◽  
Dimensional Network

Solvothermal reaction between Cd(NO3)2, 1,4-phenylenediacetate (1,4-PDA) and 1,3-bis(pyridin-4-yl)propane (bpp) afforded the title complex, [Cd(C10H8O4)(C13H14N2)]n. Adjacent carboxylate-bridged CdIIions are related by an inversion centre. The 1,4-PDA ligands adopt acisconformation and connect the CdIIions to form a one-dimensional chain extending along thecaxis. These chains are in turn linked into a two-dimensional network through bpp bridges. The bpp ligands adopt ananti–gaucheconformation. From a topological point of view, each bpp ligand and each pair of 1,4-PDA ligands can be considered as linkers, while the dinuclear CdIIunit can be regarded as a 6-connecting node. Thus, the structure can be simplified to a two-dimensional 6-connected network.

Graph Summarization Based on Attribute-Connected Network

2017 ◽  
pp. 161-171
Author(s):  
Siqi Liu ◽  
Qinpei Zhao ◽  
Jiangfeng Li ◽  
Weixiong Rao
Keyword(s):  
Connected Network ◽  
Graph Summarization

scholarly journals Low degree connectivity of ad-hoc networks via percolation

2010 ◽  
Vol 42 (02) ◽  
pp. 559-576
Author(s):  
Emilio De Santis ◽  
Fabrizio Grandoni ◽  
Alessandro Panconesi
Keyword(s):  
Ad Hoc Networks ◽  
Maximum Degree ◽  
High Probability ◽  
Ad Hoc ◽  
Classical Problem ◽  
Universal Constant ◽  
Giant Component ◽  
Second Phase ◽  
Connected Network ◽  
Hoc Networks

Consider the following classical problem in ad-hoc networks. Suppose that n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum degree. Our algorithms are based on the following result, which is a nontrivial consequence of classical percolation theory. Suppose that each device sets up its transmission radius in order to reach the K closest devices. There exists a universal constant K (independent of n) such that, with high probability, there will be a unique giant component (i.e. a connected component of size Θ(n)). Furthermore, all remaining components will be of size O(log2 n). This leads to an efficient distributed probabilistic test for membership in the giant component, which can be used in a second phase to achieve full connectivity.

Sign in / Sign up

Export Citation Format

Share Document