Related papers: Measuring the complexity of micro and nanostructur…
Metallic nanohole arrays have shown their potential as sensing tools. Important research supported by sophisticated laboratory experiments have been recently carried out, that may help to develop practical devices to be implemented in the…
Quantifying the evolution and complexity of materials is of importance in many areas of science and engineering, where a central open challenge is developing experimental complexity measurements to distinguish random structures from evolved…
The failure of roughness parameters to predict surface properties stems from their inherent scale-dependence; in other words, the measured value depends on the way it was measured. Here we take advantage of this scale-dependence to develop…
Surface deformations of optical cavities and plasmonic nanoparticles are inevitable in nanophotonics. The random morphology changes of different realizations modify the associated resonance frequencies and quality factors, which may be…
We present an optical metrology system for characterization of topography of micro/nano-structures on a surface or embedded in a semi-transparent material. Based on the principles of scatterometry, where the intensity of scattered light is…
Mixtures of nanoparticles and polymer-like objects are encountered in many nanotechnological applications and biological systems. We study the behavior of grafted polymer layers decorated by nanoparticles that are attracted to the polymers…
We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.
A major bottleneck in nanoparticle measurements is the lack of comparability. Comparability of measurement results is obtained by metrological traceability, which is obtained by calibration. In the present work the calibration of…
A density-based topology optimization framework is developed to manipulate characteristic modes of conducting surfaces. The adjoint sensitivity analysis provides an efficient computation of the material gradient utilized by the local…
This study introduces novel insights into the development of procedures for identifying the most relevant scales for observing the interactions of dynamic wettability and surface complexities. The experimental procedures presented for…
Recently it has been argued that entropy can be a direct measure of complexity, where the smaller value of entropy indicates lower system complexity, while its larger value indicates higher system complexity. We dispute this view and…
Functional properties of nanomaterials strongly depend on their surface atomic structure, but they often become largely different from their bulk structure, exhibiting surface reconstructions and relaxations. However, most of the surface…
Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in the field of complex systems in both abstract and applied contexts. One approach, the complexity profile, is a measure of the…
Complexity measures are essential to understand complex systems and there are numerous definitions to analyze one-dimensional data. However, extensions of these approaches to two or higher-dimensional data, such as images, are much less…
We present a quantitative measure of physical complexity, based on the amount of information required to build a given physical structure through self-assembly. Our procedure can be adapted to any given geometry, and thus to any given type…
New generation in vitro high-throughput screening (HTS) assays for the assessment of engineered nanomaterials provide an opportunity to learn how these particles interact at the cellular level, particularly in relation to injury pathways.…
Clustering is a common task in machine learning, but clusters of unlabelled data can be hard to quantify. The application of clustering algorithms in chemistry is often dependant on material representation. Ascertaining the effects of…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
In this work we examine two different measures for inhomogeneity and complexity that are derived from nonextensive considerations a' la Tsallis. Their performance is then tested on theoretically generated patterns. All measures are found to…