<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (Vaguery)</title>
    <link>https://pinboard.in/u:Vaguery/public/</link>
    <description>recent bookmarks from Vaguery</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://arxiv.org/abs/2404.05472"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2302.06457"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2107.04298"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2508.15470"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2412.05266"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2504.11124"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2504.08106"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2407.11713"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2110.14237"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2206.14942"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2207.01810"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2105.10541"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2109.03392"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2202.05219"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2005.01988"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2101.11208"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2103.01381"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.02304"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2106.03911"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.04513"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.07874"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2108.08449"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2110.12999"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1712.08404"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2105.10846"/>
	<rdf:li rdf:resource="https://dl.acm.org/doi/10.1145/3411764.3445653"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2012.09314"/>
	<rdf:li rdf:resource="https://www.sciencedirect.com/science/article/pii/S0097849320300674?casa_token=LFW6qVdwZzwAAAAA:tNXHwiJ2F-7N85WfNm0rADwGnQrliFVK3VUX74GoOWJEsXPoe6_gDR7VdLzd6FE4KRglzXB0Sg"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2003.02121"/>
	<rdf:li rdf:resource="http://inverseprobability.com/talks/notes/intellectual-debt-and-the-death-of-the-programmer.html"/>
	<rdf:li rdf:resource="https://www.openscad.org/about.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.08559"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1901.02950"/>
	<rdf:li rdf:resource="http://simjs.com/index.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/dg-ga/9702001"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1804.01804"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1905.12890"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.04240"/>
	<rdf:li rdf:resource="https://www.amnh.org/research/paleontology/collections/fossil-invertebrate-collection/trilobite-website/the-trilobite-files/trilobite-eyes"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.10140#"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/math/0402212"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.05610"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1806.04236"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.11214"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1107.5667"/>
	<rdf:li rdf:resource="https://ddd.fit.cvut.cz/prj/Benchmarks/index.php?page=download"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/0911.1984"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1710.08485"/>
	<rdf:li rdf:resource="https://dl.acm.org/citation.cfm?id=264996"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1802.03548"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1808.00626"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1605.02681"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1005.3466"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1804.06483"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.10835"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1808.06271"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1811.06889"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1807.06498"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1903.11995"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1510.07499"/>
	<rdf:li rdf:resource="https://www.redblobgames.com/articles/curved-paths/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1812.02873"/>
	<rdf:li rdf:resource="http://tunes.org/~iepos/joy.html#cakek"/>
	<rdf:li rdf:resource="https://www.socialsciencespace.com/2018/02/nick-seaver-dissecting-algorithmic-organism/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1811.09989"/>
	<rdf:li rdf:resource="https://blog.dshr.org/2018/01/it-isnt-about-technology.html?m=1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1806.01387"/>
	<rdf:li rdf:resource="https://www.math.ucdavis.edu/~romik/movingsofa/"/>
	<rdf:li rdf:resource="https://www.degruyter.com/view/j/pjbr.2013.4.issue-1/pjbr-2013-0003/pjbr-2013-0003.xml"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1406.1886v1"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://arxiv.org/abs/2404.05472">
    <title>[2404.05472] The steady-states of splitter networks</title>
    <dc:date>2026-05-24T12:14:16+00:00</dc:date>
    <link>https://arxiv.org/abs/2404.05472</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce splitter networks, which abstract the behavior of conveyor belts found in the video game Factorio. Based on this definition, we show how to compute the steady-state of a splitter network. Then, leveraging insights from the players community, we provide multiple designs of splitter networks capable of load-balancing among several conveyor belts, and prove that any load-balancing network on n belts must have Ω(nlogn) nodes. Incidentally, we establish connections between splitter networks and various concepts including flow algorithms, flows with equality constraints, Markov chains and the Knuth-Yao theorem about sampling over rational distributions using a fair coin.
]]></description>
<dc:subject>systems-dynamics representation games nonlinear-dynamics rather-interesting probability-theory load-balancing engineering-design to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d54d74c2bdbc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:load-balancing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2302.06457">
    <title>[2302.06457] A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms</title>
    <dc:date>2026-05-24T12:06:56+00:00</dc:date>
    <link>https://arxiv.org/abs/2302.06457</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The transistor celebrated its 75th birthday in 2022. The continued scaling of the transistor defined by Moore's Law continues, albeit at a slower pace. Meanwhile, computing demands and energy consumption required by modern artificial intelligence (AI) algorithms have skyrocketed. As an alternative to scaling transistors for general-purpose computing, the integration of transistors with unconventional technologies has emerged as a promising path for domain-specific computing. In this article, we provide a full-stack review of probabilistic computing with p-bits as a representative example of the energy-efficient and domain-specific computing movement. We argue that p-bits could be used to build energy-efficient probabilistic systems, tailored for probabilistic algorithms and applications. From hardware, architecture, and algorithmic perspectives, we outline the main applications of probabilistic computers ranging from probabilistic machine learning and AI to combinatorial optimization and quantum simulation. Combining emerging nanodevices with the existing CMOS ecosystem will lead to probabilistic computers with orders of magnitude improvements in energy efficiency and probabilistic sampling, potentially unlocking previously unexplored regimes for powerful probabilistic algorithms.
]]></description>
<dc:subject>probability-theory probabilistic-computing algorithms rather-interesting machine-learning engineering-design approximation to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:77469b3f11a6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probabilistic-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2107.04298">
    <title>[2107.04298] An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition</title>
    <dc:date>2026-05-24T11:15:53+00:00</dc:date>
    <link>https://arxiv.org/abs/2107.04298</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[An algorithm for reversible logic synthesis is proposed. The task is, for a given n-bit substitution map Pn:{0,1}n→{0,1}n, to find a sequence of reversible logic gates that implements the map. The gate library adopted in this work consists of multiple-controlled Toffoli gates denoted by CmX, where m is the number of control bits that ranges from 0 to n−1. Controlled gates with large m(>2) are then further decomposed into C0X, C1X, and C2X gates. A primary concern in designing the algorithm is to reduce the use of C2X gate (also known as Toffoli gate) which is known to be universal.
