Results 71 to 80 of about 309,634 (292)

Positive‐Tone Nanolithography of Antimony Trisulfide with Femtosecond Laser Wet‐Etching

Advanced Functional Materials, EarlyView.
A butyldithiocarbamic acid (BDCA) etchant is used to fabricate various micro‐ and nanoscale structures on amorphous antimony trisulfide (a‐Sb2S3) thin film via femtosecond laser etching. Numerical analysis and experimental results elucidate the patterning mechanism on gold (reflective) and quartz (transmissive) substrates.
Abhrodeep Dey, Uwe Hübner, Albane Benardais, Xiaofei Wu, Andrea Dellith, Jan Dellith, Torsten Wieduwilt, Henrik Schneidewind, Markus A Schmidt, Virginie Nazabal, Volker Deckert, Jer‐Shing Huang, Wei Wang   +12 more
wiley   +1 more source

A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph [PDF]

Al-Rafidain Journal of Computer Sciences and Mathematics, 2011
The paper tackled a survey of two optimization methods to study spanning tree problem by modifying the   spanning tree problem to generate all of possible solutions in undirected tree graph with simulated annealing algorithm and ant colony optimization ...
Isra Alkallak, Ruqaya Sha’ban
doaj   +1 more source

Multiscale Structuring of Hydroxyapatite via Two‐Photon Lithography of Nanocomposites

Advanced Functional Materials, EarlyView.
Hydroxyapatite scaffolds are of great interest in bone tissue engineering applications, ranging from 3D cell culture to regenerative medicine. Using two‐photon lithography of a transparent nanocomposite, hydroxyapatite microstructures with features ranging from submicron to centimeter‐scale are fabricated. This allows to mimic the natural bone geometry,
Leonhard Hambitzer, Jan Mathis Hornbostel, Richard Prediger, Sebastian Kluck, Michael Daub, Cornelia Lee‐Thedieck, Frederik Kotz‐Helmer   +6 more
wiley   +1 more source

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

Journal of Applied Mathematics, 2012
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj   +1 more source

Balancing Minimum Spanning and Shortest Path Trees

, 1995
This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the two trees and
B. Raghavachari, C. Levcopoulos, E. W. Dijkstra, F. P. Preparata, H. N. Gabow, I. Althöfer, J. B. Kruskal, J. JáJá, K. Bharath-Kumar, L. P. Chew, M. L. Freeman, N. Young, P. M. Vaidya, R. C. Prim, S. Khuller, T. H. Cormen   +15 more
core   +3 more sources

Spanning Trees and Spanners [PDF]

, 2000
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire   +2 more sources

Spectrally Tunable 2D Material‐Based Infrared Photodetectors for Intelligent Optoelectronics

Advanced Functional Materials, EarlyView.
Intelligent optoelectronics through spectral engineering of 2D material‐based infrared photodetectors. Abstract The evolution of intelligent optoelectronic systems is driven by artificial intelligence (AI). However, their practical realization hinges on the ability to dynamically capture and process optical signals across a broad infrared (IR) spectrum.
Junheon Ha, Yingshan Ma, Yong Nam An, Sung‐Un An, Hyeon Hak Jung, Suvi‐Tuuli Varjamo, Jiwon Yoo, Junho Min, Hanvit Kim, Faisal Ahmed, Sang Hoon Chae, Young Min Song, Weiwei Cai, Tawfique Hasan, Zhipei Sun, Dong‐Ho Kang, Hyeon‐Jin Shin, Yunyun Dai, Hoon Hahn Yoon   +18 more
wiley   +1 more source

The generalized minimum spanning tree polytope and related polytopes [PDF]

, 2001
The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core   +1 more source

Chiral SURMOFs for Vibrational Circular Dichroism: Multiscale Modeling and Experimental Insights

Advanced Functional Materials, EarlyView.
The use of solid‐state vibrational circular dichroism (VCD) for MOFs is still somewhat unexplored, and in this work, it is shown that chiral surface‐anchored MOFs (SURMOFs) grown on CaF2 provide an excellent platform for VCD. Experimental results are validated through multiscale modeling, showing strong agreement across multiple spectroscopic ...
Ana C. Fingolo, Nadine von Coelln, Benedikt Zerulla, Marjan Krstić, Christian Huck, Thomas G. Mayerhöfer, Christoph Krafft, Petra Tegeder, Carsten Rockstuhl, Christof Wöll   +9 more
wiley   +1 more source

The Budgeted Labeled Minimum Spanning Tree Problem

Mathematics
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli, Ciriaco D'Ambrosio, Domenico Serra, Carmine Sorgente   +3 more
doaj   +1 more source