Results 31 to 40 of about 342,984 (310)
Almost periodic functions, constructively [PDF]
Logical Methods in Computer Science, 2005 The almost periodic functions form a natural example of a non-separable normed space. As such, it has been a challenge for constructive mathematicians to find a natural treatment of them.
Bas Spitters
doaj +1 more source
Interpreting a Classical Geometric Proof with Interactive Realizability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the existence of a
Giovanni Birolo
doaj +1 more source
A Normalizing Intuitionistic Set Theory with Inaccessible Sets [PDF]
Logical Methods in Computer Science, 2007 We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs.
Wojciech Moczydlowski
doaj +1 more source
Colloidal Crack Sintering Lithography for Light‐Induced Patterning of Particle Assemblies
Advanced Functional Materials, EarlyView.Colloidal crack sintering lithography (CCSL) is a microfabrication technique that uses light‐induced photothermal heating to trigger sintering and controlled cracking in polymer colloidal assemblies. Local structural changes generate microchannels and patterns, enabling direct writing of diverse topographic motifs.
Marius Schoettle +2 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Cephalopod‐inspired photonic microparticles with dynamic structural coloration are fabricated via confined self‐assembly of linear block copolymers into ellipsoids containing stacked lamellae. Embedded superparamagnetic nanoparticles enable rapid magnetic alignment, restoring vivid, angle‐dependent color.
Gianluca Mazzotta +8 more
wiley +1 more source
SciPost Physics Core, 2023 We study perfect matchings, or close-packed dimer coverings, of finite sections of the eleven Archimedean lattices and give a constructive proof showing that any two perfect matchings can be transformed into each other using small sets of local ring ...
Henrik Schou Røising, Zhao Zhang
doaj +1 more source
Advanced Optical Materials, Volume 13, Issue 8, March 13, 2025.This article presents a hybrid metal‐dielectric metasurface in transmission mode for mid‐infrared (MIR) spectroscopy. Composed of germanium on aluminium cylinders atop a calcium fluoride substrate, the metasurface achieves 80% transmission efficiency at λ = 2.6 µm with a narrow full‐width‐half‐maximum of 0.4 µm.
Amr Soliman +5 more
wiley +1 more source
Metalens Array for Complex‐Valued Optical Discrete Fourier Transform
Advanced Optical Materials, EarlyView.A single‐layer metalens‐array device performs complex‐to‐complex discrete Fourier transforms (DFTs) optically with O(N) digital time complexity. Integrated interferometric phase retrieval and error mitigation scheme enables accurate, compact, and low‐power optical computing. The approach provides a versatile framework for implementing arbitrary complex‐
Randy Stefan Tanuwijaya +6 more
wiley +1 more source
The Largest Respectful Function [PDF]
Logical Methods in Computer Science, 2016 Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof.
Joachim Parrow, Tjark Weber
doaj +1 more source
Equal Sum Sequences and Imbalance Sets of Tournaments [PDF]
, 2014 Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid's conjecture using arithmetic arguments. No constructive proof has been found since.
Khan, Muhammad Ali
core