The main idea is to view an n-bit substitution map as a rank-2n tensor and to transform it such that the resulting map can be written as a tensor product of a rank-(2n−2) tensor and the 2×2 identity matrix. Let n be a set of all n-bit substitution maps. What we try to find is a size reduction map red:n→{Pn:Pn=Pn−1⊗I2}. %, where Im is the m×m identity matrix. One can see that the output Pn−1⊗I2 acts nontrivially on n−1 bits only, meaning that the map to be synthesized becomes Pn−1. The size reduction process is iteratively applied until it reaches tensor product of only 2×2 matrices.
]]></description>
<dc:subject>circuit-synthesis quantum-computing engineering-design rather-interesting cellular-automata metaheuristics to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a1381ee122ec/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:circuit-synthesis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:quantum-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2508.15470">
    <title>[2508.15470] A hybrid-frequency on-chip programmable synthetic-dimension simulator with arbitrary couplings</title>
    <dc:date>2025-08-26T17:09:27+00:00</dc:date>
    <link>https://arxiv.org/abs/2508.15470</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[High-performance photonic chips provide a powerful platform for analog computing, enabling the simulation of high-dimensional physical systems using low-dimensional devices with additional synthetic dimensions. The realization of large-scale complex simulations necessitates an architecture capable of arbitrary coupling configurations (encompassing symmetric, asymmetric and long-range coupling schemes) which is also crucial for scaling up. Previous approaches rely on excessive physical components to introduce asymmetric coupling, however, are restricted in reconfiguring and scaling by the relatively complicated structures. Here, to solve this problem, we propose a hybrid-frequency synthetic-dimension simulator architecture that combines both intra-resonant and inter-resonant frequency-lattice sites, and experimentally demonstrate it using the thin-film lithium niobate (TFLN) photonic chip. Employing this hybrid programmable architecture, we are able to simulate both the regular and long-range coupled forms of diverse compound-lattice models, such as the Hall ladder, Creutz ladder (symmetric) and Su-Schrieffer-Heeger (SSH, asymmetric) model, on a single chip, simultaneously reducing the experimental requirements significantly. As results, the direct readout of the bandstructure of the SSH model is able to be achieved, to be distinguished from all previous works, and important phenomena such as spin-momentum locking, topological flat band and Aharonov-Bohm cage effect are also observed with lower experimental requirements. Furthermore, applications like piecewise-continuous optical frequency shifting can be enabled by cascading our devices. Our results offer promising insights for future large-scale complex on-chip simulators with arbitrary couplings.
]]></description>
<dc:subject>analog-computing photonics indistinguishable-from-magic reprogrammable-matter to-understand sensors engineering-design</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5f48a87790b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:photonics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:indistinguishable-from-magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reprogrammable-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sensors"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2412.05266">
    <title>[2412.05266] Locomotion of a Scallop-Inspired Swimmer in Granular Matter</title>
    <dc:date>2025-08-22T13:01:32+00:00</dc:date>
    <link>https://arxiv.org/abs/2412.05266</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Understanding swimming in soft yielding media is challenging due to their complex deformation response to the swimmer's motion. We experimentally show that a scallop-inspired swimmer with reciprocally flapping wings generates locomotion in granular matter. This disagrees with the scallop theorem prohibiting reciprocal swimming in a liquid when its inertia is negligible. We use X-ray tomography and laser profilometry to show that the propulsion is created by the combined effects of jamming and convection of particles near the wings, which break the symmetry in packing density, surface deformation, and kinematics of the granular medium between an opening and a closing stroke.
]]></description>
<dc:subject>biologically-inspired engineering-design looking-to-see granular-materials nonlinear-dynamics rather-interesting robotics nanotechnology fluid-dynamics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3d766bc18679/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biologically-inspired"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanotechnology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fluid-dynamics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2504.11124">
    <title>[2504.11124] A Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform</title>
    <dc:date>2025-08-21T17:11:52+00:00</dc:date>
    <link>https://arxiv.org/abs/2504.11124</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The Number Theoretic Transform (NTT) is an indispensable tool for computing efficient polynomial multiplications in post-quantum lattice-based cryptography. It has strong resemblance with the Fast Fourier Transform (FFT), which is the most widely used algorithm in digital signal processing. In this work, we demonstrate a unified hardware accelerator supporting both 512-point complex FFT as well as 256-point NTT for the recently standardized NIST post-quantum key encapsulation and digital signature algorithms ML-KEM and ML-DSA respectively. Our proposed architecture effectively utilizes the arithmetic circuitry required for complex FFT, and the only additional circuits required are for modular reduction along with modifications in the control logic. Our implementation achieves performance comparable to state-of-the-art ML-KEM / ML-DSA NTT accelerators on FPGA, thus demonstrating how an FFT accelerator can be augmented to support NTT and the unified hardware can be used for both digital signal processing and post-quantum lattice-based cryptography applications.
]]></description>
<dc:subject>numerical-methods engineering-design circuits to-write-about consider:genetic-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3667b43c765e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:circuits"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2504.08106">
    <title>[2504.08106] A Case Study on Evaluating Genetic Algorithms for Early Building Design Optimization: Comparison with Random and Grid Searches</title>
    <dc:date>2025-08-17T12:55:43+00:00</dc:date>
    <link>https://arxiv.org/abs/2504.08106</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In early-stage architectural design, optimization algorithms are essential for efficiently exploring large and complex design spaces under tight computational constraints. While prior research has benchmarked various optimization methods, their findings often lack generalizability to real-world, domain-specific problems, particularly in early building design optimization for energy performance. This study evaluates the effectiveness of Genetic Algorithms (GAs) for early design optimization, focusing on their ability to find near-optimal solutions within limited timeframes. Using a constrained case study, we compare a simple GA to two baseline methods, Random Search (RS) and Grid Search (GS), with each algorithm tested 10 times to enhance the reliability of the conclusions. Our findings show that while RS may miss optimal solutions due to its stochastic nature, it was unexpectedly effective under tight computational limits. Despite being more systematic, GS was outperformed by RS, likely due to the irregular design search space. This suggests that, under strict computational constraints, lightweight methods like RS can sometimes outperform more complex approaches like GA. As this study is limited to a single case under specific constraints, future research should investigate a broader range of design scenarios and computational settings to validate and generalize the findings. Additionally, the potential of Random Search or hybrid optimization methods should be further investigated, particularly in contexts with strict computational limitations.
]]></description>
<dc:subject>engineering-design genetic-algorithm horse-races no-free-lunch to-write-about object-lessons architecture</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:43ecf2102fe1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:horse-races"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:no-free-lunch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:object-lessons"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:architecture"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2407.11713">
    <title>[2407.11713] AutoFreeFem: Automatic code generation with FreeFEM++ and LaTex output for shape and topology optimization of non-linear multi-physics problems</title>
    <dc:date>2024-08-08T13:42:08+00:00</dc:date>
    <link>https://arxiv.org/abs/2407.11713</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[For an educational purpose we develop the Python package AutoFreeFem which generates all ingredients for shape optimization with non-linear multi-physics in FreeFEM++ and also outputs the expressions for use in LaTex. As an input, the objective function and the weak form of the problem have to be specified only once. This ensures consistency between the simulation code and its documentation. In particular, AutoFreeFem provides the linearization of the state equation, the adjoint problem, the shape derivative, as well as a basic implementation of the level-set based mesh evolution method for shape optimization. For the computation of shape derivatives we utilize the mathematical Lagrangian approach for differentiating PDE-constrained shape functions. Differentiation is done symbolically using Sympy. In numerical experiments we verify the accuracy of the computed derivatives. Finally, we showcase the capabilities of AutoFreeFem by considering shape optimization of a non-linear diffusion problem, linear and non-linear elasticity problems, a thermo-elasticity problem and a fluid-structure interaction problem.
]]></description>
<dc:subject>engineering-design finite-elements-analysis Python numerical-methods scientific-computing simulation rather-interesting library to-understand to-write-about consider:optimization consider:benchmarking</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3ed33361e396/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:finite-elements-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:scientific-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:benchmarking"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2110.14237">
    <title>[2110.14237] Learning Graph Cellular Automata</title>
    <dc:date>2024-08-08T13:37:36+00:00</dc:date>
    <link>https://arxiv.org/abs/2110.14237</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph cellular automata (GCA), in which the lattice structure is replaced by an arbitrary graph. In particular, we extend previous work that used convolutional neural networks to learn the transition rule of conventional CA and we use graph neural networks to learn a variety of transition rules for GCA. First, we present a general-purpose architecture for learning GCA, and we show that it can represent any arbitrary GCA with finite and discrete state space. Then, we test our approach on three different tasks: 1) learning the transition rule of a GCA on a Voronoi tessellation; 2) imitating the behaviour of a group of flocking agents; 3) learning a rule that converges to a desired target state.
]]></description>
<dc:subject>cellular-automata artificial-life engineering-design rather-interesting graph-theory to-understand to-simulate consider:graph-algorithms consider:distributed-computing consider:ReQ</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:457fe2d84025/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graph-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:graph-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:distributed-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:ReQ"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2206.14942">
    <title>[2206.14942] Multi-band oscillations emerge from a simple spiking network</title>
    <dc:date>2023-09-30T12:42:22+00:00</dc:date>
    <link>https://arxiv.org/abs/2206.14942</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In the brain, coherent neuronal activities often appear simultaneously in multiple frequency bands, e.g., as combinations of alpha (8-12 Hz), beta (12.5-30 Hz), gamma (30-120 Hz) oscillations, among others. These rhythms are believed to underlie information processing and cognitive functions and have been subjected to intense experimental and theoretical scrutiny. Computational modeling has provided a framework for the emergence of network-level oscillatory behavior from the interaction of spiking neurons. However, due to the strong nonlinear interactions between highly recurrent spiking populations, the interplay between cortical rhythms in multiple frequency bands has rarely been theoretically investigated. Many studies invoke multiple physiological timescales or oscillatory inputs to produce rhythms in multi-bands. Here we demonstrate the emergence of multi-band oscillations in a simple network consisting of one excitatory and one inhibitory neuronal population driven by constant input. First, we construct a data-driven, Poincaré section theory for robust numerical observations of single-frequency oscillations bifurcating into multiple bands. Then we develop model reductions of the stochastic, nonlinear, high-dimensional neuronal network to capture the appearance of multi-band dynamics and the underlying bifurcations theoretically. Furthermore, when viewed within the reduced state space, our analysis reveals conserved geometrical features of the bifurcations on low-dimensional dynamical manifolds. These results suggest a simple geometric mechanism behind the emergence of multi-band oscillations without appealing to oscillatory inputs or multiple synaptic or neuronal timescales. Thus our work points to unexplored regimes of stochastic competition between excitation and inhibition behind the generation of dynamic, patterned neuronal activities.
]]></description>
<dc:subject>neural-networks neurology engineering-design rather-interesting biological-engineering nonlinear-dynamics to-write-about to-simulate consider:genetic-programming consider:tunability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c86be5f352ee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neurology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biological-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:tunability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2207.01810">
    <title>[2207.01810] An additive framework for kirigami design</title>
    <dc:date>2023-09-28T12:36:36+00:00</dc:date>
    <link>https://arxiv.org/abs/2207.01810</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We present an additive approach for the inverse design of kirigami-based mechanical metamaterials by focusing on the empty (negative) spaces instead of the solid tiles. By considering each negative space as a four-bar linkage, we identify a simple recursive relationship between adjacent linkages, yielding an efficient method for creating kirigami patterns. This allows us to solve the kirigami design problem using elementary linear algebra, with compatibility, reconfigurability and rigid-deployability encoded into an iterative procedure involving simple matrix multiplications. The resulting linear design strategy circumvents the solution of a non-convex global optimization problem and allows us to control the degrees of freedom in the deployment angle field, linkage offsets and boundary conditions. We demonstrate this by creating a large variety of rigid-deployable, compact, reconfigurable kirigami patterns. We then realize our kirigami designs physically using two simple but effective fabrication strategies with very different materials. Altogether, our additive approaches present routes for efficient mechanical metamaterial design and fabrication based on ori/kirigami art forms.
]]></description>
<dc:subject>kirigami engineering-design mechanism-design rather-interesting mathematical-recreations constraint-satisfaction dynamical-systems to-write-about to-simulate consider:looking-to-see consider:genetic-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:fdbb6baa285b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:kirigami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mechanism-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2105.10541">
    <title>[2105.10541] Addressing the Multiplicity of Solutions in Optical Lens Design as a Niching Evolutionary Algorithms Computational Challenge</title>
    <dc:date>2023-02-07T12:58:57+00:00</dc:date>
    <link>https://arxiv.org/abs/2105.10541</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Optimal Lens Design constitutes a fundamental, long-standing real-world optimization challenge. Potentially large number of optima, rich variety of critical points, as well as solid understanding of certain optimal designs per simple problem instances, provide altogether the motivation to address it as a niching challenge. This study applies established Niching-CMA-ES heuristic to tackle this design problem (6-dimensional Cooke triplet) in a simulation-based fashion. The outcome of employing Niching-CMA-ES `out-of-the-box' proves successful, and yet it performs best when assisted by a local searcher which accurately drives the search into optima. The obtained search-points are corroborated based upon concrete knowledge of this problem-instance, accompanied by gradient and Hessian calculations for validation. We extensively report on this computational campaign, which overall resulted in (i) the location of 19 out of 21 known minima within a single run, (ii) the discovery of 540 new optima. These are new minima similar in shape to 21 theoretical solutions, but some of them have better merit function value (unknown heretofore), (iii) the identification of numerous infeasibility pockets throughout the domain (also unknown heretofore). We conclude that niching mechanism is well-suited to address this problem domain, and hypothesize on the apparent multidimensional structures formed by the attained new solutions.
]]></description>
<dc:subject>evolutionary-algorithms multiobjective-optimization machine-learning engineering-design rather-interesting performance-measure to-simulate consider:visualization optics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:461cdf4aac8d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2109.03392">
    <title>[2109.03392] Joint Search of Optimal Topology and Trajectory for Planar Linkages</title>
    <dc:date>2023-02-05T11:29:55+00:00</dc:date>
    <link>https://arxiv.org/abs/2109.03392</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We present an algorithm to compute planar linkage topology and geometry, given a user-specified end-effector trajectory. Planar linkage structures convert rotational or prismatic motions of a single actuator into an arbitrarily complex periodic motion, \refined{which is an important component when building low-cost, modular robots, mechanical toys, and foldable structures in our daily lives (chairs, bikes, and shelves). The design of such structures require trial and error even for experienced engineers. Our research provides semi-automatic methods for exploring novel designs given high-level specifications and constraints.} We formulate this problem as a non-smooth numerical optimization with quadratic objective functions and non-convex quadratic constraints involving mixed-integer decision variables (MIQCQP). We propose and compare three approximate algorithms to solve this problem: mixed-integer conic-programming (MICP), mixed-integer nonlinear programming (MINLP), and simulated annealing (SA). We evaluated these algorithms searching for planar linkages involving 10−14 rigid links. Our results show that the best performance can be achieved by combining MICP and MINLP, leading to a hybrid algorithm capable of finding the planar linkages within a couple of hours on a desktop machine, which significantly outperforms the SA baseline in terms of optimality. We highlight the effectiveness of our optimized planar linkages by using them as legs of a walking robot.
]]></description>
<dc:subject>inverse-problems planar-linkages engineering-design rather-interesting operations-research to-write-about to-simulate consider:representation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3ded4f6a9aae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planar-linkages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:operations-research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:representation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2202.05219">
    <title>[2202.05219] Solving integral equations in free-space with inverse-designed ultrathin optical metagratings</title>
    <dc:date>2022-10-19T22:22:38+00:00</dc:date>
    <link>https://arxiv.org/abs/2202.05219</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[As standard microelectronic technology approaches fundamental limitations in speed and power consumption, novel computing strategies are strongly needed. Analog optical computing enables processing large amounts of data at a  t energy cost and high speeds. Based on these principles, ultrathin optical metasurfaces have been recently explored to process large images in real-time, in particular for edge detection. By incorporating feedback, it has also been recently shown that metamaterials can be tailored to solve complex mathematical problems in the analog domain, although these efforts have so far been limited to guided-wave systems and bulky setups. Here, we present an ultrathin Si metasurface-based platform for analog computing that is able to solve Fredholm integral equations of the second kind using free-space visible radiation. A Si-based metagrating was inverse-designed to implement the scattering matrix synthesizing a prescribed Kernel corresponding to the mathematical problem of interest. Next, a semi-transparent mirror was incorporated into the sample to provide adequate feedback and thus perform the required Neumann series, solving the corresponding equation in the analog domain at the speed of light. Visible wavelength operation enables a highly compact, ultrathin device that can be interrogated from free-space, implying high processing speeds and the possibility of on-chip integration.
]]></description>
<dc:subject>optics indistinguishable-from-magic unconventional-computing engineering-design inverse-problems rather-interesting to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:426cf8000da6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:indistinguishable-from-magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:unconventional-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2005.01988">
    <title>[2005.01988] One-step regression and classification with crosspoint resistive memory arrays</title>
    <dc:date>2022-05-14T10:35:07+00:00</dc:date>
    <link>https://arxiv.org/abs/2005.01988</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Machine learning has been getting a large attention in the recent years, as a tool to process big data generated by ubiquitous sensors in our daily life. High speed, low energy computing machines are in demand to enable real-time artificial intelligence at the edge, i.e., without the support of a remote frame server in the cloud. Such requirements challenge the complementary metal-oxide-semiconductor (CMOS) technology, which is limited by the Moore's law approaching its end and the communication bottleneck in conventional computing architecture. Novel computing concepts, architectures and devices are thus strongly needed to accelerate data-intensive applications. Here we show a crosspoint resistive memory circuit with feedback configuration can execute linear regression and logistic regression in just one step by computing the pseudoinverse matrix of the data within the memory. The most elementary learning operation, that is the regression of a sequence of data and the classification of a set of data, can thus be executed in one single computational step by the novel technology. One-step learning is further supported by simulations of the prediction of the cost of a house in Boston and the training of a 2-layer neural network for MNIST digit recognition. The results are all obtained in one computational step, thanks to the physical, parallel, and analog computing within the crosspoint array.
]]></description>
<dc:subject>analog-computing rather-interesting to-understand algorithms engineering-design hardware nonlinear-dynamics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:21f1656dd658/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:hardware"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2101.11208">
    <title>[2101.11208] Statistical guided-waves-based SHM via stochastic non-parametric time series models</title>
    <dc:date>2022-04-02T13:12:01+00:00</dc:date>
    <link>https://arxiv.org/abs/2101.11208</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Damage detection in active-sensing, guided-waves-based Structural Health Monitoring (SHM) has evolved through multiple eras of development during the past decades. Nevertheless, there still exists a number of challenges facing the current state-of-the-art approaches, both in the industry as well as in research and development, including low damage sensitivity, lack of robustness to uncertainties, need for user-defined thresholds, and non-uniform response across a sensor network. In this work, a novel statistical framework is proposed for active-sensing SHM based on the use of ultrasonic guided waves. This framework is based on stochastic non-parametric time series models and their corresponding statistical properties in order to readily provide healthy confidence bounds and enable accurate and robust damage detection via the use of appropriate statistical decision making tests. Three such methods and corresponding statistical quantities (test statistics) along with decision making schemes are formulated and experimentally assessed via the use of three coupons with different levels of complexity: an Al plate with a growing notch, a Carbon fiber-reinforced plastic (CFRP) plate with added weights to simulate local damages, and the CFRP panel used in the Open Guided Waves project [1], all fitted with piezoelectric transducers and a pitch-catch configuration. The performance of the proposed methods is compared to that of state-of-the-art time-domain damage indices (DIs). The results demonstrate the increased sensitivity and robustness of the proposed methods, with better tracking capability of damage evolution compared to conventional approaches, even for damage-non-intersecting actuator-sensor paths. Overall, the proposed statistical methods exhibit greater damage sensitivity across different components, with enhanced robustness to uncertainty, as well as user-friendly application.
]]></description>
<dc:subject>signal-processing engineering-design pattern-discovery rather-interesting classification self-monitoring machine-learning to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2995334ee298/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:signal-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pattern-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-monitoring"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2103.01381">
    <title>[2103.01381] Stop Building Castles on a Swamp! The Crisis of Reproducing Automatic Search in Evidence-based Software Engineering</title>
    <dc:date>2022-03-29T15:44:16+00:00</dc:date>
    <link>https://arxiv.org/abs/2103.01381</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The evidence-based approach has increasingly been employed to synthesize empirical findings from the primary research in software engineering. Nevertheless, the reproducibility of evidence-based software engineering (EBSE) studies seems to be underemphasized. In our investigation into the automatic search of 311 sample studies, more than 50% of the search strings are not reusable; about 87.5% of the search activities (e.g., search field settings) are unrepeatable; and more than 95% of the whole automatic search implementations are unreproducible. Considering that searching is a cornerstone of an EBSE study, we are afraid that the reproducibility of the current secondary research could be worse than we can imagine. By analyzing and reporting the root causes of the aforementioned observations, we urge collaboration and cooperation among all the stakeholders in our community to improve the research reproducibility in EBSE.
]]></description>
<dc:subject>academic-culture informatics artificial-intelligence engineering-design rather-interesting heuristics innovation feasible-search</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:abaf91942e98/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:informatics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:heuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:innovation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feasible-search"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.02304">
    <title>[1910.02304] Multiplierless and Sparse Machine Learning based on Margin Propagation Networks</title>
    <dc:date>2022-03-11T11:33:08+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.02304</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The new generation of machine learning processors have evolved from multi-core and parallel architectures that were designed to efficiently implement matrix-vector-multiplications (MVMs). This is because at the fundamental level, neural network and machine learning operations extensively use MVM operations and hardware compilers exploit the inherent parallelism in MVM operations to achieve hardware acceleration on GPUs and FPGAs. However, many IoT and edge computing platforms require embedded ML devices close to the network in order to compensate for communication cost and latency. Hence a natural question to ask is whether MVM operations are even necessary to implement ML algorithms and whether simpler hardware primitives can be used to implement an ultra-energy-efficient ML processor/architecture. In this paper we propose an alternate hardware-software codesign of ML and neural network architectures where instead of using MVM operations and non-linear activation functions, the architecture only uses simple addition and thresholding operations to implement inference and learning. At the core of the proposed approach is margin-propagation (MP) based computation that maps multiplications into additions and additions into a dynamic rectifying-linear-unit (ReLU) operations. This mapping results in significant improvement in computational and hence energy cost. In this paper, we show how the MP network formulation can be applied for designing linear classifiers, shallow multi-layer perceptrons and support vector networks suitable fot IoT platforms and tiny ML applications. We show that these MP based classifiers give comparable results to that of their traditional counterparts for benchmark UCI datasets, with the added advantage of reduction in computational complexity enabling an improvement in energy efficiency.
]]></description>
<dc:subject>machine-learning energy-efficiency rather-interesting engineering-design to-write-about consider:multiobjective-tradeoffs consider:performance-measures consider:robustness</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:520c3ffa1594/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:energy-efficiency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:multiobjective-tradeoffs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:robustness"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2106.03911">
    <title>[2106.03911] XIRL: Cross-embodiment Inverse Reinforcement Learning</title>
    <dc:date>2022-03-09T17:35:31+00:00</dc:date>
    <link>https://arxiv.org/abs/2106.03911</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We investigate the visual cross-embodiment imitation setting, in which agents learn policies from videos of other agents (such as humans) demonstrating the same task, but with stark differences in their embodiments -- shape, actions, end-effector dynamics, etc. In this work, we demonstrate that it is possible to automatically discover and learn vision-based reward functions from cross-embodiment demonstration videos that are robust to these differences. Specifically, we present a self-supervised method for Cross-embodiment Inverse Reinforcement Learning (XIRL) that leverages temporal cycle-consistency constraints to learn deep visual embeddings that capture task progression from offline videos of demonstrations across multiple expert agents, each performing the same task differently due to embodiment differences. Prior to our work, producing rewards from self-supervised embeddings typically required alignment with a reference trajectory, which may be difficult to acquire under stark embodiment differences. We show empirically that if the embeddings are aware of task progress, simply taking the negative distance between the current state and goal state in the learned embedding space is useful as a reward for training policies with reinforcement learning. We find our learned reward function not only works for embodiments seen during training, but also generalizes to entirely new embodiments. Additionally, when transferring real-world human demonstrations to a simulated robot, we find that XIRL is more sample efficient than current best methods. Qualitative results, code, and datasets are available at this https URL
]]></description>
<dc:subject>machine-learning learning-by-watching reinforcement-learning rather-interesting robotics embodied-systems engineering-design</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d3fae393fc31/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:learning-by-watching"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reinforcement-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:embodied-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.04513">
    <title>[1904.04513] Towards a complete perspective on labeled tree indexing: new size bounds, efficient constructions, and beyond</title>
    <dc:date>2022-03-04T11:27:07+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.04513</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A labeled tree (or a trie) is a natural generalization of a string, which can also be seen as a compact representation of a set of strings. This paper considers the labeled tree indexing problem, and provides a number of new results on space bound analysis, and on algorithms for efficient construction and pattern matching queries. Kosaraju [FOCS 1989] was the first to consider the labeled tree indexing problem, and he proposed the suffix tree for a backward trie, where the strings in the trie are read in the leaf-to-root direction. In contrast to a backward trie, we call a usual trie as a forward trie. Despite a few follow-up works after Kosaraju's paper, indexing forward/backward tries is not well understood yet. In this paper, we show a full perspective on the sizes of indexing structures such as suffix trees, DAWGs, CDAWGs, suffix arrays, affix trees, affix arrays for forward and backward tries. Some of them take O(n) space in the size n of the input trie, while the others can occupy O(n2) space in the worst case. In particular, we show that the size of the DAWG for a forward trie with n nodes is Ω(σn), where σ is the number of distinct characters in the trie. This becomes Ω(n2) for an alphabet of size σ=Θ(n). Still, we show that there is a compact O(n)-space implicit representation of the DAWG for a forward trie, whose space requirement is independent of the alphabet size. This compact representation allows for simulating each DAWG edge traversal in O(logσ) time, and can be constructed in O(n) time and space over any integer alphabet of size O(n). In addition, this readily extends to the first indexing structure that permits bidirectional pattern searches over a trie within linear space in the input trie size.
]]></description>
<dc:subject>strings data-structures optimization algorithms rather-interesting performance-measure information-theory engineering-design to-write-about to-simulate consider:error</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7cd802a335d2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:strings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:error"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.07874">
    <title>[1908.07874] Analog circuits for mixed-signal neuromorphic computing architectures in 28 nm FD-SOI technology</title>
    <dc:date>2022-02-11T15:27:58+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.07874</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Developing mixed-signal analog-digital neuromorphic circuits in advanced scaled processes poses significant design challenges. We present compact and energy efficient sub-threshold analog synapse and neuron circuits, optimized for a 28 nm FD-SOI process, to implement massively parallel large-scale neuromorphic computing systems. We describe the techniques used for maximizing density with mixed-mode analog/digital synaptic weight configurations, and the methods adopted for minimizing the effect of channel leakage current, in order to implement efficient analog computation based on pA-nA small currents. We present circuit simulation results, based on a new chip that has been recently taped out, to demonstrate how the circuits can be useful for both low-frequency operation in systems that need to interact with the environment in real-time, and for high-frequency operation for fast data processing in different types of spiking neural network architectures.
]]></description>
<dc:subject>neural-networks analog-computing rather-interesting representation simulation engineering-design to-write-about to-understand consider:getting-a-dang-simulator</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f8c80b9f3af0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:getting-a-dang-simulator"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2108.08449">
    <title>[2108.08449] A cut-and-fold self-sustained compliant oscillator for autonomous actuation of origami-inspired robots</title>
    <dc:date>2022-01-29T14:03:19+00:00</dc:date>
    <link>https://arxiv.org/abs/2108.08449</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Origami-inspired robots are of particular interest given their potential for rapid and accessible design and fabrication of elegant designs and complex functionalities through cutting and folding of flexible 2D sheets or even strings, i.e.printable manufacturing. Yet, origami robots still require bulky, rigid components or electronics for actuation and control to accomplish tasks with reliability, programmability, ability to output substantial force, and durability, restricting their full potential. Here, we present a printable self-sustained compliant oscillator that generates periodic actuation using only constant electrical power, without discrete components or electronic control hardware. This oscillator is robust (9 out of 10 prototypes worked successfully on the first try), configurable (with tunable periods from 3 s to 12 s), powerful (can overcome hydrodynamic resistance to consistently propel a swimmer at ~1.6 body lengths/min), and long-lasting (~10^3 cycles); it enables driving macroscale devices with prescribed autonomous behaviors, e.g. locomotion and sequencing. This oscillator is also fully functional underwater and in high magnetic fields. Our analytical model characterizes essential parameters of the oscillation period, enabling programmable design of the oscillator. The printable oscillator can be integrated into origami-inspired systems seamlessly and monolithically, allowing rapid design and prototyping; the resulting integrated devices are lightweight, low-cost, compliant, electronic-free, and nonmagnetic, enabling practical applications in extreme areas. We demonstrate the functionalities of the oscillator with: (i) autonomous gliding of a printable swimmer, (ii) LED flashing, and (iii) fluid stirring. This work paves the way for realizing fully printable autonomous robots with a high integration of actuation and control.
]]></description>
<dc:subject>robotics origami engineering-design rather-interesting 3d-printing nonstandard-electronics mechanics kinematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:cd9063040f52/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:3d-printing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonstandard-electronics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:kinematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2110.12999">
    <title>[2110.12999] Deep learning-based design of broadband GHz complex and random metasurfaces</title>
    <dc:date>2022-01-27T14:17:52+00:00</dc:date>
    <link>https://arxiv.org/abs/2110.12999</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We are interested to explore the limit in using deep learning (DL) to study the electromagnetic response for complex and random metasurfaces, without any specific applications in mind. For simplicity, we focus on a simple pure reflection problem of a broadband electromagnetic (EM) plane wave incident normally on such complex metasurfaces in the frequency regime of 2 to 12 GHz. In doing so, we create a deep learning (DL) based framework called metasurface design deep convolutional neural network (MSDCNN) for both the forward and inverse design of three different classes of complex metasurfaces: (a) Arbitrary connecting polygons, (b) Basic pattern combination, and (c) Fully random binary patterns. The performance of each metasurface is evaluated and cross-benchmarked. Dependent on the type of complex metasurfaces, sample size, and DL algorithms used, MSDCNN is able to provide good agreements and can be a faster design tool for complex metasurfaces as compared to the traditional full-wave electromagnetic simulation methods. However, no single universal deep convolutional neural network (DCNN) model can work well for all metasurface classes based on detailed statistical analysis (such as mean, variance, kurtosis, mean squared error). Our findings report important information on the advantages and limitation of current DL models in designing these ultimately complex metasurfaces.
]]></description>
<dc:subject>inverse-problems materials-science electromagnetism engineering-design indistinguishable-from-magic to-write-about consider:genetic-programming consider:sampling</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1c41d151f624/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:electromagnetism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:indistinguishable-from-magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:sampling"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1712.08404">
    <title>[1712.08404] Minimum Cost Feedback Selection in Structured Systems: Hardness and Approximation Algorithm</title>
    <dc:date>2021-10-06T11:14:24+00:00</dc:date>
    <link>https://arxiv.org/abs/1712.08404</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we study output feedback selection in linear time-invariant structured systems. We assume that the inputs and the outputs are dedicated, i.e., each input directly actuates a single state and each output directly senses a single state. Given a structured system with dedicated inputs and outputs and a cost matrix that denotes the cost of each feedback connection, our aim is to select an optimal set of feedback connections such that the closed-loop system satisfies arbitrary pole-placement. This problem is referred to as the optimal feedback selection problem for dedicated i/o. We first prove the NP-hardness of the problem using a reduction from a well known NP-hard problem, the weighted set cover problem. In addition, we also prove that the optimal feedback selection problem for dedicated i/o is inapproximable to a constant factor of log n, where n denotes the system dimension. To this end, we propose an algorithm to find an approximate solution to the optimal feedback selection problem for dedicated i/o. The proposed algorithm consists of a potential function incorporated with a greedy scheme and attains a solution with a guaranteed approximation ratio. Then we consider two special network topologies of practical importance, referred to as back-edge feedback structure and hierarchical networks. For the first case, which is NP-hard and inapproximable to a multiplicative factor of log n, we provide a (log n)-approximate solution, where n denotes the system dimension. For hierarchical networks, we give a dynamic programming based algorithm to obtain an optimal solution in polynomial time.
]]></description>
<dc:subject>engineering-design network-theory cybernetics machine-learning optimization feedback to-understand to-simulate consider:multiobjective-optimziation consider:lexicase</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:756fc87ef06b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:network-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cybernetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feedback"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:multiobjective-optimziation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:lexicase"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2105.10846">
    <title>[2105.10846] Transient degrees of freedom and stability</title>
    <dc:date>2021-08-01T12:08:58+00:00</dc:date>
    <link>https://arxiv.org/abs/2105.10846</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The mechanical stability of a physical system plays a crucial role in determining its excitations and response to strain. Recent advances have led to protocols that can create particularly stable amorphous solids. Such systems, whether they be physical systems created using vapor-deposition or numerical model systems created using swap or breathing algorithms, exist in exceptionally deep energy minima marked by the absence of low-frequency quasilocalized modes. We introduce new numerical protocols for creating stable jammed packings that first introduce and subsequently remove degrees of freedom such as particle sizes or particle stiffnesses. We find that different choices for the degrees of freedom can lead to very different results. For jammed packings, degrees of freedom that couple to the jamming transition, e.g., particle sizes, push the system to much more stable and deeper energy minima than those that only couple to interaction stiffnesses.
]]></description>
<dc:subject>granular-materials engineering-design emergent-design rather-interesting biologically-inspired materials-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:446fd5dd579c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergent-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biologically-inspired"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dl.acm.org/doi/10.1145/3411764.3445653">
    <title>Tools, Tricks, and Hacks: Exploring Novel Digital Fabrication Workflows on #PlotterTwitter | Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems</title>
    <dc:date>2021-07-22T09:54:31+00:00</dc:date>
    <link>https://dl.acm.org/doi/10.1145/3411764.3445653</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[As digital fabrication machines become widespread, online communities have provided space for diverse practitioners to share their work, troubleshoot, and socialize. These communities pioneer increasingly novel fabrication workflows, and it is critical that we understand and conceptualize these workflows beyond traditional manufacturing models. To this end, we conduct a qualitative study of #PlotterTwitter, an online community developing custom hardware and software tools to create artwork with computer-controlled drawing machines known as plotters. We documented and analyzed emergent themes where the traditional interpretation of digital fabrication workflows fails to capture important nuances and nascent directions. We find that #PlotterTwitter makers champion creative exploration of interwoven digital and physical materials over a predictable series of steps. We discuss how this challenges long-running views of digital fabrication and propose design implications for future frameworks and toolkits to account for this breadth of practice.
]]></description>
<dc:subject>the-mangle-in-practice social-networks cultural-dynamics rather-interesting engineering-philosophy engineering-design to-write-about consider:comparison-to-metaheuristics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:47a987bca8f2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cultural-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:comparison-to-metaheuristics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2012.09314">
    <title>[2012.09314] Computational discovery of new 2D materials using deep learning generative models</title>
    <dc:date>2021-07-10T11:10:57+00:00</dc:date>
    <link>https://arxiv.org/abs/2012.09314</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Two dimensional (2D) materials have emerged as promising functional materials with many applications such as semiconductors and photovoltaics because of their unique optoelectronic properties. While several thousand 2D materials have been screened in existing materials databases, discovering new 2D materials remains to be challenging. Herein we propose a deep learning generative model for composition generation combined with random forest based 2D materials classifier to discover new hypothetical 2D materials. Furthermore, a template based element substitution structure prediction approach is developed to predict the crystal structures of a subset of the newly predicted hypothetical formulas, which allows us to confirm their structure stability using DFT calculations. So far, we have discovered 267,489 new potential 2D materials compositions and confirmed twelve 2D/layered materials by DFT formation energy calculation. Our results show that generative machine learning models provide an effective way to explore the vast chemical design space for new 2D materials discovery.
]]></description>
<dc:subject>materials-science emergent-design generative-models rather-interesting deep-learning neural-networks engineering-design</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:86e3cabde474/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergent-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generative-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.sciencedirect.com/science/article/pii/S0097849320300674?casa_token=LFW6qVdwZzwAAAAA:tNXHwiJ2F-7N85WfNm0rADwGnQrliFVK3VUX74GoOWJEsXPoe6_gDR7VdLzd6FE4KRglzXB0Sg">
    <title>Generalized abeille tiles: Topologically interlocked space-filling shapes generated based on fabric symmetries - ScienceDirect</title>
    <dc:date>2021-03-15T20:45:38+00:00</dc:date>
    <link>https://www.sciencedirect.com/science/article/pii/S0097849320300674?casa_token=LFW6qVdwZzwAAAAA:tNXHwiJ2F-7N85WfNm0rADwGnQrliFVK3VUX74GoOWJEsXPoe6_gDR7VdLzd6FE4KRglzXB0Sg</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we present a simple and intuitive approach for designing a new class of space-filling shapes that we call Generalized Abeille Tiles (GATs). GATs are generalizations of Abeille vaults, introduced by the French engineer and architect Joseph Abeille in late 1600s. Our approach is based on two principles. The first principle is the correspondence between structures proposed by Abeille and the symmetries exhibited by woven fabrics. We leverage this correspondence to develop a theoretical framework for GATs beginning with the theory of bi-axial 2-fold woven fabrics. The second principle is the use of Voronoi decomposition with higher dimensional Voronoi sites (curves and surfaces). By configuring these new Voronoi sites based on weave symmetries, we provide a method for constructing GATs. Subsequently, we conduct a comparative structural analysis of GATs as individual shapes as well as tiled assemblies for three different fabric patterns using plain and twill weave patterns. Our analysis reveals interesting relationship between the choice of fabric symmetries and the corresponding distribution of stresses under loads normal to the tiled assemblies.

]]></description>
<dc:subject>tiling rather-interesting engineering-design space-filling 3d to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3c4d8b130fb3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tiling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:space-filling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:3d"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2003.02121">
    <title>[2003.02121] Coding for Polymer-Based Data Storage</title>
    <dc:date>2020-05-23T11:43:48+00:00</dc:date>
    <link>https://arxiv.org/abs/2003.02121</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for both unique string reconstruction and correction of multiple mass errors. We consider two approaches: The first approach pertains to asymmetric errors and it is based on introducing redundancy that scales linearly with the number of errors and logarithmically with the length of the string. The construction allows for the string to be uniquely reconstructed based only on its erroneous substring composition multiset. The key idea behind our unique reconstruction approach is to interleave (shifted) Catalan-Bertrand paths with arbitrary binary strings and "reflect" them so as to force prefixes and suffixes of the same length to have different weights. The asymptotic code rate of the scheme is one, and decoding is accomplished via a simplified version of the backtracking algorithm used for the Turnpike problem. For symmetric errors, we use a polynomial characterization of the mass information and adapt polynomial evaluation code constructions for this setting. In the process, we develop new efficient decoding algorithms for a constant number of composition errors and show that the redundancy of the scheme scales quadratically with the number of errors and logarithmically with the codelength.
]]></description>
<dc:subject>nanotechnology molecular-design engineering-design information-theory rather-interesting robustness material-science compression representation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ff53fad9ad03/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanotechnology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robustness"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:material-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:compression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://inverseprobability.com/talks/notes/intellectual-debt-and-the-death-of-the-programmer.html">
    <title>Intellectual Debt and the Death of the Programmer</title>
    <dc:date>2020-05-05T22:24:02+00:00</dc:date>
    <link>http://inverseprobability.com/talks/notes/intellectual-debt-and-the-death-of-the-programmer.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Technical debt is incurred when complex systems are rapidly deployed without due thought as to how they will be maintained. Intellectual debt is incurred when complex systems are rapidly deployed without due thought to how they’ll be explained. Both problems are pervasive in the design and deployment of large scale algorithmic decision making engines. In this talk we’ll review the origin of the problem, and propose a roadmap for obtaining solutions. It’s a journey that will require collaboration between industry, academia, third sector, and government.

]]></description>
<dc:subject>engineering-design engineering-criticism technical-debt to-read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c3ff3eb4ba13/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-criticism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:technical-debt"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.openscad.org/about.html">
    <title>OpenSCAD - About</title>
    <dc:date>2020-05-04T23:22:56+00:00</dc:date>
    <link>https://www.openscad.org/about.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[OpenSCAD is software for creating solid 3D CAD models. It is free software and available for Linux/UNIX, Windows and Mac OS X. Unlike most free software for creating 3D models (such as Blender) it does not focus on the artistic aspects of 3D modelling but instead on the CAD aspects. Thus it might be the application you are looking for when you are planning to create 3D models of machine parts but pretty sure is not what you are looking for when you are more interested in creating computer-animated movies.
