@article{1310, abstract = {We derive lower bounds on asymptotic support propagation rates for strong solutions of the Cauchy problem for the thin-film equation. The bounds coincide up to a constant factor with the previously known upper bounds and thus are sharp. Our results hold in case of at most three spatial dimensions and n∈. (1, 2.92). The result is established using weighted backward entropy inequalities with singular weight functions to yield a differential inequality; combined with some entropy production estimates, the optimal rate of propagation is obtained. To the best of our knowledge, these are the first lower bounds on asymptotic support propagation rates for higher-order nonnegativity-preserving parabolic equations.}, author = {Julian Fischer}, journal = {Journal of Differential Equations}, number = {10}, pages = {3127 -- 3149}, publisher = {Academic Press}, title = {{Optimal lower bounds on asymptotic support propagation rates for the thin-film equation}}, doi = {10.1016/j.jde.2013.07.028}, volume = {255}, year = {2013}, } @article{2107, abstract = {We present a method for fabrication-oriented design of actuated deformable characters that allows a user to automatically create physical replicas of digitally designed characters using rapid manufacturing technologies. Given a deformable character and a set of target poses as input, our method computes a small set of actuators along with their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. We approach this problem with a dedicated algorithm that combines finite-element analysis, sparse regularization, and constrained optimization. We validate our pipeline on a set of two- and three-dimensional example characters and present results in simulation and physically-fabricated prototypes.}, author = {Skouras, Mélina and Thomaszewski, Bernhard and Coros, Stelian and Bickel, Bernd and Groß, Markus}, journal = {ACM Transactions on Graphics}, number = {4}, publisher = {ACM}, title = {{Computational design of actuated deformable characters}}, doi = {10.1145/2461912.2461979}, volume = {32}, year = {2013}, } @article{2108, abstract = {We present an interactive design system that allows non-expert users to create animated mechanical characters. Given an articulated character as input, the user iteratively creates an animation by sketching motion curves indicating how different parts of the character should move. For each motion curve, our framework creates an optimized mechanism that reproduces it as closely as possible. The resulting mechanisms are attached to the character and then connected to each other using gear trains, which are created in a semi-automated fashion. The mechanical assemblies generated with our system can be driven with a single input driver, such as a hand-operated crank or an electric motor, and they can be fabricated using rapid prototyping devices. We demonstrate the versatility of our approach by designing a wide range of mechanical characters, several of which we manufactured using 3D printing. While our pipeline is designed for characters driven by planar mechanisms, significant parts of it extend directly to non-planar mechanisms, allowing us to create characters with compelling 3D motions. }, author = {Coros, Stelian and Thomaszewski, Bernhard and Noris, Gioacchino and Sueda, Shinjiro and Forberg, Moira and Sumner, Robert W and Matusik, Wojciech and Bernd Bickel}, journal = {ACM Transactions on Graphics}, number = {4}, publisher = {ACM}, title = {{Computational design of mechanical characters}}, doi = {10.1145/2461912.2461953}, volume = {32}, year = {2013}, } @article{2109, abstract = {Most additive manufacturing technologies work by layering, i.e. slicing the shape and then generating each slice independently. This introduces an anisotropy into the process, often as different accuracies in the tangential and normal directions, but also in terms of other parameters such as build speed or tensile strength and strain. We model this as an anisotropic cubic element. Our approach then finds a compromise between modeling each part of the shape individually in the best possible direction and using one direction for the whole shape part. In particular, we compute an orthogonal basis and consider only the three basis vectors as slice normals (i.e. fabrication directions). Then we optimize a decomposition of the shape along this basis so that each part can be consistently sliced along one of the basis vectors. In simulation, we show that this approach is superior to slicing the whole shape in one direction, only. It also has clear benefits if the shape is larger than the build volume of the available equipment.}, author = {Hildebrand, Kristian and Bernd Bickel and Alexa, Marc}, journal = {Computers and Graphics (Pergamon)}, number = {6}, pages = {669 -- 675}, publisher = {Elsevier}, title = {{Orthogonal slicing for additive manufacturing}}, doi = {10.1016/j.cag.2013.05.011}, volume = {37}, year = {2013}, } @article{2110, abstract = {We present a method for practical physical reproduction and design of homogeneous materials with desired subsurface scattering. Our process uses a collection of different pigments that can be suspended in a clear base material. Our goal is to determine pigment concentrations that best reproduce the appearance and subsurface scattering of a given target material. In order to achieve this task we first fabricate a collection of material samples composed of known mixtures of the available pigments with the base material. We then acquire their reflectance profiles using a custom-built measurement device. We use the same device to measure the reflectance profile of a target material. Based on the database of mappings from pigment concentrations to reflectance profiles, we use an optimization process to compute the concentration of pigments to best replicate the target material appearance. We demonstrate the practicality of our method by reproducing a variety of different translucent materials. We also present a tool that allows the user to explore the range of achievable appearances for a given set of pigments. }, author = {Papas, Marios and Regg, Christian and Jarosz, Wojciech and Bernd Bickel and Jackson, Philip V and Matusik, Wojciech and Marschner, Steve and Groß, Markus S}, journal = {ACM Transactions on Graphics}, number = {4}, publisher = {ACM}, title = {{Fabricating translucent materials using continuous pigment mixtures}}, doi = {10.1145/2461912.2461974}, volume = {32}, year = {2013}, } @article{2111, abstract = {Animated animatronic figures are a unique way to give physical presence to a character. However, their movement and expressions are often limited due to mechanical constraints. In this paper, we propose a complete process for augmenting physical avatars using projector-based illumination, significantly increasing their expressiveness. Given an input animation, the system decomposes the motion into low-frequency motion that can be physically reproduced by the animatronic head and high-frequency details that are added using projected shading. At the core is a spatio-temporal optimization process that compresses the motion in gradient space, ensuring faithful motion replay while respecting the physical limitations of the system. We also propose a complete multi-camera and projection system, including a novel defocused projection and subsurface scattering compensation scheme. The result of our system is a highly expressive physical avatar that features facial details and motion otherwise unattainable due to physical constraints.}, author = {Bermano, Amit H and Bruschweiler, Philipp and Grundhöfer, Anselm and Iwai, Daisuke and Bernd Bickel and Groß, Markus S}, journal = {ACM Transactions on Graphics}, number = {6}, publisher = {ACM}, title = {{Augmenting physical avatars using projector-based illumination}}, doi = {10.1145/2508363.2508416}, volume = {32}, year = {2013}, } @article{21110, abstract = {The NAD(P)H-dependent carbonyl reductase from Candida parapsilosis ATCC 7330 catalyses the asymmetric reduction of ethyl 4-phenyl-2-oxobutanoate to ethyl (R)-4-phenyl-2-hydroxybutanoate, a precursor of angiotensin-converting enzyme inhibitors such as Cilazapril and Benazepril. The carbonyl reductase was expressed in Escherichia coli and purified by GST-affinity and size-exclusion chromatography. Crystals were obtained by the hanging-drop vapour-diffusion method and diffracted to 1.86 Å resolution. The asymmetric unit contained two molecules of carbonyl reductase, with a solvent content of 48%. The structure was solved by molecular replacement using cinnamyl alcohol dehydrogenase from Saccharomyces cerevisiae as a search model.}, author = {Aggarwal, Nidhi and Mandal, Pradeep K and Gautham, Namasivayam and Chadha, Anju}, issn = {1744-3091}, journal = {Acta Crystallographica Section F Structural Biology Communications}, number = {3}, pages = {313--315}, publisher = {International Union of Crystallography}, title = {{Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330}}, doi = {10.1107/s1744309113003667}, volume = {69}, year = {2013}, } @article{2112, abstract = {Force-deformation measurements of cloth exhibit significant hysteresis, and many researchers have identified internal friction as the source of this effect. However, it has not been incorporated into computer animation models of cloth. In this paper, we propose a model of internal friction based on an augmented reparameterization of Dahl's model, and we show that this model provides a good match to several important features of cloth hysteresis even with a minimal set of parameters. We also propose novel parameter estimation procedures that are based on simple and inexpensive setups and need only sparse data, as opposed to the complex hardware and dense data acquisition of previous methods. Finally, we provide an algorithm for the efficient simulation of internal friction, and we demonstrate it on simulation examples that show disparate behavior with and without internal friction.}, author = {Miguel, Eder and Tamstorf, Rasmus and Bradley, Derek J and Schvartzman, Sara C and Thomaszewski, Bernhard and Bernd Bickel and Matusik, Wojciech and Marschner, Steve and Otaduy, Miguel A}, journal = {ACM Transactions on Graphics}, number = {6}, publisher = {ACM}, title = {{Modeling and estimation of internal friction in cloth}}, doi = {10.1145/2508363.2508389 }, volume = {32}, year = {2013}, } @article{2113, abstract = {A new method fabricates custom surface reflectance and spatially varying bidirectional reflectance distribution functions (svBRDFs). Researchers optimize a microgeometry for a range of normal distribution functions and simulate the resulting surface's effective reflectance. Using the simulation's results, they reproduce an input svBRDF's appearance by distributing the microgeometry on the printed material's surface. This method lets people print svBRDFs on planar samples with current 3D printing technology, even with a limited set of printing materials. It extends naturally to printing svBRDFs on arbitrary shapes.}, author = {Rouiller, Olivier and Bernd Bickel and Kautz, Jan and Matusik, Wojciech and Alexa, Marc}, journal = {IEEE Computer Graphics and Applications}, number = {6}, pages = {48 -- 57}, publisher = {IEEE}, title = {{3D printing spatially varying BRDFs}}, doi = {10.1109/MCG.2013.82 }, volume = {33}, year = {2013}, } @article{2114, abstract = {3D printing is considered a disruptive technology with a potentially tremendous socioeconomic impact. The three articles in this special issue illustrate how novel computer graphics approaches are advancing such digital fabrication.}, author = {Bernd Bickel and Alexa, Marc}, journal = {IEEE Computer Graphics and Applications}, number = {6}, pages = {24 -- 25}, publisher = {IEEE}, title = {{Computational aspects of fabrication: Modeling, design and 3d printing}}, doi = {10.1109/MCG.2013.89}, volume = {33}, year = {2013}, } @article{2117, abstract = {We prove new upper and lower bounds for Banach space-valued stochastic integrals with respect to a compensated Poisson random measure. Our estimates apply to Banach spaces with non-trivial martingale (co)type and extend various results in the literature. We also develop a Malliavin framework to interpret Poisson stochastic integrals as vector-valued Skorohod integrals, and prove a Clark-Ocone representation formula.}, author = {Dirksen, Sjoerd and Jan Maas and van Neerven, Jan M}, journal = {Electronic Journal of Probability}, publisher = {Institute of Mathematical Statistics}, title = {{Poisson stochastic integration in Banach spaces}}, doi = {10.1214/EJP.v18-2945 }, volume = {18}, year = {2013}, } @article{2129, abstract = {This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. }, author = {Gigli, Nicola and Jan Maas}, journal = {SIAM Journal on Mathematical Analysis}, number = {2}, pages = {879 -- 899}, publisher = {Society for Industrial and Applied Mathematics }, title = {{Gromov-Hausdorff convergence of discrete transportation metrics}}, doi = {10.1137/120886315 }, volume = {45}, year = {2013}, } @article{2139, abstract = {Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms.}, author = {Mikhail Lemeshko}, journal = {Frontiers Physics}, number = {17}, publisher = {Frontiers Media}, title = {{Manipulating scattering of ultracold atoms with light-induced dissipation}}, doi = {10.3389/fphy.2013.00017}, volume = {1}, year = {2013}, } @inproceedings{2182, abstract = {We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.}, author = {Cerny, Pavol and Henzinger, Thomas A and Radhakrishna, Arjun}, booktitle = {Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language}, location = {Rome, Italy}, pages = {115 -- 128}, publisher = {ACM}, title = {{Quantitative abstraction refinement}}, doi = {10.1145/2429069.2429085}, year = {2013}, } @article{13405, abstract = {We report a method for preparing electrode–molecule–electrode junctions that incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential deprotection of thiol moieties originally carrying two different protecting groups. The azobenzene derivatives retained their switching properties within monolayers and permitted the photocontrol of electrical conductance.}, author = {Ely, Tal and Das, Sanjib and Li, Wenjie and Kundu, Pintu and Tirosh, Einat and Cahen, David and Vilan, Ayelet and Klajn, Rafal}, issn = {1437-2096}, journal = {Synlett}, keywords = {Organic Chemistry}, number = {18}, pages = {2370--2374}, publisher = {Georg Thieme Verlag}, title = {{Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol}}, doi = {10.1055/s-0033-1340087}, volume = {24}, year = {2013}, } @article{13406, abstract = {Dual-responsive nanoparticles are designed by functionalizing magnetic cores with light-responsive ligands. These materials respond to both light and magnetic fields and can be assembled into various higher-order structures, depending on the relative contributions of these two stimuli.}, author = {Das, Sanjib and Ranjan, Priyadarshi and Maiti, Pradipta Sankar and Singh, Gurvinder and Leitus, Gregory and Klajn, Rafal}, issn = {0935-9648}, journal = {Advanced Materials}, keywords = {Mechanical Engineering, Mechanics of Materials, General Materials Science}, number = {3}, pages = {422--426}, publisher = {Wiley}, title = {{Dual-responsive nanoparticles and their self-assembly}}, doi = {10.1002/adma.201201734}, volume = {25}, year = {2013}, } @inproceedings{1374, abstract = {We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.}, author = {Chatterjee, Krishnendu and Fijalkow, Nathanaël}, booktitle = {22nd EACSL Annual Conference on Computer Science Logic}, location = {Torino, Italy}, pages = {181 -- 196}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Infinite-state games with finitary conditions}}, doi = {10.4230/LIPIcs.CSL.2013.181}, volume = {23}, year = {2013}, } @inproceedings{1376, abstract = {We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan and Pavlogiannis, Andreas}, booktitle = {13th International Conference on Formal Methods in Computer-Aided Design}, location = {Portland, OR, United States}, pages = {18 -- 25}, publisher = {IEEE}, title = {{Distributed synthesis for LTL fragments}}, doi = {10.1109/FMCAD.2013.6679386}, year = {2013}, } @phdthesis{1405, abstract = {Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency. First, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point.}, author = {Zufferey, Damien}, issn = {2663-337X}, pages = {134}, publisher = {Institute of Science and Technology Austria}, title = {{Analysis of dynamic message passing programs}}, doi = {10.15479/at:ista:1405}, year = {2013}, } @article{1442, abstract = {We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier transform, the dimensions of the isotypical components of the cohomology of associated Nakajima quiver varieties under the action of a Weyl group. The generating function of the corresponding Poincare polynomials is an extension of Hua's formula for Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The resulting formulae contain a wide range of information on the geometry of the quiver varieties.}, author = {Tamas Hausel and Letellier, Emmanuel and Rodríguez Villegas, Fernando}, journal = {Annals of Mathematics}, number = {3}, pages = {1147 -- 1168}, publisher = {Princeton University Press}, title = {{Positivity for Kac polynomials and DT-invariants of quivers}}, doi = {10.4007/annals.2013.177.3.8}, volume = {177}, year = {2013}, }