Search results

Search for "shortest-path" in Full Text gives 5 result(s) in Beilstein Journal of Nanotechnology.

The electrical conductivity of CNT/graphene composites: a new method for accelerating transmission function calculations

  • Olga E. Glukhova and
  • Dmitriy S. Shmygin

Beilstein J. Nanotechnol. 2018, 9, 1254–1262, doi:10.3762/bjnano.9.117

Graphical Abstract
  • method used in [9]. There is no need to construct a distance matrix and to find the shortest path in the plot. Also, the program implementation of our approach is simpler. Besides, our approach ensures a higher acceleration rate in calculations of the transmission functions of polyatomic structures. In
PDF
Album
Full Research Paper
Published 20 Apr 2018

Analysis and modification of defective surface aggregates on PCDTBT:PCBM solar cell blends using combined Kelvin probe, conductive and bimodal atomic force microscopy

  • Hanaul Noh,
  • Alfredo J. Diaz and
  • Santiago D. Solares

Beilstein J. Nanotechnol. 2017, 8, 579–589, doi:10.3762/bjnano.8.62

Graphical Abstract
  • energy band bending. (a) Electrostatic potential distribution in space between the tip (red) and bottom electrode. (b) Calculated energy diagram along the shortest path from the tip end to the bottom electrode showing the built-in contact potential difference and band bending. Solid black and dotted blue
PDF
Album
Supp Info
Full Research Paper
Published 08 Mar 2017

Analyzing collaboration networks and developmental patterns of nano-enabled drug delivery (NEDD) for brain cancer

  • Ying Huang,
  • Jing Ma,
  • Alan L. Porter,
  • Seokbeom Kwon and
  • Donghua Zhu

Beilstein J. Nanotechnol. 2015, 6, 1666–1676, doi:10.3762/bjnano.6.169

Graphical Abstract
  • the core position, making it more likely to collaborate with other countries. All other countries share a similar distance among other nodes, from 2000 to 2014. From the BC perspective, the USA and Germany perform well, acting as a bridge along the shortest path between two other countries. The most
PDF
Album
Full Research Paper
Published 31 Jul 2015

Simple and efficient way of speeding up transmission calculations with k-point sampling

  • Jesper Toft Falkenberg and
  • Mads Brandbyge

Beilstein J. Nanotechnol. 2015, 6, 1603–1608, doi:10.3762/bjnano.6.164

Graphical Abstract
  • -processing; shortest-path; Introduction Calculations of electronic conductance based on first principle methods such as density functional theory (DFT) provide a valuable tool in order to gain insights into electronic transport in nano-conductors and comparison to experiments without employing fitting
  • useful result, but smooth averaged curves can be obtained, as we will illustrate below, using a significantly smaller number of k-points. The interpolation is done by using a shortest-path solver to determine a correspondence between two k-adjacent curves. The correspondence is then used to find
  • ,y are added to ensure a degree of tunability when interpolating. This is due to the fact that x and y are different quantities and thus have different scales. In order to interpolate one curve into the other we need to determine the shortest path for all points on either curve. This is done by
PDF
Album
Supp Info
Full Research Paper
Published 24 Jul 2015

Topological edge properties of C60+12n fullerenes

  • A. Mottaghi and
  • Ali R. Ashrafi

Beilstein J. Nanotechnol. 2013, 4, 400–405, doi:10.3762/bjnano.4.47

Graphical Abstract
  • chemistry. The length of a shortest path connecting vertices u and v is called the topological distance between u and v, denoted by d(u,v). A topological index is considered to be distance-based, if it can be defined by a function d. Suppose e = uv E(G). Then mu(e) is defined as the number of edges closer
PDF
Album
Full Research Paper
Published 26 Jun 2013
Other Beilstein-Institut Open Science Activities