OpenSCAD is not an interactive modeller. Instead it is something like a 3D-compiler that reads in a script file that describes the object and renders the 3D model from this script file. This gives you (the designer) full control over the modelling process and enables you to easily change any step in the modelling process or make designs that are defined by configurable parameters.
OpenSCAD provides two main modelling techniques: First there is constructive solid geometry (aka CSG) and second there is extrusion of 2D outlines. Autocad DXF files can be used as the data exchange format for such 2D outlines. In addition to 2D paths for extrusion it is also possible to read design parameters from DXF files. Besides DXF files OpenSCAD can read and create 3D models in the STL and OFF file formats.
]]></description>
<dc:subject>open-source engineering-design CAD FOSS to-try to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:98dec041c11e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-source"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:CAD"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:FOSS"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-try"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.08559">
    <title>[1904.08559] Design of Communication Systems using Deep Learning: A Variational Inference Perspective</title>
    <dc:date>2020-05-03T12:01:47+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.08559</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Recent research in the design of end to end communication system using deep learning has produced models which can outperform traditional communication schemes. Most of these architectures leveraged autoencoders to design the encoder at the transmitter and decoder at the receiver and train them jointly by modeling transmit symbols as latent codes from the encoder. However, in communication systems, the receiver has to work with noise corrupted versions of transmit symbols. Traditional autoencoders are not designed to work with latent codes corrupted with noise. In this work, we provide a framework to design end to end communication systems which accounts for the existence of noise corrupted transmit symbols. The proposed method uses deep neural architecture. An objective function for optimizing these models is derived based on the concepts of variational inference. Further, domain knowledge such as channel type can be systematically integrated into the objective. Through numerical simulation, the proposed method is shown to consistently produce models with better packing density and achieving it faster in multiple popular channel models as compared to the previous works leveraging deep learning models.
]]></description>
<dc:subject>neural-networks machine-learning engineering-design but-not-GP? to-write-about to-simulate consider:performance-measures</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7ab30d52c9f7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:but-not-GP?"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1901.02950">
    <title>[1901.02950] Spectral Approach to Verifying Non-linear Arithmetic Circuits</title>
    <dc:date>2020-03-20T16:35:16+00:00</dc:date>
    <link>https://arxiv.org/abs/1901.02950</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of polynomial expression; it uses the distribution of coefficients of the monomials to determine the type of arithmetic function under verification. In contrast to previous works, the proof of functional correctness is achieved by computing an algebraic spectrum combined with a local rewriting of word-level polynomials. The speedup is achieved by propagating coefficients through the circuit using And-Inverter Graph (AIG) datastructure. The effectiveness of the method is demonstrated with experiments including standard and Booth multipliers, and other synthesized non-linear arithmetic circuits up to 1024 bits containing over 12 million gates.
]]></description>
<dc:subject>nonlinear-dynamics electronics engineering-design rather-interesting digital-circuits verification testing simulation to-write-about to-simulate consider:genetic-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:86a6958a9054/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:electronics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:digital-circuits"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:verification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:testing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://simjs.com/index.html">
    <title>SIM.JS | Discrete Event Simulation in JavaScript</title>
    <dc:date>2020-01-22T00:47:27+00:00</dc:date>
    <link>http://simjs.com/index.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[SIM.JS is a library for modeling discrete time event systems:

The library provides constructs to create Entities which are the active actors in the system and encapsulates the state and logic of components in a system.
The entities contend for resources, which can be Facilities (services that are requested by entities; supports FIFO, LIFO with preemption and Processor Sharing service disciplines), Buffers (resources that can store finite amount of tokens) and Stores (resources that can store JavaScript objects).
The entities communicate by waiting on Events or by sending Messages.
Statistics recording and analysis is provided by Data Series Statistics (collection of discrete, time-independent observations), Time Series Statistics (collection of discrete, time-dependent observations) and Population Statistics (the behavior of population growth and decline).
SIM.JS also provides a random number generation library to generate seeded random variates from various distributions, including uniform, exponential, normal, gamma, pareto and others.
]]></description>
<dc:subject>discrete-event-simulator library javascript to-try simulation engineering-design prediction optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e6db3adfa73e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:discrete-event-simulator"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:javascript"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-try"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/dg-ga/9702001">
    <title>[dg-ga/9702001] On Distortion and Thickness of Knots</title>
    <dc:date>2020-01-19T13:58:02+00:00</dc:date>
    <link>https://arxiv.org/abs/dg-ga/9702001</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[What length of rope (of given diameter) is required to tie a particular knot? To answer this question, we define some new notions of thickness for a space curve, one based on Gromov's distortion, and another generalizing the thickness of Litherland, Simon et al. We prove a basic inequality between these thickness measures, and show that the distortion thickness is upper semi-continuous in the C^0 topology, suggesting that shortest curves of thickness 1 should exist in each knot class.
]]></description>
<dc:subject>knot-theory relax-your-assumptions rather-interesting physicality out-of-the-box to-simulate to-write-about engineering-design computational-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5769e105f4be/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:relax-your-assumptions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physicality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1804.01804">
    <title>[1804.01804] A jigsaw puzzle metamaterial concept</title>
    <dc:date>2020-01-10T20:18:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1804.01804</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A concept of a planar modular mechanical metamaterial inspired by the nature's principle of local adaptivity is proposed. The metamaterial consists of identical pieces similar to jigsaw puzzle tiles. Their rotation within assembly provides a substantial flexibility in terms of structural behavior and mechanical interlocks enable reassembly. The tile design with a diagonal elliptical opening allows us to vary elastic properties--from stiff to compliant, with positive, zero, or negative Poisson's ratio. The outcomes of experimental testing on additively manufactured specimens confirm that the assembly properties can be accurately designed using optimization approaches with finite element analysis at heart.
]]></description>
<dc:subject>metamaterials engineering-design rather-interesting biological-engineering simulation looking-to-see to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5aa957309126/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biological-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1905.12890">
    <title>[1905.12890] An Introduction to Engineering Multiagent Industrial Symbiosis Systems: Potentials and Challenges</title>
    <dc:date>2019-12-29T11:02:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1905.12890</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Multiagent Systems (MAS) research reached a maturity to be confidently applied to real-life complex problems. Successful application of MAS methods for behavior modeling, strategic reasoning, and decentralized governance, encouraged us to focus on applicability of MAS techniques in a class of industrial systems and to elaborate on potentials and challenges for method integration/contextualization. We direct attention towards a form of industrial practices called Industrial Symbiosis Systems (ISS) as a highly dynamic domain of application for MAS techniques. In ISS, firms aim to reduce their material and energy footprint by circulating reusable resources among the members. To enable systematic reasoning about ISS behavior and support firms' (as well as ISS designers') decisions, we see the opportunity for marrying industrial engineering with engineering multiagent systems. This enables introducing (1) representation frameworks to reason about dynamics of ISS, (2) operational semantics to develop computational models for ISS, and (3) coordination mechanisms to enforce desirable ISS behaviors. We argue for applicability and expressiveness of resource-bounded formalisms and norm-aware mechanisms for the design and deployment of ISS practices. In this proposal, we elaborate on different dimensions of ISS, present a methodological foundation for ISS development, and finally discuss open problems.
]]></description>
<dc:subject>emergent-design engineering-design philosophy-of-engineering rather-interesting to-write-about to-amplify consider:machine-learning consider:feedback agent-based</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8969c12a9b80/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergent-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-amplify"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feedback"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.04240">
    <title>[1909.04240] Neural reparameterization improves structural optimization</title>
    <dc:date>2019-11-03T18:38:56+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.04240</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Structural optimization is a popular method for designing objects such as bridge trusses, airplane wings, and optical devices. Unfortunately, the quality of solutions depends heavily on how the problem is parameterized. In this paper, we propose using the implicit bias over functions induced by neural networks to improve the parameterization of structural optimization. Rather than directly optimizing densities on a grid, we instead optimize the parameters of a neural network which outputs those densities. This reparameterization leads to different and often better solutions. On a selection of 116 structural optimization tasks, our approach produces the best design 50% more often than the best baseline method.
]]></description>
<dc:subject>engineering-design machine-learning neural-networks rather-odd rather-interesting you-can-use-a-hammer-to-drive-a-screw-if-you-try-real-hard</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1fe30bab4727/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-odd"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:you-can-use-a-hammer-to-drive-a-screw-if-you-try-real-hard"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.amnh.org/research/paleontology/collections/fossil-invertebrate-collection/trilobite-website/the-trilobite-files/trilobite-eyes">
    <title>Trilobite Eyes | AMNH</title>
    <dc:date>2019-11-03T17:08:58+00:00</dc:date>
    <link>https://www.amnh.org/research/paleontology/collections/fossil-invertebrate-collection/trilobite-website/the-trilobite-files/trilobite-eyes</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[      Few morphological features in the entire fossil record are as singularly significant as trilobite eyes. By the time the initial members of the trilobite line appeared early in the Cambrian, slightly more than 520 million years ago, many of those arthropods already featured highly developed eyes -- marking them as the first creatures to leave behind fossil evidence of such a major evolutionary advance. 
]]></description>
<dc:subject>biodiversity fossils evolutionary-biology biological-engineering engineering-design to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3d077d19b423/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biodiversity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fossils"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biological-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.10140#">
    <title>[1909.10140] A new coefficient of correlation</title>
    <dc:date>2019-09-28T10:45:13+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.10140#</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Is it possible to define a coefficient of correlation which is (a) as simple as the classical coefficients like Pearson's correlation or Spearman's correlation, and yet (b) consistently estimates some simple and interpretable measure of the degree of dependence between the variables, which is 0 if and only if the variables are independent and 1 if and only if one is a measurable function of the other, and (c) has a simple asymptotic theory under the hypothesis of independence, like the classical coefficients? This article answers this question in the affirmative, by producing such a coefficient. No assumptions are needed on the distributions of the variables. There are several coefficients in the literature that converge to 0 if and only if the variables are independent, but none that satisfy any of the other properties mentioned above.
]]></description>
<dc:subject>statistics algorithms rather-interesting engineering-design performance-measure define-your-terms to-simulate to-write-about consider:rediscovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:56410294020d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:rediscovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/math/0402212">
    <title>[math/0402212] Criticality for the Gehring link problem</title>
    <dc:date>2019-09-11T11:51:30+00:00</dc:date>
    <link>https://arxiv.org/abs/math/0402212</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy class: we prove ropelength minimizers exist and introduce a theory of ropelength criticality. 
Our balance criterion is a set of necessary and sufficient conditions for criticality, based on a strengthened, infinite-dimensional version of the Kuhn--Tucker theorem. We use this to prove that every critical link is C^1 with finite total curvature. The balance criterion also allows us to explicitly describe critical configurations (and presumed minimizers) for many links including the Borromean rings. We also exhibit a surprising critical configuration for two clasped ropes: near their tips the curvature is unbounded and a small gap appears between the two components. These examples reveal the depth and richness hidden in Gehring's problem and our natural extension.
]]></description>
<dc:subject>rather-interesting knot-theory optimization numerical-methods engineering-design performance-measure to-write-about to-simulate consider:constraint-satisfaction consider:feature-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1f431e5bdb57/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.05610">
    <title>[1908.05610] A Gordian Pair of Links</title>
    <dc:date>2019-09-07T11:33:25+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.05610</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We construct a pair of isotopic link configurations that are not thick isotopic while preserving total length.
]]></description>
<dc:subject>knot-theory first-examples rather-interesting looking-to-see constraint-satisfaction engineering-design topology to-understand to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8da454df446b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:first-examples"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1806.04236">
    <title>[1806.04236] &quot;AIded with emotions&quot; - a new design approach towards affective computer systems</title>
    <dc:date>2019-08-30T10:45:19+00:00</dc:date>
    <link>https://arxiv.org/abs/1806.04236</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[As technologies become more and more pervasive, there is a need for considering the affective dimension of interaction with computer systems to make them more human-like. Current demands for this matter include accurate emotion recognition, reliable emotion modeling, and use of unobtrusive, easily accessible and preferably wearable measurement devices. While AI methods provide many possibilities for better affective information processing, it is not a common scenario for both emotion recognition and modeling to be integrated in the design phase. To address this concern, we propose a new approach based on affective design patterns in the context of video games, together with summary of experiments conducted to test the preliminary hypotheses.
]]></description>
<dc:subject>affective-computing games engineering-design emotions performance-measure rather-interesting to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e3cf7d5cff67/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:affective-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emotions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.11214">
    <title>[1902.11214] A Multilayer Structure Facilitates the Production of Antifragile Systems in Boolean Network Models</title>
    <dc:date>2019-08-06T13:54:14+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.11214</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Antifragility is a property to not only resist stress and but also to benefit from it. Even though antifragile dynamics are found in various real-world complex systems where multiple subsystems interact with each other, the attribute has not been quantitatively explored yet in those complex systems which can be regarded as multilayer networks. Here we study how the multilayer structure affects the antifragility of the whole system. By comparing single-layer and multilayer Boolean networks based on our recently proposed antifragility measure, we found that the multilayer structure facilitated the production of antifragile systems. Our measure and findings can be utilized for many applications from understanding properties of biological systems with multilayer structures to designing more antifragile engineered systems.
]]></description>
<dc:subject>Talebism Kauffmania boolean-networks automata engineering-design emergent-design to-write-about to-clean-up performance-measure meh an-abstraction-doing-a-bit-too-much-work</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9d47bec73e73/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Talebism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Kauffmania"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:boolean-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergent-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-clean-up"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:meh"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:an-abstraction-doing-a-bit-too-much-work"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1107.5667">
    <title>[1107.5667] Fractal bodies invisible in 2 and 3 directions</title>
    <dc:date>2019-08-06T09:33:09+00:00</dc:date>
    <link>https://arxiv.org/abs/1107.5667</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We study the problem of invisibility for bodies with a mirror surface in the framework of geometrical optics. We show that for any two given directions it is possible to construct a two-dimensional fractal body invisible in these directions. Moreover, there exists a three-dimensional fractal body invisible in three orthogonal directions. The work continues the previous study in [A. Aleksenko and A. Plakhov. Bodies of zero resistance and bodies invisible in one direction. Nonlinearity 22, 1247-1258 (2009)], [A Plakhov and V Roshchina. Invisibility in billiards. Nonlinearity 24, 847-854 (2011)], where two-dimensional bodies invisible in one direction and three-dimensional bodies invisible in one and two orthogonal directions were constructed.
]]></description>
<dc:subject>constraint-satisfaction billiards rather-interesting engineering-design open-problems performance-measure looking-to-see to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9a9259cb727d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:billiards"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ddd.fit.cvut.cz/prj/Benchmarks/index.php?page=download">
    <title>Collection of Digital Design Benchmarks</title>
    <dc:date>2019-07-29T11:03:27+00:00</dc:date>
    <link>https://ddd.fit.cvut.cz/prj/Benchmarks/index.php?page=download</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Collection of Digital Design Benchmarks]]></description>
<dc:subject>benchmarking engineering-design circuits genetic-programming constraint-satisfaction performance-measure to-write-about boolean-networks</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:db5180be6a39/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:benchmarking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:circuits"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:boolean-networks"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/0911.1984">
    <title>[0911.1984] Perfect Retroreflectors and Billiard Dynamics</title>
    <dc:date>2019-07-24T11:18:16+00:00</dc:date>
    <link>https://arxiv.org/abs/0911.1984</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We construct semi-infinite billiard domains which reverse the direction of most incoming particles. We prove that almost all particles will leave the open billiard domain after a finite number of reflections. Moreover, with high probability the exit velocity is exactly opposite to the entrance velocity, and the particle's exit point is arbitrarily close to its initial position. The method is based on asymptotic analysis of statistics of entrance times to a small interval for irrational circle rotations. The rescaled entrance times have a limiting distribution in a limit when the number of iterates tends to infinity and the length of the interval vanishes. The proof of the main results follows from the study of related limiting distributions and their regularity properties.
]]></description>
<dc:subject>billiards plane-geometry dynamical-systems engineering-design rather-interesting existence-proof to-write-about consider:looking-to-see to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d09333590656/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:billiards"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:plane-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:existence-proof"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1710.08485">
    <title>[1710.08485] Making Faces: Universal Inverse Design of Surfaces with Thin Nematic Elastomer Sheets</title>
    <dc:date>2019-07-14T12:55:53+00:00</dc:date>
    <link>https://arxiv.org/abs/1710.08485</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Programmable shape-shifting materials can take different physical forms to achieve multifunctionality in a dynamic and controllable manner. Although morphing a shape from 2D to 3D via programmed inhomogeneous local deformations has been demonstrated in various ways, the inverse problem -- programming a sheet to take an arbitrary desired 3D shape -- is much harder yet critical to realize specific functions. Here, we address this inverse problem in thin liquid crystal elastomer (LCE) sheets, where the shape is preprogrammed by precise and local control of the molecular orientation of the liquid crystal monomers. We show how blueprints for arbitrary surface geometries as well as local extrinsic curvatures can be generated using approximate numerical methods. Backed by faithfully alignable and rapidly lockable LCE chemistry, we precisely embed our designs in LCE sheets using advanced top-down microfabrication techniques. We thus successfully produce flat sheets that, upon thermal activation, take an arbitrary desired shape, such as a face. The general design principles presented here for creating an arbitrary 3D shape will allow for exploration of unmet needs in flexible electronics, metamaterials, aerospace and medical devices, and more.
]]></description>
<dc:subject>materials-science indistinguishable-from-magic inverse-problems origami self-assembly engineering-design to-write-about rather-interesting consider:genetic-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:4004dc5a9364/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:indistinguishable-from-magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-assembly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dl.acm.org/citation.cfm?id=264996">
    <title>A survey of Boolean matching techniques for library binding</title>
    <dc:date>2019-06-27T10:52:03+00:00</dc:date>
    <link>https://dl.acm.org/citation.cfm?id=264996</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[When binding a logic network to a set of cells, a fundamental problem is recognizing whether a cell can implement a portion of the network. Boolean matching means solving this task using a formalism based on Boolean algebra. In its simplest form, Boolean matching can be posed as a tautology check. We review several approaches to Boolean matching as well as to its generalization to cases involving don't care conditions and its restriction to specific libraries such as those typical of anti-fuse based FPGAs. We then present a general formulation of Boolean matching supporting multiple-output logic cells.
]]></description>
<dc:subject>Boolean-functions inverse-problems rather-odd machine-learning information-theory engineering-design representation nudge-targets to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:67c631359897/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Boolean-functions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-odd"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1802.03548">
    <title>[1802.03548] Constructing first-principles phase diagrams of amorphous LixSi using machine-learning-assisted sampling with an evolutionary algorithm</title>
    <dc:date>2019-06-12T13:15:04+00:00</dc:date>
    <link>https://arxiv.org/abs/1802.03548</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The atomistic modeling of amorphous materials requires structure sizes and sampling statistics that are challenging to achieve with first-principles methods. Here, we propose a methodology to speed up the sampling of amorphous and disordered materials using a combination of a genetic algorithm and a specialized machine-learning potential based on artificial neural networks (ANN). We show for the example of the amorphous LiSi alloy that around 1,000 first-principles calculations are sufficient for the ANN potential assisted sampling of low-energy atomic configurations in the entire amorphous LixSi phase space. The obtained phase diagram is validated by comparison with the results from an extensive sampling of LixSi configurations using molecular dynamics simulations and a general ANN potential trained to ~45,000 first-principles calculations. This demonstrates the utility of the approach for the first-principles modeling of amorphous materials.
]]></description>
<dc:subject>metaheuristics materials-science engineering-design molecular-design rather-interesting simulation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8a0bb15c5572/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1808.00626">
    <title>[1808.00626] Slender Origami with Complex 3D Folding Shapes</title>
    <dc:date>2019-06-12T11:25:48+00:00</dc:date>
    <link>https://arxiv.org/abs/1808.00626</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[One-dimensional slender bodies can be deformed or shaped into spatially complex curves relatively easily due to their inherent compliance. However, traditional methods of fabricating complex spatial shapes are cumbersome, prone to error accumulation and not amenable to elegant programmability. In this letter, we introduce a one-dimensional origami based on attaching Miura-ori that can fold into various programmed two or three-dimensional shapes. We study the out-of-plane displacement characteristics of this origami and demonstrate with examples, design of slender bodies that conform to programmed complex spatial curves. Our study provides a new, accurate, and single actuation solution of shape programmability.
]]></description>
<dc:subject>origami engineering-design nanotechnology materials-science self-assembly rather-interesting to-write-about representation out-of-the-box constraint-satisfaction constraint-sidestepping</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9e38631aedf6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanotechnology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-assembly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-sidestepping"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1605.02681">
    <title>[1605.02681] Programming complex shapes in thin nematic elastomer and glass sheets</title>
    <dc:date>2019-06-12T11:20:33+00:00</dc:date>
    <link>https://arxiv.org/abs/1605.02681</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Nematic elastomers and glasses are solids that display spontaneous distortion under external stimuli. Recent advances in the synthesis of sheets with controlled heterogeneities have enabled their actuation into non-trivial shapes with unprecedented energy density. Thus, these have emerged as powerful candidates for soft actuators. To further this potential, we introduce the key metric constraint which governs shape changing actuation in these sheets. We then highlight the richness of shapes amenable to this constraint through two broad classes of examples which we term nonisometric origami and lifted surfaces. Finally, we comment on the derivation of the metric constraint, which arises from energy minimization in the interplay of stretching, bending and heterogeneity in these sheets.
]]></description>
<dc:subject>materials-science engineering-design origami self-assembly indistinguishable-from-magic to-write-about to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0c9c786d943d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-assembly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:indistinguishable-from-magic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1005.3466">
    <title>[1005.3466] Mathematical retroreflectors</title>
    <dc:date>2019-05-06T11:49:40+00:00</dc:date>
    <link>https://arxiv.org/abs/1005.3466</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Retroreflectors are optical devices that reverse the direction of incident beams of light. Here we present a collection of billiard type retroreflectors consisting of four objects; three of them are asymptotically perfect retroreflectors, and the fourth one is a retroreflector which is very close to perfect. Three objects of the collection have recently been discovered and published or submitted for publication. The fourth object - notched angle - is a new one; a proof of its retroreflectivity is given.
]]></description>
<dc:subject>dynamical-systems engineering-design rather-interesting performance-measure approximation to-write-about to-simulate consider:looking-to-see nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d065bf2582b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1804.06483">
    <title>[1804.06483] On Rigid Origami II: Quadrilateral Creased Papers</title>
    <dc:date>2019-05-04T13:50:49+00:00</dc:date>
    <link>https://arxiv.org/abs/1804.06483</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper describes several new variations of large rigid-foldable quadrilateral creased papers, which are generated by "stitching" together rigid-foldable Kokotsakis quadrilaterals. These creased papers are constructed with the following additional requirements: (a) There is at least one rigid folding motion for which no folding angle remains constant. (b) The quadrilateral creased paper is infinitely extendable in both longitudinal and transverse directions. (c) The sector angles, which define the crease directions, can be solved quadrilateral by quadrilateral. This work is based on a nearly complete classification of rigid-foldable Kokotsakis quadrilaterals from Ivan Izmestiev. All quadrilateral creased papers described in this paper have one degree of freedom in each branch of their rigid folding motion.
]]></description>
<dc:subject>origami engineering-design rather-interesting geometry materials-science kinematics planning to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e6ccf02ba6ef/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:kinematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.10835">
    <title>[1902.10835] Keeping it Together: Interleaved Kirigami Extension Assembly</title>
    <dc:date>2019-05-04T12:10:26+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.10835</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through overfolding paper while, in the latter, the paper topology is modified. Here we propose a hybrid approach that relies upon overlapped flaps that create in-plane compression resulting in the formation of "virtual" elastic shells. Not only are these structures self-supporting, but they have colossal load-to-weight ratios of order 10000.
]]></description>
<dc:subject>origami kirigami engineering-design rather-interesting metamaterials to-write-about materials-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:252e41107f7b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:kirigami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1808.06271">
    <title>[1808.06271] Transforming mesoscale granular plasticity through particle shape</title>
    <dc:date>2019-05-02T08:55:06+00:00</dc:date>
    <link>https://arxiv.org/abs/1808.06271</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[When an amorphous material is strained beyond the point of yielding it enters a state of continual reconfiguration via dissipative, avalanche-like slip events that relieve built-up local stress. However, how the statistics of such events depend on local interactions among the constituent units remains debated. To address this we perform experiments on granular material in which we use particle shape to vary the interactions systematically. Granular material, confined under constant pressure boundary conditions, is uniaxially compressed while stress is measured and internal rearrangements are imaged with x-rays. We introduce volatility, a quantity from economic theory, as a powerful new tool to quantify the magnitude of stress fluctuations, finding systematic, shape-dependent trends. For all 22 investigated shapes the magnitude s of relaxation events is well-fit by a truncated power law distribution P(s)∼s−τexp(−s/s∗), as has been proposed within the context of plasticity models. The power law exponent τ for all shapes tested clusters around τ= 1.5, within experimental uncertainty covering the range 1.3 - 1.7. The shape independence of τ and its compatibility with mean field models indicate that the granularity of the system, but not particle shape, modifies the stress redistribution after a slip event away from that of continuum elasticity. Meanwhile, the characteristic maximum event size s∗ changes by two orders of magnitude and tracks the shape dependence of volatility. Particle shape in granular materials is therefore a powerful new factor influencing the distance at which an amorphous system operates from scale-free criticality. These experimental results are not captured by current models and suggest a need to reexamine the mechanisms driving mesoscale plastic deformation in amorphous systems.
]]></description>
<dc:subject>granular-materials condensed-matter rather-interesting looking-to-see experiment engineering-design consider:simulation consider:performance-measures complexology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ae5ff6a5ef63/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:condensed-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1811.06889">
    <title>[1811.06889] On the Complexity of Exploration in Goal-Driven Navigation</title>
    <dc:date>2019-04-23T10:47:00+00:00</dc:date>
    <link>https://arxiv.org/abs/1811.06889</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Building agents that can explore their environments intelligently is a challenging open problem. In this paper, we make a step towards understanding how a hierarchical design of the agent's policy can affect its exploration capabilities. First, we design EscapeRoom environments, where the agent must figure out how to navigate to the exit by accomplishing a number of intermediate tasks (\emph{subgoals}), such as finding keys or opening doors. Our environments are procedurally generated and vary in complexity, which can be controlled by the number of subgoals and relationships between them. Next, we propose to measure the complexity of each environment by constructing dependency graphs between the goals and analytically computing \emph{hitting times} of a random walk in the graph. We empirically evaluate Proximal Policy Optimization (PPO) with sparse and shaped rewards, a variation of policy sketches, and a hierarchical version of PPO (called HiPPO) akin to h-DQN. We show that analytically estimated \emph{hitting time} in goal dependency graphs is an informative metric of the environment complexity. We conjecture that the result should hold for environments other than navigation. Finally, we show that solving environments beyond certain level of complexity requires hierarchical approaches.
]]></description>
<dc:subject>exploration-and-exploitation agents machine-learning learning-by-doing engineering-design planning rather-interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2c2610386ee8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:exploration-and-exploitation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agents"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:learning-by-doing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1807.06498">
    <title>[1807.06498] Multistable Kirigami for Tunable Architected Materials</title>
    <dc:date>2019-04-15T10:54:04+00:00</dc:date>
    <link>https://arxiv.org/abs/1807.06498</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In nature, materials such as ferroelastics and multiferroics can switch their microstructure in response to external stimuli, and this reconfiguration causes a simultaneous modulation of its material properties. Rapid prototyping technologies have enabled origami and kirigami-inspired architected materials to provide a means for designing shape-shifting structures, and here we show how multistable structures inspired by kirigami provide novel design criteria for preparing mechanical metamaterials with tunable properties. By changing the geometry of kirigami unit cells, we obtain multistable kirigami lattice structures endowed with a bistable snap-through mechanism. We demonstrate the precise control of material stiffness, along with the ability to tune this property in situ by locally and reversibly switching the unit cell configurations. We anticipate these mechanical metamaterials will provide a platform to achieve in situ tunable electrical, optical, and mechanical properties for a variety of applications in multifunctional materials, two-dimensional materials, and soft robotics.
]]></description>
<dc:subject>materials-science metamaterials origami rather-interesting engineering-design looking-to-see nonlinear-dynamics kinetics to-write-about consider:simulation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0ed04a4fff7f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:kinetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1903.11995">
    <title>[1903.11995] Computational Design of the Rare-Earth Reduced Permanent Magnets</title>
    <dc:date>2019-04-14T11:23:50+00:00</dc:date>
    <link>https://arxiv.org/abs/1903.11995</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Multiscale simulation is a key research tool for the quest for new permanent magnets. Starting with first principles methods, a sequence of simulation methods can be applied to calculate the maximum possible coercive field and expected energy density product of a magnet made from a novel magnetic material composition. Fe-rich magnetic phases suitable for permanent magnets can be found by adaptive genetic algorithms. The intrinsic properties computed by ab initio simulations are used as input for micromagnetic simulations of the hysteresis properties of permanent magnets with realistic structure. Using machine learning techniques, the magnet's structure can be optimized so that the upper limits for coercivity and energy density product for a given phase can be estimated. Structure property relations of synthetic permanent magnets were computed for several candidate hard magnetic phases. The following pairs (coercive field (T), energy density product (kJ/m3)) were obtained for Fe3Sn0.75Sb0.25: (0.49, 290), L10 FeNi: (1, 400), CoFe6Ta: (0.87, 425), and MnAl: (0.53, 80).
]]></description>
<dc:subject>materials-science engineering-design rather-interesting optimization computational-methods simulation multiobjective-optimization to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:16b0128c0fd7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1510.07499">
    <title>[1510.07499] An example of geometric origami design with benefit of graph enumeration algorithms</title>
    <dc:date>2019-03-29T12:07:59+00:00</dc:date>
    <link>https://arxiv.org/abs/1510.07499</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from brute force enumeration, up to the equivalence to a dedicated problem in graph theory. This leads to algorithms starting from an untractable case on modern computers, up to a run of few seconds on a portable personal computer. This emphasizes the need for a prior analysis by humans before considering the assistance of computers for complex design problems. The graph problem is an enumeration of spanning trees from a grid graph, leading to a coarse scale description of the topology of the paper edge on the flat-folded state.
]]></description>
<dc:subject>computational-geometry origami rather-interesting planning algorithms engineering-design looking-to-see approximation combinatorics counting to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:89a9fbc951b2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:origami"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:counting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.redblobgames.com/articles/curved-paths/">
    <title>Curved Paths</title>
    <dc:date>2019-03-24T11:50:36+00:00</dc:date>
    <link>https://www.redblobgames.com/articles/curved-paths/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Piecewise circular curves are used in manufacturing, robotics, and highway engineering, but I haven’t found many online references for them. As with circular arcs, piecewise circular curves can handle offsets, distances, and interpolation. Here are some papers I used to learn about circular arcs, biarcs, and piecewise circular curves:

]]></description>
<dc:subject>game-design mathematics constraint-satisfaction engineering-design rather-interesting aesthetics the-mangle-in-practice representation plane-geometry parametrization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1d9267b8429a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:game-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:aesthetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:plane-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:parametrization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1812.02873">
    <title>[1812.02873] A new multilayer optical film optimal method based on deep q-learning</title>
    <dc:date>2019-03-12T11:08:17+00:00</dc:date>
    <link>https://arxiv.org/abs/1812.02873</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Multi-layer optical film has been found to afford important applications in optical communication, optical absorbers, optical filters, etc. Different algorithms of multi-layer optical film design has been developed, as simplex method, colony algorithm, genetic algorithm. These algorithms rapidly promote the design and manufacture of multi-layer films. However, traditional numerical algorithms of converge to local optimum. This means that the algorithms can not give a global optimal solution to the material researchers. In recent years, due to the rapid development to far artificial intelligence, to optimize optical film structure using AI algorithm has become possible. In this paper, we will introduce a new optical film design algorithm based on the deep Q learning. This model can converge the global optimum of the optical thin film structure, this will greatly improve the design efficiency of multi-layer films.]]></description>
<dc:subject>engineering-design metaheuristics horse-races materials-science machine-learning applications</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d16c5d372e89/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:horse-races"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:applications"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://tunes.org/~iepos/joy.html#cakek">
    <title>The Theory of Concatenative Combinators</title>
    <dc:date>2019-02-23T13:29:09+00:00</dc:date>
    <link>http://tunes.org/~iepos/joy.html#cakek</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This article attempts to outline, in informal terms, a new theory of combinators, related to the theory of Combinatory Logic pioneered by Moses Schonfinkel, Haskell Curry, and others in the 1930s. Although not essential, an understanding of the classical theory of combinators may be helpful (see the links at the bottom of this article for some introductory material to combinators).

This topic is one which no doubt ought to be subjected to the rigor of modern mathematics; there are many theorems from classical combinatory logic (e.g., Church-Rosser) which we conjecture have analogues here. However, what follows is only a rough, but hopefully, friendly, introduction to the subject.

The inspiration for this theory comes from the programming language Joy, designed by Manfred von Thun. It would be very helpful if the reader is basically familiar with Joy. In Joy, data is manipulated through a stack (there are no variables); in this way, it is similar to the programming language FORTH. However, Joy goes one step further and permits (and actively encourages) pushing programs themselves onto the stack, which can then be manipulated just like ordinary data.

In fact, the theory here is basically a subset of Joy in which programs are the only kind of data (i.e., numbers, string literals, and other kinds of data are not part of the theory here). To someone unfamiliar with combinatory logic, it might seem that no useful computations could be done without numbers, but it will soon be seen that numeric data can be simulated using concatenative combinators, just as they could using classical combinators.

]]></description>
<dc:subject>programming-language concatenative-languages Forth Joy engineering-design representation to-write-about ReQ</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9ce3e76086d9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:concatenative-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Forth"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Joy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ReQ"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.socialsciencespace.com/2018/02/nick-seaver-dissecting-algorithmic-organism/">
    <title>Nick Seaver on Dissecting the Algorithmic Organism</title>
    <dc:date>2019-02-10T20:20:11+00:00</dc:date>
    <link>https://www.socialsciencespace.com/2018/02/nick-seaver-dissecting-algorithmic-organism/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[What do you mean by saying “algorithms are multiple”?

Nick Seaver: If we think that algorithms are whatever people say they are, and many people are saying that they’re many different things, then we have an apparent problem: someone’s got to be wrong, right? Not necessarily. In practice, people have different ideas about the systems they’re working with all the time—those definitions and assumptions inform the actions they take, and what you get in the end is a big mess. That mess, where the algorithm simultaneously seems to be many things to many people, is what I mean by it being “multiple.”

]]></description>
<dc:subject>anthropology software-development-is-not-programming engineering-design philosophy-of-engineering have-read interview</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a5cdf82a2622/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:anthropology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development-is-not-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:have-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interview"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1811.09989">
    <title>[1811.09989] The dry history of liquid computers</title>
    <dc:date>2019-01-05T13:49:08+00:00</dc:date>
    <link>https://arxiv.org/abs/1811.09989</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A liquid can be used to represent signals, actuate mechanical computing devices and to modify signals via chemical reactions. We give a brief overview of liquid based computing devices developed over hundreds of years. These include hydraulic calculators, fluidic computers, micro-fluidic devices, droplets, liquid marbles and reaction-diffusion chemical computers.
]]></description>
<dc:subject>nontraditional-computing representation algorithms out-of-the-box review history computer-science engineering-design to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0b3266c41a99/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nontraditional-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:review"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://blog.dshr.org/2018/01/it-isnt-about-technology.html?m=1">
    <title>DSHR's Blog: It Isn't About The Technology</title>
    <dc:date>2018-12-09T12:33:44+00:00</dc:date>
    <link>https://blog.dshr.org/2018/01/it-isnt-about-technology.html?m=1</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In other words, for searches that are profitable, Google has moved all the results it thinks are relevant off the first page and replaced them with results that people have paid to put there. Which is pretty much the definition of "evil" in the famous "don't be evil" slogan notoriously dropped in 2015. I'm pretty sure that no-one at executive level in Google thought that building a paid-search engine was a good idea, but the internal logic of the "slow AI" they built forced them into doing just that.
]]></description>
<dc:subject>federation decentralization social-dynamics corporatism activism engineering-design institutional-design political-economy</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d491304da8d8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:federation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:decentralization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:corporatism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:activism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:institutional-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:political-economy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1806.01387">
    <title>[1806.01387] New And Surprising Ways to Be Mean. Adversarial NPCs with Coupled Empowerment Minimisation</title>
    <dc:date>2018-06-21T10:57:39+00:00</dc:date>
    <link>https://arxiv.org/abs/1806.01387</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Creating Non-Player Characters (NPCs) that can react robustly to unforeseen player behaviour or novel game content is difficult and time-consuming. This hinders the design of believable characters, and the inclusion of NPCs in games that rely heavily on procedural content generation. We have previously addressed this challenge by means of empowerment, a model of intrinsic motivation, and demonstrated how a coupled empowerment maximisation (CEM) policy can yield generic, companion-like behaviour. In this paper, we extend the CEM framework with a minimisation policy to give rise to adversarial behaviour. We conduct a qualitative, exploratory study in a dungeon-crawler game, demonstrating that CEM can exploit the affordances of different content facets in adaptive adversarial behaviour without modifications to the policy. Changes to the level design, underlying mechanics and our character's actions do not threaten our NPC's robustness, but yield new and surprising ways to be mean.
]]></description>
<dc:subject>hey-I-know-this-guy coevolution evolutionary-algorithms engineering-design rather-interesting to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:77a71c66af60/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:hey-I-know-this-guy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:coevolution"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.math.ucdavis.edu/~romik/movingsofa/">
    <title>The moving sofa problem — Dan Romik's home page</title>
    <dc:date>2018-04-04T10:20:46+00:00</dc:date>
    <link>https://www.math.ucdavis.edu/~romik/movingsofa/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The mathematician Leo Moser posed in 1966 the following curious mathematical problem: what is the shape of largest area in the plane that can be moved around a right-angled corner in a two-dimensional hallway of width 1? This question became known as the moving sofa problem, and is still unsolved fifty years after it was first asked.
]]></description>
<dc:subject>mathematical-recreations computational-geometry engineering-design constraint-satisfaction rather-interesting nudge-targets to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1122c3a99f5c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.degruyter.com/view/j/pjbr.2013.4.issue-1/pjbr-2013-0003/pjbr-2013-0003.xml">
    <title>Robot Skill Learning: From Reinforcement Learning to Evolution Strategies : Paladyn, Journal of Behavioral Robotics</title>
    <dc:date>2018-04-02T11:38:41+00:00</dc:date>
    <link>https://www.degruyter.com/view/j/pjbr.2013.4.issue-1/pjbr-2013-0003/pjbr-2013-0003.xml</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Policy improvement methods seek to optimize the parameters of a policy with respect to a utility function. Owing to current trends involving searching in parameter space (rather than action space) and using reward-weighted averaging (rather than gradient estimation), reinforcement learning algorithms for policy improvement, e.g. PoWER and PI2, are now able to learn sophisticated high-dimensional robot skills. A side-effect of these trends has been that, over the last 15 years, reinforcement learning (RL) algorithms have become more and more similar to evolution strategies such as (μW , λ)-ES and CMA-ES. Evolution strategies treat policy improvement as a black-box optimization problem, and thus do not leverage the problem structure, whereas RL algorithms do. In this paper, we demonstrate how two straightforward simplifications to the state-of-the-art RL algorithm PI2 suffice to convert it into the black-box optimization algorithm (μW, λ)-ES. Furthermore, we show that (μW , λ)-ES empirically outperforms PI2 on the tasks in [36]. It is striking that PI2 and (μW , λ)-ES share a common core, and that the simpler algorithm converges faster and leads to similar or lower final costs. We argue that this difference is due to a third trend in robot skill learning: the predominant use of dynamic movement primitives (DMPs). We show how DMPs dramatically simplify the learning problem, and discuss the implications of this for past and future work on policy improvement for robot skill learning

]]></description>
<dc:subject>robotics machine-learning metaheuristics algorithms learning-by-doing engineering-design planning to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d44d476a4be3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:learning-by-doing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1406.1886v1">
    <title>[1406.1886v1] The Z1: Architecture and Algorithms of Konrad Zuse's First Computer</title>
    <dc:date>2018-03-30T11:59:36+00:00</dc:date>
    <link>https://arxiv.org/abs/1406.1886v1</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper provides the first comprehensive description of the Z1, the mechanical computer built by the German inventor Konrad Zuse in Berlin from 1936 to 1938. The paper describes the main structural elements of the machine, the high-level architecture, and the dataflow between components. The computer could perform the four basic arithmetic operations using floating-point numbers. Instructions were read from punched tape. A program consisted of a sequence of arithmetical operations, intermixed with memory store and load instructions, interrupted possibly by input and output operations. Numbers were stored in a mechanical memory. The machine did not include conditional branching in the instruction set. While the architecture of the Z1 is similar to the relay computer Zuse finished in 1941 (the Z3) there are some significant differences. The Z1 implements operations as sequences of microinstructions, as in the Z3, but does not use rotary switches as micro-steppers. The Z1 uses a digital incrementer and a set of conditions which are translated into microinstructions for the exponent and mantissa units, as well as for the memory blocks. Microinstructions select one out of 12 layers in a machine with a 3D mechanical structure of binary mechanical elements. The exception circuits for mantissa zero, necessary for normalized floating-point, were lacking; they were first implemented in the Z3. The information for this article was extracted from careful study of the blueprints drawn by Zuse for the reconstruction of the Z1 for the German Technology Museum in Berlin, from some letters, and from sketches in notebooks. Although the machine has been in exhibition since 1989 (non-operational), no detailed high-level description of the machine's architecture had been available. This paper fills that gap.
]]></description>
<dc:subject>computer history reverse-engineering engineering-design nanohistory to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:af2d5784c545/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reverse-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanohistory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>